ppxscal/embedding_network huggingface dataset:
A framework for management of concurrent XML markup
Authors: Alex Dekhtyar, Ionut E. Iacob
Venue: Data Knowledge Engineering (2005)

The problem of concurrent markup hierarchies in XML encodings of documents has attracted attention of a number of humanities researchers in recent years. The key problem with using concurrent hierarchies to encode documents is that markup in one hierarchy is not necessarily well-formed with respect to the markup in another hierarchy. Previously proposed solutions to this problem rely on the XML expertise of the editors and their ability to maintain correct DTDs for complex markup languages. In this paper, we approach the problem of maintenance of concurrent XML markup from the Computer Science perspective. We propose a framework that allows the editors to concentrate on the semantic aspects of the encoding, while leaving the burden of maintaining XML documents to the software. The paper describes the formal notion of the concurrent markup languages and the algorithms for automatic maintenance of XML documents with concurrent markup.
Discretized Stability and Error Growth of The Nonautonomous Pantograph Equation
Authors: Chengming Huang, Stefan Vandewalle
Venue: SIAM Journal on Numerical Analysis (2004)

This paper is concerned with the stability properties of Runge--Kutta methods for the pantograph equation, a functional differential equation with a proportional delay. The focus is on nonautonomous equations. Both linear and nonlinear cases are considered. Sufficient and necessary conditions for the asymptotic stability of the numerical solution of general neutral pantograph equations are given. An upper bound for the error growth is investigated for algebraically stable methods applied to nonneutral equations. Finally, some stability results are extended to the case of a more general class of equations.
EXDOCS: export documentation system
Authors: Ramkrishnan "Ramki" Sundararaman
Venue: Journal of Computing Sciences in Colleges (2004)

This project involved the development of a web based system of Automatic Shipment and Export Documentation System (EXDOCS) for the use of Wafer pack department at FASL LLC, Austin. Wafer pack department is responsible for generation of various documents like Shipping Manifest, Export Commercial Invoice along with the physical shipment whenever material is sent to various back end facilities in Japan, Singapore, Suzhou China, and Kuala Lumpur Malaysia. 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 hierarchy theorem for regular languages over free bisemigroups
Authors: Zoltán L. Németh
Venue: Acta Cybernetica (2004)

In this article a question left open in [2] is answered. In particular, we show that it is essential that in the definition of parenthesizing automata an arbitrary number of parentheses can be used. Moreover, we prove that the classes Regm of languages accepted by a parenthesizing automaton with at most m pairs of parentheses form a strict hierarchy. In fact, this hierarchy is proper for all alphabets.
A New Relaying Scheme for Cheap Wireless Relay Nodes
Authors: Ramin Khalili, Kave Salamatian
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domain of wireless network have focused on routing based approaches. In such an approach wireless network reduced to a dynamic graph, and a minimum cost routing mechanism is applied. These approaches have led to several routing mechanisms as OLSR and AODV. However, the fundamental nature of wireless network is the broadcast. the wireless network all the tuned receivers potentially receive every transmission. This basic property is not well captured by graph-based approaches where packets follow a single path from sender to receiver. In this paper we will propose a relaying scheme for wireless multi-hop networks. It is based on collaboration of intermediate relays at network layer to forward useful side information in place of dumbly forwarding packets. In our scheme we assume that the nodes are not able to benefit from any interference cancellation mechanism. The channels from sender to relay nodes and from sender to receiver are logically separated through a temporal scheduling. This model is realistic for many practical scenarios in the context of wireless networks. We will show in this paper the information theoretic bounds and show that they are achievable using practical codes. The proposed coding scheme is simulated in realistic scenarios. The obtained results show a remarkable improvement in throughput, relay load and reliability compared to network using classical routing approach.
Design and Control of a Four-Wheeled Omnidirectional Mobile Robot with Steerable Omnidirectional Wheels
Authors: Jae-Bok Song, Kyung-Seok Byun
Venue: Journal of Robotic Systems (2004)

