ppxscal/embedding_network huggingface dataset:
FMware: middleware for efficient filtering and matching of XML messages with local data
Authors: K. Selçuk Candan, Mehmet E. Dönderler, Yan Qi, Jaikannan Ramamoorthy, Jong W. Kim
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

XML message filtering systems are used for sifting through real-time messages to support business data mining and reporting. An XML message filtering system needs to (a) process registered filter predicates on multiple distributed real-time streams and (b) match and validate the filter results with local data to identify the relevant data that can be used for higher-level processing. Although efficient real-time filtering schemes exists, the matching phase of the operation where filter results have to be matched against local data to select those matches that are relevant to the particular task remains to be expensive as it requires expensive join operations. In this paper, we present an efficient middleware (FMware) for filtering and matching XML messages against locally available data. The proposed operator relies on a novel cluster-domain matching scheme to reduce the cost of the process. We analytically study the cost of the proposed middleware and experimentally show that it adaptively reduces the number of local data accesses and provides large savings in matching time with respect to cluster-unaware matching.
The least number of degrees of freedom for a polarization controller in each stage of PMD compensator
Authors: Xiaoguang Zhang, Gaoyan Duan, Lixia Xi
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Automatically controlled polarization controllers (PC) are essential integral parts in an automatic compensator for PMD. It is suggested by K. Karsson et al. and afterward widely believed that we need to adjust only two waveplate PC (two degrees of freedom, DOF) for each stage PMD compensator to complete PMD compensation, because it is believed that only two of degrees of freedom for each PC are needed to complete the state of polarization (SOP) transformation from any input state into any other state covering the entire Poincar&eacute; Sphere. This paper will take two types of commercial available PC as examples to show theoretically and experimentally that except for the reset-free problem it is necessary to adjust at least three instead of two waveplates in order to transform any input state into any other state covering the entire Poincar&eacute; Sphere. Therefore we can achieve complete PMD compensation at least using 3 DOF instead 2 PC in each stage PMD compensator.
Augmented Reality-based factory planning - an application tailored to industrial needs
Authors: Katharina Pentenrieder, Christian Bade, Fabian Doil, Peter Meier
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Over the past years, a variety of Augmented Reality (AR)-based applications were created, to support industrial processes. Although these first demonstrator applications or prototypes cover all parts of the industrial product process (design, planning and production, service and maintenance), only a few of them actually turned into established and applied solutions. In the automotive industry, one successful field for AR-based applications is factory design and planning. metaio and Volkswagen Group Research have concerted their research work to continuously enhance a first prototype in order to create a serviceable and accepted software tool, which is tailored to the needs of AR-based factory planning processes. This paper presents the developing process of this application, the requirements analysis and the realization as a complete system. A concrete example in industry describes the usage of the system for factory planning and an outlook on future work in this area closes the document.
Game Quantification Patterns
Authors: Dietmar Berwanger, Sophie Pinchinat
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

We analyse two basic approaches of extending classical logics with quantifiers interpreted via games: Propositional Game Logic of Parikh and Alternating-Time Temporal Logic of Alur, Henzinger, and Kupferman. Although the two approaches are historically remote and they incorporate operationally orthogonal paradigms, we trace the formalisms back to common foundations and argue that they share remarkable similarities in terms of expressive power.
Efficient online validation with delta execution
Authors: Joseph Tucek, Weiwei Xiong, Yuanyuan Zhou
Venue: ACM SIGPLAN Notices (2009)

Software systems are constantly changing. Patches to fix bugs and patches to add features are all too common. Every change risks breaking a previously working system. Hence administrators loathe change, and are willing to delay even critical security patches until after fully validating their correctness. Compared to off-line validation, on-line validation has clear advantages since it tests against real life workloads. Yet unfortunately it imposes restrictive overheads as it requires running the old and new versions side-by-side. Moreover, due to spurious differences (e.g. event timing, random number generation, and thread interleavings), it is difficult to compare the two for validation. To allow more effective on-line patch validation, we propose a new mechanism, called delta execution, that is based on the observation that most patches are small. Delta execution merges the two side-by-side executions for most of the time and splits only when necessary, such as when they access different data or execute different code. This allows us to perform on-line validation not only with lower overhead but also with greatly reduced spurious differences, allowing us to effectively validate changes. We first validate the feasibility of our idea by studying the characteristics of 240 patches from 4 server programs; our examination shows that 77% of the changes should not be expected to cause large changes and are thereby feasible for Delta execution. We then implemented Delta execution using dynamic instrumentation. Using real world patches from 7 server applications and 3 other programs, we compared our implementation of Delta execution against a traditional side-by-side on-line validation. Delta execution outperformed traditional validation by up to 128%; further, for 3 of the changes, spurious differences caused the traditional validation to fail completely while Delta execution succeeded. This demonstrates that Delta execution can allow administrators to use on-line validation to confidently ensure the correctness of the changes they apply.
An adaptive context aware communication system for ubiquitous environment based on overlay network
Authors: Debasish Chakraborty, Hideyuki Takahashi, Takuo Suganuma, Atsushi Takeda, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

