Characterizing peers communities and dynamics in a P2P live streaming system

Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.     

Using Courseware Discussion Boards to Engage Graduate Students in Online Library Workshops

ABSTRACT

Librarians at Oregon State University (OSU) Libraries used the discussion board features of Blackboard courseware to create an interactive experience for graduate students at a distance who could not attend the on-campus “Literature Review Workshops.” These recently developed workshops have been extremely popular with graduate students across the disciplines and have generated a growing demand from distance education graduate students and faculty to offer similar information online. Reluctant to simply deliver content via an online tutorial, librarians sought to duplicate the workshop atmosphere by making the sessions available for a short time-period online, asking participants to respond to discussion questions at specific points in the workshop, and offering audio-mediated online demonstrations of tools and resources. Student feedback and follow-up requests for more workshops support the perception that this approach offered a rewarding learning experience that addressed their specific adult learning needs.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

Line patterning of graphite and the fabrication of cheap, inexpensive, “throw-away” sensors

A new simple method (“line patterning technique”) using only standard office equipment is described whereby clearly defined, electrically conducting patterns of graphite can be deposited on polymer (plastic) or paper substrates. The properties of the conductive patterns have been characterized by electrical conductivity and SEM measurements. Sensors were constructed by using interdigitated patterns of graphite deposited on plastic and paper, and coated with a thin film of conducting electronic polymer, e.g. polyaniline emeraldine salt.     

New approach for optimizing the interpretation and representation of the degree of historical-archaeological evidence in the virtual reconstructions

Virtual Reality - Virtual reconstruction is defined as the visual recovery of a building or object through the creation of a three-dimensional model of the asset to be reconstructed, in a...     

Structural damage identification via time domain response and Markov Chain Monte Carlo method

The present work addresses the problem of structural damage identification built on the statistical inversion approach. Here, the damage state of the structure is continuously described by a cohesion parameter, which is spatially discretized by the finite element method. The inverse problem of damage identification is then posed as the determination of the posterior probability densities of the nodal cohesion parameters. The Markov Chain Monte Carlo method, implemented with the Metropolis–Hastings algorithm, is considered in order to approximate the posterior probabilities by drawing samples from the desired joint posterior probability density function. With this approach, prior information on the sought parameters can be used and the uncertainty concerning the known values of the material properties can be quantified in the estimation of the cohesion parameters. The assessment of the proposed approach has been performed by means of numerical simulations on a simply supported Euler–Bernoulli beam. The damage identification and assessment are performed considering time domain response data. Different damage scenarios and noise levels were addressed, demonstrating the feasibility of the proposed approach.     

Science macro-indicators: some aspects of ost experience

We report OST experience on macro-indicators producing, especially on academic science and ISI sources. This task requires a combination of organizational choices for data handling and processing, and of bibliometric choices for a selection of indicators appropriate to the missions. Both aspects are briefly studied: the OST database, which also contains nonbibliometric datasets, is organized on the relational principle (RDBMS). Bibliometric indicators selected are classical ones, with a stress on overall coherence. In conclusion, standardization issue is briefly discussed. Standardization may not be desirable at the same extent for different targets (data, nomenclatures, indicators, procedures, etc.) and must not hinder further research. Natural process of communication and explication may also lead to fruitful convergences, without freezing supposed best ways.     

Simple procedures of choice in multicriteria problems without precise information about the alternatives’ values

The additive model of multiattribute value theory is widely used in multicriteria choice problems. But often it is not easy to obtain precise values for the scaling weights or the alternatives’ value in each function. Several decision rules which require weaker information, such as ordinal information, have been proposed to select an alternative under these circumstances. We propose new decision rules and test them using Monte-Carlo simulation, considering that there is ordinal information both on the scaling weights and on the alternatives’ values. Results show the new rules constitute a good approximation. We provide guidelines about how to use these rules in a context of selecting a subset of the most promising alternatives, considering the contradictory objectives of keeping a low number of alternatives yet not excluding the best one.     

Vehicle inductive signatures recognition using a Madaline neural network

In this paper, we report results obtained with a Madaline neural network trained to classify inductive signatures of two vehicles classes: trucks with one rear axle and trucks with double rear axle. In order to train the Madaline, the inductive signatures were pre-processed and both classes, named C2 and C3, were subdivided into four subclasses. Thus, the initial classification task was split into four smaller tasks (theoretically) easier to be performed. The heuristic adopted in the training attempts to minimize the effects of the input space non-linearity on the classifier performance by uncoupling the learning of the classes and, for this, we induce output Adalines to specialize in learning one of the classes. The percentages of correct classifications presented concern patterns which were not submitted to the neural network in the training process, and, therefore, they indicate the neural network generalization ability. The results are good and stimulate the maintenance of this research on the use of Madaline networks in vehicle classification tasks using not linearly separable inductive signatures.