This paper focuses on quantifying the economic and financial viability of NB-IoT and LoRaWAN technologies, two low-power wide-area network (LPWAN) technologies with unique characteristics that make them suitable for IoT applications. The purpose of the study is to propose an artefact for performing life cycle cost analysis and demonstrate its application to these technologies. The methodology uses pragmatic computational tools to facilitate the analysis and considers all relevant economic and financial factors, such as operating costs, equipment costs, and revenue potential. The main finding of the study is that NB-IoT and LoRaWAN technologies have different cost structures and revenue potentials, which may affect their economic and financial viability for different IoT applications. Ultimately, the study concludes that a comprehensive life cycle cost analysis is critical to making informed decisions about technology adoption, and that the proposed methodology can be applied to other IoT technologies to gain insight into their economic and financial viability.

In the present-day digital landscape, websites have increasingly relied on digital marketing practices, notably search engine optimization (SEO), as a vital component in promoting sustainable growth. The traffic a website receives directly determines its development and success. As such, website owners frequently engage the services of SEO experts to enhance their website's visibility and increase traffic. These specialists employ premium SEO audit tools that crawl the website's source code to identify structural changes necessary to comply with specific ranking criteria, commonly called SEO factors. Working collaboratively with developers, SEO specialists implement technical changes to the source code and await the results. The cost of purchasing premium SEO audit tools or hiring an SEO specialist typically ranges in the thousands of dollars per year. Against this backdrop, this research endeavors to provide an open-source Python-based Machine Learning SEO software tool to the general public, catering to the needs of both website owners and SEO specialists. The tool analyzes the top-ranking websites for a given search term, assessing their on-page and off-page SEO strategies, and provides recommendations to enhance a website's performance to surpass its competition. The tool yields remarkable results, boosting average daily organic traffic from 10 to 143 visitors.

This manuscript presents a system that can generate a 2D grid map and a 3D voxel model of an environment by fusing multiple sensors integrated into a robot. The fusion of these sensors is done by utilizing Robot Operating System (ROS) and some of its libraries. The sensors that are fused in the robot are a Light Detection and Ranging (LIDAR), Inertial Measurement Units (IMU), wheel encoders, and a Time-of-Flight camera. With the fusion of the point cloud data information obtained with the Time-of-Flight camera, the laser information of the LIDAR sensor, in addition to the odometry generated with the other sensors, a 2D grid map and a 3D model of two different environments were created, thus testing the performance of the system.

Diabetes is a serious health problem throughout the world, including in Indonesia. The International Diabetes Federation (IDF) reports that the number of adults with diabetes is increasing every year. The Behavioral Risk Factor Surveillance System (BRFSS) is a survey conducted by the Centers for Disease Control and Prevention (CDC) in the United States. Classification methods in data mining techniques are used to classify diabetics and non-diabetics. The data mining process is carried out by preprocessing, feature selection, and dataset classification stages. In the preprocessing stage, data cleaning, data formatting, and data oversampling are carried out using the Synthetic Minority Over-sampling Technique (SMOTE). Next, the feature selection stage is carried out using the Particle Swarm Optimization (PSO) algorithm to find the best attributes. The dataset classification stage is carried out using the CART Model Decision Tree algorithm. The results of the performance evaluation of the CART algorithm are calculated using the confusion matrix and the MAE value, the results obtained for the CART algorithm without SMOTE and PSO obtained the best accuracy of 75.34% and the MAE value of 0.2466, while the CART algorithm using SMOTE and PSO can increase accuracy by 10 .94% to 86.28% and an MAE value of 0.1372.

In this paper is presented the design and syntheis of a dynamic output feedback neural network controller for a non-holonomic mobile robot. First the dynamic model of a non-holonomic mobile robot is presented, in which these constraints are considered for the mathematical derivation of a feasable representation for this kind of robot. Then two control strategies are provided based on kinematic control for this kind of robot. The first control strategy is based on driftless control, this means, that considering that the velocity vector of the mobile robot is orthogonal to its restriction a dynamic output feedback and neural network controller is designed in order that the control action would be zero only when the velocity of the mobile robot is zero. The Lyapunov stability theorem is implemented in order to find a suitable control law. Then another control strategy is designed for trajectory tracking purposes, which similar to the driftless controller, a kinematic control scheme is provided but suitable to implement in more sophisticated hardware. In both control strategy a dynamic control law is provided along with a feedforward neural network controller, so in this way, by the Lyapunov theory the stability and convergence to the origin of the mobile robot position coordinates is ensured. Finally, two numerical experiment are presented in order to validate the theoretical results synthetized in this research study. Discussions and conclusions are provided in order to analyze the results found in this research study.

Natural image matting is an essential technique for image processing that enables various applications, such as image synthesis, video editing, and target tracking. However, the existing image matting methods may fail to produce satisfactory results when computing resources are limited. Sampling-based methods can reduce the dimensionality of the decision space and therefore reduce computational resources by employing different sampling strategies. While these approaches reduce computational consumption, they may miss an optimal pixel pair when the number of available high-quality pixel pairs is limited. To address this shortcoming, we propose a novel multi-criterion sampling strategy that avoids missing high-quality pixel pairs by incorporating multi-range pixel pair sampling and high-quality samples selection method. This strategy is employed to develop a multi-criterion matting algorithm via Gaussian process, which searches for the optimal pixel pair by using the Gaussian process fitting model instead of solving the original pixel pair objective function. Experimental results demonstrate that our proposed algorithm outperforms other methods even with 1% computing resources, and achieves alpha matte results comparable to those yielded by the state-of-the-art optimization algorithms.

Discrete distribution estimation is a fundamental statistical tool, which is widely used to perform data analysis tasks in various applications involving sensitive personal information. Due to privacy concerns, individuals may not always provide their raw information, which leads to unpredictable biases in the final results of estimated distribution. Local Differential Privacy (LDP) is an advanced technique for privacy protection of discrete distribution estimation. Currently, typical LDP mechanisms provide same protection for all items in the domain, which imposes unnecessary perturbation on less sensitive items and thus degrades the utility of final results. Although, several recent works try to alleviate this problem, the utility can be further improved. In this paper, we propose a novel notion called Item-Oriented Personalized LDP (IPLDP), which independently perturbs different items with different privacy budgets to achieve personalized privacy protection. Furthermore, to satisfy IPLDP, we propose the Item-Oriented Personalized Randomized Response (IPRR) based on the observation that the sensitivity of data shows an inverse relationship with the population size of respective individuals. Theoretical analysis and experimental results demonstrate that our method can provide fine-grained privacy protection and improve data utility simultaneously.

In recent years, intelligent identification and prediction of ore deposits based on deep learning algorithm and image processing technology has gradually become one of the research frontiers in the field of geological and metallogenic prediction. However, this method also has many problems that need to be solved. For example, (1) very few trainable image samples containing mineral point labels; (2) The geological image features are small and irregular, and the image similarity is high; (3) It is difficult to calculate the influence of different geological prospecting factors on ore mineralization. Based on this, this paper constructs a deep learning network model Multiscale Feature Attention Framework (MFAF) based on geo-image data. The results show that MFCA-Net module in MFAF model can solve the problem of scarce mine label images to a certain extent. In addition, the channel attention mechanism SE-Net module can quantify the difference of influence of different source factors on mineralization. The prediction map is obtained by applying the MFAF model in the study of deposit identification and prediction in the research area of the southern section of Qin-hang metallogenic Belt. In the forecast map, many regions have high metallogenic potential. Through observation, it is found that the above predicted area covers 100% of the known ore deposits at present, which has a good prediction effect. Later, we can find out the specific reasons through field verification. The multi-scale feature fusion and attention mechanism MFA Framework in this paper can provide a new way of thinking for geologists in mineral exploration. The research of this paper also provides resource guarantee and technical support for the sustainable exploitation of mineral resources and the sustainable growth of society and economy.

Infrared detection plays an important role in the military, aerospace, and other fields, which has the advantages of all-weather, high stealth, and strong anti-interference. However, infrared dim small target detection suffers from complex backgrounds, low signal-to-noise ratio, blurred targets with small area percentages, and other challenges. In this paper, we proposed a multiscale YOLOv5-AFAM algorithm to realize high-accuracy and real-time detection. Aiming at the problem of target intra-class feature difference and inter-class feature similarity, the Adaptive Fusion Attention Module - AFAM was proposed to generate feature maps that are calculated to weigh the features in the network and make the network focus on small targets. This paper proposed a multiscale fusion structure to solve the problem of small and variable detection scales in infrared vehicle targets. In addition, the downsampling layer is improved by combining Maxpool and convolutional downsampling to reduce the number of model parameters and retain the texture information. For multiple scenarios, we constructed an infrared dim and small vehicle target detection dataset, ISVD. The multiscale YOLOv5-AFAM was conducted on the ISVD dataset, compared to YOLOv7, mAP@0.5 achieves a small improvement while the parameters are only 17.98% of it. By contrast with the YOLOv5s model, mAP@0.5 was improved by 4.3% with a 6.6% reduction in the parameters. Experiments results demonstrate that the multiscale YOLOv5-AFAM has a higher detection accuracy and detection speed on infrared dim and small vehicles.

Drowsiness detection is an important task in road safety and other areas that require sustained attention. In this article, an approach to detect drowsiness in drivers is presented, focusing on the eye region, since eye fatigue is one of the first symptoms of drowsiness. The method used for the extraction of the eye region is Mediapipe, chosen for its high accuracy and robustness. Three neural networks were analyzed based on: InceptionV3, VGG16 and ResNet50V2 that implement deep learning. The database used is NITYMED, which contains videos of drivers with different levels of drowsiness. The three networks were evaluated in terms of accuracy, precision and recall in detecting drowsiness in the eye region. The results of the study show that all three convolutional neural networks have high accuracy in detecting drowsiness in the eye region. In particular, the Resnet50V2 network achieved the highest accuracy, with a rate of 99.71% on average. For better visualization of the data, the Grad-CAM technique is used, with which we get a better understanding of the performance of the algorithms in the classification process.

A medical entity (hospital, nursing home, rest home, revalidation center, etc.) usually includes a multitude of information systems that allow for quick decision-making close to the medical sensors. The Internet of Medical Things (IoMT) is an area of IoT that generates a lot of data of different natures (radio, CT scan, medical reports, medical sensor data). However, these systems need to share and exchange medical information in a seamless, timely, and efficient manner with systems that are either located within the same entity or located in other healthcare entities. The lack of inter and intra entity interoperability causes major problems in the analysis of patient records and leads to additional financial costs (e.g., redone examinations). In order to develop a medical data interoperability architecture model that will allow providers and different actors in the medical community to exchange patient summary information with other caregivers and partners in order to improve the quality of care, the level of data security, and the efficiency of care, we take stock of the state of knowledge.

