ppxscal/embedding_network huggingface dataset:
Object-Oriented Reconfiguration
Authors: Julio C. B. Mattos, Antonio Carlos S. Beck, Luigi Carro
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

As embedded systems are getting more complex, they are also presenting more stringent constraints like performance, power consumption, memory footprint and so on. At the same time, because of market pressures, their development time must be constantly reduced. The employment of object orientation would solve the design cycle problem. However, OO languages like Java or C++ are not targeted to any of the embedded systems constraints stated before. Based on all these facts, this work focuses on providing the high OO abstraction, while maintaining embedded systems perspective. The methodology consists in the execution of selected objects in a reconfigurable hardware, which solves the overhead problems. This way, with efficient execution of certain intensively used objects in the reconfigurable array, we show performance improvements of up to 47 % and savings of 37 % in energy consumption, still taking advantage of the well known benefits of an object-oriented language. For our experiments we used a native Java processor, together with a complete MP3 player, representing a complex embedded system benchmark.
JPEG compression metric as a quality-aware image transcoding
Authors: Surendar Chandra, Carla Schlatter Ellis
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Transcoding is becoming a preferred technique to tailor multimedia objects for delivery across variable network bandwidth and for storage and display on the destination device. This paper presents techniques to quantify the quality-versus-size tradeoff characteristics for transcoding JPEG images. We analyze the characteristics of images available in typical Web sites and explore how we can perform informed transcoding using the JPEG compression metric. We present the effects of this transcoding on the image storage size and image information quality. We also present ways of predicting the computational cost as well as potential space benefits achieved by the transcoding. These results are useful in any system that uses transcoding to reduce access latencies, increase effective storage space as well as reduce access costs.
Supporting on-the-fly data integration for bioinformatics
Authors: Gagan Agrawal
Venue:  (2007)

The use of computational tools and on-line data knowledgebases has changed the way the biologists conduct their research. The fusion of biology and information science is expected to continue. Data integration is one of the challenges faced by bioinformatics. In order to build an integration system for modern biological research, three problems have to be solved. A large number of existing data sources have to be incorporated and when new data sources are discovered, they should be utilized right away. The variety of the biological data formats and access methods have to be addressed. Finally, the system has to be able to understand the rich and often fuzzy semantic of biological data. Motivated by the above challenges, a system and a set of tools have been implemented to support on-the-fly integration of biological data. Metadata about the underlying data sources are the backbone of the system. Data mining tools have been developed to help users to write the descriptors semi-automatically. With automatic code generation approach, we have developed several tools for bioinformatics integration needs. An automatic data wrapper generation tool is able to transform data between heterogeneous data sources. Another code generation system can create programs to answer projection, selection, cross product and join queries from at file data.Real bioinformatics requests have been used to test our system and tools. These case studies show that our approach can reduce the human efforts involved in an information integration system. Specifically, it makes the following contributions. (1) Data mining tools allow new data sources to be understood with ease and integrated to the system on-the-fly. (2) Changes in data format are localized by using the metadata descriptors. System maintenance cost is low. (3) Users interact with our system through high-level declarative interfaces. Programming efforts are reduced. (4) Our tools process data directly from at files and requires no database support. Data parsing and processing are done implicitly. (5) Request analysis and request execution are separated and our tools can be used in a data grid environment.
Implementation issues for CS majors and nonmajors in a senior CS capstone sequence
Authors: A. J. Hamilton
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The United States Military Academy prepares each and every one of its students for professional service as an Army officer. The general educational goal is to "enable its graduates to anticipate and to respond effectively to the uncertainties of a changing technological...world". It uses the "Engineer Thought Process" to help meet this general goal. Each student enrolled in the Academy selects a five-course engineering sequence. Students become familiar with analytical and empirical models representing components, systems or processes that are germane to the selected sequence. The final phase of the sequence is a capstone project in which the students must design and implement or prototype a solution to a real world technical problem. In order to comply with the standard Academy curricular model, we are moving to one computer science engineering sequence for not only CS majors, but also for our nonmajors taking the CS engineering sequence courses. The computer science capstone project requires students to build an extensive software system. This requires a breadth of knowledge in software design principles as well as sufficient depth in a particular programming language and environment. In this sense, students must be well trained in the use of the selected language. Yet, to serve its purpose as a viable system, students must also take into consideration the software engineering aspects of system development. This paper discusses the role of theory and application in both an applied programming course and the follow-on senior design sequence.
A Grouping Aggregation Algorithm Based on the Dimension Hierarchical Encoding in Data Warehouse
Authors: Zhen-zhi Gong, Kong-fa Hu, Qing-Li Da
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The OLAP (On-Line Analytical Processing) queries are ad hoc, complex aggregation queries on massive data set. How to effectively aggregate the query data becomes the key issue for OLAP query evaluation. To solve this problem, a novel grouping aggregation algorithm, DHEGA(Grouping Aggregation Based on the Dimension Hierarchical Encoding), is proposed in this paper. It utilizes the fairly short DHE(Dimension Hierarchical Encoding) and its hierarchical prefix path, retrieves the matching dimension hierarchical encoding and evaluates the set of query ranges for each dimension rapidly. As a result, our algorithm significantly reduces the disk I/Os and improves the efficiency of OLAP queries. The analytical and experimental results demonstrate that DHEGA algorithm is highly efficient and outperforms all the previous approaches.
A new object-oriented programming language: sh
Authors: Jeffrey S. Haemer
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

