Search Results (47)

Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling. To address this challenge, we propose a quantum computing approach for solving FJSPs. We propose a quadratic unconstrained binary optimization (QUBO) model to minimize the makespan of FJSPs, with the scheduling scheme encoded in the ground state of the Hamiltonian operator. The model is solved using a coherent Ising machine (CIM). Numerical experiments are conducted to evaluate and validate the performance and effectiveness of the CIM. The results demonstrate that quantum computing holds significant potential for solving FJSPs more efficiently than traditional computational methods. Full article

Global efforts aiming to shift towards renewable energy and smart grid configurations require accurate unit commitment schedules to guarantee power balance and ensure feasible operation under different complex constraints. Intelligent systems utilizing hybrid and high-level techniques have arisen as promising solutions to provide optimum exploration–exploitation trade-offs at the expense of computational complexity. To ameliorate this requirement, which is extremely expensive in non-interconnected renewable systems, radically different approaches based on enhanced priority schemes and Boolean encoding/decoding have to take place. This compilation encompasses various mappings that convert multi-valued clausal forms into Boolean expressions with equivalent satisfiability. Avoiding any need to introduce prior parameter settings, the solution utilizes state-of-the-art advancements in the field of artificial intelligence models, namely Boolean mapping. It allows for the efficient identification of the optimal configuration of a non-convex system with binary and discontinuous dynamics in the fewest possible trials, providing impressive performance. In this way, Boolean mapping becomes capable of providing global optimum solutions to unit commitment utilizing fully tractable procedures without deteriorating the computational time. The results, considering a non-interconnected power system, show that the proposed model based on artificial intelligence presents advantageous performance in terms of generating cost and complexity. This is particularly important in isolated networks, where even a-not-so great deviation between production and consumption may reflect as a major disturbance in terms of frequency and voltage. Full article

Relaying with network coding forms a basis for a variety of collaborative communication systems. A linear block coding framework for multi-way relaying using network codes introduced in the literature shows great promise for understanding, analyzing, and designing such systems. So far, this technique has been used with low-density parity check (LDPC) codes and belief propagation (BP) decoding. Polar codes have drawn significant interest in recent years because of their low decoding complexity and good performance. Our paper considers the use of polar codes also as network codes with differential binary phase shift keying (DBPSK), bypassing the need for channel state estimation in multi-way selective detect-and-forward (DetF) cooperative relaying. We demonstrate that polar codes are suitable for such applications. The encoding and decoding complexity of such systems for linear block codes is analyzed using maximum likelihood (ML) decoding for LDPC codes with log-BP decoding and polar codes with successive cancellation (SC) as well as successive cancellation list (SCL) decoding. We present Monte-Carlo simulation results for the performance of such a multi-way relaying system, employing polar codes with different lengths and code rates. The results demonstrate a significant performance gain compared to an uncoded scheme. The simulation results show that the error performance of such a system employing polar codes is comparable to LDPC codes with log-BP decoding, while the decoding complexity is much lower. Furthermore, we consider a hard threshold technique at user terminals for determining whether a relay transmits or not. This technique makes the system practical without increasing the complexity and can significantly reduce the degradation from intermittent relay transmissions that is associated with such a multi-way relaying protocol. Full article

Extracting geoscientific dataset names from the literature is crucial for building a literature–data association network, which can help readers access the data quickly through the Internet. However, the existing named-entity extraction methods have low accuracy in extracting geoscientific dataset names from unstructured text because geoscientific dataset names are a complex combination of multiple elements, such as geospatial coverage, temporal coverage, scale or resolution, theme content, and version. This paper proposes a new method based on the hierarchical temporal memory (HTM) model, a brain-inspired neural network with superior performance in high-level cognitive tasks, to accurately extract geoscientific dataset names from unstructured text. First, a word-encoding method based on the Unicode values of characters for the HTM model was proposed. Then, over 12,000 dataset names were collected from geoscience data-sharing websites and encoded into binary vectors to train the HTM model. We conceived a new classifier scheme for the HTM model that decodes the predictive vector for the encoder of the next word so that the similarity of the encoders of the predictive next word and the real next word can be computed. If the similarity is greater than a specified threshold, the real next word can be regarded as part of the name, and a successive word set forms the full geoscientific dataset name. We used the trained HTM model to extract geoscientific dataset names from 100 papers. Our method achieved an F1-score of 0.727, outperforming the GPT-4- and Claude-3-based few-shot learning (FSL) method, with F1-scores of 0.698 and 0.72, respectively. Full article

