ppxscal/embedding_network huggingface dataset:
A platform for RFID security and privacy administration
Authors: Melanie R. Rieback, Georgi N. Gaydadjiev, Bruno Crispo, Rutger F. H. Hofman, Andrew S. Tanenbaum
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

This paper presents the design, implementation, and evaluation of the RFID Guardian, the first-ever unified platform for RFID security and privacy administration. The RFID Guardian resembles an "RFID firewall," that monitors and controls access to RFID tags by combining a standard-issue RFID reader with unique RFID tag emulation capabilities. Our system provides a platform for both automated and coordinated usage of RFID security mechanisms, offering fine-grained control over RFID-based auditing, key management, access control, and authentication capabilities. We have prototyped the RFID Guardian using off-the-shelf components, and our experience has shown that active mobile devices are a valuable tool for managing the security of RFID tags in a variety of applications, including protecting low-cost tags that are unable to regulate their own usage. More philosophically, RFID technology vividly illustrates the difficulties of security administration in a world of increasingly pervasive, decentralized, low-cost, and low-power computing. Our paper thus also offers a glimpse of what system administration may be like in the future, when laymen face the responsibility to manage systems of tiny computers that they are barely aware of.
Leveraging good intentions to reduce unwanted network traffic
Authors: Marianne Shaw
Venue: Proceedings of the 2nd conference on Steps to Reducing Unwanted Traffic on the Internet - Volume 2 (2006)

We present a solution to reduce unwanted network traffic by enabling either side of a conversation to summarily terminate the conversation without the other end-point's cooperation. Our work is motivated by the observation that many compromised endhosts on the network are well-intentioned but easily compromised; these machines are often compromised and their resources used to attack others. We argue that the good intentions of these endhosts can be leveraged to construct a control plane that ensures that, even when compromised, these well-intentioned machines only generate well-behaved traffic. This independently enforced control plane prevents an endhost from blatantly disregarding requests to cease traffic generation. The solution's viability rests upon its unobtrusive deployment. No extra mechanism is needed within the network as all enforcement is performed at the endhosts. Hosts are not restricted in their behavior except by the behavior demanded by their peers.
Hopped linear time varying filters: Principles
Authors: A. Hayar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Privacy and security of radio communications becomes increasingly important. In this context, modulation techniques with embedded scrambling properties are suitable. The aim of this paper is to present a new transmitting technique using linear time varying filters with hopping in the frequency domain.
Just type make! - managing internet firewalls using make and other publicly available utilities
Authors: Sally Hambridge, Charles Smothers, Tod Oace, Jeff Sedayao
Venue: Proceedings of the 1st conference on Conference on Network Administration - Volume 1 (1999)

Managing Internet firewalls that can failover between each other is quite a challenge. When those firewalls are geographically dispersed and have a small number of people to be maintain them, it becomes even more challenging. Intel Corporation has a small staff that manages several geographically dispersed Internet firewalls with failover requirements. These firewalls use a standard screened subnet architecture [1] with packet filtering inner and outer firewall routers and a number of bastion hosts between them. These bastion hosts provide services with load balancing and disaster recovery for relaying SMTP mail, answering DNS queries, and proxying web requests. To manage this complex system of firewalls, Intel's Internet Connectivity Engineering staff have come up with a way to model all of the interrelated firewall as one distributed system. Host and router configurations are considered source to that system and compilation and installation of that source is driven by the Make [2] utility. Packet filtering Access Control Lists (ACLs) are built by a Makefile. The Makefile assembles the ACLs and executes an Expect [3] script that installs them. We configure bastion hosts by configuring Make to drive rdist, which run over the secure shell (SSH) [4]. In this way, only updated files are pushed out to the bastion hosts and passwords and other configuration information do not go in the clear. Our experiences with Make and these publicly available utilities are quite good - allowing us to manage a large distributed set of firewall devices. Using a Make driven approach requires much discipline, however, to avoid the distribution of bad configurations. Future plans include ACL optimization and sanity tests before and after bastion host configuration pushes.
Underwater acoustic communications using a-priori statistics on channel time-variations
Authors: M. Wasserblat
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper addresses the problem of underwater acoustic channel estimation for communications in time-varying environments. In the case of a rapidly time-varying environment, the channel needs to be estimated and tracked continuously. In this case, prior information on the channel can be used to improve channel estimation performance. In this paper, a-priori statistics on the channel time-variations are used in order to obtain a maximum a-posteriori estimator for channel tap-coefficients. It is also shown that in a shallow water waveguide, typical channel time-variations span a small subspace of channel tap-coefficients variations. This fact is used to reduce the number of parameters to be estimated and improve the channel estimation performance. The results demonstrate a performance gain of 5-10 dB in terms of the signal-to-noise ratio in decision-feedback equalizer mean-squared error, compared to the least-squares method which ignores the a-priori statistics on the channel time-variations.
A Routing Method by Reactive Energy Decision in Wireless Sensor Networks
Authors: Ying-Hong Wang, Chih-Peng Hsu, Yi-Chien Lin, Chien-Shan Kuo, Hsin-Yi Ho
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

