ppxscal/embedding_network huggingface dataset:
TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks
Authors: An Liu, Peng Ning
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Public Key Cryptography (PKC) has been the enabling technology underlying many security services and protocols in traditional networks such as the Internet. In the context of wireless sensor networks, elliptic curve cryptography (ECC), one of the most efficient types of PKC, is being investigated to provide PKC supportin sensor network applications so that the existing PKC-based solutions can be exploited. This paper presents the design, implementation, and evaluation of TinyECC, a configurable library for ECC operations in wireless sensor networks. The primary objective of TinyECC is to provide a ready-to-use, publicly available software package for ECC-based PKC operations that can be flexibly configured and integrated into sensor network applications. TinyECC provides a number of optimization switches, which can turn specific optimizations on or off based on developers' needs. Different combinations of the optimizations have different execution time andresource consumptions, giving developers great flexibility in integrating TinyECC into sensor network applications. This paperalso reports the experimental evaluation of TinyECC on several common sensor platforms, including MICAz, Tmote Sky, and Imote2. The evaluation results show the impacts of individual optimizations on the execution time and resource consumptions, and give the most computationally efficient and the most storage efficient configuration of TinyECC.
From conceptual process models to running systems: A holistic approach for the configuration of enterprise system processes
Authors: Alexander Dreiling, Michael Rosemann, Wil M. P. van der Aalst, Wasim Sadiq
Venue: Decision Support Systems (2008)

This paper proposes a method which aims at increasing the efficiency of enterprise system implementations. First, we argue that existing process modeling languages that feature different degrees of abstraction for different user groups exist and are used for different purposes which makes it necessary to integrate them. We describe how to do this using the meta models of the involved languages. Second, we argue that an integrated process model based on the integrated meta model needs to be configurable and elaborate on the enabling mechanisms. We introduce a business example using SAP modeling techniques to illustrate the proposed method.
Parallel Computing of CG Using an Open Source Windows Grid
Authors: Kenichi Tanaka, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Recent times have seen a strong increase in the size, scope and number of information processing tasks computers are commonly used to perform. Grids are one form of distributed computing that, generally, aim for HTC (High Throughput Computing). Grids can also be constructed to perform HPC (High Performance Computing) at a relatively low cost when compared to clusters. There currently exists open source middleware for building grids. But when such grids consist of Windows machines it is difficult to use members of the grid efficiently. This research concerns the construction of a cheap grid of Windows machines. In this paper, we describe a Windows grid that uses multiple core processors which are becoming increasingly popular.
Miss reduction in embedded processors through dynamic, power-friendly cache design
Authors: Garo Bournoutian, Alex Orailoglu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Today, embedded processors are expected to be able to run complex, algorithm-heavy applications that were originally designed and coded for general-purpose processors. As a result, traditional methods for addressing performance and determinism become inadequate. This paper explores a new data cache design for use in modern high-performance embedded processors that will dynamically improve execution time, power efficiency, and determinism within the system. The simulation results show significant improvement in cache miss ratios and reduction in power consumption of approximately 30% and 15%, respectively.
Characteristic Relations in Generalized Incomplete Information System
Authors: YunSong Qi, Lihua Wei, HuaiJiang Sun, YuQing Song, QuanSen Sun
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

similarity relation consider `do not care' data as lost data, they were introduced to rough set to deal with incomplete information system. Incomplete information system in which `do not care' data coexists with lost data, this article studies characteristic relation and discusses the unreasonable state which may be brought forth by characteristic class. On one hand, the two objects which do not have the same known value on a certain character seemed to be indiscernible. On the other hand, the two objects which have a lot of equivalent known values are very likely to be distinguished. In order to solve the problems of the classification in generalized incomplete information system, new kinds of characteristic relations named as I and II are brought forth and characteristic relation III is also constructed on advantages of characteristic relation I and II, and at last the validity of the newly constructed characteristic relations is also demonstrated with examples. Keywords-Incomplete information system, Tolerance relation, Characteristic relation, Similarity relation, Limited tolerance relation. I.
Early aspects at ICSE 2008: workshop on aspect-oriented requirements engineering and architecture design
Authors: Monica Pinto, Ruzanna Chitchyan, Awais Rashid, Ana Moreira, Joao Araujo, Paul Clements, Elisa Baniassad, Bedir Tekinerdogan
Venue: Companion of the 30th international conference on Software engineering (2008)

