ppxscal/embedding_network huggingface dataset:
Mercury: Combining Performance with Dependability Using Self-virtualization
Authors: Haibo Chen, Rong Chen, Fengzhe Zhang, Binyu Zang, Pen-Chung Yew
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

There has recently been increasing interests in using system virtualization to improve the dependability of HPC cluster systems. However, it is not cost-free and may come with some performance degradation, uncertain QoS and loss of functionalities. Meanwhile, many virtualization-enabled features such as online maintenance and fault tolerance do not require virtualization being always on. This paper proposes a technique, called self-virtualization, that supports dynamically attaching and detaching a full-fledged virtual machine monitor (VMM) beneath an operating system, without disturbing applications thereon, and rid the system of potential overhead when the virtualization is not needed. This technique enables HPC clusters to reap most benefits from virtualization without sacrificing performance. This paper presents the design and implementation of Mercury, a working prototype based on Linux and Xen VMM. Our performance measurement shows that Mercury incurs very little overhead: about 0.2 ms to complete a mode switch, and negligible performance degradation compared to Linux.
Mining Frequent Items Based on Bloom Filter
Authors: ShuYun Wang, XiuLan Hao, HeXiang Xu, YunFa Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper introduce the algorithm MIBFD(Mining fre- quent Items using Bloom Filter based on Damped model) for mining recent frequent items in data streams. Based on an efficient data structure named extensible and scalable Bloom Filter(ESBF), MIBFD is able to adjust the size of memory used dynamically. Theoretical analysis and experi- ments show that MIBFD is efficient both in processing time and in memory usage.
Transition Skew Coding: A Power and Area Efficient Encoding Technique for Global On-Chip Interconnects
Authors: C. J. Akl, M. A. Bayoumi
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Global signaling is becoming more and more challenging as technology scales down toward the deep submicron. We propose a new bus encoding technique, transition skew coding, that targets many of the global interconnects challenges such as crosstalk, peak energy and current, switching and leakage power, repeaters area, wiring area, signal integrity and noise. Simulations are done on different bus lengths using a 90nm library. Repeaters sizing and spacing are optimized, and the proposed encoded bus is compared against a standard bus and a bus with shields inserted between every two wires. The encoding and decoding latencies are also analyzed. Simulations show that transition skew coding is efficient in terms of energy and area with low encoding and decoding latency overhead.
Building Domain-Specific Languages for Model-Driven Development
Authors: Jesús Sánchez Cuadrado, Jesús García Molina
Venue: IEEE Software (2007)

The emergence of the model-driven development paradigm has revitalized interest in domain-specific languages. Embedding a DSL in a dynamic language facilitates rapid development. This article illustrates dynamic-language features and techniques that the authors found useful while developing embedded DSLs in Ruby for a model-driven development tool. For this domain, it's possible to achieve a runtime performance comparable to existing tools while shortening development time. This article is part of a special issue on dynamically typed languages.
Characteristics of geographic information needs
Authors: Andreas Henrich, Volker Luedecke
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

A Geographic Information Retrieval (GIR) system for answering geographic queries has to cope with various information needs, which have a wide range of contexts and implicit requirements. A user, for example, who is looking for a place to spend his or her holidays certainly has a different understanding of distance than a user looking for a bar in the city he or she lives in. To get a better understanding of geographic information needs and their implications for GIR systems, we analysed real world (geographic) queries with regard to different facets of geographic references in queries. The results of this analysis are presented in this paper, the aim of which was a classification of the geographic aspects of information needs. We present empirical results and line out possible classification criteria, which could be helpful in designing GIR systems that are able to consider different semantics of geographic references in queries.
An extension of likelihood-ratio-test for testing linear hypotheses in the baseline-category logit model
Authors: L. Pardo, M. C. Pardo
Venue: Computational Statistics Data Analysis (2008)

A new family of test statistics for testing linear hypotheses in baseline-category logit models is introduced and its asymptotic distribution is obtained. The new family is a natural extension of the classical likelihood ratio test. A simulation study is carried out to find new test statistics that offer an attractive alternative to the classical likelihood ratio test in terms of both exact size and exact power.
Secure web service federation management using tpm virtualisation
Authors: Srijith Krishnan Nair, Ivan Djordjevic, Bruno Crispo, Theo Dimitrakos
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

