ppxscal/embedding_network huggingface dataset:
Conglomerates as a general framework for informetric research
Authors: Ronald Rousseau
Venue: Information Processing and Management: an International Journal (2005)

We introduce conglomerates as a general framework for informetric (and other) research. A conglomerate consists of two collections: a finite source collection and a pool, and two mappings: a source-item map and a magnitude map. The ratio of the sum of all magnitudes of item-sets, and the number of elements in the source collection is called the conglomerate ratio. It is a kind of average, generalizing the notion of an impact factor. The source-item relation of a conglomerate leads to a list of sources ranked according to the magnitude of their corresponding item-sets. This list, called a Zipf list, is the basic ingredient for all considerations related to power laws and Lotkaian or Zipfian informettics. Examples where this framework applies are: impact factors, including web impact factors, Bradford-Lotka type bibliographies, first-citation studies, word use, diffusion factors, elections and even bestsellers lists.
Efficient and Fair Multi-Level Packet Scheduling for Differentiated Services
Authors: Chin-Chi Wu, Hsien-Ming Wu, Woei Lin
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

As the demands on quality of service (QoS) of real-time applications over the Internet increase, many research efforts have developed various packet scheduling schemes to support differentiated services. In this paper, we propose a new multi-level packet scheduling algorithm, MLDDRR, enhanced from the existing dynamic deficit round-robin (DDRR) for the support of delay-sensitive applications. The network operator can simply change the level of service differentiation by adjusting parameters. The MLDDRR can achieve high throughput efficiently and simultaneously provide smaller delay for short packets of each service class. The feature of small delay for short packets is of great importance for improving the playback quality of real-time applications such as VoIP or scalable media stream delivery. Simulation results showing the high effectiveness and small overhead of MLDDRR are also presented.
Investigating learning from hypermedia via the implementation of a computer-based metacognition training regimen and a hypermedia program
Authors: Yianna Vovides
Venue:  (2005)

This research investigates metacognitive strategies and tools to help learners become knowledgeable about learning strategies and aware of their own metacognition within the context of hypermedia learning environments. It also investigates how such metacognitive knowledge and awareness impacts achievement and transfer. The use and benefits of detached metacognition training and embedded metacognitive tools are analyzed. The detached training is a computer-based tutorial on reflective learning and the embedded tool is a learning mentor function within the hypermedia learning environment. One hundred and forty-two nursing students at a large Midwestern university participated in the study. Results indicate that the metacognitive strategies and tools under investigation facilitated both subject-matter knowledge and metacognitive awareness.
Comparative analysis of new high data rate wireless communication technologies "From Wi-Fi to WiMAX"
Authors: Nicolas Fourty, Thierry Val, Philippe Fraisse, Jean-Jacques Mercier
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The aim of this paper is, by a precise description of the different existing and developing wireless networks, to determine how all these networks may collaborate together. The example taken is WiMAX which has been able to examine advantages and weaknesses of existing WLAN in order to determine a specific application type. The confrontation of WiMAX and Wi-Fi characteristics will highlight evolutions in wireless networking and will give us keywords of what new networks are attended for.
Calibration Errors in Augmented Reality: A Practical Study
Authors: Javier-Flavio Vigueras Gomez, Gilles Simon, Marie-Odile Berger
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

This paper confronts some theoretical camera models to reality and evaluates the suitability of these models for effective augmented reality (AR). It analyses what level of accuracy can be expected in real situations using a particular camera model and how robust the results are against realistic calibration errors. An experimental protocol is used that consists of taking images of a particular scene from different quality cameras mounted on a 4DOF micro-controlled device. The scene is made of a calibration target and three markers placed at different distances of the target. This protocol enables us to consider assessment criteria specific to AR as alignment error and visual impression, in addition to the classical camera positioning error.
Cluster Scheduling and Load Balancing via TCP Options
Authors: Peter Clutterbuck
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

