Search

Extracorporeal life support systems (ECLS) are life-sustaining measures for severe cardiovascular diseases, serving as bridging treatment either until cardiovascular function is restored or alternative treatment, such as heart transplantation or the implantation of permanent ventricular assist devices is performed. Given the insufficient evidence and frequent urgency of implantation without initial patient consent, the ethical challenges and psychological burden for patients, relatives and the interprofessional intensive care team are significant. As with any treatment, an appropriate therapeutic goal for ECLS treatment based on the indications and patient informed consent is mandatory. In order to integrate the necessary ethical considerations into everyday clinical practice, a structured algorithm for handling ECLS is proposed here, which takes ethical aspects into due account. [ABSTRACT FROM AUTHOR]

The gig economy and gig work have grown quickly in recent years and have drawn much attention from researchers in different fields. Because the platform mediated gig economy is a relatively new phenomenon, studies have produced a range of interesting findings; of interest here are the socio‐technical issues that this work has surfaced. This systematic literature review (SLR) provides a snapshot of a range of socio‐technical issues raised in the last 12 years of literature focused on the platform mediated gig economy. Based on a sample of 515 papers gathered from nine databases in multiple disciplines, 132 were coded that specifically studied the gig economy, gig work, and gig workers. Three main socio‐technical themes were identified: (1) the digital workplace, which includes information infrastructure and digital labor that are related to the nature of gig work and the user agency; (2) algorithmic management, which includes platform governance, performance management, information asymmetry, power asymmetry, and system manipulation, relying on a diverse set of technological tools including algorithms and big data analytics; (3) ethical design, as a relevant value set that gig workers expect from the platform, which includes trust, fairness, equality, privacy, and transparency. A social informatics perspective is used to rethink the relationship between gig workers and platforms, extract the socio‐technical issues noted in prior research, and discuss the underexplored aspects of the platform mediated gig economy. The results draw attention to understudied yet critically important socio‐technical issues in the gig economy that suggest short‐ and long‐term opportunities for future research directions. [ABSTRACT FROM AUTHOR]

Traditional federated learning faces challenges such as high communication costs, structural heterogeneity,and insufficient privacy protection. To address these issues, this paper proposes a federated learning evolutionary algorithm that applies sparse evolutionary training algorithm to reduce communication costs and integrates local differential privacy protection for participants’ privacy. Additionally, it utilizes the NSGA-Ⅲ algorithm to optimize the network structure and sparsity of the global federated learning model, adjusting the relationship between data availability and privacy protection. This achieves a balance between the effectiveness, communication costs, and privacy of the global federated learning model. Experimental results under unstable communication environments demonstrate that, on the MNIST and CIFAR-10 datasets, compared to the solution with the lowest error rate using the FNSGA-Ⅲ algorithm, the proposed algorithm improves communication efficiency by 57. 19% and 52. 17%, respectively. The participants also achieved（3. 46, 10-4） and（6. 52, 10-4）-local differential privacy. This algorithm can effectively reduce communication costs and protect participant privacy without significantly compromising the accuracy of the global model. [ABSTRACT FROM AUTHOR]

The rapid development of technology has resulted in a surge in the volume of digital data available. This situation creates a problem for users who need assistance in locating specific information within this massive collection of data, resulting in a time-consuming process. Automatic Text Summarization systems have been developed as a more effective solution than traditional summarization techniques to address this problem and improve user access to relevant information. It is well known that researchers in the health sciences find it difficult to keep up with the latest literature due to their busy schedules. This study aims to produce comprehensive abstracts of Turkish-language scientific papers in the field of health sciences. Although abstracts of scientific papers are already available, more thorough summaries are still needed. To the best of our knowledge, no previous attempt has been made to automatically summarize Turkish language health science papers. For this purpose, a dataset of 105 Turkish papers was collected from DergiPark. Term Frequency, Term Frequency-Inverse Document Frequency, Latent Semantic Analysis, TextRank, and Latent Dirichlet Allocation algorithms were chosen as extractive text summarization methods due to their frequent use in this field. The performance of the text summarization models was evaluated using recall, precision, and F-score metrics, and the algorithms gave satisfactory results for Turkish. [ABSTRACT FROM AUTHOR]

There is increasing focus on applying deep learning methods to electrocardiograms (ECGs), with recent studies showing that neural networks (NNs) can predict future heart failure or atrial fibrillation from the ECG alone. However, large numbers of ECGs are needed to train NNs, and many ECGs are currently only in paper format, which are not suitable for NN training. We developed a fully-automated online ECG digitisation tool to convert scanned paper ECGs into digital signals. Using automated horizontal and vertical anchor point detection, the algorithm automatically segments the ECG image into separate images for the 12 leads and a dynamical morphological algorithm is then applied to extract the signal of interest. We then validated the performance of the algorithm on 515 digital ECGs, of which 45 were printed, scanned and redigitised. The automated digitisation tool achieved 99.0% correlation between the digitised signals and the ground truth ECG (n = 515 standard 3-by-4 ECGs) after excluding ECGs with overlap of lead signals. Without exclusion, the performance of average correlation was from 90 to 97% across the leads on all 3-by-4 ECGs. There was a 97% correlation for 12-by-1 and 3-by-1 ECG formats after excluding ECGs with overlap of lead signals. Without exclusion, the average correlation of some leads in 12-by-1 ECGs was 60–70% and the average correlation of 3-by-1 ECGs achieved 80–90%. ECGs that were printed, scanned, and redigitised, our tool achieved 96% correlation with the original signals. We have developed and validated a fully-automated, user-friendly, online ECG digitisation tool. Unlike other available tools, this does not require any manual segmentation of ECG signals. Our tool can facilitate the rapid and automated digitisation of large repositories of paper ECGs to allow them to be used for deep learning projects. [ABSTRACT FROM AUTHOR]

