ppxscal/embedding_network huggingface dataset:
Online Handwritten Circuit Recognition on a Tablet PC
Authors: O'tega Ejofodomi, Shani Ross, Ahmed Jendoubi, Mohamed Chouikha, Jianchao Zeng
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Tablet PC-based engineering software can be used as an effective teaching tool for core engineering courses such as electronics, signal and systems, and digital systems. Wireless connection between Tablet PCs of students and the teaching professor will substantially improve students' involvement during the course. Circuit drawing is an important task especially in undergraduate courses such as electronics and digital systems. Most existing software tools for circuit drawing use a toolbox where symbols for all circuit components are prepared and ready for pick up. A user has to go through a number of layers of menus each time he/she wants to use a circuit symbols. To improve human computer interaction, we have developed an online recognition system on a Tablet PC using C# for the handwritten circuit and its components. The system can recognize and redraw many circuits and their components such as resistors, capacitors, ground and various voltage power supplies, which are drawn with a stylus pen on a Tablet PC. We present details of our approach and preliminary results of an experimental system.
Using the Inner-Distance for Classification of Articulated Shapes
Authors: Haibin Ling, David W. Jacobs
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance isdefined as the length of the shortest path between landmark points within the shape silhouette. We show that the inner-distance is articulation insensitive and more effective at capturing complex shapes with part structures than Euclidean distance. To demonstrate this idea, it is used to build a new shape descriptor based on shape contexts. After that, we design a dynamic programming based method for shape matching and comparison. We have tested our approach on a variety of shape databases including an articulated shape dataset, MPEG7 CE-Shape-1, Kimia silhouettes, a Swedish leaf database and a human motion silhouette dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.
Extracting the workflow critical path from the extended well-formed workflow schema
Authors: Jin Hyun Son, Jung Sun Kim, Myoung Ho Kim
Venue: Journal of Computer and System Sciences (2005)

The critical path in a workflow schema is defined as the longest execution path from the start activity to the end activity. It can be utilized in many workflow issues such as workflow resource and time management. However, little work has been done on the critical path in a workflow because workflow control flows are much more complex than those represented with ordinary graphs and networks. In this paper, we first describe our workflow model with a set of workflow control constructs that provide sufficient power to express the models of most of today's business processes. Then, we propose a systematic method of identifying the critical path for a given workflow schema. Our proposed method is based on queuing theory because operational characteristics of the workflow schema can be modeled by a M/M/1 queuing network.
A Survey of Peer-to-Peer Storage Techniques for Distributed File Systems
Authors: Ragib Hasan, Zahid Anwar, William Yurcik, Larry Brumbaugh, Roy Campbell
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The popularity of distributed file systems continues to grow. Reasons they are preferred over traditional centralized file systems include fault tolerance, availability, scalability and performance. In addition, Peer-to-Peer (P2P) system concepts and scalable functions are being incorporated into the domain of file systems. This survey paper explores the design paradigms and important issues that relate to such systems and discusses the various research activities in the field of Distributed Peer- to-Peer file systems.
Efficient processing of client transactions in real-time
Authors: Vinay Kanitkar, Alex Delis
Venue: Distributed and Parallel Databases (2005)

In traditional client-server databases, a transaction and its requisite data have to be colocated at a single site for the operation to proceed. This has usually been achieved by moving either the data or the transaction. However, the availability of high-bandwidth networking options has led users of today's systems to expect real-time guarantees about the completion time of their tasks. In order to offer such guarantees in a client-server database system, a transaction should be processed by any means that allows it to meet its deadline. To this end, we explore the option of moving both transactions and data to the most promising sites for successful completion. We propose a load-sharing framework that oversees the shipment of data and transactions so as to increase the efficiency of a cluster consisting of a server and a number of clients. Here, efficiency is defined as the percentage of transactions successfully completed within their deadlines by the cluster. The suitability of a client for processing a transaction is measured with respect to the availability of the transaction's required data in its local cache. In addition to the load-sharing algorithm, we use the concept of grouped locks, along with transaction deadline information, in order to schedule the movement of data objects in the cluster in a more efficient manner. We evaluate the real-time processing performance of the client-server architecture using detailed experimental testbeds. Our evaluation indicates that it is possible, in many situations, to achieve better performance than a centralized system.
Creating Speech-Synchronized Animation
Authors: Scott A. King, Richard E. Parent
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

