Reviewerly/exHarmony huggingface dataset:
A Joint Distribution Pricing Model of Express Enterprises Based on Dynamic Game Theory

With the development of sharing economy, a joint distribution mode has been increasingly adopted as the preferred cooperation mode of third-party logistics enterprises to achieve the efficient, resource-saving, and profit-optimal business goals of enterprises. In the joint distribution mode, the distribution price is one of key factors that influences the operation of the joint distribution. Thus, to acquire the optimal pricing for the logistics enterprises, we establish a pricing model based on dynamic game theory for a joint distribution system including one joint distribution company and two express enterprises. In the proposed model, two dimensions of games exist simultaneously, including the game between express competitors and the game between express and distribution enterprises. The multidimensional game leads to more complex system characteristics. Through the stability analysis, we find the Nash equilibrium point and its stability conditions. Numerical simulations are conducted to investigate the complex dynamical behaviors of the game model, such as the system stability region, the bifurcation diagram, the largest Lyapunov exponent, strange attractors, etc. The simulation results indicate that different price adjustment speeds and ranges have a significant impact on the system stability and the profits of all participants in the game. The parameter adjustment control can well dominate the chaotic behaviors of the system. Enterprises should make pricing decisions based on their market positions to promote the continuous and stable development of the operation mode of the multi-agent joint sharing distribution center.
TSNet: Token Sparsification for Efficient Video Transformer

In the domain of video recognition, video transformers have demonstrated remarkable performance, albeit at significant computational cost. This paper introduces TSNet, an innovative approach for dynamically selecting informative tokens from given video samples. The proposed method involves a lightweight prediction module that assigns importance scores to each token in the video. Tokens with top scores are then utilized for self-attention computation. We apply the Gumbel-softmax technique to sample from the output of the prediction module, enabling end-to-end optimization of the prediction module. We aim to extend our method on hierarchical vision transformers rather than single-scale vision transformers. We use a simple linear module to project the pruned tokens, and the projected result is then concatenated with the output of the self-attention network to maintain the same number of tokens while capturing interactions with the selected tokens. Since feedforward networks (FFNs) contribute significant computation, we also propose linear projection for the pruned tokens to accelerate the model, and the existing FFN layer progresses the selected tokens. Finally, in order to ensure that the structure of the output remains unchanged, the two groups of tokens are reassembled based on their spatial positions in the original feature map. The experiments conducted primarily focus on the Kinetics-400 dataset using UniFormer, a hierarchical video transformer backbone that incorporates convolution in its self-attention block. Our model demonstrates comparable results to the original model while reducing computation by over 13%. Notably, by hierarchically pruning 70% of input tokens, our approach significantly decreases 55.5% of the FLOPs, while the decline in accuracy is confined to 2%. Additional testing of wide applicability and adaptability with other transformers such as the Video Swin Transformer was also performed and indicated its progressive potentials in video recognition benchmarks. By implementing our token sparsification framework, video vision transformers can achieve a remarkable balance between enhanced computational speed and a slight reduction in accuracy.
Trajectory Planning of a Semi-Trailer Train Based on Constrained Iterative LQR

With the development of science and technology, self-driving technology is gradually being applied to automobile semi-trailer trains. Aiming at the problem that it is challenging to plan the traveling trajectory of an autonomous semi-trailer train, a trajectory planning algorithm based on a constrained iterative linear quadratic regulator is proposed. The constrained iterative linear quadratic regulator solves the problem that the iterative constrained linear quadratic regulator cannot deal with inequality constraints by transforming inequality constraints into interior point penalty functions to deal with all kinds of inequality constraints in the trajectory planning problem. When dealing with the obstacle avoidance problem, the body contour is modeled approximately according to the actual shape of the vehicle, and the obstacle avoidance constraints are transformed into inequality constraints. Considering the unique body structure of a semi-trailer train, the articulation angle constraint function is designed according to different vehicle speeds. Simulation experimental results show that the algorithm can plan safe driving trajectories for semi-trailer trains in complex traffic scenarios.
Document Difficulty Aspects for Medical Practitioners: Enhancing Information Retrieval in Personalized Search Engines

Timely and relevant information enables clinicians to make informed decisions about patient care outcomes. However, discovering related and understandable information from the vast medical literature is challenging. To address this problem, we aim to enable the development of search engines that meet the needs of medical practitioners by incorporating text difficulty features. We collected a dataset of 209 scientific research abstracts from different medical fields, available in both English and German. To determine the difficulty aspects of readability and technical level of each abstract, 216 medical experts annotated the dataset. We used a pre-trained BERT model, fine-tuned to our dataset, to develop a regression model predicting those difficulty features of abstracts. To highlight the strength of this approach, the model was compared to readability formulas currently in use. Analysis of the dataset revealed that German abstracts are more technically complex and less readable than their English counterparts. Our baseline model showed greater efficacy than current readability formulas in predicting domain-specific readability aspects. Conclusion: Incorporating these text difficulty aspects into the search engine will provide healthcare professionals with reliable and efficient information retrieval tools. Additionally, the dataset can serve as a starting point for future research.
Application of Virtual Reality in Learning Quantum Mechanics

Quantum mechanics is a physical theory that describes the behavior of microscopic matter. According to quantum theory, a microscopic particle may be described as either a particle or a wave, called wave–particle duality. Many students in high school or college (BC level) find it difficult to imagine that microscopic particles have both particle and wave properties. This is mainly caused by the scale of the world they see since quantum mechanics deals with things that are too small, while the wave and particle phenomena at the microscopic scale are difficult to understand, measure, or verify in the real world. In this study, virtual reality technology was used to develop teaching modules on quantum mechanics, allowing learners to see the particles and wave phenomena of electrons and photons in the microscopic world through interactive operation in virtual experiments. A teaching experiment was conducted by recruiting 60 high school students as research subjects. The control group (30 students) used physics textbooks, and the experimental group (30 students) used the virtual teaching modules for learning quantum mechanics. The analysis results show that the experimental group’s learning effectiveness is higher than the control group. The questionnaire results show that students were satisfied with the learning experience using virtual teaching modules with high learning motivation and low cognitive load because virtual reality can visualize the abstract concepts of wave–particle duality and help them understand quantum mechanics.
Key Influencing Factors Identification in Complex Systems Based on Heuristic Causal Inference

In complex systems constrained by multiple factors, it is very important to identify the key influencing factors for mastering the evolution and development law of a system and for obtaining scientific decision-making suggestions or schemes. At present, the method based on experimental simulation is limited by the difficulty of system model construction; DEMATEL (Factual Decision Trial and Evaluation Laboratory) is inevitably influenced by subjective factors. In view of this, we propose a novel model based on heuristic causal inference. By combining the network analysis in complex network science, the model defines the global/local causal pathway and the causal pathway’s length in the causal network and takes the causal pathway contribution degree as an indicator to measure the approximate causal effects. The model includes steps such as causal network learning, causal pathway contribution degree calculation, and key influencing factor identification. The model uses the Fast Causal Inference (FCI) algorithm with prior knowledge to learn the global causal network of the complex system and uses the heuristic causal inference to calculate the causal pathway contribution degree. The heuristic method draws on the idea of complex network topology analysis and measures the influence degree between variables by the number and distance of causal pathways. The key influencing factors are finally identified according to the causal pathway contribution degree. Based on the SECOM dataset, we carried out simulation experiments and demonstrated the feasibility and effectiveness of the proposed method.
Can Triplet Loss Be Used for Multi-Label Few-Shot Classification? A Case Study

Few-shot learning is a deep learning subfield that is the focus of research nowadays. This paper addresses the research question of whether a triplet-trained Siamese network, initially designed for multi-class classification, can effectively handle multi-label classification. We conducted a case study to identify any limitations in its application. The experiments were conducted on a dataset containing Hungarian legal decisions of administrative agencies in tax matters belonging to a major legal content provider. We also tested how different Siamese embeddings compare on classifying a previously non-existing label on a binary and a multi-label setting. We found that triplet-trained Siamese networks can be applied to perform classification but with a sampling restriction during training. We also found that the overlap between labels affects the results negatively. The few-shot model, seeing only ten examples for each label, provided competitive results compared to models trained on tens of thousands of court decisions using tf-idf vectorization and logistic regression.
A Federated Learning Method Based on Blockchain and Cluster Training

Federated learning (FL) is an emerging machine learning method in which all participants can collaboratively train a model without sharing their raw data, thereby breaking down data silos and avoiding privacy issues caused by centralized data storage. In practical applications, client data are non-independent and identically distributed, resulting in FL requiring multiple rounds of communication to converge, which entails high communication costs. Moreover, the centralized architecture of traditional FL remains susceptible to privacy breaches, network congestion, and single-point failures. In order to solve these problems, this paper proposes an FL framework based on blockchain technology and a cluster training algorithm, called BCFL. We first improved an FL algorithm based on odd–even round cluster training, which accelerates model convergence by dividing clients into clusters and adopting serialized training within each cluster. Meanwhile, compression operations were applied to model parameters before transmission to reduce communication costs and improve communication efficiency. Then, a decentralized FL architecture was designed and developed based on blockchain and Inter-Planetary File System (IPFS), where the blockchain records the FL process and IPFS optimizes the high storage costs associated with the blockchain. The experimental results demonstrate the superiority of the framework in terms of accuracy and communication efficiency.
Protective Factors for Developing Cognitive Skills against Cyberattacks