Accurately estimating a person's age is crucial for identity verification at all critical checkpoints, including airports, land borders, and seaports. Human gait may be used as a biometric identifier and indicator of age, among other things. This study aims to develop methods for estimating a person's age by observing their walk. In this paper, a novel technique for preprocessing the proposed gait dataset has been used by utilizing a combination of the gait energy image (GEI), the accumulated frame difference energy image (AFDEI), and the invariant moment of the image. The proposed technique outperformed state-of-the-art methods in terms of accuracy. The proposed method was tested and evaluated using a convolutional neural network (CNN), and it achieved an average accuracy of 90.35% across 14 different view angles within 5 K-Fold, the proposed method resulted in 94.68% and 94.54% in 30º and 75º view degree respectively. concluding that the approach is effective and promising for estimating age using human gait.

The presence of fog in the background can prevent small and distant objects from being detected, let alone tracked. Under safety-critical conditions, multi-object tracking models require faster-tracking speed while maintaining high object-tracking accuracy. The original DeepSORT algorithm used YOLOv4 for the detection phase, and a simple neural network for deep appearance descriptor. Consequently, the feature map generated loses relevant details about the track being matched with a given detection in fog. Targets with a high degree of appearance similarity on the detection frame are more likely to be mismatched, resulting in identity switches or track failures in heavy fog. We propose an improved multi-object tracking model based on the DeepSORT algorithm to im-prove tracking accuracy and speed under foggy weather conditions. First, we employed our camera-radar fusion network (CR-YOLOnet) in the detection phase for faster and more accurate object detection. We proposed an appearance feature network to replace the basic convolutional neural network. We incorporated GhostNet to take the place of the traditional convolutional layers to generate more features and reduce computational complexities and cost. We adopted a segmentation module and fed the semantic labels of the corresponding input frame to add rich semantic information to the low-level appearance feature maps. Our proposed method outperformed YOLOv5 + DeepSORT with a 35.15% increase in multi-object tracking accuracy, a 32.65% increase in multi-object tracking precision, the speed increased by 37.56%, and identity switches decreased by 46.81%.

Object classification is a crucial task in deep learning, which involves the identification and categorization of objects in images or videos. Although humans can easily recognize common objects, such as cars, animals, or plants, performing this task on a large scale can be time-consuming and error-prone. Therefore, automating this process using neural networks can save time and effort while achieving higher accuracy. Our study focuses on the classification step of human chromosome karyotyping, an important medical procedure that helps diagnose genetic disorders. Traditionally, this task is performed manually by expert cytologists, which is a time-consuming process that requires specialized medical skills. Therefore, automating it through deep learning can be immensely useful. To accomplish this, we implemented and adapted existing preprocessing and data augmentation techniques to prepare the chromosome images for classification. We used ResNet-50 convolutional neural networks and an ensemble approach to classify the chromosomes, obtaining state-of-the-art performance in the tested dataset.

With the daily increasing demands for higher-quality services, mobile Internet of Things (MIoT) are facing various challenges, such as communication security, availability, scalability, etc. Its changing topology features bring a lot of trouble when solving the above problems. Though the evolved cellular network is expected to bring promising solutions, some inherent problems in traditional MIoTs may keep hindering its development. Thus, to overcome above problems, we propose a software-defined MIoTs-based model providing communication security and privacy protection under emergencies. In our scheme, the control plane is responsible to compute routes for online learning devices (OLDs), and forward entries for switches. Taking use of information that OLDs and facilities collect, controller is able to coordinate the overall situation. To ensure the authenticity and reliability of messages sent by OLDs, signature and authentication should be provided. We also introduce an emergency-dealing system. It transplants the multicast technology into software-defined MIoTs to generate a Steiner Tree among impacted nodes, so that OLDs will be informed as soon as emergency happening. The security analysis proves that our scheme is able to ensure the communication security in software-defined MIoTs. The evaluation of performance indicates that our scheme outperforms other existing schemes.

(1) Background: Artificial intelligence (AI) has existed in some form for decades, but recent rapid advances in a subset called machine learning (ML) — and more specifically deep learning (DL), a neural network-based approach — have made headlines for the potential to revolutionize and automate multiple large sectors of society, including scientific research and the healthcare field. Furthermore, large language models (LLMs) — which are built on DL — could lead to a more seamless, natural interaction between humans and computers. (2) Methods: We reviewed numerous publications on this subject from recent years. (3) Results: We found these studies collectively show that AI is positively disrupting both biomedical research and medical practice, such as optical imaging in surgery guidance. (4) Conclusions: However, we recommend caution in over-reliance on AI in the laboratory or the clinic due to anticipated risks and current limitations.

The use of artificial intelligence in natural language processing (NLP) has significantly contributed to the advancement of natural language applications such as sentimental analysis, topic modeling, text classification, chatbots, and spam filtering. With a large amount of text generated each day from different sources such as webpages, blogs, emails, social media, and articles, one of the most common tasks in natural language processing is the classification of a text corpus. This is important in many institutions for planning, decision-making, and archives of their projects. Many algorithms exist to automate text classification operations but the most intriguing of them is that which also learns these operations automatically. In this study, we present a new model to infer and learn from data using probabilistic logic and apply it to text classification. This model, called GenCo, is a multi-input single-output (MISO) learning model that uses a collaboration of partial classifications to generate the desired output. It provides a heterogeneity measure to explain its classification results and enables the reduction of the curse of dimensionality in text classification. The classification results are compared with those of conventional text classification models, and it shows that our proposed model has a higher classification performance than conventional models.

Voice cloning, an emerging field in the speech processing area, aims to generate synthetic utterances that closely resemble the voices of specific individuals. In this study, we investigate the impact of various techniques on improving the quality of voice cloning, specifically focusing on a low-quality dataset. To contrast our findings, we also use two high-quality corpora for comparative analysis. We conduct exhaustive evaluations of the quality of the gathered corpora in order to select the most suitable audios for the training of a Voice Cloning system. Following these measurements, we conduct a series of ablations by removing audios with lower SNR and higher variability in utterance speed from the corpora in order to decrease their heterogeneity. Furthermore, we introduce a novel algorithm that calculates the fraction of aligned input characters by exploiting the attention matrix of the Tacotron 2 Text-to-Speech (TTS) system. This algorithm provides a valuable metric for evaluating the alignment quality during the voice cloning process. We present the results of our experiments, demonstrating that the performed ablations significantly increase the quality of synthesised audios for the challenging low-quality corpus. Notably, our findings indicate that models trained on a 3-hour corpus from a pre-trained model exhibit comparable audio quality to models trained from scratch using significantly larger amounts of data.

Almost contact complex Riemannian manifolds, known also as almost contact B-metric manifolds, are in principle equipped with a pair of mutually associated pseudo-Riemannian metrics. Each of these metrics is specialized here as a Yamabe almost soliton with a potential collinear to the Reeb vector field. The resulting manifolds are then investigated in two important cases with geometric significance. The first is when the manifold is of Sasaki-like type, i.e. its complex cone is a holomorphic complex Riemannian manifold (also called a Kähler–Norden manifold). The second case is when the soliton potential is torse-forming, i.e. it satisfies a certain recurrence condition for its covariant derivative with respect to the Levi-Civita connection of the corresponding metric. The studied solitons are characterized. In the three-dimensional case, an explicit example is constructed and the properties obtained in the theoretical part are confirmed.

Practical entanglement distillation is a critical component in quantum information theory. Entanglement distillation is often utilized for designing quantum computer networks and quantum repeaters. The practical entanglement distillation problem is formulated as a bilevel optimization problem. A fuzzy formulation is introduced to estimate the quantum state (density matrix) from pseudo-likelihood functions (i.e., quantum state tomography). A scale-independent relationship between fuzzy relations in terms of the pseudo-likelihood functions is obtained. The entanglement distillation optimization problem was solved using the combined coupled map lattice and dual annealing approach. Comparative analysis of the results is then conducted against a standard dual annealing algorithmic implementation.

At present, aeroponic control is mainly regulated according to the environmental factors of aeroponics, such as the temperature, humidity, light intensity, carbon dioxide concentration, pH, and electrical conductivity (EC) of the nutrient solution. There is a lack of knowledge available in the literature for an aeroponic control system for plant growth information as the primary feedback signal. Therefore, a fuzzy logic-controlled aeroponics system was developed for the growth of lettuce as a feedback signal. After designing, the effectiveness test of system was performed with experiment having three treatments T1 (180C), T2 (220C) and without control (CK). The results show an increasing trend in shoot length, root length, and shoot area over time in all treatments. In terms of shoot area, the maximum of 345 cm² was observed in the T1 treatment, while the CK treatment had a minimum of 241.8 cm². Statistical analysis indicated that the T1 and T2 treatments were not significantly different, but both were significantly different from the CK treatment. The study demonstrates the effectiveness of the fuzzy logic control system and an 18°C nutrient solution temperature, resulting in improved lettuce growth and reduced root-to-shoot ratio. The findings suggest the potential of using fuzzy logic control in aeroponics for optimized cultivation outcomes.

Virtual assistants (VAs) have gained widespread popularity across a wide range of applications, and the integration of Large Language Models (LLMs) such as ChatGPT has opened up new possibilities for developing even more sophisticated VAs. However, this integration poses new ethical issues and challenges that must be carefully considered, particularly as these systems are increasingly used in public services: transfer of personal data, decision-making transparency, potential biases, and privacy risks. This paper, an extension of the work presented at IberSPEECH 2022, analyzes the current regulatory framework for AI-based VAs in Europe and delves into ethical issues in depth, examining potential benefits and drawbacks of integrating LLMs with VAs. Based on the analysis, this paper argues that the development and use of VAs powered by LLMs should be guided by a set of ethical principles that prioritize transparency, fairness, and harm prevention. The paper presents specific guidelines for the ethical use and development of this technology, including recommendations for data privacy, bias mitigation, and user control. By implementing these guidelines, the potential benefits of VAs powered by LLMs can be fully realized while minimizing the risks of harm and ensuring that ethical considerations are at the forefront of the development process.

In this paper we exploit concepts from Information Theory to improve the classical Chvatal’s greedy algorithm for the Set Covering Problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the computation of a “surprisal” measure when selecting the solution columns. Computational experiments, performed on instances from the OR-Library, show that SBH yields a 2.5% improvement in terms of the objective function value over the Chvatal’s algorithm while retaining similar execution times, making it suitable for real-time applications. The new heuristic was also compared with Kordalewski’s greedy algorithm, obtaining similar solutions with much lower times on large instances, and Grossmann and Wool’s algorithm for unicost instances, where SBH obtained better solutions.

