ppxscal/embedding_network huggingface dataset:
Early Addressing IC and Package Relationship Allows an Overall Better Quality of Complex SOC
Authors: Anna Fontanelli, Luigi Arnone, Roberto Branca, Giorgio Mastrorocco
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Trends in silicon process and packaging technologies require a tighter integration among manufacturing steps historically well distinct. It is becoming increasingly difficult to design and manufacture the most complex systems-on-a-chip (SOC) without a unified approach, which allows taking into account the package within the integrated circuits (IC) design flow.We present a new methodology, able to convey board-and package-related information into the classical IC design flow and vice versa. This is key to ensure the physical implementation is correct the first time, meeting high-density and high-speed design challenges.ICPack (IC & Package Design Integration) is a flexible and adaptable EDA environment, Java - and Web-based, which aims at reducing the number of iterations required to meet the design objectives in terms of quality, reliability, productivity and time to qualification.
Wavefront Computation: Language and Verification
Authors: M. D. Rice, S. B. Seidman
Venue:  (1992)

Wavefront computation was first proposed by S. Y. Kung as a means of abstracting the computational nature of systolic hardware arrays. The wavefront model combines data-driven computation with regular geometry. Despite the model''s attractiveness, it has neither received serious study as a model of parallel computation, nor has it been used as the basis for practical parallel programming. In our recent work, we have been investigating the wavefront paradigm using a computational model based on a general class of interconnection networks that support precisely defined wavefront operations and a formal notion of boundary. In this paper, the semantics of a specification language is described for the special case of n-dimensional grids and used to verify rectangular wavefront algorithms.
A CSCW Framework for the Flexible Coupling of Groupware Widgets
Authors: Paul Leung, Shing-Chi Cheung
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

Modern CSCW (Computer-Supported Cooperative Work) applications are driven by intensive graphical user interfaces. Groupware widgets, such as shared scrollbars and text editors, are common in these applications to facilitate synchronization of shared information across a user group. These widgets differ from their single-user counterparts in that they must coordinate and consistently reflect changes in shared widget properties. In the past, there were two approaches to coordinating communications among individual groupware widgets.The first approach is to have the coordination handled by the CSCW applications. This inevitably complicates the application logistics and limits the reuse of groupware widgets. The second approach is to provide a set of generic groupware widgets with built-in logistics for communications among individual widgets. However, pre-built groupware widgets may not be easily customized to suit the various needs of users. Generic groupware widgets tend to be bulky and accompanied by a lot of unused features. In practice, many groupware widgets mirror the functionality of their single-user counterparts except for the additional logistics to synchronize shared properties.In this paper, we propose a framework allowing these groupware widgets to be transformed from their single-user counterparts. The framework enables single-user widgets to register their connections to a separate notification server. After registration, these widgets become groupware widgets. The notification server uses the registered connections to update widgets of the changes in shared properties using a callback mechanism. Widget designers only need to determine the set of properties by which a group of widgets should be synchronized and to what extent they are synchronized. These properties collectively define the coupling among a group of widgets.The coupling is kept as a coupling portfolio in the notification server. Dynamic modification of coupling portfolios is supported by on-the-fly reconfiguration of multicast groups. Our framework is useful to simplify the client implementation of handling synchronization events and reduce the overheads of processing these events. These concepts are illustrated using a groupware web browser.
How to Write-All Efficiently Even with Contaminated Memory
Authors: Alex A. Shvartsman
Venue:  (1992)

