ppxscal/embedding_network huggingface dataset:
A Microprocessor Laboratory for a University Environment
Authors: B. J. Carey
Venue: Computer (1977)

A microprocessor-based laboratory facility is being developed as part of the computer science program in the Department of Electrical Engineering and Computer Science of the University of Connecticut. This laboratory is structured to support graduate research in which the microprocessor will play a role, provide a means for introducing microprocessor-based material into the undergraduate computer science and electrical engineering curriculums, and be a medium whereby the untrained computer user who wishes to utilize a microcomputer may do so in a convenient manner. The laboratory is centered on a dual PDP-11 minicomputer system which provides a high level of software and hardware support to the microprocessor activity. This permits software development to take place in a comfortable, real-time environment on a machine suited to such a task plus providing hardware support not inherent in the microcomputer itself. Since a broad spectrum of people will use this facility, the involvement with the microprocessors and related devices must cover a broad spectrum of activities. This will range from new, designs starting at the device level to applications which simply integrate complex off-the-shelf hardware and software functions. To support this the laboratory provides a means to reliably breadboard a prototype of a new microcomputer system or subsystem. This would be done by an individual who is conversant with the intimate details of a given microprocessor device line and is knowledgeable in both hardware and software aspects of digital systems.
Identity-based ring signatures from RSA
Authors: Javier Herranz
Venue: Theoretical Computer Science (2007)

Shamir proposed in 1984 the first identity-based signature scheme, whose security relies on the RSA problem. A similar scheme was proposed by Guillou and Quisquater in 1988. Formal security of these schemes was not argued and/or proved until many years later [D. Pointcheval, J. Stern, Security arguments for digital signatures and blind signatures, Journal of Cryptology 13 (3) (2000) 361-396; Y. Dodis, J. Katz, S. Xu, M. Yung, Strong key-insulated signature schemes, in: Proceedings of PKC'03, in: LNCS, vol. 2567, Springer-Verlag, 2002, pp. 130-144; M. Bellare, C. Namprempre, G. Neven, Security proofs for identity-based identification and signature schemes, in: Proceedings of Eurocrypt'04, in: LNCS, vol. 3027, Springer-Verlag, 2004, pp. 268-286]. Taking the Guillou-Quisquater scheme as the starting point, we design and analyze in this work ring signature schemes and distributed ring signature schemes for identity-based scenarios whose security is based on the hardness of the RSA problem. These are the first identity-based ring signature schemes which do not employ bilinear pairings. Furthermore, the resulting schemes satisfy an interesting property: the real author(s) of a ring signature can later open the anonymity and prove that he is actually the person who signed the message.
Learning to Reach Optimal Equilibrium by Influence of Other Agents Opinion
Authors: Dennis Barrios-Aranibar, Luiz Marcos Garcia Goncalves
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

In this work authors extend the model of the reinforcement learning paradigm for multi-agent systems called "Influence Value Reinforcement Learning" (IVRL). In previous work an algorithm for repetitive games was proposed, and it outperformed traditional paradigms. Here, authors define an algorithm based on this paradigm for using when agents has to learn from delayed rewards, thus, an influence value reinforcement learning algorithm for two agents stochastic games. The IVRL paradigm is based on social interaction of people, specially in the fact that people communicate each other what they think about their actions and this opinion has some influence in the behavior of each other. A modified version of Q-Learning algorithm using this paradigm was constructed. The so called IVQ-Learning algorithm was implemented and compared with versions of Q-Learning for independent learning and joint action learning. Our approach shows to have more probability to converge to an optimal equilibrium than IQ-Learning and JAQ-Learning algorithms, specially when exploration increases.
Yield-aware analog integrated circuit optimization using geostatistics motivated performance modeling
Authors: Guo Yu, Peng Li
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Automated circuit optimization is an important component of complex analog integrated circuit design. Today's analog designs must be optimized not only for nominal performance but also for robustness in order to maintain a reasonable yield with highly scaled VLSI technologies. The complex nature of analog/mixed-signal systems, however, makes this yield-aware analog circuit optimization extremely difficult and costly. In this paper, we adopt a Geostatistics motivated approach (i.e. Kriging model) for efficient extraction of yield-aware Pareto front performance models for analog circuits. An iterative search based optimization approach is proposed to efficiently seek optimal performance tradeoffs under yield constraints in high-dimensional design parameter and process variation spaces. Our experiments confirm that the generated yield-aware Pareto fronts are accurate and the optimization procedure is very efficient. The latter is achieved by the well controlled iterative update scheme in the presented techniques which avoids an excessive number of time consuming transistor-level simulations.
Statechart Features and Pre-Release Defects in Software Maintenance
Authors: Jeanette Heidenberg, Andreas Nals, Ivan Porres
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Statecharts is a design notation to model reactive systems that is part of the Unified Modeling Language (UML) and it is commonly used in the automotive and telecommunication software industry. In this paper we present a study of how the use of some statechart features correlate to the number of pre-release defects in the maintenance of large systems. We discuss possible causes for these correlations and provide some advice to both UML practitioners and to designers of new visual design languages.
A Current-based Method for Short Circuit Power Calculation under Noisy Input Waveforms
Authors: Hanif Fatemi, Shahin Nazarian, Massoud Pedram
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