Omnidirectional mobile robots are capable of arbitrary motion in an arbitrary direction without changing the direction of wheels, because they can perform 3 degree-of-freedom (DOF) motion on a two-dimensional plane. In this research, a new class of omnidirectional mobile robot is proposed. Since it has synchronously steerable omnidirectional wheels, it is called an omnidirectional mobile robot with steerable omnidirectional wheels (OMR-SOW). It has 3 DOFs in motion and one DOF in steering. One steering DOF can function as a continuously variable transmission (CVT). CVT of the OMR-SOW increases the range of velocity ratio from the wheel velocities to robot velocity, which may improve performance of the mobile robot. The OMR-SOW with four omnidirectional wheels has been developed in this research. Kinematics and dynamics of this robot will be analyzed in detail. Various tests have been conducted to demonstrate the validity and feasibility of the proposed mechanism and control algorithm. &copy; 2004 Wiley Periodicals, Inc.
Adaptive Video Fast Forward
Authors: Nemanja Petrovic, Nebojsa Jojic, Thomas S. Huang
Venue: Multimedia Tools and Applications (2005)

We derive a statistical graphical model of video scenes with multiple, possibly occluded objects that can be efficiently used for tasks related to video search, browsing and retrieval. The model is trained on query (target) clip selected by the user. Shot retrieval process is based on the likelihood of a video frame under generative model. Instead of using a combination of weighted Euclidean distances as a shot similarity measure, the likelihood model automatically separates and balances various causes of variability in video, including occlusion, appearance change and motion. Thus, we overcome tedious and complex user interventions required in previous studies. We use the model in the adaptive video forward application that adapts video playback speed to the likelihood of the data. The similarity measure of each candidate clip to the target clip defines the playback speed. Given a query, the video is played at a higher speed as long as video content has low likelihood, and when frames similar to the query clip start to come in, the video playback rate drops. Set of experiments o12n typical home videos demonstrate performance, easiness and utility of our application.
A TASK ANALYTIC METHODOLOGY FOR PREDICTING EASE OF LEARNING OF INTERACTIVE COMPUTER SYSTEMS
Authors: Mohamed Khalifa
Venue: ACM SIGCHI Bulletin (1991)

Predictive models, especially those that are based on sound theories of human behavior, represent powerful tools that can provide useful analyses of interface designs before any coding of software or empirical testing. In this research, a methodology for evaluating user interface designs in terms of ease of learning is developed and tested. The methodology represents an extension to the cognitive complexity theory of Kieras and Polson (1985). The application of this theory is well explained in (Bovair, Kieras and Polson, 1990). In the cognitive complexity models, ease of learning is measured by the learning time (or training time) which is predicted as a function of the number of new rules that must be learned. In this research, a different measure of ease of learning is proposed and different classes of rules are identified.
A model for describing and structuring learning objects
Authors: Valentina Petrova, Margarita Todorova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper presents how the learning objects are deployed in learning support environment. The design of content packages are described in the proposed model by integrating learning technology standards, specifications and instructional design theory.
Representing and Querying Data Transformations
Authors: Yannis Velegrakis, Renee J. Miller, John Mylopoulos
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Modern information systems often store data that has been transformed and integrated from a variety of sources. This integration may obscure the original source semantics of data items. For many tasks, it is important to be able to determine not only where data items originated, but also why they appear in the integration as they do and through what transformation they were derived. This problem is known as data provenance. In this work, we consider data provenance at the schema and mapping level. In particular, we consider how to answer questions such as "what schema elements in the source(s) contributed to this value", or "through what transformations or mappings was this value derived?" Towards this end, we elevate schemas and mappings to first-class citizens that are stored in a repository and are associated with the actual data values. An extended query language, called MXQL, is also developed that allows meta-data to be queried as regular data and we describe its implementation. scenario.
Data Triage: An Adaptive Architecture for Load Shedding in TelegraphCQ
Authors: Frederick Reiss, Joseph M. Hellerstein
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Many of the data sources used in stream query processing are known to exhibit bursty behavior. Data in a burst often has different characteristics than steady-state data, and therefore may be of particular interest. In this paper, we describe the Data Triage architecture that we are adding to TelegraphCQ to provide low latency results with good accuracy under such bursts.
Simulating Data Generated by a Network of Track-While-Scan Radars
Authors: Fernando J. Barros
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The echoes generated by single conventional rotating track-while-scan beam radars can be approximately described by a stream of uniformly sampled data. However, the combined stream of a multisite radar network can only be represented by non-uniformly sampled data. To combine several data streams a rigorous calculation of the sampling instants is necessary. The ability to simulate the data produced by a radar network permits to study the performance of tracking algorithms when operating under irregular sampled data. To simulate the radar network we employ the Heterogeneous Flow System Specification (HFSS), a modeling and simulation formalism designed to represent dynamic structure hybrid systems. We present the performance of a ...... filter based on the data obtained through the simulation of a network of three track-while-scanning radars.
Performance improvements of large-scale video servers by video segment allocation
Authors: Kiyoshi Tanaka, Hideki Sakamoto, Hideharu Suzuki, Katzutoshi Nishimura
Venue: Systems and Computers in Japan (2004)

