ppxscal/embedding_network huggingface dataset:
Molecular surfaces on proteins via beta shapes
Authors: Joonghyun Ryu, Rhohun Park, Deok-Soo Kim
Venue: Computer-Aided Design (2007)

A protein consists of linearly combined amino acids via peptide bonds, and an amino acid consists of atoms. It is known that the geometric structure of a protein is the primary factor which determines the functions of the protein. Given the atomic complex of a protein, one of the most important geometric structures of a protein is its molecular surface since this distinguishes between the interior and exterior of the protein and plays an important role in protein folding, docking, interactions between proteins, and other functions. This paper presents an algorithm for the precise and efficient computation of the molecular surface of a protein, using a recently proposed geometric construct called the @b-shape based on the Voronoi diagram of atoms in a protein. Given a Voronoi diagram of atoms, based on the Euclidean distance from the atom surfaces, the proposed algorithm first computes the @b-shape with an appropriate sized probe. Then, the molecular surface is computed by employing a blending operation on the atomic complex of the protein. In this paper, it is also shown that for a given Voronoi diagram of atoms, the multiple molecular surfaces can be computed by using various sized probes.
Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs
Authors: Xianghua Deng, Robby, John Hatcliff
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Recent work has demonstrated that symbolic execution techniques can serve as a basis for formal analysis capable of automatically checking heap-manipulating software components against strong interface specifications. In this paper, we present an enhancement to existing symbolic execution algorithms for object-oriented programs that significantly improves upon the algorithms currently implemented in Bogor/Kiasan and JPF. To motivate and justify the new strategy for handling heap data in our enhanced approach, we present a significant empirical study of the performance of related algorithms and an interesting case counting analysis of the heap shapes that can appear in several widely used Java data structure packages.
A Computational Algorithm for Solving a System of Coupled Algebraic Matrix Riccati Equations
Authors: A. I. A. Salama
Venue: IEEE Transactions on Computers (1974)

A computational algorithm for solving a system of coupled matrix algebraic equations is presented in this paper. Such equations arise in optimal control problems of linear systems with jump parameters.
Range Image Feature Extraction with Varying Degrees of Data Irregularity
Authors: Shanmugalingam Suganthan, Sonya Coleman, Bryan Scotney
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

The use of range images has become prominent in the field of computer vision. Due to the irregular nature of range image data that occurs with a number of sensors, edge detection techniques for range images are often based on scan line data approximations and hence do not employ exact data locations. We present a finite element based approach to the development of gradient operators that can be applied to both regularly and irregularly distributed range images. We have created synthetic irregularly distributed range images for each edge type, and the gradient operators developed are evaluated with respect to their performance in edge detection across varying levels of data irregularity.
Review and Revocation of Access Privileges Distributed Through Capabilities
Authors: V. D. Gligor
Venue: IEEE Transactions on Software Engineering (1979)

The problems of review and revocation of access privileges are presented in the context of the systems that use capabilities for the long-term distribution of access privileges. An approach that solves both of these problems in their-most general form is presented in this paper. The approach requires that a capability propagation graph be maintained in memory spaces associated with subjects (e.g., domains, processes, etc.) that make copies of the respective capability; the graph remains inaccessible to those subjects, however. Parallel processes of the operating system update the graph as the system runs.
Computer/Art–Depolarization and Unification
Authors: Duane Palyka
Venue: IEEE Computer Graphics and Applications (1985)