Web Services and SOA provide interoperability and architectural baseline for flexible and dynamic cross enterprise collaborations, where execution and use of the participating services contributes to the common objective. Relationships within these collaborations are complex, with services joining and leaving throughout the life cycle, or the same services being offered in several collaborations simultaneously. This provides strong requirements for federated security, where integrity and confidentiality of the collaboration must be maintained through membership control, security policy enforcement and separation of web service instance interactions in different collaborations. In this paper we propose a new Web Services (WS) framework for managing and controlling WS interactions in a federated environment, leveraging on platform virtualisation architecture and the functionalities provided by trusted secure hardware. The framework allows configuring policies that define collaboration membership, and enforce access to the collaboration per-WS instance. In addition, since the access to the configurations is restricted, it provides masterslave model where only authorised administrative entity can modify any of the above - either at the deployment or at the execution time. Some of the benefits of the proposed approach are: fine-grained external exposure of WSs, a flexible model for group membership control and revocation and hardware-enabled secure virtualised system providing functional process isolation and strong data security.
Censored depth quantiles
Authors: M. Debruyne, M. Hubert, S. Portnoy, K. Vanden Branden
Venue: Computational Statistics Data Analysis (2008)

Quantile regression is a wide spread regression technique which allows to model the entire conditional distribution of the response variable. A natural extension to the case of censored observations has been introduced using a reweighting scheme based on the Kaplan-Meier estimator. The same ideas can be applied to depth quantiles. This leads to regression quantiles for censored data which are robust to both outliers in the predictor and the response variable. For their computation, a fast algorithm over a grid of quantile values is proposed. The robustness of the method is shown in a simulation study and on two real data examples.
A Coevolution Approach for Learning Multimodal Concepts
Authors: Zhichun Wang, Minqiang Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper, we propose a cooperative coevolution approach to learn rules for the description of multimodal concepts. Multiple species are evolved in parallel; each evolves a particular part of the description of the target concepts. The algorithm allows the number and roles of the species to be adapted; more accurate and general rules are generated. The proposed algorithm has been compared to other two popular concept learning algorithms on five benchmark datasets from the UCI machine learning repository. Results show that the proposed algorithm can achieve higher performance while still produces a smaller number of rules.
Tools for model-based security engineering: models vs. code
Authors: Jan Jürjens, Yijun Yu
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We present tools to support model-based security engineering at both the model and the code level. In the approach supported by these tools, one firstly specifies the security-critical part of the system (e.g. a crypto protocol) using the UML security extension UMLsec. The models are automatically verified for security properties using automated theorem provers. These are implemented within a framework that supports implementing verification routines, based on XMI output of the diagrams from UML CASE tools. Advanced users can use this open-source framework to implement verification routines for the constraints of self-defined security requirement In a second step, one verifies that security-critical parts of the model are correctly implemented in the code (which might be a legacy implementation), and applies security hardening transformations where that is not the case. This is supported by tools that (1) establish traceability through refactoring scripts and (2) modularize security hardening advices through aspect-oriented programming. The proposed method has been applied to an open-source implementation of a cryptographic protocol implementation (Jessie) in Java to build up traceability mappings and security aspects. In that application, we found a security weakness which could be fixed using our approach. The resulting refactoring scripts and security aspects have found reusability in the Java Secure Socket Extension (JSSE) library
SimWattch: Integrating Complete-System and User-Level Performance and Power Simulators
Authors: Jianwei Chen, Michel Dubois, Per Stenström
Venue: IEEE Micro (2007)

Evaluating the impact of applications with significant operating-system interactions requires detailed microarchitectural simulation combined with system-level simulation. A cost-effective and practical approach is to combine two widely used simulators. SimWattch integrates Simics, a system-level tool, with Wattch, a user-level tool, to facilitate analysis of a wider design space for computer architects and system developers.
It's Time to Stop Calling Circuits "Hardware"
Authors: Frank Vahid
Venue: Computer (2007)

Expanding the software concept to spatial models like circuits will facilitate programming next-generation embedded systems.
Symmetry, Automorphism, and Test
Authors: C. Turcat
Venue: IEEE Transactions on Computers (1979)

This paper shows how network symmetries (or the graph-theory concept of automorphism) can be used to cluster faults into classes and thus simplify the process of finding a test set: tests for these automorphic classes are found by classical methods and then expanded using automorphisms to produce a test-set. The process does not seem more complex than the classical ones. Furthermore, by using a multilevel description, the process is easily extended to networks of modules.
Artistically-based technique for aging of the facial modeling
Authors: Hiroko Uchiyama, Makoto Danjou, Ayako Tateishi, Yuko Masunaga, Masa Inakage
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