We present a facial model designed primarily to support animated speech. Our facial model takes facial geometry as input and transforms it into a parametric deformable model. The facial model uses a muscle-based parameterization, allowing for easier integration between speech synchrony and facial expressions. Our facial model has a highly deformable lip model that is grafted onto the input facial geometry to provide the necessary geometric complexity needed for creating lip shapes and high-quality renderings. Our facial model also includes a highly deformable tongue model that can represent the shapes the tongue undergoes during speech. We add teeth, gums, and upper palate geometry to complete the inner mouth. To decrease the processing time, we hierarchically deform the facial surface. We also present a method to animate the facial model over time to create animated speech using a model of coarticulation that blends visemes together using dominance functions. We treat visemes as a dynamic shaping of the vocal tract by describing visemes as curves instead of keyframes. We show the utility of the techniques described in this paper by implementing them in a text-to-audiovisual-speech system that creates animation of speech from unrestricted text. The facial and coarticulation models must first be interactively initialized. The system then automatically creates accurate real-time animated speech from the input text. It is capable of cheaply producing tremendous amounts of animated speech with very low resource requirements.
Neighbor-finding based on space-filling curves
Authors: Hue-Ling Chen, Ye-In Chang
Venue: Information Systems (2005)

Nearest-neighbor-finding is one of the most important spatial operations in the field of spatial data structures concerned with proximity. Because the goal of the space-filling curves is to preserve the spatial proximity, the nearest neighbor queries can be handled by these space-filling curves. When data are ordered by the Peano curve, we can directly compute the sequence numbers of the neighboring blocks next to the query block in eight directions in the 2D- space based on its bit shuffling property. But when data are ordered by the RBG curve or the Hilbert curve, neighbor-finding is complex. However, we observe that there is some relationship between the RBG curve and the Peano curve, as with the Hilbert curve. Therefore, in this paper, we first show the strategy based on the Peano curve for the nearest-neighbor query. Next, we present the rules for transformation between the Peano curve and the other two curves, including the RBG curve and the Hilbert curve, such that we can also efficiently find the nearest neighbor by the strategies based on these two curves. From our simulation, we show that the strategy based on the Hilbert curve requires the least total time (the CPU-time and the I/O time) to process the nearest-neighbor query among our three strategies, since it can provide the good clustering property.
Design and implementation of an extended relationship semantics in an ODMG-compliant OODBMS
Authors: Hyun-Joo Lee, Sang-Won Lee, Hyoung-Joo Kim
Venue: Journal of Systems and Software (2005)

Relationships, in addition to entities, are important in real-world database modeling. In particular, many object oriented database applications including CAD/CAM, CASE and multi-media need to model various and complex relationships, especially the 'part-whole' relationship. Without the built-in relationship supports from DBMSs, there is a huge overhead in managing relationships from application development to maintenance, since the relationships should be hard-coded within the application program itself.In this paper, we propose a powerful 'part-whole' relationship model, which naturally extends the ODMG-3.0 object database standard. The proposed relationship model can support almost all of the relationship functionalities existing in the contemporary relational database model and the object oriented data model. In order to design and implement this relationship model, we seamlessly extend the ODMG-3.0 relationship using the inheritance concept. Also, we identify several possible run-time anomalies in implementing the relationship and provide solutions for their problems.
Displacement Structure Approach to Discrete-Trigonometric-Transform Based Preconditioners of G.Strang Type and of T.Chan Type
Authors: Thomas Kailath, Vadim Olshevsky
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

In this paper we use a displacement structure approach to design a class of new preconditioners for the conjugate gradient method applied to the solution of large Toeplitz linear equations. Explicit formulas are suggested for the G.Strang-type and for the T.Chan-type preconditioners belonging to any of eight classes of matrices diagonalized by the corresponding discrete cosine or sine transforms. Under the standard Wiener class assumption the clustering property is established for all of these preconditioners, guaranteeing rapid convergence of the preconditioned conjugate gradient method. All the computations related to the new preconditioners can be done in real arithmetic, and to fully exploit this advantageous property one has to suggest a fast real-arithmetic algorithm for multiplication of a Toeplitz matrix by a vector. It turns out that the obtained formulas for the Strang-type preconditioners allow a number of representations for Toeplitz matrices leading to a wide variety of real-arithmetic multiplication algorithms based on any of eight discrete cosine or sine transforms.Recently, transformations of Toeplitz matrices to Vandermonde-like or Cauchy-like matrices have been found to be useful in developing accurate direct methods for Toeplitz linear equations. In this paper we suggest further extending the range of the transformation approach by exploring it for iterative methods; this technique allowed us to reduce the complexity of each iteration of the preconditioned conjugate gradient method. The results of this paper were announced in [T. Kailath and V. Olshevsky, Calcolo, 33 (1996), pp. 191--208].
Efficient Access Control for Distributed Hierarchical File Systems
Authors: Kristal T. Pollack, Scott A. Brandt
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