Western society tends to separate individuals into the archetypal roles of artist and scientist. With computer graphics tools, artists can integrate these roles and produce unique artwork. 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
Layout Analysis of Handwritten Historical Documents for Searching the Archive of the Cabinet of the Dutch Queen
Authors: Marius Bulacu, Rutger van Koert, Lambert Schomaker, Tijn van der Zant
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, we describe the structure and the performance of a layout analysis system developed for processing the handwritten documents contained in a large historical collection of very high importance in the Netherlands. We introduce a method based on contour tracing that generates curvilinear separation paths between text lines in order to preserve the ascenders and descenders. Our methods are relevant to research on digitization and retrieval of handwritten historical documents.
Integrating Agents and Web Services into Cooperative Design Platform of Vehicle Headlights
Authors: Tingting Fu, Peng Liu, Yigang Wang, Yehua Du
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Web-based distributed cooperative design is an important technology in the computer supported advanced manufacturing. After analyzing the advantages and drawbacks of the existing research and work, this paper presents an agent-based cooperative design platform which utilizes Web service to realize interoperability in vehicle headlights design. Compared with other strategies, we put emphases on real-time communication between designers and high speed browse of all models. Our platform also has a good compatibility with various model-design kits by adopting intelligent agents. The proposed approach provides designers with excellent human-computer interaction, more flexibility and enables distributed collaborators to cooperate efficiently. The platform can greatly shorten product development period as well as time to market.
Hybrid CEGAR: combining variable hiding and predicate abstraction
Authors: Chao Wang, Hyondeuk Kim, Aarti Gupta
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Variable hiding and predicate abstraction are two popular abstraction methods to obtain simplified models for model checking. Although both methods have been used successfully in practice, no attempt has been made to combine them in counterexample guided abstraction refinement (CEGAR). In this paper, we propose a hybrid abstraction method that allows both visible variables and predicates to take advantages of their relative strengths. We use refinement based on weakest preconditions to add new predicates, and under certain conditions trade in the predicates for visible variables in the abstract model. We also present heuristics for improving the overall performance, based on static analysis to identify useful candidates for visible variables, and use of lazy constraints to find more effective unsatisfiable cores for refinement. We have implemented the proposed hybrid CEGAR procedure. Our experiments on public benchmarks show that the new abstraction method frequently outperforms the better of the two existing abstraction methods.
Visualizing the History of Living Spaces
Authors: Yuri Ivanov, Christopher Wren, Alexander Sorokin, Ishwinder Kaur
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

The technology available to building designers now makes it possible to monitor buildings on a very large scale. Video cameras and motion sensors are commonplace in practically every office space, and are slowly making their way into living spaces. The application of such technologies, in particular video cameras, while improving security, also violates privacy. On the other hand, motion sensors, while being privacy-conscious, typically do not provide enough information for a human operator to maintain the same degree of awareness about the space that can be achieved by using video cameras. We propose a novel approach in which we use a large number of simple motion sensors and a small set of video cameras to monitor a large office space. In our system we deployed 215 motion sensors and six video cameras to monitor the 3,000-square-meter office space occupied by 80 people for a period of about one year. The main problem in operating such systems is finding a way to present this highly multidimensional data, which includes both spatial and temporal components, to a human operator to allow browsing and searching recorded data in an efficient and intuitive way. In this paper we present our experiences and the solutions that we have developed in the course of our work on the system. We consider this work to be the first step in helping designers and managers of building systems gain access to information about occupants' behavior in the context of an entire building in a way that is only minimally intrusive to the occupants' privacy.
The drm game
Authors: Gregory L. Heileman, Pramod A. Jamkhedkar, Joud Khoury, Curtis J. Hrncir
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

In this paper we cast DRM in a setting that allows us to model a number of current approaches as games. The DRM game is partitioned into two subgames, one that considers the game associated with content acquisition, and a second that considers how a consumer uses the content, along with a vendor's response to this usage. Examples are provided in order to demonstrate how these subgames correspond to real situations associated with content industries, and the conditions under which Nash equilibria will exist. These subgames form the primary stage of a repeated game that models a number of important long-term interactions between consumers and vendors. We analyze current strategies that attempt to influence the outcome of the repeated game, and we also consider a new type of architectural infrastructure that makes novel use of a trust authority in order to create a suitable environment for constructing DRM games that may prove useful in the future.
Precedence Temporal Networks to represent temporal relationships in gene expression data
Authors: Lucia Sacchi, Cristiana Larizza, Paolo Magni, Riccardo Bellazzi
Venue: Journal of Biomedical Informatics (2007)

The reconstruction of gene regulatory networks from gene expression time series is nowadays an interesting research challenge. A key problem in this kind of analysis is the automated extraction of precedence and synchronization between interesting patterns assumed by genes over time. The present work introduces Precedence Temporal Networks (PTN), a novel method to extract and visualize temporal relationships between genes. PTNs are a special kind of temporal network where nodes represent temporal patterns while edges identify precedence or synchronization relationships between the nodes. The method is tested on two case studies: the expression of a subset of genes in the soil amoeba Dictyostelium discoideum and of a set of well-studied genes involved in the human cell cycle regulation. The extracted networks reflect the capability of the algorithm to clearly reconstruct the timing of the considered gene sets, highlighting different stages in Dictyostelium development and in the cell cycle, respectively.
Microcomputers in the Computer Engineering Curriculum
Authors: J. F. Wakerly
Venue: Computer (1977)

