ppxscal/embedding_network huggingface dataset:
A TCP Enhancement for QoS-Aware Mobile Ad-Hoc Networks
Authors: C. Mbarushimana, A. Shahrabi
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

Successful deployment of Mobile Ad-hoc Networks (MANETs) is highly dependent on how their scarce resources are used by upper layer protocols. TCP plays a significant role in determining the workload of the network and its variants achieve different levels of performance as reported in literature. With the increase in delay-sensitive applications in today's networks, TCP experiences more spurious timeouts due to blocking by high priority traffic. The resulting retransmissions exacerbate the existing congestion problem in MANETs and misuse the available bandwidth. Our proposed TCP protocol (RE-TCP) achieves resource efficiency by adjusting the retransmission timer according to the medium contention, thus limiting the number of contention-induced retransmissions. In this paper, we first evaluate the impact of different loss recovery mechanisms on TCP performance in presence of voice traffic. We then analyze the resource efficiency of different TCP variants under contention-induced spurious timeouts. Our simulation study reveals a considerable improvement of TCP Reno by our proposed enhancement.
Polarizabilities of intermediate sized lithium clusters from density-functional theory
Authors: Rajendra R. Zope, Tunna Baruah, Mark R. Pederson
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

We present a detailed investigation of static dipole polarizability of lithium clusters containing up to 22 atoms. We first build a database of lithium clusters by optimizing several candidate structures for the ground state geometry for each size. The full polarizability tensor is determined for about 5-6 isomers of each cluster size using the finite-field method. All calculations are performed using large Gaussian basis sets, and within the generalized gradient approximation to the density functional theory, as implemented in the NRLMOL suite of codes. The average polarizability per atom varies from 11 to 9 AAA, within the 8-22 size range and show smoother decrease with increase in cluster size than the experimental values. While the average polarizability exhibits a relatively weak dependence on cluster conformation, significant changes in the degree of anisotropy of the polarizability tensor are observed. Interestingly, in addition to the expected even odd (0 and 1 $&mu;_B$) magnetic states, our results show several cases where clusters with an odd number of Li atoms exhibit elevated spin states (e.g. 3 $&mu;_B$).
Agile DL: Building a DELOS-Conformed Digital Library Using Agile Software Development
Authors: Javier D. Fernández, Miguel A. Martínez-Prieto, Pablo Fuente, Jesús Vegas, Joaquín Adiego
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

This paper describes a concrete partial implementation of the DELOS Reference Model to the particular field of manuscripts and incunabula, and how an agile software methodology, SCRUM, suits the evolutive nature of Digital Libraries, solving misunderstandings and lightening the underlying model.
TMchartis --- A Tool Set for Designing Multiple Problem-Oriented Visualizations for Topic Maps
Authors: Hendrik Thomas, Rike Brecht, Bernd Markscheffel, Stephan Bode, Karsten Spekowius
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

J. L. Borges once wrote about a Chinese emperor, who commanded the creation of an accurate map of China [1]. The resulting map was as detailed as possible but therefore it had to match the size of China. What use would make such a map, especially if you have a narrow navigation question, e.g. where the forbidden city is located?
A Simple Algorithm for Stable Minimum Storage Merging
Authors: Pok-Son Kim, Arne Kutzner
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algorithm performs $O(m\log(\frac{n}{m}+1))$ comparisons and O((m + n)logm) assignments, where m and n are the sizes of the input sequences with m ≤ n. Hence, according to the lower bounds of merging the algorithm is asymptotically optimal regarding the number of comparisons.As central new idea we present a principle of symmetric splitting, where the start and end point of a rotation are computed by a repeated halving of two search spaces. This principle is structurally simpler than the principle of symmetric comparisons introduced earlier by Kim and Kutzner. It can be transparently implemented by few lines of Pseudocode.We report concrete benchmarks that prove the practical value of our algorithm.
A User-Centric Protocol for Conditional Anonymity Revocation
Authors: Suriadi Suriadi, Ernest Foo, Jason Smith
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

This paper presents and evaluates an improved anonymity revocation protocol. This protocol can be used to strengthen anonymity revocation capability in a privacy-enhancing identity management system. This protocol is user-centric, abuse-resistant, and it provides enforceable conditions fulfillment. We assume the existence of 1 honest referee out of t designated referees (t > 1) chosen by users, and no collusion between users and referees. The security and performance of this protocol are evaluated.
Growth, Structure and Pattern Formation for Thin Films
Authors: Russel E. Caflisch
Venue: Journal of Scientific Computing (2008)

