ppxscal/embedding_network huggingface dataset:
An analysis of latent sector errors in disk drives
Authors: Lakshmi N. Bairavasundaram, Garth R. Goodson, Shankar Pasupathy, Jiri Schindler
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

The reliability measures in today's disk drive-based storage systems focus predominantly on protecting against complete disk failures. Previous disk reliability studies have analyzed empirical data in an attempt to better understand and predict disk failure rates. Yet, very little is known about the incidence of latent sector errors i.e., errors that go undetected until the corresponding disk sectors are accessed. Our study analyzes data collected from production storage systems over 32 months across 1.53 million disks (both nearline and enterprise class). We analyze factors that impact latent sector errors, observe trends, and explore their implications on the design of reliability mechanisms in storage systems. To the best of our knowledge, this is the first study of such large scale our sample size is at least anorder of magnitude larger than previously published studies and the first one to focus specifically on latent sector errors and their implications on the design and reliability of storage systems.
Integrating engineering and global competencies: a case study of Oregon State University's International Degree Program
Authors: D. Herling
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Although educators recognize the importance of a global perspective, few engineering undergraduates integrate significant international experience into their academic program. Oregon State University's innovative International Degree Program allows students to earn a concurrent bachelor's degree in International Studies associated with an engineering degree. Requirements include foreign language proficiency, overseas experience, courses with a cross-cultural focus, and a thesis. The program draws on campus resources such as overseas study programs, international internships, and the honors college, and enlists engineering faculty members as thesis advisors. This case study of a mechanical engineering student illustrates the degree's potential. In addition to meeting engineering requirements, he spent a year at a British university, studied Spanish in Spain, interviewed European engineers for his thesis on the Internet's impact on mechanical engineering design, and interned with a German company. His technical skills and global competencies equip him to work as a professional engineer both at home and abroad.
Optimal Unified Data Allocation and Task Scheduling for Real-Time Multi-Tasking Systems
Authors: Rony Ghattas, Gregory Parsons, Alexander G. Dean
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

Many real-time (RT) embedded systems can benefit from a memory hierarchy to bridge the processor/ memory speed gap. These RT embedded systems usually utilize a cacheless architecture to avoid the time variability which complicates the timing analysis essential for RT systems. In the absence of a cache the burden of allocating the data objects to the memory hierarchy is on the programmer/compiler. There has been much research into allocating data objects into the memory hierarchy for efficient execution. However, existing methods have limited scope and ignore some aspects of RT multitasking embedded systems. In this paper we propose a synergistic, optimal approach to allocating data objects and scheduling realtime tasks for embedded systems. We allocate data using integer linear programming (ILP) to minimize each task's worst-case execution time (WCET), then perform preemption threshold scheduling (PTS) on the tasks to reduce stack memory requirements while still meeting hard RT deadlines. The memory reduction of PTS allows these steps to be repeated. The data objects now require less memory, so more can fit into faster memory, further reducing WCET. The increased slack time can be used by PTS to reduce preemptions further, until a fixed point is reached. We evaluate the technique with several levels of data object granularity using both synthetic workloads and a realtime benchmark and find it to be highly effective.
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
Authors: Orhan Cetinkaya, Ali Doganaksoy
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, individual verifiability, and universal verifiability. Unlike existing e-voting protocols we employ dynamic ballot instead of predefined usual ballot in order to strengthen accuracy and fairness of the protocol. In dynamic ballots, the ordering of candidates in the ballots is dynamically created and changes for each voter. Therefore the proposed protocol is called as "DynaVote". DynaVote does not use complex cryptographic algorithms such as homomorphic encryption and does not require anonymous communication channels such as mix-nets since it employs PVID (Pseudo-Voter Identity) scheme which relies on blind signature. Besides it has no physical assumption such as untappable channels. Hence, DynaVote is a practical e-voting protocol for large scale elections. DynaVote is performed over a network such as the Internet. In order to achieve uncoercibility, DynaVote allows recasting without sacrificing uniqueness.
Misconvergence and stabilization of adaptive IIR lattice filters
Authors: F. Perez-Gonzalez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We take a new look to adaptive IIR lattice filters in order to devise algorithms that preserve the stability of the corresponding direct form schemes. By analyzing the local properties of stationary points, a transformation achieving this goal is suggested, which gives algorithms that can be efficiently implemented. Application to the Steiglitz-McBride and SHARF algorithms is presented. By contrast, it is shown that previous lattice versions of these algorithms may fail to preserve stability of stationary points.
Scratchpad allocation for data aggregates in superperfect graphs
Authors: Lian Li, Quan Hoang Nguyen, Jingling Xue
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. In this work, the SPM allocation problem is formulated as an interval coloring problem. The key observation is that in many embedded applications, arrays (including structs as a special case) are often related in the following way: For any two arrays, their live ranges are often such that one is either disjoint from or contains the other. As a result, array interference graphs are often superperfect graphs and optimal interval colorings for such array interference graphs are possible. This has led to the development of two new SPM allocation algorithms. While differing in whether live range splits and spills are done sequentially or together, both algorithms place arrays in SPM based on examining the cliques in an interference graph. In both cases, we guarantee optimally that all arrays in an interference graph can be placed in SPM if its size is no smaller than the clique number of the graph. In the case that the SPM is not large enough, we rely on heuristics to split or spill a live range until the graph is colorable. Our experiment results using embedded benchmarks show that our algorithms can outperform graph coloring when their interference graphs are superperfect or nearly so although graph coloring is admittedly more general and may also be effective to applications with arbitrary interference graphs.
The Zephyr abstract syntax description language
Authors: Daniel C. Wang, Andrew W. Appel, Jeff L. Korn, Christopher S. Serra
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

