ppxscal/embedding_network huggingface dataset:
Development of a verified Erlang program for resource locking
Authors: Thomas Arts, Clara Benac Earle, John Derrick
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

In this paper, we describe a tool to verify Erlang programs and show, by means of an industrial case study, how this tool is used. The tool includes a number of components, including a translation component, a state space generation component and a model checking component. To verify properties of the code, the tool first translates the Erlang code into a process algebraic specification. The outcome of the translation is made more efficient by taking advantage of the fact that software written in Erlang builds upon software design patterns such as client&#x2013;server behaviours. A labelled transition system is constructed from the specification by use of the &#x03bc;CRL toolset. The resulting labelled transition system is model checked against a set of properties formulated in the &#x03bc;-calculus using the Caesar/Ald&#x00e9;baran toolset.As a case study we focus on a simplified resource manager modelled on a real implementation in the control software of the AXD 301 ATM switch. Some of the key properties we verified for the program are mutual exclusion and non-starvation. Since the toolset supports only the regular alternation-free &#x03bc;-calculus, some ingenuity is needed for checking the liveness property &#x201c;non-starvation&#x201d;. The case study has been refined step by step to provide more functionality, with each step motivated by a corresponding formal verification using model checking .
A multiple disk failure recovery scheme in RAID systems
Authors: Chong-Won Park, Jin-Won Park
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

In this paper, we propose a practical disk error recovery scheme tolerating multiple simultaneous disk failures in a typical RAID system, resulting in improvement in availability and reliability. The scheme is composed of the encoding and the decoding processes. The encoding process is defined by making one horizontal parity and a number of vertical parities. The decoding process is defined by a data recovering method for multiple disk failures including the parity disks. The proposed error recovery scheme is proven to correctly recover the original data for multiple simultaneous disk failures regardless of the positions of the failed disks. The proposed error recovery scheme only uses exclusive OR operations and simple arithmetic operations, which can be easily implemented on current RAID systems without hardware changes.
An Experimental Framework for Testing Web Prefetching Techniques
Authors: Josep Domenech, Ana Pont, Julio Sahuquillo, Jose A. Gil
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The popularity of web objects, and by extension the popularity of the web sites, besides the appearance of clear footprints in user's accesses that show a considerable spatial locality, make possible to predict future accesses based on the current ones. This fact permits to implement also prefetching techniques in Web Architecture in order to reduce the latency perceived by the users. Although the open literature presents some approaches in this sense, the huge variety of prefetching algorithms, and the different scenarios and conditions where they are applied make very difficult to compare performance and to obtain correct conclusions that permit researchers to improve their proposals or even detect in which conditions one solution is more convenient than others. This is the main reason why we propose in this paper a new and free available environment in order to implement and study prefetching techniques efficiently. Our framework is a hybrid implementation that combines both real and simulated parts in order to provide flexibility and accuracy. It reproduces in detail the behavior of web users, proxy severs and original servers. The simulator also includes a module to provide performance results, such as precision (prefetching accuracy), recall, response time, and byte transference.
The impact of rapid prototyping on specifying user requirements
Authors: Hassan Gomaa
Venue: ACM SIGSOFT Software Engineering Notes (1983)

Prototyping has been recognized as being a powerful and indeed essential tool in many branches of engineering. Although software prototyping is often considered too expensive, correcting ambiguities and misunderstandings at the requirements specification stage is significantly cheaper than correcting a system after it has gone into production. This paper describes how rapid prototyping impacts the Requirements Analysis and Specification phase of the software life cycle. This is illustrated by describing the experience gained from a prototype used to assist in the requirements specification of a system to manage and control an integrated circuit fabrication facility. The cost of the prototype was less than 10 percent of the total software development cost.
Multi-height micro structures in poly(dimethyl siloxane) lab-on-a-chip
Authors: S. Chung, J. Park, C. Chung, D. C. Han, J. K. Chang
Venue: Microsystem Technologies (2004)

