ppxscal/embedding_network huggingface dataset:
Quotient Networks
Authors: J. P. Fishburn
Venue: IEEE Transactions on Computers (1982)

A large-network algorithm solves a problem of size N on a network of N processors. We present a method for transforming certain large networks into quotient networks that emulate those large networks with fewer processors. Large-network algorithms are easily modified to execute on the quotient network. The emulations result in no loss in execution efficiency. Quotient networks allow algorithms to be designed assuming any number of processors and executed efficiently at a great savings in hardware cost.
A Data Mining Approach to Reading Order Detection
Authors: M. Ceci, M. Berardi, G. Porcelli, D. Malerba
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Determining the reading order for layout components ex- tracted from a document image can be a crucial problem for several applications. It enables the reconstruction of a single textual element from texts associated to multiple layout components and makes both information extraction and content-based retrieval of documents more effective. A common aspect for all methods reported in the literature is that they strongly depend on the specific domain and are scarcely reusable when the classes of documents or the task at hand changes. In this paper, we investigate the prob- lem of detecting the reading order of layout components by resorting to a data mining approach which acquires the do- main specific knowledge from a set of training examples. The input of the learning method is the description of the "chains" of layout components defined by the user. Only spatial information is exploited to describe a chain, thus making the proposed approach also applicable to the cases in which no text can be associated to a layout component. The method induces a probabilistic classifier based on the Bayesian framework which is used for reconstructing either single or multiple chains of layout components. It has been evaluated on a set of document images.
Space-Time Codes Based on Bit-Interleaved Quasi-Super-Orthogonal Designs
Authors: Li Zhengquan, Pan Libing
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

We introduce in this paper a new kind of space-time codes. The new codes can exist for 2,3,4 transmit antennas of rate 1,and exist for 5,6,7,8 transmit antennas of rate 3/4, and for any number transmit antennas of rate 1/2. At the same time the new codes can provide full diversity and high coding gain.
Confidentiality-preserving rank-ordered search
Authors: Ashwin Swaminathan, Yinian Mao, Guan-Ming Su, Hongmei Gou, Avinash L. Varna, Shan He, Min Wu, Douglas W. Oard
Venue: Proceedings of the 2007 ACM workshop on Storage security and survivability (2007)

This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.
Model-Driven Engineering for Requirements Analysis
Authors: Benoit Baudry, Clementine Nebut, Yves Le Traon
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Requirements engineering (RE) encompasses a set of activities for eliciting, modelling, agreeing, communicat- ing and validating requirements that precisely define the problem domain for a software system. Several tools and methods exist to perform each of these activities, but they mainly remain separate, making it difficult to capture the global consistency of large requirement documents. In this paper we introduce model-driven engineering (MDE) as a possible technical solution to integrate these activities in a common framework. First, we dicuss how RE can lever- age the two main techniques for MDE: metamodelling and model transformation. Then, we introduce a metamodel for requirements and present how we have implemented this metamodel to make it executable and usable through a con- strained natural language for requirements definition.
Design and Implementation of Security Structure for Interactive Web Environment
Authors: Kyong Ho Choi, Dong Hwi Lee, Kuinam J. Kim
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In the rapid development of Information Technology, today's internet environment has been changing dynamically including various technologies and services while reinforcing the interaction between web and users more than before. But in the change of this web service environment, the matter of security of common web application can happen: Moreover, additional matters of security are to happen in the process to draw the applications to the web platform which makes it possible to execute them anywhere in order to provide the dynamic service reinforced with its interaction, which has become a serious threat to the information security. Therefore, this study suggested the security structure applicable in the interaction-reinforced web environment while designing and inspecting Vicious Attack Detection System which detects the aggressive contents by using Whitebox Approach, Real-time Web Traffic Monitoring, and Deep Packet Inspection.
Panorama maps with non-linear ray tracing
Authors: Martin Falk, Tobias Schafhitzel, Daniel Weiskopf, Thomas Ertl
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We present a framework for the interactive generation of 3D panorama maps. Our approach addresses the main issue that occurs during panorama map construction: non-linear projection or deformation of the terrain in order to minimize the occlusion of important information such as roads and trails. Traditionally, panorama maps are hand-drawn by skilled illustrators. In contrast, our approach provides computer support for the rendering of non-occluded views of 3D panorama maps, where deformations are modeled by nonlinear ray tracing. The deflection of rays is influenced by 2D and 3D force fields that directly consider the shape of the terrain. In addition, our framework allows the user to further modify the force fields to have fine control over the deformations of the panorama map. User interaction is facilitated by our real-time rendering system in terms of linked multiple views of both linear and non-linear projected terrain and the deformed view rays. Fast rendering is achieved by GPU-based non-linear ray tracing. We demonstrate the usefulness of our modeling and visualization method by several examples.
COMET: A Collaborative Tutoring System for Medical Problem-Based Learning
Authors: Siriwan Suebnukarn, Peter Haddawy
Venue: IEEE Intelligent Systems (2007)

