ppxscal/embedding_network huggingface dataset:
Scalable and scalably-verifiable sequential synthesis
Authors: Alan Mishchenko, Michael Case, Robert Brayton, Stephen Jang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper describes an efficient implementation of sequential synthesis that uses induction to detect and merge sequentially-equivalent nodes. State-encoding, scan chains, and test vectors are essentially preserved. Moreover, the sequential synthesis results are sequentially verifiable using an independent inductive prover similar to that used for synthesis, with guaranteed completeness. Experiments with this sequential synthesis show effectiveness. When applied to a set of 20 industrial benchmarks ranging up to 26K registers and up to 53K 6-LUTs, average reductions in register and area are 12.9% and 13.1% respectively while delay is reduced by 1.4%. When applied to the largest academic benchmarks, an average reduction in both registers and area is more than 30%. The associated sequential verification is also scalable and runs about 2x slower than synthesis. The implementation is available in the synthesis and verification system ABC.
Implementation of Monte Carlo simulation in a distributed computing environment
Authors: Ivaylo Penev
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper presents an approach for achieving better performance of Monte Carlo simulation by implementing the process in a distributed computing environment. The simulation process is analyzed and sub processes, suitable for parallel execution are defined. The proposed approach is demonstrated by applying Monte Carlo simulation for evaluating the market risk of a financial position in an experimental distributed computing environment. Comparison data, obtained by carrying out the same simulation in an environment with one computer and in distributed environment, are presented and analyzed.
Improving Handover Quality in 4G Mobile Systems
Authors: Dongwook Kim, Hanjin Lee, Namgi Kim, Hyunsoo Yoon
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a new handover algorithm to guarantee handover quality in 4G mobile systems. The proposed algorithm limits the handover interruption time by improving the HARQ retransmission latency of the first packet transmitted from new serving cell. Through the simulations, we proved that our algorithm meets the requirement of handover interruption time for TCP services with high rate.
Time-Aggregated Graphs for Modeling Spatio-temporal Networks
Authors: Betsy George, Shashi Shekhar
Venue: Journal on Data Semantics XI (2008)

Given applications such as location based services and the spatio-temporal queries they may pose on a spatial network (e.g., road networks), the goal is to develop a simple and expressive model that honors the time dependence of the road network. The model must support the design of efficient algorithms for computing the frequent queries on the network. This problem is challenging due to potentially conflicting requirements of model simplicity and support for efficient algorithms. Time expanded networks, which have been used to model dynamic networks employ replication of the networks across time instants, resulting in high storage overhead and algorithms that are computationally expensive. In contrast, the proposed time-aggregated graphs do not replicate nodes and edges across time; rather they allow the properties of edges and nodes to be modeled as a time series. Since the model does not replicate the entire graph for every instant of time, it uses less memory and the algorithms for common operations are computationally more efficient than for time expanded networks. One important query on spatio-temporal networks is the computation of shortest paths. Shortest paths can be computed either for a given start time or to find the start time and the path that lead to least travel time journeys (best start time journeys). Developing efficient algorithms for computing shortest paths in a time variant spatial network is challenging because these journeys do not always display optimal prefix property, making techniques like dynamic programming inapplicable. In this paper, we propose algorithms for shortest path computation for a fixed start time. We present the analytical cost model for the algorithm and compare with the performance of existing algorithms.
Parallel implementation of the FETI-DPEM algorithm for general 3D EM simulations
Authors: Yu-Jia Li, Jian-Ming Jin
Venue: Journal of Computational Physics (2009)