This research highlights the underestimated significance of cigarette paper as evidence at crime scenes. The primary objective is to distinguish cigarette paper from similar-looking alternatives, addressing the first research objective. The second objective involves identifying cigarette paper brands using attenuated total reflectance Fourier transform infrared (ATR-FTIR) spectroscopy and machine learning (ML) algorithms. Accurate differentiation of cigarette paper from normal paper is emphasized. ATR-FTIR spectroscopy, coupled with principal component analysis (PCA) for dimensionality reduction, is employed for brand identification. Among fifteen ML algorithms compared, the CatBoost classifier excels for both objectives. This research presents a non-destructive, effective method for studying cigarette paper, contributing valuable insights to crime scene investigations. [Display omitted] • Forensic evaluation of cigarette paper utilizing ATR-FTIR spectroscopy and Machine learning algorithms. • Peak characterization and differentiation-distinguishing cigarette paper from other types. • Machine learning algorithm comparison: assessing discrimination across nine cigarette brands. • External validation of the dominant algorithm using unknown samples. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) has the potential to positively impact library and archives collections and services--enhancing reference, instruction, metadata creation, recommendations, and more. However, AI also has ethical implications. This paper presents an extensive literature and review analysis that examines AI projects implemented in library and archives settings, asking the following research questions: RQ1: How is artificial intelligence being used in libraries and archives practice? RQ2: What ethical concerns are being identified and addressed during AI implementation in libraries and archives? The results of this literature review show that AI implementation is growing in libraries and archives and that practitioners are using AI for increasingly varied purposes. We found that AI implementation was most common in large, academic libraries. Materials used in AI projects usually involved digitized and born digital text and images, though materials also ranged to include web archives, electronic theses and dissertations (ETDs), and maps. AI was most often used for metadata extraction and reference and research services. Just over half of the papers included in the literature review mentioned ethics or values related issues in their discussions of AI implementation in libraries and archives, and only one-third of all resources discussed ethical issues beyond technical issues of accuracy and human-in-the-loop. Case studies relating to AI in libraries and archives are on the rise, and we expect subsequent discussions of relevant ethics and values to follow suit, particularly growing in the areas of cost considerations, transparency, reliability, policy and guidelines, bias, social justice, user communities, privacy, consent, accessibility, and access. As AI comes into more common usage, it will benefit the library and archives professions to not only consider ethics when implementing local projects, but to publicly discuss these ethical considerations in shared documentation and publications. [ABSTRACT FROM AUTHOR]

In view of the problems of data sparsity and the diversity in academic paper recom-mender systems,based on CONVNCF, this paper proposed an algorithm of convolution with word and heterogeneous information network for academic paper recommendation ( WN -APR) . Firstly, WN -APR algorithm learned user and paper' s diverse features from different semantics to alleviate the sparsity problem. Then it designed an outer product fusing way to seamlessly combine user features with paper features. Replacing of 2D CNN, this algorithm applied 3 D convolution to mine the influence of different features on the performance. Finally, it modified the BPR loss function to enhance diversity in recommendations. Experimental results on CiteULike-a and CiteULike-t datasets show that WN-APR improves the performance of accuracy and diversity over the baseline models. [ABSTRACT FROM AUTHOR]

Detecting plagiarism in academic papers is crucial for maintaining academic integrity, preserving the originality of published work, and safeguarding intellectual property. While existing applications excel at text plagiarism detection, they fall short when it comes to image plagiarism. This paper introduces a novel algorithm, named "VIBRANT-WALK," designed to detect image plagiarism in academic manuscripts. The challenge of identifying plagiarized images is formidable, requiring a unique approach. Traditional Computer Vision algorithms, proficient in image similarity tasks, face limitations in determining whether an image has been previously used in an article. To address this, the proposed algorithm leverages a repository of all published article pages, focusing on absolute identicality rather than image similarity. The algorithm comprises two stages. In the first stage, a "Vibrancy Matrix" is created through image preprocessing, aiding in contour determination. The second stage involves pixel-by-pixel comparison with images from published manuscripts. To enhance efficiency, the algorithm initiates comparisons from the pixel with the highest score in the Vibrancy Matrix, followed by pixel comparisons through random walks, significantly reducing complexity. To conduct the study, a custom dataset was compiled from 69 research articles, capturing snapshots of each page and figure. Overall, we present 485 unique test cases where we can test the accuracy and efficiency of the algorithm. The lack of publicly available datasets necessitated this approach. The proposed algorithm outperformed the existing models and algorithms in this field by achieving an overall accuracy of 94.8% on the collated dataset, identifying 460 instances of plagiarism out of the 485 test cases. The algorithm also demonstrated a 100% accuracy rate in avoiding false positives. [ABSTRACT FROM AUTHOR]

