ppxscal/embedding_network huggingface dataset:
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
Authors: Jie Wang, Ning Zhong
Venue: International Journal of Sensor Networks (2008)

Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them at selected sites. We want to find a sensor arrangement to achieve the required coverage lifetime such that the total (monetary) cost of the chosen sensors is minimum. This is an NP-hard problem. We approach this problem by modelling it as an Integer Linear Programming problem. We devise a polynomial-time approximation algorithm to this problem with a proven approximation guarantee. We observe that the actual approximation ratios are small in practice. We then present a time-slotted scheduling to produce a timetable for each sensor. We also consider a special case with only one type of sensor that can watch one target at a time. We present a different method for solving this problem.
Usage-Based Positive and Negative Verification of User Interface Structure
Authors: Przemyslaw Kazienko
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

The new approach to structure verification of the web hyperlinks is presented in the paper. It utilizes several types of patterns extracted from the web usage data: positive and negative association rules, positive sequential patterns as well as the new kind of patterns - sequential patterns with negative conclusions. All they enable to appraise the usefulness of hyperlinks in both the positive and negative way. Based on this knowledge, the content managers can adequately promote the trustworthy hyper-links and remove the negatively verified ones.
Lock-free deques and doubly linked lists
Authors: Håkan Sundell, Philippas Tsigas
Venue: Journal of Parallel and Distributed Computing (2008)

We present a practical lock-free shared data structure that efficiently implements the operations of a concurrent deque as well as a general doubly linked list. The implementation supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of doubly linked lists are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm only requires single-word compare-and-swap atomic primitives, supports fully dynamic list sizes, and allows traversal also through deleted nodes and thus avoids unnecessary operation retries. We have performed an empirical study of our new algorithm on two different multiprocessor platforms. Results of the experiments performed under high contention show that the performance of our implementation scales linearly with increasing number of processors. Considering deque implementations and systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture.
Optimization of Production of PLA Microbubble Ultrasound Contrast Agents for Hydroxycamptothecin Delivery
Authors: Jie Pan, Zhenqing Hou, Peijuan Zhu, Yange Wang, Qian Wang, Qiqing Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, ultrasound contrast agents based on a high molecular polymer-poly lactic acid (PLA) and loaded with Hydroxycamptothecin (HCPT) were prepared by combining ultrasound methodand a Shirasu Porous Glass (SPG) membrane emulsification technique. A special focus was on the optimization of production of HCPT-PLA microbubbles. Different factors, such as the power and the time of ultrasonic action, the ratio of inner aqueous phase against outer oil phase, and the concentration of PLA were evaluated, and the average size of HCPT-PLA microbubbles, the drug carrying efficiency, as well as the acoustically triggered drug release at 3kHz ultrasound were determined. The study showed that the HCPT-PLA microbubbles prepared using our optimized conditions, were sphere-like in shape with a mean diameter of 1-7μm. The drug loading efficiency reached up to 56.48%. In vitro, the drug release of HCPT-PLA microbubbles increased significantly at 3kHz ultrasound for 30s compared with that of ultrasound-free condition. In conclusion, the HCPT-PLA microbubbles has the characteristics desirable for an intravenously administered ultrasound contrast agent for further clinical use.
Noncircularity-exploitation in direction estimation of noncircular signals with an acoustic vector-sensor
Authors: Yougen Xu, Zhiwen Liu
Venue: Digital Signal Processing (2008)

The main motivation of using an acoustic vector-sensor in direction-of-arrival (DOA) estimation applications has been its unambiguous two-dimensional directivity, insensitivity to the range of sources, and independence of signal frequency. The main objection lies in its lack of geometry-redundancy and limited degree of freedom. Four thus emerged challenging tasks and the corresponding solutions by recurring to the redundancies in the nonvanishing conjugate correlations of noncircular signals are described in the paper: (1) fulfilling source decorrelation in a multipath propagation environment; (2) enhancing processing capacity to accommodate more signals; (3) suppressing colored-noise with unknown covariance structure; and (4) deriving closed-form approaches to avoid iteration and manifold storage. Simulation experiments are carried out to examine the associated DOA estimators termed as: (1) phase-smoothing MUSIC (multiple signal classification); (2) virtual-MUSIC; (3) conjugate-MUSIC; and (4) noncircular-ESPRIT (estimation of signal parameters via rotational invariance techniques), respectively.
Using QR-Updating with Reduced Complexity for Precise Localization in Mobile Sensor Networks
Authors: Frank Reichenbach, Dominik Lieckfeldt, Dirk Timmermann
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Localizing tiny sensor nodes in large wireless sensor networks is extremely complex, due to the node's strict resource limitations regarding memory size, processor performance and overall battery capacity. Moreover, in case of mobile nodes the developing process for localization methods is even more challenging. This paper presents an efficient approach for localization in mobile sensor networks, which is based on an extension of the already known "Distributed Least Squares (DLS)"-algorithm. The extension consist of a mobile phase, where sensor nodes update their initial position by QR-factorization. We show in extensive simulations that the mobile DLS-algorithm leaves only minimal computations at the resource constrained sensor nodes.
Kode viciousPride and prejudice (the Vasa)
Authors: George Neville-Neil
Venue: Communications of the ACM (2008)

