ppxscal/embedding_network huggingface dataset:
DNA splicing: computing by observing
Authors: Matteo Cavaliere, Nataša Jonoska, Peter Leupold
Venue: Natural Computing: an international journal (2009)

Motivated by several techniques for observing molecular processes in real-time we introduce a computing device that stresses the role of the observer in biological computations and that is based on the observed behavior of a splicing system. The basic idea is to introduce a marked DNA strand into a test tube with other DNA strands and restriction enzymes. Under the action of these enzymes the DNA starts to splice. An external observer monitors and registers the evolution of the marked DNA strand. The input marked DNA strand is then accepted if its observed evolution follows a certain expected pattern. We prove that using simple observers (finite automata), applied on finite splicing systems (finite set of rules and finite set of axioms), the class of recursively enumerable languages can be recognized.
Predict-and-Quantize Priority in Application-Level Multicast for Distributed Interactive Applications
Authors: Ren Chen, Omar F. Hamad, Jin-Han Jeon, Mi-Young Kang, Ji-Seung Nam
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In Distributed Interactive Applications (DIAs) embedded priority, the sender node forwards data to receivers due to their respective priorities. One application level multicast protocol: the priority-based directed minimum spanning tree (PST) was designed for these DIAs. However, the existing PST has no efficient priority selection mechanism and the system consumes a tremendous amount of resource and becomes unstable and unscalable when its size increases. In this paper we propose a novel application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict priorities for the receivers and quantize the predicted priorities to build a multicast distribution tree. Furthermore, PQPST can easily integrate the quantized priority into game environment and simplify priority deployment. The simulation results show that PQPST is able to efficiently make priority selection and keep system stable with reasonable scalability.
The Organization and Management of Grid Infrastructures
Authors: Ian Bird, Bob Jones, Kerk F. Kee
Venue: Computer (2009)

Grid computing technology has become fundamental to e-Science. As the virtual organizations established by scientific communities progress from testing their applications to more routine usage, maintaining reliable and adaptive grid infrastructures becomes increasingly important.
DECK: Detecting Events from Web Click-Through Data
Authors: Ling Chen, Yiqun Hu, Wolfgang Nejdl
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In the past few years there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from the click-through data generated by Web search engines. Existing event detection algorithms, which mainly study the news archive data, cannot be employed directly because of the following two unique features of click-through data: 1) the information provided by click-through data is quite limited; 2) not every query issued to a Web search engine corresponds to an event in the real world. In this paper, we address this problem by proposing an effective algorithm which Detects Events from ClicK-through data DECK. We firstly transform click-through data to the 2D polar space by considering the semantic dimension and temporal dimension of queries. Robust subspace estimation is performed to detect subspaces such that each subspace consists of queries of similar semantics. Next, we prune uninteresting subspaces which do not contain queries corresponding to real events by simultaneously considering the respective distribution of queries along the semantic dimension and the temporal dimension in each subspace. Finally, events are detected from interesting subspaces using a nonparametric clustering technique. Compared with an existing approach, our experimental results based on real-life data have shown that the proposed approach is more accurate and effective in detecting real events from click-through data.
VISION II: a dynamic raster-scan display
Authors: Robert Rocchetti
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The analog graphics display is one of the most fascinating devices that computer technology has produced. The fluidity and complexity of motion possible with line-drawing displays is quite captivating and has initiated many interesting and fruitful software endeavors. Unlike their analog counterparts, the majority of raster-scan display systems have been capable of producing only text or static imagery. Dynamic graphics on raster displays has yet to be explored thoroughly in either the hardware or software area. This paper describes a digital video display system architecture with dynamic graphics capabilities. The hardware design and implementation derives from the author's thesis work at the University of Illinois.
Image guided medialization laryngoplasty
Authors: Ge Jin Nakhoon Baek James K. Hahn
Venue: Computer Animation and Virtual Worlds (2009)

