ppxscal/embedding_network huggingface dataset:
MORE: An Object-Oriented Data Model with a Facility for Changing Object Structures
Authors: K. Tsuda, K. Yamamoto, M. Hirakawa, M. Tanaka, T. Ichikawa
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

An object-oriented data model, MORE, in which the database specification facilities have been extended so that users can specify an object with various structures is presented. The structure of an object is changed by passing messages. MORE also provides a classtype, a user-defined type for classes with similar structures, in order to simplify the specification of class descriptions. The system generates operations useful for the classes by referring to a corresponding classtype. A prototype system and an example application are described.
V830R/AV: Embedded Multimedia Superscalar RISC Processor
Authors: Kazumasa Suzuki, Tomohisa Arai, Kouhei Nadehara, Ichiro Kuroda
Venue: IEEE Micro (1998)

The construction of real multimedia systems based on processors instead of special purpose hardware requires both higher signal processing performance and higher bandwidth memory systems to the processor. For these applications, a 32-bit embedded RISC processor with a 64-bit "single-instruction multiple-data (SIMD)" coprocessor, the V830R/AV, has been developed. Its asymmetric dual-issue superscalar architecture with the 64-bit SIMD coprocessor achieves 2-GOPS performance in video signal processing applications. The 200-MHz V830R/AV incorporates a Concurrent Rambus DRAM interface that has a 600-Mbyte/s data transfer rate, and it also integrates several multimedia-oriented peripherals. This results in a processor-based real-time MPEG-2 MP@ML decoding system in a unified memory architecture environment.
Normalized matching property of the subgroup lattice of an abelian p-group
Authors: Jun Wang
Venue: Discrete Mathematics (2002)

Let L(kn)(p) denote the subgroup lattice of the abelian p-group (Z/pkZ) × ... × (Z/pkZ) (n times). In a previous paper (Ann. of Combin. 2 (1998) 85), we proved that L(kn)(p) has the Sperner property. In this paper, we prove that for any positive integers n and k, there is a positive integer N(n,k) such that L(kn)(p) has the normalized matching property when p > N(n,k). As a consequence, L(kn)(p) has the strong Sperner property, LYM property and it is a symmetric chain order when p is sufficiently large.
An improved CSPC equation of state for pure fluids
Authors: Chang-Yu Sun, Li-Sheng Wang, Guang-Jin Chen, Tian-Min Guo
Venue: Iranian Journal of Science and Technology (2002)

The three-parameter Cubic Simplified Perturbed Hard-Chain (CSPHC) equation of state (EOS) developed by Wang and Guo (1993) is improved by applying the classical critical point constraints, modifying the attractive term, and introducing the volume translation technique. All the pure component parameters in the modified CSPHC EOS have been generalized through correlating with molecular weight, specific gravity/acentric factor. The proposed modified CSPHC (CSPHC-M) EOS has been extensively tested on pure substances. Parallel comparison of the vapor pressure and phase density calculation with the original CSPHC, PR-Mathias, PR-Twu and PR equations of state over a wide range of reduced temperature and pressure have been performed. The comparison indicates that CSPHC-M EOS is a reliable theoretical-based tool for engineering calculations.
A Delay Model for Router Microarchitectures
Authors: Li-Shiuan Peh, William J. Dally
Venue: IEEE Micro (2001)

Given router parameters, this delay model prescribes realistic pipelines, enabling router architects to optimize network performance before beginning actual detailed design.
A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme
Authors: S. W. Burns, N. K. Jha
Venue: IEEE Transactions on Computers (1994)

