ppxscal/embedding_network huggingface dataset:
A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing
Authors: Phan C. Vinh, Jonathan P. Bowen
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Dynamically reconfigurable computing within embedded computer-based systems can be partially modified at runtime without stopping the operation of the whole system. In this paper, a provable algorithm for runtime evolution of a logical configuration is formally represented by the appropriate graph transformation. In other words, programming is considered as a visual transformation of the logical configuration by the formulated rules. Their soundness is proved. A logical configuration in evolution is provable from another by applying these rules. Subsequently, an algorithmic approach to programming is formally developed and analyzed.
Variations on HIPO
Authors: Joe Rigo
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

The chart on this page is one of several variations on HIPO that are turning up in business applications. This one combines the HIPO diagram with the traditional system operations chart. If you know of other variations, send a copy of one to the newsletter. 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
On-Line Identification of Faults in Fault-Tolerant Imagers
Authors: Glenn H. Chapman, Israel Koren, Zahava Koren, Jozsef Dudas, Cory Jung
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Detection of defective pixels that develop on-line is a vital part of fault tolerant schemes for repairing imagers during operation. This paper presents a new algorithm for the identification of stuck low, stuck high, and partially stuck pixels in both regular and fault tolerant APS systems. The algorithm does not require specialized illuminations but instead operates on a sequence of regular images and uses statistical information extracted from each image to decide the state of each pixel. Unlike previous techniques, simulations of this technique show that it can find all faulty pixels without misidentifying good pixels as faulty. Under typical conditions, the algorithm will successfully converge on the correct result within 238 images for a fault tolerant APS, and 16 images for a regular APS. More extensive simulations have shown that these results can be extended to high-resolution sensors and complex defect models that include hot pixels, without a significant decline in performance.
Mulholland drive: a movie with no image
Authors: D. Scott Hessels
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Three media artists, Martin Bonadeo, Michael Chu, and D. Scott Hessels, drove Los Angeles' famous Mulholland Drive with five types of sensors--measuring the car's tilt, direction, altitude, speed, and engine sound. The captured data of the mountain road was loaded into a computer and a 3-dimensional model was created. This model was used computationally to control two robotic lights in a room filled with fog. Two 100-foot beams of light and the processed sound of the engine recreated the topology of the road as a new form of visual experience and sculpture-cinema without image. The artwork is designed as a contemporary category of Land Art sculpture, where new media sensors now offer increased abilities to read the environment and allow its forces to generate art.
Research on workflow process structure verification
Authors: LING Hong, ZHOU JiangBo
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

To solve the verification problem of workflow process structure, after reviewing related research papers, semantic deduce-based workflow verification method is proposed. Through process structure verification equal theorem, the proposed method Firstly transforms a cyclic workflow process into an acyclic one ; and then generates all instance graphs of the workflow process; lastly decides whether the workflow process is correct or not according to semantic tables and the acyclic workflow verification theorem. Comparison with related workflow verification methods is presented in the end.
Categorizing and Extracting Information from Multilingual HTML Documents
Authors: SeungJin Lim, Yiu-Kai Ng
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

The amount of online information written in different natural languages and the number of non-English speaking Internet users have been increasing tremendously during the past decade. In order to provide high-performance access of multilingual information on the Internet, we have developed a data analysis and querying system (DatAQs) that (i) analyzes, identifies, and categorizes languages used in HTML documents, (ii) extracts information from HTML documents of interest written in different languages, (iii) allows the user to submit queries for retrieving extracted information in the same natural language provided by the query engine of DatAQs using a menu-driven user interface, and (iv) processes the user¿s queries (as Boolean expressions) to generate the results. DatAQs extracts information from HTML documents that belong to various data-rich, narrow-in-breadth application domains, such as car ads, house rentals, job ads, stocks, university catalogs, etc. The average F-measure on identifying HTML documents written in a particular natural language correctly is 89%, whereas the F-measure on categorizing HTML documents belonged to the car-ads application domain is 94%.
Braitenberg simulations as vehicles of evolution
Authors: Correy Allen Kowall
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In this paper, we describe a series of simulations that serve as a verification of the abstract similarity between vehicular and animal navigation. Valentino Braitenberg used this similarity to illustrate that vehicles controlled by very simple biologically inspired circuits, manifest a wonderful diversity of complex animal behaviors. By constructing a series of experiments that are designed around the possibility of interchanging phenomena that affect vehicles or animals, we hope to show that this analogical similarity is a useful tool.
Traffic characteristics of a massively multi-player online role playing game
Authors: Jaecheol Kim, Jaeyoung Choi, Dukhyun Chang, Taekyoung Kwon, Yanghee Choi, Eungsu Yuk
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

