ppxscal/embedding_network huggingface dataset:
Interactive Digital Image Processing
Authors: C. L. Patterson
Venue: Computer (1977)

It may strike some readers as an oversight that the image display and manipulation systems treated in this issue do not include the ones that set the standards for the industry. In fact, the omission was intentional: most of those systems have already been well covered in the literature. Our primary interest here was to explore those new systems which have yet to see the light of day and which are setting industry standards for the future.
Designing Sets of Fault-Detection Tests ror Combinational Logic Circuits
Authors: Z. Kohavi, D. A. Spires
Venue: IEEE Transactions on Computers (1971)

This paper is concerned with the problem of determining, by means of terminal experiments, whether a given combinational switching circuit operates correctly or is impaired by some malfunction. We shall be primarily concerned with permanent faults due to component failures. It is assumed that other methods will be employed to protect the circuit against the effects of transient faults. A procedure is presented for the detection of failures in combinational switching circuits. The procedure provides minimal sets of tests for two-level circuits and nearly minimal sets of tests for most multilevel circuits.
Hydra: a massively-multiplayer peer-to-peer architecture for the game developer
Authors: Luther Chan, James Yong, Jiaqiang Bai, Ben Leong, Raymond Tan
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

We present the design and implementation of Hydra, a peer-to-peer architecture for massively-multiplayer online games. By supporting a novel augmented server-client programming model with a protocol that guarantees consistency in the messages committed when nodes fail, existing game developers can realize the benefits of a peer-to-peer architecture without the burden of handling the complexities associated with network churn. Our key contribution is the development of a programming interface that is intuitive and easy to use, and that can be supported transparently at the network layer. We have implemented a prototype of Hydra and we demonstrate that our proposed architecture is practical by developing two games under the Hydra framework: a simple "capture the flag" tank game and a squad-based real-time strategy (RTS) game. Our experience in developing these games suggests that our proposed programming model is suitable for game development. Our preliminary experiments also show that Hydra imposes only a small message overhead and is thus scalable.
A Unified Framework for Symbol Segmentation and Recognition of Handwritten Mathematical Expressions
Authors: Yu SHI, HaiYang LI, Frank K. SOONG
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

A symbol decoding and graph generation algorithm for online handwritten mathematical expression recognition is formulated. It differs from our previous system and most other systems in two aspects: 1) it embeds stroke grouping into symbol identification to form a unified probabilistic framework for symbol recognition; and 2) a symbol graph rather than a list of symbol sequence hypotheses is generated, which makes post-processing with new information possible. Experimental results show that high quality symbol graph can be generated by the proposed algorithm. Symbol sequence corresponding to the best path in the graph demonstrates much higher symbol recognition accuracy than before, especially after rescoring with trigram. Math formula recognition performance is significantly improved.
Casting votes in the auditorium
Authors: Daniel Sandler, Dan S. Wallach
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

In elections employing electronic voting machines, we have observed that poor procedures, equipment failures, and honest mistakes pose a real threat to the accuracy of the final tally. The event logs kept by these machines can give auditors clues as to the causes of anomalies and inconsistencies; however, each voting machine is trusted to keep its own audit and ballot data, making the record unreliable. If a machine is damaged, accidentally erased, or otherwise compromised during the election, we have no way to detect tampering or loss of auditing records and cast votes. We see a need for voting systems in which event logs can serve as robust forensic documents, describing a provable timeline of events leading up to and transpiring on election day. To this end, we propose an auditing infrastructure that draws on ideas from distributed systems and secure logging to provide a verifiable, global picture of critical election-day events, one which can survive individual machine malfunction or malice. Our system, the Auditorium, joins the voting machines in a polling place together in a private broadcast network in which all election events are logged redundantly by every machine. Each event is irrevocably tied to the originating machine by a digital signature, and to earlier events from other machines via hash chaining. In this paper we describe in detail how to conduct an election in the Auditorium. We demonstrate our system's robustness to benign failures and malicious attacks, resulting in a believable audit trail and vote count, with acceptable overhead for a network the size of a polling place.
Reliability of human annotation of semantic roles in noisy text
Authors: Derrick Higgins
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper addresses the question of how to obtain consistent semantic annotation on the basis of a set of noisy texts. Many potential realworld applications of semantic computing are faced with the need to handle texts which are not well-edited, and for which a resource-intensive treebanking effort is not feasible. Student-produced short answers contain many grammatical and lexical errors, making consistent annotation a challenge. Nevertheless, this paper demonstrates that semantic role annotation can be done in a consistent and useful manner even under these constraints.
3-D Depth Reconstruction from a Single Still Image
Authors: Ashutosh Saxena, Sung H. Chung, Andrew Y. Ng
Venue: International Journal of Computer Vision (2008)