Techniques that originate in computer graphics and computer vision have found prominent applications in the medical domain. In this paper, we have seamlessly developed techniques from computer graphics and computer vision together with domain knowledge from medicine to develop an image guided surgical system for medialization laryngoplasty. The technical focus of this paper is to register the preoperative radiological data to the intraoperative anatomical structure of the patient. With careful analysis of the real-world surgical environment, we have developed an ICP-based partial shape matching algorithm to register the partially visible anatomical structure to the preoperative CT data. We extracted distinguishable features from the human thyroid cartilage surface and applied image space template matching to find the initial guess for the shape matching. The experimental result shows that our feature-based partial shape matching method has better performance and robustness compared with original ICP-based shape matching method. Although this paper concentrates on the medialization laryngoplasty procedure, its generality makes our methods ideal for future applications in other image guided surgical areas. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Simulation of turbulent thermal convection in complicated domains
Authors: Olga Shishkina, Andrei Shishkin, Claus Wagner
Venue: Journal of Computational and Applied Mathematics (2009)

To simulate turbulent flows in complicated enclosed three-dimensional domains a fast finite-volume high-order method is developed. In principle, the method is based on the Chorin-Temam scheme. The Poisson solver, which is applied to compute the pressure, uses the separation of variables together with capacitance matrix technique. The developed numerical method generally allows to use hexahedral computational meshes, which are non-equidistant in all three directions and non-regular in any two directions. The method was successfully used in three-dimensional Direct Numerical Simulations of turbulent high-Rayleigh-number thermal convection in cylindrical and parallelepiped domains with obstacles.
Toward the parallelization of GSL
Authors: Jose Ignacio Aliaga, Francisco Almeida, Jose Manuel Badía, Sergio Barrachina, Vicente Blanco, Maria Castillo, Rafael Mayo, Enrique S. Quintana, Gregorio Quintana, Alfredo Remón, Casiano Rodríguez, Francisco Sande, Adrian Santos
Venue: The Journal of Supercomputing (2009)

In this paper, we present our joint efforts to design and develop parallel implementations of the GNU Scientific Library for a wide variety of parallel platforms. The multilevel software architecture proposed provides several interfaces: a sequential interface that hides the parallel nature of the library to sequential users, a parallel interface for parallel programmers, and a web services based interface to provide remote access to the routines of the library. The physical level of the architecture includes platforms ranging from distributed and shared-memory multiprocessors to hybrid systems and heterogeneous clusters. Several well-known operations arising in discrete mathematics and sparse linear algebra are used to illustrate the challenges, benefits, and performance of different parallelization approaches.
Simultaneous measurements of temperature and strain based on TFBG
Authors: Zhang Weihua, Miao Yinping, Liu Bo
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Tilted fiber Bragg gratings (TFBGs), as an important class of optical fiber gratings, not only have all properties of fiber Bragg gratings, but also have their unique properties because of the special physical structure. In this paper, theoretical and experimental studies on their temperature and strain sensing characteristics have been conducted. Simultaneous measurement of temperature and strain has been realized experimentally by ausing a single tilted fibre Bragg grating.
Performance optimization of SOA based AJAX application
Authors: Kanakalata N., Udayan Banerjee, Shantha Kumar
Venue: Proceedings of the 2nd India software engineering conference (2009)

SOA (Service Oriented Architecture) and AJAX (Asynchronous JavaScript and XML) address different aspects of building flexible business applications with rich user interfaces. Since AJAX is for the client side programming and SOA is for the server side programming, they complement each other. Optimal partitioning of an application between multiple machines has always been a challenge. Not much work has been done to establish best practices in arriving at how an SOA based AJAX application can be partitioned. In this paper we describe our experiences of partitioning an insurance underwriting application between client and server for performance optimization. We also outline a set of design guidelines and a four step methodology for achieving the same.
Passively mode-locked fiber ring laser with large normal net dispersion
Authors: X. L. Tian, M. Tang, P. Shum
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Here we experimentally demonstrated a passively mode-locked fiber laser (PMFL) with large normal net dispersion. Stable mode-locked pulse output was achieved at two different central wavelengths respectively, proved that small net dispersion is not a critical requirement for mode-locking. The output pulse had much larger pulse duration compared to other results had ever been achieved in PMFL. The pulse could be easily compressed by single mode fiber (SMF).
Unbordered partial words
Authors: F. Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercaş, Margaret Moorefield
Venue: Discrete Applied Mathematics (2009)

