ppxscal/embedding_network huggingface dataset:
Reasoning about common knowledge with infinitely many agents
Authors: Joseph Y. Halpern, Richard A. Shore
Venue: Information and Computation (2004)

Complete axiomatizations and exponential-time decision procedures are provided for reasoning about knowledge and common knowledge when there are infinitely many agents. The results show that reasoning about knowledge and common knowledge with infinitely many agents is no harder than when there are finitely many agents, provided that we can check the cardinality of certain set differences G - G', where G and G' are sets of agents. Since our complexity results are independent of the cardinality of the sets G involved, they represent improvements over the previous results even when the sets of agents involved are finite. Moreover, our results make clear the extent to which issues of complexity and completeness depend on how the sets of agents involved are represented.
Design of a virtual combine harvester
Authors: K. Maertens, J. De Baerdemaeker
Venue: Mathematics and Computers in Simulation (2004)

Separation processes in agricultural machinery are typically non-linear, complex and uncertain. On-line measurements of input and output data are not available. Therefore, black-box modelling is not applicable and other techniques to describe the system must be used. In this paper, a dynamic separation model is constructed to predict the input-output behaviour of the separation section based on a combination of physical process knowledge and experimental results.When the hybrid separation model is implemented in a framework to simulate the total harvesting process, a virtual combine harvester is obtained, ready to process virtual fields that are created with standard software programs.
Gazing and frowning as a new human--computer interaction technique
Authors: Veikko Surakka, Marko Illi, Poika Isokoski
Venue: ACM Transactions on Applied Perception (TAP) (2004)

The present aim was to study a new technique for human--computer interaction. It combined the use of two modalities, voluntary gaze direction and voluntary facial muscle activation for object pointing and selection. Fourteen subjects performed a series of pointing tasks with the new technique and with a mouse. At short distances the mouse was significantly faster than the new technique. However, there were no statistically significant differences at medium and long distances between the techniques. Fitts' law analyses were performed both by using only error-free trials and using also data including error trials (i.e., effective target width). In all cases both techniques seemed to follow Fitts' law, although for the new technique the effective target width correlation coefficient was smaller R = 0.776 than for the mouse R = 0.991. The regression slopes suggested that at very long distances (i.e., beyond 800 pixels) the new technique might be faster than the mouse. The new technique showed promising results already after a short practice and in the future it could be useful especially for physically challenged persons.
Domain decomposition technique for aeroacoustic simulations
Authors: Renzo Arina, Marco Falossi
Venue: Applied Numerical Mathematics (2004)

A computational tool for the simulation of time harmonic sound propagation in open domains is proposed. It consists of a two step technique. In the first step the viscous flow field is calculated, solving the incompressible Navier-Stokes equations. In the second step the acoustic field is obtained solving the Lighthill's wave equation. The two calculations are performed on two different grids, both formed by non-conforming subdomains. The Lighthill's wave equation is solved in the frequency domain, with a high order accurate compact finite difference scheme. To test the acoustic solver, the phenomenon of wave diffraction past an obstacle is calculated. The results confirm that the interface transmission conditions as well the non-reflecting boundary conditions do not affect the accuracy of the scheme. The complete aeroacoustic technique is applied to the simulation of the noise radiation from a cavity with a grazing subsonic laminar boundary layer. The flow field presents a periodic vortex shedding past the cavity, the vortical flow being a noise source. The numerical results show the existence of the directivity character of the acoustic radiation.
Semantic Web Digital Archive Integration
Authors: C. Costilla, J. P. Palacios, M. J. Rodriguez, J. Cremades, A. Calleja, R. Fernandez, J. Vila
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The existence of huge amounts of data on the Web has raised an increasing challenge to locate right information at right time, as well as to integrating information effectively to provide a comprehensive source of useful information. Digital Archives constitute an important specific domain in which Web Integration needs to be researched. We have implemented the parliamentary web digital archive of the 'Asamblea' of Madrid (e-government) that is successfully running since 1999. Starting from this previous result, this paper proposes a virtual and dynamic web integrated architecture, based on Mediator and Wrappers, containing an Ontological Kernel for providing a universal semantic unification of virtual integrated Digital Archive concepts.
Colouring of cubic graphs by Steiner triple systems
Authors: Fred Holroyd, Martin Škoviera
Venue: Journal of Combinatorial Theory Series B (2004)

