ppxscal/embedding_network huggingface dataset:
Improving the performance of personal name disambiguation using web directories
Authors: Quang Minh Vu, Atsuhiro Takasu, Jun Adachi
Venue: Information Processing and Management: an International Journal (2008)

Frequent requests from users to search engines on the World Wide Web are to search for information about people using personal names. Current search engines only return sets of documents containing the name queried, but, as several people usually share a personal name, the resulting sets often contain documents relevant to several people. It is necessary to disambiguate people in these result sets in order to to help users find the person of interest more readily. In the task of name disambiguation, effective measurement of similarities in the documents is a crucial step towards the final disambiguation. We propose a new method that uses web directories as a knowledge base to find common contexts in documents and uses the common contexts measure to determine document similarities. Experiments, conducted on documents mentioning real people on the web, together with several famous web directory structures, suggest that there are significant advantages in using web directories to disambiguate people compared with other conventional methods.
Personalized information retrieval system in the framework of fuzzy logic
Authors: M. Oussalah, S. Khan, S. Nefti
Venue: Expert Systems with Applications: An International Journal (2008)

Due to increase in web-based applications, the need for enhanced information retrieval system that accommodate user's needs become crucial. A wide range of commercial information retrieval systems are based on standard Boolean model and at less scale vector models. Although the deficiencies of these models are now part of text-book knowledge, the development of new models still have to overcome the feasibility and testing challenge. This paper advocates a fuzzy based approach for information retrieval where a new model is put forward. Also, its feasibility and performance are demonstrated through a testing with a large-scale university database and whose results are compared to a standard commercial Boolean model.
A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
Authors: Elisabeth Gassner, Johannes Hatzl
Venue: Computing (2008)

This paper concerns a domination problem in graphs with parity constraints. The task is to find a subset of the vertices with minimum cost such that for every vertex the number of chosen vertices in its neighbourhood has a prespecified parity. This problem is known to be $${\mathcal NP}$$-hard for general graphs. A linear time algorithm was developed for series-parallel graphs and trees with unit cost and restricted to closed neighbourhoods. We present a linear time algorithm for the parity domination problem with open and closed neighbourhoods and arbitrary cost functions on graphs with bounded treewidth and distance-hereditary graphs.
Improved hybrid simulated annealing algorithm for navigation scheduling for the two dams of the Three Gorges Project
Authors: Xiaopan Zhang, Xiaohui Yuan, Yanbin Yuan
Venue: Computers Mathematics with Applications (2008)

The purpose of this paper is to deal with the optimal navigation co-scheduling (NCS) for the two dams of the Three Gorges Project in China, i.e., the Three Gorges Dam and the Gezhouba Dam. The co-scheduling includes the operational scheduling for all five locks of the two dams, and the dispatching scheduling to ships applying to pass the dams. Compared with the flexible manufacturing system (FMS), a mixed-integer nonlinear programming model is designed for the NCS, and an improved hybrid algorithm of simulated annealing and local search is addressed to obtain optimal scheduling. Experiments based on real historical execution data show that the approach is feasible.
Comparison of wind data from QuikSCAT and buoys in the Indian Ocean
Authors: K. Satheesan, A. Sarkar, A. Parekh, M. R. Ramesh Kumar, Y. Kuroda
Venue: International Journal of Remote Sensing (2007)