The Collaborative Medical Tutor (COMET) is an intelligent tutoring system for medical problem-based learning (PBL). COMET emulates live human-tutored medical PBL sessions as much as possible while also letting students participate collaboratively from disparate locations. COMET uses Bayesian networks to model both individual and group student knowledge and activity. Generic domain-independent tutoring algorithms use these student and group models to generate tutoring hints. COMET incorporates a multimodal interface that integrates text and graphics in a rich communication channel between the students and the system and among students in the group. A comparison of learning outcomes shows that students using the COMET system achieved significantly higher clinical-reasoning gains than students in human-tutored sessions. This article is part of a special issue on intelligent educational systems.
Scalable on-demand streaming of nonlinear media
Authors: Yanping Zhao, Derek L. Eager, Mary K. Vernon
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

A conventional video file contains a single temporally-ordered sequence of video frames. Clients requesting on-demand streaming of such a file receive (all or intervals of) the same content. For popular files that receive many requests during a file playback time, scalable streaming protocols based on multicast or broadcast have been devised. Such protocols require server and network bandwidth that grow much slower than linearly with the file request rate. This paper considers "nonlinear" video content in which there are parallel sequences of frames. Clients dynamically select which branch of the video they wish to follow, sufficiently ahead of each branch point so as to allow the video to be delivered without jitter. An example might be "choose-your-own-ending" movies. With traditional scalable delivery architectures such as movie theaters or TV broadcasting, such personalization of the delivered video content is very difficult or impossible. It becomes feasible, in principle at least, when the video is streamed to individual clients over a network. For on-demand streaming of nonlinear media, this paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols.
Programmable Scan-Based Logic Built-In Self Test
Authors: Liyang Lai, Wu-Tung Cheng, Thomas Rinderknecht
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper presents a programmable approach for performing scan-based logic Built-In Self Test. This approach combines the techniques of reseeding and weighted random patterns testing. Reseeding is used to encode the bias cube and weighted patterns are used to fine tune the weight set. Experimental results show fault coverage comparable to ATPG can be achieved. Most importantly, the scheme fits well in the system test environment and high fault coverage can be obtained with a small number of reconfigurations on the BIST controller.
Promoting Insight-Based Evaluation of Visualizations: From Contest to Benchmark Repository
Authors: Catherine Plaisant, Jean-Daniel Fekete, Georges Grinstein
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Information Visualization (InfoVis) is now an accepted and growing field but questions remain about the best uses for and the maturity of novel visualizations. Usability studies and controlled experiments are helpful but generalization is difficult. We believe that the systematic development of benchmarks will facilitate the comparison of techniques and help identify their strengths under different conditions. We were involved in the organization and management of three information visualization contests for the 2003, 2004 and 2005 IEEE Information Visualization Symposia, which requested teams to report on insights gained while exploring data. We give a summary of the state of the art of evaluation in information visualization, describe the three contests, summarize their results, discuss outcomes and lessons learned, and conjecture the future of visualization contests. All materials produced by the contests are archived in the Information Visualization Benchmark Repository.
Online NoC Switch Fault Detection and Diagnosis Using a High Level Fault Model
Authors: Armin Alaghi, Naghmeh Karimi, Mahshid Sedghi, Zainalabedin Navabi
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