We consider the task of 3-d depth estimation from a single still image. We take a supervised learning approach to this problem, in which we begin by collecting a training set of monocular images (of unstructured indoor and outdoor environments which include forests, sidewalks, trees, buildings, etc.) and their corresponding ground-truth depthmaps. Then, we apply supervised learning to predict the value of the depthmap as a function of the image. Depth estimation is a challenging problem, since local features alone are insufficient to estimate depth at a point, and one needs to consider the global context of the image. Our model uses a hierarchical, multiscale Markov Random Field (MRF) that incorporates multiscale local- and global-image features, and models the depths and the relation between depths at different points in the image. We show that, even on unstructured scenes, our algorithm is frequently able to recover fairly accurate depthmaps. We further propose a model that incorporates both monocular cues and stereo (triangulation) cues, to obtain significantly more accurate depth estimates than is possible using either monocular or stereo cues alone.
Consistent interactive augmentation of live camera images with correct near-field illumination
Authors: Thorsten Grosch, Tobias Eble, Stefan Mueller
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Inserting virtual objects in real camera images with correct lighting is an active area of research. Current methods use a high dynamic range camera with a fish-eye lens to capture the incoming illumination. The main problem with this approach is the limitation to distant illumination. Therefore, the focus of our work is a real-time description of both near - and far-field illumination for interactive movement of virtual objects in the camera image of a real room. The daylight, which is coming in through the windows, produces a spatially varying distribution of indirect light in the room; therefore a near-field description of incoming light is necessary. Our approach is to measure the daylight from outside and to simulate the resulting indirect light in the room. To accomplish this, we develop a special dynamic form of the irradiance volume for real-time updates of indirect light in the room and combine this with importance sampling and shadow maps for light from outside. This separation allows object movements with interactive frame rates (10--17 fps). To verify the correctness of our approach, we compare images of synthetic objects with real objects.
Guest Editors' Introduction: Hot Chips 18
Authors: John Kubiatowicz, Howard Sachs
Venue: IEEE Micro (2007)