The PDMS (poly(dimethyl siloxane)) replica molding is very useful for lab-on-a-chip development. This paper describes the several fabrication schemes of master fabrication for multi-height micro structures in PDMS microchip, and gives the overview over the technologies used for PDMS replica molding and channel closing with oxygen plasma treatment. Developed processes in the paper are good solution to fabricate the more complex structures in microfluidic lab-on-a-chip.
Architectural Synthesis Integrated with Global Placement for Multi-Cycle Communication
Authors: Jason Cong, Yiping Fan, Guoling Han, Xun Yang, Zhiru Zhang
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Multiple clock cycles are needed to cross the global interconnectsfor multi-gigahertz designs in nanometer technologies. Forsynchronous design, this requires the consideration of multi-cycleon-chip communication at the high level. In this paper, we presenta new architectural synthesis system integrated with globalplacement, named MCAS (Multi-Cycle Architectural Synthesis),on top of the recently-proposed Regular Distributed Register(RDR) micro-architecture. The RDR architecture provides aregular synthesis platform for supporting multi-cyclecommunication. Novel architectural synthesis algorithms thatintegrate high-level synthesis with global placement have beendeveloped in MCAS, including scheduling-driven placement anddistributed controller generation, etc. Experimental results showthat our methodology can achieve a clock period improvement of31% and a total latency improvement of 24% on averagecompared to the conventional architectural synthesis flow.
Hierarchical Computation of Interval Availability and Related Metrics
Authors: Dong Tang, Kishor S. Trivedi
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

As the new generation high-availability commercialcomputer systems incorporate deferred repair servicestrategies, steady-state availability metrics may no longerreflect reality. Transient solution of availability modelsfor such systems to calculate interval availability overshorter time horizon is desirable. While many solutionmethods for transient analysis have been proposed, howto apply these methods on hierarchical models has notbeen well addressed. This paper describes an approachto computing interval availability and related metrics forhierarchical Markov models. The approach divides thetime interval of interest into small subintervals such thatthe input parameters can be treated as constants in eachsubinterval to make the model satisfy the homogeneousMarkov property, and then pass the output intervalavailability metrics as constants from the sub-model to itsparent model. Finally, these quantities are integrated toobtain the expected interval availability for the entireinterval. The study also addresses methods of passingparameters across levels for generating multiple metricsfrom a hierarchical model. The approach is illustratedwith an example model and has been implemented inRAScad. All computations for the example model havealso been carried out using the SHARPE textuallanguage interface.
Linear FPT reductions and computational lower bounds
Authors: Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We develop new techniques for deriving very strong computational lower bounds for a class of well-known NP-hard problems, including weighted satisfiability, dominating set, hitting set, set cover, clique, and independent set. For example, although a trivial enumeration can easily test in time O(nk) if a given graph of n vertices has a clique of size k, we prove that unless an unlikely collapse occurs in parameterized complexity theory, the problem is not solvable in time f(k) no(k) for any function f, even if we restrict the parameter value k to be bounded by an arbitrarily small function of n. Under the same assumption, we prove that even if we restrict the parameter values k to be Θ(μ(n)) for any reasonable function μ, no algorithm of running time no(k) can test if a graph of n vertices has a clique of size k. Similar strong lower bounds are also derived for other problems in the above class. Our techniques can be extended to derive computational lower bounds on approximation algorithms for NP-hard optimization problems. For example, we prove that the NP-hard distinguishing substring selection problem, for which a polynomial time approximation scheme has been recently developed, has no polynomial time approximation schemes of running time f(1/ε)no(1/ε) for any function f unless an unlikely collapse occurs in parameterized complexity theory.
Block-based web search
Authors: Deng Cai, Shipeng Yu, Ji-Rong Wen, Wei-Ying Ma
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Multiple-topic and varying-length of web pages are two negative factors significantly affecting the performance of web search. In this paper, we explore the use of page segmentation algorithms to partition web pages into blocks and investigate how to take advantage of block-level evidence to improve retrieval performance in the web context. Because of the special characteristics of web pages, different page segmentation method will have different impact on web search performance. We compare four types of methods, including fixed-length page segmentation, DOM-based page segmentation, vision-based page segmentation, and a combined method which integrates both semantic and fixed-length properties. Experiments on block-level query expansion and retrieval are performed. Among the four approaches, the combined method achieves the best performance for web search. Our experimental results also show that such a semantic partitioning of web pages effectively deals with the problem of multiple drifting topics and mixed lengths, and thus has great potential to boost up the performance of current web search engines.
An adaptive mesh refinement of quadrilateral finite element meshes based upon an a posteriori error estimation of quantities of interest: modal response
Authors: E. Botkin, Hui-Ping Wang
Venue: Engineering with Computers (2004)