The Zephyr Abstract Syntax Description Language (ASDL) describes the abstract syntax of compiler intermediate representations (IRs) and other tree-like data structures. Just as the lexical and syntactic structures of programming languages are described with regular expressions and context free grammars, ASDL provides a concise notation for describing the abstract syntax of programming languages. Tools can convert ASDL descriptions into the appropriate data-structure definitions and functions to convert the data-structures to or from a standard flattened representation. This makes it easier to build compiler components that interoperate. Although ASDL lacks subtyping and inheritance, it is able to describe the Stanford University Intermediate Format (SUIF) compiler IR, originally implemented in C++. We have built a tool that converts ASDL into C, C++, Java, and ML data-structure definitions and conversion functions. We have also built a graphical browser-editor of ASDL data structures. ASDL shares features found in many network interface description languages (IDLs), algebraic data types, and languages such as ASN.1 and SGML. Compared to other alternatives ASDL is simple and powerful. This document describes ASDL in detail and presents an initial evaluation of ASDL.
An integrated, project-based, spiral curriculum for the first year of chemical engineering
Authors: W. M. Clark
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. The authors developed a project-based, spiral curriculum for chemical engineering, beginning with the sophomore year. The curriculum addresses problems in the current state of engineering education, such as lack of student motivation, poor retention, segmented learning, lack of integration and the need to deliver cost effective technical education to a student audience of diverse backgrounds and learning styles. The spiral curriculum was well received by students in the initial offering during the 1997-98 academic year.
Finding user/kernel pointer bugs with type inference
Authors: Rob Johnson, David Wagner
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Today's operating systems struggle with vulnerabilities from careless handling of user space pointers. User/kernel pointer bugs have serious consequences for security: a malicious user could exploit a user/kernel pointer bug to gain elevated privileges, read sensitive data, or crash the system. We show how to detect user/kernel pointer bugs using type-qualifier inference, and we apply this method to the Linux kernel using CQUAL, a type-qualifier inference tool. We extend the basic type-inference capabilities of CQUAL to support context-sensitivity and greater precision when analyzing structures so that CQUAL requires fewer annotations and generates fewer false positives. With these enhancements, we were able to use CQUAL to find 17 exploitable user/kernel pointer bugs in the Linux kernel. Several of the bugs we found were missed by careful hand audits, other program analysis tools, or both.
Aspects of adaptation in natural and artificial evolution
Authors: Michael Affenzeller, Stefan Wagner, Stephan Winkler
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further developments in the field of Genetic Algorithms (GAs) and Genetic Programming (GP) by the authors. In this connection special attention is devoted to selection and replacement strategies, as these are exactly the aspects that do not depend on certain problem representations and corresponding operators and therefore allow generic algorithmic further development. The concept of offspring selection is described as an example of such a problem independent further developed algorithmic concept, which allows to maintain the relevant genetic information stored in a population more efficiently. The potential of this new selection strategy is pointed out in terms of references to recent results achieved on the basis of well known benchmark problems in the field of GAs and GP.
Analytical image reconstruction in single photon emission computed tomography
Authors: Gengsheng L. Zeng
Venue:  (2006)