CNN-based off-the-shelf features have shown themselves as a good baseline for trademark retrieval. However, in recent years, the computer vision area was transitioning from CNNs to a new architecture – Vision Transformer. In this paper, we investigate the performance of off-the-shelf features extracted with vision transformers and explore the effects of pre, post-processing, and pre-training on big datasets. We propose a method of joint usage of global and local features, which leverages the best aspects of both approaches. Experimental results on METU Trademark Dataset show that off-the-shelf features extracted with ViT-based models outperform off-the-shelf features from CNN-based models. The proposed method achieves the mAP value of 31.23, surpassing previous state-of-the-art results. We assume that the proposed approach for the trademark similarity evaluation will allow one to improve the protection of such data with the help of artificial intelligence methods. Moreover, this approach will allow one to identify cases of unfair use of such data and form an evidence base for litigation.

We develop the theory of Heyting locally small spaces, including Stone-like dualities such as a new version of Esakia duality and a system of concrete isomorphisms and equivalences. In such a way, we continue building tame topology, realising Grothendieck's ideas. We use up-spectral spaces and define the standard up-spectralification of a Kolmogorov locally small space. This research gives more understanding of locally definable spaces over structures with topologies.

With the growing popularity of smartphones, user identification has become an essential component of maintaining security and privacy. This study investigates how smartphone accelerometer data can be used to identify users, and it makes recommendations for the ideal application parts. Accelerometer data from the HMOG public dataset was used to train deep learning, conventional classifiers, and voting classifiers, which were then utilized to identify users. To enhance performance, feature selection and pre-processing techniques were researched. The results show that RFE feature selection outperforms other approaches and that LSTM followed by XGBoost has the best identification performance as indicated by a relatively large number of machine learning performance measures. The proposed identification system nevertheless performed well and outperformed existing methods, which were principally created and tested on the same HMOG public smartphone dataset, even with a larger number of users. Further work would be necessary for such an application to reach its full potential, though.

A well-known result of Posner’s second theorem states that if the commutator of each element in a prime ring and its image under a nonzero derivation is central, then the ring is commutative. In the present paper, we extend this bluestocking theorem to an arbitrary ring with involution involving prime ideals. Further, apart from proving several other interesting and exciting results, we establish *-version of Vukman’s theorem [48, Theorem 1]. Precisely, we describe the structure of quotient ring A/L, where A is an arbitrary ring and L is a prime ideal of A. Further, by taking advantage of the *-version of Vukman’s theorem, we show that if a 2-trosion free semiprime ring A with involution admits a nonzero *-centralizing derivation, then A contains a nonzero central ideal. This result is in a spirit of the classical result due to Bell and Martindale [19, Theorem 3]. As the applications, we extends and unify several classical theorems proved in [6],[25,[42], and [48] . Finally, we conclude our paper with a direction for further research.

To assist Java programming learning of novice students, we have developed the web-based Java programming learning assistant system (JPLAS). JPLAS provides several types of exercise problems to cultivate code reading/writing skills at various levels. In JPLAS, the code writing problem (CWP) asks a student to write a source code that will pass the test code given in the assignment where the correctness is verified by running them on JUnit. In this paper, to reduce the teacher load at marking process, we present the answer code validation program that verifies all the source codes from a lot of students for each assignment at a time and reports the number of passing tests for each source code in the CSV file. Besides, to test a source code with various input data, we implement the test data generation algorithm that identifies the data type, generates a new data, and replaces it for each test data in the test code. Furthermore, to verify the correctness of the implemented procedure in the source code, we introduce the intermediate state testing in the test code. For evaluations, we applied the proposal to source codes and test codes in a Java programming course in Okayama university, Japan, and confirmed the validity and effectiveness.

Fine-grained image classification remains an ongoing challenge in the computer vision field, which is particularly intended to identify objects within sub-categories. It is a difficult task since there is a minimal and substantial intra-class variance. The current methods address the issue by first locating selective regions with Region Proposal Networks (RPN), object localization, or part localization, followed by implementing a CNN Network or SVM classifier to those selective regions. This approach, however, makes the process simple by implementing a single-stage end-to-end feature encoding with a localization method, which leads to improved feature representations of individual tokens/regions by integrating the transformer encoder blocks into the Yolov5 backbone structure. These Transformer Encoder Blocks, with their self-attention mechanism, effectively captured the global dependencies and enabled the model to learn relationships between distant regions. This improved the model ability to understand context and captured long-range spatial relationships in the image. We also replaced the Yolov5 detection heads with three transformer heads at the output for object recognition using the discriminative and informative features maps from transformer encoder blocks. We established the potential of the single stage detector for the fine-grained image recognition task, by achieving state of the art 93.4% accuracy, as well as outperforming the existing Yolov5 model. The effectiveness of our approach is assessed using the Stanford car dataset, which includes 16,185 images of 196 different classes of vehicles with significantly identical visual appearances.

Nowadays, the selection of web services with uncertain quality of service (QoS) is gaining a lot of attention in the service-oriented computing paradigm (soc). In fact, searching for a service composition that fulfills a complex user’s request is known to be NP-Complete. The search time is mainly dependent on the number of the requested tasks, the size the available services, and the size of the QoS realizations (i.e., sample size). To handle this problem, we propose a two-stage approach that reduces the search space using heuristics for ranking the tasks’ services and a bat algorithm metaheuristic for selecting the final near optimal compositions. The fitness used by the metaheuristic aims to fulfill all the global constraints of the user. The experimental study shows that the ranking heuristics, termed “fuzzy pareto dominance” and "Zero-order stochastic dominance", are highly effective than the other heuristics and most of the existing state-of-the-art methods.

As the global population rapidly ages with longer life expectancy and declining birth rates, the need for healthcare services and caregivers for older adults is increasing. Current research envisions addressing this shortage by introducing domestic service robots to assist with daily activities. The successful integration of robots as domestic service providers in our lives requires them to possess efficient manipulation capabilities, provide effective physical assistance, and have adaptive control frameworks that enable them to develop social understanding during human-robot interaction. In this context, human factors, especially quantifiable ones, represent a necessary component. The objective of this paper is to conduct an unbiased review encompassing studies on human factors studied in research involving physical interactions and strong manipulation capabilities. We identified the prevalent human factors in physical human-robot interaction (pHRI), noted the factors typically addressed together and determined the frequently utilized assessment approaches. Additionally, we gathered and categorized proposed quantification approaches based on measurable data for each human factor. We also formed a map of common contexts and applications addressed in pHRI for a comprehensive understanding and easier navigation of the field. We found out that most of the studies in direct pHRI (when there is direct physical contact) focus on social behaviors with belief being the most commonly addressed human factor type. Task collaboration is moderately investigated, while physical assistance is rarely studied. In contrast, indirect pHRI (when the physical contact is mediated via a third item) studies often involve industrial settings, with physical ergonomics being the most frequently investigated human factor. More research is needed on human factors in direct and indirect physical assistance applications, including studies that combine physical social behaviors with physical assistance tasks. We also found that while the predominant approach in most studies involves the use of questionnaires as the main method of quantification, there is a recent trend that seeks to address quantification approaches based on measurable data.

In Taiwan, peanuts are classified by hand. The kernel quality is judged based on the appearance of peanuts. The identification takes considerable time and labor. Fatigue can induce misrecogni-tion or grade cognition instability due. Peanut defects are generally divided into health, underde-velopment, insect bite, and rupture. This study employed two imaging methods push-boom FX10 and Snapshot. Deep learning was used to detect peanut defects. A push-broom instrument was used for testing. There were 1,560 peanuts, including 240 good and 240 bad ones. There were a total of 1,080 good peanuts and bad peanuts in the test set data, the band selection was used, and a CNN model was built. Based on the results from three methods, 3DCNN could classify with 97%accuracy. The Snapshot was used to achieve the real-time design of a lightweight CNN model. Finally, five bands were selected using PCA, and the screening could be accurate and efficient. The maximum overall accuracy was about 98.5%. Kappa was 97.3% with real-time recognition. This will be a major advantage in the future practical application and commercialization processes. This technique can reduce labor costs, achieve intelligent detection and intelligent grading, and bring breakthroughs to smart agriculture for other crops as well.

Let $(\{f_j\}_{j=1}^n, \{\tau_j\}_{j=1}^n)$ and $(\{g_k\}_{k=1}^n, \{\omega_k\}_{k=1}^n)$ be two p-orthonormal bases for a finite dimensional Banach space $\mathcal{X}$. Let $M,N\subseteq \{1, \dots, n\}$ be such that \begin{align*} o(M)^\frac{1}{q}o(N)^\frac{1}{p}< \frac{1}{\displaystyle \max_{1\leq j,k\leq n}|g_k(\tau_j) |}, \end{align*} where $q$ is the conjugate index of $p$. Then for all $x \in \mathcal{X}$, we show that \begin{align}\label{FGJU} (1) \quad \quad \quad \quad \|x\|\leq \left(1+\frac{1}{1-o(M)^\frac{1}{q}o(N)^\frac{1}{p}\displaystyle\max_{1\leq j,k\leq n}|g_k(\tau_j)|}\right)\left[\left(\sum_{j\in M^c}|f_j(x)|^p\right)^\frac{1}{p}+\left(\sum_{k\in N^c}|g_k(x) |^p\right)^\frac{1}{p}\right]. \end{align} We call Inequality (1) as \textbf{Functional Ghobber-Jaming Uncertainty Principle}. Inequality (1) improves the uncertainty principle obtained by Ghobber and Jaming \textit{[Linear Algebra Appl., 2011]}.

Programmable Object Interfaces are increasingly intriguing researchers because of their broader applications, especially in the medical field. In Wireless Body Area Network (WBAN), for example, the patients’ health can be monitored using clinical nano sensors. Exchanging such sensitive data requires a high level of security and protection against attacks. To that end, the literature is rich with security schemes that include the advanced encryption standard, secure hashing algorithm, and digital signatures that aim to secure the data exchange. However, such schemes elevate the time complexity rendering the data transmission slower. Cognitive Radio technology with a medical body area network system involves communication links between WBAN gateways, server and nano sensors rendering the entire system vulnerable to security attacks. In this paper, a novel DNA-based encryption technique is proposed to secure medical data sharing between sensing devices and central repositories. It has less computational time throughout authentication, encryption, and decryption. Our analysis of experimental attack scenarios shows that our technique is better than its counterparts.

We propose a new scheme based on ephemeral elliptic curves over the ring Z/nZ where n=pq is an RSA modulus with p=up^2+vp^2, q=uq^2+vq^2, up≡uq≡3(mod4). The new scheme is a variant of both the RSA and the KMOV cryptosystems. The scheme can be used for both signature and encryption. We study the security of the new scheme and show that is immune against factorization attacks, discrete logarithm problem attacks, sum of two squares attacks, sum of four squares attacks, isomorphism attacks, and homomorphism attacks. Moreover, we show that the private exponents can be much smaller than the ordinary exponents for RSA and KMOV, which makes the decryption phase in the new scheme more efficient.

Analytical mechanics is the most basic discipline. The basic principles of analytical mechanics should also be applicable to general deformed objects. However, the virtual displacement principle proposed by analytical mechanics is only applicable to particle systems and rigid body systems, but not to general deformed objects. In this paper, the generalized virtual displacement principle of general deformed objects (such as, elastic objects, plastic objects, elasto-platic objects and flexible objects etc ) is derived by the method of analytical mechanics, which is also applicable to particle systems and rigid body systems. First of all, according to the method of analytical mechanics, the external force, internal force, constraint reaction force and elastic recovery force of the deformed object system under the equilibrium state are analyzed, and the concepts of virtual displacement, ideal constraint and virtual work are introduced, and the generalized virtual displacement principle (also called generalized virtual work principle) of deformed objects is proposed; secondly, vector form, coordinate component form and generalized coordinate form of generalized virtual displacement principle of deformed object are given; thirdly, as the application of the principle, the virtual displacement principle of deformed objects in plane polar coordinate system, space cylindrical coordinate system and spherical coordinate system is given; finally, a brief conclusion is drawn. This work unifies the virtual displacement principle of elastic object, plastic, elastoplastic etc deformed object systems and rigid object systems with the basic method of analytical mechanics. It is a basic principle for dealing with the static problems of deformed objects. This work also lays a foundation for the further study of the dynamics of deformed object systems.

This paper proposes an algorithm for transmitting and reconstructing the estimated point cloud using temporally estimating a dynamic point cloud sequence. When a non-rigid 3D point cloud sequence (PCS) is input, the sequence is divided into groups of point cloud frames (PCF), and a key PCF is selected. After the 3D skeleton is predicted through 3D pose estimation, the motion of the skeleton is estimated by analyzing the joints and bones of the 3D skeleton. For the deformation of the non-rigid human PC, the 3D PC model is transformed into a mesh model, and the key PCF is rigged using the 3D skeleton. After deforming the key PCF into the target PCF utilizing the motion vector of the estimated skeleton, the residual PC between the motion compensation PCF and the target PCF is generated. If there is a key PCF, the motion vector of the target PCF, and a residual PC, the target PCF can be reconstructed. Just as compression is performed using pixel correlation between frames in a 2D video, this paper compresses 3D PCF by estimating the non-rigid 3D motion of a 3D object in a 3D PC. The proposed algorithm can be regarded as an extension of the 2D motion estimation of a rigid local region in a 2D plane to the 3D motion estimation of a non-rigid object (human) in 3D space. Experimental results show that the proposed method can successfully compress 3D PC sequences. If it is used together with a PC compression technique such as MPEG PCC (point cloud compression) in the future, a system with high compression efficiency may be configured.

In actuarial practice, the modeling of total losses tied to a certain policy is a non-trivial task. Traditional parametric models to predict total losses have limitations due to complex distributional features such as extreme skewness, zero inflation, multi-modality, etc., and the lack of explicit solutions for log-normal convolution. In the recent literature, the application of the Dirichlet process mixture for insurance loss has been proposed to eliminate the risk of model misspecification biases; however, the effect of covariates as well as missing covariates in the modeling framework is rarely studied. In this article, we propose novel connections among covariate-dependent Dirichlet process mixture, log-normal convolution, and missing covariate imputation. Assuming an individual loss is log-normally distributed, we develop a log skew-normal Dirichlet process to approximate the log-normal sum. As a generative approach, our framework models the joint of outcome and covariates, which allows to impute missing covariates under the assumption of missingness at random. The performance is assessed by applying our model to several insurance datasets, and the empirical results demonstrate the benefit of our model compared to the existing actuarial models such as the Tweedie-based generalized linear model, generalized additive model, or multivariate adaptive regression spline.

Variations in groundwater levels that are noticed in different parts of the world are typically the primary focus of research carried out in hydrology. The fluctuating levels of groundwater can be ascribed to several different factors, some of which include an increase in the demand for water, inappropriate irrigation practices, improper management of soil, and unregulated extraction from aquifers. It is necessary to effectively manage groundwater resources to have a trustworthy method of measuring and forecasting groundwater levels. The dynamics of groundwater are inherently uneven and difficult to understand. As a result, applying methods driven by data could potentially yield significant gains in hydrology. In this study, two data-driven models were utilized to estimate groundwater levels at a total of 4 monitoring wells located in Colorado state, USA. These models included ARIMA and ANN. The comparative analysis of the algorithms made use of a data set that had one month's worth of information from each of the years 1980 to 2019. The models were put through their paces, and the results of those tests were statistically and visually assessed. To evaluate the relative accuracy and precision of the models, the mean absolute error (MAE), mean square error (MSE), and root-mean-square error (RMSE) were used. When compared to ARIMA, the analysis demonstrates that ANN can produce the most accurate forecasts of groundwater levels in Colorado state USA.

The notion of Golden structure was introduced 15 years ago by the present authors and know a constant interest by several geometers. Now, we propose a new generalization apart of that called metallic structure and considered also by the authors. By adding a compatible Riemannian metric we focus on the study of submanifolds in this setting.

In recent years, the analysis of macro- and micro-expression has drawn the attention of researchers since they provide visual cues of an individual’s emotions for a broad range of potential applications such as lie detection and criminal detection. In this paper, we address the challenge of spotting facial macro- and micro-expression from videos and present compelling results by using a deep learning approach to analyze the optical flow features. Different from other deep learning approaches that are mainly based on Convolutional Neural Networks (CNNs), we propose a Transformer-based deep learning approach that predicts a score indicating the probability of a frame being within an expression interval. Unlike other Transformer-based models that achieve high performance by being pre-trained on large datasets, our deep learning model, called SL-Swin, which applies Shifted Patch Tokenization and Locality Self-Attention to the backbone network Swin Transformer, effectively spots macro- and micro-expressions by being trained from scratch on small-size expression datasets. Our evaluation outcomes surpass the MEGC 2022 spotting baseline result, obtaining an overall F1-score of 0.1366. Additionally, our approach also performs well in the MEGC 2021 spotting task with an overall F1-score of 0.1824 and 0.1357 on CAS(ME)2 and SAMM Long Videos, respectively. The code is publicly available on GitHub (https://github.com/eddiehe99/pytorch-expression-spotting).

In this paper, we extend the Merton model of investment in discrete time to the cases when there is a finite number of investors and the market is with frictions represented by convex penalty functions defined for each investor. In the main result of this paper, we proved the existence of optimal strategy of investment by using a new approach based on the formulation of an equivalent general equilibrium economy model.

With the exponential growth of machine learning and development of Artificial Neural Network (ANNs) in recent years, there is great opportunity to leverage this approach and accelarate bio-logical discoveries through applications on the analysis of bioinformatics data. Various types of datasets including for example protein or gene interaction networks, molecular structures and cellular signalling pathways, have already been used for machine learning by training ANNs for inference and pattern classification. However, unlike regular data structures that are commonly used in the computer science and engineering fields, bioinformatics datasets present challenges that require unique algorithmic approaches. The recent development of the geometric and deep learning approach within the machine learning field, is very promising towards accelerating analysis complex bioinformatics datasets. The principles of ANNs and their importance for bio-informatics machine learning is demonstrated herein, through presentation of the undelying mathematical and statistical foundations from group theory, symmetry, linear algebra. Further-more, the structure and functions of ANN algorithms that form the core principles of artificial intelligence are explained, in relation to the bioinformatics data domain. Overall, the manuscript provides guidance for researchers to understand the principles required for practicing machine learning and artificial intelligence, with the special considerations towards bioinformatics applications.

Capsule endoscopy (CE) has been a widely used medical imaging tool for the diagnosis of gastrointestinal tract abnormalities like bleeding. But the CE captures a huge number of image frames that are time-consuming and tedious tasks for medical experts to diagnose manually. To address this issue, researchers focused on the computer-aided bleeding detection system to identify bleeding automatically in real-time. This paper presents a systematic review of the available state-of-the-art computer-aided bleeding detection algorithms for capsule endoscopy. The review was carried out by searching five different repositories: Scopus, PubMed, IEEE Xplore, ACM Digital Library, and ScienceDirect for all original publications on computer-aided bleeding detection published between 2001 and 2021. The PRISMA methodology was used to perform the review, and 112 full-texts of scientific papers were reviewed. The contributions of this paper are I) a taxonomy for computer-aided bleeding detection algorithms for capsule endoscopy is identified, II) the available state-of-the-art computer-aided bleeding detection algorithms including various color spaces (RGB, HSV, etc.), feature extraction techniques, and classifiers are discussed, and III) identify the most effective algorithm for practical use cases. Finally, the paper is concluded by providing future direction for computer-aided bleeding detection research.