The problem of {\em Write-All} ---using $P$ processors, write 1''s into all locations of an array of size $N$, where $P \leq N$--- has been used as the basic building block for constructing efficient and fault-tolerant parallel algorithms. All previous {\em Write-All} solutions use $\Omega(P)$ auxiliary shared memory and assume that this memory is cleared or initialized to some known value. When {\em Write-All} building blocks are used in polylogarithmic parallel-time algorithms (e.g., to compute prefix sums or list ranking), auxiliary memory initialization cannot be amortized over the computation. Thus, assuming clear memory is a very strong precondition and for {\em Write-All} itself raises a legitimate ``chicken-or-egg'''' objection. In this note, using a deterministic bootstrapping and balancing argument, we show how to {\em Write-All} when auxiliary memory is contaminated with arbitrary values. For any dynamic pattern of fail-stop, no-restart errors on a CRCW PRAM with at least one surviving processor, our new algorithm writes all 1''s using $O(N + P\log^3 N / (\log\log^2 N))$ work, {\em without any initialization assumption}. This technique can be combined with any {\em Write-All} algorithm to yield efficient simulations of any PRAM and even optimal simulations given processor slack. It can also be used with restartable fail-stop processor simulations. In addition, we show that for the parallel prefix computation it is possible to improve on the best deterministic simulations to date: by a factor of $\log N$ when the memory is clear, and by a factor of $\log\log N$ when the memory is contaminated.
Spectral Splitting Due to a Circularly Polarized Pump Laser: Laser Zeeman Spectroscopy
Authors: M. W. Evans
Venue:  (1991)

A theoretical prediction is made of various types of molecular Zeeman spectroscopy due to a circularly polarised pump laser, in which optical rectification produces a pattern of spectral splitting mediated by the imaginary, antisymmetric part of the frequency dependent molecular polarisability. The hyperfine part of this splitting, in which the nuclear spin quantum number plays a role, leads the the expectation of laser induced resonance effects akin to conventional nuclear magnetic resonance (NMR) and electron spin resonance (ESR). Experimental conditions for the observation of "laser Zeeman" spectral effects are defined using double resonance and saturation in mode locked lasers for ultra high resolution.
Length Normalization in Degraded Text Collections
Authors: Amit Singhal, Gerard Salton, Chris Buckley
Venue:  (1995)

Optical character recognition (OCR) is the most commonly used technique to convert printed material into electronic form. Using OCR, large repositories of machine readable text can be created in a short time. An information retrieval system can then be used to search through large information bases thus created. Many information retrieval systems use sophisticated term weighting functions to improve the effectiveness of a search. Term weighting schemes can be highly sensitive to the errors in the input text, introduced by the OCR process. This study examines the effects of the well known cosine normalization method in the presence of OCR errors and proposes a new, more robust, normalization method. Experiments show that the new scheme is less sensitive to OCR errors and facilitates use of more diverse basic weighting schemes. It also yields significant improvements in retrieval effectiveness over cosine normalization.
Partitions and Principles for Secure Operating Systems
Authors: Gregory R. Andrews
Venue:  (1975)

As part of the general goal of providing secure computer systems, the design of verifiably secure operating systems is one of the most important tasks. This paper addresses the problem by defining security in terms of a model and proposing a set of principles which we feel should be satisfied in a secure operating system. Informally, an operating system is secure if its users completely control the use of all information which they introduce. Four key partitions are identified: user interface functions, user invoked services, background services, and the security kernel. Principles are then defined to insure that interface functions provide a safe initial environment for executing user programs, user called services are confined, background services have no access to user information, and the security kernel adequately protects information storage.
Shock Profiles for the Asymmetric Simple Exclusion Process in One Dimension
Authors: B. Derrida, J. L. Lebowitz, E. R. Speer
Venue:  (1997)

The asymmetric simple exclusion process (ASEP) on a one-dimensional lattice is a system of particles which jump at rates $p$ and $1-p$ (here $p<1/2$) to adjacent empty sites on their right and left respectively. The system is described on suitable macroscopic spatial and temporal scales by the inviscid Burgers'' equation; the latter has shock solutions with a discontinuous jump from left density $\rho_-$ to right density $\rho_+$, $\rho_-\sqrt{\rho_+(1-\rho_-)/\rho_-(1-\rho_+)}$. For a special value of the asymmetry, given by $p/(1-p)=\rho_+(1-\rho_-)/\rho_-(1-\rho_+)$, the measure is Bernoulli, with density $\rho_-$ on the left and $\rho_+$ on the right. In the weakly asymmetric limit, $2p-1\to0$, the microscopic width of the shock diverges as $(2p-1)^{-1}$. The stationary measure is then essentially a superposition of Bernoulli measures, corresponding to a convolution of a density profile described by the viscous Burgers equation with a well-defined distribution for the location of the second class particle.
Parallel Non Linear Dichotomizers
Authors: Francesco Masulli, Giorgio Valentini
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

We present a new learning machine model for classification problems, based on decompositions of multi-class classification problems in sets of two-class subproblems, assigned to non-linear dichotomizers that learn their task independently of each other. The experimentation performed on classical data sets, shows that this learning machine model achieves significant performance improvements over MLP, and previous classifiers models based on decomposition of polychotomies into dichotomies. The theoretical reasons of the good properties of generalization of the proposed learning machine model are explained in the framework of the statistical learning theory.
Formal Reasoning about Communication Systems I: Embedding ML into Type Theory.
Authors: Christoph Kreitz
Venue:  (1997)

We present a semantically correct embedding of a subset of the Ocaml programming language into the type theory of NuPRL. The subset is that needed to build the Ensemble group communication system. We describe the essential methodologies for representing language constructs by type-theoretical expressions. Tactics representing derived inference rules and a programming logic for these constructs will be discussed as well as algorithms for translating an Ocaml-program into NuPRL-objects and vice versa. The formal representations and the translation algorithms will serve as the foundation for the development of automated reasoning tools for the verification and optimization of a group communication systems.
A Decentralized XML Database Approach to Electronic Commerce
Authors: Hiroshi Ishikawa, Manabu Ohta
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Decentralized XML databases are often used in Electronic Commerce (EC) business models such as e-brokers on the Web. To flexibly model such applications, we need a modeling language for EC business processes. To this end, we have adopted a query language approach and have designed a query language, called XBML, for decentralized XML databases used in EC businesses. In this paper, we explain and validate the functionality of XBML by specifying e-broker business models and describe the implementation of the XBML server, focusing on the distributed query processing.
An end user oriented platform for scientific visualization
Authors: H. Sanglard, H.-H. Nageli
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

In our discussions with end users about today's visualization environments, we were led to consider new concepts for the setting up of a platform which should be better suited to their real needs. In this paper, a hierarchy of visualization objects is presented. They will be the main elements of a new platform which should be both intuitive and extensible.
Hierarchical Feedback Adaptation for Real Time Sensor-Based Distributed Applications
Authors: Mihaela Cardei, Ionut Cardei, Rakesh Jha, Allalaghatta Pavan
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper presents an innovative hierarchical feedback adaptation method that efficiently controls the dynamic QoS behavior of real-time distributed data-flow applications, such as sensor-based data streams or mission-critical command and control applications. We applied this method in the context of the Real Time Adaptive Resource Management system, middleware architecture for resource management with support for integrated services, developed at the Honeywell Technology Center. We present the analytical model for feedback adaptation for periodic distributed data-flow applications and we describe experimental results for an Automatic Target Recognition pipeline application and the impact of hierarchical feedback adaptation on the application behavior and its QoS parameters.
Validating Run-time Interactions in Distributed Java Applications
Authors: Sudipto Ghosh, Nishant Bawa, Sameer Goel, Y. Raghu Reddy
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Distributed Java applications represent a large growtharea in software. Validating such applications using informationfromruntime interactions is a challenge. We proposetechniques for visualizing interactions, specifying and verifyingassertions, and checking conformance of the implementationwith its design. Our work helps in making the debuggingand testing activities more systematic.Keywords: Assertions, Distributed applications, Interactiondiagrams, Interceptors, Java RMI, Software design,Test adequacy criteria, Unified Modeling Language, Visualization.
DISTRIBUTED COMPUTING A PVM APPLICATION
Authors: Enrico Palchetti, Alberto Mattei
Venue:  (1996)

In this report a Distributed Computing application by means of the Parallel Virtual Machine (PVM) environment is documented. This experiment used an high speed network based on FDDI link.
Solving Temporal Constraint Networks with Qualitative Reasoning and Fuzzy Rules
Authors: Timothy K. Shih, Anthony Y. Chang
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Constraint satisfaction techniques play an important role in current computer science. Many difficult problems involving search from areas such as machine vision, scheduling, graph algorithms, machine design, and manufacturing can be considered to be the cases of the constraint satisfaction problem. In this paper, we construct a Infinite Temporal Interval Group for temporal constraint propagation. This interval algebra is also extended for spatial constraint reasoning. We develop an O(n)-time algorithm for propagation temporal constraint between two time events. For solving point/interval algebra networks, we develop an O(n 2 )-time algorithm for finding all pairs of feasible relations, where n is the number of points or intervals. A set of algorithms is proposed to manage spatio-temporal knowledge.
A protocol and server for a distributed digital technical report library
Authors: James R. Davis, Carl Lagoze
Venue:  (1994)

This paper describes {\bf Dienst} -a Distributed Interactive Extensible Network Server for Techreports. The Dienst protocol is based on the World Wide Web protocol HTTP, and provides an object-oriented interface to a document model. The document model allows one to access the document as a whole or by named sub-parts and it supports multiple formats for the document. We have also implemented a gateway from a Web server that supports the Dienst protocol. Using a World Wide Web client (e.g. Mosaic), a user may search for documents at distributed sites, browse ``thumbnail'''' (very small page) images, view the full documents, and print them.
The Design and Implementation of a WWW Traffic Generator
Authors: K. Y. Leung, K. H. Yeung
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

