ppxscal/embedding_network huggingface dataset:
Executable JVM model for analytical reasoning: a study
Authors: Hanbing Liu, J Strother Moore
Venue: Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators (2003)

To study the properties of the Java Virtual Machine(JVM) and Java programs, our research group has produced a series of JVM models written in a functional subset of Common Lisp. In this paper, we present our most complete JVM model from this series, namely, M6, which is derived from a careful study of the J2ME KVM [16] implementation.On the one hand, our JVM model is a conventional machine emulator. M6 models accurately almost all aspects of the KVM implementation, including the dynamic class loading, class initialization and synchronization via monitors. It executes most J2ME Java programs that do not use any I/O or floating point operations. Engineers may consider M6 an implementation of the JVM. It is implemented with around 10K lines in 20+ modules.On the other hand, M6 is a novel model that allows for analytical reasoning besides conventional testing. M6 is written in an applicative (side-effect free) subset of Common Lisp, for which we have given precise meaning in terms of axioms and inference rules. A property of M6 can be expressed as a formula. Rules of interference can be used analytically to derive properties of M6 and the Java programs that run on the model, using a mechanical theorem prover.We argue that our approach of building an executable model of the system with an axiomatically described functional language can bring benefits from both the testing and the formal reasoning worlds.
On Scolnik''s Proposed Polynomial-Time Linear Programming Algorithm
Authors: David M. Gay
Venue:  (1973)

At a recent symposium, Hugo Sccolnik expressed some ideas leading to an algorithm which he thought might solve the linear programming problem in polynomial time. We examine the algorithm and find that it often fails to solve the linear programming problem, even in the special cases considered by Scolnik. We conclude that the algorithm probably cannot be modified to work properly.
A new plate bending element based on higher-order shear deformation theory for the analysis of composite plates
Authors: A. H. Sheikh, A. Chakrabarti
Venue: Finite Elements in Analysis and Design (2003)

A triangular element based on Reddy's higher-order shear deformation plate theory is developed. Although the plate theory is quite attractive but it could not be exploited as expected in finite-element analysis. This is due to the difficulties associated with satisfaction of inter-elemental continuity requirement of the plate theory. Keeping this aspect in view, the proposed element is developed where Reddy's plate theory is successfully implemented. It has six nodes and each node contains equal degrees of freedom. The performance of the element is tested with different numerical examples, which show its precision and range of applicability.
Generating robust parsers using island grammars
Authors: Leon M.F. Moonen
Venue:  (2001)

Source model extraction---the automated extraction of information from system artifacts---is a common phase in reverse engineering tools. One of the major challenges of this phase is creating extractors that can deal with irregularities in the artifacts that are typical for the reverse engineering domain (for example, syntactic errors, incomplete source code, language dialects and embedded languages). This paper proposes a solution in the form of \emph{island grammars}, a special kind of grammars that combine the detailed specification possibilities of grammars with the liberal behavior of lexical approaches. We show how island grammars can be used to generate robust parsers that combine the accuracy of syntactical analysis with the speed, flexibility and tolerance usually only found in lexical analysis. We conclude with a discussion of the development of Mangrove, a generator for source model extractors based on island grammars and describe its application to a number of case studies.
Implementation of a PCI Bus Virtual Driver Using PLI, Named Pipes, and Signals
Authors: Doug Hahn, Joe Russack
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

In designing a complex ASIC it is often the case that adequate testing cannot be performed without modeling the high level environment where the ASIC will eventually reside. One approach for developing these models is to write a description of the environment in the native simulation language (Verilog or VHDL) that is being used to develop the ASIC. While designing a complex ATM net work interface chip with a PCI bus interface it became necessary to develop a driver model to check correctness of operation. We decided to develop a co-design environment which would allow us to develop a real driver (in C++) which would interact with the current hardware model in RTL. This would benefit the project in two ways. First, the driver writer would not need to learn a new language and could re-use code, and secondly, there would be a fully developed driver when the chip was ready to be tested. This approach, which uses UNIX named pipes and signals, allowed us to have driver software written before the chip had been manufactured and facilitated our regression methodology. This paper describes the architecture of the simulation interface.
Common Phrases and Minimum-Space Text Storage
Authors: Robert A. Wagner
Venue:  (1970)