Autonomous driving involves collaborative data sensing and traffic sign recognition. Emerging artificial intelligence technology has brought tremendous advances to vehicular networks. However, it is challenging to guarantee privacy and security when using traditional centralized machine learning methods for traffic sign recognition. It is urgent to introduce a distributed machine learning approach to protect private data of connected vehicles. In this paper, we propose a local differential privacy-based binary encoding federated learning approach. The binary encoding techniques and random perturbation methods are used in distributed learning scenarios to enhance the efficiency and security of data transmission. For the vehicle layer in this approach, the model is trained locally, and the model parameters are uploaded to the central server through encoding and perturbing. The central server designs the corresponding decoding, correction scheme, and regression statistical method for the received binary string. Then, the model parameters are aggregated and updated in the server and transmitted to the vehicle until the learning model is trained. The performance of the proposed approach is verified using the German Traffic Sign Recognition Benchmark data set. The simulation results show that the convergence of the approach is better with the increase in the learning cycle. Compared with baseline methods, such as the convolutional neural network, random forest, and backpropagation, the proposed approach achieves higher accuracy in the process of traffic sign recognition, with an increase of 6%. Full article

Microorganisms encode proteins that function in the transformations of useful and harmful nitrogenous compounds in the global nitrogen cycle. The major transformations in the nitrogen cycle are nitrogen fixation, nitrification, denitrification, anaerobic ammonium oxidation, and ammonification. The focus of this report is the complex biogeochemical process of denitrification, which, in the complete form, consists of a series of four enzyme-catalyzed reduction reactions that transforms nitrate to nitrogen gas. Denitrification is a microbial strain-level ecological trait (characteristic), and denitrification potential (functional performance) can be inferred from trait rules that rely on the presence or absence of genes for denitrifying enzymes in microbial genomes. Despite the global significance of denitrification and associated large-scale genomic and scholarly data sources, there is lack of datasets and interactive computational tools for investigating microbial genomes according to denitrification trait rules. Therefore, our goal is to categorize archaeal and bacterial genomes by denitrification potential based on denitrification traits defined by rules of enzyme involvement in the denitrification reduction steps. We report the integration of datasets on genome, taxonomic lineage, ecosystem, and denitrifying enzymes to provide data investigations context for the denitrification potential of microbial strains. We constructed an ecosystem and taxonomic annotated denitrification potential dataset of 62,624 microbial genomes (866 archaea and 61,758 bacteria) that encode at least one of the twelve denitrifying enzymes in the four-step canonical denitrification pathway. Our four-digit binary-coding scheme categorized the microbial genomes to one of sixteen denitrification traits including complete denitrification traits assigned to 3280 genomes from 260 bacteria genera. The bacterial strains with complete denitrification potential pattern included Arcobacteraceae strains isolated or detected in diverse ecosystems including aquatic, human, plant, and Mollusca (shellfish). The dataset on microbial denitrification potential and associated interactive data investigations tools can serve as research resources for understanding the biochemical, molecular, and physiological aspects of microbial denitrification, among others. The microbial denitrification data resources produced in our research can also be useful for identifying microbial strains for synthetic denitrifying communities. Full article

In this paper, we introduce secure groups as a cryptographic scheme representing finite groups together with a range of operations, including the group operation, inversion, random sampling, and encoding/decoding maps. We construct secure groups from oblivious group representations combined with cryptographic protocols, implementing the operations securely. We present both generic and specific constructions, in the latter case specifically for number-theoretic groups commonly used in cryptography. These include Schnorr groups (with quadratic residues as a special case), Weierstrass and Edwards elliptic curve groups, and class groups of imaginary quadratic number fields. For concreteness, we develop our protocols in the setting of secure multiparty computation based on Shamir secret sharing over a finite field, abstracted away by formulating our solutions in terms of an arithmetic black box for secure finite field arithmetic or for secure integer arithmetic. Secure finite field arithmetic suffices for many groups, including Schnorr groups and elliptic curve groups. For class groups, we need secure integer arithmetic to implement Shanks’ classical algorithms for the composition of binary quadratic forms, which we will combine with our adaptation of a particular form reduction algorithm due to Agarwal and Frandsen. As a main result of independent interest, we also present an efficient protocol for the secure computation of the extended greatest common divisor. The protocol is based on Bernstein and Yang’s constant-time 2-adic algorithm, which we adapt to work purely over the integers. This yields a much better approach for multiparty computation but raises a new concern about the growth of the Bézout coefficients. By a careful analysis, we are able to prove that the Bézout coefficients in our protocol will never exceed $3max(a,b)$ in absolute value for inputs a and b. We have integrated secure groups in the Python package MPyC and have implemented threshold ElGamal and threshold DSA in terms of secure groups. We also mention how our results support verifiable multiparty computation, allowing parties to jointly create a publicly verifiable proof of correctness for the results accompanying the results of a secure computation. Full article

