ppxscal/embedding_network huggingface dataset:
Linear Clustering Algorithm by Competitive Learning Suitable for Coal Mine in Wireless Sensor Networks
Authors: Tian Feng, Wang Chuan-Yun, Guo Wei, Gao Qian
Venue: International Journal of Distributed Sensor Networks (2009)

Because of the complex environment of coal mines, there are many accidents like communication link fault caused by mobile equipment and sliding stones. Therefore, fast rebuilding of remaining nodes and dynamic adding of nodes toted by the rescuer are required after the disaster. Furthermore, the sensor nodes used for localization of the miner and his equipment can only be deployed redundantly along the straight laneway to form a linear wireless sensor network, which proposes a new requirement of topology control strategy. Combining with the self-organizing learning theory of the artificial neural networks, LCACL is presented, a linear clustering algorithm by competitive learning, in which sensor nodes are divided into mobile nodes which add or leave the network dynamically and fixed nodes which could act as sleep nodes, followers, cluster-bridges, or cluster-heads self-adaptively. On the comprehensive consideration of the remaining energy of the sensor node and the number of neighboring nodes, the competition vector, the base for competition, and evaluation vector, the evaluation standard, are formed, which correspond to the input vector and weight vector of artificial neural networks respectively. A similarity comparison using the Euclidean distance is made between them after normalization, and the competitive selection of roles and conversion are achieved using the Euclidean distance. Only the winner node will be entitled to make a learning adjustment, and then broadcasts the adjusted competition vector, which is the evaluation vector in the next competition. According to the rule of cluster-head selection from odd hops and cluster-bridge selection from even hops, the network is initialized as that nodes are divided into clusters of scale-uniform and low overlap ratio. The cluster-head initiates the competitive selection of the sleep node if there are too many followers, and its followers compete to sleep. Along with the energy consumption of the node, the cluster-head or cluster-bridge initiates a new election if it detects its energy consumption exceeding a certain threshold, and all the nodes in the cluster participate in competition by means of competitive learning to achieve role conversion. The simulation results show that the network organized by LCACL has balanced energy consumption, stronger ability to resist destruction, better expansibility, and longer lifetime of network, and the ratio of overlap could be 14% if the communication radius is 70 meters.
A generalized software fault classification model
Authors: Omar Shatnawi
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

Most non-homogenous Poisson process (NHPP) based software reliability growth models (SRGMs) presented in the literature assume that the faults in the software are of the same type. This assumption implies that the fault removal rate per remaining faults is independent of the testing time. However, this assumption is not truly representative of reality. It has been observed that the software contains different types of faults and each fault requires different strategies and different amount of testing-effort to remove it. This paper proposes a generalized model based on classification the faults in the software system according to their removal complexity. The removal complexity is proportional to the amount of testing-effort required to remove the fault. The testing-effort expenditures are represented by the number of stages required to remove the fault after the failure observation / fault isolation (with time delay between the stages). Therefore, it explicitly takes into account the faults of different severity and can capture variability in the growth curves depending on the environment it is being used and at the same time it has the capability to reduce either to exponential or S-shaped growth curves. Such modelling approach is very much suited for object-oriented programming and distributed development environments. Actual software reliability data have been used to demonstrate the proposed generalized model.
Multibase: integrating heterogeneous distributed database systems
Authors: John Miles Smith, Philip A. Bernstein, Umeshwar Dayal, Nathan Goodman, Terry Landers, Ken W. T. Lin, Eugene Wong
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Multibase is a software system for integrating access to preexisting, heterogeneous, distributed databases. The system suppresses differences of DBMS, language, and data models among the databases and provides users with a unified global schema and a single high-level query language. Autonomy for updating is retained with the local databases. The architecture of Multibase does not require any changes to local databases or DBMSs. There are three principal research goals of the project. The first goal is to develop appropriate language constructs for accessing and integrating heterogeneous databases. The second goal is to discover effective global and local optimization techniques. The final goal is to design methods for handling incompatible data representations and inconsistent data. Currently the project is in the first year of a planned three year effort. This paper describes the basic architecture of Multibase and identifies some of the avenues to be taken in subsequent research.
A simplified analytical model of crosstalk in polarization division multiplexing system
Authors: Krzysztof Perlicki
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