The performance of QuikSCAT-derived wind vectors is evaluated using in-situ data from moored buoys over the Indian Ocean. The results show that the mean differences for wind speed and wind direction are 0.37 ms-1 and 5.8°, root mean square deviations are 1.57 ms-1 and 44.1° and corresponding coefficients of correlation are 0.87 and 0.75, respectively. The matching between in-situ and satellite estimates seems to be better in the North Indian Ocean than in the Equatorial Indian Ocean. The effects of sea surface temperature and air-sea temperature difference on wind residuals were also investigated. In general, QuikSCAT is found to overestimate the winds. It is speculated that low wind speed during rain-free conditions and high wind speed, normally associated with rain, may be the reason for the less accurate estimation of the wind vector from QuikSCAT over the Indian Ocean.
Workload-Aware Query Routing Trees in Wireless Sensor Networks
Authors: Panayiotis Andreou, Demetrios Zeinalipour-Yazti, Panos K. Chrysanthis, George Samaras
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Continuous queries in wireless sensor networks are established on the premise of a routing tree that provides each sensor with a path over which answers can be transmitted to the query processor. We found that these structures are sub-optimality constructed in predominant data acquisition systems leading to an enormous waste of energy. In this paper we present MicroPulse, a workload-aware optimization algorithm for query routing trees in wireless sensor networks. Our algorithm is established on profiling recent data acquisition activity and on identifying the bottlenecks using an in-network execution of the critical path method. A node S utilizes this information in order to locally derive the time instance during which it should wake up, the interval during which it should deliver its workload and the workload increase tolerance of its parent node. We additionally provide an elaborate description of energy-conscious algorithms for disseminating and maintaining the critical path cost in a distributed manner. Our trace-driven experimentation with real sensor traces from Intel Research Berkeley shows that MicroPulse can reduce the data acquisition costs by many orders.
Process Analysis, Modeling and Simulation for Crisis Management
Authors: Francis Rousseaux, Kevin Lhoste
Venue: Proceedings of the 2008 International Workshop on Advanced Information Systems for Enterprises (2008)

The paper aims to present a real experience of designing a Control, Command, Communication, and Intelligence system to support crisis management through a three step business process. A better understanding of what is a crisis and a model of knowledge gathering appeared within the system development. We will explain this particular business process management through the successful example of the CHEOPS Project. When a company wants to offer a new tender for its clients in the geopolitical crisis management domain, it has to solve a dilemma. Firstly it has to build rapidly, a functional product in order to take a place on this well discussed market but on the long term this strategy isn’t sufficient. An incremental design process is required in order to organize an architecture, to bring out functional and ergonomic specifications, and to structure an ontological application such as a multi-agent cooperation model.Furthermore a reflection on what a crisis is, on the values level which helps to make the model more accurate can be added.We will explain this three step business process through the successful example of the CHEOPS Project. Firstly, we will describe its risk management system, then we will put the emphasis on its multi-agent cooperation model, and lastly, we will present a situation analysis as a constructive modeling process and we will finish with an analysis on the CHEOPS project business management and its possibilities of evolution.
On the coordinator's rule for Fast Paxos
Authors: Gustavo M. D. Vieira, Luiz E. Buzato
Venue: Information Processing Letters (2008)

Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are started by a coordinator process and consistency is guaranteed by the rule used by this process for the selection of v and by the properties of process sets called quorums. We show a simplified version of this rule for the specific case where the quorums are defined by the cardinality of these process sets. This rule is of special interest for implementors of the algorithm.
Efficient Cost-Based Tracking of Scheduled Vehicle Journeys
Authors: Dalia Tieyte, Christian S. Jensen
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Applications in areas such as logistics, cargo delivery, and collective transport involve the management of fleets of vehicles that are expected to travel along known routes according to schedules. There is a fundamental need by the infrastructure surrounding the vehicles to know the actual status of the vehicles. Since the vehicles deviate from their schedules due to road construction, accidents, and other unexpected conditions, it is necessary for the vehicles to communicate with the infrastructure. Frequent updates introduce high communication costs, and server-side updates easily become a bottleneck. This paper presents techniques that enable the tracking of vehicle positions and arrival times at scheduled stops with little communication, while still offering the desired accuracy to the infrastructure of the status of the vehicles. Experimental results with real GPS data from buses show that the proposed techniques are capable of reducing the number of updates significantly compared to a state-of-the art approach where vehicles issue updates at pre-defined positions along their routes.
Transactions on Data Hiding and Multimedia Security III, 1 edition
Authors: Yun Q. Shi
Venue: Lecture Notes In Computer Science (2008)

Since the mid 1990s, data hiding has been proposed as an enabling technology for securing multimedia communication, and is now used in various applications including broadcast monitoring, movie fingerprinting, steganography, video indexing and retrieval, and image authentication. Data hiding and cryptographic techniques are often combined to complement each other, thus triggering the development of a new research field of multimedia security. Besides, two related disciplines, steganalysis and data forensics, are increasingly attracting researchers and becoming another new research field of multimedia security. This journal, LNCS Transactions on Data Hiding and Multimedia Security, aims to be a forum for all researchers in these emerging fields, publishing both original and archival research results. This third issue contains five contributions in the areas of steganography and digital watermarking. The first two papers deal with the security of steganographic systems; the third paper presents a novel image steganographic scheme. Finally, this volume includes two papers that focus on digital watermarking and data hiding. The fourth paper introduces and analyzes a new covert channel and the fifth contribution analyzes the performance of additive attacks against quantization-based data hiding methods.
Approach to conservation laws based on Bayes group generators and its geodesic flows
Authors: Manouchehr Amiri
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

