ppxscal/embedding_network huggingface dataset:
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Venue: Language, Compiler and Tool Support for Embedded Systems (2008)

It is our great pleasure to welcome you to the ACM SIGPLAN/SIGBED 2008 Conference on Languages, Compilers, and Tools for Embedded Systems -- LCTES 2008. This year's symposium continues its tradition of being the premier forum for presentation of research results on leading edge issues in embedded systems. The call for papers attracted 68 submissions (40 from outside the United States) from all continents except Africa and Antarctica. Each submission was reviewed by at least three program committee members. The program committee meeting was held on March 1 2008 in Salt Lake City, Utah, USA. The program committee accepted 17 papers that cover a variety of topics, including programming languages, timing analysis, compiler optimization, and architectures.
A Parallel GNFS Algorithm with the Improved Linbox Montgomery Block Lanczos Method for Integer Factorization
Authors: Laurence Tianruo Yang, Li Xu, Jong Hyuk Park
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

RSA algorithm is a very popular public key cryptosystem which has been widely used in industries. Its security relies on the difficulty of factoring large integers. The general number field sieve (GNFS) is so far the best known algorithm for factoring large integers over 110 digits. The Montgomery's block Lanczos method from Linbox [9] is for solving large and sparse linear systems over finite fields and it can be integrated into GNFS algorithm. This paper introduces an improved Montgomery block Lanczos method, based on the version developed in Linbox, integrated with our previously developed parallel GNFS algorithm. This method has a better performance comparing with the original one, can find more solutions or dependencies than the original one with less time complexities. Implementation details and experimental results will be provided as well in the paper.
Support for symmetric shadow memory in multiprocessors
Authors: Vijay Nagarajan, Rajiv Gupta
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

Runtime monitoring support serves as a foundation for the important tasks of providing security [15, 14, 2], performing debugging [13, 11, 8], and improving performance of applications [1]. Runtime monitoring, typically, requires the maintenance of meta data associated with each of the application's original memory location, which are held in corresponding shadow memory locations. Each original memory instruction (OMI) is then accompanied by additional shadow memory instructions (SMIs) that manipulate the meta data associated with the memory location. Often the SMIs associated with OMIs are symmetric, in that, original stores (loads) are accompanied by shadow stores (loads). Unfortunately, existing shadow memory implementations need thread serialization to ensure that OMIs and SMIs are executed atomically [12]. Naturally this is not an efficient approach, especially in the now ubiquitous multiprocessors. In this paper, we present an efficient shadow memory implementation that handles symmetric shadow instructions. By coupling the coherency of shadow memory with the coherency of the main memory, we ensure that the SMIs execute atomically with their corresponding OMIs. We also couple the allocation of application memory pages with its associated shadow pages, for enabling fast translation of original addresses into corresponding shadow memory addresses. Our experiments show that the overheads of run-time monitoring tasks are significantly reduced in comparison to previous software implementations.
Design and implementation of repeater system based on CDMA/ARM
Authors: Zhao Zhengjie, Zhang Jilong
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

A novel monitor system of unmanned is presented with CDMA module from WaveCom and ARM SC2410 from Samsung. Network management center can concentratively control and monitor the repeater. It mainly includes the parameter setting, data inquiry and trap handing. The repeaters are responsible for passing breakdown information to network management center by trap handing.
Solutions and Green's functions for some linear second-order three-point boundary value problems
Authors: Zengqin Zhao
Venue: Computers Mathematics with Applications (2008)

In this paper we consider the Green's functions for a second-order linear ordinary differential equation with some three-point boundary conditions. We give exact expressions of the unique solutions for the linear three-point boundary problems by the Green's functions. As applications, we study the iterative solutions for some nonlinear singular second-order three-point boundary value problems.
The Seven Flaws of Identity Management: Usability and Security Challenges
Authors: Rachna Dhamija, Lisa Dusseault
Venue: IEEE Security and Privacy (2008)

