ppxscal/embedding_network huggingface dataset:
Architectural Design and Simulation in the Heterogeneous Collaborative Virtual Environment
Authors: Seon-Min Rhee, Eun Cho, Hyo-Sun You, Myoung-Hee Kim
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

We present an application for design andsimulation of a building that fits into its surroundingsin a heterogeneous collaborative virtual environment.Constructed heterogeneous collaborative VE consistsof different VR display systems such as a virtual tableand a projection wall. Since the virtual table providesa table-type workspace on a horizontal screen, it isefficient for interactive design of a building with abird's-eye-view. However, it is not so efficient to view adesigned building in the same proportions as that for areal building. On the other hand, as the projectionwall is a vertical type VR environment having a largedisplay, it enables simulation of the whole designprocess on a virtual table in frontal view. In addition,it also enables navigation around the building and inits surroundings. So we propose to use a projectionwall as well as virtual table for constructing virtualenvironment so that design and simulation could beperformed at the same time in each environment. Sincethe two VR systems are located close to one another,the user in the projection wall can participate in thedesign process that is performed in the virtual tableindirectly through verbal communication. Guided 3Dinteraction techniques are also described fordesigning a building with ease in the 3D VRenvironment.
An algorithm for computing the nielsen number of maps on the pants surface
Authors: Peter Yi
Venue:  (2003)

Let P denote the topological space obtained by taking a closed regular neighborhood of the figure eight in the plane. We will call this space, the pants surface. Let f : P &rarr; P be a self-map. The Nielsen number, N( f), depends only on the induced map f&sharp; of the fundamental group, a free group on 2 generators, a and b. In this paper, we will present an algorithm for computing the Nielsen number on the pants surface. Because of commutativity property of the Nielsen number, if g is a mutant [B. Jiang, Math. Ann. 311 (1998), 467&ndash;479] of f, then N( f) = N(g). We will mutate f into a map which is Wagner-characteristic [J. Wagner, Trans. Amer. Math. Soc. 351 (1999), 41&ndash;62], a map in which the Nielsen number can be computed directly, or a map which satisfies an algebraic condition and say it to be in the exceptional case. The classification of the exceptional cases is also discussed.
A Reliability Layer for Ad-Hoc Wireless Sensor Network Routing
Authors: Edoardo Biagioni, Shu Hui Chen
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

We have been studying communication in wireless adhoc sensor networks. One of the authors has designed the Multipath On-demand Routing (MOR) protocol [4], which makes use of all possible paths to a given destination. Each node in MOR has, wherever possible, a choice of next hops for a given destination. We have designed and implemented a MOR reliability layer to take advantage of this. The basic strategy is to use a different node on eachretransmission, and to keep track of which transmissions are successful. The main benefit is that a packet is likely to be delivered even if a given neighbor is temporarily unavailable, thus improving the delivery ratio or decreasing the number of end-to-end retransmissions. A furtherbenefit is that nonresponsive nodes are removed from the routing table after a number of consecutive failures.In a sensor network transmission may be unreliable for a number of reasons, but particularly when congestion results in collisions. Without our reliability layer, collisions would cause packet loss and route loss. If the transport protocol is reliable, this results in end-to-end retransmission, which requires additional energy. We simulated transmission in congested conditions in different realistic sensor networks and compared MOR to available protocols. In our tests, the reliability layer helped MOR deliver data faster and using less energy than the other protocols.
Modeling and Enacting Software Processes Using VRPML
Authors: Kamal Z. Zamli, Peter A. Lee
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

This paper evaluates a new visual processmodeling language (PML), called the Virtual RealityProcess Modeling Language (VRPML).Thisevaluation utilizes the well-known ISPW-6 benchmarkproblem as well as the waterfall development model ascase studies, and offers comparison with other PMLswhere possible.In addition to providing insights intothe strengths and limitations of VRPML, thisevaluation highlights important lessons learned andoffers valuable guidance for the design of next-generationPMLs.
Review of "Natural language generation in artificial intelligence and computational linguistics" by C&eacute;cile Paris, William R. Swartout, William C. Mann. Kluwer Academic Publishers 1991.
Venue: Computational Linguistics (1991)

