pinecone/core-2020-05-10-deduplication huggingface dataset:
Joint sensor selection and data routing in sensor networks

We propose a new joint sensor selection and routing algorithm, which selects a set of sensor nodes (sensing nodes) in a sensor network to take measurements, and determines a set of paths connecting the sensing nodes to the sink node. Our objective is to maximize the network lifetime, while satisfying the data precision required by the user. We first develop a multi-objective optimization model for this problem and design the near-optimal OPT-RE algorithm based on this model for network lifetime maximization. Next, we design a low complexity heuristic called SP-RE. SP-RE first labels the links between the nodes with a metric which trades off the residual energies of the transmitting and receiving nodes with the required transmission and reception energy. Then, SP-RE calculates the shortest paths from all nodes to the sink, and identifies the node which is closest to the sink as a sensing node. This process is repeated until the required data precision is satisfied. We demonstrate by simulations that SP-RE and OPT-RE can increase the network lifetime several orders of magnitude compared to naive approaches
Dynamical variational principles for strongly correlated electron
  systems

The self-energy-functional approach (SFA) is discussed in the context of
different variational principles for strongly correlated electron systems.
Formal analogies between static and dynamical variational approaches, different
types of approximation strategies and the relations to density-functional and
dynamical mean-field theory are emphasized. The discussion elucidates the
strengths of the SFA in the construction of new non-perturbative approximations
but also the limitations of the approach and thereby opens up future
perspectives.Comment: 12 pages, 1 eps figures included, Adv. Solid State Phys. (in press
Intrinsic Spin Hall Effect

A brief review is given on the spin Hall effect, where an external electric
field induces a transverse spin current. It has been recognized over 30 years
that such effect occurs due to impurities in the presence of spin-orbit
coupling. Meanwhile, it was proposed recently that there is also an intrinsic
contribution for this effect. We explain the mechanism for this intrinsic spin
Hall effect. We also discuss recent experimental observations of the spin Hall
effect.Comment: 13 pages, 3 figures, to appear in Advances in Solid State Physics,
  Vol 45(2005), edited by B. Kramer, changes in Sections 3 and 4.
Flavor Degeneracy and Effects of Disorder in Ultracold Atom Systems

Cold atoms in optical lattices offer an exciting new laboratory where quantum
many-body phenomena can be realized in a highly controlled way. They can even
serve as quantum simulators for notoriously difficult problems like
high-temperature superconductivity. This review is focussed on recent
developments and new results in multi-component systems. Fermionic atoms with
SU(N) symmetry have exotic superfluid and flavor-ordered ground states. We
discuss symmetry breaking, collective modes and detection issues. Bosonic
multi-flavor ensembles allow for engineering of spin Hamiltonians which are
interesting from a quantum computation point of view. Finally, we will address
the competition of disorder and interaction in optical lattices. We present a
complete phase diagram obtained within dynamical mean-field theory and discuss
experimental observability of the Mott and Anderson phases.Comment: 13 pages, 9 eps figures included, Adv. Solid State Phys. (in press
Modelling, optimisation and decision support using the grid

Modelling, Optimisation and Decision Support tools are vital in most areas of engineering.  As part of the Distributed Aircraft Maintenance Environment (DAME) e-Science project, a virtual “work-bench” has been developed that can aid the engineer in solving engineering design problems.  While the problem that motivated the development of these tools was taken from the aerospace industry, this sort of approach has broader application in areas such as automotive and marine engineering, as well as in the medical industry.
Strategies for distributing goals in a team of cooperative agents

This paper addresses the problem of distributing goals to individual agents inside a team of cooperative agents. It shows that several parameters determine the goals of particular agents. The first parameter is the set of goals allocated to the team; the second parameter is the description of the real actual world; the third parameter is the description of the agents' ability and commitments. The last parameter is the strategy the team agrees on: for each precise goal, the team may define several strategies which are orders between agents representing, for instance, their relative competence or their relative cost. This paper also shows how to combine strategies. The method used here assumes an order of priority between strategie
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions
  with respect to the {I,H,N}^n Transform

We enumerate the inequivalent self-dual additive codes over GF(4) of
blocklength n, thereby extending the sequence A090899 in The On-Line
Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a
well-known interpretation as quantum codes. They can also be represented by
graphs, where a simple graph operation generates the orbits of equivalent
codes. We highlight the regularity and structure of some graphs that correspond
to codes with high distance. The codes can also be interpreted as quadratic
Boolean functions, where inequivalence takes on a spectral meaning. In this
context we define PAR_IHN, peak-to-average power ratio with respect to the
{I,H,N}^n transform set. We prove that PAR_IHN of a Boolean function is
equivalent to the the size of the maximum independent set over the associated
orbit of graphs. Finally we propose a construction technique to generate
Boolean functions with low PAR_IHN and algebraic degree higher than 2.Comment: Presented at Sequences and Their Applications, SETA'04, Seoul, South
  Korea, October 2004. 17 pages, 10 figure
IR of XML documents – A collective Ranking Strategy

Within the area of Information Retrieval (IR) the importance of appropriate\ud
ranking of results has increased markedly. The importance is magnified\ud
in the case of systems dedicated to XML retrieval, since users of these systems\ud
expect the retrieval of highly relevant and highly precise components, instead\ud
of the retrieval of entire documents. As an international, coordinated effort\ud
to evaluate the performance of Information Retrieval systems, the Initiative\ud
for the Evaluation of XML Retrieval (INEX) encourages participating organisation\ud
to run queries on their search engines and to submit their result for the annual\ud
INEX workshop. In previous INEX workshops the submitted results were\ud
manually assessed by participants and the search engines were ranked in terms\ud
of performance. This paper presents a Collective Ranking Strategy that outperforms\ud
all search engines it is based on. Moreover it provides a system that is\ud
trying to facilitate the ranking of participating search engines
Ubiquitous systems and Petri nets

Several years before the popularization of the Internet, Mark Weiser proposed the concept of ubiquitous computing with the purpose of enhancing the use of computers by making many computers available throughout the physical environment, but making them effectively invisible to the user. Nowadays, such idea affects all areas of computing science, including both hardware and software. In this paper, a formal model for ubiquitous systems based on Petri nets is introduced and motivated with examples and applications. This simple model allows the definition of two-level ubiquitous systems, composed of a collection of processor nets providing services, and a collection of process nets requesting those services. The modeled systems abstract from middleware details, such as service discovery protocols, and security infrastructures, such as PKI’s or trust policies, but not from mobility or component compatibility
Applications of graph coloring

International Conference on Computational Science and Its Applications - ICCSA 2005; 9 May 2005 through 12 May 2005A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package Color
Mathematica applications on time scales

International Conference on Computational Science and Its Applications - ICCSA 2005; 9 May 2005 through 12 May 2005Stefan Hilger introduced the calculus on time scales in order to unify continuous and discrete analysis in 1988. The study of dynamic equations is an active area of research since time scales unifies both discrete and continuous processes, besides many others. In this paper we give many examples on derivative and integration on time scales calculus with Mathematica. We conclude with solving the first order linear dynamic equation N Δ(t) = N(t), and show that the solution is a generalized exponential function with Mathematica
A first-order ε-approximation algorithm for linear programs and a second-order implementation

This article presents an algorithm that finds an e-feasible solution relatively to some constraints of a linear program. The algorithm is a first-order feasible directions method with constant stepsize that attempts to find the minimizer of an exponential penalty function. When embedded with bisection search, the algorithm allows for the approximated solution of linear programs. We present applications of this framework to set-partitioning problems and report some computational results with first-order and second-order implementations..info:eu-repo/semantics/publishedVersio
Inferring AS Relationships: Dead End or Lively Beginning?

Recent techniques for inferring business relationships between ASs have
yielded maps that have extremely few invalid BGP paths in the terminology of
Gao. However, some relationships inferred by these newer algorithms are
incorrect, leading to the deduction of unrealistic AS hierarchies. We
investigate this problem and discover what causes it. Having obtained such
insight, we generalize the problem of AS relationship inference as a
multiobjective optimization problem with node-degree-based corrections to the
original objective function of minimizing the number of invalid paths. We solve
the generalized version of the problem using the semidefinite programming
relaxation of the MAX2SAT problem. Keeping the number of invalid paths small,
we obtain a more veracious solution than that yielded by recent heuristics
A split-step PSO algorithm in prediction of water quality pollution

In order to allow the key stakeholders to have more float time to take appropriate precautionary and preventive measures, an accurate prediction of water quality pollution is very significant. Since a variety of existing water quality models involve exogenous input and different assumptions, artificial neural networks have the potential to be a cost-effective solution. This paper presents the application of a split-step particle swarm optimization (PSO) model for training perceptrons to forecast real-time algal bloom dynamics in Tolo Harbour of Hong Kong. The advantages of global search capability of PSO algorithm in the first step and local fast convergence of Levenberg-Marquardt algorithm in the second step are combined together. The results demonstrate that, when compared with the benchmark backward propagation algorithm and the usual PSO algorithm, it attains a higher accuracy in a much shorter time.Department of Civil and Environmental EngineeringAuthor name used in this publication: Kwokwing Chau2004-2005 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Long-term prediction of discharges in Manwan Reservoir using artificial neural network models

Several artificial neural network (ANN) models with a feed-forward, back-propagation network structure and various training algorithms, are developed to forecast daily and monthly river flow discharges in Manwan Reservoir. In order to test the applicability of these models, they are compared with a conventional time series flow prediction model. Results indicate that the ANN models provide better accuracy in forecasting river flow than does the auto-regression time series model. In particular, the scaled conjugate gradient algorithm furnishes the highest correlation coefficient and the smallest root mean square error. This ANN model is finally employed in the advanced water resource project of Yunnan Power Group.Department of Civil and Environmental EngineeringAuthor name used in this publication: Kwokwing Chau2004-2005 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Automatic extraction of semantic relationships for WordNet by means of pattern learning from Wikipedia

The final publication is available at Springer via http://dx.doi.org/10.1007/11428817_7Proceedings of 10th International Conference on Applications of Natural Language to Information Systems, NLDB 2005, Alicante, Spain, June 15-17, 2005.This paper describes an automatic approach to identify lexical patterns which represent semantic relationships between concepts, from an on-line encyclopedia. Next, these patterns can be applied to extend existing ontologies or semantic networks with new relations. The experiments have been performed with the Simple English Wikipedia and WordNet 1.7. A new algorithm has been devised for automatically generalising the lexical patterns found in the encyclopedia entries. We have found general patterns for the hyperonymy, hyponymy, holonymy and meronymy relations and, using them, we have extracted more than 1200 new relationships that did not appear in WordNet originally. The precision of these relationships ranges between 0.61 and 0.69, depending on the relation.This work has been sponsored by CICYT, project number TIC2002-01948
Multilevel static real-time scheduling algorithms using graph partitioning

5th International Conference on Computational Science - ICCS 2005; Atlanta, GA; United States; 22 May 2005 through 25 May 2005We propose static task allocation algorithms for the periodic tasks of a distributed real-time system. The cyclic task consists of task threads which may communicate and share resources. A graph partitioning process and a thread sequencing algorithm are applied to these threads to yield local schedules. The exact analysis is then obtained and further refinements are performed if the worst case response time of a task is greater than its deadline
Implementation of a cluster based routing protocol for mobile networks

5th International Conference on Computational Science - ICCS 2005; Atlanta, GA; United States; 22 May 2005 through 25 May 2005We show the implementation and the simulation results of a hierarchical, cluster based routing protocol for mobile ad hoc networks using Parallel Virtual Machine (PVM). The network represented by a graph is partitioned into clusters by a graph partitioning algorithm and the shortest routes are first calculated locally in each cluster in the first srep. The simplified network which consists only of the nodes that have connections to other clusters called the neighbor nodes is then formed and the shortest routes are calculated for this simple network as the second step. A complete route between the two nodes of different clusters is formed by the union of intra-cluster and inter-cluster routes. We show the implementation results using PVM where a workstation represents a cluster and each node is a PVM process. The results obtained support the theoretical considerations where the efficiency increases by the number of clusters in use
A peer-to-peer approach to content dissemination and search in collaborative networks

05.08.13 KB. Ok to add to spiral. Springer policyThere are three key driving forces behind the development of Internet Content Management Systems (CMS) - a desire to manage the explosion of content, a desire to provide structure and meaning to content in order to make it accessible, and a desire to work collaboratively to manipulate content in some meaningful way. Yet the traditional CMS has been unable to meet the latter of these requirements, often failing to provide sufficient tools for collaboration in a distributed context. Peer-to-Peer (P2P) systems are networks in which every node is an equal participant (whether transmitting data, exchanging content, or invoking services) and there is an absence of any centralised administrative or coordinating authorities. P2P systems are inherently more scalable than equivalent client-server implementations as they tend to use resources at the edge of the network much more effectively. This paper details the rationale and design of a P2P middleware for collaborative content management
High reliability replication technique for web-server cluster systems

Providing reliable and efficient services are primary goals in designing a web server system. Data replication can be used to improve the reliability of the system. However, mapping mechanism is one of the primary concerns to data replication. In this paper, we propose a mapping mechanism model called enhanced domain name server (E-DNS) that dispatches the user requests through the URL-name to IP-address under Neighbor Replica Distribution Technique (NRDT) to improve the reliability of the system
Comparing Bug Finding Tools with Reviews and Tests

Bug finding tools can find defects in software source code us- ing an
automated static analysis. This automation may be able to reduce the time spent
for other testing and review activities. For this we need to have a clear
understanding of how the defects found by bug finding tools relate to the
defects found by other techniques. This paper describes a case study using
several projects mainly from an industrial environment that were used to
analyse the interrelationships. The main finding is that the bug finding tools
predominantly find different defects than testing but a subset of defects found
by reviews. However, the types that can be detected are analysed more
thoroughly. Therefore, a combination is most advisable if the high number of
false positives of the tools can be tolerated.Comment: 16 pages, 1 figur
Bayesian sequence learning for predicting protein cleavage points

A challenging problem in data mining is the application of efficient techniques to automatically annotate the vast databases of biological sequence data. This paper describes one such application in this area, to the prediction of the position of signal peptide cleavage points along protein sequences. It is shown that the method, based on Bayesian statistics, is comparable in terms of accuracy to the existing state-of-the-art neural network techniques while providing explanatory information for its predictions
An Ontology-Based Information Retrieval Model

The final publication is available at Springer via http://dx.doi.org/10.1007/11431053_31Proceedings of Second European Semantic Web Conference, ESWC 2005, Heraklion, Crete, Greece, May 29–June 1, 2005.Semantic search has been one of the motivations of the Semantic Web since it was envisioned. We propose a model for the exploitation of ontology-based KBs to improve search over large document repositories. Our approach includes an ontology-based scheme for the semi-automatic annotation of documents, and a retrieval system. The retrieval model is based on an adaptation of the classic vector-space model, including an annotation weighting algorithm, and a ranking algorithm. Semantic search is combined with keyword-based search to achieve tolerance to KB incompleteness. Our proposal is illustrated with sample experiments showing improvements with respect to keyword-based search, and providing ground for further research and discussion.This research was supported by the European Commission under contract FP6-
001765 aceMedia. The expressed content is the view of the authors but not necessarily
the view of the aceMedia project as a whole. The authors would like to thank the
reviewers for their detailed, accurate and helpful coments
General homomorphic overloading

A general homomorphic overloading in a first-order type system is discussed and its attendant subtype inference problem is formulated. We propose a computationally efficient type inference algorithm by converting the attendant constraint-satisfaction problem into the algebraic path problem for a constraint graph weighted with elements of a specially constructed non-commutative star semiring. The elements of the semiring are monotonic functions from integers to integers (including ?????) with pointwise maximum and function composition as semiring operations. The computational efficiency of our method is due to Kleene???s algebraic path method???s cubic complexit
Finding iteration patterns in dynamic Web page authoring

The final publication is available at Springer via http://dx.doi.org/10.1007/11431879_10Revised Selected Papers of the Joint Working Conferences EHCI-DSVIS 2004, Hamburg, Germany, July 11-13, 2004Most of the current WWW is made up of dynamic pages. The development of dynamic pages is a difficult and costly endeavour, out-of-reach for most users, experts, and content producers. We have developed a set of techniques to support the edition of dynamic web pages in a WYSIWYG environment. In this paper we focus on specific techniques for inferring changes to page generation procedures from users actions on examples of the pages generated by these procedures. More specifically, we propose techniques for detecting iteration patterns in users’ behavior in web page editing tasks involving page structures like lists, tables and other iterative HTML constructs. Such patterns are used in our authoring tool, DESK, where a specialized assistant, DESK-A, detects iteration patterns and generates, using Programming by Example, a programmatic representation of the user’s actions. Iteration patterns help obtain a more detailed characterization of users’ intent, based on user monitoring techniques, that is put in relation to application knowledge automatically extracted by our system from HTML pages. DESK-A relieves end-users from having to learn programming and specification languages for editing dynamic-generated web pages.The work reported in this paper is being supported by the Spanish Ministry of Science
and Technology (MCyT), project number TIC2002-194
A framework to integrate particle filters for robust tracking in non-stationary environments

Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), 2005, Estoril (Portugal)In this paper we propose a new framework to integrate several particle filters, in order to obtain a robust tracking system able to cope with abrupt changes of illumination and position of the target. The proposed method is analytically justified and allows to build a tracking procedure that adapts online and simultaneously the colorspace where the image points are represented, the color distributions of the object and background and the contour of the object.This work was supported by projects: 'Navegación autónoma de robots guiados por objetivos visuales' (070-720), 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929).Peer Reviewe