Filters








445,625 Hits in 6.2 sec

Optimizing the length of checking sequences

R.M. Hierons, H. Ural
2006 IEEE transactions on computers  
We show how a set A may be chosen so that it minimizes the sum of the lengths of the sequences to be combined.  ...  An optimization algorithm is used in order to produce the shortest such checking sequence that can be generated on the basis of the given A and E c .  ...  For the 1000 other experiments with a given FSM M we recorded the mean checking sequence length, the maximum checking sequence length, and the minimum checking sequence length.  ... 
doi:10.1109/tc.2006.80 fatcat:a7meugbe5randas7b3c4wuxv4a

Primerize: automated primer assembly for transcribing non-coding RNA domains

Siqi Tian, Joseph D. Yesselman, Pablo Cordero, Rhiju Das
2015 Nucleic Acids Research  
While chemical synthesis and gel or chromatographic purification of RNA is costly and difficult for sequences longer than tens of nucleotides, a pipeline of primer assembly of DNA templates, in vitro transcription  ...  Online servers are currently not available or maintained for the task.  ...  ACKNOWLEDGEMENT The authors thank members of the Das laboratory for extensive testing of the web server. FUNDING  ... 
doi:10.1093/nar/gkv538 pmid:25999345 pmcid:PMC4489279 fatcat:6q7gcdga6vei7g7u6ix7i2mf6y

Reducing the Lengths of Checking Sequences by Overlapping [chapter]

Hasan Ural, Fan Zhang
2006 Lecture Notes in Computer Science  
This paper proposes an optimization model that tackles these shortcomings to reduce the lengths of checking sequences beyond what is achieved by the existing models by replacing the state recognition sequences  ...  Second, they do not take advantage of overlapping to further reduce the length of checking sequences.  ...  to further reduce the lengths of checking sequences.  ... 
doi:10.1007/11754008_18 fatcat:x6hmr7dfpjaippqfyjkfkkgt7q

MOESM1 of High capacity DNA data storage with variable-length Oligonucleotides using repeat accumulate code and hybrid mapping

Yixin Wang, Md Noor-A-Rahim, Jingyun Zhang, Erry Gunawan, Yong Guan, Chueh Poh
2019 Figshare  
Additional file 1 High capacity DNA data storage with variable-length Oligonucleotides using Repeat Accumulate code and hybrid mapping: Supplementary information.  ...  We then optimize the RA code while utilizing the above density evolution equations [2, 3] . B. Optimization For simplicity, we first fix the check node degree distribution.  ...  Binary stream is segmented into packets with length of 266 bits and then each sequence is added with 20 bits for CRC check and 14 bits for addressing.  ... 
doi:10.6084/m9.figshare.10730882 fatcat:tc4ntg2enjdmxjlzlmgncdg2vu

Quantum Compiler Optimizations [article]

Jeffrey Booth Jr
2012 arXiv   pre-print
Thus, they must compose a sequence of gates from the permitted gate set, which approximates the gate they wish to apply - a process called quantum compiling.  ...  However, the physical limitations of the quantum computing device restrict the set of gates that physicists are able to apply.  ...  He wrote the original paper describing the sequence-skipping optimization, upon which my research is based.  ... 
arXiv:1206.3348v1 fatcat:fkz6ojohqncudjppz446arkkbe

An optimization technique for protocol conformance testing using multiple UIO sequences

Wen-Huei Chen, Ching-Sung Lu, Elben R. Brozovsky, Jin-Tuu Wang
1990 Information Processing Letters  
In the past decade, a lot of new techniques have been proposed to optimize the test sequence resulting from the UIOv method.  ...  The technique involves the construction of the test segments from the Wp method, and a Rural Chinese Postman Algorithm which optimally connects these test segments into a test sequence.  ...  The sequence of input/output pairs is the test sequence, and the number of inputs is the test sequence length [23] .  ... 
doi:10.1016/0020-0190(90)90178-z fatcat:2zont7vkyrdyzhrqcorlilggpy

Optimization of polling sequence during fading interval in wireless systems

Yeong-Hyeon Kwon, Dong-Jo Park, Mi-Kyung Oh
2003 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)  
To find the optimized time sequence of checking packets, we propose a new search method based on the proposed cost function, which achieves very low computational complexity.  ...  In this paper, we propose an optimization scheme for transmitting the checking packets such that the bandwidth loss caused by them is minimized.  ...  CONCLUSIONS In this paper, we addressed the optimization of the time sequence of checking packets, when the wireless channel is blocked for long duration.  ... 
doi:10.1109/vetecf.2003.1285318 fatcat:k6qnntorh5gvzixcr4z337n3fq

An Embedding Strategy Using Q-Ary Convolutional Codes for Large and Small Payloads

Jyun-Jie Wang, Chi-Yuan Lin, Sheng-Chih Yang, Hsi-Yuan Chang, Yin-Chen Lin
2021 Mathematics  
However, its main disadvantage is the inability to perform maximum likelihood decoding due to the high complexity of decoding large ME codes.  ...  By keeping the embedding rate of the (2, 1) convolutional code unchanged, convolutional codes with different embedding rates can be designed through puncturing.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/math9131577 fatcat:4tn7irmqnvcs3g45bovqyhgpvu