A number of collections of papers from the field of natual language generation (NLG) have been published over the last few years: Kempen (1987), Zock and Sabah (1988), Dale, Mellish, and Zock (1990), and now the present volume. All have in common that they are derived in one way or another from workshops on the subject, and should therefore make available new and often exploratory research in a timely fashion. If such a book is to be more than a conference proceedings, it has to do a little more too, of course; it should present the research in more detail than a conference proceedings would, there should be greater cohesion amongst the papers, and it should be produced to an appropriate standard. The present book, like its predecessors, succeeds on some counts but fails on others. The papers in the book are organized into three strands, described in turn below: Text planning, lexical choice, and grammatical resources. The balance between these is rather skewed, however: the first section contains eight papers, and the second and third contain only three papers each.
Concentration for Independent Permutations
Authors: Colin McDiarmid
Venue: Combinatorics, Probability and Computing (2002)

We give a concentration inequality involving a family of independent random permutations, which is useful for analysing certain randomized methods for graph colouring.
InfoGrid: providing information integration for knowledge discovery
Authors: Nikolaos Giannadakis, Anthony Rowe, Moustafa Ghanem, Yi-ke Guo
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Many scientific experiments produce large amounts of data using high-throughput devices. Knowledge Discovery systems are used in order to analyse this type of data. However, generic laboratory systems do not provide any contextual information about the system that is being studied. In these situations, Knowledge Discovery can be aided and validated by the use of Information integration tools. In this paper, we introduce InfoGrid, a data integration middleware engine, designed to operate under a Grid framework. It focuses on providing information access services and offers all users a query system which is able to retain the familiarity with their specific scientific applications while being diverse, flexible and open at the same time. The assumption here is that defining a common language for all queries is not desirable.Using this design, we show how the InfoGrid architecture can be used to provide contextual features for a data table to be used for analysis (i.e. the Annotation Problem). We also show how it can be used to find relevant background knowledge for a user (i.e. the Information Comprehension Problem). Both of these issues are very often encountered in Knowledge Discovery tasks, which we illustrate by means of a real-world example.
Energy-aware management for cluster-based sensor networks
Authors: Mohamed Younis, Moustafa Youssef, Khaled Arisha
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Networking unattended sensors is expected to have a significant impact on the efficiency of many military and civil applications. Sensors in such systems are typically disposable and expected to last until their energy drains. Therefore, energy is a very scarce resource for such sensor systems and has to be managed wisely in order to extend the life of the sensors for the duration of a particular mission. In this paper, we present a novel approach for energy-aware management of sensor networks that maximizes the lifetime of the sensors while achieving acceptable performance for sensed data delivery. The approach is to dynamically set routes and arbitrate medium access in order to minimize energy consumption and maximize sensor life. The approach calls for network clustering and assigns a less-energy-constrained gateway node that acts as a cluster manager. Based on energy usage at every sensor node and changes in the mission and the environment, the gateway sets routes for sensor data, monitors latency throughout the cluster, and arbitrates medium access among sensors. We also describe a time-based medium access control (MAC) protocol and discuss algorithms for assigning time slots for the communicating sensor nodes. Simulation results show an order of magnitude enhancement in the time to network partitioning, 11% enhancement in network lifetime predictability, and 14% enhancement in average energy consumed per packet.
Simple, low-cost stereographics: VR for everyone
Authors: John M. Zelle, Charles Figura
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Students are very interested in cutting-edge technologies like virtual reality (VR), and VR has many potential uses in education. However, building VR applications has proved challenging due to both cost and technical skill barriers. Through a series of experiments in "shoestring" VR, we have developed methods of bringing an important facet of VR, stereoscopic display, to our students in a simple, cost-effective way. This paper describes our approach.
CHAMIL: a case study in microprogramming language design
Authors: Thomas G. Weidner
Venue: ACM SIGPLAN Notices (1980)

The design of a Pascal based microprogramming language is described. It is a Pascal dialect adapted to the task of microprogramming a highly pipelined, horizontal micro-architecture. The nature of high level microprogramming languages, data and control structures, and the effect of a microprogramming environment on language and translator development are discussed. Certain complexities of horizontal micro-architectures are outlined.
Cluster models for spatial point processes with applications
Authors: J. Mateu, J. A. Lopez
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Spatial point process models provide a large variety of complex patterns to model particular clustered situations. Due to model complexity, spatial statistics often relies on simulation methods. Probably the most common such method is Markov chain Monte Carlo (MCMC) which draws approximate samples of the target distribution as the equilibrium distribution of a Markov chain. Perfect simulation methods are MCMC algorithms which ensure that the exact target distribution is sampled. In this paper we focus on point field models that have been used as particular models of galaxy clustering in both cosmology and spatial statistics. We present simulation and estimation techniques for these models and analyze by an extensive simulation study their flexibility for cluster modeling, under a large variety of practical situations.
Exact and heuristic algorithms for the minimization of incompletely specified state machines
Authors: G. D. Hachtel, J. K. Rho, F. Somenzi, R. Jacoby
Venue: Proceedings of the conference on European design automation (1991)