An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of ''do not know'' symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u can be written as a concatenation of nonempty prefixes of a word v, then u can be written as a unique concatenation of nonempty unbordered prefixes of v. We study the properties of the longest unbordered prefix of a partial word, investigate the relationship between the minimal weak period of a partial word and the maximal length of its unbordered factors, and also investigate some of the properties of an unbordered partial word and how they relate to its critical factorizations (if any).
An integrated support software network using NSW technology
Authors: Richard A. Robinson, Emily A. Krzysiak
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The problems with support software and the management structure employed in acquiring major weapon systems within the Air Force have been documented in a excellent fashion by General McCarthy, and his remarks are used to introduce the subject of this paper. In addition, plans are currently under way to tie together the many organizations involved in major system acquisitions, and to utilize ARPANET and National Software Works (NSW) technology as the framework for a series of technology demonstration(s). Finally, the reader should note that substantial efforts are currently under way within the Air Force to standardize and control programming languages and compilers.
The potential role of the computer in intuition and self development
Authors: David V. Tiedeman
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

From 1966--69, several colleagues and I had opportunity to design and implement a prototypical ISVD (Information System for Vocational Decisions). Dr. JoAnn Harris has been good enough to record that the ISVD and several sister computer guidance systems forecast and piloted the following advances in uniting the capabilities of computers and the purposes of guidance: 1. "Increased use of visuals to supplement words. 2. "Development of programs which will allow counselees to simulate vocational, educational, and personal-social experiences. ... 4. "Development of languages which allow the student to respond to the computer in his own language. 5. "Development of programs which will allow the counselee to prepare his own instructions to the computer and thus alter the pre-designed processes."
Combining Singular Value Decomposition and Item-based Recommender in Collaborative Filtering
Authors: SongJie Gong, HongWu Ye, YaE Dai
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Recommender Systems are introduced as an intelligent technique to deal with the problem of information and product overload. Their purpose is to provide efficient personalized solutions in economic business domains. Collaborative filtering is a widely used method of providing recommendations using ratings on items from users. However, it has three major limitations, accuracy, data sparsity and scalability. This paper proposes a new collaborative filtering algorithm to solve the problems mentioned above. We utilize the results of singular value decomposition (SVD) to fill the vacant ratings and then use the item based method to produce the prediction of unrated items. Our experimental results on MovieLens dataset show that the algorithm combined SVD method and item-based method is promising, since it does not only solute some of the recorded problems of recommender systems, but also assists in increasing the accuracy of systems employing it.
Multi-signal extension of adaptive frequency tracking algorithms
Authors: Y. Prudat, J. -M. Vesin
Venue: Signal Processing (2009)

Adaptive tracking of sinusoidal signal components with time-varying amplitudes and frequencies presents a great interest in many engineering applications. In many cases, the frequency components of interest are present in more than one signal. So we propose, in this paper, a simple but efficient approach to extend existing algorithms to track frequency components simultaneously in several signals. Computer simulations and experiments on real signals demonstrate the potential of this approach in terms of estimation variance, convergence speed, and the capability to extract a frequency component common to several signals.
Essential ZBrush, Pap/DVD edition
Authors: Wayne Robson
Venue: Wordware Game And Graphics Library (2008)

ZBrush is an unparalleled must-have tool in the world of digital sculpting. This book goes into great depth not only about how and why ZBrush works, but also how to master both ZBrush and digital sculpting. All aspects of the program are covered in detail and broken up into easy to understand sections. Essential ZBrush features many projects covering organic models and character pipelines, and non-organic hard surface walk-throughs. This book is suitable for all skill levels and covers something for every stage of a digital sculptor's development in ZBrush. Beginners learn the basics of ZBrush as well as digital sculpting and progress through both theory and projects to an advanced level. Upon completion of the book, readers will have the ability to produce detailed high quality digital sculpts.
So you know you're getting the best possible information: a tool that increases Wikipedia credibility
Authors: Peter Pirolli, Evelin Wollny, Bongwon Suh
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

