ppxscal/embedding_network huggingface dataset:
The generalized maximal covering location problem
Authors: Oded Berman, Dmitry Krass
Venue: Computers and Operations Research (2002)

We consider a generalization of the maximal cover location problem which allows for partial coverage of customers, with the degree of coverage being a non-increasing step function of the distance to the nearest facility. Potential application areas for this generalized model to locating retail facilities are discussed.We show that, in general, our problem is equivalent to the uncapacitated facility location problem. We develop several integer programming formulations that capitalize on the special structure of our problem. Extensive computational analysis of the solvability of our model under a variety of conditions is presented.
Programmable Vision Processor/ Controller for Flexible Implementation of Current and Future Image Compression Standards
Authors: Doug Bailey, Matt Cressa, Jan Fandrianto, Doug Neubauer, Hedley Rainnie, Chi-Shin Wang
Venue: IEEE Micro (1992)

The vision processor (VP) and vision controller (VC), two integrated products dedicated to video compression, are discussed. The chips implement the P*64, JPEG, and MPEG image compression standards. The VP forms the heart of the image compression system. It performs discrete cosine transform (DCT), quantization, and motion estimation, as well as inverse DCT, and inverse quantization. The highly parallel and microcode-based processor performs all of the JPEG, MPEG, and P*64 algorithms. The VC smart microcontroller controls the compression process and provides the interface to the host system. It captures pixels from a video source, performs video preprocessing, supervises pixel compression by the VP, performs Huffman encoding, and passes the compressed data to the host over a buffered interface. It takes compressed data from the host, performs coder decoding, supervises decompression via the VP, performs postprocessing, and generates digital pixel output for a video destination such as a monitor.
Combined Space Diversity Reception and Trellis Coding for Rayleigh Fading Channels
Authors: Guillem Femenias, Ramon Agusti
Venue: Wireless Personal Communications: An International Journal (1997)

Space diversity reception, in which several signals received at different antennas are combined, is a well known method that can be used to combat the effects of fading in wireless systems. Also, trellis coded modulation (TCM), when combined with interleaving of sufficient depth, is known to provide some form of time diversity that allows the achievement of good error performance in fading environments. In this paper we consider the analysis of the error performance of reference-based Maximal Ratio Combining (MRC) systems when used in conjunction with trellis-coded MPSK modulation techniques over a Rayleigh fading channel. We also consider the analysis of MRC trellis-coded MPSK systems with conventional differential detection. The results are obtained by using a combination of theoretical analysis and simulation. Exact and near-exact expressions for the pairwise error-event probability in Rayleigh fading are derived. Monte-Carlo simulation results, which are more indicative of the exact system performance, are also given.
Coplanarity analysis and validation of PBGA and T2-BGA packages
Authors: Kuo-Ming Chen, Kuo-Hsiung Horng, Kuo-Ning Chiang
Venue: Finite Elements in Analysis and Design (2002)

Plastic BGA (PBGA) has recently been extensively used in microelectronics package. However, its heat-dissipating capacity is limited to below 2 or 3 W, and thus fails to satisfy the requirement of high heat dissipation and improved electrical performance. This work offers a finite element analytic methodology to predict the coplanarity of T2-BGA (Turbo thermal ball grid array) and PBGA, using ANSYS software. T2-BGA involves inserting a heat slug into the molding compound of a PBGA. The material of the heat slug Can be either aluminum or copper. Surface mount technology (SMT) of BGA is limited mainly by the coplanarity due to coefficient of thermal expansion mismatch, since the structure of BGA is asymmetric. The coplanarity is limited below 0.2 mm (8mil) by the Joint Electron Device Engineering Council (JEDEC) standard (JEDEC Design Standard, No. 95-1, Section 14, Ball Grid Array, June 2000). Coplanarity analysis is performed for both PBGA and T2-BGA, using ANSYS. Finally, a coplanarity experiment is conducted on the constructed specimens of PBGA and T2-BGA, to confirm the analytic results. The results in this work establish the effectiveness of T2-BGA in improving coplanarity. Moreover, the analytic results differ slightly from the experimental results, by 1.53-10.50%. The FEM model proposed here can be extended to optimize the structure of T2-BGA.
Declarative Programs with Implicit Implications
Authors: Vilas Wuwongse, Ekawit Nantajeewarawat
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In the presence of taxonomic information, there often exists implicit implication among atoms in an interpretation domain. A general framework is proposed for the discussion of an appropriate semantics for declarative programs with respect to such implicit implication. It is first assumed that the implicit implication can be predetermined and represented by a preorder on the interpretation domain. Under the consequent constraint that every interpretation must conform to the implicit implication, an appropriate model-theoretic semantics as well as its corresponding fixpoint semantics for declarative programs is described. Based on Köstler et al.'s foundation of fixpoint with subsumption, it is shown that, if the implicit-implication relation is, in addition, assumed to be a partial order, then the meaning of a program can be determined more efficiently by application of an immediate-consequence operator which involves only reduced representations, basically consisting only of their maximal elements, of subsets of the interpretation domain.
The Design of TSC Error C/D Circuits for SEC/DED Codes
Authors: N. Gaitanis
Venue: IEEE Transactions on Computers (1988)