Over its 18-year history, the Hot Chips conference has become a leading forum for the latest computing, communications, and networking chips. The conference covers a variety of technical details about these chips, including technology, fundamental algorithms, packaging techniques, architecture, and circuit details. This issue features six of the best presentations from Hot Chips 18, expanded to full articles. Topics include multiprocessor/multicore systems, embedded processing, and low-power processing.
CodeAnnotator: digital ink annotation within Eclipse
Authors: Xiaofan Chen, Beryl Plimmer
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Programming environments do not support ink annotation. Yet, annotation is the most effective way to actively read and review a document. This paper describes a tool, CodeAnnotator, which integrates annotation support inside an Integrated Development Environment (IDE). This tool is designed and developed to support direct annotation of program code with digital ink in the IDE. Programmers will benefit from a more intuitive interaction space to record notes and comments just as they would on paper documents.
SAR Images Denoising Based on Rough Set Theory in Contourlet Domain
Authors: Xiao-lei Wei, Yong-an Zheng, Zhan-zhong Cui, Quan-li Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The paper present a speckle reduction method based on rough set theory in contourlet domain. The modified upper approximation set is proposed to check good continuation of the window center with a rotating neighborhood templates distributed uniformly around the center. Firstly a logarithmically transform is applied for converting the speckles to additive noises, then the contourlet transform is employed for decomposing the logarithmically transformed image into low frequency samples and directional bandpass samples. A non- statistical variance between the center of a window and pixels of window template is used as the measure of good continuation for bandpass samples in each scale. The minimum vale of this variance is found to get the most homogeneous template and the mean of this most homogeneous template is then used to take place the center coefficient. Finally the de-noised image is reconstructed by the inverse contourlet transform and the experiment result shows this method is effectively for SAR images de-noising.
Extracting rights and obligations from regulations: toward a tool-supported process
Authors: Nadzeya Kiyavitskaya, Nicola Zeni, Travis D. Breaux, Annie I. Antón, James R. Cordy, Luisa Mich, John Mylopoulos
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Security, privacy and governance are increasingly the focus of government regulations in the U.S., Europe and elsewhere. This trendhas created a "regulation compliance problem", whereby companiesand developers are required to ensure that their software complies with relevant regulations, either through design or reengineering. We previously proposed a methodology for extracting stakeholder requirements, called rights and obligations, from regulations. In this paper, we examine the challenges of developing tool support for this process. We apply the Cerno framework for textual semantic annotation to propose a tool for semi-automatic semantic annotation of concepts that constitute sources of requirements
Algorithm of Scene Segmentation Based on SVM for Scenery Documentary
Authors: Jian-Rong Cao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Shot is a basic unit of content-based video retrieval and indexing. Relevant shots are typically grouped into a high-level unit called a scene. Browsing and retrieval in these scenes enables users to locate their desired video segments quickly and efficiently. This paper introduces a novel algorithm for clustering relevant shots into a scene using the semantic concept vectors defined by us and formed by N binary classifiers based on support vector machine (SVM). At first, the video clips are segmented into the shot. The shot key frames are extracted and the color and texture features of the shot key frames are computed. Then the N trained binary classifiers are used to classify the shot key frames into different semantic classes by means of their color and texture features. So the semantic concept vectors of the shot key frames can formed. The semantic concept vectors are used to cluster the shots into the scenes in our algorithm. Experimental results have indicated that the recall and precision of our algorithm is higher than the algorithm of SIM and ToC.
GigaNoC - A Hierarchical Network-on-Chip for Scalable Chip-Multiprocessors
Authors: Christoph Puttmann, Jorg-Christian Niemann, Mario Porrmann, Ulrich Ruckert
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Due to the technological progress in the semiconductor industry, more and more components can be integrated on a single die forming a complex System-on-Chip. For enabling an efficient interaction between the various building blocks of today's SoCs, efficient communication structures become more and more essential. In this paper, we present the GigaNoC, a hierarchical Network-on-Chip that is especially suitable for scalable Chip-Multiprocessor architectures. The GigaNoC approach features a packet-switched wormhole routing on-chip network that provides the backbone of our multiprocessor architecture. In order to meet bandwidth requirements of different application domains, our Network-on-Chip is easily scalable and parameterizable in various aspects. This work highlights the communication protocol and shows a performance evaluation for different congestion scenarios. Furthermore, we present an FPGA-based prototypical realization and introduce a debugging and verification environment. Finally, implementation results for a standard cell technology are discussed.
Biologically-inspired Complex Adaptive Systems approaches to Network Intrusion Detection
Authors: Kamran Shafi, Hussein A. Abbass
Venue: Information Security Tech. Report (2007)

The pervasiveness of the computing power has made it an inevitable commodity of the modern time. The inexorable technological advances clearly predict the continually increasing reliance of human life on the computing systems in the future. Intelligent portable devices are commonplace these days and information accessibility is ubiquitous. There is a network underlying any computer infrastructure. Complex Adaptive Systems (CAS) are a relatively new field with techniques inspired by Biology, Sociology and other fields. The field of CAS studies systems as a network of interdependent components. There has been a major breakthrough in the field of Network Intrusion Detection Systems (NIDS) in computer security through the adoption of a CAS perspective. This paper surveys some key work in this area with the primary focus being placed on biologically-inspired CAS approaches to NIDS.
OWL-T: An Ontology-based Task Template Language for Modeling Business Processes
Authors: Vuong Xuan Tran, Hidekazu Tsuji
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

With the growth of business demands, it becomes crucial to compose existing services in order to create new value added applications. Some languages like BPEL, WSCI enable creating complex composite services but they only allow static, manual composition. Basing on semantic technologies, many researchers have proposed (semi-)automatic methods for service composition, which often rely on a close world assumption and are not scalable for complex systems. In essence, these approaches lack a means for users expressing their complex business demands in a form that facilitates systems automatically generating a composite service. In this paper, we introduce our approach to provide an ontology/language based on the OWL, called OWL-T, for formally and semantically defining task templates that capture business demands at a high-level abstraction. Therefore, with a complex business demand expressed in terms of structured tasks, users need not to care about technical details of composition languages and an automatic composition method can be used to transform task templates into executable processes. In addition, based on semantic technologies, the OWL-T ontology also enhances the interoperability for better sharing and reuse of task templates in various domains of discourse.
Minicomputers in the Digital Laboratory Program
Authors: Taylor
Venue: Computer (1973)

