ppxscal/embedding_network huggingface dataset:
The effects of tuning time in bandwidth-limited optical broadcast networks
Authors: M. Azizoglu, R. A. Barry, A. Mokhtar
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

We consider the effects of tuning delay in optical broadcast networks. We show that for off-line scheduling these effects are small even if the tuning time is as large as the packet duration. In particular, we consider scheduling of random traffic with tunable transmitters and fixed-tuned receivers. We provide a lower bound to the completion time of any off-line schedule with an arbitrary number of wavelengths. We then describe a near-optimal schedule which is based on the principle of having idle transmitters tune to wavelengths just-in-time to start their transmissions. Stability and capacity issues in the transmission of real-time traffic are considered. We show that the scheduling problem admits a single stable equilibrium point, and point out how the traffic capacity of a broadcast network can be reached. We also consider the implications in connection-oriented networks.
Block Factorizations on a Cluster of RS/6000s
Authors: Greg Henry, Adolfy Hoisie
Venue:  (1992)

This paper discusses optimizing computational linear algebra algorithms on a ring cluster of IBM RS/6000s. We offer the results of a block Cholesky factorization and the underlying BLAS to demonstrate the advantage of using blocking algorithms on such architectures. A thorough analysis of the complexities of the problem is provided. Different communication protocols, serial versus parallel execution, and optimization of data traffic is explored. We provide insight into some of the techniques we have observed in exploiting this particular design. The implementations demonstrate that this important architecture can be utilized effectively for sufficiently large dense matrix computations.
Allowing cycle-stealing direct memory access I/O concurrent with hard-real-time programs
Authors: Tai-Yi Huang, J. W.-S. Liu, Jen-Yao Chung
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Hard-real-time schedulability analysis is carried out based on the assumption that the worst-case execution time (WCET) of each task is known. Cycle-stealing Direct Memory Access (DMA) I/O steals bus cycles from an executing program and prolongs the execution time of the program. Because of the difficulty in bounding the interference on the executing program, cycle-stealing DMA I/O is often disabled in hard-real-time systems. This paper presents an analytical method for bounding the WCET of a program executing concurrently with cycle-stealing DMA I/O. This is an extension of our previous work which bounded the WCET of a straight-line sequence of instructions when cycle-stealing operations are allowed. We demonstrate the effectiveness of our method with experiments on several programs.
Automatic Diagnoses for Properly Stratified Knowledge-Bases
Authors: Ofer Arieli, Arnon Avron
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We present a mechanism for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing so automaticly. This method is nonmonotonic and paraconsistent. It is particularly useful for making diagnoses on faulty devices.
The Integration of Control & Information System by Open Autonomous Decentralized System Architecture and its Application for Distributed Manufacturing System
Authors: Hiroshi Wataya, Keijirou Hayashi, Takeiki Aizono, Junichi Toyouchi, Tamio Iizuka, Satoru Shibao, Masaru Omura, Masaharu Oku
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Under the recent severe economic situation, computer system of companies have to produce new products or to supply new services flexibly to meet changing customers' demands. To realize flexible computer system, the system should be able to expand and modify its software as well as hardware rapidly. Moreover the companies have been tackling Business Process Re-engineering (BPR) to share various kinds of information among different departments, for quick response to the consumers' needs and cost reduction. Open ADS architecture that is a new control & information system architecture, is proposed to fulfill the flexibility of system. This paper introduces practical manufacturing system realized on the platform. These system are developed based on Hi-Cell concept that is defined as an assembly of autonomies called Homogeneous Max Intelligent Cells (HIC). In the system, techniques for resumption have been applied, and the effectiveness of it has been evidenced.
Noise Detection and Cleaning by Hypergraph Model
Authors: Alain Bretto, Hocine Cherifi
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper introduces a new algorithm for visual reconstruction of digital images, which have been corrupted by mixed noise. From an image hypergraph model, we introduce a combinatorial definition of noisy data. A detection procedure is used to classify the hyperedges either as noisy or clean data. Similar to other techniques, the proposed algorithm uses then an estimation procedure to remove the effects of the noise from image data. Numerical simulations demonstrate that this algorithm suppress the effect of the noise while preserving the edges with a high degree of accuracy at a relatively low computational cost.
A design equation for predicting the shear strength of short beams
Authors: P. G. Bakir, M. H. Boduroglu
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The shear resistance of beams subjected to concentrated loads varies dramatically with the shear span/effective depth ratio (a/d). The aim of this paper is to present a simple design equation that predicts the shear strength of short beams without shear reinforcement. Short beams are defined as beams that have a/d ratios higher than 1 and less than 2. The proposed design equation is applied on an experimental database consisting of short beams without shear reinforcement and the results show that the design equation gives accurate predictions of the shear strength of short beams with minimal standard deviation.
Enemy at the gate: threats to information security
Authors: Michael E. Whitman
Venue: Communications of the ACM (2003)

