ppxscal/embedding_network huggingface dataset:
Glia: a practical solution for effective high datarate wifi-arrays
Authors: Sandeep Kakumanu, Raghupathy Sivakumar
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

Wi-fi standards have provisions for multiple orthogonal channels where the orthogonality allows them to be used simultaneously both in time and frequency without interference concerns. In this paper, we pose the following question: Can devices use the multiple orthogonal channels in wi-fi networks simultaneously to realize a high data-rate wireless link and hence cater to applications requiring high bandwidths? In other words, given that there are 3 orthogonal wi-fi channels in the 2.4GHz band and 12 orthogonal wi-fi channels in the 5GHz band, can a pair of devices each equipped with 15 wi-fi radios use all the available orthogonal channels to achieve a high data-rate link operating at 600Mbps? Surprisingly, we find through experimental evaluation that the actual observed performance when using all fifteen orthogonal channels between two devices is a mere 91Mbps. We identify the reasons behind the low performance and present Glia, a software only solution that effectively exercises all available radios. We prototype Glia and show using experimental evaluations that Glia helps achieve close to 600Mbps data-rate when using all possible wi-fi channels.
The Design of a Web Service of Railway Bridges Information Based on GIS
Authors: Zhan Qian, Wei Xianglong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Web services are being widely used in many fields with the high-speed development of internet. This article introduces the procedure ofthe design of a web service of railway bridges information based on GIS (Geographic informaton services ). We choose MapXtreme as the platform for publishing the web service. Firstly, we build a database for the web service. In our case, the spatial data of railway bridge information are stored in the AUTOCAD format. The first step is converting AUTOCAD format data to MapInfo format data. Then, the spatial data are connected with the database in DBMS. Last, we use MapXtreme moduleto publish the data as a web service. On the browser/server architecture, users can use mouse to click the bridge in a map and then see the attribute table besides it. Also, by inputting the querying condition into a textbox, users can get the possible location of the railway bridges.
Search Strategies To Save You Time: Learn The Rules That Will Make Your Internet Searches More Productive
Authors: Cynthia Kimball
Venue:  (2009)

Find yourself wasting your most precious resource (time) trying to find something on the internet? Search Strategies to Save You Time will show you step by step why search engines work the way they do and what you should be looking for within the results. Included also are over 100 resources to help make your search easier. After reading Search Strategies to Save You Time, you will be able to go search with confidence, knowing where to look as well as how to spot what you are looking for. 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
Automatic Generation of Processes Based on Processes Semantic for Smartflow Pattern
Authors: Lizhen Cui, Haiyang Wang
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

Web based business processes has many particular characteristics. Traditional workflow pattern is not applied in this environment. In this paper, smartflow pattern, a new business processes application pattern, is proposed. It enables automatic generation of business process based on user's requirements. An automatic generation method based on processes semantic, the key issue of smartflow pattern, is also provided. Finally, an application of smartflow pattern, the IPVita (Intelligent Platform of Virtual Travel Agency) is described.
Nonparametric linear tests with multiple events
Authors: Claire Pinçon, Odile Pons
Venue: Computational Statistics Data Analysis (2009)

A generalization of the nonparametric linear rank statistics is presented to handle the two-group comparison with multiple events. For a sample divided into two groups, in which each subject may experience at least two distinct failures, the logrank tests are extended to test the null hypothesis that the vector of the marginal survival distributions of the first group equals that of the second group. Two cases are distinguished depending on whether the null hypothesis does or does not imply the equality of the joint survival functions. In both cases, under the null hypothesis, the asymptotic joint distribution of the vector of the marginal statistics is shown to be Gaussian with covariance matrix consistently estimated using martingale properties. These theoretical results are illustrated by a simulation study and an application on the German Breast Cancer data. An extension to multiple hypotheses testing in multivariate proportional hazards models is also developed.
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
Authors: Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
Venue: IEEE Transactions on Mobile Computing (2009)