As large-scale commercial video-on-demand services develop, the creation of large-scale video servers that can provide video to over 10,000 terminals is needed. A large-scale video server distributes and stores video in segments using striping technology on many hard disks. Segment duplication is an effective way to improve the performance of video servers, but unless the allocation of segments to several hard disks is appropriate, retrieval requests become concentrated on a particular hard disk, and retrieval delays result. Thus, in this paper the authors describe a method to find a segment allocation that improves video server performance, including the number of retrieval streams and response time, and without creating retrieval delays, by taking into consideration the allocation to hard disk of video segments stored in a video server. In the authors' method, segments to be duplicated are determined and an allocation found by solving a limited satisfaction problem using the access probability for segments. Based on simulation experiments, the authors confirmed that their method was able to create a segment allocation which allowed for better retrieval performance than allocation methods used in the past. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 27&ndash;35, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10187
Reflections on the Generalized Bas-Relief Ambiguity
Authors: Manmohan Krishna Chandraker, Fredrik Kahl, David J. Kriegman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Prior work has argued that when a Lambertian surface in fixed pose is observed in multiple images under varying distant illumination, there is an equivalence class of surfaces given by the generalized bas-relief (GBR) ambiguity that could have produced these images. In contrast, this paper shows that for general nonconvex surfaces, interreflections completely resolve the GBR ambiguity. In turn, the full Euclidean geometry can be recovered from uncalibrated photometric stereo for which the light source directions and strengths are unknown. Further, we show that surfaces with a translational symmetry do not lend enough constraints to be disambiguated by interreflections.
Optimizing schedules in the pipeline systems with variable job execution order
Authors: V. I. Levin
Venue: Automation and Remote Control (2005)

The problem of speed-optimal solution was formulated for the pipeline systems with variable job execution order which depends on the number of the system stage, the order of job execution, and the finite time of its variation. The mathematical system model was constructed. The solution based on reducing the problem to a finite number of similar problems with constant job execution orders was proposed. Reduction algorithms and examples of designing the optimal variable job order were presented.
Structure alignment using bilingual chunking
Authors: Wei Wang, Jin-Xia Huang, Ming Zhou, Chang-Ning Huang
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

A new statistical method called "bilingual chunking" for structure alignment is proposed. Different with the existing approaches which align hierarchical structures like sub-trees, our method conducts alignment on chunks. The alignment is finished through a simultaneous bilingual chunking algorithm. Using the constrains of chunk correspondence between source language (SL) and target language (TL), our algorithm can dramatically reduce search space, support time synchronous DP algorithm, and lead to highly consistent chunking. Furthermore, by unifying the POS tagging and chunking in the search process, our algorithm alleviates effectively the influence of POS tagging deficiency to the chunking result.The experimental results with English-Chinese structure alignment show that our model can produce 90% in precision for chunking, and 87% in precision for chunk alignment.
Joint review of "Introduction To Natural Computation by Dana H. Ballard"; MIT Press, 1997, ISBN 0-262-52258-6 and "Mathematical Methods in Artificial Intelligence by Edward A. Bender", IEEE Press, 1996 ISBN 0-8186-7200-5.
Authors: Lawrence S. Moss
Venue: ACM SIGACT News (2005)

One of the interesting trends in theoretical computer science in recent years is the turn towards new application areas. It is not strange to see career shifts from complexity theory to cryptography, from type theory to security, from formal language theory to computational biology. The trend is reflected in journals as well. For example, the newly-open-for-business electronic journal Logical Methods in Computer Science has editors in the "emerging topics" of quantum computation and logic, and in computational systems in biology. Theoretical Computer Science recently added to its two sections (algorithms, automata, complexity and games; and logic, semantics and theory of programming) a third section entitled "Natural Computing". This "is devoted to the study of computing occurring in nature and computing inspired by nature. ... it will contain papers dealing with the theoretical issues in evolutionary computing, neural networks, molecular computing, and quantum computing." (Interstingly, SIGACT News seems to be immune from this trend, at least so far.) Finally, we turn from official journals to decidedly unofficial sources: weblogs summaries of panel discussions at conferences. On May 14, 2004, the Columbia/IBM Research/NYU Theory Day held a panel on "The Future of CS Theory." As reported in Lance Fornow's Computational Complexity Web Log, Richard Karp "highlighted three areas of interest for the future: (1) the study of large scale distributed systems such as the Web, incorporating ideas from economics and game theory; (2) connections with areas of natural science, ranging from statistical physics to quantum mechanics to biology; and (3) the 'new face' of AI in which stochastic and graphical models and statistical inference are playing a big role."
Distribution of the error in estimated numbers of fixed points of the discrete logarithm
Authors: Joshua Holden
Venue: ACM SIGSAM Bulletin (2004)