Low-complexity fixed-to-fixed joint source-channel coding

Irina E. Bocharova, Albert Guillen i Fabregas, Boris D. Kudryashov, Alfonso Martinez, Adria Tauste Campo, Gonzalo Vazquez-Vilar
2014 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)  
The coding gain obtained by simulation is consistent with the theoretical gain.  ...  A lowcomplexity implementation with two quasi-cyclic LDPC codes with belief-propagation decoding achieves a better frame error rate than optimized separate coding.  ...  Multiplying the information vector of length L j + L pi by H(w, j) we obtain a check sequence c of length l which is included into the information sequence of the selected code.  ... 
doi:10.1109/istc.2014.6955100 dblp:conf/istc/BocharovaFKMCV14 fatcat:4jq7iisuwzdepaxps3ulx3fb2m

Study on Optimization of Urban Rail Train Operation Control Curve Based on Improved Multi-Objective Genetic Algorithm

Xiaokan Wang, Qiong Wang
2021 Journal on Internet of Things  
The fitness function can be designed by the design requirements of the train control stop error, time error and energy consumption. the effectiveness of new individual can be ensured by checking the validity  ...  of the original individual when its in the process of selection, crossover and mutation, and the optimal algorithm will be joined all the operators to make the new group not eliminate on the best individual  ...  ( 6 ) 6 Reordering and validity checking the mutated gene sequence of the individual ' will turn to the seventh step; if it does not pass the validity check or β < ' i f ( 8 ) 8 Picking out a new  ... 
doi:10.32604/jiot.2021.010228 fatcat:f23av6tf5rf6penkty5aev7q7e

Progressive alignment using Shortest Common Supersequence

Ankush Garg, Deepak Garg
2014 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI)  
The complexity of finding the optimal alignment is O (L N ) where L is the length of the longest sequence and N is the number of sequences.  ...  Guide tree is generated by distance scores between sequences. Distance score is calculated by the alignment score divided by the length of shorter sequence.  ...  Starting lines of MSF format gives the information about all sequences like length, the check score and weight of the sequences.  ... 
doi:10.1109/icacci.2014.6968310 dblp:conf/icacci/GargG14 fatcat:fjx7bmzum5axjlagqc3zjxor3y

Efficient Probe Selection in Microarray Design

Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence W.H. Wong
2006 2006 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology  
each sequence from all the other sequences.  ...  The crux of microarray design lies in how to select a unique probe that distinguishes a given genomic sequence from other sequences.  ...  This is done as follows: (a) generate a random sequence r of length m; (b) find the closest match p of r among probes in the target; (c) check whether p satisfies specificity criterion.  ... 
doi:10.1109/cibcb.2006.331018 dblp:conf/cibcb/GasieniecLSW06 fatcat:qala7ngxvfe4zmcxdlnxewo7ii

Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers [chapter]

Jovan Dj. Golić
1995 Lecture Notes in Computer Science  
The procedure is based on appropriately defmed parity-check sums and consists in iterative recomputation of the posterior probabilities for unknown elements of the decimation sequence.  ...  A convergence condition in terms of the numbers of the parity-check sums needed for successful reconstruction and the required polynomial computational complexity indicate that the proposed fast correlation  ...  The required length of the keystream sequence depends on f and is increased to lOi/c;, because the optimal shrunk polynomial is described by i bits and the necessary length for each bit of uncertainty  ... 
doi:10.1007/3-540-49264-x_20 fatcat:cyeubs5korgyxhfwuvmzj6qeoq

A bipartite graph approach to generate optimal test sequences for protocol conformance testing using the Wp-method

Jim Wang, J. Xiao, C.P. Lam, H. Li
2005 12th Asia-Pacific Software Engineering Conference (APSEC'05)  
Our approach significantly reduces the length of the test sequences required for conformance testing while maintaining the same fault detection capability.  ...  In this paper, we propose a bipartite graph approach to generate optimal test sequences for protocol conformance testing.  ...  It is reported in [4] that an optimal test sequence for the FSM in Figure 2 has the total length of 23.  ... 
doi:10.1109/apsec.2005.5 dblp:conf/apsec/WangXLL05 fatcat:qe4hkew6znbldpzuarppjgzavu

A New Ensemble of Rate-Compatible LDPC Codes [article]

Kai Zhang, Xiao Ma, Shancheng Zhao, Baoming Bai, Xiaoyi Zhang
2012 arXiv   pre-print
In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible LDPC codes with code rates varying "continuously  ...  of signal-to-noise-ratios (SNRs).  ...  between the performances of the Kite codes and the Shannon limits. 3) The optimized p-sequence depends on the data length k and has no closed form.  ... 
arXiv:1205.4070v1 fatcat:m6pxkhqq2vd5tmbdo7qezchpsy
« Previous Showing results 1 — 15 out of 445,625 results