Identity management systems' scale and complexity, combined with the privacy and security requirements demanded of them, create steep challenges for usability. In this article, the authors posit seven flaws or design challenges that must be met for the general public to accept and use identity management systems.
Applications with voltage conveyors
Authors: Vit Novotny, Kamil Vrba
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The paper deals with active filter design with new type of active elements called voltage conveyors. Principal characteristics of voltage conveyors are described and various types are classified. Several design methods are presented. Models for simulation are designed. The possibility of voltage conveyor emulation by a CFA with z-pin taken out is presented.
Enhancing digital libraries using missing content analysis
Authors: David Carmel, Elad Yom-Tov, Haggai Roitman
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This work shows how the content of a digital library can be enhanced to better satisfy its users' needs. Missing content is identified by finding missing content topics in the system's query log or in a pre-defined taxonomy of required knowledge. The collection is then enhanced with new relevant knowledge, which is extracted from external sources that satisfy those missing content topics. Experiments we conducted measure the precision of the system before and after content enhancement. The results demonstrate a significant improvement in the system effectiveness as a result of content enhancement and the superiority of the missing content enhancement policy over several other possible policies.
Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
Authors: Marco Grzegorczyk, Dirk Husmeier
Venue: Machine Learning (2008)

Applications of Bayesian networks in systems biology are computationally demanding due to the large number of model parameters. Conventional MCMC schemes based on proposal moves in structure space tend to be too slow in mixing and convergence, and have recently been superseded by proposal moves in the space of node orders. A disadvantage of the latter approach is the intrinsic inability to specify the prior probability on network structures explicitly. The relative paucity of different experimental conditions in contemporary systems biology implies a strong influence of the prior probability on the posterior probability and, hence, the outcome of inference. Consequently, the paradigm of performing MCMC proposal moves in order rather than structure space is not entirely satisfactory. In the present article, we propose a new and more extensive edge reversal move in the original structure space, and we show that this significantly improves the convergence of the classical structure MCMC scheme.
A semiparametric statistical approach to model-free policy evaluation
Authors: Tsuyoshi Ueno, Motoaki Kawanabe, Takeshi Mori, Shin-ichi Maeda, Shin Ishii
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Reinforcement learning (RL) methods based on least-squares temporal difference (LSTD) have been developed recently and have shown good practical performance. However, the quality of their estimation has not been well elucidated. In this article, we discuss LSTD-based policy evaluation from the new view-point of semiparametric statistical inference. In fact, the estimator can be obtained from a particular estimating function which guarantees its convergence to the true value asymptotically, without specifying a model of the environment. Based on these observations, we 1) analyze the asymptotic variance of an LSTD-based estimator, 2) derive the optimal estimating function with the minimum asymptotic estimation variance, and 3) derive a suboptimal estimator to reduce the computational burden in obtaining the optimal estimating function.
Electrodes for Biotelemetry and Home Care Applications
Authors: Miroslav Rosulek, Marek Penhaker
Venue: Proceedings of the Third International Conference on Systems (2008)

In this article there are described types and applications of sensors for diagnostic and maintenance planning in healthcare applications. During the recent years, there was a rapid growth in the development of maintenance telemedicine systems and monitoring devices for patients with chronical diseases and those requiring continuous telemonitoring treatments. The aim of this work was the design sensors for bioelectrical measurement in long term applications. The telemetric system proposal lied in the selection of suitable biological parameters that preferably testified about an actual physical and psychical state of men.
Latency equalization: a programmable routing service primitive
Authors: Minlan Yu, Marina Thottan, Li Li
Venue: Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow (2008)

Today the Internet is the primary medium for deploying new real time services such as gaming and distributed online live music concerts. Different network services have different expectations from the routing infrastructure. Some network services require conventional routing paths optimized for low latency or low congestion. However, real-time interactive services such as online gaming and distributed live music performance require more than just low latency. They require Latency EQualization (LEQ) among participating users. Although LEQ could be performed by the client or the server, end-system techniques for estimating network conditions are often inaccurate. Instead, we argue that the network should provide a LEQ service. We propose a LEQ routing architecture that can leverage programmable hub nodes. By deploying a few flexible, well-placed programmable nodes to redirect traffic, we can flexibly support both latency equalized and low latency routing services simultaneously. For LEQ routing, programmable hub nodes provide services such as application packet identification, application level packet processing and latency equalized routing paths. Extensive simulation studies on provider network topologies show that using just a few programmable nodes we can achieve an 80% improvement in LEQ over the conventional architecture that uses shortest path routing.
Systematic concurrency testing using CHESS
Authors: Madan Musuvathi
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

