ppxscal/embedding_network huggingface dataset:
An Overview of the BTRON/286 Specification
Authors: Ken Sakamura, Yoshiaki Kushiki, Kazuhiro Oda
Venue: IEEE Micro (1989)

A description is given of BTRON, or Business TRON, a set of operating system specifications for workstations and personal computers that use bitmapped displays. BTRON is a 16-b version of the Japanese TRON project's 32/64-b architecture, designed to be more affordable and fill business data and graphics needs. The primary goals set for BTRON call for the realization of easy operation through a standardized human-machine interface (HMI) and the assurance of data compatibility across different applications and machines. BTRON establishes a method for exchange data and control across applications, and it realizes a document management system in which text and graphics can be mixed freely and layouts handled with ease. It offers standard support of English, Japanese, and other languages, providing a wide variety of fonts. Basic services of the operating system nucleus that are examined are process, file, event, device, and real and virtual object management. TAD (TRON Application Databus) is also explained.
Wafer-Level Testing with a Membrane Probe
Authors: Brian Leslie, Farid Matta
Venue: IEEE Design Test (1989)

The authors describe a proprietary membrane probe card that addresses the needs of testing VLSI devices at the wafer level. The membrane probe allows the testing of devices with a high pin count at operating speed, while allowing a complete package test at the wafer level. The concepts and structure of the probe are examined, and its performance is demonstrated by time-domain and frequency-domain measurements of the typical electrical characteristics of a VLSI digital probe that accesses 272 pads at a pitch of 110 mu m. Applications to a bipolar ECL (emitter-coupled logic) flash A/D (analog-to-digital) converter, a bipolar ECL D/A converter, an application-specific CMOS IC, an NMOS VLSI central processing unit, and area-array solder bumps are presented.
A Cost-Effective Approach to Testing
Authors: Susan A. Sherer
Venue: IEEE Software (1991)

A method for assessing the differential risk of failure among a system's modules is proposed. The procedure has three components: external-risk assessment, module exposure, and module-failure likelihood. External-risk assessment is a consideration of the system's environment, almost independent of the software's details. To estimate module exposure, the model relates individual modules and their potential faults to the external-failure modes and their economic consequences by reverse-engineering the specifications and analyzing each module's expected use. To estimate failure likelihood, the method uses a reliability model. The method constitutes theoretical foundation for the cost-effective development of software that attempts to reduce the risk of failure. Managers can use the failure-risk estimates to better determine how much testing effort can be economically justified.
iWarp: A 100-MOPS, LIW Microprocessor for Multicomputers
Authors: Craig Peterson, James Sutton, Paul Wiley
Venue: IEEE Micro (1991)

An architecture that efficiently supports both message-passing and systolic communications in one system is presented. This architecture incorporates a variety of innovative features unifying both computational power and communications flexibility in one VLSI component, the iWarp microprocessor. The message-based communication model is discussed, and an overview of the architecture is given. Two principle iWarp components, called the communication agent and the computation agent, and the register file they share are described. The efficiencies of word-level communication are examined. The software development environment is also described.
Performance of Synchronous Parallel Algorithms with Regular Structures
Authors: S. Madala, J. B. Sinclair
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

New methods are presented for bounding and approximating the mean execution time ofpartitioning algorithm, and these methods are compared to previous approaches.Distribution-driven and program-driven simulations show that two of the methods areusually accurate to within 10% and give good estimates even when certain independenceassumptions are violated. Asymptotic approximations and upper bounds are derived forthe average execution time of multiphase algorithms when there is no contention forprocesses in the parallel phase. In addition, the authors bound the average executiontime under static and dynamic scheduling policies and determine the optimum number ofparallel tasks to be created to minimize the execution time bounds with constantscheduling overhead.
The Data-Driven Microprocessor
Authors: Shinji Komori, Kenji Shima, Souichi Miyata, Toshiya Okamoto, Hiroaki Terada
Venue: IEEE Micro (1989)

Processor performance limitations that can be solved by data-flow processing are discussed. Data-flow-based software and multiprocessors are considered. A data-driven, 32-bit, five-chip set that performs real-time signal and distributed parallel processing without a system clock or centralized control unit is presented. Language processing and processor applications are examined.
ACIRD: Intelligent Internet Document Organization and Retrieval
Authors: S. -H. Lin, M. C. Chen, J. -M. Ho, Y. -M. Huang
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper presents an intelligent Internet information system, Automatic Classifier for the Internet Resource Discovery (ACIRD), which uses machine learning techniques to organize and retrieve Internet documents. ACIRD consists of a knowledge acquisition process, document classifier, and two-phase search engine. The knowledge acquisition process of ACIRD automatically learns classification knowledge from classified Internet documents. The document classifier applies learned classification knowledge to classify newly collected Internet documents into one or more classes. Experimental results indicate that ACIRD performs as well or better than human experts in both knowledge acquisition and document classification. By using the learned classification knowledge and the given class lattice, the ACIRD two-phase search engine responds to user queries with hierarchically structured navigable results (instead of a conventional flat ranked document list), which greatly aids users in locating information from numerous, diversified Internet documents.
Nouvelles statistiques de partitions pour les q-nombres de stirling de seconde espece
Authors: Gerald Ksavrelof, Jiang Zeng
Venue: Discrete Mathematics (2002)