This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(\delta ) time and message complexity where \delta is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(\delta ), assuming that message delays can be bounded by an unknown constant. DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move, such as wireless mesh networks and wireless sensor networks. We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. The algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling. Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced. We further evaluate the effect of the time-varying nature of wireless links on the conflict-free property of DRAND-assigned time slots. This experiment is conducted on a 55-node testbed consisting of the more recent MicaZ sensor nodes.
Adaptive Interfaces in Driving
Authors: Rino F. Brouwer, Marieka Hoedemaeker, Mark A. Neerincx
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

The automotive domain is an excellent domain for investigating augmented cognition methods, and one of the domains that can provide the applications. We developed, applied and tested indirect (or derived) measures to estimate driver state risks, validated by direct state-sensing methods, with major European vehicle manufacturers, suppliers and research institutes in the project AIDE (Adaptive Integrated Driver-vehicle InterfacE). The project developed an interface with the driver that integrates different advanced driver assistant systems and in-vehicle information systems and adapted the interface to different driver or traffic conditions. This paper presents an overview of the AIDE project and will then focus on the adaptation aspect of AIDE. Information presented to the driver could be adapted on basis of environmental conditions (weather and traffic), and on basis of assessed workload, distraction, and physical condition of the driver. The adaptation of how information is presented to the driver or the timing of when information is presented to the driver is of importance. Adapting information, however, also results in systems that are less transparent to the driver.
The DANTE Temporal Expression Tagger
Authors: Paweł Mazur, Robert Dale
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

In this paper we present the DANTE system, a tagger for temporal expressions in English documents. DANTE performs both recognition and normalization of these expressions in accordance with the TIMEX2 annotation standard. The system is built on modular principles, with a clear separation between the recognition and normalisation components. The interface between these components is based on our novel approach to representing the local semantics of temporal expressions. DANTE has been developed in two phases: first on the basis of the TIMEX2 guidelines only, and then using the ACE 2005 development data. The system has been evaluated on the ACE 2005 and ACE 2007 data. Although this is still work in progress, we already achieve highly satisfactory results, both for the recognition of temporal expressions and their interpretation.
Capturing disjunction in lexicalization with extensible dependency grammar
Authors: Jorge Marques Pelizzoni, Maria das Graças Volpe Nunes
Venue: Proceedings of the Third Workshop on Constraints and Language Processing (2006)

In spite of its potential for bidirectionality, Extensible Dependency Grammar (XDG) has so far been used almost exclusively for parsing. This paper represents one of the first steps towards an XDG-based integrated generation architecture by tackling what is arguably the most basic among generation tasks: lexicalization. Herein we present a constraint-based account of disjunction in lexicalization, i.e. a way to enable an XDG grammar to generate all paraphrases --- along the lexicalization axis, of course --- realizing a given input semantics. Our model is (i) efficient, yielding strong propagation, (ii) modular and (iii) favourable to synergy inasmuch as it allows collaboration between modules, notably semantics and syntax. We focus on constraints ensuring well-formedness and completeness and avoiding over-redundancy.
High Speed Ethernet Interface between TE and MT in 3GPP LTE Network
Authors: Yong-Soo Baek, Sung-Gi Min, Hyun-Gu Lee
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

Data rates in 3GPP LTE supports 100Mbps in the downlink and 50Mbps in the uplink. Currently, almost all manufactured MTs uses HDLC_PPP to make connections between TE and MT. However HDLC_PPP uses byte stuffing for HDLC framing. As the communication speed is increased dramatically between TE and MT, byte stuffing seriously limits communication speed. As the connection methods between TE and MT and between MT and RN Care different, HDLC_PPP used between TE and MT can be replaced by other method without affecting the wireless interface. We propose an Ethernet interface instead of HDLC_PPP interface. The Ethernet-based interface provides higher data throughput than that of HDLC_PPP. The test result shows that data throughputs of HDLC_PPP over USB, pure Ethernet, and Ethernet over USB are 18Mbps,95Mbps, and 68Mbps respectively.
An Attacker-Defender Game for Honeynets
Authors: Jin-Yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

