Three-loop HTLpt thermodynamics at finite temperature and chemical potential

In this proceedings we present a state-of-the-art method of calculating thermodynamic potential at finite temperature and finite chemical potential, using Hard Thermal Loop perturbation theory (HTLpt) up to next-to-next-leading-order (NNLO). The resulting thermodynamic potential enables us to evaluate different thermodynamic quantities including pressure and various quark number susceptibilities (QNS). Comparison between our analytic results for those thermodynamic quantities with the available lattice data shows a good agreement.Comment: 5 pages, 6 figures, conference proceedings of XXI DAE-BRNS HEP Symposium, IIT Guwahati, December 2014; to appear in 'Springer Proceedings in Physics Series

An FPGA-based divider circuit using simulated annealing algorithm

Division is considered as the slowest and most difficult operation among four basic operations in microprocessors. This paper proposes a unique division algorithm using a new approach of simulated annealing algorithm. A heuristic function is proposed to determine the global and local optimum value, whereas the conventional approaches use random values to reach the target value. In addition, a new temperature schedule is introduced for faster computation of global maxima/minima. The proposed simulated annealing performs better than the best known existing method of simulated annealing algorithm for smooth energy landscape due to the introduction of a new goal-based temperature. Thus, the proposed division algorithm computes the current partial remainder and quotient bits simultaneously per iteration which reduces the delay of the proposed divider circuit significantly. Moreover, the proposed divider circuit requires only two operations per iteration, whereas the exiting best one requires three operations per iteration. The proposed divider circuit is coded in VHDL and implemented in a Virtex-6 platform targeting XC6VLX75T Xilinx FPGA with a -3 speed grade by using ISE 13.1. The proposed divider circuit achieves an improvement of 36.17% and 44.67% respectively in terms of LUTs and delay factor for a 256 by 128 bit division over the best known contemporary FPGA-based divider circuit. It can be used into the designs of arithmetic logic unit, image processing and robotics system. The experimental result indicates that the divider takes fewer resources, and its performance is steady and reliable

Methodology for extensive evaluation of semiautomatic and interactive segmentation algorithms using simulated Interaction models

Performance of semiautomatic and interactive segmentation(SIS) algorithms are usually evaluated by employing a small number of human operators to segment the images. The human operators typically provide the approximate location of objects of interest and their boundaries in an interactive phase, which is followed by an automatic phase where the segmentation is performed under the constraints of the operator-provided guidance. The segmentation results produced from this small set of interactions do not represent the true capability and potential of the algorithm being evaluated. For example, due to inter-operator variability, human operators may make choices that may provide either overestimated or underestimated results. As well, their choices may not be realistic when compared to how the algorithm is used in the field, since interaction may be influenced by operator fatigue and lapses in judgement. Other drawbacks to using human operators to assess SIS algorithms, include: human error, the lack of available expert users, and the expense. A methodology for evaluating segmentation performance is proposed here which uses simulated Interaction models to programmatically generate large numbers of interactions to ensure the presence of interactions throughout the object region. These interactions are used to segment the objects of interest and the resulting segmentations are then analysed using statistical methods. The large number of interactions generated by simulated interaction models capture the variabilities existing in the set of user interactions by considering each and every pixel inside the entire region of the object as a potential location for an interaction to be placed with equal probability. Due to the practical limitation imposed by the enormous amount of computation for the enormous number of possible interactions, uniform sampling of interactions at regular intervals is used to generate the subset of all possible interactions which still can represent the diverse pattern of the entire set of interactions. Categorization of interactions into different groups, based on the position of the interaction inside the object region and texture properties of the image region where the interaction is located, provides the opportunity for fine-grained algorithm performance analysis based on these two criteria. Application of statistical hypothesis testing make the analysis more accurate, scientific and reliable in comparison to conventional evaluation of semiautomatic segmentation algorithms. The proposed methodology has been demonstrated by two case studies through implementation of seven different algorithms using three different types of interaction modes making a total of nine segmentation applications to assess the efficacy of the methodology. Application of this methodology has revealed in-depth, fine details about the performance of the segmentation algorithms which currently existing methods could not achieve due to the absence of a large, unbiased set of interactions. Practical application of the methodology for a number of algorithms and diverse interaction modes have shown its feasibility and generality for it to be established as an appropriate methodology. Development of this methodology to be used as a potential application for automatic evaluation of the performance of SIS algorithms looks very promising for users of image segmentation

Development of a laser scanning thickness measurement inspection system

The quality specifications for products and the materials used in them are becoming ever more demanding. The solution to the many visual inspection quality assurance (QA) problems is the use of automatic in-line surface inspection systems. These need to achieve uniform product quality at high throughput speeds. As a result, there is a need for systems that allow 100% in-line testing of materials and surfaces. To reach this goal laser technology integrated with computer control technology provides a useful solution. In this work, a high speed, low cost, and high accuracy non-contact laser scanning inspection system is developed. The system is capable of measuring the thickness of solid, non-transparent objects using the principle of laser-optical triangulation. Measurement accuracies and repeatabilities to the micrometer level are achieved with the developed system

Entanglement entropy of a quantum unbinding transition and entropy of DNA

Two significant consequences of quantum fluctuations are entanglement and criticality. Entangled states may not be critical but a critical state shows signatures of universality in entanglement. A surprising result found here is that the entanglement entropy may become arbitrarily large and negative near the dissociation of a bound pair of quantum particles. Although apparently counter-intuitive, it is shown to be consistent and essential for the phase transition, by mapping to a classical problem of DNA melting. We associate the entanglement entropy to a subextensive part of the entropy of DNA bubbles, which is responsible for melting. The absence of any extensivity requirement in time makes this negative entropy an inevitable consequence of quantum mechanics in continuum. Our results encompass quantum critical points and first-order transitions in general dimensions.Comment: v2: 6 pages, 3 figures (title modified, more details and figures added

Fish seed production in ricefields: participatory training and extension manual

Seed (aquaculture), Rice field aquaculture, Rice fields, Manuals Oreochromis niloticus

Entropy and Exact Matrix Product Representation of the Laughlin Wave Function

An analytical expression for the von Neumann entropy of the Laughlin wave function is obtained for any possible bipartition between the particles described by this wave function, for filling fraction nu=1. Also, for filling fraction nu=1/m, where m is an odd integer, an upper bound on this entropy is exhibited. These results yield a bound on the smallest possible size of the matrices for an exact representation of the Laughlin ansatz in terms of a matrix product state. An analytical matrix product state representation of this state is proposed in terms of representations of the Clifford algebra. For nu=1, this representation is shown to be asymptotically optimal in the limit of a large number of particles

Far-Field Plasmonic Resonance Enhanced Nano-Particle Image Velocimetry within a Micro Channel

In this paper, a novel far-field plasmonic resonance enhanced nanoparticle-seeded Particle Image Velocimetry (nPIV) has been demonstrated to measure the velocity profile in a micro channel. Chemically synthesized silver nanoparticles have been used to seed the flow in the micro channel. By using Discrete Dipole Approximation (DDA), plasmonic resonance enhanced light scattering has been calculated for spherical silver nanoparticles with diameters ranging from 15nm to 200nm. Optimum scattering wavelength is specified for the nanoparticles in two media: water and air. The diffraction-limited plasmonic resonance enhanced images of silver nanoparticles at different diameters have been recorded and analyzed. By using standard PIV techniques, the velocity profile within the micro channel has been determined from the images.Comment: submitted to Review of Scientific Instrument