An epitaxial thin film consists of layers of atoms whose lattice properties are determined by those of the underlying substrate. This paper reviews mathematical modeling, analysis and simulation of growth, structure and pattern formation for epitaxial systems, using an island dynamics/level set method for growth and a lattice statics model for strain. Epitaxial growth involves physics on both atomistic and continuum length scales. For example, diffusion of adatoms can be coarse-grained, but nucleation of new islands and breakup for existing islands are best described atomistically. In heteroepitaxial growth, mismatch between the lattice spacing of the substrate and the film will introduce a strain into the film, which can significantly influence the material structure, for example leading to formation of quantum dots. Technological applications of epitaxial structures, such as quantum dot arrays, require a degree of geometric uniformity that has been difficult to achieve. Modeling and simulation may contribute insights that will help to overcome this problem. We present simulations that combine growth and strain showing the structure of nanocrystals and the formation of patterns in epitaxial systems.
The Future of Large-Scale Evaluation Campaigns for Information Retrieval in Europe
Authors: Maristella Agosti, Giorgio Maria Nunzio, Nicola Ferro, Donna Harman, Carol Peters
Venue: Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries (2007)

A Workshop on "The Future of Large-scale Evaluation Campaigns" was organised jointly by the University of Padua and the DELOS Network of Excellence and held in Padua, Italy, March 2007. The aim was to perform a critical assessment of the scientific results of such initiatives and to formulate recommendations for the future. This poster summarises the outcome of the discussion with respect to the major European activity in this area: the Cross Language Evaluation Forum.
On Linear Secret Sharing for Connectivity in Directed Graphs
Authors: Amos Beimel, Anat Paskin
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of parties (i.e., edges) can reconstruct the secret if it contains a path from node s to node t. We prove that in every linear secret sharing scheme realizing the st-con function on a directed graph with n edges the total size of the shares is ¿(n 1.5). This should be contrasted with s-t connectivity in undirected graphs, where there is a scheme with total share size n. Our result is actually a lower bound on the size monotone span programs for st ¿ con, where a monotone span program is a linear-algebraic model of computation equivalent to linear secret sharing schemes. Our results imply the best known separation between the power of monotone and non-monotone span programs. Finally, our results imply the same lower bounds for matching.
Deque-Free Work-Optimal Parallel STL Algorithms
Authors: Daouda Traoré, Jean-Louis Roch, Nicolas Maillard, Thierry Gautier, Julien Bernard
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the work-stealing technique. Unlike previous approaches where a deque for each processor is typically used to locally store ready tasks and where a processor that runs out of work steals a ready task from the deque of a randomly selected processor, the current paper instead presents an original implementation of work-stealing without using any deque but a distributed list in order to bound overhead for task creations. The paper contains both theoretical and experimental results bounding the work/running time.
Subdivision Curves on Surfaces and Applications
Authors: Dimas Martínez Morera, Luiz Velho, Paulo Cezar Carvalho
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Subdivision curves have great importance for many CAD/CAM applications.. In this paper we propose a simple method to define subdivision schemes on triangulations. It works by translating to the triangulation a perturbation of a planar binary subdivision. To reproduce this perturbation in the surface we use both, shortest and straightest geodesics, so we call this strategy intrinsic projection method. It can reproduce any binary subdivision scheme, regardless whether it is linear or not.
Inclusion in the Information Society for the "Excluded" Women in Greek Thrace
Authors: Keratso Georgiadou, Gerassimos Kekkeris, Mary Kalantzis
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

This article is based on a research conducted in Thrace, a Greek region in the North, bordering Turkey and Bulgaria. It aims to describe the efforts women, belonging to socially excluded communities i.e. Muslim women, Pontian women immigrants from the former Soviet Union and Roma women, make to adapt to the demands of today's world and to detect whether these women have access to and use of ICTs.
Insight or Trial and Error: Ambiguous Items as Clue for Discovering New Concepts in Constrained Environments
Authors: Jun Nakamura, Yukio Ohsawa
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