A design technique for totally self-checking (TSC) error correcting/detection (C/D) circuits of single error correcting, double error detection (SEC/DED) codes is described. The structure of these circuits achieves concurrent fault detection and location under normal input conditions. A separate internal fault indication is provided. This improves the reliability, maintainability, and availability of the entire fault-tolerant system because faults are repaired before the appearance of input errors. The error C/D circuits are composed of TSC error detectors, error locators, and error correctors. These circuits are two-rail TSC checkers and are designed using an algebraic approach.
Development of an Emergency Medical Video Multiplexing Transport System: Aiming at the Nation Wide Prehospital Care on Ambulance
Authors: Hideaki Nagatuma
Venue: Journal of Medical Systems (2003)

The Emergency Medical Video Multiplexing Transport System (EMTS) is designed to support prehospital cares by delivering high quality live video streams of patients in an ambulance to emergency doctors in a remote hospital via satellite communications. The important feature is that EMTS divides a patient's live video scene into four pieces and transports the four video streams on four separate network channels. By multiplexing four video streams, EMTS is able to transport high quality videos through low data transmission rate networks such as satellite communications and cellular phone networks. In order to transport live video streams constantly, EMTS adopts Real-time Transport Protocol/Real-time Control Protocol as a network protocol and video stream data are compressed by Moving Picture Experts Group 4 format. As EMTS combines four video streams with checking video frame numbers, it uses a refresh packet that initializes server's frame numbers to synchronize the four video streams.
A Map of Security Risks Associated with Using COTS
Authors: Ulf Lindqvist, Erland Jonsson
Venue: Computer (1998)

Combining Internet connectivity and COTS-based systems results in increased threats from both external and internal sources. Traditionally, security design has been a matter of risk avoidance. Now more and more members of the security community realize the impracticality and insufficiency of this doctrine. It turns out that strict development procedures can only reduce the number of flaws in a complex system, not eliminate every single one. Vulnerabilities may also be introduced by changes in the system environment or the way the system operates. Therefore, both developers and system owners must anticipate security problems and have a strategy for dealing with them. This is particularly important with COTS-based systems, because system owners have no control over the development of the components. The authors present a taxonomy of potential problem areas. It can be used to aid the analysis of security risks when using systems that to some extent contain COTS components.
Test Counting: A Tool for VLSI Testing
Authors: Sheldon B. Akers, Balakrishnan Krishnamurthy
Venue: IEEE Design Test (1989)

The authors present a technique, called test counting, for analyzing the testing requirements imposed on a combinational network in the form of a set of stuck-at faults to be detected. By solving a large set of mathematical inequalities, called constraints, test counting determines that certain pairs of faults cannot be test simultaneously. The result is a set of mutually independence faults, no two of which can be detected by the same test vector. The number of faults becomes a lower bound on the size of the test set required. The authors provide a list of constraints to implement the test-counting algorithm and offer a complete minimal test set for the 74LS181 ALU.
Polyunsaturated posets and graphs and the Greene-Kleitman theorem
Authors: Glenn G. Chappell
Venue: Discrete Mathematics (2002)

A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman (J. Combin. Theory Ser. A 20 (1976) 41) proved that, for each k, every finite poset has a simultaneously k- and k + 1-saturated chain partition. West (J. Combin. Theory Ser. A 41 (1986) 105) showed that the Greene-Kleitman Theorem is best possible in a strong sense by exhibiting, for each c ≥ 4, a poset with longest chain of cardinality c and no k- and l-saturated chain partition for any distinct, nonconsecutive k, l > c. We call such posets polyunsaturated. We give necessary and sufficient conditions for the existence of polyunsaturated posets with prescribed height, width, and cardinality. We prove these results in the more general context of graphs satisfying an analogue of the Greene-Kleitman Theorem. Lastly, we discuss analogous results for antichain partitions.
Handwritten Character Classification Using Nearest Neighbor in Large Databases
Authors: S. J. Smith, M. O. Bourgoin, K. Sims, H. L. Voorhees
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Shows that systems built on a simple statistical technique and a large training database can be automatically optimized to produce classification accuracies of 99% in the domain of handwritten digits. It is also shown that the performance of these systems scale consistently with the size of the training database, where the error rate is cut by more than half for every tenfold increase in the size of the training set from 10 to 100,000 examples. Three distance metrics for the standard nearest neighbor classification system are investigated: a simple Hamming distance metric, a pixel distance metric, and a metric based on the extraction of penstroke features. Systems employing these metrics were trained and tested on a standard, publicly available, database of nearly 225,000 digits provided by the National Institute of Standards and Technology. Additionally, a confidence metric is both introduced by the authors and also discovered and optimized by the system. The new confidence measure proves to be superior to the commonly used nearest neighbor distance.
Geology explorer: virtual geologic mapping and interpretation
Authors: Bernhardt Saini-Eidukat, Donald P. Schwert, Brian M. Slator
Venue: Computers Geosciences (2002)