Single Photon Emission Computed Tomography (SPECT) has become important in medicine and biology since it can bring better understanding of biological processes. With the acceptance of SPECT imaging, the need for efficient and accurate reconstruction algorithms for SPECT has arisen. In SPECT imaging, photon attenuation within the patient's body is a major reason for quantitative inaccuracy in the measurement. This dissertation focuses on analytical image reconstruction algorithms in SPECT with attenuation correction. The problem of truncation in the projection data is touched upon in the work as well.First, an alternative proof of an inversion formula for attenuated fan-beam projections is given. The original formula was derived in a fairly complicated way. In this work, it is proved that the original formula for fan-beam projection is readily obtained from Novikov's inversion formula for the attenuated Radon transform. The derivation uses quite elementary methods and thus is less challenging to understand.Second, Novikov's inversion formula of the attenuated two-dimensional Radon transform is applied to the reconstruction of attenuated fan-beam projections acquired with equal detector spacing. Then the fan-beam reconstruction is extended to the attenuated cone-beam projections acquired with a flat planar detector and circular trajectory. The compensation for attenuation is efficient in both fan-beam and cone-beam geometries.Third, the cone-beam reconstruction algorithm is adopted for a high sensitivity small animal SPECT system with an innovative skew-slit imaging geometry. The couple of the novel skew-slit collimator system and the analytical reconstruction algorithm is superior to the state-of-the-art pinhole system for small animal SPECT in the sense that better detector sensitivity and higher quality in the reconstructed image can be expected.Fourth and finally; analytical reconstruction of the exponential Radon transform from only half scan data is presented. The algorithm not only reduces the scanning time and the dose use, but also is able to deal with the truncation in the projections.The validity of all algorithms are demonstrated with reconstructions from computer simulated data.
Architect's dream or developer's nightmare?
Authors: Gregor Hohpe
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Event-based systems offer many benefits. They enable loose coupled, composable solutions that can be highly scalable. They also resemble the real world---major parts of our daily lives are governed by events: the phone rings, a customer places an order, the fuel warning lamp in the car comes on. Unfortunately, the architectural benefits are often offset by the complexity of developing event-based solutions. This talk examines why building event-based solutions can be challenging and how we can make it more approachable.
Modelling Internet End-to-End Loss Behaviours: A New Approach
Authors: Vinh Bui, Weiping Zhu
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper proposes a new approach to modelling Internet end-to-end loss behaviours. Rather than select the model structure from the loss observations like being done previously, we construct a new loss model based on the TCP congestion control mechanism. Thus, the model can explicitly reflect the correlation between end-to-end loss observations and network flow level activities. Besides simulation, the model has been tested in both wired and wireless Internet environments. The result shows that, unless the losses due to the transmission errors are excessive e.g. in some lossy wireless channels, the model can correctly capture end-to-end loss behaviours not only in terms of average rates but also in terms of loss patterns i.e. loss and good runlengths. This implies a good connection between the model structure and network flow level activities, which makes the model attractive for assisting traffic control.
Integrating deep web data sources
Authors: Anhai Doan, Clement Yu
Venue:  (2006)