Existing methods for 3D human pose estimation mainly divide the task into two stages. The first stage identifies the 2D coordinates of the human joints in the input image, namely the 2D human joint coordinates. The second stage uses the results from the first stage as input to recover the depth information of human joints from the 2D human joint coordinates to achieve 3D human pose estimation. However, the recognition accuracy of the two-stage method relies heavily on the results of the first stage and includes too many redundant processing steps, which reduces the inference efficiency of the network. To address these issues, we propose the EDD, a fully End-to-end 3D human pose estimation method based on transformer architecture with Dual Decoders. By learning multiple human poses, the model can directly infer all 3D human poses in the image using a pose decoder, and then further optimize the recognition result using a joint decoder based on the kinematic relations between joints. With the attention mechanism, this method can adaptively focus on the most relevant features to the target joint, effectively overcoming the feature misalignment problem in the human pose estimation task and greatly improving the model performance. Any complex post-processing step, such as non-maximum suppression, is eliminated, further improving the efficiency of the model. The results show that the method achieves an accuracy of 87.4% on the MuPoTS-3D dataset, significantly improving the accuracy of end-to-end 3D human pose estimation methods.

With the increasing utilization of intelligent mobile devices for online inspection of electrical equipment in smart grids, the limited computing power and storage capacity of these devices pose challenges for deploying large algorithm models and it’s hard to obtain a substantial number of images of electrical equipment in public. In this paper, we propose a novel distillation method that compresses the knowledge of teacher networks into a compact few-shot classification network, employing a global and local knowledge distillation strategy. Central to our method is exploiting the global and local relationship between the features exacted by the backbone of the teacher network and student network. We compare our method with recent state-of-the-art (SOTA) methods on three public datasets and achieve superior performance. Additionally, we contribute a new dataset, namely EEI-100, which is specifically designed for classification of electrical equipment. We validate our method on this dataset and demonstrate its exceptional prediction accuracy of 94.12% when utilizing only 5-shot images.