A simple method of the calculation of the crosstalk between two polarization multiplexed channel in an optical fiber link includes polarization dependence loss and polarization dependence gain is presented. This method allows a significant simplification of the calculation of crosstalk in polarization multiplexed transmission systems. The analytical results are compared with numerical results.
Dynamic Adaption in Composite Web Services Using Expiration Times
Authors: Xiaohao Yu, Xueshan Luo, Honghui Chen, Dan Hu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A key challenge in composite web processes is that the quality of participating services changes during the life time of the process. It is necessary to find an available equivalent service to substitute the failed component which has been made unavailable. In this paper different from the previous method based on recompositing the web process, we present an approach of discovering the “same skill” web services to replace the expired one by using the service expiration times.
Minimizing Total Flow-Time: The Unrelated Case
Authors: Naveen Garg, Amit Kumar, V. N. Muralidhara
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We consider the problem of minimizing flow-time in the unrelated machines setting. We introduce a notion of (&alpha;,&beta;) variability to capture settings where processing times of jobs on machines are not completely arbitrary and give an O(&beta;log&alpha;) approximation for this setting. As special cases, we get (1) an O(k) approximation when there are only k different processing times (2) an O(logP)-approximation if each job can only go on a specified subset of machines, but has the same processing requirement on each such machine. Further, the machines can have different speeds. Here P is the ratio of the largest to the smallest processing requirement, (3) an O(1/&epsilon; log 1/&epsilon;)- approximation algorithm for unrelated machines if we assume that our algorithm has machines which are an &epsilon;-factor faster than the optimum algorithm's machines. We also improve the lower bound on the approximability for the problem of minimizing flow time on parallel machines from $\Omega(\sqrt{\log P/ \log\log P})$ to &Omega;(log1-&epsilon; P) for any &epsilon;> 0.
Covering a Point Set by Two Disjoint Rectangles
Authors: Hee-Kap Ahn, Sang Won Bae
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel but the other rectangle is allowed to have an arbitrary orientation. For both of the problems, we present O(n 2logn)-time algorithms using O(n) space.
Topological Forcing Semantics with Settling
Authors: Robert S. Lubarsky
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

Just as forcing, or Boolean-valued models, produce a model of ZF (when the meta-theory is, or the ground model satisfies, ZF), so do Heyting-valued models satisfy IZF, which stands for Intuitionistic ZF, the standard constructive re-working of the ZF axioms. In this paper, a variant model is introduced (with truth values the Heyting algebra of open sets of a topological space), along with a correspondingly revised forcing or satisfaction relation. Such a model is shown to satisfy only a fragment of IZF. Natural properties of the underlying topological space are shown to imply stronger closure properties of the model. (It is impossible, except in trivial cases, for Power Set to be satisfied.) This semantics generalizes the second model of [9], which is the current semantics for the special case of the underlying topological space being ${\mathbb R}$.
Multichannel image segmentation using adaptive finite elements
Authors: J. Michael Fried
Venue: Computing and Visualization in Science (2009)

We present an adaptive finite element algorithm for segmentation with denoising of multichannel images in two dimensions, of which an extension to three dimensional images is straight forward. It is based on a level set formulation of the Mumford&#x2013;Shah approach proposed by Chan and Vese in (JVCIR 11:130&#x2013;141,(2000); IEEE Trans Image Proces 10(2):266&#x2013;277, (2001); Int J Comp Vis 50(3):271&#x2013;293, (2002)) In case of a minimal partition problem an exact solution is given and convergence of the discrete solution towards this solution is numerically verified.
Quantitative assessment of an agent-based simulation on a time warp executive
Authors: George Vulov, Tianhao He, Maria Hybinette
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We recently introduced SASSY, the design for a hybrid simulator that provides an agent-based API atop a PDES kernel (Hybinette et al. 2006). Our hypothesis is that a design like SASSY offers the advantages of an agent-based paradigm for the application developer, but also provides the performance advantages of a PDES kernel. Since the time of our initial publication, most aspects of SASSY's design have been implemented, and we are now assessing our hypotheses e.g., (He and Hybinette 2008). In this paper we investigate performance advantages for a simple agent-based application on SASSY. In most cases, agent-based simulation environments are configured using a time-step approach, where the simulation proceeds in discrete steps. In this paper we evaluate the performance of a simple application running in a traditional time-step simulation, and also its performance when running on SASSY with PDES support.
The Design of a Switched Reluctance Motor Drive System
Authors: Jiangbiao He, Guangzheng Liang, Shihu Wang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Abstract—A four-phase 8/6 pole and 75kW switched reluctance motor drive based on 32-bit digital signal processor TMS320F2812 is designed. The details of the controller design and analysis are discussed. In addition, aiming at solving the nonlinear problems of the switched reluctance motor, fuzzy-PI hybrid algorithm is presented to control the motor speed and the phase current. Experimental results show that the hardware and software design of the switched reluctance drive system are reasonable, and the proposed fuzzy-PI double closed-loop control strategy is feasible and correct.
Autonomous helicopters
Authors: Gregory Goth
Venue: Communications of the ACM (2009)