On the basis of Bayes transformation group generators, we introduce geodesic flows in non-Euclidean Bayes group manifold and derive the relation between conditional likelihoods and affine connections of this topological group manifold in four dimensional parametric space. Using this method, we show that field equations of log-likelihoods are similar to spinless particle field equations. Generalization to the two dimensional space-time leads to the well known Lorentz transformation. By introducing the relation between probability conservation and conservation of physical quantities, we derive momentum conservation law and solutions of one dimensional heat transfer.
A process analysis and modeling framework for the concurrent engineering of business processes and manufacturing activities: conceptual design
Authors: Ricardo Velez, Reijo Tuokko
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Manufacturer's supply chains are growing enormously complex. The move towards a knowledge-based economy is placing companies in an extremely tight position, with a balancing act between process innovation and competitiveness in the market to make enough profit to stay afloat. A framework for process analysis and modeling is proposed as a solution for handling the complexity of supply networks, enabling the concurrent deployment of business processes and manufacturing activities. The present paper introduces the conceptual design of such as framework.
Distributed Compression of Correlated Signals Using Random Projections
Authors: Iñaki Esnaola, Javier Garcia-Frias
Venue: Proceedings of the Data Compression Conference (2008)

Recent developments in compressed sensing have shown that if a signal can be compressed in some basis, then it can be reconstructed in such basis from a certain number ofrandom projections. Distributed compressed sensing, where several correlated signals are compressed in a distributed manner, has also been proposed in the literature. By allowing additional distortion, successful recovery in distributed compressed sensing can be achieved even if the projections are corrupted by noise. We extend this resultby showing that in addition to sparsity, it is possible to exploit prior knowledge existing in the correlation between the signals of interest to significantly improve reconstruction performance. This is done in a fashion resembling distributed coding of digital sources.
Optimal vertex elimination in single-expression-use graphs
Authors: Uwe Naumann, Yuxiao Hu
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

The source transformation tool for automatic differentiation of Fortran programs ADIFOR uses a preaccumulation technique to speed up tangent-linear codes significantly compared to the standard forward mode. Reverse mode automatic differentiation is applied to all scalar assignments to generate efficient code for the computation of local gradients. It has been well known for some time that reverse mode is not necessarily the optimal choice for the computation of these statement-level gradients as it does not minimize the number of operations required. This article presents an efficient algorithm for the solution of this combinatorial optimization problem. The corresponding software is freely available for downloading on our website. Developers of software for automatic differentiation are invited to integrate the algorithm into their tools. Gradients of scalar multivariate functions can be computed by elimination methods on the linearized computational graph. The combinatorial optimization problem that aims to minimize the number of arithmetic operations performed by the elimination algorithm is known to be NP-complete. In this article we present a polynomial algorithm for solving a relevant subclass of this problem's instances. The proposed method relies on the ability to compute vertex covers in bipartite graphs in polynomial time. A simplified version of this graph algorithm is used in a research prototype of the differentiation-enabled NAGWare Fortran compiler for the preaccumulation of local gradients of scalar assignments in the context of automatic generation of efficient tangent-linear code for numerical programs.
A generic proposal for a transparent integration of distributed data by an autonomous layer in a virtual repository
Authors: Kamil Kuliberda, Radoslaw Adamus, Jacek Wislicki, Krzysztof Kaczmarski, Tomasz Marek Kowalski, Kazimierz Subieta
Venue: Multiagent and Grid Systems (2007)

The article describes a solution to a problem of integration of distributed, heterogeneous and variously fragmented collections of data located in object-oriented databases. Basing on their investigation, authors present three methods of integration procedures for differently structured databases constituting virtual repositories in a data grid with a P2P architecture. The core of the described architecture is based on the Stack-Based Query Language (SBQL) and virtual updatable SBQL views. In the background, the system is based on a P2P architecture for data transporting and indexing. The article provides three short examples on how to apply the proposal in virtual repository. The procedures are implemented under the integrator prototype.
OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes
Authors: Jean Utke, Uwe Naumann, Mike Fagan, Nathan Tallent, Michelle Strout, Patrick Heimbach, Chris Hill, Carl Wunsch
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