As more and more people living by their own, the importance to remote monitoring is becoming essential for looking after them. But protecting personal privacy is going to be a prime concern as patient's data should be available irrespective of their location, but only to the authorized person. We need to consider the social relationship between the monitored person and those who are responsible for taking care for that person. At the same time quality and reliability of transferring data is also important depending on the content of the data and the recipient. In this paper we propose a system where an overlay network will be built in an ad hoc basis and links between different entities will be established according to the social relationship between the person under observation and the people at the other end and the situation of the observed person. The connected links will provide reliability, quality and other required characteristics according to the requirements specified by the members involved. For efficient cost and resource utilization, an on-demand network connection is considered for our proposed context aware ubiquitous healthcare system.
Control and Freedom: Power and Paranoia in the Age of Fiber Optics
Authors: Wendy Hui Kyong Chun
Venue:  (2008)

How has the Internet, a medium that thrives on control, been accepted as a medium of freedom? Why is freedom increasingly indistinguishable from paranoid control? In Control and Freedom, Wendy Hui Kyong Chun explores the current political and technological coupling of freedom with control by tracing the emergence of the Internet as a mass medium. The parallel (and paranoid) myths of the Internet as total freedom/total control, she says, stem from our reduction of political problems into technological ones.Drawing on the theories of Gilles Deleuze and Michel Foucault and analyzing such phenomena as Webcams and face-recognition technology, Chun argues that the relationship between control and freedom in networked contact is experienced and negotiated through sexuality and race. She traces the desire for cyberspace to cyberpunk fiction and maps the transformation of public/private into open/closed. Analyzing "pornocracy," she contends that it was through cyberporn and the government's attempts to regulate it that the Internet became a marketplace of ideas and commodities. Chun describes the way Internet promoters conflated technological empowerment with racial empowerment and, through close examinations of William Gibson's Neuromancer and Mamoru Oshii's Ghost in the Shell, she analyzes the management of interactivity in narratives of cyberspace.The Internet's potential for democracy stems not from illusory promises of individual empowerment, Chun argues, but rather from the ways in which it exposes us to others (and to other machines) in ways we cannot control. Using fiber optic networkslight coursing through glass tubesas metaphor and reality, Control and Freedom engages the rich philosophical tradition of light as a figure for knowledge, clarification, surveillance, and discipline, in order to argue that fiber-optic networks physically instantiate, and thus shatter, enlightenment.
Acm education board and masters level programs
Authors: Gordon Davies, Lillian N. Cassel, Arthur Pyster, Michael Caspersen, Heikki Topi
Venue: ACM SIGCSE Bulletin (2009)

This special session will proved information about the status of work related to Masters programs in Computing. Specifically, the session will describe work completed in the following areas: the categorization of masters programs in computing, the development of curriculum recommendations for masters programs in software engineering, the collaborative work with the Association for Information Systems on the Masters program in Information Systems
Network calculus: what it can do for you and where it needs your help
Authors: Jens B. Schmitt
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

In this talk, the theory of network calculus is discussed from the point of view: (1) how powerful it is in applications as well as (2) what fundamental challenges it still faces before it can be considered a similarly mature theory as the well-known classical queueing theory. To this end, we briefly review the basic concepts and mathematical foundations of network calculus, before we then show its applicability for the example of wireless sensor networks. The latter work culminated in the so-called sensor network calculus which is a customized and adequately extended set of methods based on the fundamental network calculus results enriched by the requirements stemming from the specific nature of wireless sensor networks. The lessons learned from this exercise are: on the one hand, network calculus provides already a rich and useful set of methods, but on the other hand, substantial work was still necessary to apply it to the particular context of wireless sensor networks (and to some degree still remains). Hence, in the second part of this talk, we outline some of the fundamental open issues with respect to the foundations of network calculus. We discuss current efforts to address these, although some of them are still completely open and thus constitute good opportunities for future research.
CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES
Authors: Matthias Dehmer, Stephan Borgert
Venue: Cybernetics and Systems (2009)

