ppxscal/embedding_network huggingface dataset:
Education: Visualizing and animating the winged-edge data structure
Authors: Bryan Neperud, John Lowther, Ching-Kuang Shene
Venue: Computers and Graphics (2007)

The winged- and half-edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory course to computer graphics usually have difficulty in handling these data structures and developing applications. This paper describes the authors' effort in the development of a visualization and animation tool for teaching and learning these data structures. This tool also includes a simple pseudo-code-like language for algorithm design. Instructors may employ this tool for presentation and demonstration purposes. Students may use the simple language to develop and experiment with new algorithms before their actual implementation. The visualization and animation system may be used to explore and understand the relationship among mesh elements and algorithm execution.
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
Authors: Li Gao, Grzegorz Malewicz
Venue: Theory of Computing Systems (2007)

This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server that coordinates the computation of a massive number of unreliable workers. Any worker computes correctly with probability p < 1. Any incorrectly computed task corrupts all dependent tasks. The goal is to determine which tasks should be computed by the (reliable) server and which by the (unreliable) workers, and when, so as to maximize the expected number of correct results, under a constraint d on the computation time. This problem is motivated by distributed computing applications that persist partial results of computations for future use in other computations and that want to ensure that the persisted results are of high quality. We show that this optimization problem is NP-hard. Then we study optimal scheduling solutions for the mesh with the tightest deadline. We present combinatorial arguments that describe all optimal solutions for two ranges of values of worker reliability p, when p is close to zero and when p is close to one.
An Identity-Based Encryption Scheme for Broadcasting
Authors: Geng Yang, Jiangtao Wang, Hongbing Cheng, Chunming Rong
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

It is a challenge to find out suitable cryptography for wireless sensor networks (WSN) due to limitations of power, computation capability and storage resources. Many schemes based on public or symmetric key cryptography are investigated. We propose an identity-based broadcast encryption scheme, which can be used for key distribution or directly broadcasting message. The scheme is also suitable for general kind of networks. We review first identity-based encryption (IBE) and decryption, particularly, the Boneh-Franklin (BF) algorithm. Then we describe a key agreement and encryption scheme based on the Boneh-Franklin algorithms. We discuss the efficiency and security of our scheme by comparing with traditional public key technique and symmetric key technique.
The Effects of the Microelectronics Revolution on Systems and Board Test
Authors: E. Foley
Venue: Computer (1979)

Increasing device complexity has brought increased responsibility both for test engineers and design engineers: design engineers must create testable designs; test engineers must report testability problems back to the designers. 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
A Signal-Dependent Error Arising in Digitally Processed Images Due to Quantization
Authors: W. H. Carter
Venue: IEEE Transactions on Computers (1972)

A troublesome error has been found in digital data which represents an image renormalized by a computer. The error, which takes the form of anomalous patterns in the switching sequence of certain bits, contributes unnecessary, signal-dependent noise to the-data. Experimental results illustrating this phenomenon are shown and a theoretical model is derived. The model shows that the phenomenon results from a qtiantization or roundoff error inherent in digital renormalization and describes its detailed behavior. A method for rescaling the data which does not lead to the introduction of noise is described.
Modelling the dynamics of stochastic local search on k-sat
Authors: Nicolas G. Fournier
Venue: Journal of Heuristics (2007)