Many have frittered away their time on C++, while overlooking the new, POSIX.2-required, object-oriented language: sh. As will be clear from the enclosed code, the name may allude to the fact that the author would be embarrassed to have anyone find out about it. This paper introduces a tiny, object-oriented programming system written entirely in POSIX-conforming shell scripts.
Requirement Centric Security Evaluation of Software Intensive Systems
Authors: Reijo Savola
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Information security demands are increasing in nowadays complex and networked information technology environment. Systematic development of the information security requirements of practical software-intensive systems is typically ignored, at an inadequate level or relies heavily on the experience of the security professionals. However, it is obvious that security requirements should be the paid attention in all phases of security engineering. We introduce a preliminary framework for security evaluation based on security requirement definition, behavior modeling and evidence collection.
EZRP: an enhanced zone-based routing protocol for ad-hoc networks: Research Articles
Authors: A. Koyama, J. Arai, L. Barolli, A. Durresi
Venue: Concurrency and Computation: Practice Experience (2007)

In mobile ad-hoc networks (MANETs), the nodes intercommunicate through single-hop and multi-hop paths in a peer-to-peer fashion. Intermediate nodes between two pairs of communication nodes act as routers. Thus, the nodes operate both as hosts and routers. The nodes are mobile, so the topology of the network may change rapidly and unexpectedly. One well-known routing protocol for ad-hoc networks is the Zone Routing Protocol (ZRP). However, when the protocol searches for a new route, it sends many useless control packets, which increase the network load and decrease the network performance. In this paper, we propose an Enhanced Zone Routing Protocol (EZRP). In EZRP, each node calculates the reliability of the route. In the case of a reliable route, the source node sends the data packet directly to the destination node using that route without route searching. In the case of an unreliable route, the source node searches for a new route again. We show that the network performance can be improved by using EZRP. Copyright &copy; 2007 John Wiley & Sons, Ltd.
View disassembly: A rewrite that extracts portions of views
Authors: Parke Godfrey, Jarek Gryz
Venue: Journal of Computer and System Sciences (2007)