Cyberattacks capitalize on human behaviors. The prevalence of cyberattacks surged during the COVID-19 pandemic, fueled by the increased interconnectivity of individuals on online platforms and shifts in their psychological dynamics due to the pandemic’s context. The enhancement of human factors becomes imperative in formulating a robust cybersecurity strategy against social engineering in the post-COVID-19 era and in anticipation of analogous pandemics. This study aims to propose a model for delineating strategies across various phases of cyberattacks, grounded in the cyber kill chain model, while also encompassing cognitive mechanisms for adaptive responses. This approach aims to cultivate defensive cognitive factors like resilience and self-efficacy. To achieve this objective, we conducted an exploratory study adhering to Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. Subsequently, we pursued a descriptive and correlational study based on prevalent attacks during the pandemic. The intention was to pinpoint proactive factors conducive to the development of cognitive capabilities to counter cyberattacks. These insights could pave the way for the creation of training programs and technological solutions aimed at mitigating the impact of such cyberattacks.
Static Hand Gesture Recognition Based on Millimeter-Wave Near-Field FMCW-SAR Imaging

To address the limitations of wireless sensing in static gesture recognition and the issues of Computer Vision’s dependence on lighting conditions, we propose a method that utilizes millimeter-wave near-field SAR (Synthetic Aperture Radar) imaging for static gesture recognition. First, a millimeter-wave near-field SAR imaging system is used to scan the defined static gestures to obtain data. Then, based on the distance plane, the three-dimensional gesture is divided into multiple two-dimensional planes, constructing an imaging dataset. Finally, an HOG (Histogram of Oriented Gradients) is used to extract features from the imaging results, PCA (Principal Component Analysis) is applied for feature dimensionality reduction, and RF (Random Forest) performs classification. Experimental verification shows that the proposed method achieves an average recognition precision of 97% in unobstructed situations and 93% in obstructed situations, providing an effective means for wireless-sensing-based static gesture recognition.
GF-2 Data for Lithological Classification Using Texture Features and PCA/ICA Methods in Jixi, Heilongjiang, China

Lithological classification is a pivotal aspect in the field of geology, and traditional field surveys are inefficient and challenging in certain areas. Remote sensing technology offers advantages such as high efficiency and wide coverage, providing a solution to the aforementioned issues. The aim of this study is to apply remote sensing technology for lithological classification and attempt to enhance the accuracy of classification. Taking a study area in Jixi, Heilongjiang Province, China, as an example, lithological classification is conducted using high-resolution satellite remote sensing data from GF-2 and texture data based on gray-level co-occurrence matrix (GLCM). By comparing the accuracy of lithological classification using different methods, the support vector machine (SVM) method with the highest overall accuracy is selected for further investigation. Subsequently, this study compares the effects of combining GF-2 data with different texture data, and the results indicate that combining textures can effectively improve the accuracy of lithological classification. In particular, the combination of GF-2 and the Dissimilarity index performs the best among single-texture combinations, with an overall accuracy improvement of 7.8630% (increasing from 74.6681% to 82.5311%) compared to using only GF-2 data. In the multi-texture combination dataset, the Mean index is crucial for enhancing classification accuracy. Selecting appropriate textures for combination can effectively improve classification accuracy, but it is important to note that excessive overlaying of textures may lead to a decrease in accuracy. Furthermore, this study employs principal component analysis (PCA) and independent component analysis (ICA) to process the GF-2 data and combines the resulting PCA and ICA datasets with different texture data for lithological classification. The results demonstrate that combining PCA and ICA with texture data further enhances classification accuracy. In conclusion, this study demonstrates the application of remote sensing technology in lithological classification, with a focus on exploring the application value of different combinations of multispectral data, texture data, PCA data, and ICA data. These findings provide valuable insights for future research in this field.
Symmetrical Impulsive Inertial Neural Networks with Unpredictable and Poisson-Stable Oscillations