Background: The outbreak of the severe acute respiratory syndrome coronavirus-2 (SARS-CoV-2) resulted in the global COVID-19 pandemic. The urgency for an effective SARS-CoV-2 vaccine has led to the development of a first series of vaccines at unprecedented speed. The discovery of SARS-CoV-2 spike-glycoprotein mutants, however, and consequentially the potential to escape vaccine-induced protection and increased infectivity, demonstrates the persisting importance of monitoring SARS-CoV-2 mutations to enable early detection and tracking of genomic variants of concern. Results: We developed the CoVigator tool with three components: 1) a knowledge base that collects new SARS-CoV-2 genomic data, processes it and stores its results; 2) a comprehensive variant calling pipeline; 3) an interactive dashboard highlighting the most relevant findings. The knowledge base routinely downloads and processes virus genome assemblies or raw sequenc-ing data from the COVID-19 Data Portal (C19DP) and the European Nucleotide Archive (ENA), respectively. The results of the variant calling pipeline are visualized through the dashboard in the form of tables and customizable graphs, making it a versatile tool for tracking SARS-CoV-2 variants. We put a special emphasis on the identification of intrahost mutations and make available to the community what is, to the best of our knowledge, the largest dataset on SARS-CoV-2 intrahost mutations. In the spirit of open data, all CoVigator results are available for download. The CoVigator dashboard is accessible via covigator.tron-mainz.de. Conclusion: With increasing demand worldwide in genome surveillance for tracking the spread of SARS-CoV-2, CoVigator will be a valuable resource of up-to-date list of mutations, which can be incorporated into global efforts to sustainably prevent or treat infections.

The Internet of Things (IoT) technology and devices constitute an exciting field in computer science that is rapidly emerging worldwide. IoT devices function by connecting real-world objects to the internet, resulting in a higher number of interconnected devices than ever witnessed in history. Through internet connectivity, these devices can be utilized in various ways, such as monitoring and tracking. Their prevalence is increasing exponentially, coinciding with advancements in wireless networking technologies. The internet’s enhanced connectivity has played a vital role in fostering the proliferation of IoT devices. Presently, almost any everyday object can be network-connected. The demand for automation and efficiency has also been a contributing factor to the advancements in this technology. This paper aims to review the emergence of IoT devices, analyze their common applications, and explore the future prospects in this promising field of computer science. The examined applications encompass healthcare, agriculture, and smart cities. Although IoT technology exhibits similar deployment trends, this paper will explore different fields to discern the subtle nuances that exist among them. IoT technology can be applied to nearly any domain, and each use case has unique requirements. To comprehend the future of IoT, it is essential to comprehend the driving forces behind its advancements in various industries. By gaining a better understanding of the emergence of IoT devices, readers will develop insights into the factors that have propelled their growth and the conditions that led to technological advancements. Moreover, a comprehensive understanding of the prevalent methodologies will enable readers to distinguish between current practices and future methods. Given the rapid rate at which IoT technology is advancing, this paper aims to provide researchers with an understanding of the factors that have brought us to this point and the ongoing efforts to shape the future of IoT.

Misuse of measurement units and orientations leads to errors in scientific applications, Cyber Physical Systems (CPS), and IoT C/C++ programs. Standard type system are inadequate in preventing such errors. Although dimensional and orientational analysis in physics can manually detect these errors in equations, analyzing complex code with intricate physical computations is impractical. To overcome this challenge, we propose an advanced type system that incorporates units and orientations as integral components within a specialized type library. Our enhanced type system automatically detects potential errors during compile time by representing physical quantities as types and utilizing dimensional analysis, orientational analysis, and metaprogramming techniques. Our improved type system enables formal verification of C++ software, successfully verifying programs with extensive codebases. We also employ it for runtime verification of dynamic linking and pointer operations in C++ programs. The integration of compile-time verification, dimensional analysis, orientational analysis, and advanced type system enhances the robustness and accuracy of scientific applications, CPS, and IoT C/C++ programs. By leveraging these approaches, we ensure precise calculations and prevent errors related to measurement units and orientations, resulting in substantial improvements in reliability and accuracy.

The main objective of this study is to find out the influence of cooperation and intra-specific competition in escaping predation through refuge of the prey population and the effect of the two intra-specific interactions on the dynamics of prey-predator systems. For this purposes, two mathematical models with Holling type-II functional response function have been proposed and analyzed. The first model includes cooperation among prey populations whereas the second one incorporates intra-specific competition. Existence conditions and stability of different equilibrium points of both models have been carried out for the qualitative behaviour of the systems. Refuge through intra-specific competition has a stabilizing role, whereas cooperation has a destabilizing role on the system dynamics. Periodic oscillations are observed in both the systems through Hopf bifurcation. From the analytical and numerical findings, we conclude that intra-specific competition affects the prey population and continuously checks the refuge class under a critical value, and thus it never becomes too large to cause predator extinction due to food scarcity. Conversely, cooperation leads maximum individuals to escape predation through the refuge so that predators will suffer from low predation success.

To solve the problem of low efficiency of source seeking in implicit information field, this paper presents an autonomous souring method based on balanced searching strategy is enlighten by biological homing behaviors. At the beginning of the research, the source seeking task come down to a multi-objective convergence issue. By taking the feasibility search behaviors as the individual sample of the evolutionary population drawing on the thought of evolutionary algorithms, then combine motion searching with population evolution, so the carrier can be guide to complete source seeking task by solving the multi-objective problem. Furthermore, the distribution entropy is also considerated d to measure the searching bias in the process of source seeking. Combined with the demand of the source seeking process, a new source seeking method of balanced searching strategy is designed. Ultimately, through theoretical analysis and simulation verification confirm the effectiveness and rationality of the proposed method.

The IDS serves as a security system that maintains constant surveillance over network traffic and host systems in order to identify any security breaches or potentially concerning activities. Recently. the rise in cyber-attacks has driven the necessity for the development of automated and intelligent network intrusion detection systems. These systems are designed to learn the typical patterns of network traffic, allowing them to identify any deviations from normal behaviour, which can be classified as anomalous or malicious. Machine learning methods are widely used to exhibit a satisfactory effectiveness in detecting malicious payloads in the network traffic. While the volume of the data generated from IDS is increasing exponentially results in the emergence of substantial security risks, it highlighted the imperative to strengthen network security. The performance of traditional machine learning methods depends on the dataset and the data balance distribution in it. while most of IDS datasets suffer from unbalancing, this limits the performance of the machine learning method used in the system and results in missed detections and false alarms in the conventional IDSs. To address this issue, this paper presents a new model-based Generative Adversarial Network (GAN) called TDCGAN to enhance the detection rate of less of minor class in the dataset while maintaining efficiency. The proposed model consists of one generator and three discriminators with an election layer at the end of architecture. The UGR’16 data set is used for evaluation purposes. In order to demonstrate the efficacy of our proposed model, various machine learning algorithms have been utilized for comparison. The experimental findings have determined that TDCGAN presents an efficient resolution for addressing imbalanced intrusion detection and surpasses the performance of other oversampling machine learning methods.

New analytical solutions of the heat conduction equation are presented in cylindrical and spherical coordinates. Then these solutions are reproduced with high accuracy by recent explicit and unconditionally stable finite difference methods. After this, real experimental data from the literature regarding a heated cylinder are reproduced by the explicit numerical methods as well as by Finite Element Methods (FEM) ANSYS workbench. Convection and nonlinear radiation are also considered on the boundary of the cylinder, and it is shown that the explicit methods are much more accurate than the commercial software.

The prompt and accurate diagnosis of breast lesions, including the distinction between cancer, non-cancer, and suspicious cancer, plays a crucial role in the prognosis of breast cancer. In this paper, we introduce a novel method based on feature extraction and reduction for detection of breast cancer in mammography images. First, we extract features from multiple pre-trained convolutional neural network (CNN) models, and then concatenate them. The most informative features are selected based on their mutual information with the target variable. Subsequently, the selected features can be classified using a machine learning algorithm. We evaluate our approach using four different machine learning algorithms, and our results demonstrate that the neural network-based classifier yields an accuracy as high as 92% for the RSNA dataset which is a new dataset that provides two views and additional features such as age. We compare our proposed algorithm with state-of-the-art methods and demonstrate its superiority, particularly in terms of accuracy and sensitivity. For the MIAS dataset, we achieve an accuracy as high as 94.5%, and for the DDSM dataset, an accuracy of 96% is attained. These results highlight the effectiveness of our method in accurately diagnosing breast lesions and surpassing existing approaches.

For order-of-addition experiments, the response is affected by the addition order of the experimental materials. Consequently, the main interest focuses on creating a predictive model and an optimal design for optimizing the response. Van Nostrand (1995) proposed the pairwise-order (PWO) model for detecting PWO effects. Under the PWO model, the full PWO design is optimal under various criteria but is often unaffordable because of the large run size. In this paper, we consider the D-, A- and M.S.-optimal fractional PWO designs. We first present some results on information matrices. Then, a flexible and efficient algorithm is given for generating these optimal PWO designs. Numerical simulation shows that the generated design has an appealing efficiency in comparison with the full PWO design, though with only a small fraction of runs. Several comparisons with existing designs illustrate that the generated designs achieve better efficiencies, and the best PWO designs and some selected 100% efficient PWO designs generated by the new algorithm are reported.

Transformers are increasing replacing older generation of deep neural networks due to their success in a wide range of application. The dominant approach of using transformers is to pre-train them on a large training dataset and then fine-tune them on a downstream task. However, as transformers becoming larger, the fine-tuning approach is become an infeasible approach for transfer learning. In this short survey, we list a few recent methods that makes using transformers based on transfer learning more efficient.

This research paper explores the transformative potential of immersive media, specifically virtual reality (VR), in enhancing empathy among users. Empathy is vital in fostering understanding, compassion, and social cohesion. Immersive media, with its ability to transport individuals into simulated environments and perspectives, offers unique opportunities to bridge the empathy gap. This paper examines how VR can boost empathy, including perspective-taking, emotional connection, experiential learning, breaking down barriers, and empathy-building simulations. It discusses existing studies and empirical evidence supporting the effectiveness of VR in promoting empathy. The paper acknowledges the ethical considerations and challenges associated with using VR for empathy enhancement, such as avoiding stereotype reinforcement and ensuring inclusive design. By highlighting the potential of immersive media in cultivating empathy, this research paper contributes to the growing field of empathy research and provides insights for the development and application of VR experiences aimed at fostering empathy and understanding in diverse contexts.

AVs suffer reduced maneuverability and performance due to the degradation in sensor performances in fog. Such degradation causes significant object detection errors essential for AVs' safety-critical conditions. For instance, YOLOv5 performs significantly well under favorable weather but suffers miss detections and false positives due to atmospheric scattering caused by fog particles. Existing deep object detection techniques often exhibit a high degree of accuracy. The drawback is being sluggish at object detection in fog. Object detection methods with fast detection speed have been obtained using deep learning at the expense of accuracy. The problem of the lack of balance between detection speed and accuracy in fog persist. This paper presents an improved YOLOv5-based multi-sensor fusion network that combines radar's object detection with a camera image bounding box. We transformed radar detection by mapping the radar detections into a two-dimensional image coordinate and projected the resultant radar image on the camera image. Using the attention mechanism, we emphasized and improved important feature representation used for object detection while reducing high-level feature information loss. We trained and tested our multi-sensor fusion network on clear and multi-fog weather datasets obtained from the CARLA simulator. Our result shows that the proposed method significantly enhances the detection of distant and small objects. Our small CR-YOLOnet model best strikes a balance between accuracy and speed with an accuracy of 0.849 at 69 fps.