The Open/ADF tool allows the evaluation of derivatives of functions defined by a Fortran program. The derivative evaluation is performed by a Fortran code resulting from the analysis and transformation of the original program that defines the function of interest. Open/ADF has been designed with a particular emphasis on modularity, flexibility, and the use of open source components. While the code transformation follows the basic principles of automatic differentiation, the tool implements new algorithmic approaches at various levels, for example, for basic block preaccumulation and call graph reversal. Unlike most other automatic differentiation tools, Open/ADF uses components provided by the Open/AD framework, which supports a comparatively easy extension of the code transformations in a language-independent fashion. It uses code analysis results implemented in the OpenAnalysis component. The interface to the language-independent transformation engine is an XML-based format, specified through an XML schema. The implemented transformation algorithms allow efficient derivative computations using locally optimized cross-country sequences of vertex, edge, and face elimination steps. Specifically, for the generation of adjoint codes, Open/ADF supports various code reversal schemes with hierarchical checkpointing at the subroutine level. As an example from geophysical fluid dynamics, a nonlinear time-dependent scalable, yet simple, barotropic ocean model is considered. OpenAD/F's reverse mode is applied to compute sensitivities of some of the model's transport properties with respect to gridded fields such as bottom topography as independent (control) variables.
Private computations over the integers
Authors: B. Chor
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The possibility of private distributed computations of n-argument functions defined over the integers is considered. A function f is t-private if there exists a protocol for computing f so that no coalition of
Scenario Similarity Map for Visualizing Classified Scenarios
Authors: Keitaro Osawa, Atsushi Ohnishi
Venue: Proceedings of the Second International Workshop on Requirements Engineering Visualization (2007)

A visually classification method of scenarios using differential information between normal scenarios is presented. Behaviors of normal scenarios belonging to the same problem domain are quite similar. We derive the differential information, named differential scenario, from such normal scenarios and apply the differential scenario to classify scenarios. Our method will be illustrated with examples. This paper describes (1) a language for describing scenarios in which simple action traces are embellished to include typed frames based on a simple case grammar of actions, (2) an introduction of the differential scenario, and (3) a method of visualizing scenario classification named Scenario Similarity Map using the differential scenario.
WebLAut: A Universal Human-Machine Interface for Process Visualization
Authors: Ali Malek-Zadeh, Heinrich Dietsch
Venue: Proceedings of the Third International Conference on Systems (2008)

In this contribution it is shown, that the possibilities for the future global management of automation-technical systems is to be increased by Internet technologies. It is, in addition, possible to reduce the complexity in handling such systems. This contribution describes an infrastructure for visualisation of electrical drives and their associated control environment via internet and usual web browser and remote handling with such devices. The service oriented architecture presented is based on “web technologies”. A description is given of a prototype implementation called WebLAut at the Erlangen Chair of Information Technologies (LIKE). It will be presented by means of various scenarios on the simulation model.
Supporting superpage allocation without additional hardware support
Authors: Mel Gorman, Patrick Healy
Venue: Proceedings of the 7th international symposium on Memory management (2008)

Today, many modern processors support more than one page size. The larger pages, called superpages, have been identified as one means of reducing the time spent servicing translation lookaside buffer (TLB) misses in the early 1990s by increasing TLB reach. Widespread usage of superpages has been limited by the requirement that superpages consist of physically contiguous and naturally-aligned small pages. This makes external fragmentation a serious problem for an operating system, one that is almost non-existent when processes use only one page size. Hardware solutions to mitigate this limitation such as sub-blocking, shadow page-tables and a variety of hybrid solutions have not seen wide-spread adoption. This has curtailed automatic superpage support as it is known that superpage availability will decrease during the system's lifetime as external fragmentation grows. This paper presents a placement policy for an operating system's physical page allocator to mitigate external fragmentation problems by grouping pages based on the system's ability to relocate the data. Secondly, the necessary changes to the page reclamation algorithm for it to be contiguity-aware are described while minimising impact to the reclamation algorithms' normal decisions. The performance impact on different machine types is illustrated and it is shown that the superpage allocation success rate is improved. These mechanisms are complementary to any of the hardware solutions proposed in the past.