SIMPLE REMESHING SCHEME FOR THE FINITE ELEMENT BASED SIMULATION OF DOPANT DIFFUSION IN SILICON.

Process simulation programs are valuable in generating accurate impurity profiles. Apart from accuracy the programs should also be efficient so as not to consume vast computer memory. This is especially true for devices and circuits of VLSI complexity. In this paper a remeshing scheme to make the finite element based solution of the non-linear diffusion equation more efficient is proposed. A remeshing scheme based on comparing the concentration values of adjacent node was then implemented and found to remove the problems of oscillation.

A simple prediction model for asphalt surface texture incorporating mix gradation and air voids

This paper presents the results of a preliminary study that seeks to show how asphalt grading and air voids are related to the texture depth of asphalt. The fiftieth percentile particle size (D50) is shown to be a good predictor of texture depth measurements from a collected database of field and laboratory studies. The D50 is used to normalise collected texture data and this 'relative texture' is shown to correlate with air voids. Regression analyses confirm that air voids should be included along with a measure of gradation in the interpretation of asphalt surface texture.The derived formulae are used to develop correlation charts.

Vehicle trajectory linearisation to enable efficient optimisation of the constant speed racing line

A driver model is presented capable of optimising the trajectory of a simple dynamic nonlinear vehicle, at constant forward speed, so that progression along a predefined track is maximised as a function of time. In doing so, the model is able to continually operate a vehicle at its lateral-handling limit, maximising vehicle performance. The technique used forms a part of the solution to the motor racing objective of minimising lap time. A new approach of formulating the minimum lap time problem is motivated by the need for a more computationally efficient and robust tool-set for understanding on-the-limit driving behaviour. This has been achieved through set point-dependent linearisation of the vehicle model and coupling the vehicle-track system using an intrinsic coordinate description. Through this, the geometric vehicle trajectory had been linearised relative to the track reference, leading to new path optimisation algorithm which can be formed as a computationally efficient convex quadratic programming problem. © 2012 Copyright Taylor and Francis Group, LLC.

Highly chiral-selective growth of single-walled carbon nanotubes with a simple monometallic Co catalyst

We report on the growth of single-walled carbon nanotubes from a monometallic Co catalyst on an oxidized Si wafer support by the most simple growth recipe (vacuum annealing, growth by undiluted C 2H 2). Nevertheless, multiwavelength Raman spectroscopy and transmission electron spectroscopy show a remarkable selectivity for chiral indices and thus, e.g., high abundance with a single chirality representing 58% of all semiconducting tubes. In situ x-ray photoelectron spectroscopy monitors the catalyst chemistry during carbon nanotube growth and shows interfacial Co-Si interactions that may help to stabilize the nanoparticle/nanotube diameter. We outline a two-mechanism model explaining the selective growth. © 2012 American Physical Society.

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases

The Internet has enabled the creation of a growing number of large-scale knowledge bases in a variety of domains containing complementary information. Tools for automatically aligning these knowledge bases would make it possible to unify many sources of structured knowledge and answer complex queries. However, the efficient alignment of large-scale knowledge bases still poses a considerable challenge. Here, we present Simple Greedy Matching (SiGMa), a simple algorithm for aligning knowledge bases with millions of entities and facts. SiGMa is an iterative propagation algorithm which leverages both the structural information from the relationship graph as well as flexible similarity measures between entity properties in a greedy local search, thus making it scalable. Despite its greedy nature, our experiments indicate that SiGMa can efficiently match some of the world's largest knowledge bases with high precision. We provide additional experiments on benchmark datasets which demonstrate that SiGMa can outperform state-of-the-art approaches both in accuracy and efficiency.

Wrapping the cube and other polyhedra

An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double covers of the cube, is described with the aid of the two-parameter Goldberg- Coxeter construction. The strands of all such wrappings correspond to the central circuits (CCs) of octahedrites (four-regular polyhedral graphs with square and triangular faces), which for the cube necessarily have octahedral symmetry. Removing the symmetry constraint leads to wrappings of other eight-vertex convex polyhedra. Moreover, wrappings of convex polyhedra with fewer vertices can be generated by generalizing from octahedrites to i-hedrites, which additionally include digonal faces. When the strands of a wrapping correspond to the CCs of a four-regular graph that includes faces of size greater than 4, non-convex 'crinkled' wrappings are generated. The various generalizations have implications for activities as diverse as the construction of woven-closed baskets and the manufacture of advanced composite components of complex geometry. © 2012 The Royal Society.