A parallel implementation of the electromagnetic dual-primal finite element tearing and interconnecting algorithm (FETI-DPEM) is designed for general three-dimensional (3D) electromagnetic large-scale simulations. As a domain decomposition implementation of the finite element method, the FETI-DPEM algorithm provides fully decoupled subdomain problems and an excellent numerical scalability, and thus is well suited for parallel computation. The parallel implementation of the FETI-DPEM algorithm on a distributed-memory system using the message passing interface (MPI) is discussed in detail along with a few practical guidelines obtained from numerical experiments. Numerical examples are provided to demonstrate the efficiency of the parallel implementation.
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
Authors: Yehuda Lindell, Hila Zarosim
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be static (meaning that it controls a predetermined subset of the parties) or adaptive (meaning that it can choose to corrupt parties during the protocol execution and based on what it sees). In this paper, we study two fundamental questions relating to the basic zero-knowledge and oblivious transfer protocol problems: Adaptive zero-knowledge proofs: We ask whether it is possible to construct adaptive zero-knowledge proofs (with unconditional soundness). Beaver (STOC 1996) showed that known zero-knowledge proofs are not adaptively secure, and in addition showed how to construct zero-knowledge arguments (with computational soundness). Adaptively secure oblivious transfer: All known protocols for adaptively secure oblivious transfer rely on seemingly stronger hardness assumptions than for the case of static adversaries. We ask whether this is inherent, and in particular, whether it is possible to construct adaptively secure oblivious transfer from enhanced trapdoor permutations alone. We provide surprising answers to the above questions, showing that achieving adaptive security is sometimes harder than achieving static security, and sometimes not. First, we show that assuming the existence of one-way functions only, there exist adaptive zero-knowledge proofs for all languages in $\cal {NP}$. In order to prove this, we overcome the problem that all adaptive zero-knowledge protocols known until now used equivocal commitments (which would enable an all-powerful prover to cheat). Second, we prove a black-box separation between adaptively secure oblivious transfer and enhanced trapdoor permutations. As a corollary, we derive a black-box separation between adaptively and statically securely oblivious transfer. This is the first black-box separation to relate to adaptive security and thus the first evidence that it is indeed harder to achieve security in the presence of adaptive adversaries than in the presence of static adversaries.
Image Decomposition Based on Curvelet and Wave Atom
Authors: Chengwu Lu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

To separate oscillating parts such as texture and noise from piecewise smooth parts, a new variational image decomposition model is presented, which well improve the novel Starck's model. The second generation curvelets and wave atoms are used to represent structure and texture respectively. The total variation semi-norm is added for restricting structure parts. The generalized homogeneous Besov norm proposed by Meyer is used to constrain noisy components. Finally, the Basis Pursuit Denoisiing algorithm is used to solve the new model. Experiments show that the approach is very robust to noise, and that can keep edges and textures stably. 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
An evaluation of coordination techniques for protecting objects and territories in tabletop groupware
Authors: David Pinelle, Mutasem Barjawi, Miguel Nacenta, Regan Mandryk
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Indirect input techniques allow users to quickly access all parts of tabletop workspaces without the need for physical access; however, indirect techniques restrict the available social cues that are seen on direct touch tables. This reduced awareness results in impoverished coordination; for example, the number of conflicts might increase since users are more likely to interact with objects that another person is planning to use. Conflicts may also arise because indirect techniques reduce territorial behavior, expanding the interaction space of each collaborator. In this paper, we introduce three new tabletop coordination techniques designed to reduce conflicts arising from indirect input, while still allowing users the flexibility of distant object control. Two techniques were designed to promote territoriality and to allow users to protect objects when they work near their personal areas, and the third technique lets users set their protection levels dynamically. We present the results of an evaluation, which shows that people prefer techniques that automatically provide protection for personal territories, and that these techniques also increase territorial behavior.
Finding Long Paths, Cycles and Circuits
Authors: Harold N. Gabow, Shuxin Nie
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We present a polynomial-time algorithm to find a cycle of length $\exp(\Omega(\sqrt{\log \ell}))$ in an undirected graph having a cycle of length &ge; ℓ. This is a slight improvement over previously known bounds. In addition the algorithm is more general, since it can similarly approximate the longest circuit, as well as the longest S-circuit (i.e., for S an arbitrary subset of vertices, a circuit that can visit each vertex in S at most once). We also show that any algorithm for approximating the longest cycle can approximate the longest circuit, with a square root reduction in length. For digraphs, we show that the long cycle and long circuit problems have the same approximation ratio up to a constant factor. We also give an algorithm to find a vw-path of length &ge; logn/loglogn if one exists; this is within a loglogn factor of a hardness result.
Fair End-to-End Session Rates in Multihop Wireless Networks
Authors: Won-Joo Hwang, Cong-Loi Le
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper considers a proportional fairness of end-to-end session rates in a multihop wireless network through the rate control framework. In multihop wireless networks, there are two classes of rate control problem. One focuses in optimizing the transmission attempt probabilities at the lower layers, but not the transmit powers while other problem is closely related to jointly optimal congestion control and power control. Proportional fairness is a fundamental concept in flow control problems. In this paper, we give in-depth analysis and show that the optimal solutions of these problems are proportionally fair provided that the objective functions are suitably chosen.
The design of parallel solid voxelization based on multi-processor pipeline by program slicing
Authors: Duoduo Liao, Simon Y. Berkovich
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper presents a new design for parallel solid voxelization using the multi-processor pipeline by slicing the program by forced interrupts. The proposed system provides a simple and effective solution to the on-the-fly parallel solid voxelization by relocating the portions of incoming data from processor to processor. It does not need conventional complicated parallel computing methods, such as load balancing, scheduling etc. This is exactly the advantage of this proposed system. Furthermore, the system only requires practically the same software as ordinary sequential solid voxelization algorithm. In this paper, the general parallel solid voxelization algorithm is summarized as apposed to the general sequential solid voxelization algorithm. The proposed system and the principle of parallel solid voxelization by multi-processor pipeline will be described and discussed in detail. In the end, the conclusions and future work are addressed.
Efficient Frequency Converters Based on Stimulated Raman Scattering in Hollow Core Photonic Crystal Fibres Filled with Nonlinear Liquids
Authors: Sylvie Lebrun, Philippe Delaye, Robert Frey, Gérald Roosen
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