The following article is a condensation of a COSINE task force report. The editing process required to condense the original report for these pages necessarily involves arbitrary judgements, and may have introduced emphases and perspectives that are not held by the authors of the report. All such differences are unintentional. Interested readers should obtain copies of the full report, which are available without charge from: Commission on Education, National Academy of Engineering, 2101 Constitution Avenue, N. W. Washington, D. C. 20418
Secure data outsourcing
Authors: Radu Sion
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly relevant for outsourced data frameworks in which clients place data management with specialized service providers. Clients are reluctant to place sensitive data under the control of a foreign party without assurances of confidentiality. Additionally, once outsourced, privacy and data access correctness (data integrity and query completeness) become paramount. Today's solutions are fundamentally insecure and vulnerable to illicit behavior, because they do not handle these dimensions. In this tutorial we will explore how to design and build robust, efficient, and scalable data outsourcing mechanisms providing strong security assurances of (1) correctness, (2) confidentiality, and (3) data access privacy. There exists a strong relationship between such assurances; for example, the lack of access pattern privacy usually allows for statistical attacks compromising data confidentiality. Confidentiality can be achieved by data encryption. However, to be practical, outsourced data services should allow expressive client queries (e.g., relational joins with arbitrary predicates) without compromising confidentiality. This is a hard problem because decryption keys cannot be directly provided to potentially untrusted servers. Moreover, if the remote server cannot be fully trusted, protocol correctness become essential. Therefore, solutions that do not address all three dimensions are incomplete and insecure.
Mode-splitting for highly detailed, interactive liquid simulation
Authors: H. Cords
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

This work introduces a new technique for highly detailed, interactive liquid simulations. Similar to the mode-splitting method (used e.g. in oceanography), we separate the simulation of the low-frequency liquid flow and the high-frequency free surface waves. Hence, the performance for highly detailed liquid simulations can be increased immensely. Thereby, we use the 2D wave equation for surface simulation and the 3D Navier-Stokes equations for describing the liquid flow. Thus, the surface as well as the liquid flow are simulated physically-based, resulting in highly detailed and fully interactive liquid simulations: The liquid flows according to gravity, ground, obstacles and interactions, and the surface interacts with impacts, moving obstacles or simulates the propagation of highly detailed surface waves. Our method obtains realistic results at high framerates. Therefore, it is very suitable for today's video games, VR-Environments or medical simulators.
Computer Analysis of Time-Varying Images
Authors: W. E. Snyder
Venue: Computer (1981)

Only a few years ago, even the simplest image processing operations strained state-of-the-art computers to their limits. 128 x 128 arrays took a lot of memory, and even the most trivial operations required enormous amounts of time. Then, with faster computers and cheaper memory, the technology finally began to catch up. Today, image operations are still time consuming, but it is no longer unthinkable to process 512 x 512 images. Now, imaging sensors are becoming an increasingly important part of closed-loop controllers in robotics, missile guidance, the automatic tracking of moving objects, and other intelligent systems. However, these applications require real-time processing of image sequences, and once again, the demands of image processing are pushing the available technology to its limits.
A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System
Authors: S. H. Bokhari
Venue: IEEE Transactions on Software Engineering (1981)

The problem of optimally assigning the modules of a program over the processors of an inhomogeneous distributed processor system is analyzed. The objective is to assign modules, wherever possible, to the processors on which they execute most rapidly while taking into account the overhead of interprocessor communication. Factors contributing to the cost of an assignment are 1) the amount of computation required by each module, 2) the amount of data transmitted between each pair of modules, 3) the speed of each processor, and 4) the speed of the communication link between each pair of processors.
Mapping the Space of API Design Decisions
Authors: Jeffrey Stylos, Brad Myers
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

When creating new application programming interfaces (APIs), designers must make many decisions. These decisions affect the quality of the resulting APIs in terms of performance (such as speed and memory usage), power (expressiveness, extensibility and evolvability) and usability (learnability, productivity and error prevention). Experienced API designers have written recommendations on how to design APIs, offering their opinions on various API design decisions. Additionally, empirical research has begun to measure the usability tradeoffs of specific design decisions. While previous work has offered specific suggestions, there has not been a clear description of the design space of all possible API design decisions, or the quality attributes that these decisions affect. This paper puts existing API design recommendations into context by mapping out the space of API design decisions and API quality attributes.