Long Distance Wireless Networking for Site - Office Data Communications

Effective data communications between the project site and decision making office can be critical for the success of a construction project. It allows convenient access to centrally stored information and allows centrally located decision makers to remotely monitor the site and collect data in real-time. However, high bandwidth, flexible data communication networks, such as wired local area networks, can often be time-consuming and costly to deploy for such purposes especially when project sites (dams, highways, etc.) are located in rural, undeveloped areas where networking infrastructure is not available. In such construction sites, wireless networking could reliably link the construction site and the decision-making office. This paper presents a case study on long-distance, site – office wireless data communications. The purpose was to investigate the capability of wireless technology in exchanging construction data in a fast and efficient manner and in allowing site personnel to interact and share knowledge and data with the office staff. This study took place at the University of Michigan’s campus where performance, reliability, and cost/benefit tests were performed. The indoor and outdoor tests performed demonstrated the suitability of this technology for office-site data communications and exposed the need for more research to further improve the reliability and data handling of this technology.

Sensor graphs for guaranteed cooperative localization performance

A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of the graph of relative measurements is known to affect the steady-state value of the position error covariance matrix. Classes of sensor graphs are identified, for which tight bounds for the trace of the covariance matrix can be obtained based on the algebraic properties of the underlying relative measurement graph. The string and the star graph topologies are considered, and the explicit form of the eigenvalues of error covariance matrix is given. More general sensor graph topologies are considered as combinations of the string and star topologies, when additional edges are added. It is demonstrated how the addition of edges increases the trace of the steady-state value of the position error covariance matrix, and the theoretical predictions are verified through simulation analysis.

The most persistent soft-clique in a set of sampled graphs

When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques. We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations. Copyright 2012 by the author(s)/owner(s).

Templates and anchors for antenna-based wall following in cockroaches and robots

The interplay between robotics and neuromechanics facilitates discoveries in both fields: nature provides roboticists with design ideas, while robotics research elucidates critical features that confer performance advantages to biological systems. Here, we explore a system particularly well suited to exploit the synergies between biology and robotics: high-speed antenna-based wall following of the American cockroach (Periplaneta americana). Our approach integrates mathematical and hardware modeling with behavioral and neurophysiological experiments. Specifically, we corroborate a prediction from a previously reported wall-following template - the simplest model that captures a behavior - that a cockroach antenna-based controller requires the rate of approach to a wall in addition to distance, e.g., in the form of a proportional-derivative (PD) controller. Neurophysiological experiments reveal that important features of the wall-following controller emerge at the earliest stages of sensory processing, namely in the antennal nerve. Furthermore, we embed the template in a robotic platform outfitted with a bio-inspired antenna. Using this system, we successfully test specific PD gains (up to a scale) fitted to the cockroach behavioral data in a "real-world" setting, lending further credence to the surprisingly simple notion that a cockroach might implement a PD controller for wall following. Finally, we embed the template in a simulated lateral-leg-spring (LLS) model using the center of pressure as the control input. Importantly, the same PD gains fitted to cockroach behavior also stabilize wall following for the LLS model. © 2008 IEEE.

A simple bioconjugate attachment protocol for use in single molecule force spectroscopy experiments based on mixed self-assembled monolayers.

Single molecule force spectroscopy is a technique that can be used to probe the interaction force between individual biomolecular species. We focus our attention on the tip and sample coupling chemistry, which is crucial to these experiments. We utilised a novel approach of mixed self-assembled monolayers of alkanethiols in conjunction with a heterobifunctional crosslinker. The effectiveness of the protocol is demonstrated by probing the biotin-avidin interaction. We measured unbinding forces comparable to previously reported values measured at similar loading rates. Specificity tests also demonstrated a significant decrease in recognition after blocking with free avidin.

A family of simple benzene 1,3,5-tricarboxamide (BTA) aromatic carboxylic acid hydrogels.

We present the characterisation of a hydrogel forming family of benzene 1,3,5-tricarboxamide (BTA) aromatic carboxylic acid derivatives. The simple, easy to synthesise compounds presented here exhibit consistent gel formation at low concentrations through the use of a pH trigger.