Reviewerly/exHarmony huggingface dataset:
Comparing and Contrasting Near-Field, Object Space, and a Novel Hybrid Interaction Technique for Distant Object Manipulation in VR

Authors:
raw_author_name: Wei-An Hsieh
raw_affiliation_string: Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu 30010, Taiwan
raw_author_name: David Brickler
raw_affiliation_string: School of Computing, Clemson University, Clemson, SC 29634, USA
raw_author_name: Sabarish V. Babu
raw_affiliation_string: School of Computing, Clemson University, Clemson, SC 29634, USA
raw_author_name: Jung-Hong Chuang
raw_affiliation_string: Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu 30010, Taiwan

Abstract: In this contribution, we propose a hybrid interaction technique that integrates near-field and object-space interaction techniques for manipulating objects at a distance in virtual reality (VR). The objective of the hybrid interaction technique was to seamlessly leverage the strengths of both the near-field and object-space manipulation techniques. We employed bimanual near-field metaphor with scaled replica (BMSR) as our near-field interaction technique, which enabled us to perform multilevel degrees-of-freedom (DoF) separation transformations, such as 1~3DoF translation, 1~3DoF uniform and anchored scaling, 1DoF and 3DoF rotation, and 6DoF simultaneous translation and rotation, with enhanced depth perception and fine motor control provided by near-field manipulation techniques. The object-space interaction technique we utilized was the classic Scaled HOMER, which is known to be effective and appropriate for coarse transformations in distant object manipulation. In a repeated measures within-subjects evaluation, we empirically evaluated the three interaction techniques for their accuracy, efficiency, and economy of movement in pick-and-place, docking, and tunneling tasks in VR. Our findings revealed that the near-field BMSR technique outperformed the object space Scaled HOMER technique in terms of accuracy and economy of movement, but the participants performed more slowly overall with BMSR. Additionally, our results revealed that the participants preferred to use the hybrid interaction technique, as it allowed them to switch and transition seamlessly between the constituent BMSR and Scaled HOMER interaction techniques, depending on the level of accuracy, precision and efficiency required.
A Comparative Study of Performance Between Federated Learning and Centralized Learning Using Pathological Image of Endometrial Cancer

Authors:
raw_author_name: Young Jae Kim
raw_affiliation_string: Department of Biomedical Engineering, Gachon University, 191, Hambangmoe-ro, Yeonsu-gu, Incheon, 21936, Korea
raw_author_name: Kwang Gi Kim
raw_affiliation_string: Department of Biomedical Engineering, Gachon University College of Medicine, Gil Medical Center, 38-13 Docjeom-ro 3 Beon-gil, Namdong-gu, Incheon, 21565, Korea

Abstract: Federated learning, an innovative artificial intelligence training method, offers a secure solution for institutions to collaboratively develop models without sharing raw data. This approach offers immense promise and is particularly advantageous for domains dealing with sensitive information, such as patient data. However, when confronted with a distributed data environment, challenges arise due to data paucity or inherent heterogeneity, potentially impacting the performance of federated learning models. Hence, scrutinizing the efficacy of this method in such intricate settings is indispensable. To address this, we harnessed pathological image datasets of endometrial cancer from four hospitals for training and evaluating the performance of a federated learning model and compared it with a centralized learning model. With optimal processing techniques (data augmentation, color normalization, and adaptive optimizer), federated learning exhibited lower precision but higher recall and Dice similarity coefficient (DSC) than centralized learning. Hence, considering the critical importance of recall in the context of medical image processing, federated learning is demonstrated as a viable and applicable approach in this field, offering advantages in terms of both performance and data security.
High-fidelity robust qubit control by phase-modulated pulses

Authors:
raw_author_name: Marko Kuzmanović
raw_affiliation_string: InstituteQ and QTF Centre of Excellence, Department of Applied Physics, School of Science, Aalto University, FI-00076 Aalto, Finland
raw_author_name: John J. McCord
raw_affiliation_string: InstituteQ and QTF Centre of Excellence, Department of Applied Physics, School of Science, Aalto University, FI-00076 Aalto, Finland
raw_author_name: Shruti Dogra
raw_affiliation_string: InstituteQ and QTF Centre of Excellence, Department of Applied Physics, School of Science, Aalto University, FI-00076 Aalto, Finland
raw_author_name: Gheorghe Sorin Paraoanu
raw_affiliation_string: InstituteQ and QTF Centre of Excellence, Department of Applied Physics, School of Science, Aalto University, FI-00076 Aalto, Finland