With the growing importance of the World Wide Web, Web managers are facing the problem of how to accurately measure the performance of their Web servers. This paper addresses this problem by introducing a traffic generator, which is developed by using the Java language. The generator generates Web workload by using an analytic model which models the arrivals at the user level. It is both self-scaling and self-configuring, meaning that it can scale the traffic to any intensity and configures the arrival characteristics to conform to those of any specific Web site. Analyzing a site's access log for adjusting the model parameters being used during traffic generation does the latter. In contrast to other traffic generator being used in common Web benchmark software, the real content of the target Web server is used as the testing file set instead of just using a reduced standard file set. Experimental results on using the generator to test two Web servers are also presented in this paper. The results show that the generator is both functional and useful to measure the performance of Web servers under real situations.
A Hard Real-Time Tasks Model for the VBR Video Server
Authors: Jae-Dong Lee
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

At the design of the video server to service video data as real-time, we must consider network bandwidth, buffer space and disk bandwidth. As buffer space and disk bandwidth affect each other tightly, they should be considered at the same time.In this paper, we propose the hard real-time tasks' model for the streams on the video server. The stream on the server can be considered as the hard real-time task in that the server must guarantee the continuity of streams as if the hard real-time system must guarantee the deadline of tasks. The management of streams in the server is induced from the scheduling of real-time tasks.We propose hard read-time tasks models for the video server and the scheduling algorithms for real-time tasks. The real-time scheduling algorithms are used for admission control of streams, scheduling of disk, and management of buffers in video server. We design the effective video server using the real-time task model. We evaluate the performance of our suggested video server via a proper simulation. We show that our mechanism can service more streams with a few buffers simultaneously. 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
Porta-SIMD: An Optimally Portable SIMD Programming Language
Authors: Russ Tuck
Venue:  (1990)