This review paper provides a comprehensive overview of machine vision pose measurement algorithms. The paper focuses on the state-of-the-art algorithms and their applications. The paper is structured as follows: The introduction in Section 1 provides a brief overview of the field of machine vision pose measurement. Section 2 describes the commonly used algorithms for machine vision pose measurement. Section 3 discusses the factors that affect the accuracy and reliability of machine vision pose measurement algorithms. Section 4 presents the applications of machine vision pose measurement in various fields. The paper provides specific examples of how machine vision pose measurement is used in each of these fields. Finally, Section 5 summarizes the paper and provides future research directions. The paper highlights the need for more robust and accurate algorithms that can handle varying lighting conditions and occlusion. It also suggests that the integration of machine learning techniques may improve the performance of machine vision pose measurement algorithms. Overall, this review paper provides a comprehensive overview of machine vision pose measurement algorithms, their applications, and the factors that affect their accuracy and reliability. It provides a valuable resource for researchers and practitioners working in the field of computer vision.

In 1937,German mathematician L.Collatz proposed a conjeture:for any positive integer,if it is even,divide it by 2;if it is odd,multiply it by 3 and 1 to get an even number;keep going on and on, the final result is 1.This paper gives a sequence classification of odd numbers,and gives 1-1 mapping of odd numbers and odd number sequences,and uses these results to give a proof of this conjecture.

Work done by us shows that rough topology is a good tool for dealing with things that happen in the real world. The concept of ”basis” has been used to show out the deciding elements of the recent outbreak of COVID-19 that was reported all over the world.

Visual inertial SLAM algorithms enable robots to autonomously explore and navigate in unknown scenes. However, most of the current SLAM systems highly rely on static environment assumptions, which fails in the exsitence of motional objects in the real environment. To improve the robustness and localization accuracy of SLAM systems in dynamic scenes, this paper proposes a visual-inertial SLAM framework that fuses semantic and geometric information, called DA-VINS. First, this paper presents a dynamic object classification method based on feature’s current motion state, which obtains temporary static features in the environment. Secondly, a features dynamics check module based on IMU prior and adjacent frame’s geometry constraint is designed to calculate dynamic factors. It also verifies the classification results of temporary static features. Finally, a dynamic adaptive bundle adjustment module based on the features’ dynamic factors is designed to adjust the weights of features in nonlinear optimization. We evaluated our method in public and our dataset. The results show that D-VINS is one of the most real-time, accurate, and robust systems in dynamic scenes.

Detecting human head movement during sleep is important as it can help doctor to access some physical or mental health problems like infantile eczema, calcium deficiency, insomnia, anxiety disorder and even Parkinson’s disease, and provide useful clues for scientific diagnosing. To obtain the information of sleep head movement, current solutions either use the camera or require the user to wear intrusive sensors to collect the image or motion data. However, the vision-based schemes depend on the environmental light conditions and also bring privacy concerns. Some people including the elderly and infant may be reluctant to wear wearable devices during sleep. In this paper, we propose a novel system called Wi-Senser to address the issues mentioned above. Our Wi-Senser directly reuses the existing WiFi infrastructure and exploits the fine-grained channel state information (CSI) of WiFi signals to capture the minute human head movement during sleep without attaching any sensors to the human body. We design and implement our system with just one commercial off-the-shelf (COTS) router and one laptop equipped with Intel 5300 network interface card (NIC). We evaluate the performance of Wi-Senser with 6 volunteers (4 adults and 2 children). Extensive experiments demonstrate that Wi-Senser can achieve a 98.5% accuracy for head movement detection during sleep. Wi-Senser provides a new solution for achieving noninvasive, continuous and accurate human minute movement detection without any additional cost.

Polynomial recurrence bounds for a class of stochastic differential equations with a gradient type drift and an additive Wiener process are studied without Lyapunov functions.

In the present paper we introduce three new classes of bi-univalent functions connected with Gregory coefficients. For functions in each of these three bi-univalent function classes we have derived the estimates of the Taylor--Maclaurin coefficients $\left|a_{2}\right|$ and $\left|a_{3}\right|$ and Fekete-Szeg\H{o} functional problems for functions belonging to these new subclasses. We defined three subclasses of the class of the bi-univalent functions $\Sigma$, namely $\mathfrak{HG}_{\Sigma}$, $\mathfrak{GM}_{\Sigma}(\mu)$ and $\mathfrak{G}_{\Sigma}(\lambda)$ by using the subordinations with the function whose coefficients are Gregory's numbers. First, we proved that these classes are not empty, i.e. contains other functions than the identity one. Using the well-known Carath\'eodory Lemma for the functions with real positive parts in the open unit disk, together with an estimation due to P. Zaprawa (see https://doi.org/10.1155/2014/357480) and another one of Libera and Zlotkiewicz, we gave upper bounds for the above mentioned initial coefficients and for the Fekete-Szeg\H{o} functionals. The main results are followed by some particular cases, and the novelty of the definitions and the proofs could involve further studies for such type of similarly defined subclasses.

Linear-width is a well-regarded width parameter in graph theory. The constructs of linear loose tangle and linear tangle present obstacles to attaining linear-width. In this succinct paper, our primary focus will be the exploration of maximal linear loose tangles.

Loose Tangle is a concept in graph theory that has a dual relationship with branch-width which is well-known graph width parameter. Ultrafilter, a fundamental notion in mathematics, is similarly known to have a dual relationship with branch-width when extended to a connectivity system (X, f). In this compact paper, we revisit and contemplate the interplay between Loose Tangle and Filter through the lens of a submodular partition function.

Target detection and segmentation in synthetic aperture radar (SAR) images are vital steps for many remote sensing applications. In the era of data-driven deep learning, this task is extremely challenging due to the limited labeled data. Few-shot Learning has the ability to learn quickly from few samples with supervised information. Inspired by this, a few-shot learning framework named MSG-FN is proposed to solve the segmentation of ship targets in heterologous SAR images with few annotated samples. The proposed MSG-FN adopts a dual-branch network consisting of a support branch and a query branch. The support branch is used to extract features with an encoder, and the query branch uses a U-shaped encoder-decoder structure to segment the target in the query image. The encoder of each branch is composed of well-designed residual blocks combined with filter response normalization to capture robust and domain-independent features. A multi-scale similarity guidance module is proposed to improve the scale adaptability of detection by applying hand-on-hand guidance of support features to query features of various scales. In addition, a SAR dataset named SARShip-4i is built to evaluate the proposed MSG-FN and the experimental results show that the proposed method achieves superior segmentation results compared with the state-of-the-arts.

Owing to the expansion of non-face-to-face activities, security issues in video conferencing systems are becoming more critical. In this paper, we focus on the end-to-end encryption (E2EE) function among security services of video conferencing systems. First, the E2EE-related protocols of Zoom and Secure Frame (SFrame), which are representative video conferencing systems, are thoroughly investigated, and the two systems are compared and analyzed overall. Next, the E2EE protocol in the Government Public Key Infrastructure (GPKI)-based video conferencing system, in which the user authentication mechanism is fundamentally different from those used in private sector systems, such as Zoom or SFrame, will be considered. In particular, among E2EE-related protocols, we propose a detailed mechanism in which the post-quantum cryptography (PQC) key encapsulation mechanism (KEM) is applied to the user key exchange process. As the session key is not disclosed to the central server even in futuristic quantum computers, the mechanism to which the PQC KEM method proposed in this study is applied satisfies the E2EE security requirements and can be applied to domestic GPKI-based systems. It is expected to contribute in strengthening the safety of the next-generation video conferencing system.

As we all know, many more dynamic objects appear almost continuously in real world, which are immensely able to impair the performance of the majority of vision-based SLAM systems that are based on the static-world assumption. In order to improve the robustness and accuracy of visual SLAM in the high dynamic environment, a real-time and robust stereo SLAM system for dynamic scenes was proposed. To weaken influences of dynamic content, the moving object detection method was put forward in our visual odometry, then the semantic segmentation network was combined into our stereo SLAM to extract pixel-level contours of dynamic objects. Then influences of dynamic objects were extremely weaken and the performance of our system was increased markedly in dynamic, complex and crowed city spaces. Experiment with both on KITTI Odometry dataset and in a real-life scene, the results show that our method can dramatically decrease the tracking error or drift, improve the robustness and stability of our stereo SLAM in high dynamic outdoor scenarios.

This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in the last section we present a concerning numerical example and the respective software.

The rapid growth of Earth's global geospatial data necessitates an efficient system for organizing the data, facilitating data fusion from diverse sources, and promoting interoperability. Mapping the spheroidal surface of the planet presents significant challenges, as it involves balancing distortion and splitting the surface into multiple partitions. The distortion decreases as the number of partitions increases, but at the same time the complexity of data processing increases, since each partition represents a separate data set and is defined in its own local coordinate system. In this paper, we propose the dual orthogonal equidistant cylindrical projection method to mitigate distortion and reduce the number of partitions. Additionally, we use the rotation of projection cylinders to effectively minimize average angular and areal distortions of the Earth’s landmass and reduce the interruption of continental plates caused by partition edges. By incorporating auxiliary latitudes and proposing an approximate authalic latitude, we further enhance the mapping of the ellipsoid onto the sphere, simplifying calculations. Experimental results demonstrate a substantial reduction in distortion and interruption of continental plates. With only two partitions, an average landmass angular distortion of less than 3.56 degrees and an average normalized surface distortion of less than 1.07 were achieved.

This article develops duality principles and related convex dual formulations suitable for the local optimization of non-convex primal formulations for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a Ginzburg-Landau type equation.

Pursuing "intelligent justice" necessitates an impartial, productive, and technologically driven methodology for judicial determinations. This scholarly composition proposes a framework that harnesses Artificial Intelligence (AI) innovations such as Natural Language Processing (NLP), ChatGPT, ontological alignment, and the semantic web, in conjunction with blockchain and privacy techniques, to examine, deduce, and proffer recommendations for the administration of justice. Specifically, through the integration of blockchain technology, the system affords a secure and transparent infrastructure for the management of legal documentation and transactions while preserving data confidentiality. Privacy approaches, including differential privacy and homomorphic encryption techniques, are further employed to safeguard sensitive data and uphold discretion. The advantages of the suggested framework encompass heightened efficiency and expediency, diminished error propensity, a more uniform approach to judicial determinations, and augmented security and privacy. Additionally, by utilizing explainable AI methodologies, the ethical and legal ramifications of deploying intelligent algorithms and blockchain technologies within the legal domain are scrupulously contemplated, ensuring a secure, efficient, and transparent justice system that concurrently protects sensitive information upholds privacy.