Abstract: We present a set of robust and high-fidelity pulses that realize paradigmatic operations such as the transfer of the ground state population into the excited state and arbitrary $X/Y$ rotations on the Bloch sphere. These pulses are based on the phase modulation of the control field. We provide an experimental proof-of-concept of these operations by using a transmon qubit, demonstrating resilience against deviations in the drive amplitude of more than $\ensuremath{\approx}20%$, and/or detuning from the qubit transition frequency in the order of $10\phantom{\rule{4pt}{0ex}}\mathrm{MHz}$. This modulation scheme is straightforward to implement in practice and can be deployed to any other qubit-based experimental platform.
Dendritic Growth Optimization: A Novel Nature-Inspired Algorithm for Real-World Optimization Problems

Authors:
raw_author_name: Ishaani Priyadarshini
raw_affiliation_string: School of Information, University of California, Berkeley, CA 94720, USA

Abstract: In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm’s feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO’s wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving.
Algorithms of the Möbius function by random forests and neural networks

Authors:
raw_author_name: Yangbo Ye
raw_affiliation_string: Department of Mathematics, The University of Iowa, Iowa City, 52242, IA, USA

Abstract: Abstract The Möbius function $$\mu (n)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>μ</mml:mi> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> is known for containing limited information on the prime factorization of n . Its known algorithms, however, are all based on factorization and hence are exponentially slow on $$\log n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>log</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> . Consequently, a faster algorithm of $$\mu (n)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>μ</mml:mi> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> could potentially lead to a fast algorithm of prime factorization which in turn would throw doubt upon the security of most public-key cryptosystems. This research introduces novel approaches to compute $$\mu (n)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>μ</mml:mi> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> using random forests and neural networks, harnessing the additive properties of $$\mu (n)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>μ</mml:mi> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> . The machine learning models are trained on a substantial dataset with 317,284 observations (80%), comprising five feature variables, including values of n within the range of $$4\times 10^9$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>4</mml:mn> <mml:mo>×</mml:mo> <mml:msup> <mml:mn>10</mml:mn> <mml:mn>9</mml:mn> </mml:msup> </mml:mrow> </mml:math> . We implement the Random Forest with Random Inputs (RFRI) and Feedforward Neural Network (FNN) architectures. The RFRI model achieves a predictive accuracy of 0.9493, a recall of 0.5865, and a precision of 0.6626. On the other hand, the FNN model attains a predictive accuracy of 0.7871, a recall of 0.9477, and a precision of 0.2784. These results strongly support the effectiveness and validity of the proposed algorithms.
Recognition of REEs anomalies using an image Fusion fractal-wavelet model in Tarom metallogenic zone, NW Iran

Authors:
raw_author_name: Mohammad Mahdi Pourgholam
raw_affiliation_string: Department of Petroleum and Mining Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran
raw_author_name: Peyman Afzal
raw_affiliation_string: Research center for modeling and optimization in science and engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran
raw_author_name: Ahmad Adib
raw_affiliation_string: Department of Petroleum and Mining Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran
raw_author_name: Kambiz Rahbar
raw_affiliation_string: Department of Computer Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran
raw_author_name: Mehran Gholinejad
raw_affiliation_string: Department of Petroleum and Mining Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran

Abstract: This study aims to detect REE geochemical anomalies in relationship to Iron-apatite ores utilizing an image Fusion based on Deep Learning (FDL). The geochemical data was modeled for elements related to Iron-apatite mineralization using multi b Spline B. The results were fusioned in applying the Deep learning method based on pre-trained networks. Wavelet-Number (WN) fractal model classified the best results based on the combination of a two-dimensional Discrete Wavelet Transformation (DWT) signal analysis and a Concentration-Area (C-A) fractal modeling. Sym8 carried the DWT as a selected wavelet pattern for REE based on Stream sediment samples collected from the Tarom region (NW Iran). In addition, the DWT was decomposed by wavelet coefficients at five levels. Furthermore, the DWT data were classified using a fractal-wavelet model to delineate REE anomalies from background levels in this region. Overlayed with the catchment basins model and weighted using the upstream and downstream parts. As a result, the prominent REE source anomalies are located in the southern parts of the study area. The results obtained by the proposed fractal-wavelet modeling are in connection with field check anomaly samples and the rock samples collected from the Iron-Apatite ore deposits.
The 2<sup>3</sup> Factorial Design in R