A new analytical tool is presented to provide a better understanding of the search space of k-sat. This tool, termed the local value distribution , describes the probability of finding assignments of any value q¿ in the neighbourhood of assignments of value q. The local value distribution is then used to define a Markov model to model the dynamics of a corresponding stochastic local search algorithm for k-sat. The model is evaluated by comparing the predicted algorithm dynamics to experimental results. In most cases the fit of the model to the experimental results is very good, but limitations are also recognised.
Digital television, personal video recorders and convergence in the Australian home
Authors: Graham Mann, Indulis Bernsteins
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Out of the confusion of delivery technologies for domestic digital video, the function of a Personal Video Recorder (PVR) that has a content management system based on an electronic program guide emerges as a key component of a home entertainment system. Serving as a content manager for video broadcasts for free-to-air and pay-TV, PVRs can automatically record, sort, schedule, store and integrate video material from different sources in a convenient, easy-to-use and timely fashion. Devices with PVR functionality are still not yet in widespread use in Australian homes, but are the increasing subject of pioneering commercial enterprise, innovative experimentation and open-source community development. The concept of a MADE system is introduced as a system with converged functionality for Media, Automation, Data, and Entertainment. This paper describes and compares three systems with PVR functionality and evaluates their current and future roles as a component for MADE systems in Australia: the TiVo appliance, the MythTV open source software for Linux; and a Topfield set top box using IceGuide. The drivers for and threats to the convergence of functionality towards a MADE system are also considered.
Mapping Query to Semantic Concepts: Leveraging Semantic Indices for Automatic and Interactive Video Retrieval
Authors: Dong Wang, Zhikun Wang, Xirong Li, Xiaobing Liu, Jianmin Li, Bo Zhang
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Quite recently, a few hundreds of semantic concepts are detected automatically with varied performance and subsequently, a new video retrieval paradigm of query-byconcept emerges. In this paper, we consider the problem of exploiting the potential of learned semantics concepts, together with the combination of traditional methods, for automatic and interactive retrieval. We argue that it is important, in both automatic and interactive retrieval scenarios, to find a few relevant concepts to search with, given a multimedia query. For automatic retrieval, we show that both text and image inputs are useful for solving this query-concept- mapping (QUCOM) problem. For interactive retrieval, searching with relevant concepts plus conventional feedback methods is quite effective and is robust to initial search results. Experimental evidence on the search task of TRECVID 2006 shows that by solving QUCOM with a large lexicon of 311 semantic concept detectors, the automatic retrieval performance increases 20% and the interactive retrieval performance has the potential to outperform the state-of-the-art systems.
An automated approach for the optimization of pixel-based visualizations
Authors: Jörn Schneidewind, Mike Sips, Daniel A. Keim
Venue: Information Visualization (2007)

During the last two decades, a wide variety of advanced methods for the visual exploration of large data sets have been proposed. For most of these techniques user interaction has become a crucial element, since there are many situations in which users or analysts have to select the right parameter settings from among many in order to construct insightful visualizations. The right choice of input parameters is essential, since suboptimal parameter settings or the investigation of irrelevant data dimensions make the exploration process more time consuming and may result in wrong conclusions. But finding the right parameters is often a tedious process and it becomes almost impossible for an analyst to find an optimal parameter setting manually because of the volume and complexity of today's data sets. Therefore, we propose a novel approach for automatically determining meaningful parameter- and attribute settings based on the combined analysis of the data space and the resulting visualizations with respect to a given task. Our technique automatically analyzes pixel images resulting from visualizations created from diverse parameter mappings and ranks them according to the potential value for the user. This allows a more effective and more efficient visual data analysis process, since the attribute/parameter space is reduced to meaningful selections and thus the analyst obtains faster insight into the data. Real-world applications are provided to show the benefit of the proposed approach.
Structure and parameter learning of neuro-fuzzy systems: A methodology and a comparative study
Authors: Rui Pedro Paiva, António Dourado
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

A methodology and experimental comparison of neuro-fuzzy structures, namely linguistic and zero and first-order Takagi-Sugeno, are developed. The implementation of the model is conducted through the training of a neuro-fuzzy network, i.e., a neural net architecture capable of representing a fuzzy system. In the first phase, the structure of the model is obtained by subtractive clustering, which allows the extraction of a set of relevant rules based on a set of representative input-output data samples. Membership functions with two-sided Gaussian functions are proposed and discussed. In the second phase, the model parameters are tuned via the training of a neural network. Furthermore, different fuzzy operators are compared, as well as regular and two-sided Gaussian functions.
Two Phase Parallel Particle Swarm Algorithm Based on Regional and Social Study of Object Optimization
Authors: Qihong Liu, Tiande Li, Changjie Tang, Qiwei Liu, Jun Zhu, Xinxin Ding, Jiang Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper proposed a new Two Phase Parallel Particle Swarm Optimization(TP_PPSO) Algorithm based on region and social study of multi-object optimization in economic data analysis and mining. This study(1)changes the traditional particle information sharing mechanism and introduces region study for making that particles can reference other particles information when they updates; and divides particles groups evolution into two classes optimization by the advantage of divided-group strategy .(2)partitions particles swarm evolution into two phase. One phase is propitious to expand the scope of the search and another phase is conducive to the fine overall search. (3)proposes an disturbance strategy Which the best particles in each particles swarm will be initialized in locally around and other particles will initialized in the overall scope, when the un-updated population of global optimal solution is bigger than certain population. (4)proves the convergence of PSO and convergence condition and the rationality of TP_PPSO. (5)demonstrates that of TP_PPSO has improved the accuracy of the solution 60% at least than the classical parallel particles swarm algorithm -- IPPSO by optimization and contrastive experiments using five functions.
Encryption: Security Considerations for Portable Media Devices
Authors: Faith M. Heikkila
Venue: IEEE Security and Privacy (2007)