With the exponential growth in the number of academic researchers, it is crucial for editors of scientific journals to identify the highest-quality papers. While several measures exist to evaluate a paper's impact post-publication, the challenge of determining the potential impact of a manuscript during the review process remains an understudied issue. In this paper, we propose a reviewer-reputation ranking algorithm to identify high-quality papers based on paper citations, where a reviewer's reputation is computed from the correlation between their past ratings and the current number of citations received by the papers they have evaluated. During the review process, reviewers with high reputation scores are given more weight to determine the quality of papers. We test the algorithm on an artificial network with 200 reviewers and 600 papers, as well as on the American Physical Society (APS) data set, including in the analysis 308,243 papers and 274,154 mutual citations. We compare our approach with two existing methods, demonstrating that our algorithm significantly outperforms the others in identifying manuscripts with the highest quality. Our findings can help improve the impact of scientific journals, thereby contributing to academic and scientific progress. • We propose an algorithm to identify the papers with the highest quality from a large number of submissions. • We compare our new algorithm with other existing methods of aggregating user ratings in various online services. • We test our algorithm both with an artificial network and with the empirical data of the APS data set. • We show that our algorithm outperforms the other methods in identifying the papers with the highest quality. [ABSTRACT FROM AUTHOR]

The electrocardiogram (ECG) signal describes the heart's electrical activity, allowing it to detect several health conditions, including cardiac system abnormalities and dysfunctions. Nowadays, most patient medical records are still paper-based, especially those made in past decades. The importance of collecting digitized ECGs is twofold: firstly, all medical applications can be easily implemented with an engineering approach if the ECGs are treated as signals; secondly, paper ECGs can deteriorate over time, therefore a correct evaluation of the patient's clinical evolution is not always guaranteed. The goal of this paper is the realization of an automatic conversion algorithm from paper-based ECGs (images) to digital ECG signals. The algorithm involves a digitization process tested on an image set of 16 subjects, also with pathologies. The quantitative analysis of the digitization method is carried out by evaluating the repeatability and reproducibility of the algorithm. The digitization accuracy is evaluated both on the entire signal and on six ECG time parameters (R-R peak distance, QRS complex duration, QT interval, PQ interval, P-wave duration, and heart rate). Results demonstrate the algorithm efficiency has an average Pearson correlation coefficient of 0.94 and measurement errors of the ECG time parameters are always less than 1 mm. Due to the promising experimental results, the algorithm could be embedded into a graphical interface, becoming a measurement and collection tool for cardiologists. [ABSTRACT FROM AUTHOR]

One of the most widely used measures of scientific impact is the number of citations. However, due to its heavy-tailed distribution, citations are fundamentally difficult to predict but can be improved. This study was aimed at investigating the factors and parts influencing the citation number of a scientific paper in the otology field. Therefore, this work proposes a new solution that utilizes machine learning and natural language processing to process English text and provides a paper citation as the predicted results. Different algorithms are implemented in this solution, such as linear regression, boosted decision tree, decision forest, and neural networks. The application of neural network regression revealed that papers' abstracts have more influence on the citation numbers of otological articles. This new solution has been developed in visual programming using Microsoft Azure machine learning at the back end and Programming Without Coding Technology at the front end. We recommend using machine learning models to improve the abstracts of research articles to get more citations. [ABSTRACT FROM AUTHOR]

This special issue contains six revised and extended versions of tool papers that appeared in the proceedings of TACAS 2021, the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. The issue is dedicated to the realization of algorithms in tools and the studies of the application of these tools for analysing hard- and software systems. [ABSTRACT FROM AUTHOR]

Document forgeries that involve modification of the materials used, such as ink and paper, provide evidence of any malpractices being performed. Forensic specialists use different techniques to identify and classify these samples; however, the most preferred method is to use nondestructive techniques to avoid any potential damage to the original specimen under investigation. Hyperspectral imaging has already been explored in several application domains and used as a powerful method in forensic investigations to extract information about the materials under examination. To precisely classify the material information and utilize the hyperspectral imaging technique's potential, we probed the potential of some hybrid spectral similarity measures to classify different commonly used paper samples. A comparison of these methods is quantitatively presented in this article. Hybrid spectral similarity algorithms are tested on forensic analysis of paper data. We compared the classification capabilities of various hybrid spectral similarity algorithms on hyperspectral data of 40 different paper samples. The overall accuracy (OA), kappa K̂, Z‐score of kappa (ZK̂), and the 95% confidence interval of kappa (CI(K̂)) are used for comparison. The SID‐SAM and SID‐SCA produced an overall accuracy of 88% and 87%, respectively, which is highest among the hybrid spectral similarity measures tested. [ABSTRACT FROM AUTHOR]