The "Early Aspects @ ICSE'08" is the 13th edition of the workshop on Early Aspects [1]. Early Aspects focuses on the identification, modularization, representation and composition of crosscutting concerns during the requirements engineering and architecture derivation activities. The specific aim of the present workshop is twofold: (a) to stimulate integration of the work on early development activities for product lines with the work for Early Aspects, and (b) to initiate creation of a Product Lines application demonstration with Early Aspects.
Providing transparent internet mobility for dual-interfaced mobile devices
Authors: Riaz Inayat, Reiji Aibara, Kouji Nishimura
Venue: International Journal of Wireless and Mobile Computing (2008)

Ubiquitous networking is definitely real to the mobile users; however, transparent mobility is certainly a challenge. Seamless roaming in hybrid and integrated environments demands a seamless intra-network as well as inter-network handoff mechanism for minimising any service disruption to on-going flows during switchovers. We show in this paper this could be achieved by properly managing multiple network interfaces with a handoff. We devise a client-based handoff mechanism based on the characteristics of a typical heterogeneous wireless environment by using multimode multiple network interfaces. The interface switching mechanism to minimise the power consumption is also presented. We also develop an analytical model to evaluate the performance of our proposed scheme in IP-based wireless networks. The results show that by exploiting the overlapping area between subnets and speed of mobile devices with proper management of multiple interfaces, we can significantly minimise the service disruption during handoff in heterogeneous environments.
The performance comparison of flat routing and hierarchical routing in ad hoc wireless networks in the presence of faulty nodes
Authors: Kong Ling Pang, Yang Qin
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

The hierarchical routing protocols have been proposed to deal with the path search in wireless multi hop networks in various research works. As we know, hierarchical scheme has high complexity on the topology structure management. Some research works have researched the routing overhead in different routing protocols and others research the memory used by hierarchical cluster network. However, the robustness of the various protocols has not been researched, which means the performance of the networks in the presence of faulty nodes. The purpose of this paper is to investigate the performance of the flat routing and hierarchical routing protocols in ad hoc wireless networks. It is especially important to study the performance of the various routing protocols under some special environments, e.g. some fault nodes occurs in the networks. In this environment, we could study the robustness of different protocols.
A Graph Isomorphism Based Authentication Protocol for Access Control in WLAN
Authors: Ngoc Bao Tran, Dinh Thuc Nguyen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Mutual authentication is vital concept to network security and incorporated to proprietary security solutions. In this paper, we present a new mutual authentication protocol based on graph isomorphism that can stop man-in-the-middle, session high-jacking and replay attacks. Although authentication protocol based on graph isomorphism was motivated by WLAN (Wireless Local Area Network) security in the infrastructure mode, we believe that it can be modified for the ad-hoc mode where each mobile node holds a partial sub-graph and the nodes can collaborate with each other to authenticate a new node.
Power management solutions for computer systems and datacenters
Authors: Karthick Rajamani, Charles Lefurgy, Soraya Ghiasi, Juan Rubio, Heather Hanson, Tom Keller
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

The growing power and cooling requirements of high-density computing systems pose significant challenges for the design and operation of computers and their facilities. The rising operating expenses for datacenters demand the implementation of energy-efficient technologies and the best power management solutions. This tutorial addresses power management and cooling solutions from the individual computer system level to the datacenter. The audience will learn about the fundamental nature of the problems, approaches to developing solutions, available commercial solutions, and current research directions.
Early Detection of Prostate Cancer with Classifier Ensembles
Authors: Joerg D. Wichard, Henning Cammann, Carsten Stephan, Thomas Tolxdorff
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We investigate the performance of different classification models and their ability to recognize prostate cancer in an early state. We build ensembles of classification models in order to increase the classification performance. We measure the performance of our models in an extensive cross-validation procedure. The data sets come from clinical examinations and some of the classification models are already in use to support the urologists in their clinical work.
A holonic architecture for continuous processes supervision and coordination
Authors: Edgar Chacón R, Edmary J. Altamiranda M, Eliezer Colina M
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper presents an approach to build supervisory systems for complex continuous production processes. Local controllers perform local supervision tasks, and they are able to communicate with central systems where the coordination for the whole process is performed. Local controller's architecture supports several software components, which perform supervision, monitoring, control activities, and communicate with a supervision center to ensure the coordination of the whole process. At the supervision center, a software architecture has an abstraction of local processes and is able to achieve production reconfiguration, for optimizing, taking into account the changes generated on the processes.
Performance characterization of a rover navigation algorithm using large-scale simulation
Authors: Richard Madison, Abhinandan Jain, Christopher Lim, Mark Maimone
Venue: Scientific Programming (2007)

