ppxscal/embedding_network huggingface dataset:
A New Steepest Edge Approximation for the Simplex Methodfor Linear Programming
Authors: Artur świętanowski
Venue: Computational Optimization and Applications (1998)

The purpose of this paper is to present a new steepest edge (SE) approximation scheme for the simplex method. The major advantages are its simplicity of recurrences and implementation, low computational overhead (compared to both the exact SE method and the DEVEX approximation scheme), and surprisingly good performance.The paper contains a brief account of the exact SE algorithm, the new recurrences developed in the same framework and some discussion on the possible reasons for the method&lsquo;s apparent success. Finally, numerical experiments are presented to assess the practical value of the method. The results are very promising.
Lexicon-Driven Segmentation and Recognition of Handwritten Character Strings for Japanese Address Reading
Authors: Cheng-Lin Liu, Masashi Koga, Hiromichi Fujisawa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper describes a handwritten character string recognition system for Japanese mail address reading on very large vocabulary. The address phrases are recognized as a whole because there is no extra space between words. The lexicon contains 111,349 address phrases, which are stored in a trie structure. In recognition, the text line image is matched with the lexicon entries (phrases) to obtain reliable segmentation and retrieve valid address phrases. In this paper, we first introduce some effective techniques for text line image preprocessing and presegmentation. In presegmentation, the text line image is separated into primitive segments by connected component analysis and touching pattern splitting based on contour shape analysis. In lexicon matching, consecutive segments are dynamically combined into candidate character patterns. An accurate character classifier is embedded in lexicon matching to select characters matched with a candidate pattern from a dynamic category set. A beam search strategy is used to control the lexicon matching so as to achieve real-time recognition. In experiments on 3,589 live mail images, the proposed method achieved correct rate of 83.68 percent while the error rate is less than 1 percent.
The Emergence of Cellular Computing
Authors: Moshe Sipper
Venue: Computer (1999)

The von Neumann architecture--which is based upon the principle of one complex processor that sequentially performs a single complex task at a given moment--has dominated computing technology for the past 50 years. Recently, however, researchers have begun exploring alternative computational systems based on entirely different principles. Although emerging from disparate domains, the work behind these systems shares a common computational philosophy, which the author calls cellular computing. This philosophy promises to provide new means for doing computation more efficiently--in terms of speed, cost, power dissipation, information storage, and solution quality. Simultaneously, cellular computing offers the potential of addressing much larger problem instances than previously possible, at least for some application domains. Cellular computing has attracted increasing research interest. Work in this field has produced results that hold prospects for a bright future. Yet questions must be answered before cellular computing can become a mainstream paradigm. What classes of computational tasks are most suited to it? How do we match the specific properties and behaviors of a given model to a suitable class of problems?
Numerical simulation of capacitance spectroscopy for multiple vertically stacked quantum dots
Authors: M. Macucci, Karl Hess
Venue: Microelectronic Engineering (2002)

We present a numerical study of charging effects in stacked self-assembled InAs quantum dots embedded in a capacitor structure. Threshold gate voltages for tunneling of electrons from the substrate into the quantum dots are computed, solving self-consistently the 3D Schrödinger and Poisson equations. Specifically, two structures are investigated, one containing two well separated quantum dots and the other containing three quantum dots divided by thin tunneling barriers. Results are compared with experimental data, and perspectives for further work are presented.
Improving Application Performance on the HP/Convex Exemplar
Authors: Thomas Sterling, Phillip Merkey, Daniel Savarese
Venue: Computer (1996)

The Earth and space sciences community faces rich computational challenges ranging from static, regular, and embarrassingly parallel to dynamic, unstructured, and tightly coupled. This problem domain requires highly scalable systems exhibiting broad generality, efficiency, and programmability. These capabilities are appearing in the emerging scalable shared memory cache-coherent architectures like that of the HP/Convex Exemplar SPP-1000. The goal of this class of architecture is to make scientific programming as easy and efficient as it is on vector supercomputers. The authors describe the Exemplar's architecture, whose global system organization comprises up to 16 multiprocessors interconnected by four SCI (Scalable Coherent Interface) ring networks. They then present the findings from four applications: the piecewise parabolic method, a finite-element method for unstructured meshes, a tree code for the n-body problem, and a particle-in-cell code. The authors present application performance data derived after the Exemplar at Goddard Space Flight Center went into production use. These studies expose the operational properties of the Exemplar and determine its suitability for Earth and space sciences applications. The testing reveals that global cache coherence can be used effectively to simplify programming and data migration. However, the basic problem of locality sensitivity still demands direct programmer involvement to achieve effective system behavior. The question of whether message-passing or shared memory programming models are better remains open.
A Polymorphous Computing Fabric
Authors: Christophe Wolinski, Maya Gokhale, Kevin McCabe
Venue: IEEE Micro (2002)