Quantum computing arrives. Preceded by Mādhava of Sangamagrāma and other Hindu mathematicians, around 1,500 CE, and our previous work, we show at least 4 quantum properties that are indeed universal in some number systems; here we use them to enable quantum computing. Using the sets B={0,1}, B^n, N, Z, Q, and Q*, one has +4 quantum properties that one can trust, as archetypes of easy communication to friends and foes, to ignoranti or cognoscenti, and for quantum consciousness. Therefore, this work applies to computer calculations, apps in cell phones, algebra, atoms, mathematics, physics, and the human mind.

Diversified techniques have been applied in many research papers for the optimization of rehabilitation robotic movements in order to maintain smoothness and accuracy. Smooth and precise control is needed necessarily for upper limb rehabilitation robotic applications having five degree of freedom. The preferred parameters which are used for the controlling were validated by mathematical model and these tuning parameters were optimized. Designing optimization algorithms to control complex physical robots has been a challenging task. In this study, a number of optimization techniques will be analyzed to determine the optimal parameters of a PID controller with a dynamic model of the upper limb rehabilitation system. For determining optimal control parameters for PID, there exists a number of tuning methods such as Zeigler Nichols and fuzzy logic which are classical methods. Swarm intelligence-based optimization algorithms are inspired by the behaviors of living things in nature. Several researchers have reported the optimal design of PID controller parameters using optimization techniques. The proposed control technique has been implemented on a 5-DOF RAX hardware and before any clinical trials, six healthy subjects went for trials under strict protocol. It has been discovered that the proposed control technique rejects the external unwanted disturbances as well as keeps the system stable under extreme perturbed and harsh conditions. In this research paper mathematical models have been validated to determine the PID parameters for the optimization. The comparative study is carried out with four different cost functions since a well-designed objective function leads to better performance of the system and indicates control design expectations. These objective functions are an integral squared error (ISE) and integral absolute error (IAE). In this research work, the effects of different cost functions on optimization techniques for controller parameters were analyzed. The performance of the controller with different cost functions has examined for robustness analysis. The cost function of particle swarm optimization, Firefly, Ant Bee Colony and Ant Colony optimization were developed for the better optimization results.

In this paper, we introduce a way of representing a given mapping as the sum of odd and even mappings. Then, by using this representation, we investigate the stability of various forms for the general nonic functional equation.

In recent years, video anomaly detection technology , which can intelligently analyze massive video and quickly find abnormal phenomena, has attracted extensive attention with the wide application of video surveillance technology . To address the complex and diverse problem of abnormal human behavior detection in surveillance videos, a surveillance video abnormal behavior detection and localization supervised method based on the deep network model and the traditional method is proposed. Specifically, we combined AGMM and YOLACT methods to obtain more accurate foreground information by fusing the foreground maps extracted by each technique. To further improve the accuracy , we use the PWC-Net technique to extract features of the foreground images and input them into an anomaly classification model for classification. The proposed method effectively detects and locates the abnormal behavior in the monitoring scene. In addition to the aforementioned methods, this paper also employs YOLOV5 and DeepSORT networks for object detection and tracking in the video, which allows us to track the detected objects for better understanding of the scene in the video. Experiments on the UCSD benchmark dataset and the comparison with state-of-the-art schemes prove the advantages of our method.

This paper proposed a time two-mesh (TT-M) finite difference numerical scheme to improve the efficiency of solving the symmetric regularized long wave (SRLW) equation. The TT-M Crank-Nicolson discretization and finite difference method are employed in time and space approximation respectively. The scheme involves three main steps: firstly, the time interval is divided into coarse and fine time meshes, then the nonlinear system is solved on the coarse time mesh; secondly, coarse numerical solutions on the fine time mesh are computed using an interpolation formula based on the solutions derived in the step one; lastly, the TT-M finite difference numerical solutions can be obtained through constructing the linearized fine time mesh system using Taylor’s formula. Compared to the currently existing TT-M numerical methods, the novelty of this study is that the nonlinear term including derivatives is linearized by Taylor’s formula for a function with three variables, whose error analysis is more complex. Finally, some numerical examples, including computational time and accuracy, preservation of conservation laws, are given to verify the efficiency of the scheme. By comparing it with the standard nonlinear finite difference scheme, this method can reduce CPU time without sacrificing accuracy.

Unmanned Aerial Vehicles (UAVs) image object detection has great application value in military and civilian fields. However, the objects in the captured images from UAVs have problems of large scale variation, complex backgrounds, and a large proportion of small objects. To resolve these problems, a multi-scale object detector based on coordinate and global information aggregation is proposed, named CGMDet. Firstly, a Coordinate and Global Information Aggregation Module (CGAM) is designed by aggregating local, coordinate, and global information, which can obtain features with richer context information. Secondly, a Multi-Feature Fusion Pyramid Network (MF-FPN) is proposed, which can better fuse features of different scales and obtain features containing more context information through repeated use of feature maps, to better detect multi-scale targets. Moreover, more location information of low-level feature maps is integrated to improve the detection results of small targets. Furthermore, we modified the bounding box regression loss of the model to make the model more accurately regress the bounding box and faster convergence. Finally, the proposed CGMDet was tested on VisDrone and UAVDT datasets and mAP0.5 of 50.9% and 48% was obtained, respectively. At the same time, our detector achieved the best results compared to other detectors.

This paper presents a new algorithm for semi-supervised action recognition using adaptive feature analysis. We model the samples of the same action as the same manifold and those of different actions as different manifolds, and integrate feature correlation mining and visual similarity mining into a joint framework. By maximizing the separability between different classes based on the labeled data, the proposed algorithm learns multiple features from labeled data and utilizes the intrinsic geometric structure of the data distribution between labeled and unlabeled data to boost the recognition. We introduce Projected Barzilai-Borwein (PBB) to train a subspace projection matrix as classifier. Extensive experiments on three benchmark datasets demonstrate that our algorithm outperforms the existing semi-supervised action recognition algorithms when there are a few labeled training samples.

The orthogonal matrix with cube be symmetric is a common class of matrices with important properties. We pay attention to this kind of matrices. By using the close relationship between the eigenvalues of a matrix and the trace of its power, we obtain the algorithm for its all possible different eigenvalues and multiplicities. The calculation formula is expressed only by the trace of a matrix and its power, avoiding solving the characteristic polynomial. The method is simple and practical. Furthermore, a new essential characterization for the sum of orthogonal matrix pairs being orthogonal is given as well.

The goal of this study is to categorize stakeholders in Internet of Things (IoT) security based on their roles in order to address the challenges associated with managing the large amount of data generated by IoT devices. With the increasing number of connected devices, the security risks also escalate, necessitating skilled stakeholders to mitigate these risks and prevent potential attacks. This study proposes a two-part approach that involves clustering stakeholders according to their responsibilities and determining relevant features to enhance decision-making. By grouping stakeholders into shared categories, the study aims to provide a more efficient and effective method for managing IoT security. The insights gained from this research will not only benefit stakeholders involved in IoT security but also assist policymakers and regulators in developing effective strategies.

The fundamental objective is to study the application of multivariate sets of data in Gaussian distribution. This paper examines broad measurements of structure for both Gaussian and non-Gaussian distributions, which shows that they can be described in terms of the infor-mation-theoretic between the given covariance matrix and correlated random variables (in terms of relative entropy). In order to develop the multivariate Gaussian distribution with entropy and mutual information, several significant methodologies are presented through the discussion supported by illustrations, both technically and statistically. The content obtained allows readers to better perceive concepts, comprehend techniques, and properly execute software programs for future study on the topic's science and implementations. It also helps readers grasp the themes' fundamental concepts. Involving the relative entropy and mutual information as well as the potential correlated covariance analysis based on differential equations, a wide range of information is addressed, including basic to application concerns.

Cerebrovascular and airway structures are tubular structures used for transporting blood and gases, respectively, providing essential support for the normal activities of the human body. Accurately segmenting these tubular structures is the basis of morphology research and patho-logical detection. Nevertheless, accurately segmenting these structures from images presents great challenges due to their complex morphological and topological characteristics. To address this challenge, this paper proposes a framework UARAI based on the U-Net multi-scale reverse at-tention network and sparse convolution network. The framework utilizes a multi-scale structure to effectively extract the global and deep detail features of vessels and airways. Further, it enhances the extraction ability of fine-edge features by a joint reverse attention module. In addition, the sparse convolution structure is introduced to improve the features' expression ability without increasing the model's complexity. Finally, the proposed training sample cropping strategy re-duces the influence of block boundaries on the accuracy of tubular structure segmentation. The experimental findings demonstrate that the UARAI-based metrics, namely Dice and IoU, achieve impressive scores of 90.31% and 82.33% for cerebrovascular segmentation and 93.34% and 87.51% for airway segmentation, respectively. Compared to commonly employed segmentation tech-niques, the proposed method exhibits remarkable accuracy and robustness in delineating tubular structures such as cerebrovascular and airway. These results hold significant promise in facilitating medical image analysis and clinical diagnosis, offering invaluable support to healthcare profes-sionals.

Although ChatGPT promises wide-ranging applications, there is a concern that it is politically biased; in particular, it has a left-libertarian orientation. Nevertheless, in light of recent trends in attempts to reduce such biases, this study re-evaluated the political biases of ChatGPT using political orientation tests and the application programming interface. Moreover, the effects of the languages used in the system as well as gender and race settings were evaluated. The results indicated that ChatGPT had less political bias than previously thought; however, they did not entirely discount the political bias. The languages used in the system and the gender and race settings may induce political biases. These findings enhance our understanding of the political biases of ChatGPT and may be useful for bias evaluation and designing ChatGPT’s operational strategy.

Let {ξ1, ξ2. . . .} be a sequence of independent possibly differently distributed random variables defined on a probability space (Ω, F, P) with distribution functions {F_ξ1., F_ξ2 , . . .}. Let η be a counting random variable independent of sequence {ξ1, ξ2. . . .}. In this paper, we find conditions under which distribution function of randomly stopped sum Sη = ξ1 + ξ2 + . . . + ξη belongs to the class of generalized subexponential distributions.

The main characteristics of blockchains, such as security and traceability, have enabled their use in many distinct scenarios, such as the rise of new cryptocurrencies and decentralized applications (dApps). However, part of the information exchanged with the typical blockchains is public, which can lead to privacy issues. To avoid or mitigate these issues, some blockchains are applying mechanisms to deal with data privacy. Trusted Execution Environments, the basis of confidential computing, and secure Multi-party Computation are two technologies that can be applied in that sense. In this paper, we analyzed seven blockchain technologies that apply mechanisms to improve data privacy. We defined seven technical questions related to common requirements for decentralized applications and, to answer each question, we reviewed the available documentation and gathered information from chat channels. We briefly present each blockchain technology and the answers to each technical question. Finally, we present a table summarizing the information and showing which technologies are more prominent.