This paper presents traffic measurement of a Massively Multiplayer On-line Role Playing Game (MMORPG). This analysis characterizes the MMORPG traffic and shows its implications for future research issues. The target game is 'Lineage II' developed by NCsoft, which is one of the world's largest MMORPGs in terms of the number of concurrent users. We collected about 1 tera bytes of packets for four consecutive days including a weekend. The MMORPG traffic consists of two kinds of packets: client-generated packets and server-generated packets. We observe that the client packet has an average of 19 bytes payload size, while the average payload size of server packets is about 318 bytes. This asymmetry is due to the fact that the server transmits all the information to construct the visual environment for the clients in the same region. Likewise, the bandwidth usage of the server traffic is about ten times larger than that of the client traffic. The analysis of RTT reveals that client packets and server packets are transmitted mostly at the interval of 200 milliseconds due to TCP's delayed ACK. We find that there is a linear relationship between the number of users and the bandwidth usage except when the number of users is around 5000.
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
Authors: H. Brendan McMahan, Maxim Likhachev, Geoffrey J. Gordon
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start state to a goal, restricting computation to states relevant to this task can make much larger problems tractable. We introduce a new algorithm, Bounded RTDP, which can produce partial policies with strong performance guarantees while only touching a fraction of the state space, even on problems where other algorithms would have to visit the full state space. To do so, Bounded RTDP maintains both upper and lower bounds on the optimal value function. The performance of Bounded RTDP is greatly aided by the introduction of a new technique to efficiently find suitable upper bounds; this technique can also be used to provide informed initialization to a wide range of other planning algorithms.
From RT-LOTOS to Time Petri Nets New Foundations for a Verification Platform
Authors: T. Sadani, P. De Saqui-Sannes, J.-P. Courtiat
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

The formal description technique RT-LOTOS has been selected as intermediate language to add formality to a real-time UML profile named TURTLE. For this sake, an RT-LOTOS verification platform has been developed for early detection of design errors in real-time system models. The paper discusses an extension of the platform by inclusion of verification tools developed for Time Petri Nets. The starting point is the definition of RT-LOTOS to TPN translation patterns. In particular, we introduce the concept of components embedding Time Petri Nets. The translation patterns are implemented in a prototype tool which takes as input an RT-LOTOS specification and outputs a TPN in the format admitted by the TINA tool. The efficiency of the proposed solution has been demonstrated on various case studies.
A comparison of student perceptions of complexity for traditional and object-oriented programs
Authors: Randall Dyck
Venue:  (2005)

Scope of study. This dissertation investigated differences in students' perceptions of the relative perceived complexity of traditionally developed software programs versus object-oriented developed software programs. Previous research and students at two different academic institutions were surveyed to gain insights for developing a framework by which different programming paradigms may be compared for complexity. Findings and conclusions. This dissertation discovered that the surveyed students' perceptions of programs' relative complexity increase when object-oriented technologies are used to solve a given business problem instead of traditional programming technologies. It will be of interest to faculty and administrators at technical institutes who want to have a greater understanding of student perceptions of complexity in different programming paradigms. It identified critical success factors, such as formatting and input/output commands, that can impact perceived program complexity. The findings also indicated a need for more efficient development tools, better training for existing tools, and more consistent design approaches.
HyperMem: A System to Store and Replay Experiences in Mixed Reality Worlds
Authors: Nuno Correia, Luis Alves, Ricardo Sa, Jorge Santiago, Luis Romero
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