A new computing fabric is well suited to digital signal processing and image processing applications. The authors describe its implementation on a system on a programmable chip.
An Efficient Inductive Learning Method for Object-Oriented Database Using Attribute Entropy
Authors: Yueh-Min Huang, Shian-Hua Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

The data-driven characteristic of Version Space works efficiently in memory even if the training set is enormous. However, the concept hierarchy of each attribute used to generalize/specialize the hypothesis of S/G-set is processed sequentially and instance-by-instance, which degrades its performance. As for ID3, the decision tree is generated from the order of attributes according to their entropies to reduce the number of attributes in some of the tree paths. Unlike Version Space, ID3 generates an extremely complex decision tree when the training set is enormous. Therefore, we propose a method, AGE, taking advantages of Version Space and ID3 to learn rules from object-oriented databases (OODB) with the least number of learning features according to the entropy. By simulations, we found the performance of our learning algorithm is better than both Version Space and ID3. Furthermore, AGE's time complexity and space complexity are both linear to the number of training instances.
DSP Processors Hit the Mainstream
Authors: Jennifer Eyre, Jeff Bier
Venue: Computer (1998)

These days, the once obscure engineering term "DSP" (short for digital signal processing) is working its way into common use. It has begun to crop up on the labels of an ever wider range of products, from home audio components to answering machines. This is not merely a reflection of a new marketing strategy, however; there truly is more digital signal processing inside today's products than ever before. But why is the market for DSP processors booming? The answer is somewhat circular: As microprocessor fabrication processes have become more sophisticated, the cost of a microprocessor capable of performing DSP tasks has dropped significantly to the point where such a processor can be used in consumer products and other cost-sensitive systems. As a result, more and more products have begun using DSP processors, fueling demand for faster, smaller, cheaper, more energy-efficient chips. Although fundamentally related, DSP processors are significantly different from general-purpose processors (GPPs) like the Intel Pentium or PowerPC. The authors explain what DSP processors are and what they do. They also offer a guide to evaluating DSP processors for use in a product or application.
The Group Paradigm for Concurrency Control Protocols
Authors: A. El Abbadi, S. Toueg
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors propose a paradigm for developing, describing, and proving the correctness of concurrency control protocols for replicated databases in the presence of failures or communication restrictions. The approach used is to hierarchically divide the problem of achieving one-copy serializability by introducing the notion of a 'group' that is a higher level of abstraction than transactions. Instead of dealing with the overall problem, the paradigm breaks it into two simpler ones: (1) a local policy for each group that ensures a total order of all transactions in that group; and (2) a global policy that ensures a correct serialization of all groups. The paradigm is used to demonstrate the similarities between several concurrency control protocols by comparing the way they achieve correctness.
Valved Routing: Efficient Flow Control for Adaptive Nonminimal Routing in Interconnection Networks
Authors: Chung-Ta King, Wei-Kuo Liao
Venue: IEEE Transactions on Computers (1995)

Adaptive nonminimal routing (or misrouting) may move messages away from their destinations to temporarily cope with the dynamic load in an interconnection network. In most cases, misrouting is more powerful and flexible than minimal routing, especially under nonuniform load distribution. However, to take advantage of its misrouting, we have to avoid deadlock, livelock, and starvation in the network and to maintain the network performance across all levels of loading. In this paper, we propose a new flow control scheme for misrouting, called valved routing. Valved routing controls message injection and transmission through logical valves associated with the router ports. Designing routers using valved routing requires a proper choice of design parameters. We will discuss how to find the range of feasible design parameters. Issues in implementing routers using valved routing will also be addressed. We have conducted extensive simulations to compare the performance of routers with and without valved routing. Our simulation results show that valved routing has promising performance advantages, at light as well as heavy network load. Compared with the voluntary misrouting [15], valved routing performs better in network throughput without sacrificing the latency.
The Automorphism Groups of BCH Codes and of Some Affine-InvariantCodes Over Extension Fields
Authors: Thierry P. Berger, Pascale Charpin
Venue: Designs, Codes and Cryptography (1999)

Affine-invariant codes are extended cyclic codes of length p^m invariant under the affine-group acting on {\F}_{p^m}. This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes berg, bech1. We derive here new results, especially when the alphabet field is an extension field, by expanding our previous tools. In particular we complete our results on BCH codes, giving the automorphism groups of extended narrow-sense BCH codes defined over any extension field.
Recognizing Characters in Scene Images
Authors: J. Ohya, A. Shio, S. Akamatsu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