Brizolis asked the question: does every prime p have a pair (g, h) such that h is a fixed point for the discrete logarithm with base g? This author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for estimating the number of such pairs and proved bounds on the error in the estimates. These bounds are not descriptive of the true situation, however, and this paper is a first attempt to collect and analyze some data on the distribution of the actual error in the estimates.
Teaching robots to plan through Q-learning
Authors: Dongbing Gu, Huosheng Hu
Venue: Robotica (2005)

This paper presents a Q-learning approach to state-based planning of behaviour-based walking robots. The learning process consists of a teaching stage and an autonomous learning stage. During the teaching stage, the robot is instructed to operate in some interesting areas of the solution space to accumulate some prior knowledge. Then, the learning is switched to the autonomous learning stage to let the robot explore the solution space based on its prior knowledge. Experiments are conducted in the RoboCup domain and results show a good performance of the proposed method.
Searching oligo sets of human chromosome 12 using evolutionary strategies
Authors: Yen-Yen Joe, Arthur Tay, Zhao-Yang Dong, Huck-Hui Ng, Huan Xu
Venue: International Journal of Systems Science (2004)

DNA Microarray is a powerful tool to measure the level of a mixed population of nucleic acids at one time, which has great impact in many aspects of life sciences research. In order to distinguish nucleic acids with very similar composition by hybridization, it is necessary to design microarray probes with high specificities and sensitivities. Highly specific probes correspond to probes having unique DNA sequences; whereas highly sensitive probes correspond to those with melting temperature within a desired range and having no secondary structure. The selection of these probes from a set of functional DNA sequences (exons) constitutes a computationally expensive discrete non-linear search problem. We delegate the search task to a simple yet effective Evolution Strategy algorithm. The computational efficiency is also greatly improved by making use of an available bioinformatics tool.
TMO-Structured Distributed Location Information System Prototype
Authors: Yunmook Nah, Joonwoo Lee, Seungyong Park, Ho Lee, Sangwoo Kim, Moon Hae Kim, Ki-Joon Han
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

To realize location-based services, it is essential to handle the extreme situation that must cope with a very large volume, at least millions, of moving items. In this paper, we describe a location information system prototype of GALIS, which is a cluster-based scalable distributed computing system architecture which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. The proposed system contains all of the major computing nodes of GALIS architecture and is developed as a middleware on top of commercial mainmemory database engines and spatial database engines, for short-term data and long-term data processing, respectively. To show the usefulness of our system, some experimental results showing clear advantages of distributed computing are also explained.
Conceptualising mixed spaces of interaction for designing continuous interaction
Authors: Gorski Trevisan, Jean Vanderdonckt, Beno&#x00ee;t Macq
Venue: Virtual Reality (2004)

Recent progress in the overlay and registration of digital information on the user&#x2019;s workspace in a spatially meaningful way has allowed mixed reality (MR) to become a more effective operational medium. However, research in software structures, design methods and design support tools for MR systems is still in its infancy. In this paper, we propose a conceptual classification of the design space to support the development of MR systems. The proposed design space (DeSMiR) is an abstract tool for systematically exploring several design alternatives at an early stage of interaction design, without being biassed towards a particular modality or technology. Once the abstract design possibilities have been identified and a concrete design decision has been taken (i.e. a specific modality has been selected), a concrete MR application can be considered in order to analyse the interaction techniques in terms of continuous interaction properties. We suggest that our design space can be applied to the design of several kinds of MR applications, especially those in which very little user focus distraction can be tolerated, and where smooth connections and interactions between real and virtual worlds is critical for the system development. An image-guided surgery system (IGS) is used as a case study.