Authors:
raw_author_name: R Hasanagić
raw_affiliation_string: University of Bihać, Faculty of Technical Engineering, Bihać, Bosnia and Herzegovina

Abstract: Abstract The paper describes the factorial design of the experiment with three input factors that change on two levels. For given values of the input parameters, it is shown how to obtain a variance analysis table and which factors and interactions between factors are significant. The example was done in the software intended for the design of the experiment and in the software R. It is shown how to use the software R to arrive at the final solution of the given example.
SRSegNet: Super-resolution-assisted small targets polyp segmentation network with combined high and low resolution

Authors:
raw_author_name: Fan Li
raw_affiliation_string: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China; Yunnan Key Laboratory of Artificial Intelligence, Kunming 650500, China
raw_author_name: Wanlong Zhao
raw_affiliation_string: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China; Yunnan Key Laboratory of Artificial Intelligence, Kunming 650500, China
raw_author_name: Zhu Chen
raw_affiliation_string: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China; Yunnan Key Laboratory of Artificial Intelligence, Kunming 650500, China

Abstract: Accurate and reliable segmentation of polyp targets is crucial in the treatment of colorectal cancer. However, in clinical practice, polyp structures represent only a small portion of the image, which is essential for the accurate diagnosis and treatment of colorectal cancer. The small size of lesion areas leads to a reduction in feature representation, thereby affecting the performance of traditional segmentation methods. To address this issue, To address this issue, recent advancements in segmentation methods for small medical objects meticulously extract feature information from these objects using attention mechanisms. However, these methods mainly focus on general small medical objects and perform poorly in the segmentation of small polyps.Therefore, this study fully exploits the advantages of joint learning and multi-task learning. By guiding the high-resolution features to guide the low-resolution encoder through joint learning and fusing effective features from the super-resolution task to assist the segmentation task, our method enhances the model’s ability to extract texture details. We also design a high-resolution guidance module and an information complementation module, effectively integrating learning between different resolutions and tasks.Evaluation experiments on two settings on the Kvasir-SEG, CVC-ClinicDB, CVC-ColonDB, CVC-300, and ETIS datasets demonstrate that our method achieves significant advantages in the segmentation of small polyps, outperforming various state-of-the-art methods.
Robust multi-view learning via M-estimator joint sparse representation

Authors:
raw_author_name: Yutao Hu
raw_affiliation_string: College of Informatics, Huazhong Agricultural University, Wuhan 430070, China
raw_author_name: Yulong Wang
raw_affiliation_string: College of Informatics, Huazhong Agricultural University, Wuhan 430070, China
raw_author_name: Han Li
raw_affiliation_string: College of Informatics, Huazhong Agricultural University, Wuhan 430070, China
raw_author_name: Hong Chen
raw_affiliation_string: College of Informatics, Huazhong Agricultural University, Wuhan 430070, China

Abstract: Recently, multi-view learning has achieved extraordinary success in many research areas such as pattern recognition and data mining. Most existing multi-view methods mainly focus on exploring the correlation information between different views and their performance may severely degrade in the presence of heavy noises and outliers. In this paper, we put forward a robust multi-view joint sparse representation (RMJSR) method for multi-view learning. Firstly, we design a novel multi-view Cauchy estimator based loss function originating from robust statistics to address complex noises and outliers in reality. Based on this, we leverage the ℓ1,q norm to enhance our model by encouraging the learned representation of multiple views to share the same sparsity pattern. Secondly, to explore the optimal solution for the RMJSR model, we devise an effective optimization algorithm based on the half-quadratic (HQ) theory and the alternating direction method of multipliers (ADMM) framework. Thirdly, we provide the theoretical guarantee for revealing the theoretical condition for the success of the proposed method. Further, we have also provided extensive analysis of the proposed method, including the optimality condition, convergence analysis, and complexity analysis. Extensive experimental results validate the effectiveness and robustness of the proposed method in comparison with state-of-the-art competitors. The source code is available at https://github.com/Huyutao7/RMJSRC.
DAST-Net: Dense visual attention augmented spatio-temporal network for unsupervised video anomaly detection