We are developing internet-based freeware for virtual mapping and geologic interpretation. This takes the form of a synthetic, virtual world, Planet Oit, where students are given the means and the equipment to carry out geologic investigation and interpretation as a geologist would in the field. The environment is designed to give students an authentic experience that includes elements of: (1) exploration of a spatially oriented, virtual, world; (2) practical, field oriented, expedition planning and decision-making; and (3) scientific problem solving (i.e. a "hands on" approach to mapping, geologic investigation, data acquisition, and interpretation). The game-like environment is networked, multiplayer, and simulation-based. Planet Oit can be visited on the Internet at http://oit.cs.ndsu.nodak.edu/
Experimentation with Hypercube Database Engines
Authors: Ophir Frieder, Vijaykumar A. Topkar, Ramesh K. Karne, Arun K. Sood
Venue: IEEE Micro (1992)

Using Intel's iPSC/2 hypercube, the authors measured the relationship between packet size, method of clustering messages, and internode traffic on the total sustained communication bandwidth. Having measured the costs associated with internode communication, they then analyzed duplicate removal algorithms. They also studied the effects of nonuniformly distributed attribute values and tuples across processors on three proposed duplicate removal algorithms. They chose algorithms to represent the several available in the literature and then evaluated the output collection time. The authors present a brief overview of the iPSC/2's hypercube message-passing system and discuss the results of their experimentation and analysis.
Tool Box
Venue: IEEE Software (1995)

As client-server applications continue to replace mainframe-based systems, developers are looking for ways to adapt testing procedures for graphical user interfaces. Some advocate starting from scratch with new approaches; others, like Dan Mosley, see ways to amend old techniques and supplement them with new ones. Here, Mosley, who has 14 years experience in information systems, offers some tips from his upcoming book Testing Client-Server Application Software (Prentice-Hall, to be published fall 1995) and gives advice on selecting GUI test tools.¿ David Sharon, Editor The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Rover: Scalable Location-Aware Computing
Authors: Suman Banerjee, Sulabh Agarwal, Kevin Kamel, Andrzej Kochut, Christopher Kommareddy, Tamer Nadeem, Pankaj Thakkar, Bao Trinh, Adel Youssef, Moustafa Youssef, Ronald L. Larsen, A. Udaya Shankar, Ashok Agrawala
Venue: Computer (2002)

All the components necessary forrealizing location-aware computingare available in the marketplacetoday. What has hindered the widespreaddeployment of location-based systems isthe lack of an integration architecturethat scales with user populations.The authors have completed the initialimplementation of Rover, a system designedto achieve this sort of integrationand to automatically tailor informationand services to a mobile user's location.Their studies have validated Rover'sunderlying software architecture, whichachieves system scalability through highresolution,application-specific resourcescheduling at the servers and network.The authors believe that this technologywill greatly enhance the user experience inmany places, including museums, amusementand theme parks, shopping malls,game fields, offices, and business centers.They designed the system specifically toscale to large user populations and expectits benefits to increase with them.
Object Structures for Real-Time Systems and Simulators
Authors: K. H. (Kane) Kim
Venue: Computer (1997)

The market for real-time applications has grown considerably in recent years, and in response engineering methods have also improved. Today's techniques, while adequate for building moderately complex embedded applications, are inadequate for building the large, highly reliable, very complex real-time applications that are increasingly in demand. To build such large systems, engineering teams need a more uniform, integrated approach than is available today. We should ideally make uniform the representations of both application environments and control systems as we proceed through various system engineering phases. The ideal representation (or modeling) scheme should be effective not only for abstracting system designs but also for representing the application environment. It should also be capable of manipulating logical values and temporal characteristics at varying degrees of accuracy. This ideal modeling scheme is not likely to be realized through conventional object models. Although they are natural building blocks for modular systems, conventional object models lack concrete mechanisms to represent the temporal behavior of complex, dynamic systems. At UCI's Dream Laboratory, we have developed a real-time object structure that can flexibly yet accurately specify the temporal behavior of modeled subjects. This approach supports strong requirements-design traceability, the feasibility of thorough and cost-effective validation, and ease of maintenance. The ultimate goal is to significantly increase productivity in the engineering of highly reliable complex systems.
A biomechanical study of the finger pulley system during repair
Authors: F. Amirouche, M. Gonzalez, J. Koldoff, J. Tioco, K. Ham
Venue: Technology and Health Care (2002)