We explore a new form of view rewrite called view disassembly. The objective is to rewrite views in order to ''remove'' certain sub-views (or unfoldings) of the view. This becomes pertinent for complex views which may be defined over other views and which may involve union. Such complex views arise necessarily in environments such as data warehousing and mediation over heterogeneous databases. View disassembly can be used for view and query optimization, preserving data security, making use of cached queries and materialized views, and view maintenance. We provide computational complexity results of view disassembly. One question is whether the unfoldings to be removed effectively cover the view, meaning that the disassembled view is effectively the empty view, evaluating to the empty table. We illustrate the complexity to determine when a collection of unfoldings cover the view definition. The problem is NP-hard with respect to the number of unfoldings to remove, but not with respect to the size (complexity) of the view definition. We next consider rewrites optimal in the size of the rewritten (disassembled) view. We prove that this task is NP-hard for a special class of views, but this time NP-hard in a worse way: it is NP-hard this time with respect to the size of the view definition in addition to the number of unfoldings to be removed. In general, we suspect the problem is computationally even harder, and we show that the general problem is in @P"2^p. However, we provide good news too. We identify a pertinent class of unfoldings for which the removal of such unfoldings always results in a simpler disassembled view than the original view itself. We also develop an algorithm that finds rewrites equivalent to the disassembled view which are, in a sense, locally optimal. The algorithm establishes a cover completion by finding a (minimal) collection of unfoldings of the view that, along with the unfoldings to be removed, covers the original view. This approach is effectively tractable, unlike the search for globally, or absolutely, optimal rewrites. Furthermore, we show that these cover-completion rewrites are preferable to absolutely optimal rewrites in many ways.
Applications of Hierarchical Reasoning in the Verification of Complex Systems
Authors: Swen Jacobs, Viorica Sofronie-Stokkermans
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper we show how hierarchical reasoning can be used to verify properties of complex systems. Chains of local theory extensions are used to model a case study taken from the European Train Control System (ETCS) standard, but considerably simplified. We show how testing invariants and bounded model checking (for safety properties expressed by universally quantified formulae, depending on certain parameters of the systems) can automatically be reduced to checking satisfiability of ground formulae over a base theory.
Towards adaptive, scalable, and reliable resource provisioning for wsrf-compliant applications
Authors: Eun-Kyu Byun, Jae-Wan Jang, Jin-Soo Kim
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Although WSRF (Web Services Resource Framework) and Java-based hosting environment have been successful in dealing with the heterogeneity of resources and the diversity of applications, the current Grid middleware has several limitations to support on-demand resource provisioning effectively. This paper proposes DynaGrid, a new framework for WSRF-compliant applications. Many new components, such as Service Door, Dynamic Service Launcher (DSL), Client Proxy, and Partition Manager, have been introduced to offer adaptive, scalable, and reliable resource provisioning. All of these components are implemented as standard WSRF-compliant Web services, hence DynaGrid is complementary to the existing Grid middleware. The experimental evaluations are performed on a real test bed with practical applications including the Map Reduce application. The results indicate that DynaGrid effectively utilizes Grid resources by allocating only the required number of resources adaptively according to the amount of incoming requests, providing both the scalability and the reliability at the same time.
Fidelity and yield in a volcano monitoring sensor network
Authors: Geoff Werner-Allen, Konrad Lorincz, Jeff Johnson, Jonathan Lees, Matt Welsh
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

We present a science-centric evaluation of a 19-day sensor network deployment at Reventador, an active volcano in Ecuador. Each of the 16 sensors continuously sampled seismic and acoustic data at 100 Hz. Nodes used an event-detection algorithm to trigger on interesting volcanic activity and initiate reliable data transfer to the base station. During the deployment, the network recorded 229 earthquakes, eruptions, and other seismoacoustic events. The science requirements of reliable data collection, accurate event detection, and high timing precision drive sensor networks in new directions for geophysical monitoring. The main contribution of this paper is an evaluation of the sensor network as a scientific instrument, holding it to the standards of existing instrumentation in terms of data fidelity (the quality and accuracy of the recorded signals) and yield (the quantity of the captured data). We describe an approach to time rectification of the acquired signals that can recover accurate timing despite failures of the underlying time synchronization protocol. In addition, we perform a detailed study of the sensor network's data using a direct comparison to a standalone data logger, as well as an investigation of seismic and acoustic wave arrival times across the network.
Adaptive Route Optimization in Hierarchical Mobile IPv6 Networks
Authors: Sangheon Pack, Xuemin (Sherman) Shen, Jon W. Mark, Jianping Pan
Venue: IEEE Transactions on Mobile Computing (2007)

By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. However, if a mobile node (MN)'s session activity is high and its mobility is relatively low, HMIPv6 may degrade end-to-end data throughput due to the additional packet tunneling at the MAP. In this paper, we propose an adaptive route optimization (ARO) scheme to improve the throughput performance in HMIPv6 networks. Depending on the measured session-to-mobility ratio (SMR), ARO chooses one of the two different route optimization algorithms adaptively. Specifically, an MN informs a correspondent node (CN) of its on-link care-of address (LCoA) if the CN's SMR is greater than a predefined threshold. If the SMR is equal to or lower than the threshold, the CN is informed with the MN's regional CoA (RCoA). We analyze the performance of ARO in terms of balancing the signaling overhead reduction and the data throughput improvement. We also derive the optimal SMR threshold explicitly to achieve such a balance. Analytical and simulation results demonstrate that ARO is a viable scheme for deployment in HMIPv6 networks.
Software write detection for a distributed shared memory
Authors: Matthew J. Zekauskas, Wayne A. Sawdon, Brian N. Bershad
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

