ppxscal/embedding_network huggingface dataset:
Construction of Multistep Integration Formulas for Simulation Purposes
Authors: W. Giloi, H. Grebe
Venue: IEEE Transactions on Computers (1968)

Abstract Block-oriented simulation languages are a powerful tool for solving simulation problems. A problem of major importance in simulation, however, is the choice of the integration formula to be employed in the integration block. Users of early simulation languages had no difficulty selecting a formula since these languages provided only a single formula. Advanced languages have a number of formulas available, but leave the choice to the user who does not have much to go by except the good names of the formulas. Difficulties which were encountered in the use of multistep formulas made formulas of the Runge-Kutta type more popular. Experience has shown that they are less critical with respect to stability. However, the computing time for a Runge-Kutta formula is considerably larger and for this reason multistep formulas, which include the predictor- corrector scheme, are still appealing.
Asynchronous Modular Arbiter
Authors: J. Calvo
Venue: IEEE Transactions on Computers (1986)

A practical N-user arbiter and its implementation are presented in this correspondence. Because of the asynchronous character of its input variables (request signals), the design proposed is asynchronous and keeps in mind the possibility of metastable operations. The structure of the arbiter is very simple and modular.
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
Authors: Giuseppe C. Calafiore, Fabrizio Dabbene
Venue: Automatica (Journal of IFAC) (2007)