They give fixed parameter tractable algorithms for the problem parameterized by various structural parameters. The authors give a greedy loop-free algorithm for the exhaustive generation, a successor algorithm that runs in constant amortized time, among other algorithms, as well as results for the fixed spin generalization of this problem. IWOCA (International Workshop on Combinatorial Algorithms) is an annual conference series covering all aspects of combinatorial algorithms. [Extracted from the article]

This paper presents an improved two-dimensional logistic map. Relative to the original logistic map, the improved chaos map has better performance, e.g., larger chaotic range, higher complexity, and boosting sequence. Based on these good performances, a novel encipherment strategy is designed according to the hybrid coding of DNA and S-box algorithm. During the design of the algorithm, the primary operations include chaotic stream generation, permutation, and diffusion. The chaotic streams are constructed from the improved two-dimensional logistic map. The diffusion stage is achieved by the spatiotemporal chaos algorithm. The security test reflects that the design algorithm can effectively defend against external attacks. [ABSTRACT FROM AUTHOR]

In this paper, we report a new algorithm for creating an adaptive basis set in the Multiconfigurational Ehrenfest (MCE) method, which is termed Full Cloning (FC), and test it together with the existing Multiple Cloning (MC) using the spin-boson model at zero-temperature as a benchmark. The zero-temperature spin-boson regime is a common hurdle in the development of methods that seek to model quantum dynamics. Two versions of MCE exist. We demonstrate that MC is vital for the convergence of MCE version 2 (MCEv2). The first version (MCEv1) converges much better than MCEv2, but FC improves its convergence in a few cases where it is hard to converge it with the help of a reasonably small size of the basis set. [ABSTRACT FROM AUTHOR]

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

The paper presents a technique for determining the time index of growth of the slope of reverse voltage for double insulated cables, based on the body of the theory of series. It is proved that in the vicinity of the extremum point (maximum) the function of the reverse voltage is approximated by polynomials of the nth power. It is proposed to use second-degree polynomials for practical calculations. The method for calculating relevant indicators is illustrated using real data. Analysis of deviations made it possible to conclude that the calculation method proposed in the paper is far more accurate. In the final part of the study, it was concluded that there is a promising outlook for further development of methodological guidelines for determining complex indices of the remaining life of the cable, including but not limited to the use of various mathematical methods. [ABSTRACT FROM AUTHOR]

We study the quadratic cycle cover problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We derive several semidefinite programming (SDP) relaxations and use facial reduction to make these strictly feasible. We investigate a nontrivial relationship between the transformation matrix used in the reduction and the structure of the graph, which is exploited in an efficient algorithm that constructs this matrix for any instance of the problem. To solve our relaxations, we propose an algorithm that incorporates an augmented Lagrangian method into a cutting-plane framework by utilizing Dykstra's projection algorithm. Our algorithm is suitable for solving SDP relaxations with a large number of cutting-planes. Computational results show that our SDP bounds and efficient cutting-plane algorithm outperform other QCCP bounding approaches from the literature. Finally, we provide several SDP-based upper bounding techniques, among which is a sequential Q-learning method that exploits a solution of our SDP relaxation within a reinforcement learning environment. Summary of Contribution: The quadratic cycle cover problem (QCCP) is the problem of finding a set of node-disjoint cycles covering all the nodes in a graph such that the total interaction cost between successive arcs is minimized. The QCCP has applications in many fields, among which are robotics, transportation, energy distribution networks, and automatic inspection. Besides this, the problem has a high theoretical relevance because of its close connection to the quadratic traveling salesman problem (QTSP). The QTSP has several applications, for example, in bioinformatics, and is considered to be among the most difficult combinatorial optimization problems nowadays. After removing the subtour elimination constraints, the QTSP boils down to the QCCP. Hence, an in-depth study of the QCCP also contributes to the construction of strong bounds for the QTSP. In this paper, we study the application of semidefinite programming (SDP) to obtain strong bounds for the QCCP. Our strongest SDP relaxation is very hard to solve by any SDP solver because of the large number of involved cutting-planes. Because of that, we propose a new approach in which an augmented Lagrangian method is incorporated into a cutting-plane framework by utilizing Dykstra's projection algorithm. We emphasize an efficient implementation of the method and perform an extensive computational study. This study shows that our method is able to handle a large number of cuts and that the resulting bounds are currently the best QCCP bounds in the literature. We also introduce several upper bounding techniques, among which is a distributed reinforcement learning algorithm that exploits our SDP relaxations. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel paper currency defect detection algorithm using quaternion uniform strength. We first build paper currency image preprocessing integration framework which includes intensity balancing, paper currency location, and geometric correction. We then propose a global–local paper currency image registration algorithm by moving key areas within certain range which can eliminate the false difference effectively. Finally, the quaternion uniform strength is calculated by using quaternion convolution edge detector. The defect degree of paper currency is determined by using the quaternion uniform color difference. The proposed algorithm is tested using different datasets from five countries: CNY, USD, EUR, VND, and RUB. The experimental results demonstrate that the proposed algorithm yields better results than the existing state-of-the-art paper currency defect detection techniques. The demo of the proposed paper currency defect detection algorithm will be publicly available. [ABSTRACT FROM AUTHOR]