This paper presents an efficient method for online testing of NoC switches. This method deals with control faults of NoC switches; i.e. the routing faults which cause NoC packets to be sent to output ports not intended to. A high level fault model has been proposed in this paper to model switch routing faults. The proposed method is evaluated by fault simulation that is based on our high-level fault model. This simulation and evaluation environment is modeled at the transaction level in VHDL.
New Products
Authors: D. A. Michalopoulos
Venue: Computer (1977)

The new 26-pound HP 9831A desktop computer can be used as a stand-alone, Basic-language computer or linked with peripherals to form systems, according to its manufacturer, Hewlett-Packard.
VSWS: The Variable-Interval Sampled Working Set Policy
Authors: D. Ferrari
Venue: IEEE Transactions on Software Engineering (1983)

A local variable-size memory policy called the variable-interval sampled working set (VSWS) policy is described. The results of trace-driven simulation experiments reported here show that VSWS has a static performance comparable to those of the working set (WS) and sampled working set (SWS) policies, a dynamic performance better than those of WS, SWS, and the page fault frequency (PFF) policy, and similar to that of the damped working set (DWS) policy. Furthermore, VSWS generaly causes substantially less process suspensions than SWS, and is less expensive to implement than WS or DWS, since it requires the same hardware support as SWS and PFF. The sampling overhead of VSWS is comparable to that of SWS and lower than that of PFF.
An Improved Particle Swarm Algorithm for Solving Nonlinear Constrained Optimization Problems
Authors: Jinhua Zheng, Qian Wu, Wu Song
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper proposes an improved particle swarm optimization algorithm(IPSO). IPSO adopts a new mutation operator and a new method that congregates some neighboring individuals to form multiple subpopulations in order to lead particles to explore new search space. Additionally, our algorithm incorporates a mechanism with a simple and easy penalty function to handle constraint. Thus, our algorithm has strong global exploratory capability and efficiency while being applied to solve nonlinear constrained optimization problems. Experimental results indicate that our IPSO is robust and efficient in solving nonlinear constrained optimization problems
Design of Diagnosable Sequential Machines Utilizing Extra Outputs
Authors: H. Fujiwara
Venue: IEEE Transactions on Computers (1974)

This paper is concerned with the problem of designing easily testable sequential machines, output-observable machines, for which there exist very short checking experiments. A sequential machine for which any initial state can be uniquely determined only by the output response is said to be output-observable. An algorithm is developed to modify a given machine to an output-observable one by adding a minimum number of extra outputs. This method is based on the fact that the output-observable realization of a given machine M exists if and only if M is semi-FSR realizable (a special type of feedback shift register realization).
Engineering change using spare cells with constant insertion
Authors: Yu-Min Kuo, Ya-Ting Chang, Shih-Chieh Chang, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In the VLSI design process, a design implementation often needs to be corrected because of new specifications or design constraint violations. This correction process is referred to as engineering change (EC). Usually, an EC problem is resolved by using spare cells, which have been inserted into the unused spaces of a chip. In this paper, we propose an iterative method to generate feasible mapping solutions for an EC problem considering spare cells whose inputs may be tied to Vdd or Gnd, called constant insertion. Applying constant insertion can increase a cell's flexibility in aspect of functionalities, so far-away spare cells need not be used just for some specific functionality. Our experimental results show that the area in which there are enough spare cells for a mapping solution with constant insertion is only 82% of the area without constant insertion.
Proceedings of the 2007 ACM workshop on Computer security architecture
Venue: Conference on Computer and Communications Security (2007)

