ppxscal/embedding_network huggingface dataset:
Mobility Control for Complete Coverage in Wireless Sensor Networks
Authors: Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In this paper, we propose a new control method to cover the "holes" in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are disabled from the collaboration due to their failures and misbehavior. These holes may occur dynamically, and such a problem cannot be solved completely by simply deploying more redundant sensors. With a synchronization around each hole using the directed Hamilton cycle, one (and only one) snake-like cascading replacement process will be initiated in the local area in order to fill in that vacant area with a spare node. In this way, network connectivity and coverage can be guaranteed. Our analytical and experimental results show substantial improvements of such a replacement compared with the best result known to date.
Sliding-Windows for Rapid Object Class Localization: A Parallel Technique
Authors: Christian Wojek, Gyuri Dorkó, André Schulz, Bernt Schiele
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

This paper presents a fast object class localization framework implemented on a data parallel architecture currently available in recent computers. Our case study, the implementation of Histograms of Oriented Gradients (HOG) descriptors, shows that just by using this recent programming model we can easily speed up an original CPU-only implementation by a factor of 34, making it unnecessary to use early rejection cascades that sacrifice classification performance, even in real-time conditions. Using recent techniques to program the Graphics Processing Unit (GPU) allow our method to scale up to the latest, as well as to future improvements of the hardware.
Properties Complementary to Program Self-reference
Authors: John Case, Samuel E. Moelius,  Iii
Venue: Proceedings of the 32nd international symposium on Mathematical Foundations of Computer Science 2007 (2007)

In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene's Recursion Theorem (krt). In a programming system in which krt holds, for any preassigned, algorithmic task, there exists a program that, in a sense, creates a copy of itself, and then performs that task on the self-copy. Herein, properties complementary to krt are considered. Of particular interest are those properties involving the implementation of control structures. One main result is that no property involving the implementation of denotational control structures is complementary to krt. This is in contrast to a result of Royer, which showed that implementation of if-then-else -- a denotational control structure -- is complementary to the constructive form of Kleene's Recursion Theorem. Examples of non-denotational control structures whose implementation is complementary to krt are then given. Some such control structures so nearly resemble denotational control structures that they might be called quasi-denotational.
Aromaticity in alkali metal clusters: Role of the metalloligand and the size of the metal ion
Authors: Snehadrinarayan Khatua, Debesh R. Roy, Manish Bhattacharjee, Pratim K. Chattaraj
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

