ppxscal/embedding_network huggingface dataset:
Efficient Generation of Parallel Quasirandom Faure Sequences Via Scrambling
Authors: Hongmei Chi, Michael Mascagni
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Much of the recent work on parallelizing quasi-Monte Carlo methods has been aimed at splitting a quasirandom sequence into many subsequences which are then used independently on the various parallel processes. This method works well for the parallelization of pseudorandom numbers, but due to the nature of quality in quasirandom numbers, this technique has many drawbacks. In contrast, this paper proposes an alternative approach for generating parallel quasirandom sequences via scrambling. The exact meaning of the digit scrambling we use depends on the mathematical details of the quasirandom number sequence's method of generation. The Faure sequence is scramble by modifying the generator matrices in the definition. Thus, we not only obtain the expected near-perfect speedup of the naturally parallel Monte Carlo methods, but the errors in the parallel computation is even smaller than if the computation were done with the same quantity of quasirandom numbers using the original Faure sequence.
Removing the stiffness of elastic force from the immersed boundary method for the 2D Stokes equations
Authors: Thomas Y. Hou, Zuoqiang Shi
Venue: Journal of Computational Physics (2008)

The immersed boundary method has evolved into one of the most useful computational methods in studying fluid structure interaction. On the other hand, the immersed boundary method is also known to suffer from a severe timestep stability restriction when using an explicit time discretization. In this paper, we propose several efficient semi-implicit schemes to remove this stiffness from the immersed boundary method for the two-dimensional Stokes flow. First, we obtain a novel unconditionally stable semi-implicit discretization for the immersed boundary problem. Using this unconditionally stable discretization as a building block, we derive several efficient semi-implicit schemes for the immersed boundary problem by applying the small scale decomposition to this unconditionally stable discretization. Our stability analysis and extensive numerical experiments show that our semi-implicit schemes offer much better stability property than the explicit scheme. Unlike other implicit or semi-implicit schemes proposed in the literature, our semi-implicit schemes can be solved explicitly in the spectral space. Thus the computational cost of our semi-implicit schemes is comparable to that of an explicit scheme, but with a much better stability property.
The Hidden Root Problem
Authors: Frederik Vercauteren
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

In this paper we study a novel computational problem called the Hidden Root Problem, which appears naturally when considering fault attacks on pairing based cryptosystems. Furthermore, a variant of this problem is one of the main obstacles for efficient pairing inversion. We present an algorithm to solve this problem over extension fields and investigate for which parameters the algorithm becomes practical.
About Universal Hybrid Networks of Evolutionary Processors of Small Size
Authors: Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

A hybrid network of evolutionary processors (an HNEP) is a graph with a language processor, input and output filters associated to each node. A language processor performs one type of point mutations (insertion, deletion or substitution) on the words in that node. The filters are defined by certain variants of random-context conditions. In this paper, we present a universal complete HNEP with 10 nodes simulating circular Post machines and show that every recursively enumerable language can be generated by a complete HNEP with 10 nodes. Thus, we positively answer the question posed in [5] about the possibility to generate an arbitrary recursively enumerable language over an alphabet V with a complete HNEP of a size smaller than 27 + 3·card(V).
New Bisimulation Semantics for Distributed Systems
Authors: David Frutos-Escrig, Fernando Rosa-Velardo, Carlos Gregorio-Rodríguez
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Bisimulation semantics are a very pleasant way to define the semantics of systems, mainly because the simplicity of their definitions and their nice coalgebraic properties. However, they also have some disadvantages: they are based on a sequential operational semantics defined by means of an ordinary transition system, and in order to be bisimilar two systems have to be "too similar". In this work we will present several natural proposals to define weaker bisimulation semantics that we think properly capture the desired behaviour of distributed systems. The main virtue of all these semantics is that they are real bisimulation semantics, thus inheriting most of the good properties of bisimulation semantics. This is so because they can be defined as particular instances of Jacobs and Hughes' categorical definition of simulation, which they have already proved to satisfy all those properties.
Evolutionary abstraction of semantics for domain specific computing with words
Authors: Adel Ali
Venue:  (2007)