It is our great pleasure to welcome you to the First ACM Computer Security Architectures Workshop, held in association with the 14th ACM Computer and Communications Security Conference, November 2nd in Fairfax, Virginia (USA). The call for papers attracted 30 submissions from Asia, Australia, Canada, Europe, South America, and the United States--with authors from 14 different countries. The program committee accepted 9 papers that cover a variety of topics, including side channel attacks, cryptography and authorization systems, authentication, novel authorization systems. We are especially pleased to have a keynote speech by Professor Daniel J. Bernstein on Some Thoughts on Security After 10 Years of qmail 1.0. Qmail is in use at some two million sites, and its architecture is both novel and very efficient; for over 10 years now Professor Bernstein has offered a reward--as yet uncollected--for anyone who can find a security hole in qmail. We also are planning on having a panel on Distributed Authentication, the details of which are not available at press time. We hope that these proceedings will serve as a valuable reference for security researchers and developers. The workshop was created because the design and evaluation of Security Architectures is of fundamental importance to security. And yet, as far as we know, this workshop is unique in its focus on Security Architectures. We hope that this workshop will help to crystallize work in Security Architectures.
MARTE: Technology development and lessons learned from a Mars drilling mission simulation: Field Reports
Authors: Howard N. Cannon, Carol R. Stoker, Stephen E. Dunagan, Kiel Davis, Javier Gómez-Elvira, Brian J. Glass, Lawrence G. Lemke, David Miller, Rosalba Bonaccorsi, Mark Branson, Scott Christa, José Antonio Rodríguez-Manfredi, Erik Mumm, Gale Paulsen, Matt Roman, Alois Winterholler, Jhony R. Zavaleta
Venue: Journal of Field Robotics (2007)

The NASA Mars Astrobiology Research and Technology Experiment (MARTE) performed a field test simulating a robotic drilling mission on Mars in September 2005. The experiment took place in Minas de Riotinto in southwestern Spain, a highly relevant Mars analog site. The experiment utilized a 10 m class dry auger coring drill, a robotic core sample handling system, onboard science and life detection instruments, and a borehole inspection probe, all of which were mounted to a simulated lander platform. Much of the operation of the system was automated, and the resulting data were transmitted via satellite to remote science teams for analysis. The science team used the data to characterize the subsurface geology and to search for signs of life. Based on the data being received and operational constraints, the science team also directed the daily operation of the equipment. The experiment was highly successful, with the drill reaching over 6 m in depth in 23 days of simulated mission. The science team analyzed remote sensing data obtained from 28 cores and detected biosignatures in 12 core subsamples. This experiment represents an important first step in understanding the technology and operational requirements for a future Mars drilling mission. In the past there have been numerous rover field tests that have helped guide the design and implementation of the highly successful rover missions to Mars. However, a drilling mission potentially adds a new level of complexity, and it is important to understand the associated challenges. This paper documents the design of the experimental system, highlighting some of the more important design criteria and design trades. It also discusses the results of the field testing and lists some of the key technological lessons learned. &copy; 2007 Wiley Periodicals, Inc.
Logal: a CHDL for Logic Design and Synthesis of Computers
Authors: J. H. Stewart
Venue: Computer (1977)

A computer hardware description language can be a practical and economical tool for driving a comprehensive automated design facility for a large-scale computer environment. The logic designer must optimize many conflicting requirements, including the following: 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
Automatic Performance Evaluation of Palmprint Recognition
Authors: Zhenyu Qi, Jing Xu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

This paper is concerned with the performance evaluation of palmprint recognition systems. We have designed and implemented an automatic system for performance evaluation (ASPE), which adopts the process kernel of palm recognition. We have also proposed a performance evaluation method based on minutiae, which are essentially terminations and bifurcations of the ridge lines that constitute a palmprint pattern. In this paper we define two evaluation indexes: recall and accuracy. The system can display the minutia in the image directly and output the two rates in the EXCEL form. The test result of speed and precise shows that automatic evaluation outperforms manual evaluation dramatically both in terms of efficiency and robustness.
Technology challenges in a data warehouse
Authors: Ramesh Bhashyam
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

This presentation will discuss several database technology challenges that are faced when building a data warehouse. It will touch on the challenges posed by high capacity drives and the mechanisms in Teradata DBMS to address that. It will consider the features and capabilities required of a database in a mixed application environment of a warehouse and some solutions to address that.
A long reach digital subscriber loop transceiver
Authors: P. F. Adams, S. A. Cox, R. B. Carpenter, N. G. Cole
Venue: BT Technology Journal (2007)

An echo-cancelling duplex transmission system is described for the digital subscriber loop which uses a 4-level zero redundancy line code (2B1Q) to give very long reach in the presence of crosstalk. Novel digital signal processing algorithms are used to simplify the analogue line interface circuitry. All the digital signal processing, along with sophisticated maintenance and interfacing circuitry, can be contained on a single LSI circuit. Measured performance results are presented.