Modal analysis is commonly performed in a vehicle development process to assess dynamic responses of structure designs. This paper presents an adaptive quadrilateral refinement process for modal analysis of elastic shells based upon a posteriori error estimation in natural frequencies. The process provides engineers with an estimation of their modal analysis quality and an effective adaptive refinement tool for quadrilateral meshes. The effectiveness of the process is demonstrated on the eigenvalue analyses of two numerical examples, a shock tower cap and a roof structure. It shows that the solution error in the frequency of interest is effectively reduced through the adaptive refinement process, and the resulting frequency of interest converges to the solution of a very fine model.
Multilinear formulas and skepticism of quantum computing
Authors: Scott Aaronson
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Several researchers, including Leonid Levin, Gerard 't Hooft, and Stephen Wolfram, have argued that quantum mechanics will break down before the factoring of large numbers becomes possible. If this is true, then there should be a natural set of quantum states that can account for all quantum computing experiments performed to date, but not for Shor's factoring algorithm. We investigate as a candidate the set of states expressible by a polynomial number of additions and tensor products. Using a recent lower bound on multilinear formula size due to Raz, we then show that states arising in quantum error-correction require nΩ(log n) additions and tensor products even to approximate, which incidentally yields the first superpolynomial gap between general and multilinear formula size of functions. More broadly, we introduce a complexity classification of pure quantum states, and prove many basic facts about this classification. Our goal is to refine vague ideas about a breakdown of quantum mechanics into specific hypotheses that might be experimentally testable in the near future.
A New Look at Egocentric Algorithms
Authors: Azad H. Azadmanesh, Hamid Sharif
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

With respect to Approximate Agreement, some categoriesof voting algorithms have been developed. This researchpresents a new approach to one family of algorithms calledEgocentric algorithms, and analyzes the conditions underwhich the new approach will perform better than the existingEgocentric voting algorithms. In addition, the newapproach will provide some new insight into the voting processof such algorithms.
Rapid prototyping by means of abstract module specifications written as trace axioms
Authors: John K. Dixon, John McLean, David L. Parnas
Venue: ACM SIGSOFT Software Engineering Notes (1982)

In this paper we discuss the use of a form of abstract specifications for software modules called trace axioms or trace assertions. Specifications written in this form precisely describe the external behavior of the module and can be automatically tested for consistancy and completeness. Errors revealed by the testing process can be rapidly corrected by a man-machine interactive process. These specifications could then be interpreted or compiled to form a rapid prototype of the final system.
Using XML in a compiler course
Authors: D. Robert Adams, Christian Trefftz
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

In this paper we describe how XML can be introduced into a compiler construction course. We make the case that XML and compilers have much in common, and that introducing XML into a compiler course makes sense. We then goes on to demonstrate how XML was used in two recent compiler courses. Finally, we discuss the tradeoffs of using an XML-based project rather than a traditional programming-language project.
Supporting the sense of presence in control environments
Authors: S. Bandini, S. Manzoni, F. Nunnari, C. Simone
Venue: Cognition, Technology and Work (2004)

