Techniques are described that have been used to create a statistically representative three-dimensional model microstructure
for input into computer simulations using the geometric and crystallographic observations from two orthogonal sections through
an aluminum polycrystal. Orientation maps collected on the observation planes are used to characterize the sizes, shapes,
and orientations of grains. Using a voxel-based tessellation technique, a microstructure is generated with grains whose size
and shape are constructed to conform to those measured experimentally. Orientations are then overlaid on the grain structure
such that distribution of grain orientations and the nearest-neighbor relationships, specified by the distribution of relative
misorientations across grain boundaries, match the experimentally measured distributions. The techniques are applicable to
polycrystalline materials with sufficiently compact grain shapes and can also be used to controllably generate a wide variety
of hypothetical microstructures for initial states in computer simulations.
This article is based on a presentation made at the symposium “Characterization and Representation of Material Microstructures
in 3-D” held October 8–10, 2002, in Columbus, OH, under the auspices of ASM International’s Phase Transformations committee. 相似文献
Distance labeling schemes are composed of a marker algorithm for
labeling the vertices of a graph with short labels, coupled with a
decoder algorithm allowing one to compute the distance between
any two vertices directly from their labels (without using any additional
information).
As applications for distance labeling schemes
concern mainly large and dynamically changing networks,
it is of interest to study distributed dynamic labeling schemes.
The current paper considers the problem on dynamic trees,
and proposes efficient distributed schemes for it.
The paper first presents a labeling scheme for distances in the dynamic
tree model, with amortized message complexity O(log2n) per operation,
where n is the size of the tree at the time the operation takes place.
The protocol maintains O(log2n) bit labels.
This label size is known to be optimal even in the static scenario.
A more general labeling scheme is then introduced for the dynamic tree
model, based on extending an existing static tree labeling
scheme to the dynamic setting. The approach fits a number of
natural tree functions, such as distance, separation level, and flow.
The main resulting scheme incurs an overhead
of an O(log n) multiplicative factor in both the label size and
amortized message complexity in the case of dynamically growing
trees (with no vertex deletions).
If an upper bound on n is known in advance,
this method yields a different tradeoff, with an
O(log2n/log log n) multiplicative overhead on the label
size but only an O(log n/log log n) overhead on the amortized
message complexity.
In the fully dynamic model the scheme also incurs an increased
additive overhead in amortized communication, of O(log2n)
messages per operation. 相似文献
Current software and hardware systems, being parallel and reconfigurable, raise new safety and reliability problems, and the resolution of these problems requires new methods. Numerous proposals aim at reducing the threat of bugs and preventing several kinds of attacks. In this paper, we develop an extension of the calculus of mobile ambients, named controlled ambients, that is suited for expressing such issues, specifically denial of service attacks. We present a type system for controlled ambients, which makes static resource control possible in our setting, and enhance it with a rich notion of resources . 相似文献
A classical model of neuronal signal transmission describing the presence of both a threshold and a saturation in the neuron response is considered. This model is used to analyze the transduction by the neuron of various types of information-carrying input signals in the presence of noise. Improvement by noise of the performance via stochastic resonance is established for transmission in both the threshold and the saturation regimes. Stochastic resonance at saturation is a novel form, expressing that the distortion experienced by large input signals transmitted at saturation, can be reduced by addition of noise. 相似文献
Investigation of augmented reality (AR) environments has become a popular research topic for engineers, computer and cognitive scientists. Although application oriented studies focused on audio AR environments have been published, little work has been done to vigorously study and evaluate the important research questions of the effectiveness of three-dimensional (3D) sound in the AR context, and to what extent the addition of 3D sound would contribute to the AR experience.
Thus, we have developed two AR environments and performed vigorous experiments with human subjects to study the effects of 3D sound in the AR context. The study concerns two scenarios. In the first scenario, one participant must use vision only and vision with 3D sound to judge the relative depth of augmented virtual objects. In the second scenario, two participants must cooperate to perform a joint task in a game-based AR environment.
Hence, the goals of this study are (1) to access the impact of 3D sound on depth perception in a single-camera AR environment, (2) to study the impact of 3D sound on task performance and the feeling of ‘human presence and collaboration’, (3) to better understand the role of 3D sound in human–computer and human–human interactions, (4) to investigate if gender can affect the impact of 3D sound in AR environments. The outcomes of this research can have a useful impact on the development of audio AR systems, which provide more immersive, realistic and entertaining experiences by introducing 3D sound. Our results suggest that 3D sound in AR environment significantly improves the accuracy of depth judgment and improves task performance. Our results also suggest that 3D sound contributes significantly to the feeling of human presence and collaboration and helps the subjects to ‘identify spatial objects’. 相似文献
A simple Markov random field model with a new implementation scheme is proposed for unsupervised image segmentation based on image features. The traditional two-component MRF model for segmentation requires training data to estimate necessary model parameters and is thus unsuitable for unsupervised segmentation. The new implementation scheme solves this problem by introducing a function-based weighting parameter between the two components. Using this method, the simple MRF model is able to automatically estimate model parameters and produce accurate unsupervised segmentation results. Experiments demonstrate that the proposed algorithm is able to segment various types of images (gray scale, color, texture) and achieves an improvement over the traditional method. 相似文献
On September 11, 2001, the Center for Robot-Assisted Search and Rescue (CRASAR) responded within six hours to the World Trade Center (WTC) disaster; this is the first known use of robots for urban search and rescue (USAR). The University of South Florida (USF) was one of the four robot teams, and the only academic institution represented. The USF team participated onsite in the search efforts from 12-21 September 2001, collecting and archiving data on the use of all robots, in addition to actively fielding robots. This article provides an overview of the use of robots for USAR, concentrating on what robots were actually used and why. It describes the roles that the robots played in the response and the impact of the physical environment on the platforms. The quantitative and qualitative performance of the robots are summarized in terms of their components (mobility, sensors, control, communications, and power) and within the larger human-robot system. Lessons learned are offered and a synopsis of the current state of rescue robotics and activities at the CRASAR concludes the article. 相似文献
Genetic algorithms are applied to an important, but little investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network to adapt to changes in its operating conditions. These conditions include: which nodes and links are unavailable; the traffic patterns; and the quality of service (QoS) requirements and priorities of different users and applications. Dynamic reconfiguration is possible in networks that contain links whose endpoints can be easily changed, such as satellite channels, terrestrial wireless connections, and certain types of optical connections. We report preliminary results that demonstrate the feasibility of performing genetic search quickly enough for online adaptation. 相似文献
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely match directly. Thus, to complete the task of schema mapping, we must also compute indirect matches. In this paper, we present a composite approach for generating a source-to-target mapping that contains both direct and many indirect matches between a source schema and a target schema. Recognizing expected-data values associated with schema elements and applying schema-structure heuristics are the key ideas needed to compute indirect matches. Experiments we have conducted over several real-world application domains show encouraging results, yielding about 90% precision and recall measures for both direct and indirect matches. 相似文献