As our life becomes more sophisticated, our ability to create concepts is indispensable. Based on our concept formation model, which focuses on ambiguous items that cause a change of one's decisions, we developed a web-based creativity support system. This is intended to guide users in the categorization of words in analogical reasoning by forming batches of words to discover new concepts. 20 junior high school students participated in an experiment, where concept formation is expected to be induced by an ambiguous interpretation of presented information under constraints. The result provided some evidence that an existence of ambiguous items corresponds to a diversification of a thought process either as insight or trial error in categorizing words. The result also showed that the reconstruction of groups for including ambiguous items into some groups accelerates the creation of new concepts for better interpretation.
Visualizing the Importance of Medical Recommendations with Conversational Agents
Authors: Gersende Georg, Marc Cavazza, Catherine Pelachaud
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Embodied Conversational Agents (ECA) have the potential to bring to life many kinds of information, and in particular textual contents. In this paper, we present a prototype that helps visualizing the relative importance of sentences extracted from medical texts (clinical guidelines aimed at physicians). We propose to map rhetorical structures automatically recognized in the documents to a set of communicative acts controlling the expression of the ECA. As a consequence, the ECA will dramatize a sentence to reflect its perceived importance and degree of recommendation (advice, requirement, open proposal, etc). This prototype is constituted of three sub-systems: i) a text analysis module, ii) an ECA and iii) a mapping module which converts rhetorical structures produced by the text analysis module into nonverbal behaviors driving the ECA animation. This system could help authors of medical texts to reflect on the potential impact of the writing style they have adopted. The use of ECA re-introduces an affective element which won't be captured by other methods for analyzing document style.
AAI Asks FTC to Investigate RAND Issues Concerning Digital TV Standard
Authors: Richard Stern
Venue: IEEE Micro (2008)

The American Antitrust Institute has asked the Federal Trade Commission to begin an investigation of Rembrandt Inc., an owner of patents relating to the digital television broadcasting standard that the Federal Communications Commission has mandated for use by TV broadcasters. Richard Stern investigates the idea of reasonable and nondiscriminatory licensing in the context of two-tier markets.
Higher-order three-point boundary value problem on time scales
Authors: Douglas R. Anderson, Ilkay Yaslan Karaca
Venue: Computers Mathematics with Applications (2008)

In this paper, we consider a higher-order three-point boundary value problem on time scales. We study the existence of solutions of a non-eigenvalue problem and of at least one positive solution of an eigenvalue problem. Later we establish the criteria for the existence of at least two positive solutions of a non-eigenvalue problem. Examples are also included to illustrate our results.
Mixer selection in peer-to-peer ad hoc collaboration: novel architecture and algorithms
Authors: Samir Chatterjee
Venue:  (2008)

Traditional collaboration systems such as audio or video-conferencing require a dedicated infrastructure to manage the incoming and outgoing voice, video, and data streams in addition to the signaling required to set up and break down such connections. Due to recent advances in networking and computing, new architectures have taken hold that allow for the ad hoc creation of collaborations without the need for such infrastructure. We call these "infrastructure-less" environments. Increasingly, Peer-to-Peer (P2P) technologies are being looked at to replace the central mixing unit, or Multipoint Control Unit (MCU) of a traditional collaboration system. Many times these distributed collaborations are created in the form of overlay networks that are created on the fly and destroyed when no longer needed. Such ad hoc collaboration can be broadly defined as the interaction among two or more individuals that encompasses a range of behaviors including communication, cooperation, coordination, information sharing, negotiation and problem solving. In future, we can expect to see laptops, mobile devices (cell-phones and PDAs) taking part in conferencing situations where there is no central services (as in disaster situations). This research focused on solving the central problem with hybrid architecture P2P collaboration systems: Mixer selection from the diverse and distributed participants of the collaboration. To that end, four algorithms were designed to compare how well they solved the mixer selection problem. The algorithms were evaluated using simulation in the open source Network Simulator 2 (NS2) along with the Agentj toolkit to allow for the algorithms to be implemented in Java. Each algorithm was run in simulation multiple times with a different number of participant nodes to examine scalability, performance, and message traffic. The research contributions include: (1) design and development of novel algorithms to solve the mixer selection problem and other computer election problems, (2) developing a simulation to test the mixer selection algorithms, (3) results indicate that these algorithms can support ad hoc collaboration in a distributed environment, and can be easily implemented in real-world products, (4) these algorithms can be applied to domains other than P2P such as GRID computing, and massively parallel computing.
Human Motion Characterization Using Spatio-temporal Features
Authors: Manuel J. Lucena, José Manuel Fuertes, Nicolás Pérez De La Blanca
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Local space-time features can be used to detect and characterize motion events in video. Such features are valid for recognizing motion patterns, by defining a vocabulary of primitive features, and representing each video sequence by means of a histogram, in terms of such vocabulary. In this paper, we propose a supervised vocabulary computation technique which is based on the prior classification of the training events into classes, where each class corresponds to a human action. We will compare the performance of our method with the global approach to show that not only does our method obtain better results but it is also computationally less expensive.
Conflict-Tolerant Features
Authors: Deepak D'Souza, Madhu Gopinathan
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We consider systems composed of a base system with multiple "features" or "controllers", each of which independently advise the system on how to react to input events so as to conform to their individual specifications. We propose a methodology for developing such systems in a way that guarantees the "maximal" use of each feature. The methodology is based on the notion of "conflict-tolerant" features that are designed to continue offering advice even when their advice has been overridden in the past. We give a simple priority-based composition scheme for such features, which ensures that each feature is maximally utilized. We also provide a formal framework for specifying, verifying, and synthesizing such features. In particular we obtain a compositional technique for verifying systems developed in this framework.
Refinement of Kripke Models for Dynamics
Authors: Francien Dechesne, Simona Orzan, Yanjing Wang
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