Concurrency testing should aim for systematic coverage of thread interleavings. The most common method used today is stress testing, where the program is run under load with lots of threads. While this indirectly increases the variety of thread interleavings, the coverage is neither sufficient and nor predictable---stories are legend of the so-called "Heisenbugs" that rarely surface during testing and are very hard to debug. In this talk, I will argue for a new notion of concurrency testing called scenario testing and describe CHESS, a tool we have developed towards that end. A user of CHESS provides simple concurrency scenarios and CHESS systematically enumerates all thread interleavings of these scenarios. CHESS employs model checking techniques to effectively focus on potentially bug-yielding schedules and provides sound quantifiable notions of coverage. On finding an error, CHESS has the capability to replay the erroneous interleaving, greatly simplifying the debugging process. CHESS has been successfully integrated with several codebases inside Microsoft and is used daily by the test teams. CHESS has found numerous bugs in systems that have been stress-tested for months. Additionally, CHESS has successfully reproduced many stress-test crashes that were previously hard to debug. The latter shows that many bugs that are found in stress-testing can indeed be reproduced in simple scenarios, a good validation for scenario testing. CHESS is available for download at http://research.microsoft.com/CHESS. The talk will contain enough material to act as a tutorial for first-time users. I will also describe the challenges in applying CHESS to a new codebase and how to address them.
Digital signal processing with embedded system for advanced mobile communications
Authors: Yumi Takizawa, Saki Yatano, Atsushi Fukasawa
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

A basic concept and an example of design are described in this paper for the next generation public mobile communications. Basic functions and the specifications of the system are mainly defined by amount of data and data rate. Total quantity of processing is shared by software and hardware in practical design. MPU and other types of processors are introduced depending on individual features to enhance capability of processing. A prototype model of the proposed system was designed and implemented. JPEG and MPEG4 are adopted as a target specification and transmission quality was proved sufficiently.
Distributed Learning Strategies for Collaborative Agents in Adaptive Decentralized Power Systems
Authors: Horst F. Wedde, Sebastian Lehnhoff, Kai M. Moritz, Edmund Handschin, Olav Krause
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

For regenerative electric power the traditional top-down and long-term power management is obsolete, due to the wide dispersion and high unpredictability of wind and solar based power facilities. In the R&D DEZENT project we developed a multi-level bottom-up solution where autonomous software agents negotiate available energy quantities and needs on behalf of consumers and producer groups. We operate within very short time intervals of assumedly constant demand and supply, in our case 0.5 sec (switching delay for a light bulb). We prove security against a relevant variety of malicious attacks. In this paper the main contribution is to make the negotiation strategies themselves adaptive across periods. We adapted a Reinforcement Learning approach for defining and discussing learning strategies for collaborative autonomous agents that are clearly superior to previous (static) procedures. We report briefly on extensive comparative simulation.
Score standardization for inter-collection comparison of retrieval systems
Authors: William Webber, Alistair Moffat, Justin Zobel
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

The goal of system evaluation in information retrieval has always been to determine which of a set of systems is superior on a given collection. The tool used to determine system ordering is an evaluation metric such as average precision, which computes relative, collection-specific scores. We argue that a broader goal is achievable. In this paper we demonstrate that, by use of standardization, scores can be substantially independent of a particular collection, allowing systems to be compared even when they have been tested on different collections. Compared to current methods, our techniques provide richer information about system performance, improved clarity in outcome reporting, and greater simplicity in reviewing results from disparate sources.
Service learning in math and computer science: panel discussion
Authors: Lori Carter, Erin Trine, Nathan Hirst, Catherine Marcarelli, Robert Lingard
Venue: Journal of Computing Sciences in Colleges (2008)

Service Learning is rising in popularity as a way to provide practical experience for our students while contributing to the local community. Service Learning can take many forms. The purpose of this panel is to present the various types of Service Learning, and then to explore 2 of them in more depth. The panel members come from Point Loma Nazarene University where Service Learning is conducted as a year-long course, and California State University, Northridge where Service Learning was a component of another course.
Client and server verification for web services using interface grammars
Authors: Graham Hughes, Tevfik Bultan, Muath Alkhalaf
Venue: Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications (2008)