Many robust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F@?{f(x,@d)=
The Use of Walsh Functions in the Wiener Analysis of Nonlinear Systems
Authors: A. S. French
Venue: IEEE Transactions on Computers (1974)

A powerful means of analyzing nonlinear systems is provided by the Wiener functional expansion. However, this technique has not been implemented widely in experimental situations because of the difficulties associated with measuring the kernels of the system, which constitutes the analysis problem. A new method of measuring the kernels is described here in which the Walsh functions are used as the set of orthogonal functions with which the kernels are expanded. The multiplicative properties of the Walsh functions and the fast Walsh-Fourier transform make the measurement scheme very efficient.
A Parallel Genetic Algorithm for Floorplan Area Optimization
Authors: Maolin Tang, Raymond Y. K. Lau
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it de- termines the performance, size, yield and reliability of VLSI chips. From the computational point of view, floorplan area minimization is an NP-hard problem. This paper presents a parallel genetic algorithm (GA) for floorplan area opti- mization. The parallel GA is based an island model with an asynchronous migration mechanism, and is implemented using Web services and multithreading technologies. The parallel GA is compared with a sequential GA that the par- allel GA is based on. Experimental results show that the parallel GA can produce better results than the sequential GA when they use the same amount of computing resources. In addition, since the number of islands and migration in- terval are two important parameters that directly affect the performance of island-based parallel GAs, the impact of the two parameters on the performance of the parallel GA are empirically studied in this paper.
An Efficient Software Driver Processor Implementation
Authors: Borivoje Furht, Peter Lee
Venue: IEEE Micro (1984)

This driver enables easy implementation of the Am9511 as a coprocessor in Intel 8085-based systems.
High-performance data transfer using SCTP-based compact association scheme
Authors: Hyuncheol Kim, Younghwa Kim, Kwangjoon Kim, Jinwook Chung
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

SCTP (Stream Control Transmission Protocol) is a new IETF transport protocol over the IP network. Transport protocol is responsible for reliable delivery of a message form a host to another host. We proposed and implemented an efficient file transfer system using the SCTP multiple file transfer and modified STCP congestion control mechanism to guarantees a stable data transfer with multi-streaming and to solve the problems such as server overloading due to multiple connection and the HOL (Head Of Line) blocking that the existing TCP-based file transfer. The result shows that proposed system reduces transmission latency for huge data and improves the performance.
MBF: a Real Matrix Bloom Filter Representation Method on Dynamic Set
Authors: Jiacong Wang, Mingzhong Xiao, Yafei Dai
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Bloom Filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries, which uses an m-bit array to represent a data set. In order to support representing dynamic set, dynamic bloom filter (DBF) and split bloom filter (SBF) have been developed. Both DBF and SBF can support concisely representation and approximate membership queries of dynamic set instead of static set. SBF declares that it uses an s×m bit matrix that consists of s bloom filters to represent a dynamic set, so DBF dose. But in fact, both the two bloom filters are not matrix representation method at all. They are just a set of s bloom filters whose length is m, and they have got a departure from the original idea of bloom filter: the constant query time cost. This paper points out the fact, and then introduce a truly matrix representation method of bloom filter to represent a dynamic set. We call it the Matrix Bloom Filter (MBF). Then, we will analysis the algorithm of MBF and study the average time complexity and the false positive probability.
Low-Cost Tape Devices
Authors: L. C. Hobbs
Venue: Computer (1976)

Session II of the 1975 Lake Arrowhead Workshop on "Advances in Storage for Minis and Micros" was devoted to low-cost tape devices. This article presents a summary of the discussions in that session. No attempt is made to present an all-inclusive coverage of low-cost tape devices, nor necessarily to present a balanced picture, but rather to present the actual material discussed at the workshop. As a result, several types of low-cost tape devices presently on the market are not covered. However, the unique gathering of individual practitioners in the field made this session a lively one, and the article that grew out of it represents a collection of insights that are not likely to be found elsewhere.
PRIM: A Fast Matrix Transpose Method
Authors: G. C. Goldbogen
Venue: IEEE Transactions on Software Engineering (1981)

An efficient algorithm called PRIM is proposed for transposing an arbitraxy R ×C matrix which is too large to be stored in its entirety in working memory and which instead is stored by rows on disk. PRIM facilitates the execution of numerical matrix algorithms which operate both by rows and by columns.
The Global Synthetical Processing of Network Security Events
Authors: Yang-ming Ma, Zhi-tang Li, Jie Lei, Li Wang, Dong Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper presents the global synthetical processing of network security events in Network Security Intelligent Centralized Management System, which aims to build up an integrated management platform for security events management. The system framework and many processing methods are introduced in this paper. The experiment has shown that the processing process can efficiently reduce the amount of security events and improve the quality of security events.
Ensemble classifier for protein fold pattern recognition
Authors: Hong-Bin Shen, Kuo-Chen Chou
Venue: Bioinformatics (2006)

Motivation: Prediction of protein folding patterns is one level deeper than that of protein structural classes, and hence is much more complicated and difficult. To deal with such a challenging problem, the ensemble classifier was introduced. It was formed by a set of basic classifiers, with each trained in different parameter systems, such as predicted secondary structure, hydrophobicity, van der Waals volume, polarity, polarizability, as well as different dimensions of pseudo-amino acid composition, which were extracted from a training dataset. The operation engine for the constituent individual classifiers was OET-KNN (optimized evidence-theoretic k-nearest neighbors) rule. Their outcomes were combined through a weighted voting to give a final determination for classifying a query protein. The recognition was to find the true fold among the 27 possible patterns. Results: The overall success rate thus obtained was 62% for a testing dataset where most of the proteins have <25% sequence identity with the proteins used in training the classifier. Such a rate is 6–21% higher than the corresponding rates obtained by various existing NN (neural networks) and SVM (support vector machines) approaches, implying that the ensemble classifier is very promising and might become a useful vehicle in protein science, as well as proteomics and bioinformatics. Availability: The ensemble classifier, called PFP-Pred, is available as a web-server at for public usage. Contact: lifesci-sjtu@san.rr.com Supplementary information: Supplementary data are available on Bioinformatics online.
Engineering Education A Status Report on the CAD/CAM Revolution
Authors: Larry Richards
Venue: IEEE Computer Graphics and Applications (1985)

How complete is the effort to integrate computer graphics and CAD/CAM into engineering education? What directions is the effort taking? Are they optimal? Satisfactory? 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
Comments on "A Method for Representing Data Items of Unlimited Length in a Computer Memory"
Authors: R. N. Horspool
Venue: IEEE Transactions on Software Engineering (1982)

In the above paper,1Baber describes a scheme for representing data items with unlimited length. We would like to argue that this scheme is not very different from other published schemes and that his scheme is not obviously useful for the proposed application.
A New Architecture of XCS to Approximate Real-Valued Functions Based on High Order Polynomials Using Variable-Length GA
Authors: Ali Hamzeh, Adel Rahmani
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

XCSFG is a new version of XCSF with the ability of computing the environmental payoff using Genetic Algorithm. In the first version of XCSFG, this computation was done by evolving coefficients of the associated linear payoff functions. In this paper, we extend XCSFG to approximate the payoff functions in the form of higher order polynomials. Our newly proposed method uses GA with variable-length chromosome with real-valued representation. This new version of XCSFG is called XCSFG, the Continuous version or XCSFGC. It is applied to some benchmark problems and is compared with the original XCSF and its newly introduced extensions.
A fuzzy DEA/AR approach to the selection of flexible manufacturing systems
Authors: Shiang-Tai Liu
Venue: Computers and Industrial Engineering (2008)

Flexible Manufacturing System (FMS) offers opportunities for manufacturers to improve their technology, competitiveness, and profitability through a highly efficient and focused approach to manufacturing effectiveness. Data envelopment analysis (DEA) has been utilized as a multiple criteria tool for evaluation of FMSs. The concept of the assurance region (AR) is restricting the ratio of any two weights to some range to avoid the evaluated alternatives from ignoring or relying too much on any criterion in evaluation. In this paper, we develop a fuzzy DEA/AR method that is able to evaluate the performance of FMS alternatives when the input and output data are represented as crisp and fuzzy data. Based on Zadeh's extension principle, a pair of two-level mathematical programs is formulated to calculate the lower and upper bounds of the fuzzy efficiency score of the alternatives. We transform this pair of two-level mathematical programs into a pair of conventional one-level DEA/AR method to evaluate the FMS performance. An example illustrates the application of the proposed methodology.
The scalability of AspectJ
Authors: Arjun Singh, Gregor Kiczales
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

To assess the scalability of AspectJ, we refactored concerns that crosscut over half of the plug-ins that comprise the Eclipse IDE. Eclipse is a suitable candidate for furthering other scalability studies of AspectJ because it is not only large, but also has an additional modularization mechanism typical of large systems that introduces new complexities for defining advice and aspects. We evaluated our AO refactored system quantitatively by examining changes in execution time and memory usage, as well as qualitatively by examining changes in scattering, coupling, and abstractions. We conclude that AspectJ scales well in that it can be used in large systems, but that the system may require modifications to the build and class loading procedures in order to cope with defining advice that cross system boundaries.
Reduced-Order Wide-Band Interconnect Model Realization using Filter-Based Spline Interpolation
Authors: Arthur Nieuwoudt, Mehboob Alam, Yehia Massoud
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In the paper, we develop a systematic methodology formodeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolation, we are able to avoid the numerical problems associated with global polynomial fitting and generate higher order systems to model simulated or measured wideband frequency response data. We reduce the complexity of the generated systems using a data point pruning algorithm and by applying model order reduction based on balanced truncation. The methodology provides sub-stantially greater accuracy than global polynomial approximation while only having O(n) growth in model complexity.
Automating the Selection of Implementation Structures
Authors: L. A. Rowe
Venue: IEEE Transactions on Software Engineering (1978)

An approach to automating the selection of implementations for the data representations used in a program is presented. Formalisms are developed for specifying data representations and implementation structures. Using these formalisms, algorithms are presented which will recognize the use in a program of known data representations (e. g., stacks, queues, lists, arrays, etc.) so that alternative implementations can be retrieved from a library and which will, for those representations not recognized, generate alternative implementations with a wide range of space-time tradeoffs. Experience with using these algorithms indicates they are reasonably successful, although there are several problems that must be solved before automatic implementation selection systems will be practical.
The Institutional Effect on E-learning in Hong Kong
Authors: Eric K. W. Lau
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The institutional effect is used to explain and predict MBA students' decisions to adopt e-learning in their studies. A composite model including four constructs, namely, perceived usefulness, perceived ease of use, sense of popularity and convenience, were formed and tested in the empirical study. This study found that "normatively appropriate" and "taken-for-granted structure" of institutions were the most important principles for adult students when making elearning decisions.
Trusted computing challenges
Authors: Leendert van Doorn
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

Trusted computing, which most people take to be synonymous with TCG related technologies, has been commercially available since 1999 (back then it was called TCPA). Still, even after 8 years, its adoption has been slow and the TCG features are underutilized. The question is why? Initially the TCG technology had to overcome a lot of misconceptions and privacy concerns, but leaving these aside, the TCG-technology has also many technical challenges that have yet to be resolved. For example, attestation is a very powerful concept but is fraught with problem A key problem with attestation is scalability. A straight forward attestation implementation such as IMA for Linux does not scale. IMA captures all the measurements for all the applications on a running system and then burdens the recipient with verifying the attestation statements. With many different versions of operating systems, kernel modules, libraries and applications this mechanism quickly becomes unpractical. Even property-based attestation, which makes the consumption of attestation statements a lot more palatable for the receiver, still has the scaling problem of mapping all these changing components to a single property This is just one of the many open problems trusted computing still faces. In this keynote I will discuss what I consider to be the main open challenges and I will present my vision of how commercially viable trusted systems need to evolve.
A Modification to the SHR-Optimal State Assignment Procedure
Authors: P. S. Noe
Venue: IEEE Transactions on Computers (1974)

In a recently published article, Story et al. detailed an organized search process leading to the optimum state assignment for a synchronous sequential machine. Their procedure begins with the calculation of a set of lower bounds (minimum numbers) on the costs of the excitation logic required for each possible distinct partial state assignment.
Author's Reply2
Authors: P. N. Marinos
Venue: IEEE Transactions on Computers (1975)

I wish to thank Metze et al. for having identified certain sources of difficulty with the algorithm given in my paper.1 The notion of "partial Boolean difference" introduced in my paper and on which the algorithm was based was unfortunately restricted to single path sensitization thus resulting in the well-known limitations of such an approach. The concept of partial Boolean difference, however, is quite general and directly applicable to multiple path sensitization. Such Boolean differences are known as multiple partial Boolean differences, and their utility has been previously recognized in test-code generation [1], [2].
The ARC Network: A Case StudY
Authors: M. C. Paulk
Venue: IEEE Software (1985)

Designed around the VAX and developed for ballistic missile defense systems, this network offers error-free message passing and can absorb overhead unacceptable to general-purpose networks.
The Digital Computer as a Tool in an Intensive Care Unit
Authors: K. M. Kempner, W. L. Risso, D. Syed
Venue: Computer (1972)

Digital computers have become valuable assistants in the intensive care units of many American hospitals. Computerized patient monitoring systems offer the potential for improved patient care by aiding in the early identification of trends in monitored physiologic para- meters and by relieving the medical staff of many of the repetitive clerical tasks which occupy their time. Advanced monitoring systems further assist by initiating blood replacement and drug infusions under carefully controlled conditions. Consideration of several operational systems in the United States supports these concepts. A state-of-the- art intensive care unit monitoring system, currently being implemented at the National Institutes of Health, is described in depth.
An Automatic Test-Generation System for Large Digital Circuits
Authors: Shigehiro Funatsu, Masato Kawai
Venue: IEEE Design Test (1985)

A new test-generation system (FUTURE) for large digital circuits (more than 10K gates) is based on a nine-valued FAN algorithm.Fault simulation adopts a concurrent simulation adopts a concurrent simulation technique. The system consists of four majormodules: fault modeling, random pattern generation, algorithmic pattern generation, and fault simulation. The system can bea powerful CAD tool and effectively generate test patterns for large sequential circuits with Scan Path.
The Logical Access Path Schema of a Database
Authors: N. Roussopoulos
Venue: IEEE Transactions on Software Engineering (1982)

A new schema which models the usage of the logical access paths of the database is proposed. The schema models all database activities (i.e., retrievals and updates), and integrates their logical access paths by recognizing common subpaths and increasing the "weight" of the shared subpaths. The logical access path schema provides a comprehensive picture of the logical access paths, and the cumulative usage of the shared subpaths and/or intermediate results. The schema serves a dual purpose. Firstly, it is used as a model of the access requirements during the database design, and secondly, as the basis for optimization during the operation of the database.
RAIN: A Reliable Wireless Network Architecture
Authors: Chaegwon Lim Haiyun Luo, Chong-ho Choi
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Despite years of research and development, pioneering deployments of multihop wireless networks have not proven successful.The performance of routing and transport is often unstable due to contention-induced packet losses, especially when the networkis large and the offered load is high. In this paper we propose RAIN, a reliable wireless network architecture for large-scalemultihop wireless networks. A RAIN network enforces contention control by limiting the queue length at intermediate wirelessrouters to the minimum. To keep the queue short a RAIN network enforces congestion control through in-network implicit back-pressure.RAIN congestion control is built on wireless datalink layer mechanisms, e.g., mandatory per-frame acknowledgement and inter-framebackoff in popular CSMA/CA wireless transceivers, therefore very efficient and effective compared with those defined at thenetwork or transport layer for the wired Internet. As a result of the built-in contention and congestion control, RAIN presentsthe end hosts a highly reliable network service model, even more reliable than that of the wired Internet. The end hosts onlyneed to deal with packet losses due to router or routing failures. Therefore, the transport protocol can be significantlysimplified. This is in stark contrast to the existing approach of adding more and more complexity to adapt TCP for multihopwireless networks. We propose the details of RAIN datalink layer protocol, and a simple transport protocol at the end hosts.
Reviews
Authors: Eric Weiss Gerald Friedland, Margarita Esponda
Venue: IEEE Annals of the History of Computing (2007)

Book reviews of Carly Fiorina's Tough Choices: A Memoir; James W. Cortada's The Digital Hand, Volume 2: How Computers Changed the Work of American Financial, Telecommunications, Media, and Entertainment Industries; and Joel N. Shurkin's Broken Genius--The Rise and Fall of William Shockley, Creator of the Electronic Age.
Smooth indium zinc oxide film prepared by sputtering a In2O3: ZnO=95:5 target
Authors: Shang-Chou Chang, Ming-Hua Shiao
Venue: Microelectronics Journal (2007)

Indium zinc oxide (IZO) films with surface roughness Ra