A new polydentate fac-trioxo molybdenum complex, [MoO$_{3}$L]$^{2-}$ {L=iminodiacetate} has been synthesized by the reaction of sodium molybdate and iminodiacetic acid. The dinegative complex anion acts as a ligand towards alkali metal cations, Na$^{+}$. The sodium complex, [Na$_{2}$MoO$_{3}$L(H$_{2}$O)$_{2}$]$_{n}$ (1) is a 3D hereto bimetallic coordination polymer, containing a unique hexagonal 1D sodium cluster chain. The DFT calculations on hexagonal sodium cluster show that, the (Na$_{6)$ rings in the chain are highly aromatic in character and the NICS (0) values of the Na$_{6}$ rings are almost same as their polyacene analogues. The stability and reactivity pattern of the Na$_{6}$ rings also follow the same pattern as their organic analogues. Related analysis on Li-cluster is also accomplished. A theoretical investigation based on DFT is performed to find out the possible stable structures of Li$_{6}$, Na$_{6}$, K$_{6}$, Li$_{3}$Na$_{3}$ and Na$_{3}$K$_{3}$ molecules and a common D$_{3h}$ symmetric structure is found. Also the reactions between Li$_{6}$ and Na$_{6}$ as well as Na$_{6}$ and K$_{6}$ are found to be thermodynamically favourable. Importance of the presence of the metalloligand in inducting the aromatic behaviour is highlighted.
Novel Neuronal Activation Functions for Feedforward Neural Networks
Authors: Mehmet Önder Efe
Venue: Neural Processing Letters (2008)

Feedforward neural network structures have extensively been considered in the literature. In a significant volume of research and development studies hyperbolic tangent type of a neuronal nonlinearity has been utilized. This paper dwells on the widely used neuronal activation functions as well as two new ones composed of sines and cosines, and a sinc function characterizing the firing of a neuron. The viewpoint here is to consider the hidden layer(s) as transforming blocks composed of nonlinear basis functions, which may assume different forms. This paper considers 8 different activation functions which are differentiable and utilizes Levenberg-Marquardt algorithm for parameter tuning purposes. The studies carried out have a guiding quality based on empirical results on several training data sets.
Unveiling Experts Perceptions towards the Characteristics and Value Propositions of Mobile Information Systems
Authors: Hartmut Hoehle, Eusebio Scornavacca
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Despite the large body of research on mobile information systems only few empirical studies have been undertaken exploring its characteristics and value propositions. In order to provide an initial point of discussion for theory development in this area, this paper investigates industry experts’ perceptions towards the characteristics and value propositions of mobile information systems. The findings illustrate similarities and discrepancies between the current literature and the participants' perceptions. The paper concludes with a summary of the findings and recommendations for future research.
Automatic Generation of Conversational Behavior for Multiple Embodied Virtual Characters: The Rules and Models behind Our System
Authors: Werner Breitfuss, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper we presented the rules and algorithms we use to automatically generate non-verbal behavior like gestures and gaze for two embodied virtual agents. They allow us to transform a dialogue in text format into an agent behavior script enriched by eye gaze and conversational gesture behavior. The agents' gaze behavior is informed by theories of human face-to-face gaze behavior. Gestures are generated based on the analysis of linguistic and contextual information of the input text. Since all behaviors are generated automatically, our system offers content creators a convenient method to compose multimodal presentations, a task that would otherwise be very cumbersome and time consuming.
Detecting Shrew HTTP Flood Attacks for Flash Crowds
Authors: Yi Xie, Shun-Zheng Yu
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Countering network attacks is becoming ever more challenging. Web-based vulnerabilities represent a substantial portion of the security exposures of computer networks. In order to detect a new Web-based assault named shrew Distributed Denial of Service attacks based on HTTP flood, Principle Component Analysis and Independent Component Analysis are applied to abstract the multivariate observation vector. A novel anomaly detector based on hidden semi-Markov model is proposed. Experiment results based on real traffic trace and emulated attacks show, the scheme can be used effectively to implement the detection of the shrew HTTP flood attacks embedded in the normal flash crowd of large-scale Website; and the detection is not dependent on the intensity of attack traffic.
Developing a Security Typed Java Servlet
Authors: Doaa Hassan, Sherif El- Kassas, Ibrahim Ziedan
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

The Lack of security policy enforcement in web development languages is one of the most important challenges in web application systems development, as there is no formal check for security policy violation that may occur during web application system development. To check for policy compliance, the programmer must walk through all the code and check every line to make sure that there are no security violations. For example, a developer may develop a web application system connected to data base that seems to work properly, but it can make a certain security policy violation by permitting unauthorized users to access the data base system. This paper proposes a solution for the above problem by developing and application of a security typed Java servlet that can run on the web server side safely. This servlet is developed by embedding the Java code produced by compiling the Java information flow language (Jif) (a security-typed programming language that extends Java with support for information flow control and access control, both at compile time and at run time) into a servlet code format. The code produced by compiling Jif language is security typed and support servlet with means of flow control and access control. Hence we can guarantee that when we run this servlet into a web application system it will check input data trough the web application system for security policy violation.
Hybrid Search Algorithms for P2P Media Streaming Distribution in Ad Hoc Networks
Authors: Dong-Hong Zuo, Xu Du, Zong-Kai Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions, potential high loss rate and the decentralized architecture. To support long and high-quality streams, one viable approach is that a media stream is partitioned into segments, and then the segments are replicated in a network and served in a peer-to-peer fashion, however, the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ant-inspired search algorithm (HASA) for P2P media streaming distribution in Ad Hoc networks. It takes the advantages of random walkers and ant-inspired algorithms for search in unstructured P2P networks, such as low transmitting latency and less redundant query messages. We quantify the performance of our scheme in terms of response time and network query messages for media streaming distribution. Simulation results show that it can effectively improve the Search Efficiency for P2P media streaming distribution in Ad Hoc networks.
Real World Multi-agent Systems: Information Sharing, Coordination and Planning
Authors: Frans C. Groen, Matthijs T. Spaan, Jelle R. Kok, Gregor Pavlin
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

Applying multi-agent systems in real world scenarios requires several essential research questions to be answered. Agents have to perceive their environment in order to take useful actions. In a multi-agent system this results in a distributed perception of partial information, which has to be fused. Based on the perceived environment the agents have to plan and coordinate their actions. The relation between action and perception, which forms the basis for planning, can be learned by perceiving the result of an action. In this paper we focus these three major research questions.First, we investigate distributed world models that describe the aspects of the world that are relevant for the problem at hand. Distributed Perception Networks are introduced to fuse observations to obtain robust and efficient situation assessments. Second, we show how coordination graphs can be applied to multi-robot teams to allow for efficient coordination.Third, we present techniques for agent planning in uncertain environments, in which the agent only receives partial information (through its sensors) regarding the true state of environment.
A Rule Format for Associativity
Authors: Sjoerd Cranen, Mohammadreza Mousavi, Michel A. Reniers
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek's spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism.
A case for adapting channel width in wireless networks
Authors: Ranveer Chandra, Ratul Mahajan, Thomas Moscibroda, Ramya Raghavendra, Paramvir Bahl
Venue: ACM SIGCOMM Computer Communication Review (2008)

We study a fundamental yet under-explored facet in wireless communication -- the width of the spectrum over which transmitters spread their signals, or the channel width. Through detailed measurements in controlled and live environments, and using only commodity 802.11 hardware, we first quantify the impact of channel width on throughput, range, and power consumption. Taken together, our findings make a strong case for wireless systems that adapt channel width. Such adaptation brings unique benefits. For instance, when the throughput required is low, moving to a narrower channel increases range and reduces power consumption; in fixed-width systems, these two quantities are always in conflict. We then present a channel width adaptation algorithm, called SampleWidth, for the base case of two communicating nodes. This algorithm is based on a simple search process that builds on top of existing techniques for adapting modulation. Per specified policy, it can maximize throughput or minimize power consumption. Evaluation using a prototype implementation shows that SampleWidth correctly identities the optimal width under a range of scenarios. In our experiments with mobility, it increases throughput by more than 60% compared to the best fixed-width configuration.
Supporting Judgment of Fact Trustworthiness Considering Temporal and Sentimental Aspects
Authors: Yusuke Yamamoto, Taro Tezuka, Adam Jatowt, Katsumi Tanaka
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

We have developed a system for helping users to determine the trustworthiness of uncertain facts based on sentiment and temporal viewpoints by aggregating information from the Web. Our goal is not to determine whether uncertain facts are true or false, but to provide users with additional data on which the trustworthiness of the information can be determined. The system shows with what sentiment and in what context facts are mentioned on the Web and displays any temporal change in the fact's popularity. Furthermore, the system extracts counter facts and analyzes them in the same way. The majority of 1000 users who evaluated our system found it to be a useful tool for helping to determine the trustworthiness of facts from various viewpoints.
On representations of solutions to certain stochastic differential equations
Authors: Javier Villarroel
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

We determine the class of one-dimensional stochastic differential equations with a strong solution that can be represented as a functional of Brownian motion. For this class we detail the corresponding solution and transition density. Sharp conditions for explosion to occur are determined.
Market Mechanisms for Trading Grid Resources
Authors: Costas Courcoubetis, Manos Dramitinos, Thierry Rayna, Sergios Soursos, George D. Stamoulis
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

There has been recently an increasing interest in Grid services and economic-aware Grid systems both in the industry and the academia. In this paper we specify a market for hardware providers and consumers interested in leasing Grid resources for a time period. Our approach comprises a stock-market like mechanism that enables the trading of computational power on the basis of a spot and a futures market. The spot market comprises a pair of bid and ask queues. This grid market is more complicated than the standard spot/futures markets of storable commodities, because the computational service traded in our case comprises of resources that are perishable, and has both quantity and duration specified in terms of a time interval. This is an important feature of our market mechanism, complicating considerably the trading algorithms that we develop and assess in this paper.
Reducing False Alarm of Video-Based Smoke Detection by Support Vector Machine
Authors: Chan-Yun Yang, Wei-Wen Tseng, Jr-Syu Yang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Techniques used in video smoke detection systems have been discussed noticeably in past few years. With the advantage of early fire alarm in large or specific spaces such as studio and tunnels, the video-based smoke detection systems would not have time delay as conventional detectors. In contrast, how to reduce false alarm and increase the generalization ability is the key issue for such state-of-the-art systems. In this paper, examples consisting of features extracted from a real time video are collected for the training of a discriminating model. A prototype of support vector machine (SVM) is therefore introduced for the discriminating model with the capability in small sample size training and the good generalization ability. In order to reduce the false alarm, the prototype is then extended to a class-imbalanced learning model to deal with rarity of the positive class. A number of assuming data are used for imbalanced test to cope with the real world of fire safety. The technique is optimistic to enhance accuracy and reduce false alarm in video-based smoke systems.
Making stronger and flexible the single parent rule in the real-time specification of Java
Authors: M. Teresa Higuera-Toledano
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

Java is the ideal language for developing embedded distributed real-time applications. However, most Java implementations and tools were designed for workstations and have limitations due to that heritage. Special tools are required to support deployment and effect better integration with target hardware and the real-time requirements of embedded systems. The Real-time Specification for Java (RTSJ) extends the Java memory model through immortal and scoped memory regions to reduce the timing-indeterminism caused by garbage collection. The goal of this paper is to improve the predictability and performance of real-time Java applications according to the new RTSJ Specification Request (JSR-282) 2 and 3 enhancements. The single parent rule, that RTSJ introduces, prevents cyclic use of scoped memory regions. But, since this rule cannot be statically enforced, induces run-time overhead and even nondeterministic behavior of applications (due to race conditions). This paper modifies the single parent rule making it stronger, and allows it violation under some conditions in order to have bidirectional references among objects within two different scopes.
Improving performance reliability in surgical systems
Authors: J. Benn, A. N. Healey, E. Hollnagel
Venue: Cognition, Technology and Work (2008)

Health care has evolved rapidly to meet the medical demands of society, but not to meet the demands of consistent operational safety. In other high risk domains in which the consequences of systems failure are unacceptable, organisational and operational work systems have been developed to deliver consistent, high-quality, failure-free performance. In this paper we review contributions to a special issue of Cognition, Technology and Work on &#x2018;Enhancing Surgical Systems&#x2019;. We consider their implications for improving the reliability of care processes in light of theoretical developments in the area of high-reliability organisations and resilience engineering. Health care must move from reactive safety cultures to be more proactively resilient to the continual threats posed by complexity in clinical care processes and the multi-professional hospital environment. Our analysis emphasises the importance of team working for reliable operational performance. A schematic framework to illustrate how safety interventions in surgery might cohere within an organisational strategy for achieving high-reliability is proposed. The implications for continuous quality improvement and effective regulation of system safety over differing time scales and organisational levels are discussed.
Evolution of Biped Walking Using Neural Oscillators and Physical Simulation
Authors: Daniel Hein, Manfred Hild, Ralf Berger
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Controlling a biped robot with a high degree of freedom to achieve stable movement patterns is still an open and complex problem, in particular within the RoboCup community. Thus, the development of control mechanisms for biped locomotion have become an important field of research. In this paper we introduce a model-free approach of biped motion generation, which specifies target angles for all driven joints and is based on a neural oscillator. It is potentially capable to control any servo motor driven biped robot, in particular those with a high degree of freedom, and requires only the identification of the robot's physical constants in order to provide an adequate simulation. The approach was implemented and successfully tested within a physical simulation of our target system - the 19-DoF Bioloid robot. The crucial task of identifying and optimizing appropriate parameter sets for this method was tackled using evolutionary algorithms. We could show, that the presented approach is applicable in generating walking patterns for the simulated biped robot. The work demonstrates, how the important parameters may be identified and optimized when applying evolutionary algorithms. Several so evolved controllers were capable of generating a robust biped walking behavior with relatively high walking speeds, even without using sensory information. In addition we present first results of laboratory experiments, where some of the evolved motions were tried to transfer to real hardware.
Technological model for application of mobile technology in the process of port monitoring
Authors: Caio Fernando Fontana, Cleiton Capellossi, Vidal Augusto Zapparoli Castro Melo, Eduardo Mario Dias
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper presents the development of a model for implementation of mobile technology in ports. The work was developed in the context of the use of mobile devices to automation of procedures for the supervision and operations of berthing of the port of Santos. The term mobile technology is employed to define equipment, media and software engineering to extend the computerized form outside the boundaries of existing infrastructure.