We propose a property-preserving refinement/abstraction theory for Kripke Modal Labelled Transition Systems incorporating not only state mapping but also label and proposition lumping, in order to have a compact but informative abstraction. We develop a 3-valued version of Public Announcement Logic (PAL) which has a dynamic operator that changes the model in the spirit of public broadcasting. We prove that the refinement relation on static models assures us to safely reason about any dynamic properties in terms of PAL-formulas on the abstraction of a model. The theory is in particular interesting and applicable for an epistemic setting as the example of the Muddy Children puzzle shows, especially in the view of the growing interest for epistemic modelling and (automatic) verification of communication protocols.
Modeling Long-Range Dependent VBR Traffic Using Synthetic Markov-Gaussian TES Models
Authors: I-Hui Li
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Recent measurement studies of network traffic and variable bit rate video indicate that the traffic exhibits long-range dependence (LRD). It becomes more and more important to model this kind of traffic. This paper presents a traces-generating framework based on TES (Transform-Expand-Samples) and simple synthetic Markov-Gaussian processes for modeling LRD traffic with variability over several time scales. All of the traffic studies showed that the measurement exhibits approximate second-order self-similarity. The network resource is limited and the real long-range dependent traffic has no room under the circumstances. The proposed framework can fit both the probability density function of the empirical traces and the autocorrelation function spanning over several time scales. Besides, we discuss the validity of approximate LRD modeling with the short-range-dependent approaches.
Visualization of Interfirm Relations in a Converging Mobile Ecosystem
Authors: Rahul C. Basole
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

The mobile ecosystem is characterized by a large and complex network of companies interacting with each other, directly and indirectly, to provide a broad array of mobile products and services to end-customers. With the convergence of enabling technologies, the complexity of the mobile ecosystem is increasing multifold as new actors are emerging, new relations are formed, and the traditional distribution of power is shifted. Drawing on theories of complex systems, interfirm relationships, and the creative art and science of network visualization, this paper identifies key catalysts and develops a method to effectively map the complex structure and dynamics of over 7,000 global companies and 18,000 relationships in the mobile ecosystem. Our visual approach enables decision makers to explore the complexity of interfirm relations in the mobile ecosystem, understand their firm’s competitive position in a network context, and identify patterns that may influence their choice of innovation strategy or business models
Modern Digital Libraries, the Case of the Audio-Book Boom
Authors: Jan Engelen
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This contribution focuses on the relatively new phenomenon of the purely commercial availability of audiobooks, sometimes also called "spoken books", "talking books" or "narrated books". Having the text of a book read aloud and recorded has been for a very long time the favourite solution to make books and other texts accessible for persons with a serious reading impairment such as blindness or low vision. Specialised production centres do exist in most countries of the world for producing these talking books. But now a growing number of commercial groups have found out that there is a booming market for these products as people slowly get used to leisure listening to books instead of reading them. Some companies claim already having over 40.000 titles in spoken format in their catalogue. Major differences and possible synergies between the two worlds are discussed.