ppxscal/embedding_network huggingface dataset:
Guarding a terrain by two watchtowers
Authors: Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon Ntafos, Binhai Zhu
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

Given a polyhedral terrain T with n vertices, the two-watchtower problem for T calls for finding two vertical segments, called watchtowers, of smallest common height, whose bottom endpoints (bases) lie on T, and whose top endpoints guard T, in the sense that each point on T is visible from at least one of them. In this paper we present the following results for the two-watchtower problem in R2 and R3: (1) We show that the discrete two-watchtowers problem in R2, where the bases are constrained to lie at vertices of T, can be solved in O(n2 log4n) time, significantly improving previous solutions. The algorithm works, without increasing its asymptotic running time, even if, one of the towers is allowed to be placed anywhere on T. (2) We show that the continuous two-watchtower problem in R2, where the bases can lie anywhere on T, can be solved in O(n3α(n)log3n) time, again significantly improving previous results. (3) Still in R2, we show that the continuous version of the problem of guarding a finite set P ⊂ T of m points by two watchtowers of smallest height can be solved in O(mn log4n) time. (4) The discrete version of the two-watchtower problem in R3 can be solved in O(n11/3 polylog(n)) time; this is the first nontrivial result for this problem in R3.
Corpora and data preparation
Authors: Lynn Carlson, Boyan Onyshkevych, Mary Ellen Okurowski
Venue: Proceedings of the 5th conference on Message understanding (1993)

The data selection and data preparation efforts which led to the TIPSTER and Fifth Message Understanding Conference (MUC-5) evaluation corpora involved substantial effort, time and resources. The Government commitment to these selection and preparation efforts stems from four TIPSTER Program objectives: (1) to provide training data that would promote the development of information extraction technology, (2) to provide accurate test data to evaluate and baseline system performance in an objective manner, (3) to provide a baseline for human performance to understand and interpret machine performance, and (4) to support the larger Natural Language Processing community by making available a unique set of texts and templates in multiple domains and languages under ARPA support. This commitment was demonstrated through the managerial, technical, and administrative support to these efforts from various Government agencies, as well as through the contractual efforts with the Institute for Defense Analyses for data preparation and New Mexico State University for software tool development.
Quantifying Error in Dynamic Power Estimation of CMOS Circuits
Authors: Puneet Gupta, Andrew B. Kahng, Swamy Muddu
Venue: Analog Integrated Circuits and Signal Processing (2005)

Conventional power estimation techniques are prone to many sources of error. With increasing dominance of coupling capacitances, capacitive coupling potentially contributes significantly to power consumption in the deep sub-micron regimes. We analyze potential sources of inaccuracy in power estimation, focusing on those due to coupling. Our results suggest that traditional power estimates can be off by as much as 50%.
Dynamic resource scheduling (DRS): a multimedia QoS framework for W-CDMA: Research Articles
Authors: Özgür Gürbüz, Henry Owen
Venue: Wireless Communications Mobile Computing (2004)

Multi-media support is an important feature of third generation (3G) wireless communication systems, and Quality of Service (QoS) is a crucial issue, as in any other networking environment. In this paper, the QoS issues in the wireless last-mile is investigated for 3G systems based on Wideband-Code division multiple access (W-CDMA). Supporting multiple rates in the CDMA environment introduces the power assignment problem, which is coupled with the bandwidth and error QoS parameters. Also, multi-media traffic flows should be classified and serviced in such a way to provision delay guarantees. In this paper, a new framework, namely dynamic resource scheduling (DRS), is described and extensively studied. In order to serve multi-media services with different requirements, a family of nine algorithms has been developed within the DRS framework. These algorithms can be categorized with respect to single or prioritized queuing architectures, fixed or variable rate bandwidth and power allocation, and variable spreading gain or multi-code spreading strategies. The paper presents the performance of the DRS algorithms in comparison with each other and with conventional scheduled-CDMA (S-CDMA) and proposed schemes in the W-CDMA standard. The performance for error and throughput QoS provisioning and power control dynamics are explored; advantages, disadvantages and limitations of the algorithms are discussed. The DRS framework is concluded to be a promising QoS architecture, with a simple, flexible, scalable structure that can be configured according to a given traffic scenario. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Interactive web-wrapper construction for extracting relational information from web documents
Authors: Tsuyoshi Sugibuchi, Yuzuru Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we propose a new user interface to interactively specify Web wrappers to extract relational information from Web documents. In this study, we focused on improving user's trial-and-error repetitions for constructing a wrapper. Our approach is a combination of a light-weight wrapper construction method and the dynamic previewing interface which quickly previews how generated wrapper works. We adopted a simple algorithm which can construct a Web wrapper from given extraction examples in less than 100 milliseconds. By using the algorithm, our system dynamically generates a new wrapper from a stream of user's mouse events for specifying extraction examples, and immediately updates a preview result that shows how the generated wrapper extracts HTML nodes from a source Web document. Through this animated display, a user can make a lot of wrapper construction trials with various different combinations of extraction examples by only moving a mouse on the Web document, and reach a good set of examples to obtain an intended wrapper in a short time.
Segment-Based Hand Pose Estimation
Authors: Christopher Schwarz, Niels da Vitoria Lobo
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