Although it was claimed that the MKR-α method can improve the overshoot and nonlinear stability characteristics of the KR-α method, it seems that it still has a high frequency overshoot in steady-state responses and a weak instability. Three examples are applied to numerically illustrate the two adverse properties. A loading-correction term is introduced into the displacement difference equation to remove the adverse overshoot in high frequency steady-state responses. Besides, it is analytically verified that the MKR-α method has an adverse weak instability. Although the problem of high frequency overshoot in steady-state responses can be overcome, there is no way to eliminate the adverse weak instability for both the KR-α method and MKR-α method. Thus, the applications of the two families of integration methods are very limited. It is demonstrated that a high frequency numerical damping is incapable of mitigating the overshoot caused by a weak instability. [ABSTRACT FROM AUTHOR]

This work describes the log-MAP (BCJR) algorithm implementation of a close to capacity dirty paper coding CODEC. The CODEC consists of eight deep pipeline processors. It decodes blocks of 975 bits in 26.9 ms using less than 9.7% of low-cost FPGA (and no DSP blocks). Two pipelines, for alpha and beta, calculate the values of gamma (of the BCJR) to reduce the storage requirements. The final log-likelihood ratio (LLR) is calculated together with alpha, reusing intermediate results. The number of bits used by the different signals of the processor is easily configurable. It was set to six bits to the channel measure signals and eight bits to log of probability signals like alpha, beta, and others. The CODEC clock was 100 MHz. The achieved bit rate is 36.2 Kbps per CODEC, but multiple CODECs can be fit into a single chip. The CODEC is 3.49 dB from the channel capacity. [ABSTRACT FROM AUTHOR]

The teleprompter, invented in 1948 as a memory aid for show business, has become a ubiquitous technology in modern politics. Yet, the hidden ways in which this device shapes our understanding of performance, newscasting, and political rhetoric are rarely studied by media scholars. Recognizing this lacuna, this article traces the evolution of the teleprompter from a cumbersome, human-operated device to an invisible system of screens designed to conceal its own existence. The teleprompter has not only shaped the standardization of speech, but also restructured the televised spectacle by collapsing the sonic, the tactile, and the optical. By focusing on teleprompter fiascos and moments of breakdown from President Eisenhower to President Trump, we make a broader argument regarding the importance of failure and the accidental to the study of visual culture. [ABSTRACT FROM AUTHOR]

Machine learning (ML), a form of artificial intelligence (AI), is being increasingly employed in neurology. Reported performance metrics often match or exceed the efficiency of average clinicians. The neurologist is easily baffled by the underlying concepts and terminologies associated with ML studies. The superlative performance metrics of ML algorithms often hide the opaque nature of its inner workings. Questions regarding ML model's interpretability and reproducibility of its results in real-world scenarios, need emphasis. Given an abundance of time and information, the expert clinician should be able to deliver comparable predictions to ML models, a useful benchmark while evaluating its performance. Predictive performance metrics of ML models should not be confused with causal inference between its input and output. ML and clinical gestalt should compete in a randomized controlled trial before they can complement each other for screening, triaging, providing second opinions and modifying treatment. [ABSTRACT FROM AUTHOR]

Zemblys et al. (Behavior Research Methods, 51(2), 840–864, 2019) reported on a method for the classification of eye-movements ("gazeNet"). I have found three errors and two problems with that paper that are explained herein. Error 1: The gazeNet classification method was built assuming that a hand-scored dataset from Lund University was all collected at 500 Hz, but in fact, six of the 34 recording files were actually collected at 200 Hz. Of the six datasets that were used as the training set for the gazeNet algorithm, two were actually collected at 200 Hz. Problem 1 has to do with the fact that even among the 500 Hz data, the inter-timestamp intervals varied widely. Problem 2 is that there are many unusual discontinuities in the saccade trajectories from the Lund University dataset that make it a very poor choice for the construction of an automatic classification method. Error 2 The gazeNet algorithm was trained on the Lund dataset, and then compared to other methods, not trained on this dataset, in terms of performance on this dataset. This is an inherently unfair comparison, and yet nowhere in the gazeNet paper is this unfairness mentioned. Error 3 arises out of the novel event-related agreement analysis employed by the gazeNet authors. Although the authors intended to classify unmatched events as either false positives or false negatives, many are actually being classified as true negatives. True negatives are not errors, and any unmatched event misclassified as a true negative is actually driving kappa higher, whereas unmatched events should be driving kappa lower. [ABSTRACT FROM AUTHOR]

In order to solve the problems of the current art circulation information is not transparent and the centralized trading authority is asymmetric, this paper proposed a art blockchain certificate traceability model based on three chains. First, in view of the large amount of data in a single piece of artwork information, this paper proposed a blockchain-based symmetric searchable encryption algorithm, and used the interplanetary file system to securely store artwork circulation records on-chain and off-chain. Secondly, for the characteristics of the increasing effective data of artwork information, this paper proposed a blockchain-based inverted fast query and traceability algorithm to help data users realize fast traceability and positioning. At the same time, this paper proposed for the first time that the false information alliance chain stores false art circulation records to realize the processing of false information. Finally, experiments verify the feasibility of the model for big data security storage and fast query traceability. Experiments show that the model is feasible and the query method is efficient. [ABSTRACT FROM AUTHOR]