An accurate model is presented to calculate the short circuit energy dissipation of logic cells. The short circuit current is highly dependent on the input and output voltage values. Therefore the actual shape of the voltage signal waveforms at the input and output of the cell should be considered in order to precisely calculate the short circuit energy dissipation. Previous approaches such as the approximation of the crosstalk induced noisy waveforms with saturated ramps can lead to short circuit energy estimation errors as high as an order of magnitude for a minimum sized inverter. To resolve this shortcoming, a current-based logic cell model is utilized, which constructs the output voltage waveform for a given noisy input waveform. The input and output voltage waveforms are then used to calculate the short circuit current, and hence, short circuit energy dissipation. A characterization process is executed for each logic cell in the standard cell library to model the relevant electrical parameters e.g., the parasitic capacitances and nonlinear current sources. Additionally, our model is capable of calculating the short circuit energy dissipation caused by glitches in VLSI circuits, which in some cases can be a key contributor to the total circuit energy dissipation. Experimental results show an average error ofabout 1% and a maximum error of 3% compared to SPICE for different types of logic cells under noisy input waveforms including glitches while the runtime speedup is up to a factor of 16,000.
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
Authors: H. S. Stone
Venue: IEEE Transactions on Software Engineering (1977)

In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive interprocessor communication while taking advantage of specific efficiencies of some processors in executing some program modules. In this paper we show that this program module assignment problem can be solved efficiently by making use of the well-known Ford-Fulkerson algorithm for finding maximum flows in commodity networks as modified by Edmonds and Karp, Dinic, and Karzanov. A solution to the two-processor problem is given, and extensions to three and n-processors are considered with partial results given without a complete efficient solution.
Structured Code via Stack Machine
Authors: R. Bigelow
Venue: Computer (1975)

Structured code has been restricted to the use of certain control statements, such as IF, CASE, and WHILE. The absence of a GOTO implies that control enters and leaves regions of code in a LIFO manner. Hence, the control environment can be maintained by a stack of return addresses; and call and return instructions, rather than branches, can be used to transfer control in the machine. The SDL S-machine follows this principle. 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
CSDL: A Conceptual Schema Definition Language for the Design of Data Base Applications
Authors: N. Roussopoulos
Venue: IEEE Transactions on Software Engineering (1979)

A language to support the incremental design of the conceptual schemata of data bases is presented. Abstractions are expressed in terms of high-evel constructs and operations on these abstractions allow the definition of other abstractions. Both abstractions and operations on them are totally independent from the underlying internal representation of the schema, which is created consistently by applying the operators of the language. In addition, the language offers a. number of support facilities for type checking of relationships and graphical displays of the conceptual schemata for easier understanding.
Biresidue Error-Correcting Codes for Computer Arithmetic
Authors: T. R. N. Rao
Venue: IEEE Transactions on Computers (1970)

In an earlier paper [11] a scheme for detecting errors in ADD, COMPLEMENT, SHIFT, and ROTATE operations using a residue check circuitry was presented. A scheme for error location and correction in those operations is derived by a suitable application of a code called biresidue arithmetic code described here. Any single error position can be located and also corrected by use of two residue checkers which work separately and in parallel with the arithmetic unit. The estimated cost of redundancy is approximately the same as that required for duplication of the arithmetic unit.
Computing with Impure Numbers: Automatic Consistency Checking and Units Conversion Using Computer Algebra
Authors: D. R. Stoutemyer
Venue: IEEE Transactions on Software Engineering (1977)

This note shows how computer-algebra systems may be used to include symbolic physical units in computer calculations, with automatic detection of dimensionally-inhomogeneous formulas and automatic conversion of inconsistent units in a dimensionally-homogeneous formula. Inhomogeneity errors are a prevalent type that is undetected in traditional programming languages, and the user is relieved of the tedious, error-prone units-conversion process.
System R: A Relational Data Base Management System
Authors: M. M. Astrahan
Venue: Computer (1979)