The wireless sensor network (WSN) was extensively deployed and researched recently. While taking the advantage of smaller dimension, lower cost and simple structure of the sensor nodes, more restrictions come with sensors. Therefore, the limited power of sensor nodes is the most direct and difficult problem we meet. The limitation on the energy of sensor nodes creates the bottlenecks when designing the suitable routing protocols. In order to solve the problem of limited energy, the loading of nodes has to be distributed as possible as it could. If the energy consumption can be shared averagely by most nodes, then the lifetime of sensor networks will be enlarged. Thus we propose the routing protocol called Reactive Energy Decision Routing Protocol (REDRP) for the sensor network which considers several representative routing protocols in different structures. This protocol will create the routes in a reactive routing method to transmit the data gathered from nodes and the REDRP will use the residual energy of nodes as the routing decision for energy-aware. The results of simulation show that the more fairness usage of sensor nodes, the more energy consumption of entire network will be distributed by our protocol and the longer the lifetime of nodes.
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography
Authors: Jesse Kamp, David Zuckerman
Venue: SIAM Journal on Computing (2006)

We give an efficient deterministic algorithm that extracts $\Omega(n^{2\gamma})$ almost-random bits from sources where $n^{\frac{1}{2}+\gamma}$ of the $n$ bits are uniformly random and the rest are fixed in advance. This improves upon previous constructions, which required that at least $n/2$ of the bits be random in order to extract many bits. Our construction also has applications in exposure-resilient cryptography, giving explicit adaptive exposure-resilient functions and, in turn, adaptive all-or-nothing transforms. For sources where instead of bits the values are chosen from $[d]$, for $d>2$, we give an algorithm that extracts a constant fraction of the randomness. We also give bounds on extracting randomness for sources where the fixed bits can depend on the random bits.
Numerical study of modified Adomian's method applied to Burgers equation
Authors: Mário Basto, Viriato Semiao, Francisco L. Calheiros
Venue: Journal of Computational and Applied Mathematics (2007)

The application of Adomian's decomposition method to partial differential equations, when the exact solution is not reached, demands the use of truncated series. But the solution's series may have small convergence radius and the truncated series may be inaccurate in many regions. In order to enlarge the convergence domain of the truncated series, Pade approximants (PAs) to the Adomian's series solution have been tested and applied to partial and ordinary differential equations, with good results. In this paper, PAs, both in x and t directions, applied to the truncated series solution given by Adomian's decomposition technique for Burgers equation, are tested. Numerical and graphical illustrations show that this technique can improve the accuracy and enlarge the domain of convergence of the solution. It is also shown in this paper, that the application of Adomian's method to the ordinary differential equations set arising from the discretization of the spatial derivatives by finite differences, the so-called method of lines, may reduce the convergence domain of the solution's series.
Community Crisis Response Teams: Leveraging Local Resources through ICT E-Readiness
Authors: Elizabeth Avery Gomez, Murray Turoff
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Dynamic community crisis response teams form quickly at the onset of a crisis providing assistance until external specialty resources arrive. FEMA recommends individual preparedness for up to 72 hours. Sustaining a community for at least 72 hours often falls to those who live or work in the community. Local community responders (i.e. small grassroots volunteers) who operate in the field during a crisis need mobile information technologies and practice for effective communication and coordination. Small grassroots volunteers, who may be among community responders, often have limited training and practice with two-way device quick response tactics. Our analysis of the local community literature suggests focusing on ICT training in conjunction with plainlanguage communication directed towards interoperability as a means to increase individual ICT e-readiness. We propose the use of team-based learning instructional strategy which has been empirically tested in the classroom.
Time Pressure and Reward Inspiration as Outcome Controls for Information Sharing in Problem-Solving Virtual Teams
Authors: Fang He, Souren Paul
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The purpose of this research is to examine whether outcome controls of group work (i.e. time pressure and reward) trigger psychological factors (i.e. distraction, motivation, and trust) and affect problem-solving virtual teams' ability to share information and develop high quality solutions. Results of a laboratory experiment on GSS-based virtual teams indicate that teams exhibited higher motivation and trust under time pressure while only trust, in turn, has a positive relationship with information sharing. However, reward control has no significant impact on any psychological factors. We also find evidence supporting that total information shared is positively associated with problem-solving outcomes in terms of the solution quality.
Connection conditioning: architecture-independent support for simple, robust servers
Authors: KyoungSoo Park, Vivek S. Pai
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

For many network server applications, extracting the maximum performance or scalability from the hardware may no longer be much of a concern, given today's pricing - a $300 system can easily handle 100 Mbps of Web server traffic, which would cost nearly $30,000 per month in most areas. Freed from worrying about absolute performance, we re-examine the design space for simplicity and security, and show that a design approach inspired by Unix pipes, Connection Conditioning (CC), can provide architecture-neutral support for these goals. By moving security and connection management into separate filters outside the server program, CC supports multi-process, multi-threaded, and event-driven servers, with no changes to programming style. Moreover, these filters are customizable and reusable, making it easy to add security to any Web-based service. We show that CC-enhanced servers can easily support a range of security policies, and that offloading connection management allows even simple servers to perform comparably to much more complicated systems.
Tracking behavior of the constant modulus array for time-varying channels
Authors: A. V. Keerthi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we present a stochastic analysis of the constant modulus (CM) array for time-varying channels. An expression for the mean-square error is derived, which is based on a recursion for the weight-error correlation matrix. The analysis yields an accurate model of the tracking behavior of the CM array provided the array maintains capture on the same source. Computer simulations are presented to illustrate the tracking behavior of the CM array and to verify the theoretical model.
Inequalities for convex sequences and their applications
Authors: Shanhe Wu, Lokenath Debnath
Venue: Computers Mathematics with Applications (2007)

Using the theory of majorization, new inequalities for convex sequences are proved. A necessary and sufficient condition for a convex sequence is established. This reveals an important relationship between the convex sequence and the majorized inequality. Finally, some applications of our new inequalities and some improvements of certain known results are presented.
Optimum harmonics tracking filter for auditory scene analysis
Authors: K. Nishi, S. Ando, S. Aida
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We propose a new harmonics tracking algorithm for auditory scene analysis. It extracts the most significant stream from multiple sound streams as well as the tracking of each harmonic components. For the optimum tracking of pitch candidates, a novel estimation technique based on nonlinear Kalman filtering and Parzen estimate (non-parametric Kalman filter, NPKF) is used. For invariant reconstruction of harmonic components against pitch estimation error, we perform a filtering process in the wavelet domain. Using simulated data and real world data, we show several experimental results for extracting the most dominant sound stream among multiple ones.
Eventually k-Bounded Wait-Free Distributed Daemons
Authors: Yantao Song, Scott M. Pike
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Wait-free scheduling is unsolvable in asynchronous message-passing systems subject to crash faults. Given the practical importance of this problem, we examine its solvability under partial synchrony relative to the eventually perfect failure detector \diamondsuit P. Specifically, we present a new oracle-based solution to the dining philosophers problem that is wait-free in the presence of arbitrarily many crash faults. Additionally, our solution satisfies eventual k-bounded waiting, which guarantees that every execution has an infinite suffix where no process can overtake any live hungry neighbor more than k consecutive times. Finally, our algorithm uses only bounded space, bounded-capacity channels, and is also quiescent with respect to crashed processes. Among other practical applications, our results support wait-free distributed daemons for fairly scheduling self-stabilizing protocols in the presence of crash faults.
A tiny and efficient wireless ad-hoc protocol for low-cost sensor networks
Authors: Pawel Gburzynski, Bozena Kaminska, Wlodek Olesinski
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We introduce a simple ad-hoc routing scheme that operates in the true spirit of ad-hoc networking, i.e., in a modeless fashion, without neighborhood discovery or explicit point-to-point forwarding, while offering a high (and tunable) degree of reliability, fault-tolerance and robustness, Being aimed at truly tiny devices (e.g., with 1KB of RAM), our scheme can automatically take advantage of extra memory resources to improve the quality of routes for critical nodes. In contrast to some popular low-cost solutions, like ZigBee,&trade; our approach involves a single node type and exhibits lower resource requirements. The presented scheme has been verified in an industrial deployment with stringent quality of service requirements.
Hybrid semi-blind multi-user detectors: subspace tracking methods
Authors: A. Host-Madsen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We consider the problem of multi-user detection for CDMA systems where the codes of some users are known while others are unknown, called semi-blind detectors. An example is at the base station of a cellular communication system with interference from both in-cell users, with known codes, and out-of-cell users, with unknown codes. We develop a hybrid semi-blind detector, which is partly decorrelating, partly MMSE. Subspace tracking methods are developed for on-line implementation of the detector. The performance of the detectors is compared to that of the purely blind MMSE detector and the non-blind MMSE detector, and the semi-blind detector is seen to have a considerable better performance.
Geolocalization on the internet through constraint satisfaction
Authors: Bernard Wong, Ivan Stoyanov, Emin Gün Sirer
Venue: Proceedings of the 3rd conference on USENIX Workshop on Real, Large Distributed Systems - Volume 3 (2006)

