AT91RM9200与Compact Flash接口电路及其驱动程序设计

介绍了基于ARM920T内核的AT91RM9200处理器与Compact Flash卡的接口电路以及Compact Flash卡驱动程序的编写、调试.提出了一种适合数据流量大、实时性能要求高的现场实时数据采集、事后PC机做分析处理的实时数据采集系统。

Topological objects in the O(3) nonlinear sigma model

We study the topological defects in the nonlinear O(3) sigma model in terms of the decomposition of U(1) gauge potential. Time-dependent baby skyrmions are discussed in the (2 + 1)-dimensional spacetime with the CP1 field. Furthermore, we show that there are three kinds of topological defects-vortex lines, point defects and knot exist in the (3 + 1)-dimensional model, and their topological charges, locations and motions are determined by the phi-mapping topological current theory.

Topological objects in two-gap superconductor

We discuss the non-Abelian topological objects, in particular the non-Abrikosov vortex and the magnetic knot made of the twisted non-Abrikosov vortex, in two-gap superconductor. We show that there are two types of non-Abrikosov vortex in Ginzburg-Landau theory of two-gap superconductor, the D-type which has no concentration of the condensate at the core and the N-type which has a non-trivial profile of the condensate at the core, under a wide class of realistic interaction potential. We prove that these non-Abrikosov vortices can have either integral or fractional magnetic flux, depending on the interaction potential. We show that they are described by the non-Abelian topology pi(2)(S-2) and pi(1)(S-1), in addition to the well-known Abelian topology pi(1)(S-1). Furthermore, we discuss the possibility to construct a stable magnetic knot in two-gap superconductor by twisting the non-Abrikosov vortex and connecting two periodic ends together, whose knot topology pi(3)(S-2) is described by the Chern-Simon index of the electromagnetic potential. We argue that similar topological objects may exist in multi-gap or multi-layer superconductors and multi-component Bose-Einstein condensates and superfluids, and discuss how these topological objects can be constructed in MgB2, Sr2RuO4, He-3, and liquid metallic hydrogen.

A compact proton source for space simulation

A compact proton beam source for space simulation has been developed. A compact structure was designed in order to meet the special requirements of miniaturization. Some particular means have been adopted for improving the proton portion and beam transmission at a long distance. The experimental results showed that 8mA/80keV proton beam can be successfully obtained from this source at about 700W input microwave power.

The Compact Pulsed Hadron Source: A Design Perspective

During the past. decades, large-scale national neutron sources have been developed in Asia, Europe, and North America. Complementing such efforts, compact hadron beam complexes and neutron sources intended to serve primarily universities and industrial institutes have been proposed, and some have recently been established. Responding to the demand in China for pulsed neutron/proton-beam platforms that are dedicated to fundamental and applied research for users in multiple disciplines from materials characterization to hadron therapy and radiography to accelerator-driven sub-critical reactor systems (ADS) for nuclear waste transmutation, we have initiated the construction of a compact, yet expandable, accelerator complex-the Compact Pulsed Hadron Source (CPHS). It consists of an accelerator front-end (a high-intensity ion source, a 3-MeV radio-frequency quadrupole linac (RFQ), and a 13-MeV drift-tube linac (DTL)), a neutron target station (a beryllium target with solid methane and room-temperature water moderators/reflector), and experimental stations for neutron imaging/radiography, small-angle scattering, and proton irradiation. In the future, the CPHS may also serve as an injector to a ring for proton therapy and radiography or as the front end to an ADS test facility. In this paper, we describe the design of the CPHS technical systems and its intended operation.

adaptive location update mechanism for network-constrained moving objects in changeful traffic conditions

Natl Chiao Tung Univ, Dept Comp Sci

Computer Perception of Three-Dimensional Objects

We first pose the following problem: to develop a program which takes line-drawings as input and constructs three-dimensional objects as output, such that the output objects are the same as the ones we see when we look at the input line-drawing. We then introduce the principle of minimum standard-deviation of angles (MSDA) and discuss a program based on MSDA. We present the results of testing this program with a variety of line- drawings and show that the program constitutes a solution to the stated problem over the range of line-drawings tested. Finally, we relate this work to its historical antecedents in the psychological and computer-vision literature.

Stimulus Familiarity Determines Recognition Strategy for Novel 3-D Objects

We describe a psychophysical investigation of the effects of object complexity and familiarity on the variation of recognition time and recognition accuracy over different views of novel 3D objects. Our findings indicate that with practice the response times for different views become more uniform and the initially orderly dependency of the response time on the distance to a "good" view disappears. One possible interpretation of our results is in terms of a tradeoff between memory needed for storing specific-view representations of objects and time spent in recognizing the objects.

Recognizing Three-Dimensional Objects without the Use of Models

We present an approach to the problem of recognizing three-dimensional objects from line-drawings. In this approach there are no models. The system needs only to be given a single picture of an object; it can then recognize the object in arbitrary orientations.

The Alignment of Objects With Smooth Surfaces: Error Analysis of the Curvature Method

The recognition of objects with smooth bounding surfaces from their contour images is considerably more complicated than that of objects with sharp edges, since in the former case the set of object points that generates the silhouette contours changes from one view to another. The "curvature method", developed by Basri and Ullman [1988], provides a method to approximate the appearance of such objects from different viewpoints. In this paper we analyze the curvature method. We apply the method to ellipsoidal objects and compute analytically the error obtained for different rotations of the objects. The error depends on the exact shape of the ellipsoid (namely, the relative lengths of its axes), and it increases a sthe ellipsoid becomes "deep" (elongated in the Z-direction). We show that the errors are usually small, and that, in general, a small number of models is required to predict the appearance of an ellipsoid from all possible views. Finally, we show experimentally that the curvature method applies as well to objects with hyperbolic surface patches.

Recovery of Three-Dimensional Objects from Single Perspective Images

Any three-dimensional wire-frame object constructed out of parallelograms can be recovered from a single perspective two-dimensional image. A procedure for performing the recovery is given.

Mid-Level Vision and Recognition of Non-Rigid Objects

We address mid-level vision for the recognition of non-rigid objects. We align model and image using frame curves - which are object or "figure/ground" skeletons. Frame curves are computed, without discontinuities, using Curved Inertia Frames, a provably global scheme implemented on the Connection Machine, based on: non-cartisean networks; a definition of curved axis of inertia; and a ridge detector. I present evidence against frame alignment in human perception. This suggests: frame curves have a role in figure/ground segregation and in fuzzy boundaries; their outside/near/top/ incoming regions are more salient; and that perception begins by setting a reference frame (prior to early vision), and proceeds by processing convex structures.

Recognizing 3-D Objects Using 2-D Images

We discuss a strategy for visual recognition by forming groups of salient image features, and then using these groups to index into a data base to find all of the matching groups of model features. We discuss the most space efficient possible method of representing 3-D models for indexing from 2-D data, and show how to account for sensing error when indexing. We also present a convex grouping method that is robust and efficient, both theoretically and in practice. Finally, we combine these modules into a complete recognition system, and test its performance on many real images.

Three-Dimensional Recognition of Solid Objects from a Two-Dimensional Image

This thesis addresses the problem of recognizing solid objects in the three-dimensional world, using two-dimensional shape information extracted from a single image. Objects can be partly occluded and can occur in cluttered scenes. A model based approach is taken, where stored models are matched to an image. The matching problem is separated into two stages, which employ different representations of objects. The first stage uses the smallest possible number of local features to find transformations from a model to an image. This minimizes the amount of search required in recognition. The second stage uses the entire edge contour of an object to verify each transformation. This reduces the chance of finding false matches.