Search

—In modern age, there are huge requirements for web applications like ticket booking for shows, reservation for travelling, ordering food, booking a cab, online payment transactions and so on. This paper discusses a web application designed for e-voting system using open source tools like Django web framework and MySQL database. Python language is used for programming. Voting confidentiality is provided through Paillier homomorphic algorithm. The web application is designed to provide voter, administrative and electoral support. In the implemented system, the electoral head (EH) controls the voting process and is the trusted entity. The Paillier algorithm along with its web interface was simulated and tested successfully.&nbsp

In this paper, we tackle the problem of multibody SLAM from a monocular camera. The term multibody, implies that we track the motion of the camera, as well as that of other dynamic participants in the scene. The quintessential challenge in dynamic scenes is unobservability: it is not possible to unambiguously triangulate a moving object from a moving monocular camera. Existing approaches solve restricted variants of the problem, but the solutions suffer relative scale ambiguity (i.e., a family of infinitely many solutions exist for each pair of motions in the scene). We solve this rather intractable problem by leveraging single-view metrology, advances in deep learning, and category-level shape estimation. We propose a multi pose-graph optimization formulation, to resolve the relative and absolute scale factor ambiguities involved. This optimization helps us reduce the average error in trajectories of multiple bodies over real-world datasets, such as KITTI. To the best of our knowledge, our method is the first practical monocular multi-body SLAM system to perform dynamic multi-object and ego localization in a unified framework in metric scale., Comment: Accepted to IEEE Intelligent Vehicles Symposium 2020 (IV2020)

The importance of the Translation Lookaside Buffer (TLB) on system performance is well known. There have been numerous prior efforts addressing TLB design issues for cutting down access times and lowering miss rates. However, it was only recently that the first exploration [26] on prefetching TLB entries ahead of their need was undertaken and a mechanism called Recency Prefetching was proposed. There is a large body of literature on prefetching for caches, and it is not clear how they can be adapted (or if the issues are different) for TLBs, how well suited they are for TLB prefetching, and how they compare with the recency prefetching mechanism.This paper presents the first detailed comparison of different prefetching mechanisms (previously proposed for caches) - arbitrary stride prefetching, and markov prefetching - for TLB entries, and evaluates their pros and cons. In addition, this paper proposes a novel prefetching mechanism, called Distance Prefetching, that attempts to capture patterns in the reference behavior in a smaller space than earlier proposals. Using detailed simulations of a wide variety of applications (56 in all) from different benchmark suites and all the SPEC CPU2000 applications, this paper demonstrates the benefits of distance prefetching.

One important issue for practitioners and academicians is that there are almost no platforms based on analytical models for testing the impact of various architectural and design modifications for intelligent network interface cards (NICs). Simulations are typically time consuming, especially for experimenting with different scenarios and what-if analysis. In this research, we study the performance of an NIC called Myrinet developed by Myricom. We develop an open queueing network model to predict its performance and compare the analytical results with the simulations. The reason that there are very few analytical models is that the performance-analysis problem is enormously complex. In particular, the problem is a combination of (a) multiclass queueing network with class switching, (b) polling system with limited service discipline, and (c) finite-capacity queues with blocking. These three issues have been treated only in isolation in the literature. However, the problem becomes much harder when all three issues are simultaneously present. One of the key contributions of this work is an analytical approximation of this complex system. From an analytical modelling standpoint, we observe that making simplifying assumptions to analyze nodes that are not bottlenecks does not greatly affect performance. The main findings of this research are the bottlenecks of the queueing network, utilizations of the various nodes, and performance measures such as the expected delay. The model as well as findings can be used to test the performance impact of various enhancements to the operation of NICs.

(R)-?-acetylmercaptoisobutyric acid (RAM), a chiral compound, is an important intermediate for the chemical synthesis of various antihypertensive and congestive heart failure drugs. Microorganisms capable of converting (R,S)-?-acetylmercaptoisobutyric acid ((R,S)-ester) to RAM were screened from soil microorganisms. A strain of Pseudomonas sp. 1001 screened from a soil sample was selected to be the best. Cells showed an activity of 540 U/mL from culture broth and the enzyme was thermostable up to 70�C. This strain could produce RAM asymmetrically from (R,S)-ester.

[No abstract available]