237,020 Hits in 4.1 sec

Revisiting bounded context block-sorting transformations

J. Shane Culpepper, Matthias Petri, Simon J. Puglisi
2011 Software, Practice & Experience  
By explicitly encoding the context boundaries, we present an O(n) reversal technique that is both efficient and effective.  ...  The Burrows-Wheeler Transform (bwt) produces a permutation of a string X, denoted X * , by sorting the n cyclic rotations of X into full lexicographical order, and taking the last column of the resulting  ...  ACKNOWLEDGEMENTS We thank Lei Chen who performed a preliminary investigation of k-bwt in his honours thesis and Ge Nong [28] who graciously provided reference implementations for context reconstruction  ... 
doi:10.1002/spe.1112 fatcat:ildlxj5ejzfkpipdpfdtvqeruq

Implementing Parallel Quick Sort Algorithm on OTIS Hyper Hexa-Cell (OHHC) Interconnection Network [article]

Esam Nsour, Mohammad Fasha
2021 arXiv   pre-print
This work explores the characteristics of implementing parallel Quick Sort algorithm over the OTIS Hyper Hexa-Cell interconnection network OHHC.  ...  OHHC interconnection architecture offers efficient processor connectivity by utilizing both electronic and optical based connections.  ...  Furthermore, the highest value of efficiency where achieved when using the Sorted and Reversed Sorted distribution types.  ... 
arXiv:2109.05176v1 fatcat:ugfjzqoqvjeyrkrpetlomvynlm

An efficient algorithm to synthesize quantum circuits and optimization

Omercan Susam, Mustafa Altun
2014 2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)  
Instead of an exhaustive search on every given function, our algorithm creates a library of essential functions and performs sorting.  ...  As an example, to implement 4 bit circuits we only use 120 essential functions out of all 20922789888000 functions. In the second part, we optimize our circuits by using new templates.  ...  ACKNOWLEDGMENTS This work is supported by The Scientific and Technological Research Council of Turkey (TÜBİTAK) (2210-C) and Scientific Research Projects Agency of Istanbul Technical University (BAP).  ... 
doi:10.1109/icecs.2014.7050049 dblp:conf/icecsys/SusamA14 fatcat:w5yuixkxtjb6bdvti5bbunkd5q

AutoBench: comparing the time performance of Haskell programs

Martin A. T. Handley, Graham Hutton
2018 Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell - Haskell 2018  
We present the design and implementation of the AutoBench system, demonstrate its utility with a number of case studies, and find that many QuickCheck correctness properties are also efficiency improvements  ...  Property-based testing tools such as QuickCheck provide a lightweight means to check the correctness of Haskell programs, but what about their efficiency?  ...  This work was funded by EPSRC grant EP/P00587X/1, Mind the Gap: Unified Reasoning About Program Correctness and Efficiency.  ... 
doi:10.1145/3242744.3242749 dblp:conf/haskell/HandleyH18 fatcat:skc7hsppnvfmzh3lewgddmhiqy


M.P.Bhuyan .
2013 International Journal of Research in Engineering and Technology  
of text files and improved compression ratio has been found by applying burrows wheeler transform as pre-processing step.  ...  Now days, computer technology mostly focusing on storage space and speed With the rapid growing of important data and increased number of applications, devising new approach for efficient compression and  ...  We also determine the first column F = accddkm, which can be obtained from L by sorting which is required reverse transform of the BWT.  ... 
doi:10.15623/ijret.2013.0214003 fatcat:76ssiscttrginnasei5nxku6ai

Reversible watermarking based on sorting prediction scheme

Khalid Edris, Mohammed Adam Ibrahim Fakhreldin, Jasni Mohamed Zain, Tuty Asmawaty Abdul Kadir, Khalid Adam
2014 2014 International Conference on Computer, Communications, and Control Technology (I4CT)  
In this paper, we propose a reversible watermarking algorithm to improve Sachnev et al algorithm by using new sorting method.  ...  The performance of the proposed reversible watermarking algorithm is evaluated and compared with Sachnev et al method.  ...  In this paper, we propose a reversible watermarking algorithm to improve Sachnev et al algorithm by using new sorting method. II.  ... 
doi:10.1109/i4ct.2014.6914227 fatcat:ocr5u3fgwfcfvo6cjmszujve5q

Exploring value creation and appropriation in the reverse clothing supply chain

Erik Sandberg, Rudrajeet Pal, Jukka Hemilä
2018 International Journal of Logistics Management  
By doing that, the research disseminates the reverse clothing supply chain in a new way and facilitates improved understanding of the structure and rationales for members taking part in it.  ...  Capture of different types of value and value co-creation explain the relatively high degree of collaboration among members in the "beginning" of the reverse supply chain.  ...  As claimed by reverse logistics research in general (Skinner et al., 2008; Bernon et al., 2011) , of particular importance for such cost efficiency are the grading and sorting processes.  ... 
doi:10.1108/ijlm-10-2016-0241 fatcat:fuyesnxscfgn7pyv2cryxafs3q

Factors Affecting the Efficiency and Effectiveness of Reverse Logistics Process