This paper proposes a method of expressing facial aging based on visual expression techniques cultivated by artists from days of old. A large number of previous researches have been undertaken pertaining to aging, based on simulation and automation model[1,2,3,8]. In this research, we present a novel approach that is based on expression techniques by artists and propose an artistically-based techniques for visual simulation of facial aging. The technique is applied to the self-portrait painted by the 17th century Dutch painter Rembrandt van Rijn to compare the proposed technique with the painting.
Configuration and extension of embedded processors to optimize IPSec protocol execution
Authors: Nachiketh R. Potlapally, Srivaths Ravi, Anand Raghunathan, Ruby B. Lee, Niraj K. Jha
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Security protocols, such as IPSec and SSL, are being increasingly deployed in the context of networked embedded systems. The resource-constrained nature of embedded systems and, in particular, the modest capabilities of embedded processors make it challenging to achieve satisfactory performance while executing security protocols. A promising approach for improving performance in embedded systems is to use application-specific instruction set processors that are designed based on configurable and extensible processors. In this paper, we perform a comprehensive performance analysis of the IPSec protocol on a state-of-the-art configurable and extensible embedded processor (Xtensa from Tensilica Inc.). We present performance profiles of a lightweight embedded IPSec implementation running on the Xtensa processor, and examine in detail the various factors that contribute to the processing latencies, including cryptographic and protocol processing. In order to improve the efficiency of IPSec processing on embedded devices, we then study the impact of customizing an embedded processor by synergistically 1) configuring architectural parameters, such as instruction and data cache sizes, processor-memory interface width, write buffers, etc., and 2) extending the base instruction set of the processor using custom instructions for both cryptographic and protocol processing. Our experimental results demonstrate that upto 3.2 × speedup in IPSec processing is possible over a popular embedded IPSec software implementation.
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks
Authors: Athanasios Bamis, Azzedine Boukerche, Ioannis Chatzigiannakis, Sotiris Nikoletseas
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In mobile ad hoc networks (MANETs), the mobility of the nodes is a complicating factor that significantly affects the effectiveness and performance of the routing protocols. Our work builds upon recent results on the effect of node mobility on the performance of available routing strategies (i.e., path-based, using support) and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution. We introduce a metric for the relative mobility of the nodes, according to which the nodes are classified into mobility classes. These mobility classes determine, for any pair of origin and destination, the routing technique that best corresponds to their mobility properties. Moreover, special care is taken for nodes remaining almost stationary or moving with high (relative) speeds. Our key design goal is to limit the necessary implementation changes required to incorporate existing routing protocols into our framework. We provide extensive evaluation of the proposed framework, using a well-known simulator (NS2). Our first findings demonstrate that the proposed framework improves, in certain cases, the performance of existing routing protocols.
Integrating Cross-Modal Context for PP Attachment Disambiguation
Authors: Patrick McCrae
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Correct prepositional phrase (PP) attachment is a notoriously hard problem in natural language parsing. Despite the inherent structural ambiguity it introduces, human communication still succeeds in most cases with remarkable robustness. The reason for this is that in processing natural language humans also integrate information from sources other than the linguistic material alone. Humans access additional knowledge to enrich the semantic specification that guides syntactic and semantic disambiguation. One important source of additional knowledge for humans is cross-modal context as construed from sensory perception. Motivated by effects during human sentence processing we propose to integrate contextual knowledge into syntactic parsing to support PP-attachment disambiguation. We hypothesise that integrating cross-modal context into syntactic constraint dependency parsing will significantly and substantially improve the accuracy of PP attachment disambiguation.
On the stability analysis of nonlinear systems using polynomial Lyapunov functions
Authors: Hajer Bouzaouache, Naceur Benhadj Braiek
Venue: Mathematics and Computers in Simulation (2008)

In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist positive definite quadratic Lyapunov function that proves stability of the system, but doesn't show that the system isn't stable. So, we must search for other Lyapunov functions. That's why, in the present paper, the construction of polynomial Lyapunov candidate functions is investigated and sufficient conditions for global asymptotic stability of analytical nonlinear systems are proposed to allow computational implementation. The main keys of this work are the description of the nonlinear studied systems by polynomial state equations, the use of an efficient mathematical tool: the Kronecker product; and the non-redundant state formulation. These notations allow algebraic manipulations and make easy the extension of the stability analysis associated to quadratic or homogeneous Laypunov functions towards more general functions. The advantage of the proposed approach is that the derived conditions proving the stability of the studied systems can be presented as linear matrix inequalities (LMIs) feasibility tests and the obtained results can show in some cases how the polynomial Lyapunov functions leads to less conservative results than those obtained via quadratic (QLFs) or monomial Laypunov functions. This contribution to the stability analysis of high order nonlinear continuous systems can be extended to the stability, robust analysis and control of other classes of systems.
Rotation Invariant Shape Contexts based on Feature-space Fourier Transformation
Authors: Su Yang, Yuanyuan Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