Authors:
raw_author_name: Rangachary Kommanduri
raw_affiliation_string: Computer Vision Group, Indian Institute of Information Technology, Sri City, Chittoor, Andhra Pradesh 517646, India
raw_author_name: Mrinmoy Ghorai
raw_affiliation_string: Computer Vision Group, Indian Institute of Information Technology, Sri City, Chittoor, Andhra Pradesh 517646, India

Abstract: This paper introduces an innovative end-to-end trainable framework named Dense Attention-aware Spatio-Temporal Network (DAST-Net) for video anomaly detection. The framework adeptly leverages both spatial and temporal data in an unsupervised manner, eliminating the need for manually crafted features. To enhance spatial feature representation, DAST-Net incorporates visual attention-aware residual connections within the denser residual network (DenserResNet), deviating from traditional identity skip connections. The rationale behind this connection choice is to augment the contextual understanding of features across various scales. For capturing temporal patterns, the framework employs a Convolutional LSTM Autoencoder (ConvLSTM-AE) module, enabling effective learning and representation of temporal dependencies in video data. Consequently, discriminating features from attention modules are combined with the features extracted by the ConvLSTM-AE module, enhancing visual recognition capabilities for both spatial and temporal aspects. Our proposed architecture outperforms state-of-the-art methods on four benchmark datasets, showcasing AUC scores of 85.4% on Ped1, 97.9% on Ped2, 89.8% on Avenue, and 73.7% on the ShanghaiTech dataset. The results demonstrate the performance of our method in identifying unusual events in video data.
GAN-based adaptive cost learning for enhanced image steganography security

Authors:
raw_author_name: Dewang Wang
raw_affiliation_string: School of Information Science and Engineering, Hunan University, Changsha, 410082, China
raw_author_name: Gaobo Yang
raw_affiliation_string: School of Information Science and Engineering, Hunan University, Changsha, 410082, China
raw_author_name: Jiyou Chen
raw_affiliation_string: College of Computer Science and Technology, Hengyang Normal University, Hengyang, 421200, China
raw_author_name: Xiangling Ding
raw_affiliation_string: School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, 411201, China

Abstract: A well-defined cost function is a key issue for image steganography to minimize the embedding distortion. In recent years, deep learning has been introduced into image steganography to automatically learn embedding costs and improve steganographic security. For most existing generative adversarial network (GAN) based cost learning works, the generator usually adopts an encoder–decoder architecture. However, due to repeated encoding and decoding operations, this architecture is prone to information loss, making the generator difficult to well capture fine-grained image features. In this work, we propose a novel GAN-based image steganography work that improves the cost function by learning better embedding probability maps. Specifically, we design an attention mechanism to be integrated into the U-Net architecture, which enables the generator to concentrate on texture-rich regions of input images. Moreover, an extra input stream, namely the enhanced image, is introduced into the generator, improving the generator’s ability to learn structural features from input images. Different skip connections are used for different input streams to facilitate information flow between different layers. Extensive experimental results demonstrate that the proposed approach effectively learns the embedding probability maps and achieves superior security against various steganalysis attacks.
Explicit knowledge transfer of graph-based correlation distillation and diversity data hallucination for few-shot object detection

Authors:
raw_author_name: Meng Wang
raw_affiliation_string: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, Yunnan 650500, China
raw_author_name: Yang Wang
raw_affiliation_string: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, Yunnan 650500, China
raw_author_name: Haipeng Liu
raw_affiliation_string: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, Yunnan 650500, China

Abstract: The performance of few-shot object detection has seen marked improvement through fine-tuning paradigms. However, existing methods often depend on shared parameters to implicitly transfer knowledge without explicit induction. This results in novel-class representations that are easily confused with similar base classes and poorly suited to diverse patterns of variation in the truth distribution. In view of this, the present paper focuses on mining transferable base-class knowledge, which is further subdivided into inter-class correlation and intra-class diversity. First, we design a graph to dynamically capture the relationship between base and novel class representations, and then introduce distillation techniques to tackle the shortage of correlation knowledge in few-shot labels. Furthermore, an efficient diversity knowledge transfer module based on the data hallucination is proposed, which can adaptively disentangle class-independent variation patterns from base-class features and generate additional trainable hallucinated instances for novel classes. Experiments on VOC and COCO datasets confirmed that our proposed method effectively reduces the reliance on novel-class samples and demonstrates superior performance compared to other state-of-the-art baseline methods.