Bose has developed a parallel unordered coding scheme using only r checkbits for 2/sup r/ information bits. This code can detect all unidirectional errors and requires simple parallel encoding/decoding. The information symbols can be separated from the check symbols. However, the information symbols containing all zeros and all ones need to be transformed to two other information symbols. This allows one to reduce the number of checkbits over Berger code by 1. Since information symbols containing a power-of-two number of bits are quite common, this coding scheme should become quite popular. The authors describe a modular, economical, and easily testable totally self-checking (TSC) checker design for the above code. The TSC concept is well known for providing concurrent error detection of transient as well as permanent faults. The design is self-testing with at most only 2r+16 codeword tests. This means that if k is the number of information bits, the size of the codeword test set is only O(log/sub 2/ k). This is the first known TSC checker design for this code.
Multilayer perceptron for nonlinear programming
Authors: Jaques Reifman, Earl E. Feldman
Venue: Computers and Operations Research (2002)

A new method for solving nonlinear programming problems within the framework of a multilayer neural network perceptron is proposed. The method employs the Penalty Function method to transform a constrained optimization problem into a sequence of unconstrained optimization problems and then solves the sequence of unconstrained optimizations of the transformed problem by training a series of multilayer percepperptrons. The neural network formulation is represented in such a way that the multilayer perceptron prediction error to be minimized mimics the objective function of the unconstrained problem, and therefore, the minimization of the objective function for each unconstrained optimization is attained by training a single perceptron. The multilayer perceptron allows for the transformation of problems with two-sided bounding constraints on the decision variables x, e.g., a ≤ xn ≤ b, into equivalent optimization problems in which these constraints do not explicitly appear. Hence, when these are the only constraints in the problem, the transformed problem is constraint free (i.e., the transformed objective function contains no penalty terms) and is solved by training a multilayer perceptron only once. In addition, we present a new Penalty Function method for solving nonlinear programming problems that is parameter free and guarantees that feasible solutions are obtained when the optimal solution is on the boundary of the feasible region. Simulation results, including an example from operations research, illustrate the proposed methods.
Sensitivity Analysis of Critical Parameters in Board Test
Authors: Mick M. v. Tegethoff, Tom W. Chen
Venue: IEEE Design Test (1996)

An analysis of the main contributors to the quality and cost of complex board manufacturing is presented. Manufacturing data from three boards built at Hewlett-Packard and simulation models are used to derive the sensitivity of quality and cost versus Surface Mount Technology (SMT) solder defect rate, component functional defect rate and test coverage. A new Yield model which accounts for the clustering of solder defects is introduced, and a first-order estimation of the cost of implementing the IEEE 1149.1 standard on ASICs is given.
Enrollment Management: Managing the Alpha AXP Program
Authors: Peter F. Conklin
Venue: IEEE Software (1996)

This reprinted article describes an innovative program-management methodology created at Digital during the Alpha AXP program, which involved more than 2,000 engineers across many disciplines. The author died just after the original article was published; it has since reached a kind of cult status.The approach involved establishing a shared vision, delegating completely and eliciting specific commitments, inspecting rigorously while providing supportive feedback, and acknowledging every advance. Each project event was used to propel, progress, and gain momentum. Digital delivered the Alpha AXP program on schedule with significant industry capabilities. The results of adopting this model, and the dedication of all the players, resulted in a highly successful new product line for Digital, eventually returning the corporation to a much stronger competitive position.
An approach to identification of variances for radar tracking systems
Authors: Jianping Yao, Leonard Chin, Weixian Liu, Yilong Lu
Venue: Signal Processing (2002)

An approach for the identification of the variances of the process noise W(k) and the measurement noise V(k) for radar tracking systems is presented. In the proposed algorithm, the variances are expressed as a linear combination of the covariances of the third-order difference of the measurement data. The variances can then be estimated by estimating the covariances of the third-order difference and solving the matrix equation. The two cases for the measurement noise being white and color are considered in this algorithm. Simulation results show that for both cases a steady estimation is reached after 20 samples.
An efficient search direction for linear programming problems
Authors: Hsing Luh, Ray Tsaih
Venue: Computers and Operations Research (2002)

