ppxscal/embedding_network huggingface dataset:
Request Satisfaction Problem in Synchronous Radio Networks
Authors: Benoît Darties, Sylvain Durand, Jérôme Palaysi
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in the following model: nodes send omnidirectional radio transmissions in synchronous slots; during a given slot, a node can receive a message from an adjacent node if and only if no other neighbour is transmitting - otherwise, radio interferences may occur if two or more neighbors transmit in the same slot -. The objective is to minimize the number of slots used. The two problems differ in that the routing policy may be imposed (DAWN-path), or not (DAWN-request). In this second case, a path must be assigned for each request, to define the nodes to use to reach the destination from the source. We present some complexity results, in particular showing that both problems are NP-hard when the network is restricted to a tree. We also present a polynomial algorithm in O(n 2K ) when the number of requests is bounded (by above) by a constant K.
Superimposed Information Architecture for Digital Libraries
Authors: David W. Archer, Lois M. Delcambre, Fabio Corubolo, Lillian Cassel, Susan Price, Uma Murthy, David Maier, Edward A. Fox, Sudarshan Murthy, John Mccall, Kiran Kuchibhotla, Rahul Suryavanshi
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

A variety of software tools commonly used in research and industry allow a user to select (usually contiguous) segments of content to be annotated, referenced, or otherwise distinguished from a containing document. However, digital libraries (DLs) often curate only full documents, not these selected sub-documents. Thus, sub-documents in a DL may not have the full complement of metadata, and they may not be visible using DL browse and search facilities. We are interested in explicit representation of sub-documents in a DL environment. In this paper, we show how sub-documents may be represented and curated. We focus on the explicit representation of what we call a mark - an encapsulated address of a sub-document along with associated context. Our contributions are: a software architecture for representing marks as first-class objects together with regular documents in a DL; and an implementation of our architecture using existing software packages with modest enhancements. This approach provides new capabilities for the DL with minimal modification to tools and interfaces familiar to the DL user.
Techniques for Improving Opportunistic Sensor Networking Performance
Authors: Shane B. Eisenman, Nicholas D. Lane, Andrew T. Campbell
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

A number of recently proposed mobile sensor network architectures rely on uncontrolled, or weakly-controlled mobility to achieve sensing coverage over time at low cost, an opportunistic sensor networking approach. However, this reliance on mobility also introduces a number of challenges. In this paper, we discuss the challenges inherent in this networking paradigm, and describe two composable techniques, sensor sharing and substitution, to make the system more robust in terms of data fidelity and delay. We present a numerical analysis of these techniques, separately and in combination, based on a simple Markov model of an opportunistic sensor network.
Emotionally Expressive Head and Body Movement During Gaze Shifts
Authors: Brent Lance, Stacy C. Marsella
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

The current state of the art virtual characters fall far short of characters produced by skilled animators. One reason for this is that the physical behaviors of virtual characters do not express the emotions and attitudes of the character adequately. A key deficiency possessed by virtual characters is that their gaze behavior is not emotionally expressive. This paper describes work on expressing emotion through head movement and body posture during gaze shifts, with intent to integrate a model of emotionally expressive eye movement into this work in the future. The paper further describes an evaluation showing that users can recognize the emotional states generated by the model.
Fuzzy multisubmeasures and applications
Authors: Alina Gavrilut, Anca Croitoru
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

Properties of fuzzy multisubmeasures are discussed. Also, some applications are presented: decomposition theorems concerning pseudo-atoms, an extension result by preserving non-pseudo-atomicity or fuzzy character and properties of regularity.
Extended affine Weyl groups of type A1
Authors: Saeid Azam, Valiollah Shahsanaei
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

It is known that elliptic Weyl groups, extended affine Weyl groups of nullity 2, have a finite presentation called the generalized Coexter presentation. Similar to the finite and affine case this presentation is obtained by assigning a Dynkin diagram to the root system. Then there is a prescription to read the generators and relations from the diagram. Recently a similar presentation is given for simply laced extended affine Weyl groups of nullity 3 and rank>1. Employing a new method, we complete this work by giving a similar presentation for nullity 3 extended affine Weyl groups of type A 1.
Approximation for Multi-service Systems with Reservation by Systems with Limited-Availability
Authors: Maciej Stasiak, Sławomir Hanczewski
Venue: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering (2008)