Let J be a Steiner triple system and G a cubic graph. We say that G is J-colourable if its edges can be coloured so that at each vertex the incident colours form a triple of J. We show that if J is a projective system PG(n, 2), n≥2, then G is J-colourable if and only if it is bridgeless, and that every bridgeless cubic graph has an J-colouring for every Steiner triple system of order greater than 3. We establish a condition on a cubic graph with a bridge which ensures that it fails to have an J-colouring if J is an affine system, and we conjecture that this is the only obstruction to colouring any cubic graph with any non-projective system of order greater than 3.
Discovery of aggregate usage profiles based on clustering information needs
Authors: Azreen Azman, Iadh Ounis
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We present an alternative technique for discovering aggregate usage profiles from Web access logs. The technique is based on clustering information needs inferred from users' browsing paths. Browsing paths are extracted from users' access logs. Information need is inferred from each browsing path by using the Ostensive Model[1]. The technique is evaluated in a document recommendation application. We compare the performance of our technique against the well-established transaction-based technique proposed in [2]. Based on an initial evaluation, the results are encouraging.
&#x221a;2 Subdivision for quadrilateral meshes
Authors: Guiqing Li, Weiyin Ma, Hujun Bao
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

This paper presents a $\sqrt2$ subdivision scheme for quadrilateral meshes that can be regarded as an extension of a 4-8 subdivision with new subdivision rules and improved capability and performance. The proposed scheme adopts a so-called $\sqrt2$ split operator to refine a control mesh such that the face number of the refined mesh generally equals the edge number and is thus about twice the face number of the coarse mesh. Smooth rules are designed in reference to the 4-8 subdivision, while a new set of weights is developed to balance the flatness of surfaces at vertices of different valences. Compared to the 4-8 subdivision, the presented scheme can be naturally generalized for arbitrary control nets and is more efficient in both space and computing time management. Analysis shows that limit surfaces produced by the scheme are C4 continuous for regular control meshes and G1 continuous at extraordinary vertices.
Why Western vendors don't dominate China's ERP market
Authors: Huigang Liang, Yajiong Xue, William R. Boulton, Terry Anthony Byrd
Venue: Communications of the ACM (2004)

Examining cases of failed ERP system implementation in China and explaining the unique circumstances.
A Mixed Closure-CSP Method for Solving Scheduling Problems
Authors: María Isabel Alfonso, Federico Barber
Venue: Applied Intelligence (2004)

Scheduling problems can be viewed as a set of temporal metric and disjunctive constraints and so they can be formulated in terms of CSP techniques. In the literature, there are CSP-based methods which sequentially interleave search efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Therefore, the number of backtrackings needed to obtain a solution is reduced. In this paper, we propose a new method that effectively integrates the CSP process into a limited closure process: not by interleaving them but rather as a part of the same process. Such an integration allows us to define more informed heuristics. These heuristics are used to limit the complete closure process to a maximum number of disjunctions, thereby reducing its complexity while at the same time reducing the search space. Some open disjunctive solutions can be maintained in the CSP process, limiting the number of backtrackings necessary, and avoiding having to know all the problem constraints in advance. Our experiments with flow-shop and job-shop instances show that this approach obtains a feasible solution/optimal solution without having to use backtracking in most cases. We also analyze the behaviour of our algorithm when some constraints are known dynamically and we demonstrate that it can provide better results than a pure CSP process.
On the performance of greedy algorithms in packet buffering
Authors: Susanne Albers, Markus Schmidt
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We study a basic buffer management problem that arises in network switches. Consider m input ports, each of which is equipped with a buffer (queue) of limited capacity. Data packets arrive online and can be stored in the buffers if space permits; otherwise packet loss occurs. In each time step the switch can transmit one packet from one of the buffers to the output port. The goal is to maximize the number of transmitted packets. Simple arguments show that any reasonable algorithm, which serves any non-empty buffer, is 2-competitive. Azar and Richter recently presented a randomized online algorithm and gave lower bounds for deterministic and randomized strategies.In practice greedy algorithms are very important because they are fast, use little extra memory and reduce packet loss by always serving a longest queue. In this paper we first settle the competitive performance of the entire family of greedy strategies. We prove that greedy algorithms are not better than 2-competitive no matter how ties are broken. Our lower bound proof uses a new recursive construction for building adversarial buffer configurations that may be of independent interest. We also give improved lower bounds for deterministic and randomized online algorithms.In the second part of the paper we present the first deterministic online algorithm that is better than 2-competitive. We develop a modified greedy algorithm, called Semi-Greedy, and prove that it achieves a competitive ratio of $17/9 ≅ 1. 89$. The new algorithm is simple, fast and uses little extra memory. Only when the risk of packet loss is low, it does not serve the longest queue. Additionally we study scenarios when an online algorithm is granted additional resources. We consider resource augmentation with respect to memory and speed, i. e. an online algorithm may be given larger buffers or higher transmission rates. We analyze greedy and other online strategies.
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Authors: Andris Ambainis, Ke Yang
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