To determine whether a user can access a file in a hierarchical file system a traversal of the directory hierarchy is required in order to check access control for all the parent directories. This traversal can be especially expensive in a distributed system where the files may be on separate devices. We present two approaches for representing the complete access control for a file and its parent directories such that it can be stored locally with each file in order to avoid traversal. We use the well-known CNF and DNF (Conjunctive and Disjunctive Normal Form) formats to store permission and ownership information compactly for the entire path to a file. An examination of the structure of an existing large shared file system demonstrates the efficacy of our solution.
How to simulate anisotropic diffusion processes on curved surfaces
Authors: Michael Christensen
Venue: Journal of Computational Physics (2004)

A general method for simulating diffusive processes in inhomogeneous, anisotropic media or in spaces with non-trivial geometry, such as on irregular metallic surfaces or cellular membranes, is derived through the diffusion approximation leading from the Master equation to the Fokker-Planck equation. The method is of the Monte Carlo type, and it can be applied to multi-particle systems and even coupled to internal dynamics, for example the quantum mechanical development of spin states. The correctness of the algorithm is proved and optimization issues discussed. As an illustration, recombination processes on a curved surface is treated.
A cross-layer optimization of gnutella for mobile ad hoc networks
Authors: Marco Conti, Enrico Gregori, Giovanni Turi
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

In recent years, the Internet has witnessed the introduction of many peer-to-peer systems designed to realize large-scale data sharing. These platforms exhibit interesting features like self-configuration, self-healing and complete decentralization, which make them appealing for employment in ad hoc environments as well. However, the impact of ad hoc dynamics on the performance of these protocols, and the different set of constraints which this emerging networking paradigm imposes, haven't been yet carefully evaluated. This paper investigates the performance of Gnutella, one of the most widely used peer-to-peer systems, when put through typical ad hoc conditions like node mobility, frequent network partitioning, etc.. We show that a straightforward implementation of the protocol is not satisfactory under the point of view of the produced overhead and the average overlay connectivity. Finally, we propose a cross-layer optimization of Gnutella, which enhances its performance up to the expectations and makes it more suitable to the degree of self-organization and self-healing required in ad hoc environments.
Incremental Model-Based Estimation Using Geometric Constraints
Authors: Cristian Sminchisescu, Dimitris Metaxas, Sven Dickinson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

We present a model-based framework for incremental, adaptive object shape estimation and tracking in monocular image sequences. Parametric structure and motion estimation methods usually assume a fixed class of shape representation (splines, deformable superquadrics, etc.) that is initialized prior to tracking. Since the model shape coverage is fixed a priori, the incremental recovery of structure is decoupled from tracking, thereby limiting both processes in their scope and robustness. In this work, we describe a model-based framework that supports the automatic detection and integration of low-level geometric primitives (lines) incrementally. Such primitives are not explicitly captured in the initial model, but are moving consistently with its image motion. The consistency tests used to identify new structure are based on trinocular constraints between geometric primitives. The method allows not only an increase in the model scope, but also improves tracking accuracy by including the newly recovered features in its state estimation. The formulation is a step toward automatic model building, since it allows both weaker assumptions on the availability of a prior shape representation and on the number of features that would otherwise be necessary for entirely bottom-up reconstruction. We demonstrate the proposed approach on two separate image-based tracking domains, each involving complex 3D object structure and motion.
On Minimax Fractional Optimality and Duality with Generalized Convexity
Authors: Xin-Min Yang, Shui-Hung Hou
Venue: Journal of Global Optimization (2005)

In this paper, we establish several sufficient optimality conditions for a class of generalized minimax fractional programming. Based on the sufficient conditions, a new dual model is constructed and duality results are derived. Our study naturally unifies and extends some previously known results in the framework of generalized convexity and dual models.
Predictive control of random-parameter systems with multiplicative noise. Application to investment portfolio optimization
Authors: V. V. Dombrovskii, D. V. Dombrovskii, E. A. Lyashenko
Venue: Automation and Remote Control (2005)