We propose a new pixel-level shape descriptor. First, shape contexts are computed. Then, 2D FFT is performed on each 2D histogram from shape contexts. Such a scheme solves the rotation-invariance problem of shape contexts based on the shift theorem of Fourier Transformation while does not increase the computational complexity. Theoretical proof and experimental validation are provided.
Color Characterization of Monitors Based on the Colorimetric Ratios
Authors: Xu Yanfang, Jin Yang, Huang Min, Liu Haoxue
Venue: ICIG (2007)

A new method for color characterization of monitors was proposed. Based on the colorimetric ratios of channel's color, the single channel's digital data R, G, B were one-dimensional related with their output main stimulus value Xr, Yg, Zb respectively. And the mixed color's CIEXYZ were three-dimensional related with their Xr, Yg, ,Zb that determined by R, G, B respectively. The experiments were carried out for one CRT and one LCD monitors. Nine colors of each channel were used to make the one-dimensional Look-Up Tables (1D-LUTs). With 63 sample colors, 9 each red, green, blue, cyan, magenta, yellow and black, polynomials including the cross terms XrYg, YgZb, ZbXr and XrYgZb, were used to constitute the three-dimensional relationships. The resulting conversion accuracies for 729 test colors were 4.85 and 1.61 CIELAB color difference unit (CDU) for the CRT and the LCD monitors respectively, better than the results of 5.13 and 1.81 CIELAB CDU with the regular model.
The gambler's ruin problem, genetic algorithms, and the sizing of populations
Authors: George Harik, Erick Cantú-Paz, David E. Goldberg, Brad L. Miller
Venue: Evolutionary Computation (1999)

This paper presents a model to predict the convergence quality of genetic algorithms based on the size of the population. The model is based on an analogy between selection in GAs and one-dimensional random walks. Using the solution to a classic random walk problem---the gambler's ruin---the model naturally incorporates previous knowledge about the initial supply of building blocks (BBs) and correct selection of the best BB over its competitors. The result is an equation that relates the size of the population with the desired quality of the solution, as well as the problem size and difficulty. The accuracy of the model is verified with experiments using additively decomposable functions of varying difficulty. The paper demonstrates how to adjust the model to account for noise present in the fitness evaluation and for different tournament sizes.
Revising Quorum Systems for Energy Conservation in Sensor Networks
Authors: Daniela Tulone, Erik D. Demaine
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Quorum systems are well-known techniques designed to enhance the performance of distributed systems, such as to reduce the access cost per operation, to balance the load, and to improve the system scalability. All of these properties make quorum systems particularly attractive for largescale sensor applications involving coordinated tasks, such as rescue applications. In this paper we analyze quorum techniques in the specific context of sensor networks and energy conservation, and show why quorum systems designed for wired networks and their metrics fail to address the challenges introduced by sensor networks. We then redefine quorum metrics such as access cost, load balance, and capacity in a way that takes into account the limitations and the characteristics of sensor networks, and discuss some energy-efficient design strategies. In addition, we propose a family of energy-efficient quorum systems and a particular construction, called Regional Quorum system (RQ), which reduces the quorum access cost. Finally, we propose a data diffusion protocol built on top of the RQ system, which improves energy consumption by reducing message transmissions and collisions, and increases the available bandwidth. We apply our diffusion protocol to analyze the RQ system using our novel metrics.
Dynamics analysis of TCP Veno with RED
Authors: Ke Zhang, Cheng Peng Fu
Venue: Computer Communications (2007)

This paper studies the dynamics of TCP Veno with the queue management of RED (Random Early Detection). We develop a fluid-flow model to describe the behaviors of TCP Veno in wired/wireless networks. This model is further linearized to study TCP Veno's stability issue through the linear feedback control theory. The analysis points out how the RED queue oscillates under different network parameters such as link capacity, round-trip time. Simulations are carried to validate our theoretical analysis. Furthermore, based on the analysis results obtained in this paper, we are able to provide guidelines for tuning RED parameters to stabilize the router queue, and improve the co-existence between TCP Veno and TFRC (TCP-friendly Rate Control) flows.