Most software-based distributed shared memory (DSM) systems rely on the operating system's virtual memory interface to detect writes to shared data. Strategies based on virtual memory page protection create two problems for a DSM system. First, writes can have high overhead since they are detected with a page fault. As a result, a page must be written many times to amortize the cost of that fault. Second, the size of a virtual memory page is too big to serve as a unit of coherency, inducing false sharing. Mechanisms to handle false sharing can increase runtime overhead and may cause data to be unnecessarily communicated between processors. In this paper, we present a new method for write detection that solves these problems. Our method relies on the compiler and runtime system to detect writes to shared data without invoking the operating system. We measure and compare implementations of a distributed shared memory system using both strategies, virtual memory and compiler/runtime, running a range of applications on a small scale distributed memory multicomputer. We show that the new method has low average write latency and supports fine-grained sharing with low overhead. Further, we show that the dominant cost of write detection with either strategy is due to the mechanism used to handle fine-grain sharing.
Virtual Prototyping of Directed Energy Weapons
Authors: M. T. Bettencourt, D. J. Amdahl, L. A. Bowers, KL. Cartwright, A. D. Greenwood, T. P. Fleming, M. D. Haworth, N. P. Lockwood, P. J. Mardahl, R. E. Jr. Peterkin, J. W. Luginsland, J. J. Watrous
Venue: Proceedings of the HPCMP Users Group Conference (2006)

This paper gives an overview of how RF systems, from pulsed power to antennas, may be virtually prototyped with the Improved Concurrent Electromagnetic Particle-in-Cell (ICEPIC) code. ICEPIC simulates from first principles (Maxwell's equations and Lorenz's force law) the electrodynamics and charged particle dynamics of the RF-producing part of the system. Our simulations focus on gigawatt-class sources; the relativistic magnetron is shown as an example. Such simulations require enormous computational resources. These simulations successfully expose undesirable features of these sources and help us to suggest improvements.
Towards Device-Blending: Model and Challenges
Authors: Harinder Seera, Seng Wai Loke, Torab Torabi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This position paper proposes a device-blending architecture for aggregating device functionality via inter-device peer-to-peer relationships, effectively forming a multi-device "distributed computer", as a collective for processing tasks for users. The system would provide users with more freedom when using the devices by hiding low level details of device interconnections and automating such connectivity. We describe the concept of device-blending, point out benefits of the architecture and examine implementation and software issues related to the model. We contend that inter-device relationships, as we introduce in this paper, forms an important platform for subsequent inter-device collaborations in fulfilling user tasks.
Adaptive distributed caching
Authors: M. J. Kaiser, Jiming Liu
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper introduces an adaptive algorithm for distributed caching based on the idea of autonomous proxy caches without the usage of a central coordinator or broadcasting protocol. We show that the algorithm outperforms existing approaches based on hashing algorithms in hot-spot scenarios and common power-law request patterns.
Optimal coarse quantization of finite-length signals using integer programming
Authors: A. Demir
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper introduces a novel, discrete optimization based method for the computation of coarsely quantized, oversampled finite-length digital signals. The method, while only suitable for off line computation, is more general than the established sigma-delta encoding technique, due to its capacity to take into account complex specifications and design trade-offs. Signal generation is formulated as a linearly constrained, convex, integer quadratic programming problem which is solved through an application specific branch-and-bound algorithm. The optimization method is illustrated with a fractional-N frequency synthesizer based modulator design example.
Making ballot language understandable to voters
Authors: Sharon J. Laskowski, Janice Redish
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

The wording and placement of instructions can help or hinder voters from successfully voting for their choices. No research has been done specifically on the language of instructions to voters, but we can draw best practices from research in several related disciplines. A recent study by the authors shows that typical ballots in the United States violate many of the best practices drawn from research. In this paper, we discuss and offer examples of the gap between best practice in giving instructions and the instructions that many voters see as they try to vote. We discuss the research on which we draw for these best practices and the need to study the applicability of this research in the specific context of voting instructions.
Substructure Allocation in Recursive Interconnection Networks
Authors: Ronald Fernandes, Arkady Kanevsky
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In a multiuser message passing MIMD sys tem, substructure allocation is an important aspect of sys tem design. In this paper, we present four substructure al location algorithms for a multiuser WK-Recursive network. Two algorithms are bit-map based and two are tree based. The algorithms are compared using simulation.