ppxscal/embedding_network huggingface dataset:
Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves
Authors: A. Pikaz, I. Disntein
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This correspondence presents an algorithm for smoothed polygonal approximation of noisy digital planar curves, and feature point detection. The resulting smoothed polygonal representation preserves the signs of the curvature function of the curve. The algorithm is based on a simple decomposition of noisy digital curves into a minimal number of convex and concave sections. The location of each separation point is optimized, yielding the minimal possible distance between the smoothed approximation and the original curve. Curve points within a convex (concave) section are discarded if their angle signs do not agree with the section sign, and if the resulted deviations from the curve are less than a threshold /spl epsi/, which is derived automatically. Inflection points are curve points between pairs of convex-concave sections, and cusps are curve points between pairs of convex-convex or concave-concave sections. Corners and points of local minimal curvature are detected by applying the algorithm to respective total curvature graphs. The detection of the feature points is based on properties of pairs of sections that are determined in an adaptive manner, rather than on properties of single points that are based on a fixed-size neighborhood. The detection is therefore reliable and robust. Complexity analysis and experimental results are presented.
A Fast Analog Front-End Processor for Digital Imaging Systems
Authors: Ion E. Opris, Seiichiro Watanabe
Venue: IEEE Micro (2001)

With higher sensor resolutions available, the speed and dynamic range requirements for image processors in digital imaging systems are more demanding. A 12-bit, 50 mpixels/s digital image acquisition system balances power and performance. The analog processor's total power dissipation is only 150 mw at full speed-an enviable quality for the portable market. Although the underlying technique requires special analog circuitry to handle fast gain changes, it achieves a far wider dynamic range.
Dynamics of Organizations: Computational Modeling and Organization Theories
Authors: Alessandro Lomi, Erik R. Larsen
Venue:  (2001)

:An organization is more than the sum of its parts, and the individual components that function as a complex social system can be understood only by analyzing their collective behavior. This book shows how state-of-the-art simulation methods, including genetic algorithms, neural networks, and cellular automata, can be brought to bear on central problems of organizational theory related to the emergence, permanence, and dissolution of hierarchical macrostructures. The emphasis is on the application of a new generation of equation- and agent-based computational models that can help students of organizations to reformulate their basic research questions starting from assumptions about how to link -- rather than separate -- different levels of organizational analysis.
The Application of the Unified Modeling Language in Object-Oriented Analysis of Healthcare Information Systems
Authors: Vinod Aggarwal
Venue: Journal of Medical Systems (2002)

This paper concerns itself with the beneficial effects of the Unified Modeling Language (UML), a nonproprietary object modeling standard, in specifying, visualizing, constructing, documenting, and communicating the model of a healthcare information system from the user's perspective. The author outlines the process of object-oriented analysis (OOA) using the UML and illustrates this with healthcare examples to demonstrate the practicality of application of the UML by healthcare personnel to real-world information system problems. The UML will accelerate advanced uses of object-orientation such as reuse technology, resulting in significantly higher software productivity. The UML is also applicable in the context of a component paradigm that promises to enhance the capabilities of healthcare information systems and simplify their management and maintenance.
Linear Problems of Optimal Control of Multiple-Valued Trajectories
Authors: A. V. Plotnikov
Venue: Cybernetics and Systems Analysis (2002)

This paper deals with rapidity and rendezvous problems and with problems with multi-valued and vector quality criteria for objects whose behavior is described by linear differential inclusions that contain controls.
Frequency Domain Testing of ADCs
Authors: Joseph A. Mielke
Venue: IEEE Design Test (1996)

This article is a tutorial covering the introduction of frequency domain analysis for the testing of mixed-signal devices. The article covers dynamic testing of analog-to-digital converters using Fourier analysis. It is aimed at digital design and test engineers making the transition from devices with digital only content to devices with both digital and analog or mixed-signal content. The article introduces the test methodologies for Fourier analysis including coherent sampling techniques. It also covers the challenges of implementing these techniques in a real system including analyzing the results to identify test implementation problems.
Human Intelligence and AI: How Close are We to Bridging the Gap?
Authors: R. Narasimhan
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

A few issues that the author considers of central importance are identified, and their implications for the central question of how relevant current AI studies are to understanding the architecture of human intelligence are analyzed. A plausible strategy for inferring the architecture of human intelligence is outlined and used as a framework for discussing the issues raised by the author. It is concluded that we are far from bridging the gap between human intelligence and AI, because we have not been asking the right questions or tackling the real issues.
Delay-dependent exponential stability analysis of delayed neural networks: an LMI approach
Authors: Xiaofeng Liao, Guanrong Chen, Edgar N. Sanchez
Venue: Neural Networks (2002)