The paper presents a new method for modeling systems with reservation. The method is based on the generalized ideal grading model servicing multi-rate traffic. The paper proposes an algorithm for determining such an availability value in the ideal grading that causes blocking equalization of different classes of calls. The proposed method was worked out for integer and non-integer values of the availability parameters. A comparison of the analytical results with the simulation data proves high accuracy of the proposed method.
The effect of innovativeness on the adoption of B2C e-commerce: A model based on the Theory of Planned Behaviour
Authors: Ángel Herrero Crespo, Ignacio Rodríguez del Bosque
Venue: Computers in Human Behavior (2008)

This paper analyses the factors that lead Internet users to becoming online shoppers. In particular, assuming that Internet is an innovation affecting the way individuals shop, a model of electronic commerce adoption is proposed that adds personal innovativeness to the traditional formulation of the Theory of Planned Behaviour. The theoretical model proposed is tested on a sample of Web users with no experience in online shopping. The results denote that electronic commerce acceptance is determined by attitudes to the system, subjective norm and personal innovativeness in the domain of information technology. Moreover, we find that personal innovativeness has a moderating effect on the acceptance of electronic commerce.
Accelerated Gradient Learning Algorithm for Neural Network Weights Update
Authors: Zeljko Hocenski, Mladen Antunovic, Damir Filko
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This work proposes decomposition of gradient learning algorithm for neural network weights update. Decomposition enables parallel execution convenient for implementation on computer grid. Improvements are reflected in accelerated learning rate which may be essential for time critical decision processes. Proposed solution is tested and verified on MLP neural network case study, varying a wide range of parameters, such as number of inputs/outputs, length of input/output data, number of neurons and layers. Experimental results show time savings in multiple thread execution.
Adding a methodological assistant to a protocol modeling environment
Authors: Ludovic Apvrille, Pierre de Saqui-Sannes
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

The use of protocol design toolkits based on UML profiles has been hampered by the lack of methodological support. Indeed, those toolkits should include an assistant based on patterns and dedicated to driving the designer step by step through a well defined methodology. Thus, the TURTLE UML profile is extended with widely accepted service and protocol-oriented patterns. These patterns are built upon UML analysis diagrams i.e. use case, interaction overview and sequence diagrams. Moreover, all these patterns and diagrams have a formal semantics. Finally, they have been implemented in TTool, the open-source toolkit supporting TURTLE. The proposed approach remains general and may be applied to various modeling languages and use-case analysis driven processes.
AES Encryption Implementation and Analysis on Commodity Graphics Processing Units
Authors: Owen Harrison, John Waldron
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

Graphics Processing Units (GPUs) present large potential performance gains within stream processing applications over the standard CPU. These performance gains are best realised when high computational intensity is required across large amounts of mostly independent input elements. The GPU's success in general purpose stream processing has been demonstrated in many diverse fields, though attempts to port cryptographic algorithms to the GPU have thus far met little success. In recent years, GPU architectures have continued to develop a more flexible and uniform programming environment. These developments have overcome a lot of previously encountered restrictions in cipher implementations. We present novel approaches for the implementation of the AES block cipher encryption algorithm on these GPUs. This work also serves as a precursor for future cipher implementations on the most advanced GPU architecture, the recently released Nvidia G80, which now includes integer support and a simplified programming interface.
International Diffusion of Computer Technology, 1945-1955
Authors: William Aspray
Venue: IEEE Annals of the History of Computing (1986)

The article surveys the international diffusion of computer technology between 1945 and 1955. It lists early computers and their sponsoring organizations, compares scientific and commercial styles of development, and describes the mechanisms for technology transfer across national boundaries. Suggestions are offered for further research on computing and international technology transfer in the twentieth century.
Parallel Object-Oriented Computation Applied to a Finite Element Problem
Authors: Jon B. Weissman, Andrew S. Grimshaw, R. D. Ferrar0
Venue: Scientific Programming (1993)