This paper describes HyperMem, a system to store and replay user experiences in mixed reality worlds. The experience is stored as a set of hypermedia nodes and links, with the information that was displayed along with the video of the real world that was navigated. It uses a generic hypermedia model implemented as software components developed to handle mixed reality environments. This approach is applied to an augmented museum, that includes information and gaming activities in the physical and virtual 3D worlds. The paper presents the goals of the system, the underlying hypermedia model, the type of worlds that we are considering, and the architecture and tools for replaying and repurposing stored information.
Logical Foundations of Program Assertions: What do Practitioners Want?
Authors: Patrice Chalin
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Industrial use of program assertions for the purpose of Run-time Assertion Checking (RAC) is becoming commonplace. A likely next step in the use of assertions is Extended Static Checking (ESC), an area of active research that promises added benefits to industry. Unfortunately, RAC and ESC tools are not consistent in their interpretation of assertions containing undefined terms. In this paper, we report on the results of a survey in which we asked industrial developers what logical semantics they want program assertions to have, and whether consistency across tools is important. Survey results indicate that developers are in favor of a semantics for assertions that is compatible with their current use in RAC.
Low-Level Components of Analytic Activity in Information Visualization
Authors: Robert Amar, James Eagan, John Stasko
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Existing system-level taxonomies of visualization tasks are geared more towards the design of particular representations than the facilitation of user analytic activity. We present a set of ten low-level analysis tasks that largely capture people's activities while employing information visualization tools for understanding data. To help develop these tasks, we collected nearly 200 sample questions from students about how they would analyze five particular data sets from different domains. The questions, while not being totally comprehensive, illustrated the sheer variety of analytic questions typically posed by users when employing information visualization systems. We hope that the presented set of tasks is useful for information visualization system designers as a kind of common substrate to discuss the relative analytic capabilities of the systems. Further, the tasks may provide a form of checklist for system designers.
Managing Semi-Structured Data
Authors: Daniela Florescu
Venue: Queue (2005)

I vividly remember during my first college class my fascination with the relational database—an information oasis that guaranteed a constant flow of correct, complete, and consistent information at our disposal. In that class I learned how to build a schema for my information, and I learned that to obtain an accurate schema there must be a priori knowledge of the structure and properties of the information to be modeled. I also learned the ER (entity-relationship) model as a basic tool for all further data modeling, as well as the need for an a priori agreement on both the general structure of the information and the vocabularies used by all communities producing, processing, or consuming this information.
Machine learning in computational finance
Authors: Malik Magdon-Ismail
Venue:  (2005)

We focus on constructing efficient algorithms for problems arising in applications of machine learning in the field of computational finance. One generally should consider three different facets of designing an algorithm for an artificial intelligence application: (i) Constructing a training dataset; (ii) Developing a training algorithm; (iii) Using side information for avoiding overfitting. The first part of this thesis addresses (i). We consider the problem of finding optimal trading strategies with respect to the total cumulative return, Sterling ratio and two variants of the Sharp Ratio. Knowing what the optimal trades are is necessary for constructing the training dataset for a supervised learning algorithm The contribution in this work is to give efficient (low order polynomial time) algorithms to compute the optimal trading strategy for various profit objectives, and under constraints on the number of trades that can be made. The heart of our algorithms is a new algorithm for maximizing quotients over intervals. The second part of this thesis addresses (ii). The problem of learning often can be considered as the problem of finding a linear separator for two sets of points. When the sets are not separable, we are interested in finding a subset of points such that after removing these points, the remaining points are separable. If we assign a positive weight to every point, then we wish to find a separator set with the minimum possible weight. We provide a combinatorial deterministic algorithm for computing such a minimum separator set in 2 dimensions. The constructed algorithm also provides the leave-one-out error simultaneously. The problem of overfitting training data is well recognized in the machine learning community. Standard approach to deal with this threat is the early stopping of the training algorithm iterations. Usually one monitores another error measure and stops iterations when the associated error starts growing. The associated error can be same error function measured on separate set of datapoints or different error function. Since the associated error measure is somewhat different from the primary, it does not necessary shows monotinical behavior. In order to pinpoint the exact location of the critical point, one can perform shape constrained optimization. Another application of the shape constrained regression arise in the pricing of financial instruments, for example the American put option. Isotonic and unimodal regression are both examples of nonparametric shape constrained regression. In the third part of this work we present efficient algorithms for computing for L &infin;, L1 isotonic and unimodal regressions.
A Holter of Low Complexity Design Using Mixed Signal Processor
Authors: Chin-Tang Hsieh, Guang-Lin Hsieh, Eugene Lai, Zong-Ting Hsieh, Guo-Ming Hong
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