A method for saving storage space for text strings, such as compiler diagnostic messages, is described. The method relies on hand-selection of a set of text-strings which are common to one or more messages. These phrases are then stored only once. The storage technique gives rise to a mathematical optimization problem: determine how each message should use the available phrases to minimize its storage requirement. This problem is non-trivial when phrases which overlap exist. However, we present a dynamic programming algorithm which solves the problem in time which grows linearly with the number of characters in the text. Keywords and Phrases: diagnosic messages, error messages, common phrases, minimum space, text storage, optimization, dynamic programming.
TCP Trunking: Design, Implementation and Performance
Authors: H. T. Kung, S. Y. Wang
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

A TCP trunk is an aggregate traffic stream whose data packets are transported at a rate dynamically determined by TCP's congestion control. Typically such a trunk is implemented on top of a layer-2 virtual circuit or an MPLS label switched path. A management TCP connection is used to regulate the rate at which the trunk transmits its data packets. Setting up a TCP trunk over a circuit or a path is easy, involving only the two end nodes of a trunk to implement the management TCP connection. A TCP trunk can guarantee minimum bandwidth while being able to grab additional bandwidth when it is available. When carried by a TCP trunk, UDP flows will be constrained in their band-width usage, although they themselves do not perform congestion control. Experiments on testbed networks have validated these properties. TCP trunking can be an effective tool for network operators in managing bandwidth sharing between aggregates.
Online adaptive fuzzy neural identification and control of nonlinear dynamic systems
Authors: Meng Joo Er, Yang Gao
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter presents a robust Adaptive Fuzzy Neural Controller (AFN C) suitable for identification and control of uncertain Multi-Input-Multi-Output (MIMO) nonlinear systems. The proposed controller has the following salient features: (1) Self-organizing fuzzy neural structure, i.e. fuzzy control rules can be generated or deleted automatically; (2) Online learning ability of uncertain MIMO nonlinear systems; (3) Fast learning speed; (4) Fast convergence of tracking errors; (5) Adaptive control, where structure and parameters of the AFNC can be self-adaptive in the presence of disturbances to maintain high control performance; (6) Robust control, where global stability of the system is established using the Lyapunov approach. Two simulation examples are used to demonstrate excellent performance of the proposed controller.
Reconstructing Ancient Egyptian Tombs
Authors: Hany Farid
Venue:  (2000)

From the pyramids of Giza to the tombs of Thebes (modern Luxor), ancient Egypt''s glorious history has produced remarkable architecture. Sadly, the nearly four million yearly tourists have taken a heavy toll on many of these ancient structures. Of particular concern are many of the tombs located opposite to Luxor on the western bank of the Nile. Digital reconstruction of these tombs has the potential to help document and preserve these important historical structures. Photographing and reconstruction of these tombs poses new and unique problems that this paper begins to address. Techniques for removing image distortions, recovering 3-D shape, and correcting for lighting imbalances are discussed. A complete reconstruction of the tomb of Sennedjem is shown.
Exploring Advanced Architectures Using Performance Prediction
Authors: Darren J. Kerbyson, Harvey J. Wasserman, Adolfy Hoisie
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

In this work we show how by the examination of the key characteristics of an application, analytical performance models can be formed. These models are parameterized in terms of computational and communication performances of an individual system and can be used to explore achievable performance of an application prior to system availability. Two applicationsare considered: an adaptive mesh refinement code on structured meshes, and an Sn transport code on unstructured meshes. These are representative of part of the ASCI workload. One of the models is utilized to validate the performance of a Compaq Alpha-server ES45 supercomputing system being built at Los Alamos, and expected to grow to 30Tera-flops peak performance in the next year. In addition, the models are used to explore the achievable performance on hypothesized future systems with increased peak computation and communication performance.
Approximate Queries and Representations for Large Data Sequences
Authors: Hagit Shatkay
Venue:  (1995)

Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. In terms of storage, using approximate representation can significantly reduce the search space. Through a good choice of representation, a broad new class of approximate queries can be supported. These queries are concerned with application-dependent features of the data as opposed to the actual sampled points. We introduce a new notion of {\it generalized approximate queries} and a general {\it divide and conquer} approach that supports them. This approach uses families of real-valued functions as an approximate representation of data. We present algorithms for realizing our technique, and the results of an implementation that has been applied to medical cardiology data.
Supporting reuse and configuration for large scale software process models
Authors: N. Belkhatir, J. Estublier
Venue: Proceedings of the 10th International Software Process Workshop (1996)