In this paper, we present an auxiliary algorithm, in terms of the speed of obtaining the optimal solution, that is effective in helping the simplex method for commencing a better initial basic feasible solution. The idea of choosing a direction towards an optimal point presented in this paper is new and easily implemented. From our experiments, the algorithm will release a corner point of the feasible region within few iterative steps, independent of the starting point. The computational results show that after the auxiliary algorithm is adopted as phase I process, the simplex method consistently reduce the number of required iterations by about 40%.
A New Construction of Central Relative (pa, pa, pa, 1)-Difference Sets
Authors: K. J. Horadam, P. Udaya
Venue: Designs, Codes and Cryptography (2002)

Semiregular relative difference sets (RDS) in a finite group E which avoid a central subgroup C are equivalent to orthogonal cocycles. For example, every abelian semiregular RDS must arise from a symmetric orthogonal cocycle, and vice versa. Here, we introduce a new construction for central (pa, pa, pa, 1)-RDS which derives from a novel type of orthogonal cocycle, an LP cocycle, defined in terms of a linearised permutation (LP) polynomial and multiplication in a finite presemifield. The construction yields many new non-abelian (pa, pa, pa, 1)-RDS. We show that the subset of the LP cocycles defined by the identity LP polynomial and multiplication in a commutative semifield determines the known abelian (pa, pa, pa, 1)-RDS, and give a second new construction using presemifields.We use this cohomological approach to identify equivalence classes of central (pa, pa, pa, 1)-RDS with elementary abelian C and E/C. We show that for p &equals; 2, a &le; 3 and p &equals; 3, a &le; 2, every central (pa, pa, pa, 1)-RDS is equivalent to one arising from an LP cocycle, and list them all by equivalence class. For p &equals; 2, a &equals; 4, we list the 32 distinct equivalence classes which arise from field multiplication. We prove that, for any p, there are at least a equivalence classes of central (pa, pa, pa, 1)-RDS, of which one is abelian and a &minus; 1 are non-abelian.
Optimally Small Operator Supports for Fully Parallel Thinning Algorithms
Authors: R. W. Hall
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Requirements for the support size and shape are investigated for the class of all adequate fully parallel thinning operators. Eleven pixel supports are shown to be the smallest possible supports, and the possible positions of the support pixels are shown to be well constrained. Constraints on support positions are demonstrated for operators with supports that are larger than optimal, and a sufficient test for connectivity preservation is reviewed. These results allow algorithm designers looking for small support operators to focus on a relatively small set of acceptable supports.
Aggregate Health Status: A Benchmark Index for Community Health
Authors: James F. Reed,  III, James N. Burdine, Michael Felix
Venue: Journal of Medical Systems (2003)

A qualitative review of population health assessment models used throughout the United States and Canada indicate both individual and community-level domains of health. Individual-level domains of health include health habits, education, public safety, environment, social, government, culture, and mobility. Community-level domains include the same general health domains but aggregated to the community level Aggregate Health Status (AHS). In the development of the AHS portion of our model, the dependent variable was the general health question from the Medical Outcomes Study. The remainder of the survey was partitioned into mutually exclusive individual measure subsets. A linear combination of these global variables then produces a single estimate relating the multiple domains of the broader determinants of health to health status. This global variable uniquely discriminates between the five categories of general health. This model serves as a framework and benchmark indicator that (1) provides a summary indicator of the overall health status of the population, (2) is broadly representative of populations rather than individuals, (3) is a population perspective rather than a provider perspective, and (4) emphasizes outcomes versus inputs and processes.
Functional and Topological Relations Among Banyan Multistage Networks of Differing Switch Sizes
Authors: A. Youssef, B. Arden
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Relations among banyan multistage interconnection networks (MINs) of differing switchsizes are studied. If two N*N networks W and W' have switch sizes r and s, respectively,and if r is greater than s, then W realizes a larger number of permutations than W'. Consequently, thetwo networks can never be equivalent. However, W may realize all the permutations ofW', in which case W is said to functionally cover W' in the strict sense. More generally, W is said to functionally cover W' in the wide sense if the terminals of W can be relabeled so that W realizes all the permutations of W'. Functional covering is topologically characterized, and an optimal algorithm to decide strict functional covering is developed.
Developing New Processes for COTS-Based Systems
Authors: Lisa Brownsword, Tricia Oberndorf, Carol A. Sledge
Venue: IEEE Software (2000)