A relational approach makes this experimental data base management system unusually easy to install and use. Some of the decisions made in System R design in order to enhance usability also offer major bonuses in other areas.
New Particle Swarm Optimization Algorithm Incorporating Reproduction Operator for Solving Global Optimization Problems
Authors: Millie Pant, Radha Thangaraj, Ajith Abraham
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper presents a new variant of Basic Particle Swarm Optimization (BPSO) algorithm named QI-PSO for solving global optimization problems. The QI-PSO algorithm makes use of a multiparent, quadratic crossover/reproduction operator defined by us in the BPSO algorithm. The proposed algorithm is compared it with BPSO and the numerical results show that QIPSO outperforms the BPSO algorithm in all the sixteen cases taken in this study.
Special Feature Some Considerations in the Design of Mainframe Processors with Microprocessor Technology
Authors: G. Tjaden
Venue: Computer (1979)

Implementing mainframes with multimicroprocessors entails an extra cost for main memory. This often-overlooked phenomenon is analyzed here for several mainframe systems.
Efficiently Mining Maximal Frequent Itemsets Based on Digraph
Authors: Zhibo Ren, Qiang Zhang, Xiujuan Ma
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

We present MFIMiner, a new algorithm for mining maximal frequent itemsets. The algorithm has a pre- processing phase in which a digraph is constructed. The digraph represents the set of the frequent 2-itemsets which is the key issue of the performance of the data mining. Then the search for maximal frequent itemsets is done in the digraph. Experiments show that the algorithm is efficient not only to dense data, but to sparse data.
A Pseudospectral Penalty Scheme for 2D Isotropic Elastic Wave Computations
Authors: Ko-An Feng, Chun-Hao Teng, Min-Hung Chen
Venue: Journal of Scientific Computing (2007)

In this paper, we present a pseudospectral scheme for solving 2D elastic wave equations. We start by analyzing boundary operators leading to the well-posedness of the problem. In addition, equivalent characteristic boundary conditions of common physical boundary conditions are discussed. These theoretical results are further employed to construct a Legendre pseudospectral penalty scheme based on a tensor product formulation for approximating waves on a general curvilinear quadrilateral domain. A stability analysis of the scheme is conducted for the case where a straight-sided quadrilateral element is used. The analysis shows that, by properly setting the penalty parameters, the scheme is stable at the semi-discrete level. Numerical experiments for testing the performance of the scheme are conducted, and the expected p- and h-convergence patterns are observed. Moreover, the numerical computations also show that the scheme is time stable, which makes the scheme suitable for long time simulations.
Trajectory Optimization for Ship Navigation Safety Using Genetic Annealing Algorithm
Authors: Xide Cheng, Zuyuan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents a new space model for collision avoidance, ship dynamic collision avoidance space model (SDCASM). The model reserves all information for collision avoidance and the speed of collision avoidance calculation would be quicker. To verify the validity of the model, an enhanced optimization algorithm, genetic annealing algorithm (GAA), is applied to trajectory optimization for collision avoidance based on the SDCASM. At last, model and algorithm that put forward in this paper is applied to inland waterway ship collision avoidance. And several simulations are implemented in curve sea-route of inland waterway. As a result of this study, it could offer a safe and economic trajectory for ship avoiding collision towards establishing the inland waterway ship automatic collision avoidance system.
Data compression in Oracle
Authors: Meikel Poess, Dmitry Potapov
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The Oracle RDBMS recently introduced an innovative compression technique for reducing the size of relational tables. By using a compression algorithm specifically designed for relational data, Oracle is able to compress data much more effectively than standard compression techniques. More significantly, unlike other compression techniques, Oracle incurs virtually no performance penalty for SQL queries accessing compressed tables. In fact, Oracle's compression may provide performance gains for queries accessing large amounts of data, as well as for certain data management operations like backup and recovery. Oracle's compression algorithm is particularly well-suited for data warehouses: environments, which contains large volumes of historical data, with heavy query workloads. Compression can enable a data warehouse to store several times more raw data without increasing the total disk storage or impacting query performance.
Mutation Analysis for Security Tests Qualification
Authors: Tejeddine Mouelhi, Yves Le Traon, Benoit Baudry
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