For neural networks with constant or time-varying delays, the problems of determining the exponential stability and estimating the exponential convergence rate are studied in this paper. An approach combining the Lyapunov-Krasovskii functionals with the linear matrix inequality is taken to investigate the problems, which provide bounds on the interconnection matrix and the activation functions, so as to guarantee the systems' exponential stability. Some criteria for the exponentially stability, which give information on the delay-dependence property, are derived. The results obtained in this paper provide one more set of easily verified guidelines for determining the exponentially stability of delayed neural networks, which are less conservative and less restrictive than the ones reported so far in the literature.
In situ high-temperature synchrotron-radiation diffraction studies of Ni and Co-Ni silicidation processes
Authors: J. Rinderknecht, H. Prinz, T. Kammler, F. Berberich, E. Zschech
Venue: Microelectronic Engineering (2002)

Silicidation processes in nanoscale Ni and CoNi (5at.% Ni) layers on different silicon substrates were investigated using X-ray diffraction. The phase formation sequences as well as the formation and transition temperatures between 200 and 750 °C were studied. The impact of different silicon substrates, i.e., polycrystalline Si and (100) oriented Si single-crystal substrates as well as the impact of different species of dopants (As, P) were analysed. The thermal range of the desired low resistance target phases NiSi and Co0.95Ni0.05Si2 was determined. The temperatures for phase formation and phase transitions are significantly lowered on polycrystalline Silicon substrates.
The Bailey criterion: statistical derivation and applications to interpretations of durability tests and chemical kinetics
Authors: Alan D. Freed, Arkady I. Leonov
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

The Bailey durability criterion, well known in mechanics of materials, has also been used in other fields of study such as the kinetics of chemical reactions. This paper rationalizes the wide applicability of this criterion in terms of Markovian statistical properties of systems. Two particular cases are discussed as examples of the general approach: durability of a wide class of solid materials and cure (cross-linking) reactions employed for fabrications of thermosets and rubbers.
Design and Test of a Certifiable ASIC for a Safety-Critical Gas Burner Control System
Authors: F. M. Gonçalves, M. B. Santos, I. C. Teixeira, J. P. Teixeira
Venue: Journal of Electronic Testing: Theory and Applications (2002)

The purpose of this paper is to present a methodology and tools for the design and test of an EN298 compliant ASIC chip for a safety-critical gas burner control system. Safe operation, as far as the critical variable is concerned, is guaranteed in the presence of two simultaneous faults. Emphasis is put on circumventing methodology, EDA (Electronic Design Automation) and foundry limitations and on product certification requirements.
Adoption of Low Earth Orbit Satellite Systems: A Diffusion Model under Competition
Authors: Kemal Altınkemer, Wei Thoo Yue, Liang Yu
Venue: Information Technology and Management (2003)

Low Earth Orbit Satellite (LEOS) systems have started providing communication with one phone number throughout the world. In this paper, the diffusion process of the two LEOS systems is analyzed under competition. We simulate the diffusion process under different scenarios. In these scenarios, we analyze issues related to the timing of product introduction, technology advantage and potential customer base. A model of the potential customer base with network externality is presented. We found that the timing of product introduction can have significant impact on the follower in the market. We found that a follower firm with more advanced technology would have higher probability to succeed in competing against the first mover. In addition, the increase in the potential customer base favors the firm with advanced technology. The network externality effect in the growth of the customer base favors both firms but could be an barrier for the follower to create a critical mass and beat the incumbent firm.
Linear spaces with projective lines
Authors: Alexander Kreuzer
Venue: Discrete Mathematics (2002)

A line L of a linear space (P, L) is a projective line, if L intersects every line G of the plane L∩{x} for every x ∈ P\L. In this paper a linear space (P, L) with projective lines is considered. We assume that for any two planes E1, E2 which intersect in a line G, there are two projective lines Li,Ki ⊆ Ei with distinct intersection points p = L1 ∩ L2, q = K1 ∩ K2 ∈ G. Furthermore, it is assumed that for two intersecting lines H1,H2 of a plane F and a point x ∈ F there exists a line G through x with φ ≠ G ∩ H1 ≠ G ∩ H2 ≠ φ. Then the Bundle Theorem holds and (P, L) is locally projective. Therefore (P,L) is embeddable in a projective space (cf. Theorem 4.1).
Using NUMA Interconnects for Highly Available Filers
Authors: Steven R. Kleiman, Scott Schoenthal, Alan Rowe, Steven H. Rodrigues, Arputham Benjamin
Venue: IEEE Micro (1999)