The conventional wisdom in the scientific computing community is that the best way to solve large-scale numerically intensive scientific problems on today's parallel MIMD computers is to use Fortran or C programmed in a data-parallel style using low-level message-passing primitives. This approach inevitably leads to nonportable codes and extensive development time, and restricts parallel programming to the domain of the expert programmer. We believe that these problems are not inherent to parallel computing but are the result of the programming tools used. We will show that comparable performance can be achieved with little effort if better tools that present higher level abstractions are used. The vehicle for our demonstration is a 2D electromagnetic finite element scattering code we have implemented in Mentat, an object-oriented parallel processing system. We briefly describe the application. Mentat, the implementation, and present performance results for both a Mentat and a hand-coded parallel Fortran version.
Mining search engine query logs for social filtering-based query recommendation
Authors: Zhiyong Zhang, Olfa Nasraoui
Venue: Applied Soft Computing (2008)

This paper presents a simple and intuitive method for mining search engine query logs for fast social filtering, where searchers are provided with dynamic query recommendations on a large-scale industrial-strength search engine. We adopt a dynamic approach that is able to absorb new and recent trends in web usage trends on search engines, while forgetting outdated trends, thus adapting to dynamic changes in web user's interests. In order to get well-rounded recommendations, we combine two methods: first, we model search engine users'sequential search behavior, and interpret this consecutive search behavior as client-side query refinement, that should form the basis for the search engine's own query refinement process. This query refinement process is exploited to learn useful information that helps generate related queries. Second, we combine this method with a traditional text or content based similarity method to compensate for the shortness of query sessions and sparsity of real query log data.
Formal Verification of Analog and Mixed Signal Designs in Mathematica
Authors: Mohamed H. Zaki, Ghiath Al-Sammane, Sofiène Tahar
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, we show how symbolic algebra in Mathematica can be used to formally verify analog and mixed signal designs. The verification methodology is based on combining induction and constraints solving to generate correctness for the system with respect to given properties. The methodology has the advantage of avoiding exhaustive simulation usually utilized in the verification. We illustrate this methodology by proving the stability of a ΔΣ modulator.
Dynamic Bandwidth Allocation Algorithm Based on Two-Phase Cycle for Efficient Channel Utilization on Ethernet PON
Authors: Won Jin Yoon, Woo Jin Jung, Tae-Jin Lee, Hyunseung Choo, Min Young Chung
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Ethernet passive optical network (EPON) is a low-cost and high speed solution to the bottleneck problem. We study previous inter-optical network unit (ONU) scheduling algorithm, interleaved polling with stop (IPS).The IPS algorithm needs an idle time period between two consecutive frame transmission cycles on uplink. In this paper, we propose a two-phase cycle dynamic bandwidth allocation (TCDBA) algorithm to increase the channel utilization on uplink through the elimination of the idle period. And, we also evaluate the performance of the proposed algorithm by simulations and confirm its effectiveness.
An Issue-Based Approach to Information Search Modelling: Analysis of a Human Dialog Corpus
Authors: Alain Loisel, Jean-Philippe Kotowicz, Nathalie Chaignaud
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

We aim at improving the health information search engine CISMeF, by including a conversational agent that interacts with the user in natural language. To study the cognitive processes involved during information search, a bottom-up methodology was adopted. An experiment has been set up to obtain human dialogs related to such searches. In this article, the emphasis lays on the analysis of these human dialogs.
Tips on teaching types and functions
Authors: Fritz Ruehr
Venue: Proceedings of the 2008 international workshop on Functional and declarative programming in education (2008)