A software process is a set of activities that will be carried out over time to produce a software system. Research on the software process has been increasingly recognized. This position advocates the representation of a software development process which should be explicitly defined, maintained and executed by a PSEE (Process Sensitive Software Engineering Environment). The complexity and scope of large scale process models makes their design, development and maintenance very complex. The overall objective of our approach is to define a tool to support the software process model construction and maintenance in PSEE. We investigate how software configuration management techniques applied to the software process can provide a novel solution for the definition and composition of reusable software process components. We present the current status of our work.
DIMACS SPECIAL YEAR IN MATHEMATICAL SUPPORT FOR MOLECULAR BIOLOGY ANNUAL REPORT JANUARY 1996
Authors: DIMACS
Venue:  (1997)

No abstract. 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
Attribute-Oriented Induction Using Domain Generalization Graphs
Authors: Howard J. Hamilton, Robert J. Hilderman, Nick Cercone
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Attribute-oriented induction summarizes the information in a relational database by repeatedly replacing specific attribute values with more general concepts according to user-defined concept hierarchies. We show how domain generalization graphs can be constructed from multiple concept hierarchies associated with an attribute, describe how these graphs can be used to control the generalization of a set of attributes, and present the Multi-Attribute Generalization algorithm for attribute-oriented induction using domain generalization graphs. Based upon a generate-and-test approach, the algorithm generates all possible combinations of nodes from the domain generalization graphs associated with the individual attributes, to produce all possible generalized relations for the set of attributes. We rank the interestingness of the resulting generalized relations using measures based upon relative entropy and variance. Our experiments show that these measures provide a basis for analyzing summary data from relational databases. Variance appears more useful because it tends to rank the less complex generalized relations (i.e., those with few attributes and/or few tuples) as more interesting.
A Detailed Simulation Model of the HP 97560 Disk Drive
Authors: David Kotz, Song B Toh, Sriram Radhakrishnan
Venue:  (1994)

We implemented a detailed model of the HP 97560 disk drive, to replicate a model devised by Ruemmler and Wilkes (both of Hewlett-Packard, HP). Our model simulates one or more disk drives attached to one or more SCSI buses. The design is broken into three components: a test driver, the disk model itself, and the discrete-event simulation support. Thus, the disk model can be easily extracted and used in other simulation environments. We validated our model using traces obtained from HP, using the same "demerit" measure as Ruemmler and Wilkes. We obtained a demerit percentage of 3.9%, indicating that our model was extremely accurate. This paper describes our implementation, and is meant for those wishing to use our model, see our validation, or understand our code.
Photoshop Studio with Bert Monroy
Authors: Bert Monroy, John C. Dvorak
Venue:  (2002)

:Bert Monroy, long a well-known and regarded expert in the Photoshop community, has received heavy exposure on TechTV; his reputation as a master teacher of Photoshop and digital illustration has grown dramatically in the past six months. TechTV is planning an entire weekly series around Bert; this book capitalizes on Bert's visibility and follows up on the critically acclaimed predecessor volume, Bert Monroy: Photorealistic techniques with Photoshop & Illustrator.
Analysis of Algorithms for Supporting Disconnected Write Operations in Mobile Client-Server Environments
Authors: Ing-Ray Chen, Ngoc Anh Phan, I-Ling Yen
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

A mobile user may voluntarily disconnect itself from the web server to save its battery life and avoid high communication prices. To allow web pages to be updated while the mobile user is disconnected from the web server, updates can be staged in the mobile unit and propagated back to the web server upon reconnection. In this paper, we analyze algorithms for supporting disconnected write operations and develop a performance model which helps identify the optimal length of the disconnection period under which the cost of update propagation is minimized. The analysis result is particularly applicable to web applications which allow wireless mobile users to modify web contents while on the move. We also show how the result can be applied to real-time web applications such that the mobile user can determine the longest disconnection period such that it can still propagate updates to the server before the deadline with a minimum communication cost. Index Terms: Wireless mobile systems, Web access, disconnected operations, performance analysis, coherency interval, mobile client-server systems.
Efficient Brokerage in a CORBA-Based Service Mediation Platform
Authors: Eckhart Koerner, Naima Aghoutane, Gazanfer Ercan, Linda Strick, Wolfgang Wunderlich, Motohisa Funabashi, Shigeki Kawano, Junichi Toyouchi, Ltd. Hitachi
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The rapid development of electronic commerce applications and information services has led to a significant need for mediation services. The brokerage of services is one particular mediation service. In this article, we present the design of service brokerage for a CORBA-based mediation platform that symmetrically supports advertising by service providers and navigation by end-users. A particular strength of this design is in the support by dynamic profile and profile rule management for both end-users and service providers. In advertising and navigation, service offer information is dynamically filtered and matched according to the profiles of end-users and service providers, such that an optimal focus of information dissemination is achieved. This is a cornerstone for dynamic provisioning of services in order to support the evolution of the marketplace. The presented design is partially based on TINA and OMG specifications.
The Petersen graph is not 3-edge-colorable: a new proof
Authors: Reza Naserasr, Riste Škrekovski
Venue: Discrete Mathematics (2003)