Researchers are improving unmanned helicopters' capabilities to address regulatory requirements and commercial uses.
An alternative approach to distributed database updating
Authors: Richard J. Greene
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper presents a new updating approach for a fully redundant DDB operating in a transaction-based environment. Existing approaches utilize either a single, migrating controlling process (DBMS) or multiple controlling processes to access the DDB. Updating approaches based on a single, migrating DBMS generally exhibit simplicity of design and lock-based concurrency control. Unfortunately, access to the DDB is usually single-thread. Approaches based on multiple controlling DBMSs generally exhibit complex design and concurrency control but do permit multi-thread access to the DDB. The approach proposed in this paper, called "Cooperative Multi-Thread" (CMT), is based on a single, migrating DBMS and lock-based concurrency control and yet permits multi-thread access of the DDB. The basis of this approach is the time-driven, cooperative scheduling of control migration. Contrast this with the request-driven, competitive scheduling of control migration of the existing approaches in the genre. The advantages of the proposed approach are an economical communications structure, high throughput, flexibility, and predictable performance. This paper presents the technical aspects of CMT approach as well as a quantitative and qualitative appraisal of it.
Three-Dimensional Metamorphosis using Multiplanar Representation
Authors: Mahesh Ramasubramanian, Anurag Mittal
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We introduce a novel method for three-dimensional metamorphosis between two polyhedral objects with different topologies. The 3D objects are presented as multiple 2D images and well-understood 2D morphing techniques are used to morph between their 2D representations. The resulting 2D morphs are used to reconstruct the intermediate 3D objects. The user controls the metamorphosis by matching features during the 2D morphing stage. Our method is simpler and more efficient than existing 3D morphing techniques which handle general topologies since the interaction and morphing is essentially done in 2-space.
Peer-to-Peer Session Initiation Protocol in Highly Volatile Environments
Authors: Adetola Oredope, Antonio Liotta, Ivan Roper, Jason Morphett
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The Session Initiation Protocol (SIP) is an IETF standardised protocol for multimedia signalling and communication over the internet. SIP has been used in many deployments in client-server architecture. However, this configuration potentially possesses various scalability and redundancy limitations because its architecture relies on various centralised components. To overcome some of these limitations, there has been various proposed architectures for using SIP in a fully decentralised manner with minimal or no centralised authorities. One of these proposed architectures is known as Peer-to-Peer SIP (P2P-SIP), which uses structured p2p overlay networks to lookup and locate SIP resources over the Internet. In this paper we investigate P2P-SIP in a broader perspective beyond the Internet, focusing on the effects of mobility on this approach especially in highly volatile environments in which the underlying p2p overlay never fully converges or stabilises. Our experimental results shows that P2P-SIP systems using CHORD deployed in these environments are highly scalable. But more interestingly, we also show that as the number of peers in the system increases, the signalling overheads per peer in the overlay tends to decrease.
An improved familiarity measurement for formalization of trust in e-commerce based multiagent systems
Authors: Jie Zhang, Ali A. Ghorbani, Robin Cohen
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Familiarity between agents is often considered to be an important factor in determining the level of trust. In electronic marketplaces, trust is modeled, for instance, in order to allow buying agents to make effective selection of selling agents. In previous research, familiarity between two agents has been simply assumed to be the similarity between them, which is fixed for the two agents. We propose an improved familiarity measurement based on the exploration of factors that affect a human's feelings of familiarity and the mapping from those factors to the properties of agent societies. We examine the trust model in the context of a multiagent system within an e-commerce framework. We also carry out experiments to compare the stability of the system using the trust model with the improved familiarity measurement and that with the fixed familiarity values. Experimental results show that the stability of the system is increased by 33.47% through the improved familiarity measurement.
Choose the Damping, Choose the Ranking?
Authors: Marco Bressan, Enoch Peserico
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