Existing programming languages contain architectural assumptions which limit their portability. I submit optimal portability, a new concept which solves this language design problem. Optimal portability makes it possible to design languages which are portable across various sets of diverse architectures. SIMD (Single-Instructions stream, Multiple-Data stream) computers represent an important and very diverse set of architectures for which to demonstrate optimal portability. Porta-SIMD (pronounced ``porta-simm''d'''') is the first optimally portable language for SIMD computers. It was designed and implemented to demonstrate that optimal portability is a useful and achievable standard for language design. An optimally portable language allows each program to specify the architectural features it requires. The language then enables the compiled program to exploit exactly those features, and to run on all architectures that provide them. An architecture''s features are those it can implement with a constant-bounded number of operations. This definition of optimal portability ensures reasonable execution efficiency, and identifies architectural differences relevant to algorithm selection. An optimally portable language for a set of architectures must accommodate all the features found in the members of that set. There was no suitable taxonomy to identify the features of SIMD architectures. Therefore, the taxonomy created and used in the design of Porta-SIMD is presented. Porta-SIMD is an optimally portable, full-featured, SIMD language. It provides dynamic allocation of parallel data with dynamically determined sizes. Generic subroutines which operate on any size of data may also be written in Porta-SIMD. Some important commercial SIMD languages do not provide these features. A prototype implementation of Porta-SIMD has been developed as a set of {\tt \#include} files and libraries used with an ordinary C++ compiler. This approach has allowed more rapid prototyping and language experimentation than a custom compiler would have, but modestly constrained the language''s syntax. The result is a very portable but only moderately efficient implementation. Porta-SIMD has been implemented for the Connection Machine 2, for Pixel-Planes 4 and 5, and for ordinary sequential machines. Optimal portability is an important new concept for developing portable languages which can handle architectural diversity. Porta-SIMD demonstrates its usefulness with SIMD computers.
A Dependable Distributed Auction System: Architecture and an Implementation Framework
Authors: Paul Ezhilchelvan, Graham Morgan
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The paper develops a distributed system architecture and proposes an implementation framework for conducting dependable Internet based on-line auctions, meeting the requirements of scalability and service integrity. Current auction services essentially rely on a central auction server. Given the increasing popularity and usage of electronic auctions, such a centralised approach is fundamentally restrictive with respect to scalability. Further, different national markets have different monetary regulations and may employ different procedures for payment settlements. Catering for local market autonomy means that decentralisation is an essential and practical requirement. With these design goals in mind, the paper presents a system architecture and a framework for a fault-tolerant implementation of the architecture.
The Effect of Algebraic Structure on the Computational Complexity of Matrix Multiplication
Authors: Leslie R Kerr
Venue:  (1970)

NO SUPPLIED