Architectures for Silicon Nanoelectronics and Beyond

Although nanoelectronics won't replace CMOS for some time, research is needed now to develop the architectures, methods, and tools to maximally leverage nanoscale devices and terascale capacity. Addressing the complementary architectural and system issues involved requires greater collaboration at all levels. The effective use of nanotechnology calls for total system solutions     

As‐Killing‐As‐Possible Vector Fields for Planar Deformation

Cartoon animation, image warping, and several other tasks in two‐dimensional computer graphics reduce to the formulation of a reasonable model for planar deformation. A deformation is a map from a given shape to a new one, and its quality is determined by the type of distortion it introduces. In many applications, a desirable map is as isometric as possible. Finding such deformations, however, is a nonlinear problem, and most of the existing solutions approach it by minimizing a nonlinear energy. Such methods are not guaranteed to converge to a global optimum and often suffer from robustness issues. We propose a new approach based on approximate Killing vector fields (AKVFs), first introduced in shape processing. AKVFs generate near‐isometric deformations, which can be motivated as direction fields minimizing an “as‐rigid‐as‐possible” (ARAP) energy to first order. We first solve for an AKVF on the domain given user constraints via a linear optimization problem and then use this AKVF as the initial velocity field of the deformation. In this way, we transfer the inherent nonlinearity of the deformation problem to finding trajectories for each point of the domain having the given initial velocities. We show that a specific class of trajectories — the set of logarithmic spirals — is especially suited for this task both in practice and through its relationship to linear holomorphic vector fields. We demonstrate the effectiveness of our method for planar deformation by comparing it with existing state‐of‐the‐art deformation methods.     

Comparisons of Urban Travel Forecasts Prepared with the Sequential Procedure and a Combined Model

Detailed analyses and comparisons of urban travel forecasts prepared by applying the state-of-practice sequential procedure and the solution of a combined network equilibrium model are presented. The sequential procedure for solving the trip distribution, mode choice and assignment problems with feedback is the current practice in most transportation planning agencies, although its important limitations are well known. The solution of a combined model, in contrast, results from a single mathematical formulation, which ensures a well-converged and consistent result. Using a real network, several methods for solving the sequential procedure with feedback are compared to the solution of the combined model ESTRAUS. The results of these methods are shown to have various levels of instability. The paper concludes with a call for a new paradigm of travel forecasting practice based on an internally consistent model formulation that can be solved to a level of precision suitable for comparing alternative scenarios.     

On tasks synchronization with the MMS protocol

The MMS protocol is a powerful tool for communication as well as for synchronization between manufacturing equipment such as robots, programmable logic controllers, etc. This paper shows how the MMS services can be used to handle tasks synchronization in a distributed environment. The MMS weaknesses regarding temporal aspects and possible directions to alleviate these weaknesses are also presented.     

Finding approximate matches in large lexicons

Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching.