40106229
Computer Simulation for Protein Folding
An equalizer circuit arrangement is provided for use without readjustment for a wide range of transmission line lengths. The circuit (10) is comprised of a resistor (20) and a capacitor (22) which introduce an additional time constant delay into the transmission system in order to reduce the percentage change of the transmission line response time for the shortest line used as compared to the longest line employed. This reduction permits one equalizer to be designed and used for the complete range of transmission line lengths involved.
46710688
Simulations of Protein Folding Process
A device for dispensing adhesive tape directly onto a surface includes a housing comprising a pair of spaced tear-drop shaped panels and a wall joining the peripheral edges thereof. A spool extending between the panels supports a roll of adhesive tape in rotatable fashion, with the free end thereof extending to a slot opening in the apex of the housing. A post extends between the panels medially of the roll and the slot opening. A spring member is secured to the post, one end thereof having a serrated cutting edge and anvil disposed in the slot opening, the other end impinging resiliently on the supply roll to act as a brake thereon.
17409111
Real-time Competition Simulation System
In tennis competition, there are some reasons leading to the competition results inaccurately. So I put forward a real-time competition simulation system to solve the tennis problem. It can overcome the limitations and the blind spots that occur in human observation. The system includes four parts: image collection, moving object detection and tracking, static scene simulation, competition simulation. This paper presents an algorithm for the detection and tracking of moving objects in sequence images that can be applied in simulations of tennis competition. The approach differs from most other methods that solve the problems of object occlusion and object deformation. The experimental results proved that our method is feasibility and usefulness.
18244826
A Simulating Algorithm for Protein Folding Process
It is a difficult problem of studying the protein folding process in the protein research field. In this paper, a new simulation algorithm-snake simulation algorithm is put forward to solve the problem. In order to prove the key function in snake simulation algorithm is correct and feasible, theory of molecule oscillation and molecule kinetics are used. In addition, bring forward a model that describes the process of protein folding, concludes that all the protein structure can be constructed by two type functions. Compared with other five protein folding algorithms, the snake simulation algorithm has a great advantage in the energy and similar of protein structure.
5499355
Methods and Simulations for the Protein Folding
Corrosion of metals in contact with liquid systems is reduced by adding to the system a small amount of an amino carboxylic acid containing at least one hydrophobic group in combination with another nitrogen containing compound. The other compound is preferably an ether amine or a quaternary ammonium compound which also contain hydrophobic groups. The combination of substances is particularly useful for preventing corrosion in different areas of oil recovery and in petroleum industry.
7309958
Using temporal logic to specify adaptive program semantics
Abstract Computer software must dynamically adapt to changing conditions. In order to fully realize the benefit of dynamic adaptation, it must be performed correctly. The correctness of adaptation cannot be properly addressed without precisely specifying the requirements for adaptation. This paper introduces an approach to formally specifying adaptation requirements in temporal logic. We introduce A-LTL, an adaptation-based extension to linear temporal logic, and use this logic to specify three commonly used adaptation semantics. Composition techniques are developed and applied to A-LTL to construct the specification of an adaptive program. We introduce adaptation semantics graphs to visually represent the adaptation semantics, which can also be used to automatically generate specification for adaptive programs.
1411838
3D Motion Segmentation from Straight-Line Optical Flow
We present a closed form solution to the problem of segmenting multiple 3D motion models from straight-line optical flow. We introduce the multibody line optical flow constraint(MLOFC), a polynomial equation relating motion models and line parameters. We show that the motion models can be obtained analytically as the derivative of the MLOFC at the corresponding line measurement, without knowing the motion model associated with that line. Experiments on real and synthetic sequences are also presented.
15146782
Sharing inertia load between multiple robots with active compliant grippers using trajectory pre-shaping
In this paper we propose a cooperative motion scheme that is able to control the sharing of gravitational and inertia load (forces required for load acceleration/deceleration) among multiple position-controlled robots. We adopt a clamped-free configuration, where a leader robot grasps the load directly and a follower robot grasps the load through a spring mounted on its end effector. While the leader travels the designated trajectory, a delta trajectory is added to the follower that supplies its share of inertia force by stretching/compressing the spring. The trajectory of the follower is pre-shaped to cancel out vibrations, therefore reducing the impact force on the robot mechanism. The spring also provides compliance in non-force-controlled directions to reduce internal forces. We analyze the influence of temporal error on both load sharing and internal force and propose a synchronization method to reduce this error to less than 1 ms. Every aspect of our scheme can be implemented with commercial robots without any modification of controller parameters or knowledge of the manipulator dynamics. Being able to execute our cooperative motion at a speed of 0.5 m per sec, it is much faster than impedance/hybrid control based approaches, suggesting the ability to satisfy the cycle time requirement for industrial applications such as material handling.
3408795
Arnetminer: expertise oriented search using social networks
Expertise Oriented Search (EOS) aims at providing comprehensive expertise analysis on data from distributed sources. It is useful in many application domains, for example, finding experts on a given topic, detecting the confliction of interest between researchers, and assigning reviewers to proposals. In this paper, we present the design and implementation of our expertise oriented search system, Arnetminer (http://www.arnetminer.net). Arnetminer has gathered and integrated information about a half-million computer science researchers from the Web, including their profiles and publications. Moreover, Arnetminer constructs a social network among these researchers through their co-authorship, and utilizes this network information as well as the individual profiles to facilitate expertise oriented search tasks. In particular, the co-authorship information is used both in ranking the expertise of individual researchers for a given topic and in searching for associations between researchers. We have conducted initial experiments on Arnetminer. Our results demonstrate that the proposed relevancy propagation expert finding method outperforms the method that only uses person local information, and the proposed two-stage association search on a large-scale social network is order of magnitude faster than the baseline method.
15124700
Motion segmentation of multiple translating objects using line correspondences
We present an algebraic approach to multibody motion segmentation from line correspondences. Given three perspective views containing multiple linearly moving objects, we demonstrate that after applying a polynomial embedding to the line correspondences, they became related by the so-called multibody line constraint of translational motions. We show how to linearly estimate the multibody trifocal epipole from line-line-line correspondences. The individual trifocal epipoles are then obtained from the derivatives of the multibody line constraint (up to an unknown factor). Given normalized trifocal epipoles, we can use any special clustering technique to obtain the clustering of the motions and the correspondences. The limitations of the proposed algorithm are also discussed. Experimental results on synthetic and real dynamic scenes are presented.