Entanglement is an essential resource for quantum communicationand quantum computation, similar to sharedrandom bits in the classical world. Entanglement distillationextracts nearly-perfect entanglement from imperfectentangled state. The classical communication complexity ofthese protocols is the minimal amount of classical informationthat needs to be exchanged for the conversion. In thispaper, we focus on the communication complexity of protocolsthat operate with incomplete information, i.e., wherethe inputs are mixed states and/or prepared adversarially.We consider three models of imperfect entanglement,namely, the bounded measurement model, the depolarizationmodel, and the fidelity model. We describe there modelsas well as the motivations for studying them. For thebounded measurement model and the depolarization model,we prove tight and almost-tight bounds on the output qualityof non-interactive protocols. For the fidelity model weprove a lower bound that matches the upper bound given byAmbainis et al., and thus completely characterizes communicationcomplexity of entanglement distillation protocolsfor this model. Our result also suggests the optimality ofthe BB84 protocol in terms of communication complexity.We emphasize that although some of the results appearintuitively straightforward, their proofs are not. In fact, twonovel techniques are developed for proving these results.We believe that these techniques are of independent interests,too.
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy
Authors: Alan L. Selman, Samik Sengupta
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

It is known [BHZ87] that if every language in coNP hasa constant-round interactive proof system, then the polynomialhierarchy collapses. On the other hand, Lund et al.[LFKN92] have shown that #SAT, the #P-complete functionthat outputs the number of satisfying assignments of aBoolean formula, can be computed by a linear-round interactiveprotocol. As a consequence, the coNP-complete set\overline {SAT} has a proof system with linear rounds of interaction.We show that if every set in coNP has a polylogarithmic-roundinteractive protocol then the exponential hierarchycollapses to the third level. In order to prove this, we obtainan exponential version of Yapýs result [Yap83], and improveupon an exponential version of the Karp-Lipton theorem[KL80], obtained first by Buhrman and Homer [BH92].
Iconographical Virtual Polyhedrons for Constructing Graphical User Interface
Authors: Qinglian Guo, Kyoko Kato, Yiwei He
Venue: Proceedings of the Computer Graphics International (2004)

There are many applications that require a largenumber of icons on their user interface. Such applicationsshare the same problem: the icons use up too much screenspace. As a solution to this problem, we propose a newconcept: the use of Iconographical Virtual Polyhedrons (inshort we refer to them as "IV-polyhedron(s)"), which arepolyhedrons created in 3D virtual space, with the usual 2Dicons being mapped onto their polygonal faces. Users areenabled to rotate the IV-polyhedron in virtual space andselect one of the icons mapped on it. Such IV-polyhedronshave proved to be efficient for saving screen space andincreasing the enjoyment of using the graphical userinterface. In the present paper, first we will describe theprevious research related to graphical user interface toshow the importance of IV-polyhedrons. Secondly, we willdescribe the problems we encountered in theimplementation of the IV-polyhedrons. We will alsointroduce several prototypical applications usingIV-polyhedrons for childrenýs educational purposes.
Heartbeat traffic to counter (n-1) attacks: red-green-black mixes
Authors: George Danezis, Len Sassaman
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

A dummy traffic strategy is described that can be implemented by mix nodes in an anonymous communication network to detect and counter active (n - 1) attacks and their variants. Heartbeat messages are sent anonymously from the mix node back to itself in order to establish its state of connectivity with the rest of the network. In case the mix is under attack, the flow of heartbeat messages is interrupted and the mix takes measures to preserve the quality of the anonymity it provides by introducing decoy messages.
Implementation of a Non-strict Functional Programming Language V on a Threaded Architecture EARTH
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