A honeynet is a portion of routed but otherwise unused address space that is instrumented for network traffic monitoring. It is an invaluable tool for understanding unwanted Internet traffic and malicious attacks. We formalize the problem of defending honeynets from systematic mapping (a serious threat to their viability) as a simple two-person game. The objective of the Attacker is to identify a honeynet with a minimum number of probes. The objective of the Defender is to maintain a honeynet for as long as possible before moving it to a new location within a larger address space. Using this game theoretic framework, we describe and prove optimal or near-optimal strategies for both Attacker and Defender. This is the first mathematically rigorous study of this increasingly important problem on honeynet defense. Our theoretical ideas provide the first formalism of the honeynet monitoring problem, illustrate the viability of network address shuffling, and inform the design of next generation honeynet defense.
Architecture of Behavior-Based Function Approximator for Adaptive Control
Authors: Hassab Elgawi Osman
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper proposes the use of behavior-based control architecture and investigates on some techniques inspired by Nature- a combination of reinforcement and supervised learning algorithms to accomplish the sub-goals of a mission of building adaptive controller. The approach iteratively improves its control strategies by exploiting only relevant parts of action and is able to learn completely in on-line mode. To illustrate this, it has been applied to non-linear, non-stationary control task: Cart-Pole balancing. The results demonstrate that our hybrid approach is adaptable and can significantly improve the performance of TD methods while speed up learning process. 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
Kinetic User Interface: Interaction through Motion for Pervasive Computing Systems
Authors: Pascal Bruegger, Béat Hirsbrunner
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

We present in this paper a semantic model for the conception of pervasive computing systems based on object or user's motions. We describe a system made of moving entities, observers and views. More specifically, we focus on the tracking of implicit interaction between entities and their environment. We integrate the user's motion as primary input modality as well as the contexts in which the interaction takes place. We have combined the user activities with contexts to create situations. We illustrate this new concept of motion-awareness with examples of applications built on this model.
Merging Logic Programs under Answer Set Semantics
Authors: James Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P 1, ..., P n , the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. The first informally selects those models of the programs that vary the least from the models of the other programs. The second approach informally selects those models of a program P 0 that are closest to the models of programs P 1, ..., P n . P 0 can be thought of as analogous to a set of database integrity constraints. We examine formal properties of these operators and give encodings for computing the mergings of a multiset of logic programs within the same logic programming framework. As a by-product, we provide a complexity analysis revealing that our operators do not increase the complexity of the base formalism.
Wavelet estimation of pulse rate variability from oscillometric blood pressure measurements
Authors: Saif Ahmad, Miodrag Bolic, Hilmi Dajani, Voicu Groza
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

We propose a wavelet-based spectral density estimation method for characterizing pulse rate variability of short duration oscillometric blood pressure signals produced by a digital blood pressure monitor during routine measurements. To validate our wavelet metric we compare its performance with other techniques by studying correlations of pulse rate variability with age and mean arterial pressure. Our results indicate that the proposed wavelet metric offers a superior and accurate characterization of variability of short duration oscillometric blood pressure signals.
Optimization for the Storage Management and Job Scheduling Based on Expert System
Authors: Zeng Mingru, Zong Huliang, Han Wei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

To improve the efficiency of automated storage and retrieval system, expert systems will be used in automated storage and retrieval system use management and job scheduling optimization. By analyzing the experience of experts in the field based on the knowledge base of production rules, the application of forward inference engine designed the flow of reasoning. The experimental results show that, in the automated storage and retrieval system, the use of expert systems cargo space management and job scheduling optimization, can effectively improve the operation of automated storage and retrieval system efficiency.
Cellular neural networks for NP-hard optimization
Authors: Mária Ercsey-Ravasz, Tamás Roska, Zoltán Néda
Venue: EURASIP Journal on Advances in Signal Processing (2009)