A firm can build more effective security strategies by identifying and ranking the severity of potential threats to its IS efforts.
Electoral Voting Protocol - A Quorum-Based Approach for Replica Control
Authors: Cheng-Hong Cho, Shi-Hong Lin
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Data replication is an important technique in distributed system. Most replication techniques are quorum-based approaches. These approaches employ logical structures or mathematical methods to solve the consistent problem of data replication. They attempt to get smaller quorum size, higher availability, and better loading balance. However, most of them have some of the following disadvantages: (1) the load distribution is unbalance. (2) These methods do not applied to any arbitrary number of sites. This paper presents a new approach called electoral voting protocol, an approach that imitates American Presidential Election. It is based on a circular numbering system. This protocol is symmetric that every site in the system bears the same responsibility. In addition, it is applicable to any arbitrary number of sites.
MPI-Video Infrastructure for Dynamic Environments
Authors: J. E. Boyd, E. Hunter, P. H. Kelly, L.-C. Tai, C. B. Phillips, R. C. Jain
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

We describe an infrastructure for multiple perspective interactive video (MPI-Video) systems. An MPI-Video system assimilates data from multiple disparate sensors, allowing a user to interact with them in a meaningful way. At the heart of an MPI-Video system is an environment model (EM) that both assimilates data from multiple sensors and acts as an information server to clients. A collection of strongly-coupled dynamic state estimation algorithms does the assimilation. Results show that our infrastructure is easy to configure, easy to extend, and is effective at modeling a dynamic environment.
On Ranking
Authors: Lane A. Hemachandra
Venue:  (1986)