The work presented here solves two major problems of hand pose recognition: (A) determining what pose is shown in a given, input picture and (B) detecting the presence of a known input pose in a given input video. It builds on the earlier work of Athitsos and Sclaroff toward solving Problem A. Because that method relies upon lines found in the input data and requires computer-generated database models, it is unsuitable for the later, video problem. Our reworking of this framework uses different, region-based information to allow video frames to be used as the "database" in which to look for the test pose. It returns database images of hands in the same configuration as a query image by using a series of steps based on the number and direction of visible finger protrusions, Chamfer distance, orientation histograms, and a competitive, comparison-based matching of each visible finger segment. Detailed result data demonstrates the system's feasibility and potential.
XML Schema Re-Engineering Using a Conceptual Schema Approach
Authors: Oviliani Yenty Yuliana, Suphamit Chittayasothorn
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

At present, the eXtensible Markup Language (XML) is popular for both data presentation and data transfer activities. XML Documents follow XML Schemas. It is possible to use them as database schemas and databases. An XML Schema can be hierarchical or flat. The hierarchical one is normally used for data presentation and the flat one is for data transfer. This research project emphasizes on the data transfer application of XML. The objective of the project is to develop a technique to reengineer poorly designed XML Schemas into the normalized ones. A software tool is developed. The tool accepts wellformatted XML Schemas and well-formatted and validated XML Documents as data sources. They are reengineered into the optimal normal form schemas which guarantee not to have redundancies. The Nijssen's Information Analysis Methodology (NIAM) is used as the conceptual schema model of XML databases.
Actions Sketch: A Novel Action Representation
Authors: Alper Yilmaz, Mubarak Shah
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper, we propose to model an action based on both the shape and the motion of the performing object. When the object performs an action in 3D, the points on the outer boundary of the object are projected as 2D (x, y) contour in the image plane. A sequence of such 2D contours with respect to time generates a spatiotemporal volume (STV) in (x, y, t), which can be treated as 3D object in the (x, y, t) space. We analyze STV by using the differential geometric surface properties to identify action descriptors capturing both spatial and temporal properties. A set of action descriptors is called an action sketch. The first step in our approach is to generate STV by solving the point correspondence problem between consecutive frames. The correspondences are determined using a two-step graph theoretical approach. After the STV is generated, actions descriptors are computed by analyzing the differential geometric properties of STV. Finally, using these descriptors, we perform action recognition, which is also formulated as graph theoretical problem. Several experimental results are presented to demonstrate our approach.
Educational Tool for Nanophysics Using Multisensory Rendering
Authors: F. Marchi, D. Urma, S. Marliere, J. L. Florens, A. Besancon, J. Chevrier, A. Luciani
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The presentation and the evaluation of an educational tool based on a haptic interface used to teach physical phenomena at a nanometer scale are the central objectives of the present work. This haptic interface has also allowed characterising non-conventional samples illustrated through an experience when students shake the Drosophilae leg.
Automated semantic web services orchestration via concept covering
Authors: T. Di Noia, E. Di Sciascio, F. M. Donini, A. Ragone, S. Colucci
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorithm for semantic based automated Web service orchestration, fully compliant with Semantic Web technologies. We show the proposed approach is able to deal with not exact solutions, computing an approximate orchestration with respect to an agent request modeled a subset of OWL-DL.
Haptic Feedback Using an Efficient Superquadric Based Collision Detection Method
Authors: K. Moustakas, G. Nikolakis, D. Koutsonanos, D. Tzovaras, M. G. Strintzis
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The present paper proposes an efficient collision detection algorithm suitable for use in haptic applications. The method exploits the fact that the virtual hand can be modelled once using superquadrics and then be used in a variety of applications. The proposed scheme is seen to be much faster and realistic when compared to standard mesh-based approaches.
Performance of TCP congestion control with explicit rate feedback
Authors: Aditya Karnik, Anurag Kumar
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