Recent developments in the field of nonlinear optics with photonic crystal fibers have led to the realization of supercontinuum spectra or parametric sources of correlated photons. However the nonlinearities were still limited by the use of silica. Hollow core photonic crystal fibers (HCPCF) filled with highly nonlinear liquids or gases enable the implementation of more performing nonlinear devices and open the scope of potential applications thanks to the large variety of usable liquids and gases. Moreover liquid and gas filled HCPCF present several original propagation properties such as transmission bands that can be tailored to favor or prevent a given nonlinear mechanism. In this work we will show that the on-purpose limited transmission band enables a high conversion efficiency towards a single Stokes component even at high pump intensities. Moreover such Raman converters generate single spatial mode at specific wavelengths that can be determined to fit desired applications.
A static API birthmark for Windows binary executables
Authors: Seokwoo Choi, Heewan Park, Hyun-il Lim, Taisook Han
Venue: Journal of Systems and Software (2009)

A software birthmark is the inherent characteristics of a program extracted from the program itself. By comparing birthmarks, we can detect whether a program is a copy of another program or not. We propose a static API birthmark for Windows executables that utilizes sets of API calls identified by a disassembler statically. By comparing 49 Windows executables, we show that our birthmark can distinguish similar programs and detect copies. By comparing binaries generated by various compilers, we also demonstrate that our birthmark is resilient. We compare our birthmark with a previous Windows dynamic birthmark to show that it is more appropriate for GUI applications.
Generalizations of Sch&#x00f6;bi&#x2019;s Tetrahedral Dissection
Authors: N. J. A. Sloane, Vinay A. Vaishampayan
Venue: Discrete Computational Geometry (2009)

Let v 1,&#x2026;,v n be unit vectors in &#x211d;n such that v i &#x22c5;v j =&#x2212;w for i&#x2260;j, where $-1<w<\frac{1}{n-1}$. The points &#x2211; i=1 n &#x03bb; i v i (1&#x2265;&#x03bb; 1&#x2265;&#x22c5;&#x22c5;&#x22c5;&#x2265;&#x03bb; n &#x2265;0) form a &#x201c;Hill-simplex of the first type,&#x201d; denoted by $\mathcal {Q}_{n}(w)$. It was shown by Hadwiger in 1951 that $\mathcal {Q}_{n}(w)$is equidissectable with a cube. In 1985, Sch&#x00f6;bi gave a three-piece dissection of $\mathcal {Q}_{3}(w)$into a triangular prism $c\mathcal {Q}_{2}(\frac{1}{2})\times I$, where I denotes an interval and $c=\sqrt{2(w+1)/3}$. In this paper, we generalize Sch&#x00f6;bi&#x2019;s dissection to an n-piece dissection of $\mathcal {Q}_{n}(w)$into a prism $c\mathcal {Q}_{n-1}(\frac{1}{n-1})\times I$, where $c=\sqrt{(n-1)(w+1)/n}$. Iterating this process leads to a dissection of $\mathcal {Q}_{n}(w)$into an n-dimensional rectangular parallelepiped (or &#x201c;brick&#x201d;) using at most n! pieces. The complexity of computing the map from $\mathcal {Q}_{n}(w)$to the brick is O(n 2). A second generalization of Sch&#x00f6;bi&#x2019;s dissection is given which applies specifically in &#x211d;4. The results have applications to source coding and to constant-weight binary codes.
A method of rule match conflict resolution for product configuration in manufacturing
Authors: Niya Li, Dayou Liu, Jian Zhang, Yuhua Chen
Venue: International Journal of Computer Integrated Manufacturing (2009)

