New Generation Computing最新文献

{"title":"Physical Zero-Knowledge Proof Protocols for Topswops and Botdrops","authors":"Yuichi Komano, Takaaki Mizuki","doi":"10.1007/s00354-024-00272-3","DOIUrl":"https://doi.org/10.1007/s00354-024-00272-3","url":null,"abstract":"<p>Suppose that a sequence of <span>({varvec{n}})</span> cards, numbered 1 to <span>({varvec{n}})</span>, is placed face up in random order. Let <span>({varvec{k}})</span> be the number on the first card in the sequence. Then take the first <span>({varvec{k}})</span> cards from the sequence, rearrange that subsequence of <span>({varvec{k}})</span> cards in reverse order, and return them to the original sequence. Repeat this prefix reversal until the number on the first card in the sequence becomes 1. This is a one-player card game called Topswops. The computational complexity of Topswops has not been thoroughly investigated. For example, letting <span>({varvec{f}}({varvec{n}}))</span> denote the maximum number of prefix reversals for Topswops with <span>({varvec{n}})</span> cards, values of <span>({varvec{f}}({varvec{n}}))</span> for <span>({varvec{n}}ge 20)</span> remain unknown. In general, there is no known efficient algorithm for finding an initial sequence of <span>({varvec{n}})</span> cards that requires exactly <span>(ell )</span> prefix reversals for any integers <span>({varvec{n}})</span> and <span>({varvec{ell }})</span>. In this paper, using a deck of cards, we propose a physical zero-knowledge proof protocol that allows a prover to convince a verifier that the prover knows an initial sequence of <span>({varvec{n}})</span> cards that requires <span>({varvec{ell }})</span> prefix reversals without leaking knowledge of that sequence. We also deal with Botdrops, a variant of Topswops.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"30 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141770568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Card-Based Protocols for Private Set Intersection and Union","authors":"Anastasiia Doi, Tomoki Ono, Yoshiki Abe, Takeshi Nakai, Kazumasa Shinagawa, Yohei Watanabe, Koji Nuida, Mitsugu Iwamoto","doi":"10.1007/s00354-024-00268-z","DOIUrl":"https://doi.org/10.1007/s00354-024-00268-z","url":null,"abstract":"<p>Card-based cryptography aims to realize secure multiparty computation with physical cards. This paper is the first to address Private Set Intersection (PSI) and Private Set Union (PSU) in card-based cryptography. PSI and PSU are well-studied secure computation protocols to compute the set intersection and the set union, respectively. We show two-party PSI and PSU protocols in each of the two operation models: one is the shuffle-based model in which parties perform all operations publicly, and the other is the private-permutation-based model that allows parties to perform some operations privately. In the shuffle-based model, we show PSI and PSU protocols can be realized with existing secure AND and OR protocols, respectively. However, these protocols have an issue of increasing the number of shuffles depending on the size of the universal set. To resolve the issue, we further propose PSI and PSU protocols with only one shuffle at the cost of increasing the number of cards. In the private-permutation-based model, we show PSI and PSU protocols can be achieved with existing secure AND and OR protocols, respectively, as in the shuffle-based protocols. These protocols have an advantage of requiring only one private permutation and one communication. We further show that the number of cards of these protocols can be reduced at the cost of increasing the number of private permutations and communications.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"158 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141506596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Card-based Cryptography with a Standard Deck of Cards, Revisited: Efficient Protocols in the Private Model","authors":"Takeshi Nakai, Keita Iwanari, Tomoki Ono, Yoshiki Abe, Yohei Watanabe, Mitsugu Iwamoto","doi":"10.1007/s00354-024-00269-y","DOIUrl":"https://doi.org/10.1007/s00354-024-00269-y","url":null,"abstract":"<p>Card-based cryptography is a secure computation protocol realized by using physical cards. There are two models on card-based cryptography: public and private models. We adopt private one that allows players to handle cards privately. While much of the existing works for card-based cryptography use two-colored cards, it is also a vital task to construct an efficient protocol with playing cards. In the public model, 2<i>n</i> cards are necessary for any <i>n</i>-bit input protocol since at least two cards are required to express a Boolean value. It holds true for both two-colored and playing-card settings. On the other hand, the private model enables us to construct a protocol with fewer than 2<i>n</i> cards. However, all existing protocols that achieve such properties are only in the two-colored setting. This paper shows that the private model enables us to construct a protocol with fewer than 2<i>n</i> cards using the playing cards. We first show two-bit input protocols with fewer than four cards for logical operations, AND, OR, and XOR. Furthermore, we show a three-input majority voting protocol using only three cards, which is constructed by combining our AND and OR protocols. Notably, our proposed protocols require no randomness. All operations are deterministic and depend only on players’ private inputs.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"9 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141506597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Printing Protocol: Physical ZKPs for Decomposition Puzzles","authors":"Suthee Ruangwises, Mitsugu Iwamoto","doi":"10.1007/s00354-024-00266-1","DOIUrl":"https://doi.org/10.1007/s00354-024-00266-1","url":null,"abstract":"<p>Decomposition puzzles are pencil-and-paper logic puzzles that involve partitioning a rectangular grid into several regions to satisfy certain rules. In this paper, we construct a generic card-based protocol called <i>printing protocol</i>, which can be used to physically verify solutions of decompositon puzzles. We apply the printing protocol to develop card-based zero-knowledge proof protocols for two such puzzles: Five Cells and Meadows. These protocols allow a prover to physically show that he/she knows solutions of the puzzles without revealing them.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"47 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141529412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved Bivariate-VAR Model for Extraction of Respiratory Information from Artifact Corrupted ECG and PPG Signals","authors":"K. Venu Madhav, E. Hari Krishna, K. Ashoka Reddy","doi":"10.1007/s00354-024-00265-2","DOIUrl":"https://doi.org/10.1007/s00354-024-00265-2","url":null,"abstract":"<p>In general in ICUs, operation theatres, post-operative critical care units, and even ambulatory monitors, the patients are continuously examined with ECG and pulse oximeters PPG. In these situations, where the ECG and/or PPG are afflicted by severe artifacts, the idea of extracting respiratory signal from both ECG and PPG signals rather than from any one of them is tested in this work. As respiratory trend is present in both ECG and PPG signals, the common respiratory trend present in simultaneously recorded ECG and PPG signals is extracted, using a bivariate vector autoregressive modeling (BVAR) technique. This technique effectively reduced the inevitable artifacts and resulted in better estimation of the respiratory activity. For further improving the performance of the BVAR method, in extracting respiratory activity from ECG and PPG signals corrupted with sever artifacts, and also works for broad range of breathing rates, an improved BVAR (IB-VAR) technique is proposed. This technique is robust in the sense that it, firstly, works well even in the presence of various artifacts present in either of the signals, and extracts the signal common to both i.e. respiratory information, with a greater accuracy. Secondly, it also works even for a broad range of breathing rates covering as low as 6 breaths per minute (bpm) to as high as 90 bpm. The novel part of the proposed IB-VAR method is that the respiratory pole lying in that broad breathing range is automatically selected from among all other possible poles, which also include the ones corresponding to noises like motion artifact (MA) and baseline wander (BLW), making use of kurtosis values of extracted signals. An analog front end is developed to record ECG, PPG and respiratory signals with different breathing rates and respiration patterns simultaneously from the volunteers. The method, applied on the recorded data of fifteen healthy subjects, performed extremely well even in the presence of MA and BLW, compared to the well known wavelet based approach. Correlation analysis, done in both frequency and time domains, has shown a high degree of acceptance for the extracted respiratory signal with respect to the original reference respiratory signal. Higher values of accuracy rate (EDR: 98.10 ± 1.45, PDR: 98.45 ± 1.30) and lower values of NRMSE calculations (EDR: − 6.47 ± 4.29, PDR: − 6.50 ± 4.17) clearly confirmed the validity of the extracted respiratory signal. An important finding of this work is that the PPG derived respiratory signal very closely matched with the original than the ECG derived signal.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"33 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141255805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Cellular Automaton Approach for Efficient Computing on Surface Chemical Reaction Networks","authors":"Sihai Yu, Wenli Xu, Jia Lee, Teijiro Isokawa","doi":"10.1007/s00354-024-00262-5","DOIUrl":"https://doi.org/10.1007/s00354-024-00262-5","url":null,"abstract":"<p>A surface chemical reaction network (sCRN, Qian and Winfree in DNA Computing and Molecular Programming: 20th International Conference, DNA 20, Kyoto, Japan, September 22–26, 2014. Proceedings 20. Springer, 2014) is an emergent paradigm for molecular programming, in which a chemical molecule is placed at each site of a lattice, and each molecule may undergo either bi-molecular reactions associated with one of the nearest molecules or uni-molecular reactions autonomously. The lattice structure as well as the localized reactions between molecules facilitate an effective formalization of sCRNs in the framework of cellular automata. This formalism not only allows a systematic evaluation of the complexity of a sCRN, but also enables a formal approach to reduce the model’s complexity for the sake of improving its effectiveness. To this end, this paper proposes a new sCRN model that has less complexity measured in terms of the numbers of both cell states and transition rules. Especially, universality of computations will be shown by implementing all asynchronous circuits, including the well-known full-adder, into the sCRN. The decreased complexity may enhance the feasibility of the proposed sCRN model for physical implementation.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"25 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141255887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Neoteric Segmentation Approach for Lung Ultrasound Images","authors":"Anjelin Genifer Edward Thomas, J. Shiny Duela","doi":"10.1007/s00354-024-00260-7","DOIUrl":"https://doi.org/10.1007/s00354-024-00260-7","url":null,"abstract":"<p>The global surge in reported cases of COVID-19 and the possibility of further outbreaks necessitates the development of new instruments to aid healthcare professionals in the earlier detection and monitoring of patients. Lung Ultrasound (LUS) examination is increasingly being used to detect symptoms of COVID-19 disease, according to growing data from throughout the world. Numerous features of ultrasound imaging make it well-suited for frequent clinical application: LUS may identify lung participation in the initial stages of the disease, is portable enough to be carried around in a protective covering, and can be used for screening in long-term care residences, camps, and other settings out of the clinic when other imaging techniques are not possible. The purpose of this article is to segment the COVID region from LUS. Acquiring LUS image data is the first step in the research workflow, which concludes with validating the segmented model. The COVID region is separated from the LUS region through the use of several pre-processes, including filtering and image enhancement, and the development of a segmentation model, including threshold, region-based, edge-based, and a neoteric segmentation approach. To choose the most effective model, we use the model accuracy.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"70 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141169588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analysis of Signal Distortion in Molecular Communication Channels Using Frequency Response","authors":"Shoichiro Kitada, Taishi Kotsuka, Yutaka Hori","doi":"10.1007/s00354-024-00258-1","DOIUrl":"https://doi.org/10.1007/s00354-024-00258-1","url":null,"abstract":"<p>Molecular communication (MC) is a concept in communication engineering, where diffusive molecules are used to transmit information between nano or micro-scale chemical reaction systems. Engineering MC to control the reaction systems in cells is expected for many applications such as targeted drug delivery and biocomputing. Toward control of the reaction systems as desired via MC, it is important to transmit signals without distortion by MC since the reaction systems are often triggered depending on the concentration of signaling molecules arriving at the cells. In this paper, we propose a method to analyze signal distortion caused by diffusion-based MC channels using frequency response of channels. The proposed method provides indices that quantitatively evaluate the magnitude of distortion and shows parameter conditions of MC channels that suppress signal distortion. Using the proposed method, we demonstrate the design procedure of specific MC channels that satisfy given specifications. Finally, the roles of MC channels in nature are discussed from the perspective of signal distortion.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"100 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141152119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Nature-Inspired Algorithms-Based Optimal Features Selection Strategy for COVID-19 Detection Using Medical Images","authors":"Law Kumar Singh, Munish Khanna, Himanshu Monga, Rekha singh, Gaurav Pandey","doi":"10.1007/s00354-024-00255-4","DOIUrl":"https://doi.org/10.1007/s00354-024-00255-4","url":null,"abstract":"<p>In the case of communicable diseases, such as COVID-19, effective and quick testing techniques make it easier to identify a contaminated person, so that he or she can be easily isolated. To predict COVID-19-infected individuals through chest computed tomography scans, this study suggests an effective feature selection technique incorporated in clinical decision support system that may be used for testing. After pre-processing, we retrieved 213 features from the chest computed tomography images of a public data set with 2482 images. Then, in a two-step process, the most significant features for recognizing the difference between COVID patients and healthy individuals are selected. Initially, the Chi-square test selects 75% of the initial extracted features, which are then forwarded to three nature-inspired computing algorithms: the cuckoo search optimization algorithm, a teaching–learning-based optimization algorithm, and a hybrid of these two for further optimization. The finally selected reduced feature set and five machine learning classifiers are then employed to classify these computed tomography images. Twenty-four experiments using fivefold and tenfold cross-validation have been performed to find the best values for eight statistical efficiency evaluation metrics. Our suggested approach achieves a notable accuracy of 95.99%, the best mean intersection over union of 0.9655, and the highest area under curve of 0.9966. XGBoost delivers more effective, promising, and comparable results when compared to other ML classifiers. Our suggested testing approach will benefit frontline workers and the state by providing routine and cost-effective testing, and faster results.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"43 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140934052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improving the Efficiency of Training Physics-Informed Neural Networks Using Active Learning","authors":"Yuri Aikawa, Naonori Ueda, Toshiyuki Tanaka","doi":"10.1007/s00354-024-00253-6","DOIUrl":"https://doi.org/10.1007/s00354-024-00253-6","url":null,"abstract":"<p>PINN, or physics-informed neural network, is a partial differential equation (PDE) solver realized as a neural network by incorporating the target PDE into the network as physical constraints. In this study, our focus lies in optimizing collocation point selection. We propose an active learning method to enhance the efficiency of PINN learning. The proposed method leverages variational inference based on dropout learning to assess the uncertainty inherent in the solution estimates provided by the PINN. Subsequently, it formulates an acquisition function for active learning grounded in this uncertainty assessment. By employing this acquisition function to probabilistically select collocation points, we can achieve a more expedited convergence to a reasonable solution, as opposed to relying on random sampling. The efficacy of our approach is empirically demonstrated using both Burgers’ equation and the convection equation. We also show experimentally that the choice of the collocation points can affect the loss function, the fitting of initial and boundary conditions, and the sensible balance of PDE constraints.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"47 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}