This paper addresses the mechanics of the finger/pulley system when subjected to various excisions and repairs. Several cadaver hands were used to study the finger/pulley's function, finger joint dynamics, and the relationship between tendon excursion and finger joint angles of rotation. By using a method of continuous and simultaneous data acquisition of the entire finger joint's motion, a more detailed analysis was achieved. Our experimental investigation is based on the use of four micro-potentiometers inserted at the finger's joints and a pulley system to simulate tendon excursion. Using this procedure, a detailed kinematic analysis of the entire finger was performed. This included analysis of the intact hand, various pulley excisions, and reconstruction. In addition to introducing a new method of acquisition, a mathematical model was developed for the inverse dynamic analysis of the finger pulley system. From this model, the torques required at the joints for the motion were computed. The results provided new insight into possible ways of characterizing kinematic changes resulting from pulley damage and repair.
FLAME&mdash;Fuzzy Logic Adaptive Model of Emotions
Authors: Magy Seif El-Nasr, John Yen, Thomas R. Ioerger
Venue: Autonomous Agents and Multi-Agent Systems (2000)

Emotions are an important aspect of human intelligence and have been shown to play a significant role in the human decision-making process. Researchers in areas such as cognitive science, philosophy, and artificial intelligence have proposed a variety of models of emotions. Most of the previous models focus on an agent's reactive behavior, for which they often generate emotions according to static rules or pre-determined domain knowledge. However, throughout the history of research on emotions, memory and experience have been emphasized to have a major influence on the emotional process. In this paper, we propose a new computational model of emotions that can be incorporated into intelligent agents and other complex, interactive programs. The model uses a fuzzy-logic representation to map events and observations to emotional states. The model also includes several inductive learning algorithms for learning patterns of events, associations among objects, and expectations. We demonstrate empirically through a computer simulation of a pet that the adaptive components of the model are crucial to users' assessments of the believability of the agent's interactions.
A photo-oxidation generated low-k dielectric film deposited by reactive evaporation of SiO
Authors: Jun-Jie Si, Yoshiyuki Show, Souri Banerjee, Hiroshi Ono, Kazuo Uchida, Shinji Nozaki, Hiroshi Morisaki
Venue: Microelectronic Engineering (2002)

A non-stoichiometric silicon oxide film has been deposited by evaporating SiO as a source material in Ar and O2 mixed gas. The film is composed of SiO and SiO2, and has a porous structure. The SiO2 results from some part of SiO reacting with O2 and its amount depends on the pressure in the chamber. The residual SiO in the film can be photo-oxidized into SiO2 by ultraviolet radiation with a Hg lamp. The dielectric constant of the film after photo-oxidation is ∼ 1.89±0.04 (at frequency of 1 MHz), which shows that this porous structure film is promising for potential application as a low-k dielectric.
Internationalizing Software with Concurrent Engineering
Authors: Farshad Rafii, Sam Perkins
Venue: IEEE Software (1995)

For the software industry, the simultaneous launch of new products in multiple global markets has become a competitive necessity. The growing importance of overseas markets, the diverse demands of multinational customers, and the narrow profitability window for products with increasingly shorter life cycles compel software vendors to release internationalized versions of major products within months, if not weeks, of the original.Concurrent engineering promises to enable simultaneous launch by dramatically reducing the time and costs involved in internationalizing a base software version and customizing it for local markets. Yet concurrent engineering also has potential risks, especially when you apply it to products that represent quantum leaps in technology or when you must disperse development teams around the globe.We present a framework that outlines the range of options available to managers. These options vary along the dimensions of location and timing. We assert that the most suitable choice depends on two critical factors: potential market attractiveness and the development project's inherent technological uncertainty. When concurrent, distributed development does make sense, managers must focus on key factors such as project leadership, organizational structure, and measurement systems, because these play the greatest role in determining the successful outcome of projects.To support our recommendations, we report on the early stages of a research effort based on three detailed case studies conducted at a large hardware and software manufacturer that was concerned with significant delays in the internationalization of its software products.
Unified Integration of Explicit Knowledge and Learning by Example in Recurrent Networks
Authors: Paolo Frasconi, Marco Gori, Marco Maggini, Giovanni Soda
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

We propose a novel unified approach for integrating explicit knowledge and learning by example in recurrent networks. The explicit knowledge is represented by automaton rules, which are directly injected into the connections of a network. This can be accomplished by using a technique based on linear programming, instead of learning from random initial weights. Learning is conceived as a refinement process and is mainly responsible for uncertain information management. We present preliminary results for problems of automatic speech recognition.