The application of big data, radiomics, machine learning, and artificial intelligence (AI) algorithms in radiology requires access to large data sets containing personal health information. Because machine learning projects often require collaboration between different sites or data transfer to a third party, precautions are required to safeguard patient privacy. Safety measures are required to prevent inadvertent access to and transfer of identifiable information. The Canadian Association of Radiologists (CAR) is the national voice of radiology committed to promoting the highest standards in patient-centered imaging, lifelong learning, and research. The CAR has created an AI Ethical and Legal standing committee with the mandate to guide the medical imaging community in terms of best practices in data management, access to health care data, de-identification, and accountability practices. Part 2 of this article will inform CAR members on the practical aspects of medical imaging de-identification, strengths and limitations of de-identification approaches, list of de-identification software and tools available, and perspectives on future directions. [ABSTRACT FROM AUTHOR]

Heritage visualizations are works of the cultural imaginary and this paper examines the artwork Artistic License: VR Sydney Cove circa 1800, which foregrounds the interpretive nature of heritage visualization. It is a reimagining in VR of A View of Sydney Cove, New South Wales, 1804, a contemporaneous print of Sydney Cove. Existing in the liminal space between accuracy and authenticity it is both art object and heritage visualization. The dual nature of this work supports engagement with wider audiences, fostering and broadening debate at individual, institutional, academic and societal levels about the nature and role of heritage. [ABSTRACT FROM AUTHOR]

In order to better solve the problem of automatic identification of quality control line and detection line in the detection of gold standard test strip, this paper proposes to collect the image information of gold standard test strip after color rendering through CMOS sensor, preprocess the obtained information, transform RGB image into gray image, build cloud model in the CIELAB/HSV/HSL space, and apply the improved AdaBoost algorithm to determine the position of detection line and quality control line Place. Compared with the traditional template matching method, it improves the accuracy and accuracy of recognition. [ABSTRACT FROM AUTHOR]

The folded paper-size illusion is as easy to demonstrate as it is powerful in generating insights into perceptual processing: First take two A4 sheets of paper, one original sized, another halved by folding, then compare them in terms of area size by centering the halved sheet on the center of the original one! We perceive the larger sheet as far less than double (i.e., 100%) the size of the small one, typically only being about two thirds larger--this illusion is preserved by rotating the inner sheet and even by aligning it to one or two sides, but is dissolved by aligning both sheets to three sides, here documented by 88 participants' data. A potential explanation might be the general incapability of accurately comparing more than one geometrical dimension at once--in everyday life, we solve this perceptual-cognitive bottleneck by reducing the complexity of such a task via aligning parts with same lengths. [ABSTRACT FROM AUTHOR]

The estimation of time‐lapse time shifts between two, or several, repeated seismic surveys has become increasingly popular over the past eighteen years. These time shifts are a reliable and informative seismic attribute that can relate to reservoir production. Correction for these time shifts or the underlying velocity perturbations and/or subsurface displacement in an imaging sense also permits accurate evaluation of time‐lapse amplitudes by attempting to decouple the kinematic component. To date, there are approximately thirty methods for time‐shift estimation described in the literature. We can group these methods into three main families of mathematical development, together with several miscellaneous techniques. Here we detail the underlying bases for these methods, and the acknowledged benefits and weaknesses of each class of method highlighted. We illustrate this review with a number of time‐lapse seismic examples from producing fields. No method is necessarily superior to the others, as its selection depends on ease of implementation, noise characteristics of the field data, and whether the inherent assumptions suit the case in question. However, cross‐correlation stands out as the algorithm of choice based on the Pareto principle and waveform inversion the algorithm delivering best resolution. This is a companion study to the previous review of time‐shift magnitudes and a discussion of their rock physics basis. [ABSTRACT FROM AUTHOR]

In view of the problem of fuzziness of rating and tag in traditional collaborative filtering algorithms,this paper used trapezoidal fuzzy number to describe the mapping relationship between rating and satisfaction.The algorithm considered the impact of sparseness of the rating,constructed a new trapezoidal fuzzy rating model to determine the similarity based on fuzzy rating,analyzed the degree of membership between the tag and the item,and constructed a fuzzy item-tag matrix to measure the similarity based on the degree of tag membership.Finally,it used the improved scoring prediction strategy to estimate the score.The experimental results on the MovieLens dataset show that the proposed algorithm improves the prediction accuracy while suppressing the cold start of the project,alleviating the problems of fuzziness and sparseness,which indicates the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The present paper is in two folds. In the first fold, we prove the Lipschitz continuity of the proximal mapping associated with a general strongly H-monotone mapping and compute an estimate of its Lipschitz constant under some mild assumptions imposed on the mapping H involved in the proximal mapping. We provide two examples to show that a maximal monotone mapping need not be a general H-monotone for a single-valued mapping H from a Banach space to its dual space. A class of multi-valued nonlinear variational inclusion problems is considered, and by using the notion of proximal mapping and Nadler's technique, an iterative algorithm with mixed errors is suggested to compute its solutions. Under some appropriate hypotheses imposed on the mappings and parameters involved in the multi-valued nonlinear variational inclusion problem, the strong convergence of the sequences generated by the proposed algorithm to a solution of the aforesaid problem is verified. The second fold of this paper investigates and analyzes the notion of Cn-monotone mappings defined and studied in [S.Z. Nazemi, A new class of monotone mappings and a new class of variational inclusions in Banach spaces, J. Optim. Theory Appl. 155(3)(2012) 785-795]. Several comments related to the results and algorithm appeared in the above mentioned paper are given. [ABSTRACT FROM AUTHOR]