For the discrete systems with random parameters perturbed by additive and multiplicative noise depending on the states and controls, design of the predictive model-based control strategies was considered. Predictive control strategies of closed-loop and open-loop types were developed. The results obtained were applied to dynamic optimization of the investment portfolio under constrained volumes of trade operations.
Research Issues at the Boundary of Competitive Dynamics and Market Evolution
Authors: David Soberman, Hubert Gatignon
Venue: Marketing Science (2005)

Building on the observation that competitive dynamics and market evolution are inextricably linked and underresearched, we propose a road map to guide and stimulate future research in the area. A number of rationales have been proposed to explain why there is relatively little research directed toward understanding the links between competitive dynamics and market evolution; these include the predominance of different research paradigms in each area, a lack of data appropriate for analyzing the two areas together, and the difficulty of obtaining robust and significant results with analysis that is by definition complex (it must consider factors and outcomes both across firms and over time). Using this last rationale as a starting point, we develop a series of research propositions related to key relationships where (a) insignificant or contradictory results have been obtained (in extant research) or (b) researchers have yet to delve. The propositions are designed to deepen our understanding of the relationship between the areas. Throughout the analysis, the key to developing the propositions is to recognize the importance of moderating factors, mediating factors, and covariates. In addition, where the approach to empirically test a proposition is new, we propose categories, measures, and comparisons that can be used.
Cache consistency by design
Authors: Ed Brinksma
Venue: Distributed Computing (1999)

In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek, Brown, and Merritt. The proof will follow a strategy of stepwise refinement, developing the distributed caching memory in five transformation steps from a specification of the serial memory, whilst preserving the sequential consistency in each step. The proof, in fact, presents a rationalized design of the distributed caching memory. We will carry out our proof using a simple process-algebraic formalism for the specification of the various design stages. We will not follow a strictly algebraic exposition, however. At some points the correctness will be shown using direct semantic arguments, and we will also employ higher-order constructs like action transducers to relate behaviours. The distribution of the design/proof over five transformation steps provides a good insight into the variations that could have been allowed at each point of the design while still maintaining sequential consistency. The design/proof in fact establishes the correctness of a whole family of related memory architectures. The factorization in smaller steps also allows for a closer analysis of the fairness assumptions about the distributed memory.
Immune model-based fault diagnosis
Authors: Guan-Chun Luh, Wei-Chong Cheng
Venue: Mathematics and Computers in Simulation (2005)

In this paper, a novel approach to immune model-based fault diagnosis methodology for nonlinear systems is presented. The diagnosis scheme consists of forward/inverse immune model identification, filtered residual generation, the fault alarm concentration (FAC), and the artificial immune regulation (AIR). A two-link manipulator simulation was employed to validate the effectiveness and robustness of the diagnosis approach. The simulation results show that it can detect and isolate actuator faults, sensor faults, and system component faults efficiently.
Get the Image You Want: Essential Photoshop Editing Techniques
Venue:  (2005)

Creating great photographic images doesn't stop with perfecting your shooting techniques. Once you have your photo in digital form, you can take it to the next level with image editing tools like Photoshop. While other Photoshop books go from feature to feature, explaining every little detail of this expansive program, this book is separated into eight chapters that deal with the main aspects of working with images in Photoshsop. This way, you can keep the book next to your workspace and reach for it whenever you need the perfect solution to an image-editing problem. Readers will start with learning basic image editing concepts, such as importing files, correcting color and tone, cropping images, and using masks and filters. Also included is a problem/solution section at the end of each chapter, containing specific techniques and streamlined fixes that you can apply to the most common image-editing challenges. Along the way, this full-color, gorgeously illustrated book offers practical help and hundreds of creative ideas. Targeted at the serious beginner, this four-color reference book teaches core Photoshop and digital imaging concepts at an affordable price and an accessible page count.
Navigating public microarray databases: Reviews - This article contains supplementary material available via the Internet from the Journal
Authors: Christopher J. Penkett, Jürg Bähler
Venue: Comparative and Functional Genomics (2004)

With the ever-escalating amount of data being produced by genome-wide microarray studies, it is of increasing importance that these data are captured in public databases so that researchers can use this information to complement and enhance their own studies. Many groups have set up databases of expression data, ranging from large repositories, which are designed to comprehensively capture all published data, through to more specialized databases. The public repositories, such as ArrayExpress at the European Bioinformatics Institute contain complete datasets in raw format in addition to processed data, whilst the specialist databases tend to provide downstream analysis of normalized data from more focused studies and data sources. Here we provide a guide to the use of these public microarray resources. Copyright &copy; 2004 John Wiley & Sons, Ltd.