The combination of a language with fine-grain implicit parallelism and a data ow evaluation scheme is suitable for high-level programming on massively parallel architectures. We are developing a compiler of V, a non-strict functional programming language, for EARTH(Efficient Architecture for Running THreads). Our compiler generates codes in Threaded-C, which is a lower-level programming language for EARTH. We have developed translation rules, and integrated them into the compiler. While EARTH directly supports fine-grain thread execution, thread-level optimization by compiler is also effective on EARTH. The preliminary performance results are encouraging, although further improvement is required for non-strict data-structures. Some codes generated from V programs by our compiler achieved comparable performance with the performance of hand-written Threaded-C codes. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Transfer functions on a logarithmic scale for volume rendering
Authors: Simeon Potts, Torsten Möller
Venue: Proceedings of Graphics Interface 2004 (2004)

Manual opacity transfer function editing for volume rendering can be a difficult and counter-intuitive process. This paper proposes a logarithmically scaled editor, and argues that such a scale relates the height of the transfer function to the rendered intensity of a region of particular density in the volume almost directly, resulting in much improved, simpler manual transfer function editing.
The Performance Estimation by Queuing Network Models for a Web-based Medical Information System
Authors: Ying-Wen Bai, Chien-Yung Cheng
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Usually, too many patients or users accessing a medical server can cause congestionand delay. To plan a system's capacity, we propose a queuing network model to estimatethe performance index of a medical information system. First, we measure a set of thesystem response times with respect to the system specification. Second, by using themaximum likelihood function, we find the estimate of an equivalent service rate and thebuffer size of a queue model from the simplified system. Third, with these queuing modelparameters, we can simulate the performance of the medical information system. Then,before the implementation of the medical information system, we can estimate theperformance of this system by means of a typical queuing simulation tool, such as QNAT.
IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

In this paper we present a new algorithm for CPU resourcereservation in real-time systems that allows the coexistenceof hard, soft and non real-time tasks. The proposedalgorithm is specifically designed to handle computationaloverload. A task that needs more CPU-time than reservedcan re-use the spare bandwidth, without interfering with theothers tasks. With respect to other reclamation schemes, thenovelty of the proposed algorithm is that the spare bandwidthis fairly distributed among the needing servers. Theeffectiveness of the algorithm is demonstrated with an extensiveset of experiments. We also propose a methodologyto set scheduling parameters depending on the type of thetask and on the time constraints needed.
Learning to cluster web search results
Authors: Hua-Jun Zeng, Qi-Cai He, Zheng Chen, Wei-Ying Ma, Jinwen Ma
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't generate clusters with highly readable names. In this paper, we reformalize the clustering problem as a salient phrase ranking problem. Given a query and the ranked list of documents (typically a list of titles and snippets) returned by a certain Web search engine, our method first extracts and ranks salient phrases as candidate cluster names, based on a regression model learned from human labeled training data. The documents are assigned to relevant salient phrases to form candidate clusters, and the final clusters are generated by merging these candidate clusters. Experimental results verify our method's feasibility and effectiveness.
A Selective Border-Casting Zone Routing Protocol for Ad-hoc Networks
Authors: Leonard Barolli, Yoshitaka Honma, Akio Koyama, Arjan Durresi, Junpei Arai
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

One of well-known routing protocol for ad-hoc networks is Zone Routing Protocol (ZRP). The performance of ZRP is better than other protocols. However, many useless control packets are used resulting in the increase of network load and decrease of network performance. In this paper, we propose a Selective Border-casting Zone Routing Protocol (SBZRP) to reduce the network load by limiting the number of control packets when the protocol searches for a new route. The performance evaluation via simulations shows that the SBZRP has better performance than ZRP.
Information geometry of U-Boost and Bregman divergence
Authors: Noboru Murata, Takashi Takenouchi, Takafumi Kanamori, Shinto Eguchi
Venue: Neural Computation (2004)

We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the space of the finite measures over a label set. We propose two versions of U-Boost learning algorithms by taking account of whether the domain is restricted to the space of probability functions. In the sequential step, we observe that the two adjacent and the initial classifiers are associated with a right triangle in the scale via the Bregman divergence, called the Pythagorean relation. This leads to a mild convergence property of the U-Boost algorithm as seen in the expectation-maximization algorithm. Statistical discussions for consistency and robustness elucidate the properties of the U-Boost methods based on a stochastic assumption for training data.