A cellular neural/nonlinear network (CNN) is used for NP-hard optimization. We prove that a CNN in which the parameters of all cells can be separately controlled is the analog correspondent of a two-dimensional Ising-type (Edwards-Anderson) spin-glass system. Using the properties of CNN, we show that one single operation (template) always yields a localminimum of the spin-glass energy function. This way, a very fast optimization method, similar to simulated annealing, can be built. Estimating the simulation time needed on CNN-based computers, and comparing it with the time needed on normal digital computers using the simulated annealing algorithm, the results are astonishing. CNN computers could be faster than digital computers already at 10 × 10 lattice sizes. The local control of the template parameters was already partially realized on some of the hardwares, we think this study could further motivate their development in this direction.
Wireless Sensor Networks Topology Algorithm Based on Immune Principle
Authors: Tao Liu, Yan Zhou, Jie Chen, Zhijie Wang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Wireless Sensor Networks (WSNs) is the next generation of sensor network and the research of network topology optimization has the important meaning for present and future. By making full use of the information about the node position and energy, the WSNs topology algorithm based on immune principle is proposed in this paper, and the simulation results show that this algorithm improves the performance and efficiently delay the occurrence time of dead nodes, and effective prolongs the network lifetime.
The Stanford typed dependencies representation
Authors: Marie-Catherine de Marneffe, Christopher D. Manning
Venue: Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation (2008)

This paper examines the Stanford typed dependencies representation, which was designed to provide a straightforward description of grammatical relations for any user who could benefit from automatic text understanding. For such purposes, we argue that dependency schemes must follow a simple design and provide semantically contentful information, as well as offer an automatic procedure to extract the relations. We consider the underlying design principles of the Stanford scheme from this perspective, and compare it to the GR and PARC representations. Finally, we address the question of the suitability of the Stanford scheme for parser evaluation.
A (Timed) State-Transition Semantics for Reflective Petri Nets
Authors: Lorenzo Capra
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The design of dynamic (adaptable) discrete-eventsystems calls for adequate modeling formalisms and tools able to manage possible changes occurring during system’s lifecycle.A common approach is to pollute design with details that do not regard the current system behavior, rather its evolution. That hampers analysis, reuse and maintenance in general. A Petri net-based reflective model (based on classical Petri nets) was recently proposed to support dynamic discrete-event system’s design, and was applied to dynamic workflow’s management.Behind there is the idea that keeping functional aspects separated from evolutionary ones, and applying evolution to the (current) system only when necessary, results in a simple formal model on which the ability of verifying properties typical of Petri nets is preserved. On the perspective of implementing in the shorttime a discrete-event simulation engine, Reflective Petri nets are provided in this paper with a timed state-transition graph semantics, defined in terms of a Markov process.
Computationally efficient scale covariant time-frequency distributions
Authors: Selin Aviyente
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Scale is a physical attribute of a signal which occurs in many natural settings. Time-frequency distributions (TFDs) belonging to Cohen's class are invariant to time and frequency shifts, but are not necessarily covariant to the time scalings of the signal. Conditions on the time-frequency kernel for yielding a scale covariant distribution have been previously derived (Cohen, 1995). In this paper, a new class of computationally efficient scale covariant distributions is introduced. These distributions are constructed using the eigendecomposition of time-frequency kernels (Burrus et al., 1997). The performance of this new class of distributions is illustrated with examples and is compared to conventional scale covariant distributions.
Abstract Counterexamples for Non-disjunctive Abstractions
Authors: Kenneth L. Mcmillan, Lenore D. Zuck
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

Counterexample-guided abstraction refinement (CEGAR) is an important method for tuning abstractions to properties to be verified. The method is commonly used, for example in selecting predicates for predicate abstraction. To date, however, it has been applied primarily to powerset abstractions, which allow one to speak of an abstract transition system and abstract states. Here, we describe a general framework for CEGAR in non-disjunctive abstractions by introducing a generalized notion of abstract counterexample, and methods for computing such counterexamples. We apply this framework to Indexed Predicate Abstraction (IPA), a promising technique for synthesizing quantified inductive invariants of infinite-state systems. In principle, it can be applied to other non-disjunctive abstractions occurring in program analysis.