41,076 Hits in 4.1 sec

Optimal Sorting Circuits for Short Keys [article]

Wei-Kai Lin, Elaine Shi
2021 arXiv   pre-print
A recent work by Asharov, Lin, and Shi (SODA'21) showed that if the elements to be sorted have short keys whose length k = o(log n), then one can indeed overcome the nlog n barrier for sorting circuits  ...  for 1-bit keys.  ...  ], as well as for his moral support of this work.  ... 
arXiv:2102.11489v2 fatcat:ui3fp5tiibeodorpujo2djxari

A batch of PNUTS

Adam E. Silberstein, Russell Sears, Wenchao Zhou, Brian Frank Cooper
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
Though PNUTS is optimized for and primarily used for serving, a number of applications at Yahoo! must run batch-oriented jobs that read or write data that is stored in PNUTS.  ...  Batch systems optimize for read and write throughput of large requests, while serving systems use indexing to provide low latency access to individual records.  ...  When a task short-circuits it records this in a short-circuit log. Note that a single task short-circuit does not short-circuit the entire Hadoop job.  ... 
doi:10.1145/1989323.1989441 dblp:conf/sigmod/SilbersteinSZC11 fatcat:w2yxabnyxvc6dc6k76rkmnt7ni

Sorting Short Integers [article]

Michal Koucký, Karel Král
2021 arXiv   pre-print
We build boolean circuits of size O(nm^2) and depth O(log(n) + m log(m)) for sorting n integers each of m-bits.  ...  We build also circuits that sort n integers each of m-bits according to their first k bits that are of size O(nmk(1 + log^*(n) - log^*(m))) and depth O(log^3(n)).  ...  We will build recursively a circuit that will sort the input array of elements according to the first bits when the input is augmented with the array of sorted keys.  ... 
arXiv:2102.10027v5 fatcat:swvsfxdf6rfatfz3bxlo27ypsq

Secure two-party computations in ANSI C

Andreas Holzer, Martin Franz, Stefan Katzenbeisser, Helmut Veith
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
Our key insight is a nonstandard use of the bit-precise model checker CBMC which enables us to translate C programs into equivalent Boolean circuits.  ...  As CBMC attempts to minimize the size of the formulas, the circuits obtained by our tool chain are also size efficient; to improve the efficiency of the garbled circuit evaluation, we perform optimizations  ...  While the number of non-XOR gates is optimal for the addition (e.g. compared to a hand-optimized circuit), it is possible to use bet-ter optimized versions for the multiplication.  ... 
doi:10.1145/2382196.2382278 dblp:conf/ccs/HolzerFKV12 fatcat:atq3r2364rgypbvopidabqannq

Coordinated optimization for controlling short circuit current and multi-infeed DC interaction

Dong YANG, Kang ZHAO, Yutian LIU
2014 Journal of Modern Power Systems and Clean Energy  
In order to solve the problems of exceeding short circuit current and multi-infeed DC interaction, a coordinated optimization method is presented in this paper.  ...  Finally, the non-dominated sorting genetic algorithm II combining with the branch selection strategy, is used to find the Pareto optimal schemes.  ...  A coordinated optimization method for controlling short circuit current and multi-infeed DC interaction is presented in this paper.  ... 
doi:10.1007/s40565-014-0081-z fatcat:evguvlion5a7bjifypjqm4ry7i

VLSI Implementation of a High-Speed Iterative Sorted MMSE QR Decomposition

P. Luethi, A. Burg, S. Haene, D. Perels, N. Felber, W. Fichtner
2007 2007 IEEE International Symposium on Circuits and Systems  
This paper describes the architecture and results of the first VLSI implementation of an iterative sorted QR decomposition preprocessor for MIMO receivers.  ...  The ability of concurrent iterative sorting during the QR decomposition introduces a moderate overall latency, but provides the base for an improved layered stream decoding.  ...  Iterative Sorting The iterative sorting described in Alg. 1 is a key feature of this circuit.  ... 
doi:10.1109/iscas.2007.378495 dblp:conf/iscas/LuethiBHPFF07 fatcat:7t6hha7hi5dczahu7slqglbuqi

Bitonic Sorting on Dynamically Reconfigurable Architectures

J. Angermeier, E. Sibirko, R. Wanka, J. Teich
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
There are parallel sorting algorithms (sorting circuits) which are highly suitable for VLSI hardware realization and which outperform sequential sorting methods applied on traditional software processors  ...  Sorting is one of the most investigated tasks computers are used for.  ...  Sorting circuits are build from comparator modules, or comparators for short, that connect horizontally drawn "wires" numbered from 1 to n where the n keys enter on the left side.  ... 
doi:10.1109/ipdps.2011.164 dblp:conf/ipps/AngermeierSWT11 fatcat:wkusx2k5evfqdceioxsteozyfu

Privacy-preserving matrix factorization

Valeria Nikolaenko, Stratis Ioannidis, Udi Weinsberg, Marc Joye, Nina Taft, Dan Boneh
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
Our design uses oblivious sorting networks in a novel way to leverage sparsity in the data. This yields an efficient implementation, whose running time is Θ(M log 2 M ) in the number of ratings M .  ...  We show this by designing a system that performs matrix factorization, a popular method used in a variety of modern recommendation systems, through a cryptographic technique known as garbled circuits.  ...  The public key is pk = (g, y) where y = g x for some random x ∈ Zq, and the private key is sk = x.  ... 
doi:10.1145/2508859.2516751 dblp:conf/ccs/NikolaenkoIWJTB13 fatcat:zyxevnggunejrl4ouseljbaxhi

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)  
In this paper, we perform synthesis and optimization of quantum circuits.  ...  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.  ...  We are currently working on sequence selection algorithms used in the proposed sorting approach to find optimal sequences.  ... 
doi:10.1109/icecs.2014.7050049 dblp:conf/icecsys/SusamA14 fatcat:w5yuixkxtjb6bdvti5bbunkd5q

