36 research outputs found
The Minimum Oracle Circuit Size Problem
No full textWe consider variants of the Minimum Circuit Size Problem MCSP, where the goal is to minimize the size of oracle circuits computing a given function. When the oracle is QBF, the resulting problem MCSPQBF is known to be complete for PSPACE under ZPP reductions. We show that it is not complete under logspace reductions, and indeed it is not even hard for TC0 under uniform AC0 reductions. We obtain a variety of consequences that follow if oracle versions of MCSP are hard for various complexity classes under different types of reductions. We also prove analogous results for the problem of determining the resource-bounded Kolmogorov complexity of strings, for certain types of Kolmogorov complexity measures.Also, the name of the conference is Symposium on Theoretical Aspects of Computer Science (STACS) -- although there does not appear to be a place to record this information on your web page form.
I listed the NSF grant that partially supported Dhiraj Holden (via Chris Umans, who is the "grantee"). There wasn't a place to click on NSERC (the Canadian version of NSF), and thus I didn't list the NSERC support for Valentine Kabanets. I don't know if this is what you want.Peer reviewedThe later journal version of this paper is available from the publisher at http://dx.doi.org/10.1007/s00037-016-0124-0 (Version of Record) and at http://dx.doi.org/doi:10.7282/T31G0PDW (Accepted Manuscript version)
DESIGN, IMPLEMENTATION, AND FEEDBACK STABILIZATION OF A PERMANENT MAGNET LEVITATION SYSTEM
No full textMagnetic manipulators are a class of systems for noncontact control of magnetized objects at a distance. These systems have found a range of applications in minimally invasive medical procedures, microrobotics, magnetic tweezers, microfluidics, and lab-on-a-chip devices. The magnetic field used for manipulation is conventionally produced by arrays of electromagnets, which are simply controlled by their voltages. However, electromagnets suffer from the disadvantage of generating much weaker magnetic fields compared to the permanent magnets of similar size, weight, and cost. Therefore, research efforts are ongoing to replace electromagnets with permanent magnets in order to develop more compact and less expensive magnetic manipulators. In these manipulators, magnetic field is controlled by displacement of the permanent magnets using mechanical actuators.This thesis intends to replace electromagnets with permanent magnets in the magnetic levitation systems (MLS). An MLS is a one-dimensional (1D) magnetic manipulator that levitates magnetic objects against gravity by feedback control of magnetic force applied to them. Instead of controlling the magnetic force of electromagnets using their voltages, in this work, the magnetic force is controlled by a linear servomotor which adjusts the distance between a permanent magnet and the levitating object. Based on this concept, a permanent magnet MLS is designed, implemented, and stabilized by feedback control, levitating a ferromagnetic sphere of diameter 5 mm at an equilibrium point i.e. 3 mm above its initial position. The resulting MLS is tested in practice and its performance is verified by experiments.The MLS developed in this work features many properties of more complex 2D and 3D magnetic manipulators. Therefore, it provides a convenient means for early study of more complex magnetic manipulators. In particular, it can be used to empirically study the linear limitation of small bandwidth and nonlinear limitation of finite slew rate of the mechanical actuators on the overall performance, including the stability, of magnetic manipulators
The minimum oracle circuit size problem
No full textWe consider variants of the Minimum Circuit Size Problem MCSP, where the goal is to minimize the size of oracle circuits computing a given function. When the oracle is QBF, the resulting problem MCSPQBF is known to be complete for PSPACE under ZPP reductions. We show that it is not complete under logspace reductions, and indeed it is not even hard for TC0 under uniform AC0 reductions. We obtain a variety of consequences that follow if oracle versions of MCSP are hard for various complexity classes under different types of reductions. We also prove analogous results for the problem of determining the resource-bounded Kolmogorov complexity of strings, for certain types of Kolmogorov complexity measures.The earlier conference paper version of this article is available from http://dx.doi.org/10.7282/T3Z60QVR and from the Dagstuhl Research Online Publication Server at http://dx.doi.org/10.4230/LIPIcs.STACS.2015.21.Peer reviewed
A Comparative Study on Influence of Different Wheat Milled Products on Pasta Processing - A biochemical approach
No full textThis Dissertation / Report is the outcome of investigation carried out by the creator(s) / author(s) at the department/division of Central Food Technological Research Institute (CFTRI), Mysore mentioned below in this page
Demonetizace v Indii
No full textTato práce pojednává o demonetizaci v Indii. Pro zodpovězení důvodu demonetizace autor provedl výzkum důsledků tohoto jevu obecně, i ve vztahu ke specifickým rysům indické ekonomiky. Závěrečně byla provedena analýza, zda byla demonetizace potřebná pro tuto zemi.The following thesis talks about Demonetization in India. In the search of why was demonetization conducted, the author of the thesis has made research on the consequences of demonetization and further associated it with the specific features of the Indian economy to analyze if the act of demonetization was necessary for the country or not
Thermal and electrical transport properties of polyvinyl alcohol and bismuth ferrite nanocomposites film
No full textPhysical database design of object-oriented databases
No full textThis thesis was scanned from the print manuscript for digital preservation and is copyright the author.
Researchers can access this thesis by asking their local university, institution or public library to
make a request on their behalf. Monash staff and postgraduate students can use the link in the References field
LOT: Logic Optimization with Testability - new transformations for logic synthesis
No full textA new approach to optimize multilevel logic circuits is introduced. Given a multilevel circuit, the synthesis method optimizes its area while simultaneously enhancing its random pattern testability. The method is based on structural transformations at the gate level. New transformations involving EX-OR gates as well as Reed–Muller expansions have been introduced in the synthesis of multilevel circuits. This method is augmented with transformations that specifically enhance random-pattern testability while reducing the area. Testability enhancement is an integral part of our synthesis methodology. Experimental results show that the proposed methodology not only can achieve lower area than other similar tools, but that it achieves better testability compared to available testability enhancement tools such as tstfx. Specifically for ISCAS-85 benchmark circuits, it was observed that EX-OR gate-based transformations successfully contributed toward generating smaller circuits compared to other state-of-the-art logic optimization tools
Recommended from our members
Opinion leaders on Twitter immigration issue networks : combining agenda-setting effects and the two-step flow of information
Get PDFThis dissertation focuses on opinion leaders on the Twitter issue networks to examine the two-step flow of information and agenda-setting effects. It analyzes the US immigration issue network as a case study because it is controversial on Twitter, and many elites such as lawyers and politicians who can influence others’ opinions are engaged in Twitter debates. Twitter is an important platform for active public debates, serving as a networked public sphere that can be used as a source and disseminator of information. Research has shown that communication patterns on the networked public spheres vary, including top-down, bottom-up, and side-by-side communications.
This dissertation asked the following questions: (1) what is the shape of the Twitter immigration issue network? (2) who are Twitter opinion leaders, and what are their characteristics? and (3) who sets the agenda on Twitter: news media, opinion leaders, or the public? To answer those questions, this dissertation employs (1) social network analysis to identify immigration issue networks and opinion leaders, (2) hierarchical linear regressions to examine factors that can predict opinion leadership, and (3) Granger causality tests to measure the longitudinal agenda-setting effects of each group (news media, opinion leaders, and the public). The author differentiated between the retweet and mention networks because while the retweet network is intended to disseminate information, the mention network is intended to elicit responses, motivating users to participate in Twitter conversations.
Through social network analysis, the author found divisions among clusters. Especially, the retweet network was classified as a polarized network and the mention network was described as a community cluster. The results of hierarchical linear regression analyses indicated that elite status, verified status, the number of followers, and individual issue involvement were common predictors of opinion leadership. The results of time-series Granger causality tests showed a mixture of top-down and bottom-up agenda-setting effects. This dissertation extends our theoretical understanding of opinion leaders based on traditional theories including two-step flow of information and agenda-setting effects. A key practical implication is that active Twitter users can be opinion leaders and can contribute to setting an issue agenda.Journalism and Medi
Fabrication of a Fabry-Pérot cavity in a microfluidic channel using thermocompressive gold bonding of glass substrates
Get PDFThis paper presents a simple, low-cost, and reliable process for the fabrication of a microfluidic Fabry-Pérot cavity in a Pyrex glass substrate. The microfluidic channels were etched in HF solution on a glass substrate using a Cr/Au/photoresist etching mask resulting in a channel bottom roughness of 1.309 nm. An effective thermocompressive gold-gold bonding technique was used to bond the photolithographically etched glass substrates inside a 350° C oven in a 10-3 torr vacuum. Pressure was applied to the glass pieces by using two aluminum blocks with intermediate copper sheets. This method takes advantage of using Cr/Au layers both as a wet etching mask and as intermediate bonding layers, requiring only one lithography step for the entire process. The fabrication method is also compatible with the incorporation of dielectric mirror coatings in the channels to form a high-finesse Fabry-Pérot cavity. A parallelism of 0.095 degrees was measured, and a finesse as high as 30 was obtained using an LED. The microfluidic cavity developed here can be used in electrophoresis and intracavity spectroscopy experiments.This work was supported by DARPA under Research Contract E-21-F89-G1