This paper describes an experiment in designing, implementing and testing a Transport layer cluster scheduling and dispatching architecture. The motivation for the experiment was the hypothesis that a Transport layer clustering solution may offer advantantages over the existing industry-standard Network layer and Data Link Layer approaches. The critical success factors initially established to guide and evaluate the experiment were reduced dispatcher work load, reduced dispatcher internal state memory requirements, distributed denial of service resilience, and cluster software design simplicity. The functional design stage of the experiment produced a Transport layer strategy for scheduling and load balancing based on the specification of two new TCP options. Implementation required the introduction of the newly specified TCP options into the Linux (2.4) kernel. The implementation produced an extended Linux Socket API to facilitate user-process access to the additional TCP capability. The testing stage of the experiment confirmed the operational efficiency of the solution.
Scalable Peer-to-Peer Multimedia Streaming Model in Heterogeneous Networks
Authors: Satoshi Itaya, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In a peer-to-peer (P2P) overlay network, a large number and various types of peer processes are cooperating by using multimedia contents like movies. Multimedia streaming is a key technology to realize multimedia applications. Here, multimedia contents are required to be reliable and continuously delivered to processes in a realtime manner. In this paper, we newly discuss a heterogeneous asynchronous multi-source streaming (HAMS) model where multiple contents peers transmit packets of a multimedia content to a requesting leaf peer to increase the throughput, reliability, and scalability in P2P overlay networks.
More on errors, or, moron errors
Authors: T. D. C. Kuch
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

Diana Patterson (January, page 5) discussed "The index horror", or the results of trying to simulate alphabetical order by means of ordinary character-by-character computer sorting. Her example was "Workspaces" preceding "WAIT". Her diagnosis was the failure to equate upper and lower case forms of the same letter. But hold on, it gets worse. 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
Scene monitoring with a forest of cooperative sensors
Authors: Omar Javed
Venue:  (2005)

In this dissertation, we present vision based scene interpretation methods for monitoring of people and vehicles, in real-time, within a busy environment using a forest of co-operative electro-optical (EO) sensors. We have developed novel video understanding algorithms with learning capability, to detect and categorize people and vehicles, track them with in a camera and hand-off this information across multiple networked cameras for multi-camera tracking. The ability to learn prevents the need for extensive manual intervention, site models and camera calibration, and provides adaptability to changing environmental conditions. For object detection and categorization in the video stream, a two step detection procedure is used. First, regions of interest are determined using a novel hierarchical background subtraction algorithm that uses color and gradient information for robust interest region detection. Second, objects are located and classified from within these regions using a weakly supervised learning mechanism based on co-training that employs motion and appearance features. The main contribution of this approach is that it is an online procedure in which separate views (features) of the data are used for co-training, while the combined view (all features) is used to make classification decisions in a single boosted framework. The advantage of this approach is that it requires only a few initial training samples and can automatically adjust its parameters online to improve the detection and classification performance. Once objects are detected and classified they are tracked in individual cameras. Single camera tracking is performed using a voting based approach that utilizes-color and shape cues to establish correspondence in individual cameras. The tracker has the capability to handle multiple occluded objects. Next, the objects are tracked across a forest of cameras with non-overlapping views. This is a hard problem because of two reasons. First, the observations of an object are often widely separated in time and space when viewed from non-overlapping cameras. Secondly, the appearance of an object in one camera view might be very different from its appearance in another camera view due to the differences in illumination, pose and camera properties. To deal with the first problem, the system learns the inter-camera relationships to constrain track correspondences. (Abstract shortened by UMI.)
User preferences toward information visualization design techniques: a comparative study
Authors: Junho Choi
Venue:  (2005)