In this paper, we study how mutation analysis can be adapted to qualify test cases aiming at testing a security policy. The objective is to make test cases efficient to reveal erroneous implementations of a security policy. The notion of security policy testing is studied and mutation operators are defined in relation with the security rules. To make the approach applicable in practice we discus and empirically rank the security mutation operators from the most to the least difficult to kill. The empirical study is a library software, which is implemented with a typical 3-tier architecture.
A Ubiquitous Computing Network Framework for Assisting People in Urban Areas
Authors: Minsoo Lee, Yoonsik Uhm, Zion Hwang, Yong Kim, Joohyung Jo, Sehyun Park
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper presents a framework to address the combination of ubiquitous computing interests as an Intelligent Assisting Location-Aware Service and development of its hardware and software systems. In our real testbed, the system can dynamically localize the areas of interest and adapt to changes in the ubiquitous intelligence landscape.
The Psychology of Electronic Test
Authors: Scott Davidson, Helen Davidson
Venue: IEEE Design Test (2007)

Designers, DFT engineers, and test engineers make many choices as part of their jobs. Although we might think these choices are made purely on the basis of data, in reality they are influenced by psychological factors. This article describes some of these psychological factors and suggests that studying these factors can lead to better decision making.
Guest Editor's Introduction: Getting More Out of Test
Authors: Anne Gattiker
Venue: IEEE Design Test (2007)

The 2006 IEEE International Test Conference (ITC) focused on the theme "Getting More Out of Test." This means ensuring product quality and reliability as cost efficiently as possible. In today's market environment, it also means taking test beyond its traditional role of separating good products from bad. The three articles in this special section, all written by well-received ITC 2006 authors, address ways to get more out of test. The first two articles provide specific examples of techniques for addressing the newly important diagnosis and debugging functions of test. The third article addresses test decision making more generally, and specifically suggests that exploring the psychology that underlies the decisions made by designers, DFT engineers, and test engineers could eventually help to get more out of test.
MARS: selecting basis functions and knots with an empirical Bayes method
Authors: Wataru Sakamoto
Venue: Computational Statistics (2007)

An empirical Bayes method to select basis functions and knots in multivariate adaptive regression spline (MARS) is proposed, which takes both advantages of frequentist model selection approaches and Bayesian approaches. A penalized likelihood is maximized to estimate regression coefficients for selected basis functions, and an approximated marginal likelihood is maximized to select knots and variables involved in basis functions. Moreover, the Akaike Bayes information criterion (ABIC) is used to determine the number of basis functions. It is shown that the proposed method gives estimation of regression structure that is relatively parsimonious and more stable for some example data sets.
Research of Directed Network Capacity Expansion Based on Spanning Tree Diagram
Authors: Kaihua Xu, Yuhua Liu, Hao Huang, Haiyan Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper gives a mathematical description of the directed network capacity definitions and theorems of computing capacities towards the network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the directed network capacities based on spanning tree diagram and even an advanced optimization algorithm. In addition, it discusses network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of directed network with limited costs is given, whose feasibility and process are illustrated via examples.
AIDA: an adaptive immersive data analyzer
Authors: Mehdi Sharifzadeh, Cyrus Shahabi, Bahareh Navai, Farid Parvini, Albert A. Rizzo
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

In this demonstration, we show various querying capabilities of an application called AIDA. AIDA is developed to help the study of attention disorder in kids. In a different study [1], we collected several immresive sensory data streams from kids monitored in an immersive application called the virtual classroom. This dataset, termed immersidata is used to analyze the behavior of kids in the virtual classroom environment. AIDA's database stores all the geometry of the objects in the virtual classroom environment and their spatio-temporal behavior. In addition, it stores all the immersidata collected from the kids experimenting with the application. AIDA's graphical user interface then supports various spatio-temporal queries on these datasets. Moreover, AIDA replays the immersidata streams as if they are collected in real-time and on which supports various continuous queries. This demonstration is a proof-of-concept prototype of a typical design and development of a domain-specific query and analysis application on the users' interaction data with immersive environments.
Decoupling and iterative approaches to the control of discrete linear repetitive processes
Authors: B. Sulikowski, K. Gałkowski, E. Rogers, D. H. Owens
Venue: Multidimensional Systems and Signal Processing (2007)

This paper reports new results on the analysis and control of discrete linear repetitive processes which are a distinct class of 2D discrete linear systems of both systems theoretic and applications interest. In particular, we first propose an extension to the basic state-space model to include a coupling term previously neglected but which arises in some applications and then proceed to show how computationally efficient control laws can be designed for this new model.