A low power, portable, and easily implemented Holter recorder is necessary for patients or researchers of electrocardiogram (ECG). Such a Holter recorder with off-the-shelf components is realized with mixed signal processor (MSP) in this paper. To decrease the complexity of analog circuits and the interference of 60Hz noise from power line, we use the MSP to implement a finite impulse response (FIR) filter which is equiripple design. We also integrate the ringed buffer for the input samples and the symmetrical characteristic of the FIR filter for efficiently computing convolution. The experimental results show that the output ECG signal with the PQRST feature is easy to be distinguished. This ECG signal is recorded for 24hr using a SD card. Furthermore, the ECG signal is transmitted with a smartphone via Bluetooth to decrease the burden of the Holter recorder.
Automatic placement of authorization hooks in the linux security modules framework
Authors: Vinod Ganapathy, Trent Jaeger, Somesh Jha
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We present a technique for automatic placement of authorization hooks, and apply it to the Linux security modules (LSM) framework. LSM is a generic framework which allows diverse authorization policies to be enforced by the Linux kernel. It consists of a kernel module which encapsulates an authorization policy, and hooks into the kernel module placed at appropriate locations in the Linux kernel. The kernel enforces the authorization policy using hook calls. In current practice, hooks are placed manually in the kernel. This approach is tedious, and as prior work has shown, is prone to security holes.Our technique uses static analysis of the Linux kernel and the kernel module to automate hook placement. Given a non-hook-placed version of the Linux kernel, and a kernel module that implements an authorization policy, our technique infers the set of operations authorized by each hook, and the set of operations performed by each function in the kernel. It uses this information to infer the set of hooks that must guard each kernel function. We describe the design and implementation of a prototype tool called TAHOE (Tool for Authorization Hook Placement) that uses this technique. We demonstrate the effectiveness of TAHOE by using it with the LSM implementation of security-enhanced Linux (selinux). While our exposition in this paper focuses on hook placement for LSM, our technique can be used to place hooks in other LSM-like architectures as well.
Partial results and structural aggregation over xml data streams
Authors: Kristin A. Tufte
Venue:  (2005)

Traditional database systems operate over relatively static data stored on disks local to the database system. In contrast, large amounts data such as network traffic information, telecom data, and stock tickers are presented in the form of dynamic data streams whose arrival speed and order are outside of the control of the database system. Much of this data is in XML, a self-describing data format that has gained wide acceptance for data exchange and dissemination on the World Wide Web. In order to support queries over data streams, traditional database systems require new operators and system modifications. Queries involving non-monotonic operators such as nest and aggregates present particular challenges. Non-monotonic operators cannot produce results until they have read the entire input; this requirement is unacceptable when the input is a potentially-infinite stream. We propose an architecture, called Incremental Query Evaluation (IQE), for making queries&mdash;including those involving non-monotonic operators&mdash;propagate their &ldquo;current&rdquo; (partial) results to users before the input has been fully processed. We define the semantics of partial results and outline mechanisms for ensuring these semantics for queries with arbitrary non-monotonic operators. We describe several operator implementations that satisfy the semantics and evaluate the implementations' performance. The results of the IQE investigation suggested the value of an operator that could combine fragments of XML together. Consequently, we developed a new operation, Merge, that pieces together fragments of XML to create a new XML document. Merge functions as a kind of &ldquo;recursive union&rdquo; over similarly-structured XML documents to produce a new XML document. We present a formal theory of the Merge operation and introduce a syntax for representing XML documents as annotated sets of paths. We describe an implementation of a Merge-based operator in the Niagara Internet Query System, including a description of how Merge has been extended to handle windows over data streams, and examine Merge's performance on structural aggregation queries.
Non-Almost-Derivable Frequent Itemsets Mining
Authors: Yang Xiaoming, Wang Zhibin, Liu Bing, Zhang Shouzhi, Wang Wei, Shi Bole
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The number of frequent itemsets is often too large to handle, so it is very necessary to work out a condensed representation of the collection of all frequent itemsets. In this paper, we propose a new condensed representation called frequent non-almost-derivable itemsets. This representation is a subset of the original collection of frequent itemsets. For any removed itemset X(which is called an frequent almost-derivable itemset), we can derive a lower and an upper bound of its support from this representation, and the lower bound and the upper bound is close enough(can be controlled by a userdefined parameter). We also propose an Apriori-like algorithm, which can extract all frequent nonderivable itemsets. Extensive empirical results on real datasets show the compactness and good approximation of this representation.