The World Wide Web contains numerous information that are scattered all over the world. Even though they are physically located in different geographical area, any persons with access to the Internet could have access to it at any given time from any locations. Along with the growth of Internet access, the amount of information on the World Wide Web will continue to grow. Therefore, it is no longer feasible to search the Internet for specific information without the help of a search engine. Currently, search engines utilize techniques that look for particular keywords on web pages rather than deducing an answer based on the question posed. The search engine would generate list of web pages containing the given keywords and forced users to manually sort to find the desired page. It is believed that search engines must incorporate natural language processing in order to become a question answer system that no longer list results but capable to give answer to a particular question posed by the user. In order to apply the above processing, computers must have Computing with Words (CW) capabilities where elements of computation are derived from natural language. Unfortunately, building machine knowledge of sentences and its meaning is a computationally intensive process with high turnaround time, thus making it unfeasible with current technology. It is proposed that to reduce the computational power and turnaround time needed to do such processing by incorporating genetic programming into the construction of the machine knowledge. Genetic programming will help to reduce the amount of nodes in the Treebank to be processed in order to obtain a result. In addition, domain specific Treebank will be utilized to reduce the size of the sentence tree. Employing these methods, we plan to develop a tree that allow computers to process and build a knowledge base as a primary step to achieve computing with words.
Periodic Motion Detection on Patient with Motion Disorders
Authors: Zdenka Uhríková, Václav Hlavác
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

The proposed method serves for detecting and analysing translating and non-translating periodic motion with small oscillation from video data. Periodic motion in a video sequence is detected using principles of motion accumulation. Non-translating periodic motion is described as change of the point brightness over the time. The trajectory of the motion is obtained by tracking the translating object with periodic motion. Following frequency analysis is done by the means of Fourier transform. The developed method is applied for observing patients suffering from Parkinson disease.
Steganographic Schemes for File System and B-Tree
Authors: HweeHwa Pang Kian-Lee Tan
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. This paper introduces StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence. Unlike other steganographic schemes proposed previously, our construction satisfies the prerequisites of a practical file system in ensuring the integrity of the files and maintaining efficient space utilization. We also propose two schemes for implementing steganographic B-trees within a StegFD volume. We have completed an implementation on Linux, and results of the experiment confirm that StegFD achieves an order of magnitude improvements in performance and/or space utilization over the existing schemes.
Technical notes: a VLISP interpreter on the VCMC1 machine
Authors: Jerome Chailloux
Venue: Issue 2 (July 1978) (1978)

VCMC1 is a virtual machine designed to observe "in vitro" the behaviour of VLISP interpreters. VCMC1 is actually entirely simulated in VLISP 10. We present a short description of the VCMC1 machine followed by the complete listing of the code of a VLISP interpreter, This interpreter incorporates the special feature for tail-recursion function calls.
Incremental pattern matching in the viatra model transformation system
Authors: Gábor Bergmann, András Ökrös, István Ráth, Dániel Varró, Gergely Varró
Venue: Proceedings of the third international workshop on Graph and model transformations (2008)

Incremental pattern matching is a key challenge for many tool integration, model synchronization and (discrete-event) model simulation tasks. An incremental pattern matching engine explicitly stores existing matches, while these matches are maintained incrementally with respect to the changes of the underlying model. In the current paper, we present an adaptation of RETE networks [6] in order to provide incremental support for the transformation language of the VIATRA2 framework. We evaluate the performance of the incremental engine on a benchmark problem assessing the speedup of incremental processing in the case of as-long-as-possible type of rule applications.
L4oprof: A System-Wide Profiler Using Hardware PMU in L4 Environment
Authors: Jugwan Eom, Dohun Kim, Chanik Park
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