Navigating the well-traveled course of communication failure that often leads to engineering disasters.
The randomized complexity of initial value problems
Authors: Stefan Heinrich, Bernhard Milla
Venue: Journal of Complexity (2008)

We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be @c-smooth (@c=r+@r: the rth derivatives satisfy a @r-Holder condition). Recently, the following almost sharp estimate of the order of the nth minimal error was given by Kacewicz [Almost optimal solution of initial-value problems by randomized and quantum algorithms, J. Complexity 22 (2006) 676-690, see also ]:c"1n^-^@c^-^1^/^2=0. We present a Taylor Monte Carlo method and show that it has error rate n^-^@c^-^1^/^2, this way establishing the exact order of the randomized nth minimal error.
Using sensitivity analysis to create simplified economic models for regression testing
Authors: Hyunsook Do, Gregg Rothermel
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Software engineering methodologies are subject to complex cost-benefit tradeoffs. Economic models can help practitioners and researchers assess methodologies relative to these tradeoffs. Effective economic models, however, can be established only through an iterative process of refinement involving analytical and empirical methods. Sensitivity analysis provides one such method. By identifying the factors that are most important to models, sensitivity analysis can help simplify those models; it can also identify factors that must be measured with care, leading to guidelines for better test strategy definition and application. In prior work we presented the first comprehensive economic model for the regression testing process, that captures both cost and benefit factors relevant to that process while supporting evaluation of these processes across entire system lifetimes. In this work we use sensitivity analysis to examine our model analytically and assess the factors that are most important to the model. Based on the results of that analysis, we propose two new models of increasing simplicity. We assess these models empirically on data obtained by using regression testing techniques on several non-trivial software systems. Our results show that one of the simplified models assesses the relationships between techniques in the same way as the full model.
Modeling TCP Throughput in IEEE 802.11 Based Wireless Ad Hoc Networks
Authors: Lianghui Ding, Wenjun Zhang, Wei Xie
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Recent studies have shown that one reason for poor TCP throughput in wireless ad hoc networks is the ineffcient interaction between TCP and CSMA based MAC protocols. In this paper, we demonstrate that the congestion window variation of TCP can be modeled as a Markov chain under maximum window limit, and the average TCP throughput is the expectation of throughput on different congestion windows. The state transition probabilities are related to the packet dropping probabilities on different windows. Then we derive the end-to-end throughput and packet dropping probability on a specific congestion window by analyzing the packet loss probability over each hop and the round trip time. The model is validated via simulation and the analytical throughput of our model is consistent with that from simulation accurately. Another important result is that, under the maximum window limit, TCP-Newreno and TCP-Vegas obtain similar throughput.
Optimization over pseudo-Boolean lattices
Authors: M. Hosseinyazdi, A. Hassankhani, M. Mashinchi
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In this paper, first we will find the solution of the system A * X ≤ b, where A, b are the known suitable matrices and X is the unknown matrix over a pseudo-Boolean lattice. Then its application to find the solution of some fuzzy linear systems as well as finding the solution of the optimization problem Z = max{C*X|A* X ≤ b} is discussed.
Biological Research Based on Sensor Networks
Authors: Perfecto Mariño, Fernando Pérez Fontán, Miguel Ángel Domínguez, Santiago Otero
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Biological research in agriculture needs a lot of specialised electronic sensors in order to fulfil different goals, like as: climate monitoring, soil and fruit assessment, control of insects and diseases, crop tracking, and so on. That research must be supported by consistent biological models able to simulate diverse environmental conditions, in order to predict the right human actions before risky biological damage could be irreversible. In this paper, an experimental distributed network based on climatic an biological wireless sensors is described. This system provides real measurements in order to validate different biological models used for viticulture applications.
Signed graph factors and degree sequences
Authors: Dean Hoffman, Heather Jordon
Venue: Journal of Graph Theory (2006)