Design automation for analog

Rob A. Rutenbar
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
A range of synthesis, optimization, layout and modeling techniques made their way from academic prototypes to first-generation commercial offerings.  ...  The decade of the 1990s saw the first wave of practical "post-SPICE" tools for analog designs.  ...  The key idea is full SPICE-level simulation for each solution candidate proposed during optimization.  ... 
doi:10.1145/1233501.1233593 dblp:conf/iccad/Rutenbar06 fatcat:wan2iddqcvfzvkf3syzj2wwzme

Design Automation for Analog: The Next Generation of Tool Challenges

Rob Rutenbar
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
A range of synthesis, optimization, layout and modeling techniques made their way from academic prototypes to first-generation commercial offerings.  ...  The decade of the 1990s saw the first wave of practical "post-SPICE" tools for analog designs.  ...  The key idea is full SPICE-level simulation for each solution candidate proposed during optimization.  ... 
doi:10.1109/iccad.2006.320157 fatcat:laprerdu7zamxieqsqgfny6lu4

Sorting Short Keys in Circuits of Size o(n log n) [article]

Gilad Asharov, Wei-Kai Lin, Elaine Shi
2020 arXiv   pre-print
A long-standing open problem is whether there exist (k + w) · o(n log n)-sized boolean circuits for sorting. We show that one can overcome the nlog n barrier when the keys to be sorted are short.  ...  To the best of our knowledge, we are the first to achieve non-trivial results for sorting circuits using non-comparison-based techniques.  ...  Acknowledgments Elaine Shi would like to thank Bruce Maggs for explaining the AKS sorting network [AKS83] , for numerous extremely helpful discussions regarding the elegant Arora, Leighton, Maggs self-routing  ... 
arXiv:2010.09884v2 fatcat:ji2762hgevbpxijglqczbp5sxu

Toward Group Applications: A Critical Review of the Classification Strategies of Lithium-Ion Batteries

Ran Li, Haonian Zhang, Wenrui Li, Xu Zhao, Yongqin Zhou
2020 World Electric Vehicle Journal  
This study systematically reviews the available literature on battery sorting applications for battery researchers and users.  ...  On the basis of reading extensive literature, the methods for classification of battery are provided with an in-depth explanation, and each corresponding strengths and weaknesses of these methods are analyzed  ...  For different sorting methods, how to select an appropriate equivalent circuit model and how to optimize this model to make it more applicable to sorting is a direction worth exploring, regarding equivalent  ... 
doi:10.3390/wevj11030058 fatcat:k7im6o5phfft7eij5jcniovqsa

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Johannes Bund, Christoph Lenzen, Moti Medina
2019 IEEE transactions on computers  
We show that this is indeed possible, by providing a circuit that sorts Gray code inputs (possibly containing a metastable bit) and has asymptotically optimal depth and size.  ...  We obtain asymptotically optimal metastability-containing sorting networks.  ...  ACKNOWLEDGMENTS We thank Attila Kinali and the anonymous reviewers for valuable input.  ... 
doi:10.1109/tc.2019.2939818 fatcat:n3limvxr7zgzbhev47utnn5maq

Optimization and Analysis of a High Power Density and Fault Tolerant Starter–Generator for Aircraft Application

Bo Wang, Gaurang Vakil, Ye Liu, Tao Yang, Zhuoran Zhang, Chris Gerada
2020 Energies  
Then, pursuing high power density, a multiple objective optimization process was carried out to comprehensively rank performances.  ...  To meet a fault tolerance target, electrical, magnetic and thermal isolation topologies were investigated and compared, among which 18 slot/12 pole with dual three-phase was selected as the optimal one  ...  The nondominated sorting genetic algorithm (NSGA-II) is adopted for the optimization work.  ... 
doi:10.3390/en14010113 fatcat:pd2yvulnkzgjran5vblfattdca
« Previous Showing results 1 — 15 out of 41,076 results