A large number of data sources on the Web (e.g., Amazon.com) are only accessible through their query interfaces. These sources are commonly known as Deep Web sources. For any domain of interest, there may be many such sources with varied query capabilities and content coverage. As a result, users frequently need to access multiple sources in order to find the desired information, which can be a very time-consuming and labor-expensive process. To address this problem, an effective solution is to build a virtual integration system over the sources. Such a system provides uniform accesses to the sources, thus freeing the users from the details of individual sources.As an important step towards this goal, this dissertation studies the problem of integrating query interfaces of Deep Web sources. Interface integration typically involves three very challenging tasks: (1) schema extraction , which infers the schema of each source query interface from its (HTML) representation; (2) schema matching, which accurately identifies semantic mappings among the attributes from different interfaces; and (3) schema merging, which properly merges the source interfaces into a well-formed global interface based on the identified attribute mappings.This dissertation presents IceQ, a novel and effective interface integration system. In developing IceQ, we address the limitations of existing solutions and make several key contributions. First, we propose a hierarchical modeling of interfaces and develop a novel spatial clustering algorithm to extract the hierarchical schema of query interface. Second, we develop a novel interactive clustering-based matching algorithm to accurately match a large number of schemas and effectively resolve uncertain mappings via user interaction. Third, we develop a question-answering technique to learn attribute instances from the Web to assist in schema matching. Fourth, we propose a novel constraint-based optimization framework for merging schemas and develop an effective merging algorithm based on the idea of clustering aggregation. Extensive experiments have been conducted to evaluate IceQ and the results show that it is highly effective.
Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems
Authors: Fajie Li, Reinhard Klette
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This reviewing paper provides a complete discussion of an algorithm (called rubberband algorithm), which was proposed by Bülow and Klette in 2000 - 2002 for the calculation of minimum-length polygonal curves in cube-curves in 3D space. The paper describes how this original algorithm was transformed afterwards, "step-by-step", into a general, provably correct, and time-efficient algorithm which solves the indented task for simple cube-curves of any complexity. Variations of this algorithm are then used to solve various Euclidean shortest path (ESP) problems, such as calculating the ESP inside of a simple cube arc, inside of a simple polygon, on the surface of a convex polytope, or inside of a simply-connected polyhedron, demonstrating a general (!) methodology of rubberband algorithms. The paper also reports how such algorithms improve various time complexity results of best algorithms for problems such as the touring polygons, parts cutting, safari and zookeeper, and the watchman route.
Discovering debtor patterns of centrelink customers
Authors: Yanchang Zhao, Longbing Cao, Yvonne Morrow, Yuming Ou, Jiarui Ni, Chengqi Zhang
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

Data mining is currently becoming an increasingly hot research field, but a large gap still remains between the research of data mining and its application in real-world business. As one of the largest data users in Australia, Centrelink has huge volume of data in data warehouse and tapes. Based on the available data, Centrelink is seeking to find underlying patterns to be able to intervene earlier to prevent or minimize debt. To discover the debtor patterns of Centrelink customers and bridge the gap between data mining research and application, we have done a project on improving income reporting to discover the patterns of those customers who were or are in debt to Centrelink. Two data models were built respectively for demographic data and activity data, and decision tree and sequence mining were used respectively to discover demographic patterns and activity sequence patterns of debtors. The project produced some potentially interesting results, and paved the way for more data mining applications in Centrelink in near future.
Sketching stencils
Authors: Armando Solar-Lezama, Gilad Arnold, Liviu Tancau, Rastislav Bodik, Vijay Saraswat, Sanjit Seshia
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Performance of stencil computations can be significantly improved through smart implementations that improve memory locality, computation reuse, or parallelize the computation. Unfortunately, efficient implementations are hard to obtain because they often involve non-traditional transformations, which means that they cannot be produced by optimizing the reference stencil with a compiler. In fact, many stencils are produced by code generators that were tediously handcrafted. In this paper, we show how stencil implementations can be produced with sketching. Sketching is a software synthesis approach where the programmer develops a partial implementation--a sketch--and a separate specification of the desired functionality given by a reference (unoptimized) stencil. The synthesizer then completes the sketch to behave like the specification, filling in code fragments that are difficult to develop manually. Existing sketching systems work only for small finite programs, i.e.,, programs that can be represented as small Boolean circuits. In this paper, we develop a sketching synthesizer that works for stencil computations, a large class of programs that, unlike circuits, have unbounded inputs and outputs, as well as an unbounded number of computations. The key contribution is a reduction algorithm that turns a stencil into a circuit, allowing us to synthesize stencils using an existing sketching synthesizer.
JHAVÉ -- More Visualizers (and Visualizations) Needed
Authors: Thomas L. Naps, Guido Rößling
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We recap the results of an ITiCSE 2002 Working Group report [Naps, T. L., G. Roszling, V. Almstrum, W. Dann, R. Fleischer, C. Hundhausen, A. Korhonen, L. Malmi, M. McNally, S. Rodger and J. A. Velazquez-Iturbide, Exploring the role of visualization and engagement in computer science education, ACM SIGCSE Bulletin 35 (2003), pp. 131-152], which set the stage for the work described here. That work has resulted in the newest release of a system called JHAVE, which fosters active engagement on the part of learners by providing a set of standard support tools for certain types of Algorithm Visualization (AV) systems. These AV engines must implement the JHAVEVisualizer interface. In return, such engines have convenient access to the engagement-based tools offered by JHAVE. The details of adapting one such engine, Animal, are also described.