For a signed graph G and function $f: V(G) \rightarrow Z$, a signed f-factor of G is a spanning subgraph F such that sdegF(&upsilon;) = f(&upsilon;) for every vertex &upsilon; of G, where sdeg(&upsilon;) is the number of positive edges incident with v less the number of negative edges incident with &upsilon;, with loops counting twice in either case. For a given vertex-function f, we provide necessary and sufficient conditions for a signed graph G to have a signed f-factor. As a consequence of this result, an Erd&otilde;s-Gallai-type result is given for a sequence of integers to be the degree sequence of a signed r-graph, the graph with at most r positive and r negative edges between a given pair of distinct vertices. We discuss how the theory can be altered when mixed edges (i.e., edges with one positive and one negative end) are allowed, and how it applies to bidirected graphs. &copy; 2006 Wiley Periodicals, Inc. J Graph Theory 52: 2736, 2006
PhotoBeacon: design of an optical system for localization and communication in multi-robot systems
Authors: Sarah Bergbreiter, Ankur Mehta, Kristofer S. J. Pister
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

The PhotoBeacon system provides a computationally simple means for localizing and communicating among many (>50) small, autonomous mobile robots. In addition to determining the bearing of other robots for triangulation, the PhotoBeacon system can also be used to map obstacles or free space and provides a simple method for maintaining robot formations. In order to reduce the computational complexity generally required for localization, the PhotoBeacon system moves much of this complexity to silicon. The system design is broken into four basic components: a high-power LED beacon to transmit, a fisheye lens to capture transmitted light from other robots in the horizontal plane, a custom CMOS sensor chip to detect signals from other robots, and a printed circuit board (PCB) with microcontroller to control the other components. This paper presents a high-level algorithm for localization using the PhotoBeacon system as well as the design of each of the system components. In addition, some initial results are presented to demonstrate bearing measurements with the custom PhotoBeacon Sensor IC.
Statistic Analysis of Power/Ground Networks Using Single-Node SOR Method
Authors: Zuying Luo, Sheldon X. -D. Tan
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In this paper, we propose an efficient statistical analysis method for analyzing on-chip power grids. The new method, called SN-SOR (and its faster version, PSN-SOR), is based on a novel localized relaxed iterative approach and it can perform variational analysis on one node at a time. PSN-SOR further speeds up the analysis by using a refined conditioner, where the initial solution of SN-SOR is used as the pre-conditioner for the later iterations. Experimental results show that PSN-SOR is about two orders of magnitude(186X) faster than Monte-Carlo method with slight errors less than 5.685% on maximum and is about one order magnitude (41X) faster than general global successive over relaxation (SOR) method. PSN-SOR is more accurate and efficient than the recently proposed random walk method for localized statistical analysis.
Program termination and well partial orderings
Authors: Andreas Blass, Yuri Gurevich
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

The following known observation is useful in establishing program termination: if a transitive relation R is covered by finitely many well-founded relations U1,&hellip;,Un then R is well-founded. A question arises how to bound the ordinal height &verbar;R&verbar; of the relation R in terms of the ordinals &alpha;i &equals; &verbar;Ui&verbar;. We introduce the notion of the stature &par;P&par; of a well partial ordering P and show that &verbar;R&verbar; &le; &par;&alpha;1 &times; &hellip; &times; &alpha;n&par; and that this bound is tight. The notion of stature is of considerable independent interest. We define &par; P &par; as the ordinal height of the forest of nonempty bad sequences of P, but it has many other natural and equivalent definitions. In particular, &par; P &par; is the supremum, and in fact the maximum, of the lengths of linearizations of P. And &par;&alpha;1 &times; &hellip; &times; &alpha;n&par; is equal to the natural product &alpha;1 &otimes; &hellip; &otimes; &alpha;n.
Adjacency-based culling for continuous collision detection
Authors: Min Tang, Sung-Eui Yoon, Dinesh Manocha
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

We present an efficient approach to reduce the number of elementary tests for continuous collision detection between rigid and deformable models. Our algorithm exploits connectivity information and uses the adjacency relationships between triangles to perform hierarchical culling. This can be combined with table-based lookups to eliminate duplicate elementary tests. In practice, our approach can reduce the number of elementary tests by two orders of magnitude. We demonstrate the performance of our algorithm on various challenging rigid body and deformable simulations.
Summary for scrutinizing agile practices or shoot-out at process corral!
Authors: Steve Adolph, Philippe Kruchten
Venue: Companion of the 30th international conference on Software engineering (2008)