The recent advance of L4 microkernel technology enables building a secure embedded system with comparable performance to a traditional monolithic kernel-based system. According to the different system software architecture, the execution behavior of an application in microkernel environment differs greatly from that in traditional monolithic environment. Therefore, we need a performance profiler to improve performance of the application in microkernel environment. Currently, L4's profiling tools provides only program-level information such as the number of function calls, IPCs, context switches, etc. In this paper, we present L4oprof, a system-wide statistical profiler in L4 microkernel environment. L4oprof leverages the hardware performance counters of PMU on a CPU to enable profiling of a wide variety of hardware events such as clock cycles and cache and TLB misses. Our evaluation shows that L4oprof incurs 0~3% higher overhead than Linux OProfile. Moreover, the main cause of performance loss in L4Linux applications is shown compared with Linux applications.
Can They Be Fixed: Some Thoughts After 40 Years in the Business
Authors: Yale Patt
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

If there is one thing the great Greek teachers taught us, it was to question what is, and to dream about what can be. In this audience, unafraid that no one will ask me to drink the hemlock, but humbled by the realization that I am walking along the beach where great thinkers of the past have walked, I nonetheless am willing to ask some questions that continue to bother those of us who are engaged in education: professors, students, and those who expect the products of our educational system to be useful hires in their companies.As I sit in my office contemplating which questions to ask between the start of my talk and when the dinner is ready, I have come up with my preliminary list. By the time July 21 arrives and we are actually on Samos, I may have other questions that seem more important. Or, you the reader may feel compelled to pre-empt me with your own challenges to conventional wisdom, which of course would be okay, also.In the meantime, my preliminary list: Are students being prepared for careers as graduates? (Can it be fixed?)Are professors who have been promoted to tenure prepared for careers as professors? (Can it be fixed?)What is wrong with education today? (Can it be fixed?)What is wrong with research today? (Can it be fixed?)What is wrong with our flagship conferences? and Journals? (Can they be fixed?)
Reasoning about Conditions and Exceptions to Laws in Regulatory Conformance Checking
Authors: Nikhil Dinesh, Aravind Joshi, Insup Lee, Oleg Sokolsky
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

This paper considers the problem of checking whether an organization conforms to a body of regulation. Conformance is cast as a trace checking question --- the regulation is represented in a logic that is evaluated against an abstract trace or run representing the operations of an organization. We focus on a problem in designing a logic to represent regulation.A common phenomenon in regulatory texts is for sentences to refer to others for conditions or exceptions. We motivate the need for a formal representation of regulation to accomodate such references between statements. We then extend linear temporal logic to allow statements to refer to others. The semantics of the resulting logic is defined via a combination of techniques from Reiter's default logic and Kripke's theory of truth.
VLSI Implementation of a Functional Unit to Accelerate ECC and AES on 32-Bit Processors
Authors: Stefan Tillich, Johann Großschädl
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

Embedded systems require efficient yet flexible implementations of cryptographic primitives with a minimal impact on the overall cost of a device. In this paper we present the design of a functional unit (FU) for accelerating the execution of cryptographic software on 32-bit processors. The FU is basically a multiply-accumulate (MAC) unit able to perform multiplications and MAC operations on integers and binary polynomials. Polynomial arithmetic is a performance-critical building block of numerous cryptosystems using binary extension fields, including public-key primitives based on elliptic curves (e.g. ECDSA), symmetric ciphers (e.g. AES or Twofish), and hash functions (e.g. Whirlpool). We integrated the FU into the Leon2 SPARC V8 core and prototyped the extended processor in an FPGA. All operations provided by the FU are accessible to the programmer through custom instructions. Our results show that the FU allows to accelerate the execution of 128-bit AES by up to 78% compared to a conventional software implementation using only native SPARC V8 instructions. Moreover, the custom instructions reduce the code size by up to 87.4%. The FU increases the silicon area of the Leon2 core by just 8,352 gates and has almost no impact on its cycle time.
Weighted Hyper-sphere SVM for Hypertext Classification
Authors: Shuang Liu, Guoyou Shi
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

With more and more hypertext documents available online, hypertext classification has become one popular research topic in information retrieval. Hyperlinks, HTML tags and category labels distributed over linked documents provide rich classification information. Integrating these information and content tfidf result as document feature vector, this paper proposes a new weighted hyper-sphere support vector machine for hypertext classification. Based on eliminating the influence of the uneven class sizes with weight factors, the new method solves multi-class classification with less computational complexity than binary support vector machines. Experiments on benchmark data set verify the efficiency and feasibility of our method.
Liberate Computer User from Programming
Authors: Teodor Rus
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