With the proliferation of removable media devices, such as iPods and USB drives, large amounts of an organization's sensitive data can easily be removed. The author explores the complexities of protecting networks against removable media, including guidelines for purchasing encryption software.
A Comparison of Presentation Methods for Reading on Mobile Phones
Authors: Björn Hedin, Erik Lindgren
Venue: IEEE Distributed Systems Online (2007)

A study compares two methods of reading text-based content on mobile phones: traditional scroll-based reading and Rapid Serial Visual Presentation, which displays words rapidly in a sequence. University students used a prototype called Feedo to test both methods, and their reading comprehension, efficiency, and preference ratings were measured. The results show that efficiency increases with fast RSVP, comprehension is equal, and preference rating is lower than with self-paced scroll.
Nonspecificity for infinite random sets of indexable type
Authors: Diego A. Alvarez
Venue: Fuzzy Sets and Systems (2008)

In this document the Hartley-like-based measure of nonspecificity for finite random sets is extended to infinite random sets of indexable type. In the course of the paper, concepts defined in the realm of Dempster-Shafer evidence theory, like joint and marginal random sets and random set inclusion are also generalized. It is shown that the proposed measure is the unique one that fulfills a set of characterizing properties, and in addition corresponds to the one defined in the field of evidence theory when particularized to finite random sets.
Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers
Authors: Gordon Fraser, Franz Wotawa
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Nondeterminism is used as a means of underspecification or implementation choice in specifications, and it is often necessary if part of a system or the environment is unpredictable. The use of model-checker counterexamples as test-cases is a popular technique in model-based testing. Even though model-checkers can handle nondeterministic models for verification purposes, the use of nondeterministic models for test-case generation is not directly possible. A counterexample is an example execution path where alternative paths might also be valid. Consequently, testing could falsely identify correct implementations as erroneous. This paper describes how to use model-checkers to derive test-cases from nondeterministic models by applying postprocessing to the counterexamples. The influence of nondeterminism on coverage measurement with model-checkers is analyzed, and known coverage criteria are adapted. This is useful for the execution of test-cases on nondeterministic systems, where special treatment is necessary.
Efficiently monitoring data-flow test coverage
Authors: Raul Santelices, Mary Jean Harrold
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Structural testing of software requires monitoring the software's execution to determine which program entities are executed by a test suite. Such monitoring can add considerable overhead to the execution of the program, adversely affecting the cost of running a test suite. Thus, minimizing the necessary monitoring activity lets testers reduce testing time or execute more test cases. A basic testing strategy is to cover all statements or branches but a more effective strategy is to cover all definition-use associations (DUAs). In this paper, we present a novel technique to efficiently monitor DUAs, based on branch monitoring. We show how to infer from branch coverage the coverage of many DUAs, while remaining DUAs are predicted with high accuracy by the same information. Based on this analysis, testers can choose branch monitoring to approximate DUA coverage or instrument directly for DUA monitoring, which is precise but more expensive. In this paper, we also present a tool, called DUA-Forensics, that we implemented for this technique along with a set of empirical studies that we performed using the tool
Beyond MPLS ... Less is More
Authors: Chris Metz, Colby Barth, Clarence Filsfils
Venue: IEEE Internet Computing (2007)

Multiprotocol Label Switching possesses a simple data-plane that has enabled new services and functions operating in many service provider networks. Yet,the MPLS control plane can impose both technical and operational challenges. This article explores these challenges and examines recent advances in IP routing technology suggesting that all services—including those that are MPLS-based—can be delivered over networks running only IP.
An algorithmic approach to resolutions
Authors: Edward L. Green, Øyvind Solberg
Venue: Journal of Symbolic Computation (2007)