Web services provide a promising framework for developing interoperable software components that interact with each other across organizational boundaries. For this framework to be successful, the client and the server for a service have to interact with each other based on the published service interface specification. If either the client or the server deviate from the interface specification, the client-server interaction will lead to errors. We present a framework for checking interface conformance for web services. Given an interface specification, we automatically generate web service server stubs (for client verification) and drivers (for server verification) and then use these stubs and drivers to check the conformance of the client and server to the interface specification. We implemented this framework by using interface grammars as the interface specification language. We developed an interface compiler that automatically generates a stub or a driver from a given interface grammar. We conducted a case study by applying these techniques to the Amazon E-Commerce Service.
A sharp edge bound on the interval number of a graph
Authors: József Balogh, András Pluhár
Venue: Journal of Graph Theory (1999)

The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Namely, it is shown that i(G) &le; $\lceil\sqrt{e}/2\rceil$ + 1. It is also observed that the edge bound induces i(G) &le; $\sqrt{3 \gamma(G)/2}+O(1)$, where &ggr;(G) is the genus of G. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 153&ndash;159, 1999
An Error Bound Based on a Worst Likely Assignment
Authors: Eric Bax, Augusto Callejas
Venue: The Journal of Machine Learning Research (2008)

This paper introduces a new PAC transductive error bound for classification. The method uses information from the training examples and inputs of working examples to develop a set of likely assignments to outputs of the working examples. A likely assignment with maximum error determines the bound. The method is very effective for small data sets.
SEA: A Striping-Based Energy-Aware Strategy for Data Placement in RAID-Structured Storage Systems
Authors: Tao Xie
Venue: IEEE Transactions on Computers (2008)

Many real-world applications need to frequently access data stored on large-scale parallel disk storage systems. On one hand, prompt responses to access requests are essential for these applications. On the other hand, however, with an explosive increase of data volume and the emerging of faster disks with higher power requirements, energy consumption of disk-based storage systems has become a salient issue. To achieve energy-conservation and prompt responses simultaneously, in this paper we propose a novel energy-aware strategy, called striping-based energy-aware (SEA), which can be integrated into data placement in RAID-structured storage systems to noticeably save energy while providing quick responses. Next, to illustrate the effectiveness of SEA, we implement two SEA-powered striping-based data placement algorithms, SEA0 and SEA5, by incorporating the SEA strategy into RAID-0 and RAID-5, respectively. Extensive experimental results demonstrate that compared with traditional non-stripping data placement algorithms, our algorithms significantly improve performance and save energy. Further, compared with an existing stripping-based data placement scheme, the two SEA-powered strategies noticeably reduce energy consumption with only a little performance degradation.
Performance Analysis of STBC Based on STTC System
Authors: Chulgyu Kang, Changheon Oh
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Multi-path fading is a significant problem in wireless communication systems. Therefore, we need a reliable system to overcome the multi-path fading. In this paper, we proposed the use of a STBC based on a STTC system to improve the reliability of wireless communication systems in multi-path fading environments. We also analyzed the performance of the proposed system and found it efficient. The proposed system was able to acquire not only a diversity gain and coding gain from the STTC system, but also a diversity gain from the STBC system without stimulating an additional channel bandwidth. Furthermore, the simulation results matched the theoretical Chernoff upper bound well, particularly in the high Eb/No.
Super Resolution Using Neural Network
Authors: Varsha H. Patil, Datttraya S. Bormane, Vaishalee S. Pawar
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Super resolution imaging refers to inferring the missing high resolution image from low resolution image(s). Super resolution methods are generally classified into reconstruction based and learning based methods. The learning based methods fully learn the intensity prior between all bands of images. For most of these, some fake information can be inevitably introduced into synthesized high resolution image though the image may offer visually good effects. For medical image analysis, it might deteriorate the image analysis and diagnosis performance. In this paper we propose a better learning using real image training set that enhances the high frequency information. The method exploits richness of real-world images. The training set is preprocessed images so as to extract the structural correlation. The technique learns the fine details that correspond to different image structures seen at a low-resolution and then uses those learned relationships to predict fine details in other images.