To what extent can changes in PageRank's damping factor affect node ranking? We prove that, at least on some graphs, the top k nodes assume all possible k! orderings as the damping factor varies, even if it varies within an arbitrarily small interval (e.g. [0.84999, 0.85001]). Thus, the rank of a node for a given (finite set of discrete) damping factor(s) provides very little information about the rank of that node as the damping factor varies over a continuous interval. We bypass this problem introducing lineage analysis and proving that there is a simple condition, with a "natural" interpretation independent of PageRank, that allows one to verify "in one shot" if a node outperforms another simultaneously for all damping factors and all damping variables (informally, time variant damping factors). The novel notions of strong rank and weak rank of a node provide a measure of the fuzziness of the rank of that node, of the objective orderability of a graph's nodes, and of the quality of results returned by different ranking algorithms based on the random surfer model. We deploy our analytical tools on a 41M node snapshot of the .it Web domain and on a 0.7M node snapshot of the CiteSeer citation graph. Among other findings, we show that rank is indeed relatively stable in both graphs; that &ldquo;classic&rdquo; PageRank (d&thinsp;=&thinsp;0.85) marginally outperforms Weighted In-degree (d&rarr;0), mainly due to its ability to ferret out &ldquo;niche&rdquo; items; and that, for both the Web and CiteSeer, the ideal damping factor appears to be 0.8&thinsp;&minus;&thinsp;0.9 to obtain those items of high importance to at least one (model of randomly surfing) user, but only 0.5&thinsp;&minus;&thinsp;0.6 to obtain those items important to every (model of randomly surfing) user.
SPEC: statistical performance estimation circuit for multiple channel equalization in DWDM
Authors: Stamatios V. Kartalopoulos
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

The power level of communications channels needs to be maintained above specified threshold levels in order to meet the acceptable channel performance at the receiver. The performance of a channel depends on the collective interaction of many factors such as transmission medium, attenuation, bit rate, modulation method, noise, jitter, and more. The channel performance is typically measured in terms of bit error rate, signal to noise ratio, Q-factor, signal power, and others. In optical communications, there are hundreds of channels in a single fiber, in which each channel suffers performance degradations differently because optical amplifiers do not have a flat gain over all channels and/or because photon-matter non-linear interactions are channel selective. In communication, this is addressed with channel performance monitoring and channel equalization; current practices perform equalization on a per channel basis and not in real-time. In this paper, we review optical channel performance and a statistical performance estimation method. Based on this method, we describe the functional blocks of a statistical performance estimation circuit (SPEC). Using the SPEC, we describe a method and a protocol for multiple channel equalization in-service and in real-time.
Introducing HCI: a practitioner's guide
Authors: Steve Cummaford, John Long
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

HCI continues to grow in popularity amongst commercial practitioners, many of whom have no formal training or education in HCI. Conferences, such as HCI 2007, offer an attractive means for practitioners to increase their knowledge and skills. However, many such practitioners can find it difficult to understand how research presentations relate to their specific needs. They often fail to make the most of their attendance at conferences and can struggle to pull through knowledge from the HCI research reported into their own practices, due to their lack of HCI training. This tutorial presents an introduction to the discipline of HCI in the form of a practitioner's guide, and so seeks to help delegates identify conference sessions, which offer the most promise for delivering value to the commercial practitioner. In so doing, it suggests ways in which the research can be pulled through into their practices, so increasing their engagement with HCI.
Probabilistic Acceptors for Languages over Infinite Words
Authors: Christel Baier, Nathalie Bertrand, Marcus Größer
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Probabilistic &omega;-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word requires that the probability for the accepting runs is positive. In this paper, we provide a summary of the fundamental properties of probabilistic &omega;-automata concerning expressiveness, efficiency, compositionality and decision problems.