The problem to characterize and investigate structured objects by using information theory is currently of considerable interest. In this article, we describe a method for characterizing structured objects representing graphs by means of information inequalities. For this, we deal with information inequalities that describe relations between information measures for graphs. Additionally, we sketch an approach for comparing such information measures qualitatively.
Human identification by gait analysis
Authors: Anuradha Annadhorai, Eric Guenterberg, Jaime Barnes, Kruthika Haraga, Roozbeh Jafari
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

Human movement monitoring using wireless sensors has become an important area of research today. The use of wireless sensors in human identification is a relatively new idea with interesting applications in portable device security and user recognition. In this paper, we describe a real-time wireless sensor system based on inexpensive inertial sensors that uses gait analysis to uniquely identify subjects.
On Equalization for Direct Sequence-Ultra Wideband System Using Received Response Code Sequence
Authors: Keat Beng Toh, Shin'ichi Tachikawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper proposes a combination of novel Received Response (RR) sequence at the transmitter and Matched Filter-Equalizer-RAKE (MF-EQZ-RAKE) combining scheme receiver system for Direct Sequence-Ultra Wideband (DS-UWB) multipath channel model. When binary code sequence such as M sequence is used, there is a possibility of generating extra Inter-Symbol Interference (ISI) in the UWB system. Therefore, it is quite a challenging task to collect the energy efficiently although RAKE reception method is applied at the receiver. The main purpose of the proposed system is to overcome the performance degradation for UWB transmission due to the occurrence of Inter-Symbol Interference (ISI) during high speed transmission of ultra short pulses in a multipath channel. The proposed system improves the system performance by improving the RAKE reception performance using RR sequence and suppressing the ISI effect with the equalizer. Simulation results verify that significant improvement can be obtained by the proposed system especially in UWB multipath channel models such as channel CM4 that suffered severe ISI effect.
Efficient Retrieval by Shape Content
Authors: Euripides G. M. Petrakis, Evangelos Milios
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We propose an approach for image similarity retrieval based on shape information. The heart of our methodology is a dynamic programming shape matching algorithm which detects similarities between shapes at various levels of shape detail (resolution). Our method provides for indexing of a data set, achieving up to three orders of magnitude speed-up over sequential scanning. We illustrate the application of our method to real two-dimensional static hand gesture data. We also demonstrate the superiority of our approach over traditional methods of shape matching and retrieval, such as Fourier descriptors, Geometric and Sequential moments.
Detecting Interesting Regions in Photographs --- How Metadata Can Help
Authors: Zhong Li, Hong Lu, Xiangyang Xue, Jianping Fan
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Photographs, which are taken by human beings with creative thinking, may significantly differ from the images that are taken by a surveillance camera or a visual sensor on a robot. Human being intentionally shoot a photograph to express his/her feeling or photo-realistically record a scene by adjusting two factors: the parameters setting of a camera and the position between the camera and the object which he or she is interested in. Based on these observations, a graph model based stochastic method is used to discover the pattern of how people taking photos, so that the interesting regions of the images can be determined automatically. Both the visual features of the images and the camera metadata parameters are simultaneously taken into considered. Experimental evaluation on over 7000+ photos taken by 200+ different models of cameras with variety of interests has shown the robustness of our techniques.
Enriching the spatial reasoning system RCC8
Authors: Ahed Alboody, Jordi Inglada, Florence Sedes
Venue: SIGSPATIAL Special (2009)

