In this paper, an enhanced estimation of distribution algorithm (EEDA) is proposed to solve the hybrid flow-shop scheduling problem with identical parallel machines to minimize makespan. To evaluate the individuals, s...
详细信息
In this paper, an enhanced estimation of distribution algorithm (EEDA) is proposed to solve the hybrid flow-shop scheduling problem with identical parallel machines to minimize makespan. To evaluate the individuals, some decoding rules including the improved permutation scheduling rule, the improved list scheduling rule and the backward scheduling rule are designed for the permutation-based encoding scheme, and then a hybrid decoding method is proposed. To describe the distribution of the solution space for the EEDA, a probability model is built and used to generate new individuals by sampling. To well trace the region with promising solutions, a mechanism is provided to update the model with the superior sub-population. To enhance the exploitation capability, multiple local search operators are incorporated in the framework of the EEDA. The influence of the parameter setting is investigated based on the Taguchi method of design-of-experiment. Extensive numerical testing results based on sets of the well-known benchmarks and the comparisons with some existing algorithms demonstrate the effectiveness of the proposed algorithm.
The letter gives general descriptions of II-GHARQ and defines a concept of minimum distance distributed sequence (DDS) which is more exact to represent the error-correcting capability of the codes used in II-GHARQ. So...
详细信息
The letter gives general descriptions of II-GHARQ and defines a concept of minimum distance distributed sequence (DDS) which is more exact to represent the error-correcting capability of the codes used in II-GHARQ. Some DC codes which have a better DDS than KM codes are designed and Hadamard transform decoding is regarded as a common decoding method. Both analysis and simulation results indicate that II-HARQ using DC code gives a good throughput efficiency.
This paper presents a real-value version of particle swarm optimization (PSO) for solving the open vehicle routing problem (OVRP) that is a well-known combinatorial optimization problem. In OVRP a vehicle does not ret...
详细信息
This paper presents a real-value version of particle swarm optimization (PSO) for solving the open vehicle routing problem (OVRP) that is a well-known combinatorial optimization problem. In OVRP a vehicle does not return to the depot after servicing the last customer on a route. A particular decoding method is proposed for implementing PSO for OVRP. In the decoding method, a vector of the customer's position is constructed in descending order. Then each customer is assigned to a route with taking into account feasibility conditions. Finally one-point move has been applied on constructed routes that seem promising to result in a better solution. Experimental evaluations on benchmark data sets demonstrate the competitiveness of the proposed algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
In sound field reproduction with Higher-Order Ambisonics (HOA), a sweet spot is formed around a reproduction point that is generally a center of spherical loudspeaker array. The conventional HOA decoding with a unique...
详细信息
In sound field reproduction with Higher-Order Ambisonics (HOA), a sweet spot is formed around a reproduction point that is generally a center of spherical loudspeaker array. The conventional HOA decoding with a unique solution yields a spherical sweet spot, in which the reproduction error is less than 4% and whose radius is theoretically defined in the literature. On the other hand, it is known that Max-rE decoding or a least norm solution derived when using a larger number of loudspeakers would lead to an enhancement of reproduction accuracy. However, it is yet to be revealed how Max-rE decoding and the least norm solution affects the reproduction accuracy and the size and shape of the sweet spot, when they are individually or simultaneously applied to HOA decoding. This paper numerically investigates the reproduction accuracy of HOA with such different HOA decoding methods. The numerical results suggest that, compared to the conventional decoding method, ones with Max-rE and/or the least norm solution result in deformed or expanded sweet spot and suppression of reproduction errors outside the sweet spot.
Background WOBAN is a high-speed network and hence any kind of failure results in huge data loss. Using the proposed network coding technique with parallel path protection can handle multiple link failures, the perfor...
详细信息
Background WOBAN is a high-speed network and hence any kind of failure results in huge data loss. Using the proposed network coding technique with parallel path protection can handle multiple link failures, the performance of the network can be *** This study aims to improve network performance using network coding with parallel path protection routing algorithm (NC-PPR) for multiple link failures in *** We investigated the multiple link failures in WOBAN by the proposed approach namely Coded Path Protection Algorithm, which enhances the survivability of the WOBAN against multiple link failures in the front end and eliminates the need of backup *** Extensive simulation is carried out to implement proposed work. A simulation model and code is developed in MATLAB to get the performance enhancement of *** We compared the performance of proposed algorithm with existing algorithm. The obtained results show that the proposed algorithm has superior performance than the existing *** In this paper, a new routing approach, which works in three phases namely path finding, encoding, and decoding, using random linear network coding (RLNC) is introduced to address the survivability issue of the WOBAN. The proposed approach also enhances the network performance in terms of PDR, overhead, and delay.
In this paper we define k-order Gaussian Fibonacci polynomials with boundary conditions and give the generating function, explicit formula and some identities for k-order Gaussian Fibonacci polynomials. We introduce t...
详细信息
In this paper we define k-order Gaussian Fibonacci polynomials with boundary conditions and give the generating function, explicit formula and some identities for k-order Gaussian Fibonacci polynomials. We introduce the matrix represent and we obtain the k-order Gaussian Fibonacci Polynomials matrix. We define a new coding theory called k-order Gaussian Fibonacci Polynomials coding theory and establish the code elements for values of k. This coding/decoding method bound to the Q(k) (x), R-k (x) and E-k,E-n (x) matrices. So, this method is different from the classical algebraic coding. Consequently, with this method, we move the coding theory onto a complex space which is a different field. Therefore, new working areas are created.
Trellis-coded pulse-amplitude modulation (TC-PAM) is applied in visible light communication (VLC) system using RGB-LED. Based on natural modulation, we propose a modified modulation to yield performance enhancement. F...
详细信息
ISBN:
(纸本)9780819499615
Trellis-coded pulse-amplitude modulation (TC-PAM) is applied in visible light communication (VLC) system using RGB-LED. Based on natural modulation, we propose a modified modulation to yield performance enhancement. Further, a decoding method of combing soft-decision Viterbi algorithm with most significant bit (MSB) decoding is developed. Finally, the results of Monte-Carlo simulation are presented to verify the best modulation and decoding method among the mentioned modulation and decoding techniques.
In this paper, we introduce a new decoding method to mitigate the issue of hallucinations in Large Language Models (LLMs). Specifically, our method dynamically selects appropriate internal layers(DiLa) of the model an...
详细信息
ISBN:
(纸本)9798350359329;9798350359312
In this paper, we introduce a new decoding method to mitigate the issue of hallucinations in Large Language Models (LLMs). Specifically, our method dynamically selects appropriate internal layers(DiLa) of the model and compares their logic to enhance the authenticity and accuracy during the decoding process. Experimental results show that DiLa significantly improves performance across multiple tasks without fine-tuning the model and without substantially reducing decoding efficiency. Overall, our approach is a simple yet efficient solution to alleviate the hallucination problem in LLMs.
KEELOQ code hopping technology is a nonlinear anti-encryption algorithm designed for secure Remote Keyless Entry (RKE) systems. It combines a 66-bits transmission length, so as to prevent the system from code predicti...
详细信息
ISBN:
(纸本)9780769538167
KEELOQ code hopping technology is a nonlinear anti-encryption algorithm designed for secure Remote Keyless Entry (RKE) systems. It combines a 66-bits transmission length, so as to prevent the system from code predicting, code grabbing and code scanning. Because of its feature of high-security, it effectively overcomes the disadvantages of the traditional fixed code technology. This paper researched on KEELOQ encryption algorithm and presented a designed RKE system based on KEELOQ technology. When the software and hardware were designed, the whole RKE system was afterwards made as a prototype for the functionality tests. The experimental results showed that the design achieved the anticipative effects.
暂无评论