This paper proposes an event-triggered state estimation method for parameter-uncertain systems with a binary encoding transmission scheme. Firstly, a binary encoding transmission scheme is introduced between the state estimator and the system to improve the efficiency of network communication. Secondly, an event-triggering mechanism (ETM) is designed to ensure the accuracy of state estimation and reduce the computational burden of the state estimator. At the event-triggered moments, considering the uncertainty of the system, the binary encoding transmission scheme, and the ETM, a moving horizon estimator (MHER) is designed using the robust least squares optimization method to obtain optimal state estimation. At the no-event-triggered moments, the state estimation of the system is computed based on an open-loop state estimator (OLER). Furthermore, stability analysis showed that the state estimation error of the proposed method is bounded. Finally, the practical value of the proposed in this paper is confirmed through numerical simulation. Full article

At present, the latest video coding standard is Versatile Video Coding (VVC). Although the coding efficiency of VVC is significantly improved compared to the previous generation, standard High-Efficiency Video Coding (HEVC), it also leads to a sharp increase in coding complexity. VVC significantly improves HEVC by adopting the quadtree with nested multi-type tree (QTMT) partition structure, which has been proven to be very effective. This paper proposes a low-complexity fast coding unit (CU) partition decision method based on the light gradient boosting machine (LGBM) classifier. Representative features were extracted to train a classifier matching the framework. Secondly, a new fast CU decision framework was designed for the new features of VVC, which could predict in advance whether the CU was divided, whether it was divided by quadtree (QT), and whether it was divided horizontally or vertically. To solve the multi-classification problem, the technique of creating multiple binary classification problems was used. Subsequently, a multi-threshold decision-making scheme consisting of four threshold points was proposed, which achieved a good balance between time savings and coding efficiency. According to the experimental results, our method achieved a significant reduction in encoding time, ranging from 47.93% to 54.27%, but only improved the Bjøntegaard delta bit-rate (BDBR) by 1.07%~1.57%. Our method showed good performance in terms of both encoding time reduction and efficiency. Full article

In terms of the logical structure of data in machine learning (ML), we apply a novel graphical encoding method in quantum computing to build the mapping between feature space of sample data and two-level nested graph state that presents a kind of multi-partite entanglement state. By implementing swap-test circuit on the graphical training states, a binary quantum classifier to large-scale test states is effectively realized in this paper. In addition, for the error classification caused by noise, we further explored the subsequent processing scheme by adjusting the weights so that a strong classifier is formed and its accuracy is greatly boosted. In this paper, the proposed boosting algorithm demonstrates superiority in certain aspects as demonstrated via experimental investigation. This work further enriches the theoretical foundation of quantum graph theory and quantum machine learning, which may be exploited to assist the classification of massive-data networks by entangling subgraphs. Full article

As one of the most important post-transcriptional modifications, m6Am plays a fairly important role in conferring mRNA stability and in the progression of cancers. The accurate identification of the m6Am sites is critical for explaining its biological significance and developing its application in the medical field. However, conventional experimental approaches are time-consuming and expensive, making them unsuitable for the large-scale identification of the m6Am sites. To address this challenge, we exploit a CatBoost-based method, m6Aminer, to identify the m6Am sites on mRNA. For feature extraction, nine different feature-encoding schemes (pseudo electron–ion interaction potential, hash decimal conversion method, dinucleotide binary encoding, nucleotide chemical properties, pseudo k-tuple composition, dinucleotide numerical mapping, K monomeric units, series correlation pseudo trinucleotide composition, and K-spaced nucleotide pair frequency) were utilized to form the initial feature space. To obtain the optimized feature subset, the ExtraTreesClassifier algorithm was adopted to perform feature importance ranking, and the top 300 features were selected as the optimal feature subset. With different performance assessment methods, 10-fold cross-validation and independent test, m6Aminer achieved average AUC of 0.913 and 0.754, demonstrating a competitive performance with the state-of-the-art models m6AmPred (0.905 and 0.735) and DLm6Am (0.897 and 0.730). The prediction model developed in this study can be used to identify the m6Am sites in the whole transcriptome, laying a foundation for the functional research of m6Am. Full article