The main research question of this dissertation study was to see if people with differing cognitive preferences, particularly visuals and read-writes, had a difference in response to encodings of color, size, and shape, in an information visualization tool. Adults, with either visual preference or with read-write preference, were the sample of the population. A survey was administered to obtain response towards encodings of color, size, and shape in a visual as well as in a non-visual/textual counterpart. All questions were randomized. An independent sample t-test was done to determine the difference between the two groups and paired samples t-test was used to test for significance between means of pairs within one group (either visuals or read-write). The findings of this dissertation study are important for information visualization tools that are just being commercialized, to be adopted by a broader group of users. It was found that visuals and read-writes respond very differently to visual techniques of color, size, and shape. Visuals like all the three encodings more than the read-writes. However, read-writes like information presented in a textual version more than the visuals. This study found that among the three encodings, color seems to be most liked, followed by size, and shape for people with visual preference while read-writes seem to have a preference for size encodings over shape and color. Though visuals like shape yet as the number of shapes increases visuals' subjective satisfaction decreases towards such displays. The results reported here identifies a need for new processes to build visualization tools that adapt to the need of people with differing cognitive styles so that such people can work independently as well as collaboratively with each other.
An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels
Authors: Chih-Hao Hsu, Guanling Lee, Arbee L. Chen
Venue: Distributed and Parallel Databases (2005)

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, a minimal expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the minimal expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.
Event-to-sink reliable transport in wireless sensor networks
Authors: Özgür B. Akan, Ian F. Akyildiz
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Hence, the WSN paradigm necessitates a collective event-to-sink reliability notion rather than the traditional end-to-end notion. To the best of our knowledge, reliable transport in WSN has not been studied from this perspective before.In order to address this need, a new reliable transport scheme for WSN, the event-to-sink reliable transport (ESRT) protocol, is presented in this paper. ESRT is a novel transport solution developed to achieve reliable event detection in WSN with minimum energy expenditure. It includes a congestion control component that serves the dual purpose of achieving reliability and conserving energy. Importantly, the algorithms of ESRT mainly run on the sink, with minimal functionality required at resource constrained sensor nodes. ESRT protocol operation is determined by the current network state based on the reliability achieved and congestion condition in the network. This self-configuring nature of ESRT makes it robust to random, dynamic topology in WSN. Furthermore, ESRT can also accommodate multiple concurrent event occurrences in a wireless sensor field. Analytical performance evaluation and simulation results show that ESRT converges to the desired reliability with minimum energy expenditure, starting from any initial network state.
A Levelwise Search Algorithm for Interesting Subspace Clusters
Authors: Haiyun Bian, Raj Bhatnagar
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We present a levelwise search algorithm for finding subspace clusters in high dimensional data satisfying various properties besides the commonly used minimum density property. A set of such properties are summarized and a user can choose any of these properties. A lattice is built with all the discovered clusters which enables further analysis and discovery of useful knowledge about the clusters and their inter-relationships.
Range Queries in Trie-Structured Overlays
Authors: Anwitaman Datta, Manfred Hauswirth, Renault John, Roman Schmidt, Karl Aberer
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This paper describes how range queries as an important non-trivial search predicate can be supported in a structured overlay network that provides O(log n) search complexity on top of a trie abstraction. We provide analytical results that show that the proposed approach is efficient, supports arbitrary granularity of ranges, and demonstrate that its algorithmic complexity in terms of messages is independent of the size of the queried ranges and only depends on the size of the result set. In contrast to other systems which provide evaluation results only through simulations, we validate the theoretical analysis of the algorithms with large-scale experiments on the PlanetLab infrastructure using a fully-fledged implementation of our approach.
Measuring the Impact of Friends on the Internal Attributes of Software Systems
Authors: Michael English, Jim Buckley, Tony Cahill, Kristian Lynch
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

Differing views have been expressed on the appropriateness of the friend construct in the design and implementation of object-oriented software in C++. However, little empirical analysis of its usage in the development of systems has taken place. This paper describes an empirical study of the top 100 most downloaded open-source software systems from sourceforge.net, to assess the design implications of the use of the friend construct. On a larger cohort of systems our results provide further evidence that classes declared as friends are coupling hotspots. Our findings also indicate that class size does not seem to have the confounding effect on this relationship that has been suggested in previous research. In addition, there seems to be no indication that friendship is used as an alternative to inheritance although a small number of systems seem to use friendship as an alternative to multiple inheritance and vice versa.
Scalable database replication through dynamic multiversioning
Authors: Kaloian Manassiev, Cristiana Amza
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