We provide an algorithmic method for constructing projective resolutions of modules over quotients of path algebras. This algorithm is modified to construct minimal projective resolutions of linear modules over Koszul algebras.
S-MOJOHON: Towards a semantic architecture for message exchanging
Authors: Daniel Correa Lobato, Renato de Freitas Bulcao Neto, Matheus Qualio Barbosa, Maria da Graca Pimentel, Cesar Augusto Teixeira
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents our efforts on adding semantic information to our MOJOHON architecture creating SMOJOHON -- Semantic, Modular, Java-oriented and Hostile NAT-proof -- middleware for message exchanging. We developed S-MOJOHON aiming at allowing the communication among two or more instances of a distributed application while maintaining a high level of abstraction with respect to the communication facilities available and exploiting context information provided by an ontology. In our proof-of-concept implementation, we use S-MOJOHON to select a rendezvous point for a multimedia flow using information about which autonomous systems it belongs to and its uptime. We represent these information using an ontology developed by us, which produces RDF documents that are handled by a semantic web framework and a reasoning engine. In preliminary tests, S-MOJOHON were able to successfully select the best rendezvous point considering information provided by the knowledge base.
Bridging the application and DBMS profiling divide for database application developers
Authors: Surajit Chaudhuri, Vivek Narasayya, Manoj Syamala
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In today's world, tools for profiling and tuning application code remain disconnected from the profiling and tuning tools for relational DBMSs. This makes it challenging for developers of database applications to profile, tune and debug their applications, for example, identifying application code that causes deadlocks in the server. We have developed an infrastructure that simultaneously captures both the application context as well as the database context, thereby enabling a rich class of tuning, profiling and debugging tasks that is not possible today. We have built a tool using this infrastructure that enables developers to seamlessly profile, tune and debug ADO.NET applications over Microsoft SQL Server by taking advantage of information across the application and database contexts. We describe and evaluate several tasks that can be accomplished using this tool.
Discovering Network Topology of Large Multisubnet Ethernet Networks
Authors: Hassan Gobjuka, Yuri Breitbart
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we investigate the problem of finding the physical layer network topology of large, heterogeneous multisubnet Ethernet networks that may include uncooperative network elements. Our approach utilizes only generic MIB information [20] and does not require any hardware or software modifications of the underlying network elements. We propose here the first O(n3) algorithm that guarantees discovering a topology that is compatible with the given set of input MIBs, provided that the input is complete. We prove the correctness of the algorithms and the necessary and sufficient conditions for the uniqueness of the restored topology. Finally, we demonstrate the application of the algorithm on several examples.
Two Symmetrical Decomposition Methods for Structure-complex Petri Nets and Their Applications
Authors: Qingtian Zeng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In order to overcome the difficulties in analyzing complex physical systems with Petri nets, two new decomposition methods for structure-complex Petri net are presented based on an index function defined on the place and transition set respectively. The decomposition method based on the indexes of places is suitable for analyzing the behavior synchronization between systems, with which a structure-complex Petri net is decomposed into a set of S-Nets. The decomposition method based on the indexes of transitions is suitable for analyzing the resource sharing between systems, with which a structure-complex Petri net is decomposed into a set of T-Nets. The relationships between the decomposition structure-simple subnets and the original structure-complex systems are proved, and the properties of the original system can be analyzed based on the structure-simple S-Nets or T-Nets.
Greedy Algorithm Solution to Agent Coalition for Single Task
Authors: Jianguo Jiang, Yong Li, Na Xia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Coalition is an important cooperative method in multiagent system (MAS). It is a complicated combinatorial optimization problem to search for the optimal, task-oriented Agent coalition. A greedy algorithm is presented since no any greedy algorithm has been adopted in this problem so far. The greedy criterion is that the more ability and the less cost brought to a coalition by an agent, the better the agent is. Two expressions of the greedy criterion have been studied. The results of contrastive experiments show that this algorithm is effective.
FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control
Authors: N. Viswanathan, Min Pan, C. Chu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, we present FastPlace 3.0 - an efficient and scalable multilevel quadratic placement algorithm for large-scale mixed-size designs. The main contributions of our work are: (1) A multilevel global placement framework, by incorporating a two-level clustering scheme within the flat analytical placer FastPlace (Viswanathan and Chu, 2005) and Viswanathan et al., 2006), (2) An efficient and improved iterative local refinement technique that can handle placement blockages and placement congestion constraints. (3) A congestion aware standard-cell legalization technique in the presence of blockages. On the ISPD-2005 placement benchmarks (Nam et al., 2005), our algorithm is 5.12times, 11.52times and 16.92times faster than mPL6, Capo10.2 and APlace2.0 respectively. In terms of wirelength, we are on average, 2% higher as compared to mPL6 and 9% and 3% better as compared to Capo10.2 and APlace2.0 respectively. We also achieve competitive results compared to a number of academic placers on the placement congestion constrained ISPD-2006 placement benchmarks (Nam, 2006).