This paper is about computer-based problem solving methodology. The issue addressed is: can we develop a computer-based problem-solving methodology which is not based on computer programming? The answer we provide to this question is YES. This raises the next question: if we do not use programming how do we communicate problem solving algorithms to the computer? The answer to this question is: (1) develop software tools that support domain algorithm execution in the problem domain environment (no programming as usual) and (2) allow problem-domain experts to express their problem-solving algorithms using the natural language of their problem domains. We achieve this computer-based problem solving methodology by computational emancipation of the application domain, which consists of: 1 Characterize the application domain in terms of concepts that are universal in the domain, have standalone computing meaning, and are composable. 1 Structure the application domain using an ontology where terms denoting domain characteristic concepts are associated with computer artifacts implementing them. 1 Develop a domain-dedicated virtual machine that executes domain algorithms expressed in the natural language of the domain (without asking to encode them into programs) and implement it on the physical computers existent in the computer-network. With this methodology computers execute algorithms whose expressions are conceptual, similar to the way human brain would execute them.
A location service for position-based routing in mobile ad hoc networks
Authors: Ebtisam Amar, Selma Boumerdassi
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Position-based routing protocols take advantage of location information so that stateless and efficient routing is achieved. To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks. In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the entire network is partitioned into a hierarchy of smaller and smaller regions. For each node, one node in each-level region of the hierarchy is chosen as its local location server. When network initializes or nodes attach the network, nodes contact their local location server with their current location information (position and velocity), the only need to update its location server when it moves away from its current region. Nodes query their location servers and get exact or predicted location of nodes to communicate with.
Electronic institutions development environment
Authors: M. Esteva, J. A. Rodriguez-Aguilar, J. LL. Arcos, C. Sierra, P. Noriega, B. Rosell, D. de la Cruz
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

In this paper we present the Electronic Institutions Development Environment (EIDE) to support the engineering of multiagent systems as Electronic Institutions. An electronic institution defines a set of rules that structure agent interactions, establishing what agents are permitted and forbidden to do, as well as the consequences of their actions. EIDE supports and facilitates all the stages of electronic institutions' engineering, namely from the specification of an institutional rules to its execution and monitoring.
Multi-fidelity User Interface Specifications
Authors: Thomas Memmel, Jean Vanderdonckt, Harald Reiterer
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

Specifying user interfaces consists in a fundamental activity in the user interface development life cycle as it informs the subsequent steps. Good quality specifications could lead to a user interface that satisfies the user's needs. The user interface development life cycle typically involves multiple actors possessing all their own particular inputs of user interface artifacts expressed with their own formats, thus posing new constraints for integrating them into comprehensive and consistent specifications of a future user interface. This paper introduces a design technique where these actors can introduce their artifacts by sketching them in their respective input format so as to integrate them into one or multiple output formats. Each artifact can be introduced in a particular level of fidelity (ranging from low to high) and switched to an adjacent level of fidelity after appropriate refining. Refined artifacts are then captured in appropriate models stored in a model repository. In this way, co-evolutionary design of user interfaces is introduced, defined, and supported by a collaborative design tool allowing multiple inputs and multiple outputs. This design paradigm is exemplified on a case study and has been tested in an empirical study revealing how designers appreciate it.
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
Authors: Christian Urban, Bozhi Zhu
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

Powerful proof techniques, such as logical relation arguments, have been developed for establishing the strong normalisation property of term- rewriting systems. The first author used such a logical relation argument to establish strong normalising for a cut-elimination procedure in classical logic. He presented a rather complicated, but informal, proof establishing this property. The difficulties in this proof arise from a quite subtle substitution operation, which implements proof transformation that permute cuts over other inference rules. We have formalised this proof in the theorem prover Isabelle/HOL using the Nominal Datatype Package, closely following the informal proof given by the first author in his PhD-thesis. In the process, we identified and resolved a gap in one central lemma and a number of smaller problems in others. We also needed to make one informal definition rigorous. We thus show that the original proof is indeed a proof and that present automated proving technology is adequate for formalising such difficult proofs.