An effective algorithm for character recognition in scene images is studied. Scene images are segmented into regions by an image segmentation method based on adaptive thresholding. Character candidate regions are detected by observing gray-level differences between adjacent regions. To ensure extraction of multisegment characters as well as single-segment characters, character pattern candidates are obtained by associating the detected regions according to their positions and gray levels. A character recognition process selects patterns with high similarities by calculating the similarities between character pattern candidates and the standard patterns in a dictionary and then comparing the similarities to the thresholds. A relaxational approach to determine character patterns updates the similarities by evaluating the interactions between categories of patterns, and finally character patterns and their recognition results are obtained. Highly promising experimental results have been obtained using the method on 100 images involving characters of different sizes and formats under uncontrolled lighting.
A Case-Based Approach to Modeling Legal Expertise
Authors: Kevin D. Ashley, Edwina L. Rissland
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

Hypo, a computer program that performs case-based reasoning in the legal domain, helps attorneys analyze and make arguments about new fact situations in terms of the most relevant precedent cases. To perform this task, Hypo must make factual comparisons of cases relative to the problem situation and determine the legal significance of comparisons in terms of arguments about the problem situation. The authors describe techniques that Hypo uses to compare cases, choose the best cases for evaluating, and construct arguments about a new fact situation. They demonstrate how Hypo critically compares a problem situation to the most relevantly similar precedent cases to outline an argument regarding how to decide the current fact situation (CFS) based on its significant similarities to and differences from most on point cases (MOPCS). Hypo's main tool for this task is the claim lattice mechanism. The authors present a detailed example of a claim lattice actually generated by Hypo to analyze a real legal case.
Integration of Fluorine-doped Silicon oxide in copper pilot line for 0.12-&#x00B5;m technology
Authors: J. P. Reynard, C. Verove, E. Sabouret, P. Motte, B. Descouts, C. Chaton, J. Michailos, K. Barla
Venue: Microelectronic Engineering (2002)

The FSG (fluorine-doped silicon glass) was introduced as dielectric for copper interconnects in order to take advantage of its lower dielectric constant. With a gain of 18% in the constant value, it makes the shrink of metal dimension possible for 0.12- µm technology devices with limited cross-talks or delays in the information transmission. In spite of its strong sensitivity to water and moisture absorption, we could integrate this material in the dual damascene structure for copper application for 0.12- µm technology. The use of appropriate capping layer and optimisation of fluorine content made the integration possible with optimal dielectric properties.
Neurocontrol for Lateral Vehicle Guidance
Authors: Stefan Neusser, Jos Nijhuis, Lambert Spaanenburg, Bernd Hoefflinger, Uwe Franke, Hans Fritz
Venue: IEEE Micro (1993)

A solution to autonomous lateral vehicle guidance using a neurocontroller that can learn from measured human-driving data without knowledge of the physical car parameters is discussed. Simulations and practical tests confirm that a small-size feedforward autonomous neural network (21 neurons) can learn to steer a vehicle at high speeds only from looking at human-driving examples. In this way, the network learns the total closed-loop behavior, including the nonlinear dynamics of the vehicle and the driver's individual driving style. The main result of practical investigations is that the neutral controller trained on human-driving examples exhibits an aperiodic behavior that does not vanish at higher speeds (tests performed up to 130 km/h) and produces fewer lateral deviations than the linear state controller.
Energy efficient real-time scheduling
Authors: Amit Sinha, Anantha P. Chandrakasan
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Real-time scheduling on processors that support dynamic voltage and frequency scaling is analyzed. The Slacked Earliest Deadling First (SEDF) algorithm is proposed and it is shown that the algorithm is optimal in minimizing processor energy consumption and maximum lateness. An upper bound on the processor energy savings is also derived. Real-time scheduling of periodic tasks is also analyzed and optimal voltage and frequency allocation for a given task set is determined that guarantees schedulability and minimizes energy consumption.
Unavoidable minors of graphs of large type
Authors: John Dittmann, Bogdan Oporowski
Venue: Discrete Mathematics (2002)

In this paper, we study one measure of complexity of a graph, namely its type. The type of a graph G is defined to be the minimum number n such that there is a sequence of graphs G = G0, G1,..., Gn, where Gi is obtained by contracting one edge in or deleting one edge from each block of Gi-1, and where Gn is edgeless. We show that a 3-connected graph has large type if and only if it has a minor isomorphic to a large fan. Furthermore, we show that if a graph has large type, then it has a minor isomorphic to a large fan or to a large member of one of two specified families of graphs.
A Constant-Time Parallel Sorting Algorithm and Its Optical Implementation
Authors: Ahmed Louri, James A. Hatch Jr., Jongwhoa Na
Venue: IEEE Micro (1995)