Agile methods and practices are gaining momentum in industry, and are also slowly making their way in academia bringing fresh air and funny new jargon. Some practitioners consider them as the ultimate advance in software engineering. But what do we know about this? Where is the evidence? Do they scale? Do they solve real issues or just substitute new issues to old ones? Are the benefits tangible, or just acts of faith? Aren't we all agile? Are they no agile failures? Isn't the "waterfall process" - that piñata of agilistas--the real holy grail of software engineering, and agile processes only a Band-Aid to compensate for our deficiencies? This workshop aims at challenging the ready-made ideas, the fluff, the hype, putting things into context, and examining these with fresh and open eyes.
Report on the Principles of Provenance Workshop
Authors: James Cheney, Peter Buneman, Bertram Ludäscher
Venue: ACM SIGMOD Record (2008)

Provenance, or records of the origin, context, custody, derivation or other historical information about a (digital) object, has recently become an important research topic in a number of areas, particularly databases. However, there has been little interaction between researchers across subdisciplines of computer science working on related problems. This article reports on a workshop on Principles of Provenance held in Edinburgh, Scotland in November 2007, which facilitated interaction among researchers working on provenance in databases, security, information retrieval, Semantic Web, and software engineering settings, as well as developers and database administrators who are currently working with provenance in practice, or foresee the need to do so in the near future.
Metric details of topological line-line relations
Authors: K. A. Nedas, M. J. Egenhofer, D. Wilmsen
Venue: International Journal of Geographical Information Science (2007)

Many real and artificial entities in geographic space, such as transportation networks and trajectories of movement, are typically modelled as lines in geographic information systems. In a similar fashion, people also perceive such objects as lines and communicate about them accordingly as evidence from research on sketching habits suggests. To facilitate new modalities like sketching that rely on the similarity between qualitative representations, oftentimes multi-resolution models are needed to allow comparisons between sketches and database scenes through successively increasing levels of detail. Within such a setting, topology alone is sufficient only for a coarse estimate of the spatial similarity between two scenes, whereas metric refinements may help extract finer details about the relative positioning and geometry between the objects. The nine-intersection is a topological model that distinguishes 33 relations between two lines based on the content invariant (empty-non-empty intersections) among boundaries, interiors, and exteriors of the lines. This paper extends the nine-intersection model by capturing metric details for line-line relations through splitting ratios and closeness measures. Splitting ratios, which apply to the nine-intersection's non-empty values, are normalized values of lengths and areas of intersections. Closeness measures, which apply to the nine-intersection's empty values, are normalized distances between disjoint object parts. Both groups of measures are integrated into compact representations of topological relations, thereby addressing topological and metric properties of arbitrarily complex line-line relations.
The Life and Work of Bernard A. Galler (1928-2006)
Authors: Atshushi Akera
Venue: IEEE Annals of the History of Computing (2008)

This article describes Bernard A. Galler's involvement in early systems programming and machine languages research, his work with the ACM, and—of especial interest to the readers of this journal—his contributions to the development of the history of computing, and his role as the first editor in chief of the Annals of the History of Computing.
Enterprise integration and interoperability in manufacturing systems: Trends and issues
Authors: Hervé Panetto, Arturo Molina
Venue: Computers in Industry (2008)

Recent advances in information and communication technologies have allowed manufacturing enterprise to move from highly data-driven environments to a more cooperative information/knowledge-driven environment. Enterprise knowledge sharing (know-how), common best practices use, and open source/web based applications are enabling to achieve the concept of integrated enterprise and hence the implementation and interoperability of networked enterprises. Enterprise integration and interoperability in manufacturing systems is a key concept to face the challenges of these new environments. This paper describes challenges, trends and issues that must be addressed in order to support the generation of new technological solutions.
The popularity parameter in unstructured P2P file sharing networks
Authors: Jaime Lloret, Juan R. Diaz, Jose M. Jiménez, Manuel Esteve
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Since P2P became extremely popular between Internet users, many researchers have tried to model those P2P networks. One of the parameters, used in these models, is the popularity of a file. Some articles demonstrate that, if a file is so popular, the probability to find this file inside the P2P file sharing network is bigger. This article deals with popularity parameter in P2P file sharing networks. In order to do so, the unstructured public domain Peer-to-Peer networks Gnutella, FastTrack, OpenNap, eDonkey, Soulseek and MP2P have been measured. The authors have established a relationship between some films, songs, programs and documents found in web search engines and the same files found in public domain P2P file sharing networks. If all these analyzed Peer-To-Peer file-sharing networks were interconnected, the probability to find a desired file will be incremented. On the other hand, those analyzed P2P networks seems to be specialized in different type of files as it is shown in the paper.