As the use of commercial technology and products in systems becomes increasingly popular, application developers must develop a better understanding of the dynamic principles and processes for system creation and maintenance. Currently, they have little information on how COTS products affect existing system development processes or what new processes are needed. These authors from the Software Engineering Institute articulate the new and changed process elements for developing and maintaining COTS-based systems.
Estimating Motion and Structure from Correspondences of Line Segments between Two Perspective Images
Authors: Zhengyou Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We present in this paper an algorithm for determining 3D motion and structure from correspondences of line segments between two perspective images. To our knowledge, this paper is the first investigation of use of line segments in motion and structure from motion. Classical methods use their geometric abstraction, namely straight lines, but then three images are necessary for the motion and structure determination process. In this paper we show that it is possible to recover motion from two views when using line segments. The assumption we use is that two matched line segments contain the projection of a common part of the corresponding line segment in space, i.e., they overlap. Indeed, this is what we use to match line segments between different views. This assumption constrains the possible motion between two views to an open set in motion parameter space. A heuristic, consisting of maximizing the overlap, leads to a unique solution. Both synthetic and real data have been used to test the proposed algorithm, and excellent results have been obtained with real data containing a relatively large set of line segments.
A Reduced-Area Scheme for Carry-Select Adders
Authors: A. Tyagi
Venue: IEEE Transactions on Computers (1993)

The carry-select or conditional-sum adders require carry-chain evaluations for each block for both the values of block-carry-in, 0 and 1. The author introduces a scheme to generate carry bits with block-carry-in 1 from the carries of a block with block-carry-in 0. This scheme is then applied to carry-select and parallel-prefix adders to derive a more area-efficient implementation for both the cases. The proposed carry-select scheme is assessed relative to carry-ripple, classical carry-select, and carry-skip adders. The analytic evaluation is done with respect to the gate-count model for area and gate-delay units for time.
Outsourcing in India
Authors: Werner Kobitzsch, Dieter Rombach, Raimund L. Feldmann
Venue: IEEE Software (2001)

Drawn by a multitude of programmers and a favorable business environment, companies are increasingly looking to out-source their software development to India. After examining various possible out-sourcing modes, this article reports on a German telephone company's experience setting up a satellite operation in India.
Using DEA to Evaluate Efficiency and Formulate Policy Within a Greek National Primary Health Care Network
Authors: Athanasios I. Zavras, Georgios Tsakos, Charalabos Economou, John Kyriopoulos
Venue: Journal of Medical Systems (2002)

The purpose of this paper is to critically evaluate the relative efficiency of primary health care centers of the principal Greek public insurance provider, the Social Security Institute (IKA). The source of the efficiency data was the Statistical Unit of IKA. Using Data Envelopment Analysis, we analyzed data from 133 centers nationwide. Input variables included the number of personnel, stratified in different categories, and the number of people covered by each health center. The number of pensioners enlisted to each health care facility was used as an index of aging and vulnerability of the covered population. According to the results of the study, centers with the technological infrastructure to perform laboratory and/or radiographic examinations exhibited higher efficiency scores. In addition, centers with eligible covered populations from 10,000 to 50,000 were found as the most efficient. Health sector reforms should be planned on the basis of such analyses. If the model is supplemented with valid demographic, socioeconomic, and epidemiological data, it may become the basis for the creation of a national health care chart, matching available resources to the population and its health care needs.
Constructing Boosting Algorithms from SVMs: An Application to One-Class Classification
Authors: Gunnar Rätsch, Sebastian Mika, Bernhard Schölkopf, Klaus-Robert Müller
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We show via an equivalence of mathematical programs that a support vector (SV) algorithm can be translated into an equivalent boosting-like algorithm and vice versa. We exemplify this translation procedure for a new algorithm¿one-class leveraging¿starting from the one-class support vector machine (1-SVM). This is a first step toward unsupervised learning in a boosting framework. Building on so-called barrier methods known from the theory of constrained optimization, it returns a function, written as a convex combination of base hypotheses, that characterizes whether a given test point is likely to have been generated from the distribution underlying the training data. Simulations on one-class classification problems demonstrate the usefulness of our approach.
Absorbing Boundary Conditions of the Second Order for the Pseudospectral Chebyshev Methods for Wave Propagation
Authors: A. Gelb, Z. Jackiewicz, B. D. Welfert
Venue: Journal of Scientific Computing (2002)