In wireless networks, multiple monitoring nodes are used to collect users’ transmission data in real time, which can be used for fault diagnosis and analytical feedback of the wireless network. Due to the limited number of monitoring nodes, key issues include how to optimize and schedule the channel resources of each node to cover more users, obtain more network data, and maximize the quality of network monitoring. In this paper, a channel allocation algorithm based on swarm intelligence—“discrete bacterial foraging optimization”—is proposed based on the classic bacterial foraging optimization algorithm. The position of each dimension in the iterative process is discretized to binary 0 or 1 to encode and express the channel allocation problem of wireless monitoring networks, and the channel allocation scheme is optimized by location updates guided by bacterial foraging. Many simulation and practical experiments have proved the effectiveness of the algorithm, and it also has low complexity and provable convergence. Compared with similar algorithms, this algorithm improves monitoring quality by 1.428% while boosting speed by up to 32.602%. The algorithm has lower complexity, higher performance, and can converge to the optimal solution at a faster rate. Full article

Images uploaded to the cloud may be confidential or related to personal private information, so they need to be encrypted before uploading to the cloud storage. At the service provider side, appending additional information is usually required for transmission or database management. Reversible data hiding in encrypted images (RDHEI) serves as a technical solution. Recent RDHEI schemes successfully utilize the spatial correlation between image pixel values to vacate spare room for data hiding, however, the data payload can be further improved. This paper proposes a RDHEI scheme based on extended parameter binary tree labeling, which replaces non-reference pixel values with their prediction errors in a reduced length to vacate space. We further encode the prediction error of non-embeddable pixels to fit the space left from labeling. Thus, the space required to store the pixel bits replaced by labeling codes is saved. Experimental results show that the data payload of the extended parametric binary tree labeling outperforms state-of-the-art schemes. The embedding rates for the commonly applied datasets, including Bossbase, BOWS-2, and UCID, are 3.2305 bpp, 3.1619 bpp, and 2.8113 bpp, respectively. Full article

This paper tackles a novel and challenging problem—3D hand pose estimation (HPE) from a single RGB image using partial annotation. Most HPE methods ignore the fact that the keypoints could be partially visible (e.g., under occlusions). In contrast, we propose a deep-learning framework, PA-Tran, that jointly estimates the keypoints status and 3D hand pose from a single RGB image with two dependent branches. The regression branch consists of a Transformer encoder which is trained to predict a set of target keypoints, given an input set of status, position, and visual features embedding from a convolutional neural network (CNN); the classification branch adopts a CNN for estimating the keypoints status. One key idea of PA-Tran is a selective mask training (SMT) objective that uses a binary encoding scheme to represent the status of the keypoints as observed or unobserved during training. In addition, by explicitly encoding the label status (observed/unobserved), the proposed PA-Tran can efficiently handle the condition when only partial annotation is available. Investigating the annotation percentage ranging from 50–100%, we show that training with partial annotation is more efficient (e.g., achieving the best 6.0 PA-MPJPE when using about 85% annotations). Moreover, we provide two new datasets. APDM-Hand, is for synthetic hands with APDM sensor accessories, which is designed for a specific hand task. PD-APDM-Hand, is a real hand dataset collected from Parkinson’s Disease (PD) patients with partial annotation. The proposed PA-Tran can achieve higher estimation accuracy when evaluated on both proposed datasets and a more general hand dataset. Full article

The need for longer lasting and wider wireless coverage has driven the transition from a single drone to drone swarms. Unlike the single drone, drone swarms can collaboratively achieve full coverage over a target area. However, the existing literature on the drones’ wireless coverage has largely overlooked one important fact: that the network lifetime is determined by the minimum leftover energy among all drones. Hence, the maximum energy consumption is minimized in our drone-swarms deployment problem (DSDP), which aims to balance the energy consumption of all drones and maximize the full-coverage network lifetime. We present a genetic algorithm that encodes the solutions as chromosomes and simulates the biological evolution process in search of a favorable solution. Specifically, an integer code scheme is adopted to encode the sequence of the drones’ deployment. With the order of the drones’ sequence determined by the coding process, we introduce a feasibility checking operator with binary search to improve the performance. By relaxing the constraint of full coverage as an objective of coverage rate, we study the tradeoffs between energy consumption, number of drones, and coverage rate of the target area. By taking advantage of the MOEA/D framework with neighboring subproblems searching, we present a drone-swarms deployment algorithm based on MOEA/D (DSDA-MOEA/D) to find the best tradeoff between these objectives. Extensive simulations were conducted to evaluate the performance of the proposed algorithms. Full article