This paper explores the novel concept of discontinuous unpredictable and Poisson-stable motions within impulsive inertial neural networks. The primary focus is on a specific neural network architecture where impulses mimic the structure of the original model, that is, continuous and discrete parts are symmetrical. This unique modeling decision aligns with the real-world behavior of systems, where voltage typically remains smooth and continuous but may exhibit sudden changes due to various factors such as switches, sudden loads, or faults. The paper introduces the representation of these abrupt voltage transitions as discontinuous derivatives, providing a more accurate depiction of real-world scenarios. Thus, the focus of the research is a model, exceptional in its generality. To study Poisson stability, the method of included intervals is extended for discontinuous functions and B-topology. The theoretical findings are substantiated with numerical examples, demonstrating the practical feasibility of the proposed model.
Separable Gaussian Neural Networks: Structure, Analysis, and Function Approximations

The Gaussian-radial-basis function neural network (GRBFNN) has been a popular choice for interpolation and classification. However, it is computationally intensive when the dimension of the input vector is high. To address this issue, we propose a new feedforward network-separable Gaussian neural network (SGNN) by taking advantage of the separable property of Gaussian-radial-basis functions, which splits input data into multiple columns and sequentially feeds them into parallel layers formed by uni-variate Gaussian functions. This structure reduces the number of neurons from O(Nd) of GRBFNN to O(dN), which exponentially improves the computational speed of SGNN and makes it scale linearly as the input dimension increases. In addition, SGNN can preserve the dominant subspace of the Hessian matrix of GRBFNN in gradient descent training, leading to a similar level of accuracy to GRBFNN. It is experimentally demonstrated that SGNN can achieve an acceleration of 100 times with a similar level of accuracy over GRBFNN on tri-variate function approximations. The SGNN also has better trainability and is more tuning-friendly than DNNs with RuLU and Sigmoid functions. For approximating functions with a complex geometry, SGNN can lead to results that are three orders of magnitude more accurate than those of a RuLU-DNN with twice the number of layers and the number of neurons per layer.
The offline cash puzzle solved by a local blockchain

Abstract A major drawback in deploying central bank digital currencies (CBDC) is the offline puzzle, which requires that a CBDC must keep the liquidity provision given by cash, and, simultaneously, avoid double‐spending, cloning, and other issues. The puzzle is solved by minting the coins in serial numbers, which are stored on a local blockchain inside a smartphone or EMV card. The local blockchain is strengthened by a two‐stage approval architecture that mitigates attacks and enables non‐repudiation handling. The coins are protected by hardware keys embedded in the microchip and can be continuously mined by the wallet to enhance security. The coins can be either minted as hot coins, which can be retrieved in case of loss, or minted as cold coins, like physical cash.
Competences in the Function of Professional Work of Teachers

The teacher`s profession represents one of the most important and the most human professions. With their work, teachers influence on lives and development of their students importantly, and if affinities, abilities, and personalities of students will be developed in their full capacity depending on the teacher in a significant way. Through their personality, their knowledge, motivation, their competencies teachers influence the effectiveness of the whole educational process. On the other side, the success of an adult and its contribution to the development of any society depends on such effectiveness. Teachers` competencies development depends on their talent, wish, and readiness for permanent professional learning. The tempo of the technologies’ development today will require more and more adoption of changes which will, consequently, come in the educational process. So, this article aims to direct the analysis of the role of teachers` competencies and their professional development.
Cost-based Data Prefetching and Scheduling in Big Data Platforms over Tiered Storage Systems

The use of storage tiering is becoming popular in data-intensive compute clusters due to the recent advancements in storage technologies. The Hadoop Distributed File System, for example, now supports storing data in memory, SSDs, and HDDs, while OctopusFS and hatS offer fine-grained storage tiering solutions. However, current big data platforms (such as Hadoop and Spark) are not exploiting the presence of storage tiers and the opportunities they present for performance optimizations. Specifically, schedulers and prefetchers will make decisions only based on data locality information and completely ignore the fact that local data are now stored on a variety of storage media with different performance characteristics. This article presents Trident, a scheduling and prefetching framework that is designed to make task assignment, resource scheduling, and prefetching decisions based on both locality and storage tier information. Trident formulates task scheduling as a minimum cost maximum matching problem in a bipartite graph and utilizes two novel pruning algorithms for bounding the size of the graph, while still guaranteeing optimality. In addition, Trident extends YARN’s resource request model and proposes a new storage-tier-aware resource scheduling algorithm. Finally, Trident includes a cost-based data prefetching approach that coordinates with the schedulers for optimizing prefetching operations. Trident is implemented in both Spark and Hadoop and evaluated extensively using a realistic workload derived from Facebook traces as well as an industry-validated benchmark, demonstrating significant benefits in terms of application performance and cluster efficiency.