We give a new proof that the Petersen graph is not 3-edge-colorable.
The iCore 520-MHz Synthesizable CPU Core
Authors: Nick Richardson, Lun Bin Huang, Razak Hossain, Julian Lewis, Tommy Zounes, Naresh Soni
Venue: IEEE Micro (2003)

A new implementation of the ST20-C2 CPU architecture involves an eight-stage pipeline with hardware support to execute up to three instructions per cycle. The design operates up to 520 MHz at 1.8V, among the highest reported speeds for a synthesized CPU core.
A Vector Markov Model for Structural Coverage Growth and the Number of Failure Occurrences
Authors: Michael Grottke
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Most software reliability growth models specify the expectednumber of failures experienced as a function of testingeffort or calendar time. However, there are approachesmodel the development of intermediate factors drivingfailure occurrences. This paper starts out with presentingmodel framework consisting of four consecutive relationships.It is shown that a differential equation representingthis framework is a generalization of several finite failurescategory models. The relationships between the number of test cases executedand expected structural coverage, and between expectedstructural coverage and the expected number of failureoccurrences are then explored further. A vector Markov model allowing for partial redundancysampling code constructs is developed. The model bridgesthe gap between setups related to operational testing andsystematic testing, respectively. Two extensions of the partialredundancy model considering the development of thenumber of failure occurrences are discussed.The paper concludes with showing that the extendedmodels fit into the structure of the differential equation presentedat the beginning, which permits further interpretation.
Improving Reliability in the Database Design Frameworks
Authors: Donatella Castelli, Serena Pisani
Venue:  (1998)

This paper extends a database schema transformation language, called Schema Refinement Language, with a composition operator and a rule for deriving the conditions under which a composed transformations is guaranteed to produce a correct design. The framework that results from this extension can be exploited for improving the reliability of the database schema design also when other design frameworks are used. TEL:: +39 050 593406 EMAIL:: castelli@iei.pi.cnr.it
Reclaiming Space from Duplicate Files in a Serverless Distributed File System
Authors: John R. Douceur, Atul Adya, William J. Bolosky, Dan Simon, Marvin Theimer
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

The Farsite distributed file system provides availability by replicating each file onto multiple desktop computers. Since this replication consumes significant storage space, it is important to reclaim used space where possible. Measurement of over 500 desktop file systems shows that nearly half of all consumed space is occupied by duplicate files. We present a mechanism to reclaim space from this incidental duplication to make it available for controlled file replication. Our mechanism includes 1) convergent encryption, which enables duplicate files to coalesced into the space of a single file, even if the files are encrypted with different users' keys, and 2) SALAD, a Self-Arranging, Lossy, Associative Database for aggregating file content and location information in a decentralized, scalable, fault-tolerant manner. Large-scale simulation experiments show that the duplicate-file coalescing system is scalable, highly effective, and fault-tolerant.
Existence and Uniqueness for the Parabolic Conserved Phase Field Model with Memory
Authors: Elisabetta Rocca
Venue:  (2001)

A nonlinear system for the heat diffusion inside a material subject to a phase change is considered. The underlying model is a generalized version of the well-known Caginalp conserved phase-field system, where the Fourier law is replaced by the Coleman-Gurtin heat flux law and a linear growth is allowed for the latent heat density. The resulting problem couples a non-linear parabolic equation derived from the balance of energy with a fourth order parabolic inclusion which rules the evolution of the order parameter $\chi$. Homogeneous Neumann boundary conditions guarantee that the space-average of $\chi$ is conserved in time. Existence and uniqueness of the solution are proved. TEL:: 0382505651 EMAIL:: rocca@dimat.unipv.it 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
Using an interactive parallelisation toolkit to parallelise an ocean modelling code
Authors: C. S. Ierotheou, S. P. Johnson, P. F. Leggett, M. Cross
Venue: Future Generation Computer Systems (2003)

This paper describes an interactive parallelisation toolkit that can be used to generate parallel code suitable for either a distributed memory system (using message passing) or a shared memory system (using OpenMP). This study focuses on how the toolkit is used to parallelise a complex heterogeneous ocean modelling code within a few hours for use on a shared memory parallel system. The generated parallel code is essentially the serial code with OpenMP directives added to express the parallelism. The results show that substantial gains in performance can be achieved over the single thread version with very little effort.