Microcomputers are the most important new building block for electronic systems to emerge since the integrated circuit operational amplifier. It is obvious that colleges and universities should incorporate microcomputers into existing electrical and computer engineering curricula; but not surprisingly, there exists some dispute about the best way to do this. Before describing the approach at Stanford, we will discuss the philosophy upon which our curriculum is based.
Design of a Dynamic Priority-Based Fast Path Architecture for On-Chip Interconnects
Authors: Dongkook Park, Reetuparna Das, Chrysostomos Nicopoulos, Jongman Kim, N. Vijaykrishnan, Ravishankar Iyer, Chita R. Das
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

In modern multi-core System-on-Chip (SoC) architectures, the design of innovative interconnection fabrics is indispensable. The concept of the Network-on-Chip (NoC) architecture has been proposed recently to better suit this requirement. Especially, the router architecture has a significant effect on the overall performance and energy consumption of the chip. We propose a dynamic path management scheme that exploits network traffic information during switch arbitration. Consequently, flits transferred across frequently used paths are expedited by traversing a reduced router pipeline. This technique, based on pipeline bypassing, is simulated and evaluated in terms of network latency and average power consumption. Simulation results with real-world application traces show that the architecture improves the performance up to 30% while incurring only minimal area / power overhead.
Improvement in SAR Image Classification using Adaptive Stack Filters
Authors: Maria Elena Buemi, Marta Mejail, Julio Jacobo, Juliana Gambini
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Stack filters are a special case of non-linear filters. They have a good performance for filtering images with different types of noise while preserving edges and details. A stack filter decomposes an input image into several binary images according to a set of thresholds. Each binary image is filtered by a Boolean function. The Boolean function that characterizes an adaptive stack filter is optimal and is computed from a pair of images consisting of an ideal noiseless image and its noisy version. In this work the behavior of adaptive stack filters is evaluated for the classification of Synthetic Aperture Radar (SAR) images, which are affected by speckle noise. With this aim it was carried out experiment in which simulated and real images are generated and then filtered with a stack filter trained with one of them. The results of their Maximum Likelihood classification are evaluated and then are compared with the results of classifying the images without previous filtering.
Core problems in bi-criteria {0,1}-knapsack problems
Authors: Carlos Gomes da Silva, João Clímaco, José Rui Figueira
Venue: Computers and Operations Research (2008)