Many beginning students of functional programming have difficulty understanding higher-order functions and their types. Experienced functional programmers have such a close familiarity and intuitive grasp of these crucial concepts that they may find it hard to "bridge the gap," so as to provide their students with a firm understanding of these ideas. I describe a loosely-related cluster of tips and techniques which address the pedagogy of higher-order functions and types, for students with varying degrees of mathematical background and different learning styles - these techniques include tabular presentations, code tools, visual metaphors and an abstract algebra. Although the underlying ideas will be familiar to experts, I believe these presentations can help educators bring important ideas in functional programming to a broader range of students, with less pain and with a deeper understanding.
Multibody Dynamics Model of a Human Hand for Haptics Interaction
Authors: Hector Moreno, Roque Saltaren, Manuel Ferre, Eugenio Yime, Rafael Aracil, Isela Carrera
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In this paper we propose a strategy for modelling a human hand for Haptics interaction.The strategy consists in a parallel computing architecture that calculates the dynamics of a hand, this is accomplished by computing the dynamics of each finger in a parallel manner. In this approach multiple threads (e.g. haptics thread, graphics thread, collision detection thread, etc.) run concurrently and therefore we developed a synchronization mechanism for data exchange. We describe in detail the elements of the developed software.
Global Exponential Convergence of Time-Varying Delayed Neural Networks with High Gain
Authors: Lei Zhang, Zhang Yi
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper studies a general class of neural networks with time-varying delays and the neuron activations belong to the set of discontinuous monotone increasing functions. The discontinuities in the activations are an ideal model of the situation where the gain of the neuron amplifiers is very high. Because the delay in combination with high-gain nonlinearities is a particularly harmful source of potential instability, in the paper, conditions which ensure the global convergence of the neural network are derived.
A Degree-Condition for (s, t)-Supereulerian Graphs
Authors: Bin Wang, Xiao-Min Li, Lan Lei
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

For two integers s ¿ 0, t ¿ 0, G is (s, t)-superlerian, if ¿ X, Y ¿ E(G) with X ¿ Y = ¿, where |X| ≤ s, |Y| ≤ t, G has a spanning eulerian subgraph H such that X ¿ E(H) and Y ¿ E(H) = ¿. It is obvious that G is supereulerian if and only if G is (0, 0)-supereulerian. In this note, we have proved that when G is a (t + 2)-edge-connected simple graph on n vertices, if n ¿ 21 and $\delta(G)\geq \frac{n}{5}+t$, then G is (3, t)-supererlerian or can be contracted to some well classified special graphs.
The development of a geospatial data Grid by integrating OGC Web services with Globus-based Grid technology
Authors: Liping Di, Aijun Chen, Wenli Yang, Yang Liu, Yaxing Wei, Piyush Mehrotra, Chaumin Hu, Dean Williams
Venue: Concurrency and Computation: Practice Experience (2008)

Geospatial science is the science and art of acquiring, archiving, manipulating, analyzing, communicating, modeling with, and utilizing spatially explicit data for understanding physical, chemical, biological, and social systems on the Earth's surface or near the surface. In order to share distributed geospatial resources and facilitate the interoperability, the Open Geospatial Consortium (OGC), an industry&ndash;government&ndash;academia consortium, has developed a set of widely accepted Web-based interoperability standards and protocols. Grid is the technology enabling resource sharing and coordinated problem solving in dynamic, multi-institutional virtual organizations. Geospatial Grid is an extension and application of Grid technology in the geospatial discipline. This paper discusses problems associated with directly using Globus-based Grid technology in the geospatial disciplines, the needs for geospatial Grids, and the features of geospatial Grids. Then, the paper presents a research project that develops and deploys a geospatial Grid through integrating Web-based geospatial interoperability standards and technology developed by OGC with Globus-based Grid technology. The geospatial Grid technology developed by this project makes the interoperable, personalized, on-demand data access and services a reality at large geospatial data archives. Such a technology can significantly reduce problems associated with archiving, manipulating, analyzing, and utilizing large volumes of geospatial data at distributed locations. Copyright &copy; 2008 John Wiley & Sons, Ltd.
On Covering Problems of Rado
Authors: Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

T. Rado conjectured in 1928 that if ${\mathcal S}$ is a finite set of axis-parallel squares in the plane, then there exists an independent subset ${\mathcal I}\subseteq$ ${\mathcal S}$ of pairwise disjoint squares, such that ${\mathcal I}$ covers at least 1/4 of the area covered by ${\mathcal S}$. He also showed that the greedy algorithm (repeatedly choose the largest square disjoint from those previously selected) finds an independent set of area at least 1/9 of the area covered by ${\mathcal S}$. The analogous question for other shapes and many similar problems have been considered by R. Rado in his three papers (1949, 1951 and 1968) on this subject. After 45 years (in 1973), Ajtai came up with a surprising example disproving T. Rado's conjecture. We revisit Rado's problem and present improved upper and lower bounds for squares, disks, convex sets, centrally symmetric convex sets, and others, as well as algorithmic solutions to these variants of the problem.