Gangani Sureka, Yapa Mahinda Bandara, Deepthi Wickramarachchi
2018 Journal of International Logistics and Trade  
The purpose of this research is to identify the current reverse logistics practices adopted by soft drink companies and the prominent factors which can decide the efficiency and effectiveness of the entire  ...  process of the reverse logistics channel.  ...  Acknowledgment We express our warm and sincere thanks to all industry participants who contributed in various ways for the data collection process.  ... 
doi:10.24006/jilt.2018.16.2.74 fatcat:zqq253er5jbiphq26vwz3jqmlm

Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort)

Keshav Bajpai, Ashish Kots
2014 International Journal of Computer Applications  
This paper presents a modified version of counting sort E-Counting Sort with some efficiency improvements.  ...  The new version can be applied to many real world applications providing the required result as efficient and as effective as original counting sort without affecting its real nature and improve the efficiency  ...  Counting sort [3] is an efficient algorithm that assumes that all elements to be sorted are of type integer in the range 1 to k, where k is some other integer.  ... 
doi:10.5120/17208-7427 fatcat:kdaucunr2bdfpa6affczd7f2my

Ancilla-free Reversible Logic Synthesis via Sorting [article]

Anupam Chattopadhyay, Sharif Md Khairul Hossain
2016 arXiv   pre-print
In this work, we link the reversible logic synthesis problem to sorting algorithms.  ...  The results are extensively benchmarked with state-of-the-art ancilla-free reversible logic synthesis methods.  ...  For a 2 n -element permutation, the efficiency of radix sort is O(n·2 n ), assuming each element is d = n digit. In that sense, it does not offer any improvement over comparison-based sorting.  ... 
arXiv:1605.05989v2 fatcat:7ezyxo3ol5cwrd2sdsqdq3eawe


Dayong Xu
2019 Malaysian E Commerce Journal  
Therefore, retailers must have an efficient reverse logistics system in order to maintain a stable customer base and lower operating costs and maintain the competitive edge of the market.  ...  With the development of modern science and technology and the integration of global economy, the competitive advantage of retail enterprises depends more and more on the speed, cost, service and efficiency  ...  The two main contributions of the product center to American retailers are: first, improving the circulation efficiency of returned goods, reducing the cost of reverse logistics, and speeding up the recycling  ... 
doi:10.26480/mecj.01.2019.30.33 fatcat:hnh2ms4sujdedjsrwwgiqyhqhq

Microfluidic screening and whole-genome sequencing identifies mutations associated with improved protein secretion by yeast

Mingtao Huang, Yunpeng Bai, Staffan L. Sjostrom, Björn M. Hallström, Zihe Liu, Dina Petranovic, Mathias Uhlén, Haakan N. Joensson, Helene Andersson-Svahn, Jens Nielsen
2015 Proceedings of the National Academy of Sciences of the United States of America  
Several screening and sorting rounds resulted in the selection of eight yeast clones with significantly improved secretion of recombinant α-amylase.  ...  This approach requires a high-throughput screening method that allows for efficient sorting of selected clones.  ...  This work was funded by the Novo Nordisk Foundation and the European Research Council Grant 247013 (to J.N.).  ... 
doi:10.1073/pnas.1506460112 pmid:26261321 pmcid:PMC4553813 fatcat:pae3purnmngbjfpbdoh7lqnsu4

Main Memory Implementations for Binary Grouping [chapter]

Norman May, Guido Moerkotte
2005 Lecture Notes in Computer Science  
An increasing number of applications depend on efficient storage and analysis features for XML data.  ...  Hence, query optimization and efficient evaluation techniques for the emerging XQuery standard become more and more important. Many XQuery queries require nested expressions.  ...  Acknowledgements We would like to thank Carl-Christian Kanne and Simone Seeger for their comments on the manuscript.  ... 
doi:10.1007/11547273_12 fatcat:xpttgarj2bd2xcorme3yjswwuu

Therapeutic effects of a mesenchymal stem cell‑based insulin‑like growth factor‑1/enhanced green fluorescent protein dual gene sorting system in a myocardial infarction rat model

Subin Jung, Jung-Hyun Kim, Changwhi Yim, Minhyung Lee, Hyo Jin Kang, Donghoon Choi
2018 Molecular Medicine Reports  
The purity of dual gene‑expressing MSCs was 95.1% by fluorescence‑activated cell sorting.  ...  The present study was conducted in order to improve gene expression efficiency of insulin‑like growth factor‑1 (IGF‑1)‑transfected mesenchymal stem cells (MSCs) using a non‑viral carrier and a simplified  ...  Although echocardiography was not performed in the present study, histological data provided evidence that maximizing the efficiency of gene expression through a sorting system may improve cardiac function  ... 
doi:10.3892/mmr.2018.9561 pmid:30365087 pmcid:PMC6236284 fatcat:qbqv5owlvjajtn44ksibhfvsye

Sorting Out the Genome

Brian Hayes
2007 American Scientist  
Attention turned to a more elaborate variant of the sorting-by-reversals problem. And, surprisingly, efficient solutions to this variant soon emerged.  ...  In the 1970s such an improved algorithm was devised by Christos H. Papadimitriou, then of Harvard University, and William H.  ... 
doi:10.1511/2007.67.3717 fatcat:e4emsnxz2zbr7fqbxnqkq4od7q
« Previous Showing results 1 — 15 out of 237,020 results