The most efficient algorithms for solving the single-criterion {0,1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria {0-1}-knapsack instances. Numerical experiments were performed on five types of {0,1}-knapsack instances. The results are presented for the supported and non-supported solutions as well as for the entire set of efficient solutions. A description of an approximate and an exact method is also presented.
APL on the Honeywell 635
Authors: Norman Glick, Richard Schrader
Venue: ACM SIGPLAN Notices (1971)

This paper describes an implementation of APL for the Honeywell 635 Computer. Although several of the primitives of the language have not yet been implemented, there are some system commands which provide an interesting link to other subsystems within the GECOS operating system. The primary implementation language is FORTRAN IV, so that some degree of machine independence is obtained. The hardware, software, and user environment is briefly described, followed by a description of the APL package from the user perspective, including the reasons for selecting the ASCII character set rather than the APL set. The features which link APL to the other GECOS sybsystems, and the debug package used are briefly described, and finally, a few interesting features of the implementation are described.
PRAAD: Preprocessing and Analysis Tool for Arabic Ancient Documents
Authors: W. Boussellaa, A. Zahour, B. Taconet, A. Alimi, A. Benabdelhafid
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents the new system PRAAD for pre- processing and analysis of Arabic Historical Documents. It is composed of two important parts: Pre-processing and analysis of ancient documents. After digitization, the color or greyscale ancient documents images are distorted by the presence of strong background artefacts such as scan optical blur and noise, show-through and bleed-through effects and spots. In order to preserve and exploit this cultural heritage documents, we intend to create efficient tool that achieves restoration, binarisation, and analyses the document layout. The developed tool is done by adapting our expertise in document image processing of Arabic Ancient documents, printed or manuscripts. The different functions of PRAAD system are tested on a set of Arabic Ancient documents from the National library and the National Archives of Tunisia.
Three Direction DEXEL Model of Polyhedrons and Its Application
Authors: Xinrui Gao, Shusheng Zhang, Zengxuan Hou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Compared with the single direction depth element (DEXEL) model, the three direction DEXEL model could express a shape more precisely. This paper gives a dexelization algorithm of polyhedrons. This algorithm could transform a polyhedron into its three direction DEXEL model. Under the same three direction DEXEL space, by Boolean operations such as union, intersection, and subtraction, complex DEXEL model could be produced. This paper used the three direction DEXEL model in rapid prototyping simulation. The complex features of the shape are preserved well .Under Java2.0 and Java 3D, these algorithms are tested. A simulation example of a part is given.
Search-intensive concept induction
Authors: Attilio Giordana, Filippo Neri
Venue: Evolutionary Computation (1995)

This paper describes REGAL, a distributed genetic algorithm-based system, designed for learning first-order logic concept descriptions from examples. The system is a hybrid of the Pittsburgh and the Michigan approaches, as the population constitutes a redundant set of partial concept descriptions, each evolved separately. In order to increase effectiveness, REGAL is specifically tailored to the concept learning task; hence, REGAL is task-dependent, but, on the other hand, domain-independent. The system proved particularly robust with respect to parameter setting across a variety of different application domains. REGAL is based on a selection operator, called Universal Suffrage operator, provably allowing the population to asymptotically converge, on the average, to an equilibrium state in which several species coexist. The system is presented in both a serial and a parallel version, and a new distributed computational model is proposed and discussed. The system has been tested on a simple artificial domain for the sake of illustration, and on several complex real-world and artificial domains in order to show its power and to analyze its behavior under various conditions. The results obtained so far suggest that genetic search may be a valuable alternative to logic-based approaches to learning concepts, when no (or little) a priori knowledge is available and a very large hypothesis space has to be explored.
A Two-Level Microprogrammed Multiprocessor Computer with Nonnumeric Functions
Authors: T. Baba
Venue: IEEE Transactions on Computers (1982)

A two-level microprogrammed multiprocessor system, MUNAP, along with its support software has been developed as a research vehicle for solving nonnumeric and associated problems. The MUNAP system provides highly parallel and distributed functions for nonnumeric processing, such as variable length word addressing, data permutation at the microprogram level, and bit operation and field handling at the multinanoprogram level. To control these functions efficiently, a 28-bit microinstruction simultaneously drives several nanoprogram streams of 40-bit nanoinstructions in the four 16-bit processor units. This scheme not only provides the ability to organize a number of modular processing elements into a single, parallel processable computer system, but also allows MUNAP to change its architecture at the firmware level.
Simulation Study on Underwater Autonomous Robot Based on Fuzzy Kalman Filter Algorithm
Authors: Qingmei Yang, Jianmin Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Data fusion methods are widely used in autonomous robots' measurement system in order to acquire more comprehensive and more exact information. Multi- sensor data fusion is to combine multi-sensor's information, which is redundant or complementary in the space or the time to obtain the uniform description or the understanding to the measured object according to a certain criterion. Move-in mud robot is an autonomous robot, which can excavate hole in the mud underwater. It can be used in sunken wreck salvage to improve the efficiency of excavating the hole. Location system of move-in-mud robot is designed in the paper and location principle of move-in-mud robot is analyzed. Fuzzy Kalman filter arithmetic is applied and simulated in location system of move-in-mud robot to fuse redundant information of the robot. The simulation results show the data fusion method can improve location accuracy.
Novel structure of GaAs-based interdigital-gated HEMT plasma devices for solid-state THz wave amplifier
Authors: Abdul Manaf Hashim, Seiya Kasai, Kouichi Iizuka, Tamotsu Hashizume, Hideki Hasegawa
Venue: Microelectronics Journal (2007)

Theoretical analysis of potential distribution in the interdigital-gated high electron mobility transistor (HEMT) plasma wave device was carried out. The dc I-V characteristics of capacitively coupled interdigital structure showed that uniformity of electric field under the interdigital gates was improved compared to the dc-connected interdigital gate structure. Admittance measurements of capacitively coupled interdigital gate structure in the microwave region of 10-40GHz showed the conductance modulation by drain-source voltage. These results indicate the existence of plasma wave interactions.
Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks
Authors: Yiming Zhang, Dongsheng Li, Lei Chen, Xicheng Lu
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a Parallel, cOllaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called Distributed Bloom Filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations.