ppxscal/embedding_network huggingface dataset:
Analysis of On-off policies in Sensor Networks Using Interacting Markovian Agents
Authors: Marco Gribaudo, Davide Cerotti, Andrea Bobbio
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Power management in battery operated sensor networks, isa hot topic addressed by many ongoing researches. One of the most commonly employed technique consists in turning on and of the power of the radio unit to reduce the power consumption. In this paper we exploit the modelling power of Interacting Markovian Agent to evaluate the performance of four different on-off strategies. A Markovian Agent (MA) is an entity whose behaviour is described by a continuous time Markov chain (CTMC) and that is able to interact with other MA's by sending and receiving messages. A perceived message may induce a state transition in an MA according to a perception function than can depend on the geographical location of the MA's, on the message routing strategy and on the transmission property of the medium. We represent each sensor by an MA and we show how MA's can interact to produce the collective behaviour of the sensor network.
Performance Study of Wireless Body Area Network in Medical Environment
Authors: Marina Sukor, Sharifah Ariffin, Norsheila Fisal, S. K. Syed Yusof, Adel Abdallah
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The advanced developments in sensors and wireless communications devices have enabled the design of miniature, cost-effective, and smart physiological sensor nodes. One of the approaches in developing wearable health monitoring systems is the emerging of wireless body area network (WBAN). IEEE 802.15.4 provides low power, low data rate wireless standard in relation to medical sensor body area networks. In the current study, the star network topology of 802.15.4 standard at 2.4 GHz had been considered for body area network (BAN) configured in beacon mode. The main consideration is in the total data bits received by all the nodes at the coordinator and flight times of a data packet reaching its destination. In this paper we discussed on wireless technologies that can be used for medical applications and how they perform in a healthcare environment. The low-rate Wireless Personnel Area Network (WPAN) is being used to evaluate its suitability in medical application.
Effects of land-use categorization on landscape metrics: A case study in urban landscape of Shenzhen, China
Authors: J. Peng, Y. Wang, M. Ye, J. Wu, Y. Zhang
Venue: International Journal of Remote Sensing (2007)

Using remotely sensed data, landscape pattern analysis based on landscape metrics has been one of the major topics of landscape ecology, and more attention has been focused on the effects of spatial scale and the accuracy of remotely sensed data on landscape metrics. However, few studies have been conducted to assess the change of landscape metrics under the influence of land-use categorization. In this paper, we took the Bao'an district of Shenzhen city as the study area, to analyse how land-use categorization would influence changes in 24 landscape metrics. The results showed a significant influence, and based on the characteristics of the response curves of landscape metrics associated with the change in land-use categorization in regression analysis, and the predictability of these relations, the 24 landscape metrics fell into three groups. (1) Type I included 12 landscape metrics, and showed a strong predictability with changing of land-use categorization with simple function relations in regression analysis. (2) Type II included seven indices, and exhibited complicated behaviours against changing of land-use categorization. The response curves of these metrics, which were not easy to predict, consisted of two subsections and could not be described by a single function. (3) Type III included five indices, and showed unpredictable behaviours against the change of the land-use categorization. Their response curves could not be described by a certain function. This study highlights the need for the analysis of effects of land-use categorization on landscape metrics so as to clearly quantify landscape patterns, and provides insights into the selection of landscape metrics for comparative research on a given area under different land-use categorizations.
Spectral reflectance and leaf internal structure changes of barley plants due to phytoextraction of zinc and cadmium
Authors: B. B. Maruthi Sridhar, F. X. Han, S. V. Diehl, D. L. Monts, Y. Su
Venue: International Journal of Remote Sensing (2007)

The focus of our research is to seek spectral signatures that indicate the impact and content of heavy metals in the leaves and canopies of living plants during the process of phytoremediation. Potted plants of barley (Hordeum vulgare) were grown for 5-6 weeks before being subjected to metal treatments of Zn and Cd. Diffuse reflectance spectra (350-2500 nm) of the plant canopies were collected daily using a portable spectroradiometer throughout the treatment period. Foliar structural changes of Zn-treated plants included a decrease in intercellular space, palisade and epidermal cell size while Cd-treated plants displayed fewer structural changes in leaf. Spectral analysis revealed that the band ratios at 1110 nm to that at 810 nm might be used as an indicator of the accumulation of certain metals in plant shoots. Normalized Difference Vegetation Index (NDVI) and leaf-water-content indices examined as part of our spectral analysis were not able to distinguish plants treated with different metals. Our ratio index R1110/R810, on the other hand, correlates closely with the magnitude of leaf structural changes. This study suggests that the infrared reflectance spectrum (800-1300 nm) of plant canopy might provide a non-intrusive monitoring method for the physiological status of plants grown on heavy metal contaminated soil.
Text-independent speaker recognition using graph matching
Authors: Ville Hautamäki, Tomi Kinnunen, Pasi Fränti
Venue: Pattern Recognition Letters (2008)

Technical mismatches between the training and matching conditions adversely affect the performance of a speaker recognition system. In this paper, we present a matching scheme which is invariant to feature rotation, translation and uniform scaling. The proposed approach uses a neighborhood graph to represent the global shape of the feature distribution. The reference and test graphs are aligned by graph matching and the match score is computed using conventional template matching. Experiments on the NIST-1999 SRE corpus indicate that the method is comparable to conventional Gaussian mixture model (GMM) and vector quantization (VQ)-based approaches.
Generalizing the continued fraction algorithm to arbitrary dimensions
Authors: B. Just
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A higher dimensional continued fraction algorithm (CFA) that produces diophantine approximations of more than linear goodness is given. The algorithm is also ideally convergent and detects integer relations.
Algorithms for balancing energy consumption in wireless sensor networks
Authors: Bo Sun, Sui-Xiang Gao, Rui Chi, Fei Huang
Venue: Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008)

Prolonging the lifetime of network is one of the most important designing objectives in wireless sensor networks (WSNs). Keeping up the uniform energy consumption of various sensor nodes is an efficient approach to prolong the lifetime of WSNs. This paper concerns on the problem of balancing energy consumption of sensor nodes in clustering WSNs. Two methods are proposed to uniform energy drainage. One of them achieves the uniform energy consumption of nodes by taking different transmission radii according to the distance of sensor nodes to the cluster-head. The other is a hybrid communication mode, where sensor nodes not only send data to the cluster-head by multi-hop with the same transmission radius, but also send data directly to the cluster-head by one-hop with proper probabilities. Formulae to calculate energy consumption of sensor nodes are derived and two algorithms are given to determine the parameters in the two methods. Simulations show the proposed methods can balance the energy consumption of nodes effectively and prolong the lifetime of networks.
Model-based identification of PEEP titrations during different volemic levels
Authors: C. Starfinger, J. G. Chase, C. E. Hann, G. M. Shaw, P. Lambert, B. W. Smith, E. Sloth, A. Larsson, S. Andreassen, S. Rees
Venue: Computer Methods and Programs in Biomedicine (2008)

A cardiovascular system (CVS) model has previously been validated in simulated cardiac and circulatory disease states. It has also been shown to accurately capture all main hemodynamic trends in a porcine model of pulmonary embolism. In this research, a slightly extended CVS model and parameter identification process are presented and validated in a porcine experiment of positive end-expiratory pressure (PEEP) titrations at different volemic levels. The model is extended to more physiologically represent the separation of venous and arterial circulation. Errors for the identified model are within 5% when re-simulated and compared to clinical data. All identified parameter trends match clinically expected changes. This work represents another clinical validation of the underlying fundamental CVS model, and the methods and approach of using them for cardiovascular diagnosis in critical care.
Seeking information in realistic books: a user study
Authors: Veronica Liesaputra, Witten H. Ian
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

There are opposing views on whether readers gain any advantage from using a computer model of a 3D physical book. There is enough evidence, both anecdotal and from formal user studies, to suggest that the usual HTML or PDF presentation of documents is not always the most convenient, or the most comfortable, for the reader. On the other hand it is quite clear that while 3D book models have been prototyped and demonstrated, none are in routine use in today's digital libraries. And how do 3D book models compare with actual books? This paper reports on a user study designed to compare the performance of a practical Realistic Book implementation with conventional formats (HTML and PDF) and with physical books. It also evaluates the annotation features that the implementation provides.
Grids: Creative Solutions for Graphic Design, Pap/Cdr edition
Authors: Lucienne Roberts
Venue:  (2008)

A grid well used makes all the difference between a flat layout, and one that has real flair and visual appeal. This practical book gives designers of all levels the inspiration and know-how to create great layouts. Exemplary designs are overprinted with their underlying grid, and detailed captions discuss how the designers have utilized the grid to provide structure, and add movement, flexibility, and impact to their design. Crammed with ideas for different ways of using space, type, and images, Grids also explores innovative ideas for navigational devices and information design. Details of measurements and specs allow designers to apply, adapt, and refine the elements shown to create their own unique and dynamic layouts. This is a truly indispensable reference book for all students and practitioners of graphic design.
The Fourth Asian Information Retrieval Symposium (AIRS 08)
Authors: Hang Li, Wei-Ying Ma, Jian-Yun Nie, Kam-Fai Wong
Venue: ACM SIGIR Forum (2008)

Asia Information Retrieval Symposium (AIRS) 2008 was held in Harbin Institute of Technology, China, in January 15--18, 2008. This was the fourth AIRS conference in the series established in 2004. The previous conferences have been held in Beijing (2004), Jeju (2005) and Singapore (2006). The AIRS conferences trace their roots to the successful Information Retrieval with Asian Languages (IRAL) workshops, which started in 1996.
FPGA-based, floating-point reduction operations
Authors: Michael R. Bodnar, James P. Durbano, John R. Humphrey, Petersen F. Curt, Dennis W. Prather
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Floating-point reduction operations are a vital part of scientific computational kernels, such as vector dot-products, discrete cosine transforms (DCT), and matrix-matrix multiplications. As FPGAs continue to gain popularity in custom and embedded computing platforms, implementations of these applications in such platforms are desirable. Due to the inherently deep pipelines of high-performance floating-point cores in FPGAs, reduction circuits require special feedback and buffering schemes in order to realize full throughput. In this paper, we present our floating-point reduction architecture, clocked at more than 150 MHz targeting a Xilinx Virtex2 8000-4 FPGA.
Shape optimization for Stokes flow
Authors: Zhiming Gao, Yichen Ma, Hongwei Zhuang
Venue: Applied Numerical Mathematics (2008)

This paper is concerned with a shape sensitivity analysis of a viscous incompressible fluid driven by Stokes equations. The structures of continuous shape gradients with respect to the shape of the variable domain for some given cost functionals are established by introducing the Piola transformation and then deriving the state derivative and its associated adjoint state. Finally we give the finite element approximation of the problem and a gradient type algorithm is effectively used for our problem.
Fortification of IT Security by Automatic Security Advisory Processing
Authors: Stefan Fenz, Andreas Ekelhart, Edgar Weippl
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The past years have seen the rapid increase of security related incidents in the field of information technology. IT infrastructures in the commercial as well as in the governmental sector are becoming evermore heterogeneous which increases the complexity of handling and maintaining an adequate security level. Especially organizations which are hosting and processing highly sensitive data are obligated to establish a holistic company-wide security approach. We propose a novel security concept to reduce this complexity by automatic assessment of security advisories. A central entity collects vulnerability information from various sources, converts it into a standardized and machine-readable format and distributes it to its subscribers. The subscribers are then able to automatically map the vulnerability information to the ontological stored infrastructure data to visualize newly-discovered software vulnerabilities.The automatic analysis of vulnerabilities decreases response times and permits precise response to new threats and vulnerabilities, thus decreasing the administration complexity and increasing the IT security level.
Extremal graphs in connectivity augmentation
Authors: Tibor Jordán
Venue: Journal of Graph Theory (1999)

Let A(n, k, t) denote the smallest integer e for which every k-connected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity. For undirected vertex-connectivity we determine A(n, k, 1) for all values of n and k. We also describe the graphs that attain the extremal values. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 179&ndash;193, 1999
Expert .NET Micro Framework (Expert)
Authors: Jens Khner
Venue:  (2008)

The Microsoft .NET Micro Framework is a small and efficient .NET runtime environment used to run managed code on devices that are too small and resource constrained for Windows CE and the Compact Framework. Expert .NET Micro Framework will teach you everything you need to know in order to use the .NET Micro Framework to create effective embedded applications. It begins with the basics of accessing hardware and networking before delving deep into the less wellknown areas such as cryptography and globalization, and how to use technologies such as wireless communication that are not directly supported by the .NET Micro Framework. This book is a must if you want to get as much as possible out of the .NET Micro Framework to write powerful embedded applications. Expert .NET Micro Framework also describes how to use resources, and write globalized and multilingual embedded applications. You will learn how to effectively use binary serialization to store data permanently in flash memory or exchange data with a PDA or PC. Topics like cryptography and encrypted data exchange with a .NET or Compact Framework application are covered. What youll learn Describes and compares wireless communication technologies and how to use them even if they are not directly supported by the .NET Micro Framework Describes the whole class library and features of the .NET Micro Framework, illustrated by working examples Demonstrates how to access hardware components with managed drivers and write applications with a graphical user interface Includes a detailed description of how to effectively extend or write hardware emulators using undocumented features of the configuration engine and emulator components Who is this book for? This book is for anyone with an interest in creating embedded systems. Primarily, it is written for the benefit of .NET developers with a background in C#, but it will equally appeal to hardware developers with a background in Assembler, C, or C++ who will be impressed by the benefits that managed code can bring to their devices. Related Titles Pro C# 2008 and the .NET 3.5 Platform, Fourth Edition
Cross Layer Protocol Support for Live Streaming Media
Authors: Syed Hasan, Laurent Lefevre, Zhiyi Huang, Paul Werstein
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Delivering live streaming content over the Internet requires low delay and smooth packet transmission rate. TCP introduces rate oscillations and requires more buffering andbandwidth to sustain uninterrupted playback. In this paper we propose a new framework which facilitates streaming flows. Our solution provides a smoother rate control than TCP and improves streaming performance based on cross layer feedback between the transport protocol and streaming server. We present our experimental results through simulation.
An optimal algorithm for intersecting three-dimensional convex polyhedra
Authors: B. Chazelle
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A linear algorithm for intersecting two convex polyhedra in 3-space is described. The algorithm is quite simple; it does not require any complicated data structure and should be practical. A number of optimal algorithms for other problems are obtained directly from this result. These include intersecting several polytopes at once or computing the convex hull of their union, merging Voronoi diagrams in the plane in linear time, and computing three-dimensional convex hulls in linear expected time.
Normal cirulant graphs with noncyclic regular subroups
Authors: Dragan Marušič, Joy Morris
Venue: Journal of Graph Theory (2005)

We prove that any circulant graph of order n with connection set S such that n and the order of ℤ n*(S), the subgroup of ℤ n* that fixes S set-wise, are relatively prime, is also a Cayley graph on some noncyclic group, and shows that the converse does not hold in general. In the special case of normal circulants whose order is not divisible by 4, we classify all such graphs that are also Cayley graphs of a noncyclic group, and show that the noncyclic group must be metacyclic, generated by two cyclic groups whose orders are relatively prime. We construct an infinite family of normal circulants whose order is divisible by 4 that are also normal Cayley graphs on dihedral and noncyclic abelian groups. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Polynomial end-to-end communication
Authors: B. Awerbuch
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A dynamic communication network is one in which links may repeatedly fail and recover. In such a network, although it is impossible to establish a path of unfailed links, reliable communication is possible if there is no cut of permanently failed links between a sender and receiver. The authors consider for such a network the basic task of end-to-end communication, that is, delivery in finite time of data items generated online at the sender, to the receiver, in order and without duplication or omission. The best known previous solutions to this problem had exponential complexity. Moreover, it has been conjectured that a polynomial solution is impossible. The authors disprove this conjecture, presenting the first polynomial end-to-end protocol. The protocol uses methods adopted from shared-memory algorithms and introduces novel techniques for fast load balancing in communication networks.
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems
Authors: Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

The problem Parsimony Haplotyping (PH) asks for the smallest set of haplotypes which can explain a given set of genotypes, and the problem Minimum Perfect Phylogeny Haplotyping (MPPH) asks for the smallest such set which also allows the haplotypes to be embedded in a perfect phylogeny, an evolutionary tree with biologically-motivated restrictions. For PH, we extend recent work by further mapping the interface between ``easy'' and ``hard'' instances, within the framework of (k,l)-bounded instances where the number of 2's per column and row of the input matrix is restricted. By exploring, in the same way, the tractability frontier of MPPH we provide the first concrete, positive results for this problem. In addition, we construct for both PH and MPPH polynomial time approximation algorithms, based on properties of the columns of the input matrix.
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Authors: Zhiyao Liang, Rakesh M. Verma
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of communication sequences, since only protocols as non-matching roles are considered, and not considering an attacker who is an insider since only an outsider attacker is considered. Therefore the complexity of checking the realistic attacks, such as the attack to the public key Needham-Schroeder protocol, is unknown.The limitations have been observed independently and described similarly by Froschle in a recently published paper, where two open problems are posted. This paper investigates these limitations, and we present a generally applicable approach by reductions with novel features from the reachability problem of 2-counter machines, and we solve the two open problems. We also prove the undecidability of checking authentication which is the first detailed proof to our best knowledge. A unique feature of the proof is to directly address the secrecy and authentication goals as defined for the public key Needham-Schroeder protocol, whose attack has motivated many researches of formal verification of security protocols.