Electric signals are acquired and analyzed in order to monitor the underwater arc welding process. Voltage break point and magnitude are extracted by detecting arc voltage singularity through the modulus maximum wavel...
详细信息
Electric signals are acquired and analyzed in order to monitor the underwater arc welding process. Voltage break point and magnitude are extracted by detecting arc voltage singularity through the modulus maximum wavelet （MMW） method. A novel threshold algorithm, which compromises the hard-threshold wavelet （HTW） and soft-threshold wavelet （STW） methods, is investigated to eliminate welding current noise. Finally, advantages over traditional wavelet methods are verified by both simulation and experimental results.
Assume a database storing N objects with d numerical attributes or feature values. All objects in the database can be assigned an overall score that is derived from their single feature values (and the feature values ...
详细信息
Assume a database storing N objects with d numerical attributes or feature values. All objects in the database can be assigned an overall score that is derived from their single feature values (and the feature values of a user-defined query). The problem considered here is then to efficiently retrieve the k objects with minimum (or maximum) overall score. The well-known threshold algorithm (TA) was proposed as a solution to this problem. TA views the database as a set of d sorted lists storing the feature values. Even though TA is optimal with regard to the number of accesses, its overall access cost can be high since, in practice, some list accesses may be more expensive than others. We therefore propose to make TA access cost aware by choosing the next list to access such that the overall cost is minimized. Our experimental results show that this overall cost is close to the optimal cost and significantly lower than the cost of prior approaches.
The quantum multi-user detection technique with quantum detection under quantum multiple-access channel is a promising field in communications, it has promised an efficient solution to the NP hard problem in conventio...
详细信息
ISBN:
(纸本)9781424413119
The quantum multi-user detection technique with quantum detection under quantum multiple-access channel is a promising field in communications, it has promised an efficient solution to the NP hard problem in conventional optimal solution of multi-user detection. In this paper, a solution of multi-user detection in multi-access quantum channel based on the quantum square-root measurement is proposed, by which the minimum square-root probability of error can be gathered, and the probability of symbol error under various correlation coefficients with OOK and PSK modulation is evaluated. Compared with OOK modulation, the performance of PSK modulation can be improved greatly, but with high computation complexity. Then, a threshold algorithm and a new quantum square-root measurement formula are developed to reduce the computation complexity. The numerical experiments show that these methods can lower the complexity greatly.
In this paper, two different approaches have been proposed for solving two machine flow shop problems with multiple jobs requiring lot streaming with the objectives of minimizing the makespan and the total flow time o...
详细信息
ISBN:
(纸本)0780386434
In this paper, two different approaches have been proposed for solving two machine flow shop problems with multiple jobs requiring lot streaming with the objectives of minimizing the makespan and the total flow time of jobs. A population based evolutionary algorithm that involves evolution during the search process and a single point local search metaheuristics that work on a single solution are proposed. The population based approach employs local search, after the genetic search is over, to improve the effectiveness of the search procedure and hence it is called hybrid evolutionary algorithm (HYBRID). A threshold accepting algorithm (TA) proposed in this paper is a single point local search metaheuristic. A job here implies many identical items. Lot streaming creates sub lots to move the completed portion of a production sub lots to down stream machine. Proposed algorithms are evaluated using a set of randomly generated test problems. Experimental results are presented for comparison.
This paper studies the bit loading algorithm for adaptive OFDM transmission system, and proposes an improved scheme called shifting-threshold algorithm. Using computer simulations, we show that the OFDM system employi...
详细信息
ISBN:
(纸本)078039335X
This paper studies the bit loading algorithm for adaptive OFDM transmission system, and proposes an improved scheme called shifting-threshold algorithm. Using computer simulations, we show that the OFDM system employing the shifting threshold algorithm can enhance bit rate. On BER performance, the shifting threshold algorithm is better than fixed threshold algorithm.
This paper studies the bit loading algorithm for adaptive OFDM transmission system, and proposes an improved scheme called shifting-threshold algorithm. Using computer simulations, we show that the OFDM system employi...
详细信息
ISBN:
(纸本)078039335X
This paper studies the bit loading algorithm for adaptive OFDM transmission system, and proposes an improved scheme called shifting-threshold algorithm. Using computer simulations, we show that the OFDM system employing the shifting threshold algorithm can enhance bit rate. On BER performance, the shifting threshold algorithm is better than fixed threshold algorithm.
Background: Medical researchers often need to share clinical data without violating patient confidentiality. threshold cryptographic protocols divide messages into multiple pieces, no single piece containing informati...
详细信息
Background: Medical researchers often need to share clinical data without violating patient confidentiality. threshold cryptographic protocols divide messages into multiple pieces, no single piece containing information that can reconstruct the original message. The author describes and implements a novel threshold protocol that can be used to search, annotate or transform confidential data without breaching patient confidentiality. Methods: The basic threshold protocol is: 1) Text is divided into short phrases;2) Each phrase is converted by a one-way hash algorithm into a seemingly-random set of characters;3) threshold Piece 1 is composed of the list of all phrases, with each phrase followed by its one-way hash;4) threshold Piece 2 is composed of the text with all phrases replaced by their one-way hash values, and with high-frequency words preserved. Neither Piece 1 nor Piece 2 contains information linking patients to their records. The original text can be re-constructed from Piece 1 and Piece 2. Results: The threshold algorithm produces two files (threshold pieces). In typical usage, Piece 2 is held by the data owner, and Piece 1 is freely distributed. Piece 1 can be annotated and returned to the owner of the original data to enhance the complete data set. Collections of Piece 1 files can be merged and distributed without identifying patient records. Variations of the threshold protocol are described. The author's Perl implementation is freely available. Conclusions: threshold files are safe in the sense that they are de-identified and can be used for research purposes. The threshold protocol is particularly useful when the receiver of the threshold file needs to obtain certain concepts or data-types found in the original data, but does not need to fully understand the original data set.
A hybrid threshold soft decision decoding scheme which combines a Chase 2 algorithm with a bit-by-bit decision decoding algorithm is presented. For higher signal-to-noise ratios (SNRs), its behaviour is not inferior t...
详细信息
A hybrid threshold soft decision decoding scheme which combines a Chase 2 algorithm with a bit-by-bit decision decoding algorithm is presented. For higher signal-to-noise ratios (SNRs), its behaviour is not inferior to that of the corresponding bit-by-bit decoding algorithm. This scheme can overcome the exponential increase of the test patterns used in the Chase 2 algorithm, as d (the minimum Hamming distance of code) increases.
The minimum cost bipartite matching problem is considered. An approach based on the solution of a sequence of shortest path sub-problems is proposed. The particular structure of the problem and the use of reduced cost...
详细信息
The minimum cost bipartite matching problem is considered. An approach based on the solution of a sequence of shortest path sub-problems is proposed. The particular structure of the problem and the use of reduced costs make it possible to devise an efficient 'threshold' algorithm to solve these sub-problems. The computational behaviour of the proposed procedure is analyzed. [ABSTRACT FROM AUTHOR]
暂无评论