Autonomous rover navigation is a critical technology for robotic exploration of Mars. Simulation allows more extensive testing of such technologies than would be possible with hardware test beds alone. A large number of simulations, running in parallel, can test an algorithm under many different operating conditions to quickly identify the operational envelope of the technology and identify failure modes that were not discovered in more limited testing. GESTALT is the autonomous navigation algorithm developed for NASA's Mars rovers. ROAMS is a rover simulator developed to support the Mars program. We have integrated GESTALT into ROAMS to test closed-loop, autonomous navigation in simulation. We have developed a prototype capability to run many copies of ROAMS in parallel on a supercomputer, varying input parameters to rapidly explore GESTALT's performance across a parameter space. Using these tools, we have demonstrated that large scale simulation can identify performance limits and unexpected behaviors in an algorithm. Such parallel simulation was able to test approximately 500 parameter combinations in the time required for a single test on a hardware test bed.
Extended Holonomy and Topological Invariance of Vanishing Holonomy Group
Authors: L. Ortiz-Bobadilla, E. Rosales-González, S. M. Voronin
Venue: Journal of Dynamical and Control Systems (2008)

In this work, we introduce the notion of extended holonomy and discuss some of its properties. As an application of it, we consider vanishing projective holonomy groups of germs of vector fields with zero (n¿¿¿1)-jet and prove, under some genericity assumptions, that the corresponding vanishing holonomy groups are topologically conjugated for orbitally topologically equivalent germs of vector fields.
Application of Improved K-mean Clustering in Predicting Protein-Protein Interactions
Authors: Pingping Sun, Yanan Ma, Yazhuo Wei, Zhiqiang Ma, Linying Lu, Ying Cui, Ping Huang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

With the increasing availability of complete genome sequences, there are more excellent opportunity for further research and development of tools for functional studies in proteomics. Phylogenetic profile is a basic non-homology method in functional proteomics. This paper describes the theory of phylogenetic profile, focuses on the improvement of K-mean clustering algorithm in analyzing the protein phylogenetic profile; also compare the method with the traditional K-mean clustering algorithm. The experimental results show that the improved K-mean clustering algorithm is fast and effective; it can quickly converge to the approximate optimal solution.
S2Directory A Framework for Object-Directory Mapping with Dynamic Implementation Injection
Authors: Jun Futagawa, Shuichi Yukita
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Object models adopted in the object oriented software development reflect complex relations that exist between various entities in the real world. On the other hand, directory models adopted in directory service technologies map various relations into tree structures. Therefore, developing directory services by object oriented languages require writing lengthy procedures that bridge the gaps between object models and directory models. To overcome this drawback, in this paper, we propose a new technology named Object-Directory Mapping. We also present a Java based framework S2Directory to prove the effectiveness of the concept of Object-Directory Mapping. Implementation details are also given together with new dynamic implementation injection techniques.
Enhancement of secure data transmission
Authors: Amit Jain
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The growth of high-speed networks has explored means of new business, science, entertainment and social opportunities. This has been achieved through client-server technology. Compression and encryption places a vital role in client-server technology. If the sensitive or huge data is compressed and encrypted, it will lead to more efficient data transmission. This paper describes a new algorithm that intertwines both compression and encryption in itself. Because of this the time required for processing is very less. 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
A generic weaver for supporting product lines
Authors: Brice Morin, Jacques Klein, Olivier Barais, Jean-Marc Jézéquel
Venue: Proceedings of the 13th international workshop on Early Aspects (2008)

Aspects have gained attention in the earlier steps of the software life-cycle leading to the creation of numerous ad-hoc Aspect-Oriented Modeling (AOM) approaches. These approaches mainly focus on architecture diagrams, class diagrams, state-charts, scenarios or requirements and generally propose Aspect-Oriented composition mechanisms specific to a given kind of models defined by its own meta-model. Recently, some generic AOM approaches propose to extend the notion of aspect to any domain specific modelling language (DSML). In this trend, this paper presents GeKo. GeKo has the following properties. i) It is a generic AOM approach easily adaptable to any DSML with no need to modify the domain meta-model or to generate domain-specific frameworks. ii) It keeps a graphical representation of the weaving between an aspect model and the base model. iii) It is a tool-supported approach with a clear semantics of the different operators used to define the weaving. GeKo relies on the definition of mappings between the different views of an aspect, based on the concrete (graphical) syntax associated to the DSML. To illustrate GeKo, we derive, from the Arcade Game Maker Pedagogical Product Line, a new product in which new features are woven into the Product Line models.
Phase Detection Based on the Lock-in Amplifier SR844 and Experiments of Brain Neuron Cells in MIT System
Authors: Wenwen Liang, Mingxin Qin, Mingke Jiao, Hao Yang, Ke Li, Teng Jiao, Liyuan Bai, Wenyong Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

