The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Understanding the hydrodynamics of liquid-liquid slug flow is important in the emerging field of plug-based microfluidics; however, the subtle aspects of the vortex geometry are still not comprehensively understood. This paper discusses the hydrodynamics of deformation dependent vortices that develop inside a water-in-oil slug as it flows through a channel. In contrast to prior studies, our simulations...
An active area of biological research is the construction of neural atlases and repositories of 3D neural images. The goal is to achieve insight into the structural and functional characteristics of classes of similar as well as dissimilar neurons with a view to understand how cellular structure regulates function. However, at present there is no well- established framework that can compare, analyze,...
An open problem in biological image processing and analysis is the automated generation of neural atlases from image data. Such a neural atlas should be capable of representing typical neurons for each possible class. Further, the functioning atlas, called a neurome in this work, should enable the computation of neuron-to-neuron distances for the purposes of comparison and classification. Three technical...
Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result which illustrates the power of counting is considered to be a seminal result in computational complexity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.