We consider a modification of TCP congestion control in which the congestion window is adapted to explicit bottleneck rate feedback; we call this RATCP (Rate Adaptive TCP). Our goal in this paper is to study and compare the performance of RATCP and TCP in various network scenarios with a view to understanding the possibilities and limits of providing better feedback to TCP than just implicit feedback via packet loss. To understand the dynamics of rate feedback and window control, we develop and analyze a model for a long-lived RATCP (and TCP) session that gets a time-varying rate on a bottleneck link. We also conduct experiments on a Linux based test-bed to study issues such as fairness, random losses, and randomly arriving short file transfers. We find that the analysis matches well with the results from the test-bed. For large file transfers, under low background load, ideal fair rate feedback improves the performance of TCP by 15%-20%. For small randomly arriving file transfers, though RATCP performs only slightly better than TCP it reduces losses and variability of throughputs across sessions. RATCP distinguishes between congestion and corruption losses, and ensures fairness for sessions with different round trip times sharing the bottleneck link. We believe that rate feedback mechanisms can be implemented using distributed flow control and recently proposed REM in which case, ECN bit itself can be used to provide the rate feedback.
Global attractivity of positive periodic solutions for an impulsive delay periodic model of respiratory dynamics
Authors: Wan-Tong Li, Hai-Feng Huo
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper we shall consider the following nonlinear impulsive delay differential equation x'(t)+αV(t)x(t)xn(t-mω)/θn+xn(t-mω) = λ(t), a.e. t > 0, t ≠ tk x(tk+) = 1/(1 + bk) x(tk), k = 1,2,..., where m and n are positive integers, V(t) and λ(t) are positive periodic continuous functions with period ω > 0. In the nondelay case (m = 0), we show that the above equation has a unique positive periodic solution x*(t) which is globally asymptotically stable. In the delay case, we present sufficient conditions for the global attractivity of x*(t). Our results imply that under the appropriate periodic impulsive perturbations, the impulsive delay equation shown above preserves the original periodic property of the nonimpulsive delay equation. In particular, our work extends and improves some known results.
Parallel Lattice Implementation for Option Pricing under Mixed State-Dependent Volatility Models
Authors: Giuseppe Campolieti, Roman Makarov
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

With the principal goal of developing an alternative, relatively simple and tractable pricing framework for accurately reproducing a market implied volatility surface, this paper presents two new asset price return models for option pricing and calibration. We consider a class of hidden Markov models based on Markov switching and a mixture model that embeds two diffusion processes whereby the underlying asset price dynamics obeys a mixed state-dependent non-linear volatility model. In particular, we study the so-called two-state mixture CEV diffusion model. Among possible nonlinear mixed state-dependent models, this proposed model offers a good balance between computational tractability and multiple parameter flexibility in the calibration process. The model also captures most of the empirical features such as leptokurtosis and volatility clustering of asset price returns. We present efficient higher order multinomial lattice methods for calibrating our model and for pricing European and American style equity options. Finally, we discuss two parallel algorithms for implementing the lattice methods: the shared memory and distributed memory algorithms.
Introducing the puLSE approach to an embedded system population at testo AG
Authors: Klaus Schmid, Isabel John, Ronny Kolb, Gerald Meier
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Over the last few years, product line engineering has become a major theme in software engineering research, and is increasingly becoming a central topic of software engineering practice in the embedded domain.Migrating towards a product line approach is not an easy feat. It is even less so, if it is done under tight technology constraints in an embedded environment. It becomes even more difficult if the transition directly aims at integrating two product families into a single product population. In this paper, we discuss our experiences with a project where we successfully dealt with these difficulties and achieved a successful product line transition. In our paper we strongly emphasize the role of technology transfer, as many facets of product line know-how had to be transferred to guarantee a complete transition to product line engineering. From the experiences of this project many lessons learned can be deduced, which can be transferred to different environments.
Learning classifier systems and evolutionary robotics
Authors: Noah W. Smith
Venue: Journal of Computing Sciences in Colleges (2005)