The paper presents a technique for determining the time index of growth of the slope of reverse voltage for double insulated cables, based on the body of the theory of series. It is proved that in the vicinity of the extremum point (maximum) the function of the reverse voltage is approximated by polynomials of the nth power. It is proposed to use second-degree polynomials for practical calculations. The method for calculating relevant indicators is illustrated using real data. Analysis of deviations made it possible to conclude that the calculation method proposed in the paper is far more accurate. In the final part of the study, it was concluded that there is a promising outlook for further development of methodological guidelines for determining complex indices of the remaining life of the cable, including but not limited to the use of various mathematical methods. [ABSTRACT FROM AUTHOR]

Within the context of fewest-switch surface hopping (FSSH) dynamics, one often wishes to remove the angular component of the derivative coupling between states J and K . In a previous set of papers, Shu et al. [J. Phys. Chem. Lett. 11, 1135–1140 (2020)] posited one approach for such a removal based on direct projection, while we isolated a second approach by constructing and differentiating a rotationally invariant basis. Unfortunately, neither approach was able to demonstrate a one-electron operator O ̂ whose matrix element J O ̂ K was the angular component of the derivative coupling. Here, we show that a one-electron operator can, in fact, be constructed efficiently in a semi-local fashion. The present results yield physical insight into designing new surface hopping algorithms and are of immediate use for FSSH calculations. [ABSTRACT FROM AUTHOR]

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. [ABSTRACT FROM AUTHOR]

This paper proposed an electronic voting scheme based on one-time ring signature and blockchain to solve the problems of the current e-voting system in terms of anonymity, transparency and open vote-counting. This paper introduced one-time ring signature, blockchain and stealth address technology. The one-time ring signature technology solved the problem of voter anonymity, repeated voting and public verification. The blockchain technology could ensure the openness and transparency of the e-voting system. The one-time ring signature technology could ensure no one or institution could obtain the voting intermediate result before the voting ends. In order to improve the efficiency of vote-counting,it used the method of key sharing to improve the vote-counting algorithm. Through security and performance analysis, the scheme conforms to the basic security standards of an electronic voting system. [ABSTRACT FROM AUTHOR]

This paper presents an approach to evaluate the failure of arbitrarily inclined interfaces using FE models with structured spatial discretization, providing accurate prediction of crack propagation along paths known a priori that are not constrained to the element boundaries. The combination of algorithms for the generation of structured discretization of representative polycrystalline microstructures with novel cohesive element formulations allow modelling the failure of complex topologies along rasterised boundaries, with noticeably higher computational efficiency and comparable accuracy. Two formulations of raster cohesive elements are presented, adopting either elastic-brittle or Tvergaard–Hutchinson traction separation laws. The formulations proposed are first validated comparing the failure of the interface within bi-crystal structures discretised using hexahedral elements either within a structured mesh (i.e. with rasterised boundaries) or an unstructured mesh (i.e. with planar boundary). Subsequently, the effectiveness of the formulations is demonstrated comparing the inter-granular crack propagation within complex polycrystalline microstructures. The behaviour of the novel cohesive element formulation in structured meshes consisting of regular hexahedral elements is in excellent agreement with the deformation and failure of classic cohesive element formulations placed along the planar boundaries of unstructured meshes consisting of tetrahedral elements. The higher computational cost of the raster cohesive elements is more than compensated by the increase in computational efficiency of structured meshes when compared to unstructured meshes, leading to a reduction of the simulation time of up to over 200 times for the simulations presented in the paper, thus allowing the simulation of large domains. [ABSTRACT FROM AUTHOR]

Identifying similar DNA sequences is crucial in various biological research endeavors. This paper delves into the intricate workings of a specific algorithm designed for this purpose. We provide a systematic explanation, exploring how the algorithm handles user input, reads stored DNA sequences, utilizes the Word2Vec model for vector representation, and calculates sequence similarity using diverse metrics like Cosine Similarity and Neutrosophic Distance. Additionally, the paper explores the incorporation of neutrosophic values to account for uncertainty in the comparisons. Finally, we discuss the extraction of results, including matched sequences, similarity scores, and accuracy measures. This in-depth exploration provides a clear understanding of the algorithm's capabilities and fosters its effective application in DNA sequence analysis. [ABSTRACT FROM AUTHOR]