One of the necessary basic concepts for the spatial data analysis in GIS is to determine the spatial relations between arbitrary geographical objects. In a two-dimensional space (IR2), most existing topological models can distinguish the eight topological relations between two spatial regions A and B. These eight relations are written in the traditional form of the spatial reasoning system RCC8: DC, EC, EQ, PO, TPP, TPPi, NTPP and NTPPi. Because of the complexity of topological relations between geographic regions, it is difficult for these models to describe in detail the topological relations by defining the separation number of lines and points that characterize these relations, and which is very important to enrich the spatial relations of system RCC8. To overcome the insufficiency in existing models, the extension of the Intersection and Difference (ID) model has the ability to describe in detail the topological relations of system RCC8. In our study, we focus our work on the four relations EC, PO, TPP and TPPi which can be described by the boundary-boundary intersection operator &part;A&cap;&part;B. The main contributions are these four detailed relations which are written and described in the general form ECmL, nP, kR, POmL, nP, jRI, kR, TPPmLT, nPT, kR and TPPimLT, nPT, kR. Then, we develop definitions for the generalization of these detailed relations. Finally, examples are provided to illustrate the generalization of these new detailed spatial relations.
Using a OMNET++ network based simulator as test-bed for network design algorithms
Authors: Javier Diaz-Estebaranz, J. Antonio Portilla-Figueras, Sancho Salcedosanz, Miguel Faro-Rivas, Guillermo Esteve-Asensio
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The creation of algorithms for optimal network design based on some concrete parameters (traffic, link occupation, QoS) is usually bounded to some mathematical models that does not takes into account many characteristics of the real world. This simplification causes that a algorithm that mathematically may offer good performance, when is applied to a real network, it does not behaves as it was expected. The objective of this paper is the evaluation of the suitability of using OMNeT++ to create testbeds to analyse the quality of network design algorithms before applying them to a real network.
Paging with Request Sets
Authors: Leah Epstein, Rob van Stee, Tami Tamir
Venue: Theory of Computing Systems (2008)

A generalized paging problem is considered. Each request is expressed as a set of u pages. In order to satisfy the request, at least one of these pages must be in the cache. Therefore, on a page fault, the algorithm must load into the cache at least one page out of the u pages given in the request. The problem arises in systems in which requests can be serviced by various utilities (e.g., a request for a data that lies in various web-pages) and a single utility can service many requests (e.g., a web-page containing various data). The server has the freedom to select the utility that will service the next request and hopefully additional requests in the future. The case u=1 is simply the classical paging problem, which is known to be polynomially solvable. We show that for any u>1 the offline problem is NP-hard and hard to approximate if the cache size k is part of the input, but solvable in polynomial time for constant values of k. We consider mainly online algorithms, and design competitive algorithms for arbitrary values of k, u. We study in more detail the cases where u and k are small. We also give an algorithm which uses resource augmentation and which is asymptotically optimal for u=2.
Open Internet Portal for Elementary and High Schools
Authors: Radek Kuchta, Radimír Vrba, Jaroslav Kadlec, Michal Pavlík
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

This paper describes a new information portal for teachers and students from all levels of schools. There are described basic functions and main features of the portal. The portal is primary planed for sharing interesting information and examples from science. It is especially focused to technical field of knowledge.
How much is a health insurer willing to pay for colorectal cancer screening tests?
Authors: Reza Yaesoubi, Stephen D. Roberts
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Colorectal Cancer (CRC) screening tests have proven to be cost-effective in preventing cancer incidence. Yet, as recent studies have shown, CRC screening tests are noticeably underutilized. Among the factors influencing CRC screening test utilization, the role of health insurers has gained considerable attention in recent studies. In this paper, we propose an analytical model for the market of CRC screening tests and show how the insurer can benefit from a computer simulation model to cope with the problem of incomplete and asymmetric information inherent in this market. Our estimates reveal that promoting CRC screening tests is not necessarily economically attractive to the insurer, unless the insurer's valuation of life is greater than a certain limit. We use the proposed model to estimate such a threshold - the insurer's willingness-to-pay to acquire one additional life year by covering the CRC screening tests.
Fuzzy adaptive backstepping robust control for SISO nonlinear system with dynamic uncertainties
Authors: Shaocheng Tong, Yongming Li, Peng Shi
Venue: Information Sciences: an International Journal (2009)

In this paper, a fuzzy adaptive backstepping design procedure is proposed for a class of nonlinear systems with three types of uncertainties: (i) nonlinear uncertainties; (ii) unmodeled dynamics and (iii) dynamic disturbances. The fuzzy logic systems are used to approximate the nonlinear uncertainties, nonlinear damping terms are used to counteract the dynamic disturbances and fuzzy approximation errors, and a dynamic signal is introduced to dominate the unmodeled dynamics. The derived fuzzy adaptive control approach guarantees the global boundedness property for all the signals and states, and at the same time, steers the output to a small neighborhood of the origin. Simulation studies are included to illustrate the effectiveness of the proposed approach.