Steingrímsson (Preprint, 1999) has recently introduced a partition analogue of Foata-Zeilberger's mak statistic for permutations and conjectured that its generating function is equal to the classical q-Stirling numbers of second kind. In this paper, we prove a generalization of Steingrimsson's Conjecture 12.
Gr&ouml;bner Bases and Systems Theory
Authors: Bruno Buchberger
Venue: Multidimensional Systems and Signal Processing (2001)

We present the basic concepts and results of Gr&ouml;bner bases theory for readers working or interested in systems theory. The concepts and methods of Gr&ouml;bner bases theory are presented by examples. No prerequisites, except some notions of elementary mathematics, are necessary for reading this paper. The two main properties of Gr&ouml;bner bases, the elimination property and the linear independence property, are explained. Most of the many applications of Gr&ouml;bner bases theory, in particular applications in systems theory, hinge on these two properties. Also, an algorithm based on Gr&ouml;bner bases for computing complete systems of solutions (&ldquo;syzygies&rdquo;) for linear diophantine equations with multivariate polynomial coefficients is described. Many fundamental problems of systems theory can be reduced to the problem of syzygies computation.
ASPIS: A Knowledge-Based CASE Environment
Authors: P. Paolo Puncello, Piero Torrigiani, Francesco Pietri, Riccardo Burlon, Bruno Cardile, Mirella Conti
Venue: IEEE Software (1988)

The authors report on ESPRIT Project 401, building the Application Software Prototype Implementation System (ASPIS) for computer-aided software engineering (CASE). ASPIS uses artificial intelligence techniques in a software-development environment. The goal is to encourage a more flexible and effective software-development life cycle, smoothing the transition between user needs, analysis, and design. The focus is on a knowledge-based assistant called the analysis assistant, the primary goal of which is to provide the user with domain-dependent suggestions and advice during a particular method phase.
Using Optical Space-Frequency Analysis for Real-Time Pattern Recognition
Authors: Frank Reichel, Wolfgang Loeffler, Ernst Gaertner
Venue: IEEE Micro (1994)

Simple, economical hardware based on incoherent space-frequency analysis overcomes many drawbacks associated with coherent optical systems. We have adopted this technique in developing a compact camera unit that uses a liquid-crystal light modulator for data input. This optically addressable camera system can automate a variety of visual inspection tasks. Adapted to conventional microscopes, it also enables automatic inspection of biological specimen textures, a useful tool in disease detection.
Bottom-up Process Improvement Tricks
Authors: Allan Baktoft Jakobsen
Venue: IEEE Software (1998)

Most everyone in our field acknowledges that software process improvement cannot succeed unless management is committed to implementing it. Fortunately, the move to SPI can be a two-way street, initiated as easily from the bottom up as from the top down. Taking this bottom-up approach, I present some tricks that practitioners down in the trenches can use to win upper management's approval of and support for SPI. My first opportunity to introduce bottom-up process changes occurred on a project in which my job was basically coding and testing. Initially, I was assigned to the maintenance coding of the product's previous release, which proved to be a real headache. So I had my motives for making improvements. According to the waterfall model we were using, the project was about halfway through the design phase. A lot of lower-level design and unit and integration testing remained. I was assigned one part of the system, and the remaining design and unit testing tasks were given to the 15 people we had allocated to us for the next five months. Given the amount of work that lay before us, these resources were not nearly enough. One subproject leader realized that our complex and lengthy design task would prove a huge challenge.
A Graph-Oriented Object Database Model
Authors: M. Gyssens, J. Paredaens, J. Van den Bussche, D. Van Gucht
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

A graph-oriented object database model (GOOD) is introduced as a theoretical basis for database systems in which manipulation as well as conceptual representation of data is transparently graph-based. In the GOOD model, the scheme as well as the instance of an object database is represented by a graph, and the data manipulation is expressed by graph transformations. These graph transformations are described using five basic operations and a method construct, all with a natural semantics. The basic operations add and delete objects and edges as a function of the matchings of a pattern. The expressiveness of the model in terms of object-oriented modeling and data manipulation power is investigated.
A Pipeline Design for the Realization of the Prime Factor Algorithm Using the Extended Diagonal Structure
Authors: D. P. -K. Lun, Wan-Chi Siu
Venue: IEEE Transactions on Computers (1994)