This article describes aspects of the implementation of a project called "Clustered Failover." A Clustered Failover configuration connects two independent file server appliances via a NUMA network to provide file service that can survive hardware faults with minimal disruption to clients. The paper focuses on how the combination of the properties of WAFL (Network Appliance's proprietary log structured file system) and NUMA interconnects minimizes overhead and makes for a relatively straightforward implementation.
Decomposing Simulation Results with Respect to Exogenous Shocks
Authors: W. Jill Harrison, J. Mark Horridge, K. R. Pearson
Venue: Computational Economics (2000)

When a general equilibrium model is solved, there are often a large number of exogenous shocks. The change in each endogenous variable obviously depends on these different shocks. We point out a natural way of decomposing the changes (or percentage changes) in the endogenous variables as sums of the contributions made by the change in each exogenous variable. The change in any endogenous variable is exactly equal to the sum of the contributions to this change attributed to each of the exogenous variables. The contribution of a group of exogenous variables to the change (or percentage change) in any endogenous variable is defined to be the sum of the contributions of the individual exogenous variables in the group. If all the exogenous variables are partitioned into several groups that are mutually exclusive and exhaustive, the change (or percentage change) in any endogenous variable is just the sum of the contributions made by these groups. We introduce, and motivate, these decompositions in the context of a published GTAP application in which 10 regions remove import tariffs and non-tariff barriers to imports. We use the methods given in this paper to report numerical values for the contributions to the welfare gains of various regions due to tariff reductions by particular regions or groups of regions in this simulation. We show how the values obtained via the decomposition are related to the estimates in the published study of the contributions to welfare gain due to certain groups of tariff reductions. We describe a practical procedure for calculating the contributions of individual exogenous variables or groups of exogenous variables to the changes (or the percentage changes) in all of the endogenous variables. This procedure, which applies to a wide range of general equilibrium models, is now automated in GEMPACK in a version that will be made publicly available in the future. The contributions that make up the decomposition are defined as integrals. As such, they depend on the path by which the exogenous values move from their pre-simulation to post-simulation values. We propose one natural path, namely a straight line between these two points. Along this path, the ordinary rate of change is constant for each variable.
Test Generation for Crosstalk-Induced Faults: Framework and Computational Results
Authors: Wei-Yu Chen, Sandeep K. Gupta, Melvin A. Breuer
Venue: Journal of Electronic Testing: Theory and Applications (2002)

Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This paper addresses the problem of efficiently and accurately generating two-vector tests for crosstalk induced effects, such as pulses, signal speedup and slowdown, in digital combinational circuits. These noise effects can propagate through a circuit and create a logic error in a latch or at a primary output. We have developed a mixed-signal test generator, called XGEN, that incorporates classical static values as well as dynamic signals such as transitions and pulses, and timing information such as signal arrival times, rise/fall times, and gate delay. In this paper we first discuss the general framework of the test generation algorithm followed by computational results. Comparison of results with SPICE simulations confirms the accuracy of this approach.
A Parallel Sort Merge Join Algorithm for Managing Data Skew
Authors: J. L. Wolf, D. M. Dias, P. S. Yu
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A parallel sort-merge-join algorithm which uses a divide-and-conquer approach to address the data skew problem is proposed. The proposed algorithm adds an extra, low-cost scheduling phase to the usual sort, transfer, and join phases. During the schedulingphase, a parallelizable optimization algorithm, using the output of the sort phase,attempts to balance the load across the multiple processors in the subsequent joinphase. The algorithm naturally identifies the largest skew elements, and assigns each ofthem to an optimal number of processors. Assuming a Zipf-like distribution of data skew,the algorithm is demonstrated to achieve very good load balancing for the join phase, andis shown to be very robust relative, among other things, to the degree of data skew andthe total number of processors.
A fixed time performance evaluation of parallel CFD applications
Authors: A. M. Baker, S. X. Ying
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The inviscid gas dynamics equations have been solved on the nCUBE 2s computer to better understand the challenges and opportunities that parallel processing presents. Two basic computational fluid dynamics application problems representing different flow physics are used as test cases: supersonic internal flow and subsonic flow over an airfoil. Analysis of the parallel performance for these applications is presented following a fixed time measurement approach. Results from this study demonstrate that even though these flow simulation problems are communication intensive, they are scalable. Parallel computing is shown to be an effective tool for future CFD challenges.
Cool-Mem: combining statically speculative memory accessing with selective address translation for energy efficiency
Authors: Raksit Ashok, Saurabh Chheda, Csaba Andras Moritz
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

This paper presents Cool-Mem, a family of memory system architectures that integrate conventional memory system mechanisms, energy-aware address translation, and compiler-enabled cache disambiguation techniques, to reduce energy consumption in general purpose architectures. It combines statically speculative cache access modes, a dynamic CAM based Tag-Cache used as backup for statically mispredicted accesses, various conventional multi-level associative cache organizations, embedded protection checking along all cache access mechanisms, as well as architectural organizations to reduce the power consumed by address translation in virtual memory. Because it is based on speculative static information, the approach removes the burden of provable correctness in compiler analysis passes that extract static information. This makes Cool-Mem applicable for large and complex applications, without having any limitations due to complexity issues in the compiler passes or the presence of precompiled static libraries. Based on extensive evaluation, for both SPEC2000 and Mediabench applications, 12% to 20% total energy savings are obtained in the processor, with performance ranging from 1.2% degradation to 8% improvement, for the applications studied.
Recognition of Handwritten Cursive Arabic Characters
Authors: I. S. I. Abuhaiba, S. A. Mahmoud, R. J. Green
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

An automatic off-line character recognition system for handwritten cursive Arabic characters is presented. A robust noise-independent algorithm is developed that yields skeletons that reflect the structural relationships of the character components. The character skeleton is converted to a tree structure suitable for recognition. A set of fuzzy constrained character graph models (FCCGM's), which tolerate large variability in writing, is designed. These models are graphs, with fuzzily labeled arcs used as prototypes for the characters. A set of rules is applied in sequence to match a character tree to an FCCGM. Arabic handwritings of four writers were used in the learning and testing stages. The system proved to be powerful in tolerance to variable writing, speed, and recognition rate.
Undersampling and oversampling in sample based shape modeling
Authors: Tamal K. Dey, Joachim Giesen, Samrat Goswami, James Hudson, Rephael Wenger, Wulue Zhao
Venue: Proceedings of the conference on Visualization '01 (2001)

Shape modeling is an integral part of many visualization problems. Recent advances in scanning technology and a number of surface reconstruction algorithms have opened up a new paradigm for modeling shapes from samples. Many of the problems currently faced in this modeling paradigm can be traced back to two anomalies in sampling, namely undersampling and oversampling. Boundaries, non-smoothness and small features create undersampling problems, whereas oversampling leads to too many triangles. We use Voronoi cell geometry as a unified guide to detect undersampling and oversampling. We apply these detections in surface reconstruction and model simplification. Guarantees of the algorithms can be proved. In this paper we show the success of the algorithms empirically on a number of interesting data sets.
Color Processing in Digital Cameras
Authors: Jim Adams, Ken Parulski, Kevin Spaulding
Venue: IEEE Micro (1998)

Digital cameras are fun to use because they produce a finished image seconds after the shutter button is pressed. But in those few seconds much has been done to creat that full-color rendering. Even more was done during the camera design process long before the camera ever reaches the user's hands. This article presents the details of color processing that is performed on the raw data from the camera's sensor. Color filter array interpolation, color calibration, antialiasing, infrared rejection and white point correction are discussed. Also, it is explained how to design certain critical camera elements, such as the color filter array and what are the pitfalls to avoid. Finally, the entire color processing chain is put in perspective by examining how these components are assembled in a commercially available digital camera.
Information Visualization for Collaborative Computing
Authors: Hsinchun Chen, Jay Nunamaker Jr., Richard Orwig, Olga Titkova
Venue: Computer (1998)

Information technology continues to generate increasing amounts of data, most of which is useless without scalable methods to collect, analyze, process, and understand it. Visualization is a promising approach to such systemization because it lets users see underlying processes and guide process simulations interactively. However, visualization must be combined with some way to make repositories of text documents more manageable, providing users with a flexible, interactive environment in which to access them. This article describes a prototype tool that addresses these problems for GroupSystems, an electronic meeting system developed at the University of Arizona and installed at more than 1,500 business, government, and university settings. The tool automatically categorizes information, statistically clusters similar documents, and displays the organized document set graphically, providing more at-a-glance information than a typical text-based display. Users can thus more easily browse document collections. The tool uses text analysis techniques that aim to identify descriptors and develop an unambiguous internal representation of a document.
A note on practical construction of maximum bandwidth paths
Authors: Navneet Malpani, Jianer Chen
Venue: Information Processing Letters (2002)

Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it has been proposed that a maximum bandwidth path be constructed by a modified Dijkstra's algorithm or by a modified Bellman-Ford algorithm. In this short note. we show that maximum bandwidth paths can be constructed by a modified Kruskal's algorithm. We demonstrate that this approach is simpler, easier in implementation, more flexible, and faster than the previously proposed algorithms.
Self-Complementary Balanced Codes and Quasi-Symmetric Designs
Authors: Fang-Wei Fu, Victor K. -W. Wei
Venue: Designs, Codes and Cryptography (2002)

An upper bound for self-complementary balanced codes is presented in this paper. We give a characterization for self-complementary balanced codes meeting this upper bound. We show that the existence of certain quasi-symmetric designs implies the existence of such optimal self-complementary balanced codes.