To implement a function of detecting phase change at a high precision in MIT system, a phase-change-detecting unit based on RF Lock-in Amplifier SR844 was designed at the frequency of 1 MHz. The unit provided a gain range of 3.52 dB – 61.1 dB and a phase resolution by 0.02 deg. And an experiment with neuron cell model from SD rat cortex was made to detect phase change produced by edema neuron cell model and normal neuron cell model respectively. The results of the experiment showed that the phase change produced by edema neuron cell model was smaller than that by normal neuron cell model and that the unit had good capability of detecting the phase change produced by edema neuron cell model and normal neuron cell model effectively. These may be of great help for further cerebral edema-detecting work.
Towards a mutation-based automatic framework for evaluating code clone detection tools
Authors: Chanchal K. Roy, James R. Cordy
Venue: Proceedings of the 2008 C3S2E conference (2008)

In the last decade, a great many code clone detection tools have been proposed. Such a large number of tools calls for a quantitative comparison, and there have been several attempts to empirically evaluate and compare many of the state-of-the-art tools. However, a recent study shows that there are several factors that could influence the the validity of the results of such comparisons. In order to overcome the effects of such factors (at least in part), in this student poster paper we outline a mutation-based controlled frame-work for evaluating clone detection tools using edit-based mutation operators that model cloning actions. While the framework is not yet completely implemented and as yet we do not have experimental data, we anticipate that such a framework will provide a useful contribution to the community by providing a more solid objective foundation for tool evaluation.
Semi-automatic stencil creation through error minimization
Authors: Jonathan Bronson, Penny Rheingans, Marc Olano
Venue: Proceedings of the 6th international symposium on Non-photorealistic animation and rendering (2008)

Creating physical stencils from 3D meshes is a unique rendering challenge that has not been previously addressed. The task is a problem of two competing goals: forming a single, well-connected and stable stencil sheet, while simultaneously limiting the error introduced by pieces of bridging material. Under these conflicting goals, it can often be difficult to create visually pleasing stencils from complicated imagery by hand. Even for well-behaved images, expressive stencils can be time-consuming to craft manually. We present a method for generating expressive stencils from polygonal meshes or images. In our system, users provide input geometry and can adjust desired view, lighting conditions, line thickness, and bridge preferences to achieve their final desired stencil. The stencil creation algorithm makes use of multiple metrics to measure the appropriateness of connections between unstable stencil regions. These metrics describe local features to help minimize the distortion of the abstracted image caused by stabilizing bridges. The algorithm also uses local statistics to choose a best fit connection that maintains both structural integrity and local shape information. We demonstrate our algorithm on physical media including construction paper and sheet metal.
A class of three-point spline collocation methods for solving delay differential equations
Authors: S. M. Mahmoud
Venue: International Journal of Computer Mathematics (2007)

In this paper a study of the existence, uniqueness, stability and convergence of a class of C2-spline collocation methods for solving delay differential equations (DDEs) is introduced. Letting the interior collocation points [image omitted] , j=1(1)3 be dependent on the parameters c1, c2∈(0, 1) and c3=1 it is shown that the proposed methods for DDEs possess a convergence rate of order six if 58-57(c1+c2)+55c1 c2=0, and they are unstable if c1+c2
Dynamic register file resizing and frequency scaling to improve embedded processor performance and energy-delay efficiency
Authors: Houman Homayoun, Sudeep Pasricha, Mohammad Makhzan, Alex Veidenbaum
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

With CMOS scaling leading to ever increasing levels of transistor integration on a chip, designers of high-performance embedded processors have ample area available to increase processor resources in order to improve performance. However, increasing resource sizes can increase power dissipation and also reduce access time, which can limit maximum achievable operating frequency. In this paper, we explore optimizations for the processor register file (RF), to improve performance and reduce the energy-delay product. We show that while increasing the size of the RF can potentially increase the IPC, overall it results in an increase in program execution time. In response we propose L2MRFS -- a dynamic register file resizing scheme in tandem with frequency scaling, which exploits L2 cache misses to noticeably improve processor performance (11% on average) and also significantly reduce the energy-delay product (7%).