This paper proposes a notion of presence which overcomes its strict interpretation in terms of physical projection and perception, and interprets &#x201c;the sense of being there&#x201d; as the understanding of &#x201c;the meaning of what is going on there&#x201d;. The domain of control environments is considered to illustrate this point and to propose technological solutions combining principles and techniques taken from Artificial Intelligence and Computer Supported Cooperative Work to enhance the interpretation and cooperation capabilities of the involved actors.
The all-or-nothing multicommodity flow problem
Authors: Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We consider the all-or-nothing multicommodity flow problem in general graphs. We are given a capacitated undirected graph G=(V,E,u) and set of k pairs s1 t1, s2t2, …, sktk. Each pair has a unit demand. The objective is to find a largest subset S of 1,2,…,k such that for every i in S we can send a flow of one unit between si and ti. Note that this differs from the edge-disjoint path problem (EDP) in that we do not insist on integral flows for the pairs. This problem is NP-hard, and APX-hard, even on trees. For trees, a 2--approximation is known for the cardinality case and a 4--approximation for the weighted case. In this paper we build on a recent result of Räcke on low congestion oblivious routing in undirected graphs to obtain a poly-logarithmic approximation for the all-or-nothing problem in general undirected graphs. The best previous known approximation for all-or-nothing flow problem was O(min(n<2/3, √m)), the same as that for EDP. Our algorithm extends to the case where each pair siti has a demand di associated with it and we need to completely route di to get credit for pair i. We also consider the online admission control version where pairs arrive online and the algorithm has to decide immediately on its arrival whether to accept it or not. We obtain a randomized algorithm with a competitive ratio that is similar to the approximation ratio for the offline algorithm.
A Tool for Collection of Region Based Data from Uterine Cervix Images for Correlation of Visual and Clinical Variables Related to Cervical Neoplasia
Authors: Jose Jeronimo, Mark Schiffman, L. Rodney Long, Leif Neve, Sameer Antani
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The National Cancer Institute (NCI) is collaborating with the National Library of Medicine(NLM) to create a database of digitized images of the uterine cervix for research, training, andeducation. The database of 100,000 images collected in NCI projects will be Web-accessibleand will contain not only the digitized images, but also clinical, longitudinal data relevant tothe detection of uterine cervix cancer. The database will also contain spatial data in the formof expert-marked boundary regions of anatomy and tissue regions of high interest. Thecollection of this spatial data is enabled by customized software, the Boundary Marking Tool(BMT). The BMT, its significance, and its use in preliminary research studies, are described inthis paper.
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Authors: Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason Cong
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Heuristics are widely used for solving computational intractablesynthesis problems. However, until now, there has been limitedeffort to systematically develop heuristics that can be applied to avariety of synthesis tasks. We focus on development of generaloptimization principles so that they can be applied to a wide rangeof synthesis problems. In particular, we propose a new way torealize the most constraining principle where at each step wegradually relax the constraints on the most constrained elementsof the solution. This basic optimization mechanism is augmentedwith several new heuristic principles: minimal freedom reduction,negative thinking, calibration, simultaneous step consideration,and probabilistic modeling.We have successfully applied these optimization principles to anumber of common behavioral synthesis tasks. Specifically, wedemonstrate a systematic way to develop optimization algorithmsfor maximum independent set, time-constrained scheduling, andsoft real-time system scheduling. The effectiveness of theapproach and algorithms is validated on extensive real-lifebenchmarks.
Coordinated Views and Tight Coupling to Support Meta Searching
Authors: Anselm Spoerri
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

This paper addresses how information visualization can support users in the meta search process and some of the design issues that arise. It describes MetaCrystal and its linked tools that enable users to control how to combine and filter the search results by different search engines. A hierarchy of aggregation is employed to provide users with quick insights into the number of documents found by a specific number or combination of search engines. MetaCrystal enables users to visually perform advanced filtering operations, such as complex Boolean constraints. This paper also discusses how to support tight coupling between the filtering controls and tools that operate at different levels of aggregation.
Research on advanced soft computing and its applications
Authors: V. Nov&#x00e1;k, I. Perfilieva, H. T. Nguyen, V. Kreinovich
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

The main objective for the research presented in this special issue is to advance theoretical basis in soft computing, for the purpose of improving applications. Why is this theoretical research needed? Because soft computing in general (and intelligent control and decision making in particular) are, in many aspects, still an art. To make this methodology easier to apply, we must use the experience of successful applications of fuzzy control, decision making or classification and extract formal rules that would capture this experience. To be able to do that efficiently, we must understand why some versions of soft computing methodology turned out to be more successful in some practical situations and less successful in others. In other words, to advance the practical success of soft computing methodology, we need further theoretical analysis of soft computing &#x2013; analysis targeted at enhancing its application abilities.
Construction of a 3/4-Ideal Hyperbolic Tetrahedron out of Ideal Tetrahedra
Authors: Yana Mohanty
Venue: Discrete Computational Geometry (2004)

We show how to construct an arbitrary 3/4-ideal hyperbolic tetrahedron out of 10 ideal tetrahedra. 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
Opportunistic Dissemination of Spatio-Temporal Resource Information in Mobile Peer to Peer Networks
Authors: Ouri Wolfson, Bo Xu
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we examine the dissemination of availability reports about resources in mobile peer-to-peer networks,where vehicles, pedestrian or sensors communicate with each othervia short-range wireless transmission. Each disseminated report represents information about a spatial-temporal event, such as the availability of a parking slot at a particular time or the detection of an injured in an earthquake damaged building. We propose an opportunistic dissemination paradigm, in which a moving object transmits the reports it carries to encountered objects and obtains new reports in exchange. Least relevant reports are discarded after each exchange such as to limit the communication data volume of future exchanges. We analyze by simulations the information accuracy provided by this approach. We also develop and analyze a method to determining the optimal size of the local reports database at a moving object such that a certain accuracy level is reached. The proposed system has the potential to create a completely new information marketplace.