This paper outlines a novel, comprehensive framework for geolocalization, that is, determining the physical location of Internet hosts based on network measurements. The core insight behind this framework is to pose the geolocalization problem formally as one of error-minimizing constraint satisfaction, to create a system of constraints by deriving them aggressively from network measurements, and to solve the system using cheap and accurate geometric methods. The framework is general and accommodates both positive and negative constraints, that is, constraints on where the node can or cannot be, respectively. It can reason in the presence of uncertainty, enabling it to gracefully cope with aggressively derived constraints that may contain errors. Since the solution space is represented geometrically as a region bounded by Bezier curves, the framework yields an accurate set of all points where the target may be located. Preliminary results on PlanetLab show promise; the framework can localize the median node to within 22 miles, a factor of three better than previous approaches, with little error.
SqueakBot: a Pedagogical Robotic Platform
Authors: Serge Stinckwich, Severin Lemaignan, Samir Saidani
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

SqueakBot is a teaching robotic platform, usable by young people making it possible for them to control and simulate various devices like robots. The long-term goals of the project are on the one hand to have a software architecture being able to be embedded in small size hardware devices (with limited resources in memory and computation) and on the other hand to mix in the same platform, virtual devices simulated on a computer and physical devices available in the environment. We present here a first report of this project.
An entropy-based quantum neuro-fuzzy inference system for classification applications
Authors: Cheng-Jian Lin, I-Fang Chung, Cheng-Hung Chen
Venue: Neurocomputing (2007)

In this paper, an entropy-based quantum neuro-fuzzy inference system (EQNFIS) for classification applications is proposed. The EQNFIS model is a five-layer structure, which combines the traditional Takagi-Sugeno-Kang (TSK). Layer 2 of the EQNFIS model contains quantum membership functions, which are multilevel activation functions. Each quantum membership function is composed of the sum of sigmoid functions shifted by quantum intervals. A self-constructing learning algorithm, which consists of the self-clustering algorithm (SCA), quantum fuzzy entropy, and the backpropagation algorithm, is also proposed. The proposed SCA method is a fast, one-pass algorithm that dynamically estimates the number of clusters in an input data space. Quantum fuzzy entropy is employed to evaluate the information on pattern distribution in the pattern space. With this information, we can determine the number of quantum levels. The backpropagation algorithm is used to tune the adjustable parameters. Simulations were conducted to show the performance and applicability of the proposed model.
Infinite Horizon Risk Sensitive Control of Discrete Time Markov Processes under Minorization Property
Authors: Giovanni B. Di Masi, Łukasz Stettner
Venue: SIAM Journal on Control and Optimization (2007)

Risk sensitive control of Markov processes satisfying the minorization property is studied using splitting techniques. Existence of solutions to the multiplicative Poisson equation is shown. Approximation by uniformly ergodic controlled Markov processes is introduced, which allows us to show the existence of solutions to the infinite horizon risk sensitive Bellman equation.