We scale the database back-end in dynamic content web servers on a set of database replicas while maintaining strong consistency. This is contrary to conventional wisdom in replicated databases which says that one could have either strong consistency or scalability, but not both.The key to scaling is a novel integrated fine-grained concurrency control and data replication algorithm called Dynamic Multiversioning that provides fine-grained distributed concurrency control at the level of a memory page across a database cluster. We exploit the different distributed data versions that naturally come about as a result of asynchronous data replication in order to increase concurrency by running conflicting transactions in parallel on different replicas.At the same time, the serialization order is determined using fine-grained concurrency control at a master database and enforced through a version-aware scheduling technique. Our technique does not put any crucial data in the scheduler, which permits easy reconfiguration, without loss of data, in the case of single-node failures of any node in the system.Our measurements show near-linear scaling up to 8 databases for the browsing, shopping and even for the write-heavy ordering workload of the industry-standard e-commerce TPC-W benchmark.
Development of System for Crossarm Reuse Judgment on the Basis of Classification of Rust Images Using Support Vector Machine
Authors: Michiko Yamana, Hiroshi Murata, Takashi Onoda, Tohru Ohashi, Seiji Kato
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We attempt to develop a crossarm reuse judgment system based on rust images that uses machine learning techniques. The system consists of a digital camera and a standard note book personal computer (PC). We estimate the degree of accuracy of the judgment of various pattern classification methods without special image processing techniques such as the extraction of features. The results show that a support vector machine is the most suitable instrument for this judgment system. We obtain the high degree of accuracy by compressing the image data in order to decrease the number of features.
AOSD for internet service clusters: the case of availability
Authors: Sara Bouchenak, Noël De Palma, Stéphane Fontaine, Bruno Tête
Venue: Proceedings of the 1st workshop on Aspect oriented middleware development (2005)

Software failures represent a large portion of outages in Internet service clusters, but are unfortunately not tackled by classical Internet service clustering solutions, leaving the service unavailable. In this paper, we present JSeR, an AOSD-based solution for Internet service availability which specifically handles transient software failures. JSeR was used with an e-commerce application. A first result of the experimental evaluation shows that the proposed approach allows masking up to 100% of transient software failures, with a negligible application performance overhead. Another result of our experiments is that code maintenance of the AOSD-based availability system is greatly improved.
Multimodal expressive embodied conversational agents
Authors: Catherine Pelachaud
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper we present our work toward the creation of a multimodal expressive Embodied Conversational Agent (ECA). Our agent, called Greta, exhibits nonverbal behaviors synchronized with speech. We are using the taxonomy of communicative functions developed by Isabella Poggi [22] to specify the behavior of the agent. Based on this taxonomy a representation language, Affective Presentation Markup Language, APML has been defined to drive the animation of the agent [4]. Lately, we have been working on creating no longer a generic agent but an agent with individual characteristics. We have been concentrated on the behavior specification for an individual agent. In particular we have defined a set of parameters to change the expressivity of the agent's behaviors. Six parameters have been defined and implemented to encode gesture and face expressivity. We have performed perceptual studies of our expressivity model.
Trigger Update based Local Optimization for On-demand Routing Protocols
Authors: Suhua TANG, Masahiro WATANABE, Naoto KADOWAKI, Sadao OBANA
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In mobile ad hoc networks on-demand routing protocols are very attractive due to low overhead. In these protocols, however, (1) the routes tend to contain weak links that have a low rate and high packet error ratio; (2) the routes are susceptible to breaks in the presence of mobility. Our major concern in this paper is to locally optimize the routes in the on-demand routing protocols in terms of link quality and mobility. The local optimization is realized by two main techniques: relating link metric with received signal strength and preferring the route with a shorter metric through Trigger Update (TU). In this manner the initial routes converge to the local optimum in the static case, and adapt to topology variations and link quality changes caused by mobility. Also, the routing overhead is controlled. Simulation results show that AODV with the application of local optimization (AODV-TU) achieves a much higher performance than the original AODV.