In this paper we present two exact algorithms for state minimization of FSM's. Our results prove that exact state minimization is feasible for a large class of practical examples, certainly including most hand-designed FSM's. We also present heuristic algorithms, that can handle large, machine-generated, FSM's. We argue that the true objective of state reduction should be reduction toward maximal encodability. The state mapping problem has received almost no prior attention in the literature. We show that mapping plays a significant role in delivering an optimally implemented reduced machine. We also introduce an algorithm whose main virtue is the ability to cope with very general cost functions, while providing very high performance.
Dynamical and Probabilistic Approaches to the Study of Blackout Vulnerability of the Power Transmission Grid
Authors: B. A. Carreras, V. E. Lynch, I. Dobson, D. E. Newman
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The CASCADE probabilistic model for cascading failures gives a simple characterization of the transition from an isolated failure to a system-wide collapse as system loading increases. Using the basic ideas of this model, the parameters that lead to a similar characterization for power transmission system blackouts are identified in the OPA dynamical model of series of blackouts. The comparison between the CASCADE and OPA models yields parameters that can be computed from the OPA model that indicate a threshold for cascading failure blackouts. This is a first step towards computing similar parameters for real power transmission systems.
Nonlinear Speech Model Based on Support Vector Machine and Wavelet Transform
Authors: Jianmin Li, Bo Zhang, Fuzong Lin
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

To improve the naturalness of reconstructed speech, nonlinear speech models are paid more and more attention in recent years. A nonlinear speech model for speech synthesis based on Support Vector Machine (SVM) is presented firstly. After speech signal is embedded into phase space, nonlinear map in the model is obtained with support vector regression. It is shown in the experiments that for some pieces of speech, not only can speech be perfectly reconstructed by the system, but also jitter and shimmer in the original signal is preserved. However, the output of the system is quite different from the original one for other pieces. The reason is that the sub-bands with different frequency in the original signal can not be perfectly described by a SVM-based autoregressive model trained with one set of training parameters. Consequently, a multi-band model is then proposed. After the original speech is decomposed into several bands through wavelet packet decomposition, a nonlinear dynamical model based on SVM is constructed for each sub-band signal. It is shown in the experiments that the stability of such system is improved.
Propositional proof systems: efficiency and automatizability
Authors: Mikhail Alekhnovitch
Venue:  (2003)

The thesis considers two fundamental questions in propositional proof complexity: lower bounds on the size of the shortest proof and automatizability of propositional proof systems. With respect to the first part, we develop a new paradigm for proving lower bounds in propositional calculus. Our method is based on the purely computational concept of pseudorandom generator. Namely, we call a pseudorandom generator Gn : {0,1}n &rarr; {0,1}m hard for a propositional proof system P if P cannot efficiently prove the (properly encoded) statement Gn(x1,&hellip;,x n) &ne; b for any string b &isin; {0,1}m. We consider a variety of &ldquo;combinatorial&rdquo; pseudorandom generators inspired by the Nisan-Wigderson generator on the one hand, and by the construction of Tseitin tautologies on the other. We prove that under certain circumstances these generators are hard for such proof systems as Resolution, Polynomial Calculus and Polynomial Calculus with Resolution (PCR). As to the second part, we prove that the problem of approximating the size of the shortest proof within factor 2log1-o 1n is NP-hard. This result is very robust in that it holds for almost all natural proof systems, including: Frege systems, extended Frege systems, resolution, Horn resolution, the sequent calculus, the cut-free sequent calculus, as well as the polynomial calculus. We introduce the Monotone Minimum (Circuit) Satisfying Assignment problem and reduce it to the problem of approximating the length of proofs. Finally, we show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomized algorithms with one-sided error. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Optimal Control of a Paired-Kidney Exchange Program
Authors: Stefanos A. Zenios
Venue: Management Science (2002)