Sorting is a fundamental operation that has important implications in a vast number of areas. For instance, sorting is heavily utilized in applications such as database machines, where hashing techniques are used to accelerate data processing algorithms. It is also the basis for interprocessor message routing and has strong implications in video telecommunications. However, high- speed electronic sorting networks are difficult to implement with VLSI technology because of the dense, global connectivity required. Optics eliminates this bottleneck by offering global interconnects, massive parallelism, and noninterfering communications. We present a parallel sorting algorithm and its efficient optical implementation using currently available optical hardware. The algorithm sorts n data elements in few steps, independent of the number of elements to be sorted. Thus, it is a constant-time sorting algorithm (i.e. O(1) time). This is a significant performance improvement over state-of-the-art electronic sorting systems where the fastest sorting algorithm for n elements takes O(log n) but requires O(n2) processors. We provide the detailed description of an optical system for generating the rank of a data set and physically reordering it. This is evidence that problems considered "solved" using conventional approaches need to be reconsidered so that the benefits of optics can be properly utilized to obtain new, faster solutions to old problems.
Filtering Image Records Using Wavelets and the Zakai Equation
Authors: Ziad S. Haddad, Santiago R. Simanca
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Consider the problem of detecting and localizing a faint object moving in an ¿essentially stationary¿ background, using a sequence of two-dimensional low-SNR images of the scene. A natural approach consists of ¿digitizing¿ each snapshot into a discrete set of observations, sufficiently (perhaps not exactly) matched to the object in question, then tracking the object using an appropriate stochastic filter. The tracking would be expected to make up for the low signal-to-noise ratio, thus allowing one to ¿coherently¿ process successive images in order to beat down the noise and localize the object. Thus, ¿tracking¿ here does not refer to the ususal notion of detecting then tracking: rather, we track in order to detect. The problem then becomes one of choosing the appropriate image representation as well as the optimal (and necessarily nonlinear) filter. We propose exact and approximate solutions using wavelets and the Zakai equation. The smoothness of the wavelets used is required in the derivation of the evolution equation for the conditional density giving the filter, and their orthogonality makes it possible to carry out actual computations of the Ito- and change-of-gauge-terms in the algorithm effectively.
Parallel protein structure determination from uncertain data
Authors: Cheng Che Chen, Jaswinder Pal Singh, William B. Poland, Russ B. Altman
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Molecular structure determination is an important task in biology because of the intimate relation between form and function of biological molecules. Individual sources of information about molecular structure are subject to uncertainty and are not sufficiently abundant to define the structure to high accuracy by themselves. We have examined a probabilistic algorithm, PROTEAN, which can incorporate multiple sources of uncertain data to estimate the three-dimensional structure of molecules and also predict a measure of the uncertainty in the estimated structure. We have applied this algorithm successfully to several biological structure problems. Like most structure prediction methods, this algorithm is computationally expensive for realistic biological macromolecules. In this paper, we experiment with speeding up the algorithm through the application of parallelism. We present a parallel version of the algorithm, and demonstrate good speedups on a 32-processor Stanford DASH, a cache-coherent shared-address-space multiprocessor. The results were obtained by exploiting data locality only in the per-processor coherent caches, without attempt to distribute data intelligently in the physically distributed main memory of the machine. We also obtained very good speedups on a state-of-the-art commercial multiprocessor, the Silicon Graphics Challenge. Finally, we propose an extension to the serial algorithm which enables it to handle a wider class of data, and discuss the potential for parallelization of the extended algorithm.
Improving Defect Detection in Static-Voltage Testing
Authors: Michel Renovell, Florence Azaïs, Yves Bertrand
Venue: IEEE Design Test (2002)

Analyzing defect behavior is becoming increasingly difficult with the rising significance of defects that depend on random parameters. Such unpredictable parameters can affect various types of test escape. The concept of detection domains can help sort out the behavior of these test escapes.
Firm characteristics influencing the extent of electronic billing adoption: an empirical study in the US telecommunication industry
Authors: Seongcheol Kim
Venue: Telematics and Informatics (2002)

The recent moves toward both customer orientation and electronic commerce are placing a greater emphasis on a Web-based electronic billing system as a new customer service tool. In the meantime, understanding what kinds of firms are better doing business with their customers through an early adoption of electronic billing system has become more crucial. The objective of this paper is to examine several firm characteristics, including industry tenure, firm scope and firm size, influencing the extent of electronic billing adoption in the US telecommunication industry. The findings from a comprehensive content analysis of Web sites indicate that firm size has the most significant impact while industry tenure and geographic firm scope have also significant explanatory power. This paper concludes with implications of these findings for telecommunication scholars and practitioners.