In this brief contribution, an efficient pipeline architecture is proposed for the realization of the Prime Factor Algorithm (PFA) for digital signal processing. By using the extended diagonal feature of the Chinese Remainder Theorem (CRT) mapping, we show that the input data sequence can be directly loaded into a multidimensional array for the PFA computation without any permutation. Short length modules are modified such that an in-place and in-order computation is allowed. The computed results can then be directly restored back to the memory array without the need for further reordering. More importantly, the CRT mapping can also be used to represent the output data, hence we can utilize the extended diagonal feature of the CRT mapping to directly send the computed results to the outside world. As compared to the previous approaches, the present approach requires no shifting or rotation during the data loading and retrieval processes. In the case of multidimensional PFA computation, it does not require the computation to be split up into a number of two-dimensional computations. Hence, the overhead required for data loading and retrieval in each two-dimensional stage can be saved.
On 2-arc-transitive Cayley graphs of Abelian groups
Authors: Primoz Potocnik
Venue: Discrete Mathematics (2002)

A 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two and the last two are adjacent. A graph X is 2-arc-transitive if its automorphism group acts transitively on the set of 2-arcs of X. Some properties of 2-arc-transitive Cayley graphs of Abelian groups are considered. It is also proved that the set of generators of a 2-arc-transitive Cayley graph of an Abelian group which is not a circulant contains no elements of odd order.
The Fixed-Point Algorithm and Maximum Likelihood Estimation forIndependent Component Analysis
Authors: Aapo Hyvärinen
Venue: Neural Processing Letters (1999)

The author previously introduced a fast fixed-point algorithm for independent component analysis. The algorithm was derived from objective functions motivated by projection pursuit. In this paper, it is shown that the algorithm is closely connected to maximum likelihood estimation as well. The basic fixed-point algorithm maximizes the likelihood under the constraint of decorrelation, if the score function is used as the nonlinearity. Modifications of the algorithm maximize the likelihood without constraints.
Debugging for Timing-Constraint Violations
Authors: Jeffrey J. P. Tsai, Yao-Dong Bi, Steve Jennhwa Yang
Venue: IEEE Software (1996)

Analysts debug real-time distributed systems by viewing timing behavior in the context of four possible faults. Graphs and animations of execution history make it easy to see process interactions. By applying a method to determine which fault caused the violation, analysts can go beyond timing analysis to efficiently correct the program.
Stochastic Resonance and Coincidence Detection in Single Neurons
Authors: Yuichi Sakumura, Kazuyuki Aihara
Venue: Neural Processing Letters (2002)

We demonstrate that a realistic neuron model expressed by the Hodgkin-Huxley equations shows a stochastic resonance phenomenon, by computing cross-correlation between input and output spike timing when the neuron receives both aperiodic signal input of spike packets and background random noise of both excitatory and inhibitory spikes. We consider that such a signal detection is realized because the neuron with active properties is sensitive to fluctuation caused by a sharp increase just after a sudden dip of excitatory noise spikes and a gradual decrease of inhibitory noise spikes. We also show that the model generates highly irregular firing of output spikes on the basis of the modulation detecting property.
Fuzzy systems to process ECG and EEG signals for quantification of the mental workload
Authors: B. S. Moon, H. C. Lee, Y. H. Lee, J. C. Park, I. S. Oh, J. W. Lee
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

In this paper, we analyze the ECG and EEG signals by using a set of fuzzy systems developed for signal processing and try to see if one can quantify the mental workload based on the trend of EEG signal changes and the variation of pulse width from ECG signal. The signal data were taken from nuclear power plant operators while they perform the turbine operations. First, we apply a fuzzy system to extract the heart beat intervals from the ECG and a smoothing algorithm for the variation of the resulting heart beat intervals to obtain a trend variable. Next, we apply the same smoothing algorithm to the α-band frequencies and to the θ-band frequencies to get their trend curves. Finally, the three trend variables; the variation of the heart beat intervals, the α-band power, and the θ-band power are combined by a pair of fuzzy systems to estimate the mental workload during nuclear power plant operations. The results of applying our algorithm to three different data sets are included, along with a comparison between these results and the results obtained by applying a linear combination of the three variables. Compared results show that the 'mental workload' computed by fuzzy systems with nonlinear rules reflects the changes more clearly than the ones computed by linear functions.
XML's Impact on Databases and Data Sharing
Authors: Len Seligman, Arnon Rosenthal
Venue: Computer (2001)

The Extensible Markup Language, HTML's likely successor for capturing Web content, has generated a lot of interest. Created by the World Wide Web Consortium to address HTML's limitations, XML resembles HTML's format but offers users a more extensible language. It lets information publishers invent their own tags for applications. Alternatively, they can work with organizations to define shared tag sets that promote interoperability and help separate content from presentation. While XML addresses content, Cascading Style Sheets, the Extensible Stylesheet Language, and Extensible HTML handle presentation separately. XML also supports data validation. XML's advantages over HTML include support for multiple views of the same content for different user groups and media; selective, field-sensitive queries over the Internet and intranets; a visible semantic structure for Web information; and a standard data and document interchange infrastructure. Using XML and related tools often eliminates problems associated with heterogeneous data structures. Like any new technology, XML has generated exaggerated claims. It does not come close to eliminating the need for database management systems or solving large organizations' data-sharing problems. Although XML hype has raised unrealistic expectations, the language does reduce the data-sharing obstacles among diverse applications and databases by providing a common format for expressing data structure and content.
The Intensity Axis of Symmetry and Its Application to Image Segmentation
Authors: J. M. Gauch, S. M. Pizer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The authors present the intensity axis of symmetry (IAS) method for describing the shape of structures in grey-scale images. They describe the spatial and intensity variations of the image simultaneously rather than by the usual two-step process of using intensity properties of the image to segment an image into regions and describing the spatial shape of these regions. The result is an image shape description that is useful for a number of computer vision applications. The method relies on minimizing an active surface functional that provides coherence in both the spatial and intensity dimensions while deforming into an axis of symmetry. Shape-based image segmentation is possible by identifying image regions associated with individual components of the IAS. The resulting image regions have geometric coherence and correspond well to visually meaningful objects in medical images.
Making Complex Articulated Agents Dance
Authors: Maja J. Matarić, Victor Brian Zordan, Matthew M. Williamson
Venue: Autonomous Agents and Multi-Agent Systems (1999)

We discuss the tradeoffs involved in control of complex articulated agents, and present three implemented controllers for a complex task: a physically-based humanoid torso dancing the Macarena. The three controllers are drawn from animation, biological models, and robotics, and illustrate the issues of joint-space vs. Cartesian space task specification and implementation. We evaluate the controllers along several qualitative and quantitative dimensions, considering naturalness of movement and controller flexibility. Finally, we propose a general combination approach to control, aimed at utilizing the strengths of each alternative within a general framework for addressing complex motor control of articulated agents.
Protecting Privacy in Remote-Patient Monitoring
Authors: Atsushi Kara
Venue: Computer (2001)

Audio-video-based remote-patient monitoring via the Internet raises privacy issues that only clearly defined confidentiality and authentication requirements for secure Internet communication can address. MPEG compression technologies can transmit high-quality audio-video via the Internet so that a family member can use an office PC or wireless mobile terminal to monitor a bedridden patient's image and vital signs while a caregiver runs errands. However, such systems raise privacy concerns. Transmitting unprotected audio-visual signals, compressed in a standard format, over the Internet carries the risk that someone can monitor these transmissions, accidentally or intentionally. For medical and healthcare applications, security issues in the Internet's transport and network layers cause the most concern. Although encryption can protect data, using such technology for remote-patient monitoring should not compromise Internet accessibility and performance. Patient-monitoring applications require excellent performance and quality of service to provide accurate live information to the monitoring side. Thus, the performance of the end-to- end Internet infrastructure itself must be the subject of future study.
The Art of Molecular Dynamics Simulation
Authors: D. C. Rapaport
Venue:  (1995)

:This book describes the extremely powerful technique of molecular dynamics simulation, which involves solving the classical many-body problem in contexts relevant to the study of matter at the atomic level. The method allows the prediction of the static and dynamic properties of substances directly from the underlying interactions between the molecules. Because there is no alternative approach capable of handling such a broad range of problems at the required level of detail, molecular dynamics methods have proved themselves indispensable in both pure and applied research.
Velocity-Guided Tracking of Deformable Contours in Three Dimensional Space
Authors: Reuven Zaritsky, Natan Peterfreund, Nahum Shimkin
Venue: International Journal of Computer Vision (2003)

This paper presents a 3D active contour model for boundary detection and tracking of non-rigid objects, which applies stereo vision and motion analysis to the class of energy-minimizing deformable contour models, known as snakes. The proposed contour evolves in three-dimensional space in reaction to a 3D potential function, which is derived by projecting the contour onto the 2D stereo images. The potential function is augmented by a kinetic term, which is related to the velocity field along the contour. This term is used to guide the inter-image contour displacement. The incorporation of inter-frame velocity estimates in the tracking algorithm is especially important for contours which evolve in 3D space, where the added freedom of motion can easily result in loss of tracking. The proposed scheme incorporates local velocity information seamlessly in the snake model, with little computational overhead, and does not require exogenous computation of the optical flow or related quantities in each image. The resulting algorithm is shown to provide good tracking performance with only one iteration per frame, which provides a considerable advantage for real time operation.