My research has been in the domain of mobile robots with Learning Classifier System (LCS) controllers. LCSs[1] utilize reinforcement learning and a genetic algorithm to evolve a set of condition-action rules, or classifiers. If a particular condition matches the state of the environment, then the action is executed. In a robot system, sensors monitor the environment, while actions commonly correspond to wheel velocities. Rule sets are initialized with random elements, and, in a process mimicking natural selection, the best sets are carried forward to the next generation. Genetic operators, such as crossover and mutation, create changes within the rule sets, creating a dynamic learning system. To test our LCS implementation we conducted several experiments in the pursuit domain.
Review of "Selected Papers in Discrete Mathematics by D. Knuth", CSLI (Center for the Study of Language and Information Publication) paperback, $72.00
Authors: Carlos A. S. Oliveira
Venue: ACM SIGACT News (2004)

The book "Selected Papers in Discrete Mathematics" is a compilation of work published (plus some unpublished papers) by Donald E. Knuth, in the area of discrete mathematics. Clearly, the author does not need any introduction, and is well known by his authoritative work in areas such analysis of algorithms and digital typography. However, more than this, Knuth is a great example of good expositor and writer. Thus, even if your interests are not directly related to the more mathematical areas of computer science, it is greatly rewarding to read this book as a way of learning how to write good papers.
Simple and optimal output-sensitive construction of contour trees using monotone paths
Authors: Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
Venue: Computational Geometry: Theory and Applications (2005)

Contour trees are used when high-dimensional data are preprocessed for efficient extraction of isocontours for the purpose of visualization. So far, efficient algorithms for contour trees are based on processing the data in sorted order. We present a new algorithm that avoids sorting of the whole dataset, but sorts only a subset of so-called component-critical points. They form only a small fraction of the vertices in the dataset, for typical data that arise in practice. The algorithm is simple, achieves the optimal output-sensitive bound in running time, and works in any dimension. Our experiments show that the algorithm compares favorably with the previous best algorithm.
Evaluation and Analysis of the Sliding-Window Parallel Packet Switch
Authors: Chia-Lung Liu, Woei Lin, Chin-Chi Wu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method under bursty data traffic. The PPS comprises multiple packet switches operating independently and in parallel. The typical PPS dispatch algorithm uses a round-robin method (RR) [1]. The class of PPS is characterized by deployment of parallel center-stage switches that oil memory buffers run slower than the external line rate. A novel SW packet switching method for PPS, called SW-PPS, is proposed. Under identical bursty data traffic,the SW-PPS provided improved performance when compared to RR-PPS. A mathematical, analytical model for SW-PPS is proposed. In addition, a novel bursty data traffic model is proposed: a packet-based bursty data traffic model. This packet-based bursty data traffic model can emulate more realistic network, and thus, produces more realistic simulation results.
Novel view synthesis using a translating camera
Authors: Geetika Sharma, Ankita Kumar, Shakti Kamal, Santanu Chaudhury, J. B. Srivastava
Venue: Pattern Recognition Letters (2005)

This paper addresses the problem of synthesizing novel views of a scene using images taken by an uncalibrated translating camera. We propose a method for synthesis of views corresponding to translational motion of the camera. Our scheme can handle occlusions and changes in visibility in the synthesized views. We give a characterisation of the viewpoints corresponding to which views can be synthesized. Experimental results have established the validity and effectiveness of the method. Our synthesis scheme can also be used to detect translational pan motion of the camera in a given video sequence. We have also presented experimental results to illustrate this feature of our scheme.
Providing information to the users of public transportation by combining Wi-Fi network and satellite communications
Authors: Christophe Gransart, Sébastien Ambellouis, Jean Rioult
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

In this article, we present the results of a research project aiming at providing information in real time to the users of public transportation. We show that new innovating services can be developed and can offer an access, with a good quality of service (with an average or big bandwidth), to information, multi-media contents and databases. This project merges innovating technologies to transmit information: Wi-Fi network inside of the buses and satellite communications to update on board information. This article describes the software choices and indicates the future improvements for the system.
Zonal Rumor Routing for Wireless Sensor Networks
Authors: Tarun Banka, Gagan Tandon, Anura P. Jayasumana
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Routing algorithms for wireless sensor networks are constrained by power, memory and computational resources. Rumor Routing algorithm for sensor networks spreads theinformation of an event to other nodes in the network, thus enabling queries to discover paths to the events. Zonal Rumor Routing (ZRR) is an extension to the Rumor Routing algorithm. ZRR algorithm enables the rumors to spread to a larger part of the network with high energy efficiency by partitioning the network into zones. New algorithm improves the percentagequery delivery and requires fewer transmissions, thus reducing the total energy consumption in a sensor network. Rumor Routing can be considered as a special case of ZRR when onlyone node belongs to one zone. The performance of ZRR, the effect of zone size, and the scalability of the algorithm are evaluated using simulations.