An experiment was conducted to study how credibility judgments about Wikipedia are affected by providing users with an interactive visualization (WikiDashboard) of article and author editing history. Overall, users who self-reported higher use of Internet information and higher rates of Wikipedia usage tended to produce lower credibility judgments about Wikipedia articles and authors. However, use of WikiDashboard significantly increased article and author credibility judgments, with effect sizes larger than any other measured effects of background media usage and attitudes on Wikiepedia credibility. The results suggest that increased exposure to the editing/authoring histories of Wikipedia increases credibility judgments.
The research on a novel addressing technique for fiber Bragg grating sensor array
Authors: Li Ruo-ming, Yu You-long, Dai Wen-jiang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The principle of a novel interrogation technology for fiber Bragg grating sensor system was provided, which combined the wavelength selectable technique for fiber ring laser, based on the F-P filter with the time-domain addressing technique for fiber Bragg grating array, based on a 1x4 analog electrical switch. Demodulated with an unbalanced Michelson scanning interferometer, working with a wavelength of 1555 nm, the experimental system was demonstrated with a sensing sensitivity of 1.630&deg;/&mu;&epsilon;, and it agreed with the theoretical value of 1.674&deg;/&mu;&epsilon;, basically.
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
Authors: Daniel Delling, Giacomo Nannicini
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In a recent work [1], we proposed a point-to-point shortest paths algorithm which applies bidirectional search on time-dependent road networks. The algorithm is based on A * and runs a backward search in order to bound the set of nodes that have to be explored by the forward search. In this paper we extend the bidirectional time-dependent search algorithm in order to allow core routing, which is a very effective technique introduced for static graphs that consists in carrying out most of the search on a subset of the original node set. Moreover, we tackle the dynamic scenario where the piecewise linear time-dependent arc cost functions are not fixed, but can have their coefficients updated. We provide extensive computational results to show that our approach is a significant speed-up with respect to the original algorithm, and it is able to deal with the dynamic scenario requiring only a small computational effort to update the cost functions and related data structures.
Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
Authors: Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. It has been reported that the computation time of a parallel BB heavily depends upon node-variable selection strategies. And, in case of a parallel BB, it is also necessary to prevent increase in communication time. So, it is important to pay attention to how many and what kind of nodes are to be transferred (called sending-node selection strategy). In this paper, for the graph coloring problem, we propose some sending-node selection strategies for a parallel BB algorithm by adopting MPI for parallelization and experimentally evaluate how these strategies affect computation time of a parallel BB on a PC cluster network.
Topology optimization for the design of periodic microstructures composed of electromagnetic materials
Authors: Tsuyoshi Nomura, Shinji Nishiwaki, Kazuo Sato, Koichi Hirayama
Venue: Finite Elements in Analysis and Design (2009)

Electromagnetic structures that incorporate certain structural periodicities are known to display special behavior when subjected to electromagnetic waves, and can be designed to have specific functions such as inhibiting the intrusion of electromagnetic waves of certain frequencies into the periodic structure. This paper proposes a novel topology optimization method for periodic microstructures of electromagnetic materials using the concept of propagation behavior to implement designs that inhibit electromagnetic wave propagation. First, a way to apply topology optimization to the design of electromagnetic structures is briefly discussed. Next, the design specifications are clarified, and a new objective function is proposed to satisfy these specification. The optimization algorithm is developed using sequential linear programming (SLP) and the adjoint variable method (AVM). Several numerical examples are provided to confirm that the proposed method is capable of automatically generating physically reasonable periodic structures that have desired specified functions without relying on a predefined basic lattice.
Towards the evaluation of time series protection methods
Authors: Jordi Nin, Vicenç Torra
Venue: Information Sciences: an International Journal (2009)

The goal of statistical disclosure control (SDC) is to modify statistical data so that it can be published without releasing confidential information that may be linked to specific respondents. The challenge for SDC is to achieve this variation with minimum loss of the detail and accuracy sought by final users. There are many approaches to evaluate the quality of a protection method. However, all these measures are only applicable to numerical or categorical attributes. In this paper, we present some recent results about time series protection and re-identification. We propose a complete framework to evaluate time series protection methods. We also present some empirical results to show how our framework works.
A high-throughput interconnection structure
Authors: J. A. Hernandez, E. Horlait, R. Joly, G. Pujolle
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Today, high-throughput interconnection structure (HTIS) is a concept. This paper surveys the properties that HTIS should satisfy and proposes a new architecture that satisfies some of the HTIS requirements. We describe the topology, the access method, and the logical structure of our experimental network. This network is a part of a project called ESCALIBUR, in which both interconnection architectures and distributed applications are studied. The network architecture presented here is mainly oriented toward local and bus networks but may be extended long-haul networks.