In this paper we describe the implementation of one-way wave equations of the second order in conjuction with pseudospectral methods for wave propagation in two space dimensions. These equations are first reformulated as hyperbolic systems of the first order and the absorbing boundaries are implemented by an appropriate modification of the matrix of this system. The resulting matrix corresponding to one-way wave equation based on Pad&eacute; approximation has all eigenvalues in the complex negative half plane which allows stable integration of the underlying system by any ODE solver in the sense of &ldquo;eigenvalue stability.&rdquo; The obtained numerical scheme is much more accurate than the schemes obtained before which utilized absorbing boundary conditions of the first order, and is also capable of integrating the wave propagation problems on much larger time intervals than was previously possible.
Simulating a Software Engineering Apprenticeship
Authors: Ken Surendran, Helen Hays, Andrew Macfarlane
Venue: IEEE Software (2002)

Although some professions require a period of internship, residency, or apprenticeship before marking an individual as a qualified member, software engineering does not. Universities have started offering curricula in software engineering, but many continue to offer SE as a set of courses in their computer science curricula. Because the global demand for software engineers far exceeds the supply of SE graduates, CS and applied CS graduates frequently fill this gap. So, to enrich SE courses in the CS and applied CS curricula with opportunities to practice SE concepts and principles, we support an SE apprenticeship, simulated through system development projects. In this article, the authors first examine the prevailing SE body of knowledge and perspectives on SE education to construct a model consisting of knowledge areas for SE professional development. They use this model and Bloom's taxonomy to delineate knowledge areas that an apprenticeship could best handle. They then establish a framework for SE apprenticeship and use it to examine practices for simulating apprenticeships in three different academic institutions that offer CS, applied CS, or computing systems curricula. To further supplement the apprenticeship, the authors suggest using coordinated internship and co-op programs.
On partitions of discrete boxes
Authors: Noga Alon, Tom Boham, Ron Holzman, Daniel J. Kleitman
Venue: Discrete Mathematics (2002)

We prove that any partition of an n-dimensional discrete box into nontrivial sub-boxes must consist of at least 2n sub-boxes, and consider some extensions of this theorem.
A Design Flow for Micromachined Electromechanical Systems
Authors: Nicholas R. Swart
Venue: IEEE Design Test (1999)

This article presents a design flow for integrated microelectromechanical systems (MEMS), with particular focus on electromechanical single-chip devices. The flow includes steps for both sensor and circuit design, and also addresses the issues of sensor-circuit interaction. The importance of packaging in a MEMS design flow is covered. Three practical examples based on inertial-sensor technology illustrate several steps in the flow, namely the mechanical schematic, the layout simulation, and package interaction. In the case of package interaction, experimental results are presented.
A suggestion box of a different color
Authors: Alicia Ewing Towster, Sally Dorr Haerer
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Users' natural wishes for personal interaction with experienced consultants must often be unfulfilled, due to Computing Center staff limitations. Some of the inevitable frustration and alienation can be alleviated by the imaginative use of a suggestion box.