Rule-based reasoning is a commonly used method for product configuration in manufacturing. Rule match conflict resolution is an essential and critical issue for this method. In this paper, the conflicts are categorised into two types: the conflicts irrelevant to business and the conflicts relevant to business. The conflicts irrelevant to business originate from the rule-based reasoning mechanism, while the conflicts relevant to business originate from the product manufacturing logic. In order to resolve the two different kinds of conflicts, input and output matrices are created based on a positive reasoning rule model. The paper puts forward an evaluation function for resolving the conflicts irrelevant to business by the input matrix and a resolution method for resolving the conflicts relevant to business by the output matrix. Using a data-driven control strategy and the above conflict resolution methods, a product configuration-reasoning algorithm supporting the conflict resolution is given. Finally, an example demonstrates the feasibility of the approach.
Enforcing performance isolation across virtual machines in Xen
Authors: Diwaker Gupta, Ludmila Cherkasova, Rob Gardner, Amin Vahdat
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Virtual machines (VMs) have recently emerged as the basis for allocating resources in enterprise settings and hosting centers. One benefit of VMs in these environments is the ability to multiplex several operating systems on hardware based on dynamically changing system characteristics. However, such multiplexing must often be done while observing per-VM performance guarantees or service level agreements. Thus, one important requirement in this environment is effective performance isolation among VMs. In this paper, we address performance isolation across virtual machines in Xen [1]. For instance, while Xen can allocate fixed shares of CPU among competing VMs, it does not currently account for work done on behalf of individual VMs in device drivers. Thus, the behavior of one VM can negatively impact resources available to other VMs even if appropriate per-VM resource limits are in place. In this paper, we present the design and evaluation of a set of primitives implemented in Xen to address this issue. First, XenMon accurately measures per-VM resource consumption, including work done on behalf of a particular VM in Xen's driver domains. Next, our SEDF-DC scheduler accounts for aggregate VM resource consumption in allocating CPU. Finally, ShareGuard limits the total amount of resources consumed in privileged and driver domains based on administrator-specified limits. Our performance evaluation indicates that our mechanisms effectively enforce performance isolation for a variety of workloads and configurations.
Test Data Generation of Bytecode by CLP Partial Evaluation
Authors: Elvira Albert, Miguel Gómez-Zamalloa, Germán Puebla
Venue: Logic-Based Program Synthesis and Transformation: 18th International Symposium, LOPSTR 2008, Valencia, Spain, July 17-18, 2008, Revised Selected Papers (2009)

We employ existing partial evaluation (PE) techniques developed for Constraint Logic Programming (CLP) in order to automatically generate test-case generators for glass-box testing of bytecode. Our approach consists of two independent CLP PE phases. (1) First, the bytecode is transformed into an equivalent (decompiled) CLP program. This is already a well studied transformation which can be done either by using an ad-hoc decompiler or by specialising a bytecode interpreter by means of existing PE techniques. (2) A second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program. Interestingly, we employ control strategies previously defined in the context of CLP PE in order to capture coverage criteria for glass-box testing of bytecode. A unique feature of our approach is that, this second PE phase allows generating not only test-cases but also test-case generators. To the best of our knowledge, this is the first time that (CLP) PE techniques are applied for test-case generation as well as to generate test-case generators.
Safety shell for specification-PEARL oriented UML real-time projects
Authors: Roman Gumzej, Matja Colnarič, Wolfgang A. Halang
Venue: Computer Languages, Systems and Structures (2009)

A safety shell for real-time applications to be developed with UML is defined based on a re-configuration management pattern. Inspired by the architectural specifications in the Specification PEARL methodology, the pattern is parameterised by defining the properties of its components as well as by defining how the software is to be mapped to the hardware architecture. The initial and alternative scenarios are defined as well as the method for switching between them. This article includes the description of the UML pattern and of its parameterisation method, with the goal to obtain clearly specified operation scenarios with well-defined transitions among them. In order to achieve safe and timely operation, the pattern must provide a safety shell for all scenarios, i.e., enable their deterministic, temporally predictable operation, and transitions between them.
Automating Privacy Compliance with ExPDT
Authors: Martin Kähmer, Maike Gilliot, Günter Müller
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Today, personalized services are lucrative for service providers and their customers. With their increasing pervasiveness and interconnection, however, customers show concerns about their privacy. If customers were to refuse the processing of their personal data in general, the economic potential of personalized services could not be realized. We claim that such scepticism is a direct consequence of incomplete control mechanisms. To be in line with laws and to help users to control the usage of their personal data, we propose the Extended Privacy Definition Tool (ExPDT) that not only provides customers as well as service providers with a formal language to specify and to compare different policies, but also providers with a monitor tool to enforce the policies within their services.
Brief paper: New delay-dependent stability criteria for systems with interval delay
Authors: Hanyong Shao
Venue: Automatica (Journal of IFAC) (2009)

This paper provides a new delay-dependent stability criterion for systems with a delay varying in an interval. With a different Lyapunov functional defined, a tight upper bound of its derivative is given. The resulting criterion has advantages over some previous ones in that it involves fewer matrix variables but has less conservatism, which is established theoretically. Examples are provided to demonstrate the advantage of the stability result.