With the rapid development of the Internet of Things, massive amounts of data will be generated at the network edge, resulting in increased latency of the traditional cloud computing model. Cloud service providers deploy edge servers near the users to improve the quality of service. Due to the large scale of networks, the inefficiency of edge server deployment and task scheduling will result in excessive latency and severe workload imbalance among edge servers. In this paper, we propose a Server Deployment and Task Scheduling (SDTS) framework in multi-edge collaborative computing, which can effectively reduce latency and ensure workload balancing. First, a metropolitan area network (MAN) is divided into dense candidate regions (DCRs) based on the density characteristics of mobile end devices, and then servers are deployed independently in each sub-region. Then, a two-step clustering algorithm is designed to deploy servers as close as possible to the mobile devices. Finally, a task scheduling algorithm is presented based on an edge scheduling layer in DCRs, which can leverage collaboration between edge servers to improve the performance of the entire edge computing system. The experimental results based on the Cellular Base Station (CBS) dataset of Shanghai Telecom indicate that the proposed approach outperforms several representative strategies in terms of latency and workload balancing.

We propose a deep reinforcement learning based manipulator path tracking method to solve the computationally difficult and non-unique problem of manipulator path tracking methods based on inverse kinematics. By transforming the path tracking task into a sequence decision problem, our method adopts an end-to-end learning method for closed-loop control and avoids the process of finding the inverse solution. We first explored the feasibility of the deep reinforcement learning method in the path tracking of the manipulator. After verifying the feasibility, the path tracking of the multi-degree-of-freedom(multi-DOF) manipulator was realized by combining the maximum entropy deep reinforcement learning algorithm. The experimental results show that our method has a good effect on the path tracking of the manipulator, which not only avoids the process of finding the inverse kinematics solution, but also requires no dynamic model. Therefore, we believe that our method has great significance in the study of manipulator path tracking.

In the field of embedded systems, energy efficiency is a critical requirement, particularly for battery-powered devices. RISC-V processors have gained popularity due to their flexibility and open-source nature, making them an attractive choice for embedded applications. However, not all RISC-V processors are equally energy-efficient, and it is important to evaluate their performance in specific use cases. This paper evaluates the energy consumption and resource utilization of a new RISC-V processor, RisCO2, and four existing processors - Zero-riscy, Micro-riscy, Ri5cy, and CV32E40P - in a signal demodulation application for NDIR CO2 sensors. The processors were implemented in the PULPino SoC and synthesized using Vivado IDE. The processor named RisCO2 is based on the RV32E_Zfinx instruction set and was designed from scratch by the authors specifically for low-power signal processing applications such as signal demodulation in CO2 NDIR sensors. The other processors are Ri5cy, Micro-riscy, and Zero-riscy, developed by the PULP Platform team, and CV32E40P (derived from Ri5cy) from the OpenHW Group, all of them widely used in the RISC-V community. Our experiments showed that RisCO2 had the lowest energy consumption among the five processors, with a 53.5% reduction in energy consumption compared to CV32E40P and a 94.8% reduction compared to Micro-riscy. Additionally, RisCO2 had the lowest FPGA resource utilization compared to the best-performing processors, CV32E40P and Ri5cy, with a 46.1% and a 59% reduction in LUTs, respectively. Our findings suggest that RisCO2 is a highly energy-efficient RISC-V processor for NDIR CO2 sensors that require signal demodulation. The results also highlight the importance of evaluating processors in specific use cases to identify the most energy-efficient option. This paper provides valuable insights for designers of energy-efficient embedded systems using RISC-V processors.

Due to nonlinear components in the charging piles of electric vehicles, harmonics and non-stationary signals in the electric vehicle charging load brings voltage and current distortion, seriously affecting the accuracy of the power-related calculation in non-sinusoidal environments. This paper proposed a new approach to calculate the active power and root mean square values from decomposed components using the adaptive chirp mode decomposition (ACMD) method on voltage and current. The advantage of the ACMD-based method is that it correctly provides the power-related quantities of harmonics or non-stationary components for the electric vehicle charging load. The performance of the proposed method was verified using synthetic signals and simulation tests. The experimental results presented better estimations for each quantity defined in IEEE Standard 1459-2010, compared with the discrete wavelet transform approach.

In this paper, we compile the fractional power series method and the Laplace transform to design a new algorithm for solving the fractional Volterra integro-differential equation. For that, we assume the Laplace power series (LPS) solution in terms of power q=1m,m∈Z+, where the fractional derivative of order α=qγ for which γ∈Z+. This assumption will help us to write the integral, the kernel, and the nonhomogeneous terms as a LPS with the same power. The recurrence relations for finding the series coefficients can be constructed using this form. To demonstrate the algorithm's accuracy, the residual error is defined and calculated for several values of the fractional derivative. Two strongly nonlinear examples are discussed to provide the efficiency of the algorithm. The algorithm gains powerful results for this kind of problem. Under Caputo meaning the obtained results are illustrated numerically, and graphically. Geometrically, the behavior of the solution declares that the changing of the fractional derivative parameter values' in their domain alters the style of the attained solution in a symmetrical meaning and fully coinciding to the ordinary derivative value'. From these simulations, the results report that the recommended novel algorithm is a straightforward, accurate, and superb tool to generate analytic-approximate solutions for Integral, and integro-differental equations of fractional order.

This paper presents the development of an underwater crack detection system for structural integrity assessment of submerged structures, like offshore oil and gas installations, underwater pipelines, underwater foundations for bridges, dams etc. Focus is on use of machine learning based approaches. First a detailed literature review of state of the current methods for underwater surface crack detection is presented highlighting challenges and opportunities. An overview of image augmentation approach for creation of underwater optical effects is also presented. Experimental results using standard network based machine learning approach, used for surface crack detection in onshore environment, is presented. Series of Test cases are presented where existing networks performance are improved using augmented images for underwater conditions. The experimental results demonstrate the effectiveness and accuracy of the proposed system in detecting cracks in underwater structures. The system has the potential to improve the safety and reliability of underwater structures and prevent catastrophic failures.

It is important that both static and dynamic information is efficiently used to create a suitable tourism plan. However, collecting, accumulating and managing dynamic information can cost tourists time, money and energy. The present study developed an original tourism support system was designed and developed with the purpose of reducing the burden of tourists who are unfamiliar with the tourist destinations in particular. An original tourism planning support system and web-geographic information systems (Web-GIS) were integrated into a single system, and two original functions were implemented. The system was operated targeting Osaka City, Japan for a period of one month. The information concerning 529 sightseeing spots was collected from tourism-related web media and then saved to the database of the system beforehand. During the operation period, a cumulative total of 160 users accessed the system. Based on the questionnaire survey results, most of the main functions were highly rated regardless of users’ travel experiences to the operation target area. Additionally, based on the access log analysis results, it was clear that the use of the system was in line with the purpose of the present study, as the number of visits to the page for the main functions were high.

In recent years, since flood disasters have brought immeasurable losses to the city, it is urgent to prevent and solve the flood of stagnant water. Considering the shortage of real-time and accuracy of hydrological analysis, Opencv technology is used in this paper to process the obtained data in real time. For improved Yolov5, BoTNet and GAMAttention Transformer are used to improve Yolov5 to enhance its ability of recognition and prediction to better identify surface gathered water. The prediction rate of the improved Yolov5 is 7.1% higher than that of Yolov7 and 1.7% higher than that of Yolov5.After that, contour preprocessing of the image is carried out through the cropping technology of the identification frame to eliminate relatively unstable factors. The principle of binocular distance measurement is used to measure the three-dimensional coordinates of the actual distance, better constrain the contour proportion of the picture, and then the Opencv technology is used to get the outline of the water, and HSV is combined with better color processing pictures for the identification of the water and contour generation, and the area is obtained to correspond to the corresponding parameters of flood to provide important help in flood prevention and storm drainage.

Badminton tactics refer to the techniques and strategies employed by players to win a match. Analyzing these tactics can help players improve their performance and outsmart their opponents. To study the tactics of top players, we use a gaming tree to analyze matches between two of the most powerful badminton players in history: Lin and Lee. By employing the Nash Equilibrium, we can discover the most beneficial strategies for both players, which reflect their most powerful techniques. Additionally, with the help of this gaming tree, we can precisely predict how players will implement their tactics. Empirical experimental results demonstrate that our proposed method not only evaluates and identifies each player's weaknesses and strengths but also has powerful capabilities to predict their tactics.

In this work, we studies the principle of ground electrode current field through ground communication technology, signal design, and optimal working mode of excitation source, so as to adapt the working mode, working frequency, and transmission medium condition of signal transmission. Through waveform design, energy is concentrated in the main conduction direction, which is beneficial for signal filtering at the receiving end and achieving high reliability data transmission; On this basis, on-site environmental testing was conducted to verify the detection and recognition technology of weak signals. Signal design and detection recognition are a very important part of the grounding electrode current field through ground communication technology. The grounding electrode current field through ground communication technology is mainly applied to solve the problem of communication between rescue personnel and trapped personnel before and during tunnel engineering collapse and rescue.

Multicriteria decision aid requires a database as a decision matrix, in which two or more alternatives are evaluated according to two or more variables selected as decision criteria. Several problems of this nature use measures by Likert scales. Depending on the method, parameters from these data (e.g. means, modes or medians) are required for calculations. This parameterization of data in ordinal scales has fueled controversy for decades between authors who favor mathematical/statistical rigor and argue against the procedure, stating that ordinal scales should not be parameterized, and scientists from other areas who have shown gains from the process that compensate for this relaxation. The aim of this article is to demonstrate the advantages of the Composition of Probabilistic Preferences (CPP) method in multicriteria problems with data from Likert scales. The CPP is capable of allaying the protests raised and obtaining more accurate results than descriptive statistics or parametric models can bring. The proposed algorithm in R-code involves the use of CPP with empirical distributions and fitting histograms of data measured by Likert scales. Two case studies with simulated datasets having peculiar characteristics and a real case illustrate the advantages of the CPP.

The COVID-19 pandemic has affected millions of people globally, with respiratory organs being strongly affected in individuals with comorbidities. Medical imaging-based diagnosis and prognosis have become increasingly popular in clinical settings to detect COVID-19 lung infections. Among various medical imaging modalities, ultrasound stands out as low-cost, mobile, and radiation-safe imaging technology. In this comprehensive review, we focus on ultrasound-based AI studies for COVID-19 detection that use public or private lung ultrasound datasets. We surveyed articles that used publicly available lung ultrasound datasets for COVID-19 and reviewed publicly available datasets and organize ultrasound-based AI studies per dataset. We analyzed and tabulated studies in several dimensions, such as data preprocessing, AI models, cross-validation, and evaluation criteria. In total, we reviewed 42 articles, where 28 articles used public datasets, and the rest used private data. Our findings suggest that ultrasound-based AI studies for the detection of COVID-19 have great potential for clinical use, especially for children and pregnant women. Our review also provides a useful summary for future researchers and clinicians who may be interested in the field.