Organ exchanges are expected to increase the utilization of living donors and to alleviate the critical shortage of organs for transplantation. The typical arrangement involves adirect exchange between two blood-type incompatible donor-candidate pairs. An alternate possibility is anindirect exchange between one such pair and the highest priority candidate on the regular waiting list for cadaveric organs. This paper focuses on the mix of direct and indirect exchanges that maximizes the expected total discounted quality-adjusted life years (QALY) of the candidates in the participating pairs. Direct exchanges are preferable because the candidate receives a living-donor organ instead of the inferior cadaveric organ an indirect exchange provides. However, the latter involves a shorter wait. To capture this tradeoff, we develop a double-ended queueing model for an exchange system with two types of donorcandidate pairs, and obtain an optimal dynamic exchange policy by invoking a Brownian approximation. The policy takes the form of a two-sided regulator in which new pairs will join the exchange system to wait for a direct exchange if and only if the process modeling the exchange system is within the regulator's two barriers. In all other circumstances, new pairs will participate in an indirect exchange. Expressions for the optimal barriers are obtained under a variety of assumptions about the objective function, including one of complete candidate autonomy. The analysis identifies three design principles that will amplify the likelihood of an exchange program's success. First, exchange programs must involve the coordinated activities of multiple local transplant centers to enjoy the substantial benefits of resource pooling. Second, participant wait must be controlled through indirect exchanges. Third, the program must respect participants' autonomy and weigh that autonomy against the broader goal of maximizing their overall welfare.
Numerical simulation of the plasma of an electron cyclotron resonance ion source
Authors: Alain Girard, Christian Lécot, Konstantin Serebrennikov
Venue: Journal of Computational Physics (2003)

We propose a kinetic description of the particles in an electron cyclotron resonance ion source (ECRIS) for highly charged ion production. The electron distribution function (EDF) is solution of a Fokker-Planck equation in velocity space. A new finite-volume scheme for the computation of the EDF is presented. The system is azimuthally symmetric. A two-dimensional, structured grid of quadrangles is used to describe the geometry in spherical polar coordinates (v, µ). The temporal stiffness problems are addressed with a semi-implicit method of time integration. Evaluation of the coefficients of the collision operator requires derivatives ef the Rosenbluth potentials in every time step. The computation is accomplished through parallel implementation. Examples of the application of the algorithm are given and the role of the different design parameters is studied.
Can structured programs be efficient?
Authors: R. A. DeMillo, S. C. Eisenstat, R. J. Lipton
Venue: ACM SIGPLAN Notices (1976)

By using a new method for comparing the power of control structures, we give evidence that there are provable quantitative differences among various control structures. The key result discussed in this note states that there are natural <u>goto</u> programs which can only be simulated by structured programs that are either very large or very slow.
State of the art on automatic road extraction for GIS update: a novel classification
Authors: J. B. Mena
Venue: Pattern Recognition Letters (2003)

This paper surveys the state of the art on automatic road extraction for GIS update from aerial and satellite imagery. It presents a bibliography of nearly 250 references related to this topic. The work includes main approaches on general methods of road network extraction and reconstruction, road tracking methods, morphological analysis, dynamic programming and snakes, methods multi-scale and multi-resolution, stereoscopic and multi-temporal analysis, hyperspectral experiments, and other techniques for road extraction. Likewise, other approaches related in any way with the road extraction topic are also considered. Between them different papers on segmentation, vectorization, optimization, evaluation, semantic nets and neural networks, fusion techniques, fuzzy logic, and other methods are discussed. A novel classification of road extraction methods according to our criteria is included in order to provide a significant contribution to research in this topic.
Rubber tired gantry crane deployment for container yard operation
Authors: Richard Linn, Ji-yin Liu, Yat-wah Wan, Chuqian Zhang, Katta G. Murty
Venue: Computers and Industrial Engineering (2003)

Container terminal's competitiveness is generally measured by the vessel discharging and loading time. The shore crane operation has attracted a number of research works. However, yard operation management has been very much experience based and did not receive much attention until last decade. This paper presents an algorithm and a mathematical model for the optimal yard crane deployment. The potential of the model in optimizing yard crane deployment was tested with a set of real operation data extracted from a major container yard terminal.
Address Generation for array access based on modulus m counters
Authors: Douglas M. Grant, Peter B. Denyer
Venue: Proceedings of the conference on European design automation (1991)

The necessary task of Address Generation for RAM and ROM accesses can often result in hardware taking up an appreciable fraction of the area of a data processing IC. Close examination of the address sequences can reveal symmetry which may be exploited to automatically devise small and simple address generators, based on counters. This paper will describe automated techniques used to recognise and develop symmetries in address sequences, and to synthesise the necessary address generation hardware.