In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algorithm with standard bit mutation needs time (1 + o (1)) n ln n / p 1 to find the optimum of any linear function, as long as the probability p 1 to flip exactly one bit is Θ (1) . In this paper we investigate how this result generalizes if standard bit mutation is replaced by an arbitrary unbiased mutation operator. This situation is notably different, since the stochastic domination argument used for the lower bound by Witt no longer holds. In particular, starting closer to the optimum is not necessarily an advantage, and OneMax is no longer the easiest function for arbitrary starting positions. Nevertheless, we show that Witt's result carries over if p 1 is not too small, with different constraints for upper and lower bounds, and if the number of flipped bits has bounded expectation χ . Notably, this includes some of the heavy-tail mutation operators used in fast genetic algorithms, but not all of them. We also give examples showing that algorithms with unbounded χ have qualitatively different trajectories close to the optimum. [ABSTRACT FROM AUTHOR]

India has produced several drafts of data policies. In this work, they are referred to [1] JBNSCR 2018, [2] DPDPR 2018, [3] NSAI 2018, [4] RAITF 2018, [5] PDPB 2019, [6] PRAI 2021, [7] JPCR 2021, [8] IDAUP 2022, [9] IDABNUP 2022. All of them consider Artificial Intelligence (AI) a social problem solver at the societal level, let alone an incentive for economic growth. However, these policy drafts warn of the social disruptions caused by algorithms and encourage the careful use of computational technologies in various social contexts. Hence, the emerging data society and its implications in India's social contexts demand immense social science attention, which needs to be improved in the policy drafts, primarily because they are creations of industry stakeholders, technocrats, bureaucrats, and experts from tech schools. In the larger social milieu of digital infrastructure emerging, the fundamental question is whether India's national philosophy envisioned in the Indian constitution is reflected in the policy papers. The paper enquires whether the national data policy upholds the core values dispersed through the philosophy of the Indian constitution, which, among other things, is not confined only to inclusion, diversity, rights, liberty, justice and equality. By focusing on constitutional values, the paper seeks to offer a broader and more critical understanding of India's approach to AI policy by bringing together analyses of a wide array of policy documents available in the public realm. [ABSTRACT FROM AUTHOR]

Background: Disruption score (DS) is a novel bibliometric created to identify research that shifts paradigms, which may be overlooked by citation count (CC). We analyzed the most disruptive, compared to the most cited, literature in vascular surgery, and hypothesized that DS and CC would not correlate. Methods: A PubMed search identified vascular surgery publications from 1954 to 2014. The publications were linked to the iCite NIH tool and DS algorithm to identify the top 100 studies by CC and DS, respectively. The publications were reviewed for study focus, design, and contribution, and subsequently compared. Results: A total of 56,640 publications were identified. The top 100 DS papers were frequently published in J Vasc Sur (43%) and Eur J Vasc Endovasc Surg (13%). The top 100 CC paperswere frequently published in N Engl J Med (32%) and J Vasc Sur (20%). The most cited article is the fifth most disruptive; the most disruptive article is not in the top 100 cited papers. The DS papers had a higher mean DS than the CC papers (.17 vs .0001, P < .0001). The CC papers had a higher mean CC than the DS papers (866 vs 188, P < .0001). DS and CC are weakly correlated metrics (r = .22, P = .03). Discussion: DS was weakly correlated with CC and captured a unique subset of literature that created paradigm shifts in vascular surgery. DS should be utilized as an adjunct to CC to avoid overlooking impactful research and influential researchers, and to measure true academic productivity. [ABSTRACT FROM AUTHOR]

Many sensitive applications require that data remain confidential and undisclosed, even for intrusion detection objectives. For this purpose, the detection of anomalies in encrypted data has become increasingly vital. Deep learning models are becoming good tools to detect anomalies in encrypted data without the need to pass through data decryption. This paper presents a systematic review focusing on the advancements made in deep learning models for intrusion detection over encrypted data with privacy preservation. This study aims to guide researchers on how to select the right tools to set up an intrusion detection system over encrypted data with privacy preservation. The study presented the context and challenges of intrusion detection on encrypted data and how machine learning-based solutions can circumvent these challenges. The paper looks at recently proposed solutions, examines metrics for assessing model performance, and evaluates frequently used reference datasets. Deep learning models are also evaluated with statistics on the most frequent models, datasets, and encryption tools. The performance metrics of the studied solutions are investigated as a function of the encryption tools, the deployed deep learning models, the privacy preservation tools, the deployed datasets, and the eventual additional tools and algorithms. Our recommendations help researchers evaluate their proposals for preserving privacy and detecting intrusions on encrypted data using deep learning techniques. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a GI X /M/1 queue with the two-stage vacation policy. The system will first enter a working vacation once the system becomes empty in the normal busy period, during which the service rate will be switched to a lower rate. After this working vacation, if the system is nonempty, the service rate will be switched to the normal rate immediately; otherwise, the system will enter multiple vacations during which the service rate reduces to zero until the system is nonempty after one vacation and a new normal busy period starts. The distinguishing feature of this paper is the use of a general algorithm for solving the difference equation based on the right shift operator method to obtain the queue length distribution at pre-arrival time and arbitrary time. Moreover, the sojourn time of arbitrary customer is analyzed. Finally, several typical numerical examples are provided to validate our computational algorithm. [ABSTRACT FROM AUTHOR]