This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function $f$ so that for all $x, f(x)$ computes the number of elements of $A$ that are lexicographically $\leq x$, i.e., the rank of $x$ with respect to $A$. We''ll say a class $C$ is P-rankable if all sets in $C$ are P-rankable. Our main results show that with the same certainty with which we believe counting to be complex, and thus with at least the certainty with which we believe P $\neq$ NP, we may believe that P has no ranking functions of any type uniform, strong, weak, or approximate. We show that: P and NP are equally likely to be P-rankable. P is P-rankable if and only if $P = P^{#P}$. This extends important work of Blum and Sipser [Sip85]. Even weak variations of P-ranking are hard if $P \neq P^{#P}$. PSPACE is P-rankable if and only if P = PSPACE. If P has small ranking circuits, then it has small ranking circuits of relatively low complexity. If P has small ranking circuits then the power of counting falls into the polynomial hierarchy (i.e., $P^{#P} \subseteq \(\sum_{2}^{p})\ = PH$). P/poly, the class of sets with small circuits is not P-rankable. P/poly has small ranking circuits if and only if $P^{#P}$/poly = $P^{#P/poly}$ = P/poly. If P is rankable, then P/poly has small ranking circuits. This links the ranking complexity of uniform and nonuniform classes. The ranks of some strings in easy sets are of high relative time-bounded Kolmogorov complexity unless P = $P^{#P}$. It follows that even approximate ranking is hard unless P = $P^{#P}$. This partially resolves a question posed by Sipser [Sip85, pp. 447-448].
Introduction to the TOPPERS Project " Open Source RTOS for Embedded Systems
Authors: Hiroaki Takada
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

The TOPPERS Project is to develop a series of open source real-time operating systems (RTOS) for embedded systems. The TOPPERS/JSP Kernel, which is the first product of theproject, was released two years ago and is started to be used in industries. A technological basis of the TOPPERS Project is the ITRON Specification, which is a defacto standard real-time kernel specification widely applied to consumer electronics, cellular phones, and other small-scale embedded systems in Japan.
SIMULATIONS OF DIFFUSION-REACTION EQUATIONS WITH IMPLICATIONS TO TURBULENT COMBUSTION MODELING
Authors: Sharath S. Girimaji
Venue:  (1993)

An enhanced diffusion-reaction reaction system (DRS) is proposed as a statistical model for the evolution of multiple scalars undergoing mixing and reaction in an isotropic turbulence field. The DRS model is close enough to the scalar equations in a reacting flow that other statistical models of turbulent mixing that decouple the velocity field from scalar mixing and reaction (e.g. mapping closure model, assumed-pdf models) cannot distinguish the model equations from the original equations. Numerical simulations of DRS are performed for three scalars evolving from non-premixed initial conditions. A simple one-step reversible reaction is considered. The data from the simulations are used (i) to study the effect of chemical conversion on the evolution of scalar statistics, and (ii) to evaluate other models (mapping-closure model, assumed multivariate $-pdf model).
Comparing star and pancake networks
Authors: Linda Morales, I. Hal Sudborough
Venue: The essence of computation: complexity, analysis, transformation (2002)

Low dilation embeddings are used to compare similarities between star and pancake networks. The pancake network of dimension n, Pn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when some prefix reversal transforms one permutation into the other. The star network of dimension n, Sn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when the exchange of the first element with some other element transforms one permutation into the other. Comparisons with the burnt pancake network are also discussed. The burnt pancake network, BPn, has 2nċn! nodes, one for each signed permutation, and an undirected edge between signed permutations (nodes) when some prefix reversal transforms one signed permutation into the other, and all symbols in the reversed prefix change sign. Some of the embeddings shown are: • Pn ⇒dil 1 S2n • Sn ⇒dil 1 P(n3-4n2+5n+4)/2 • BPn ⇒dil 1 S2n • Sn ⇒dil 1 P2n-2.
Design for Testability in Nanometer Technologies; Searching for Quality
Authors: T. W. Williams, Rohit Kapur
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Today's technology allows for the creation of designs that are stressing methodologies from a time to market point of view. The industry is in a transition period where the methodologies and tools are changing to allow for reusing designs as Cores. With a promise of large capacity, the miniaturization of the devices brings along new problems and changes the focus of Design for Testability and for all the tools used in the successful manufacturing of the design. In this paper, the impact of nanometer technology on the issues associated with Testing of System on Chip Designs is discussed.
Understanding Large-Scale Behavior Patterns in Complex systems
Authors: R. Buhr
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Understanding how a complex system works as a whole can be difficult because it requires blending information about structure and behavior into a coherent whole that can be understood without reference to details of how its parts are constructed, behave internally, or interact. The problem is doubly difficult for software systems, because we do not any good large-scale models of such systems to keep in the mind's eye. We have details in code files, low level diagrams of software details (for example, class inheritance hierarchies), and system views of hardware environments, but these are not enough. We suggest that models of whole systems that we can diagram and hold in the mind's eye are so important for human understanding of complex systems of all kinds that, if they do not exist, they must be invented. Use case maps are an example of a model invented for this purpose. While use case maps were invented to deal with the problems of understanding software systems, they are useful for complex systems of all kids. 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
A Parallel Optimal Branch-and-Bound Algorithm for MIN-Based Multiprocessors
Authors: Myung K. Yang, Chita R. Das
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper, a parallel Optimal Best-First search Branch-and-Bound(B&B) algorithm(obs) is proposed and evaluated for MIN-based multiprocessor systems. The proposed algorithm decomposes a problem into a number of sub-problems and each sub-problem is processed on a small group of processors. A performance analysis is conducted to estimate the speed-up of the proposed parallel B&B algorithm. It considers both the computation and communication times to evaluate the realistic performance.Simulation data are given along with analysis results for model validation. It is shown that the proposed Optimal Best-First search B&B algorithm performs better than other reported schemes with its various advantageous features such as: less sub-problem evaluations, proper load balancing, and limited scope of remote communication through the network.
EMG-Based Motion Discrimination Using a Novel Recurrent Neural Network
Authors: Nan Bu, Osamu Fukuda, Toshio Tsuji
Venue: Journal of Intelligent Information Systems (2003)

This paper presents a pattern discrimination method for electromyogram (EMG) signals for application in the field of prosthetic control. The method uses a novel recurrent neural network based on the hidden Markov model. This network includes recurrent connections, which enable modeling time series, such as EMG signals. Weight coefficients in the network can be learned using a well-known back-propagation through time algorithm. Pattern discrimination experiments were conducted to demonstrate the feasibility and performance of the proposed method. We were able to successfully discriminate forearm motions using the EMG signals, and achieved considerably high discrimination performance compared with other discrimination methods.
Survey of Studies on Tactile Senses
Authors: Seppo Pohja
Venue:  (2001)

This survey is meant to serve computer scientists, mathematicians and others who need to get quickly acquainted with the most relevant results in the biology and psychology of the tactile senses but have little or no prior exposure to the field. The survey is written from the point of view of a computer scientists studying artificial neural networks (ANNs). Questions of relevancy - what to include and what to exclude in the survey - are always very subjective. This survey tries to include biological and psychological knowledge and results that could provide ANN research with new ideas and insights. Also, the survey includes matters that could make the opposite to take place: ANN research providing biology and psychology with new ideas or insights.
Ranking Software Engineering Measures Related to Reliability Using Expert Opinion
Authors: M. Li, C. Smidts, R. W. Brill
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

The field of software engineering measurement appears to the unfamiliar eye as a chaotic environment lacking unifying principles and rigor. The number of software engineering measures developed over the years is stupefying and keeps increasing. Software engineering measures relate to multiple aspects of the software development process and product. Software development organizations typically select a small number of such software engineering measures to manage their development processes and products.The research presented in this paper is an attempt to help software development organizations identify the software engineering measures that are best predictors of software reliability. The current research is based on the top thirty measures identified in an earlier study carried out by Lawrence Livermore National Laboratory. The set of ranking criteria was modified to fit the needs of the study. The score of each measure for each ranking criterion was elicited through expert opinion and then aggregated into a single score using multi-attribute utility theory. The basic aggregation scheme selected was a linear additive scheme. A comprehensive sensitivity analysis was carried out. The sensitivity analysis included: variation of levels, variation of weights, and variation of aggregation schemes.
A Networking Oriented Data-Driven Processor: CUE
Authors: Hiroaki Nishikawa, Ryosuke Kurebayashi
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

This paper presents the CUE (coordinating users' requirements and engineering constraints) processor architecture as a networking oriented processor architecture to efficiently execute media processing and protocol processing in real time. The CUE processor is a chip multiprocessor based on a dynamic data-driven scheme to exploit various levels of parallelism in problems naturally and efficiently. Since it can simultaneously execute multiple processes as long as sufficient pipeline resources are available, it can perform real-time processing without run-time overheads. Experimental results for a data-driven implementation of protocol processing in CORBA (Common Object Request Broker Architecture) demonstrate the efficiency of the real-time processing scheme. In addition, through the evaluation results of data-driven implementation of protocol and media processing, this paper re-examines heterogeneous multi-processor configurations, instruction sets, packet formats, and the sequential processing scheme of the CUE processor.
Dipe-R: a knowledge representation language
Authors: Ruud van der Pol
Venue: Data Knowledge Engineering (2003)

The paper reports the design of Dipe-R, a knowledge representation language. It meets two requirements: (1) Dipe-R should enable the appropriate expression of mental states and processes, viz. in line with basic insights on the nature of (human) communication and knowledge, and (2) Dipe-R should offer the possibility of identifying concepts by describing them by their features. The first requirement means that Dipe-R is capable of representing knowledge adequately. The second reflects a common way of exploring knowledge; this seems useful in various applications, e.g., in Information Retrieval.For meeting these requirements, Dipe-R has as main characteristics: (a) two types of expressions for representing thoughts (using binary relations), (b) for each expression Dipe-R creates at least one sentence in natural language, thus distinguishing language from 'meaning', and (c) each expression in Dipe-R is provided with information on its origin. Some relation types are pre-represented, e.g., for creating type hierarchies. Experiments (in Information Retrieval) indicate that Dipe-R indeed meets its requirements.
Discussion of Parallel Algorithms
Authors: Abha Moitra, S. S Iyengar
Venue:  (1986)

In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the study and development of parallel algorithms. In this paper we present a survey of deterministic parallel algorithms for a class of computational problems. Both graph-theoretic and non graph-theoretic problems are considered and the parallel algorithms presented are motivated by identifying some common paradigms.
Requirements for an Elucidative Programming Environment
Authors: Kurt N"rmark
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

The main goal with this paper is to motivate and coin a variation of literate programming, which we call elucidative programming. Elucidative programming is oriented towards program explanation with the purpose of throwing lights on important and complex program relationships. Since proposed by Knuth in 1984, literate programming has been one of the most viable approaches to a radical improvement of internal program documentation. Unfortunately, most programmers find the ideas of literate programming, as supported by WEB-like tools, for impractical, academic, and far-fetched in relation to current programming practices. With elucidative programming, we intend to focus on the best ideas of literate programming. Add us disregards the aspects of publishing programs as technical literature and we provide for mechanisms with which documentation can to a program without affecting or disturbing the source program. Our ideas about elucidative programming are presented as a number of requirements, and in a discussion of programming environment issues in relation to the new ideas.