ppxscal/embedding_network huggingface dataset:
An analysis of the social structure of remix culture
Authors: Giorgos Cheliotis, Jude Yew
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

We present findings from our study of a music sharing and remixing community in an effort to quantify and understand the structural characteristics of commons-based peer production for products of aesthetic/cultural or entertainment value. We also provide a normative perspective on the strategies that such communities should employ with respect to the use of 'remixing contests', which are popular means of attracting new user-creators to the community and boosting its creative output. Until now research has shied away from the quantitative study of what lies at the heart of this 'remix culture', i.e. remixing, presumably because of the difficulties inherent in attaining relevant large datasets amenable to numerical analysis and an early focus of research efforts on communities whose products serve a more functional purpose (e.g., open source software), rather than aiming at entertainment or personal and artistic expression. This paper contributes to the literature of social network analysis of online communities, the literature on commons-based peer production, and the research agenda of cultural analytics.
Generalized mixtures in reliability modelling: Applications to the construction of bathtub shaped hazard models and the study of systems
Authors: Jorge Navarro, Antonio Guillamón, María del Carmen Ruiz
Venue: Applied Stochastic Models in Business and Industry (2009)

In this paper, we obtain and discuss some general properties of hazard rate (HR) functions constructed via generalized mixtures of two members. These results are applied to determine the shape of generalized mixtures of an increasing hazard rate (IHR) model and an exponential model. In addition, we note that these kind of generalized mixtures can be used to construct bathtub-shaped HR models. As examples, we study in detail two cases: when the IHR model chosen is a linear HR function and when the IHR model is the extended exponential-geometric distribution. Finally, we apply the results and show the utility of generalized mixtures in determining the shape of the HR function of different systems, such as mixed systems or consecutive k-out-of-n systems. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Using voxel models in automation of mathematical modeling
Authors: A. V. Tolok
Venue: Automation and Remote Control (2009)

Consideration was given to an approach to the problems of mathematical modeling based on special-purpose graphic image models providing informational groundwork for the differential analysis of an analytic expression.
Demystifying internet traffic
Authors: Amin Vahdat
Venue:  (2008)

Understanding Internet traffic is important in a number of different scenarios. Internet service providers (ISPs) would like to understand traffic demand at different points in the network while taking capacity planning measures for the future. Router manufacturers would benefit from understanding traffic characteristics while performing queue managements studies. Similarly, existing Internet traffic interacts with and influences the performance of any new deployed service that we wish to test on the Internet. In order to assist with these scenarios, we propose Internet-like traffic generation for local testbeds with the ability to project traffic demands into alternate scenarios. Achieving this goals requires addressing challenges. For instance, traffic mix changes over time and application semantics keep evolving. Moreover, Internet traffic exhibits a statistically rich structure at multiple timescales. The cornerstone of this thesis is the contribution of a tool called Swing which addresses the above challenges. It is the first realistic and responsive traffic generator that can reproduce observed burstiness properties in Internet traffic at multiple time scales. We validate Swing using publicly available traffic traces and then present two of the many different uses it enables. We demonstrate that it is important to consider background traffic for evaluation of distributed systems. The fact that Internet traffic is bursty means that it interacts with application traffic in complex ways, and the outcome cannot be predicted a-priori. We propose that system evaluation should proceed by subjecting the application to realistic traffic settings, and more importantly, to a variety of different scenarios. In particular, we demonstrate that some of the common techniques the community has been using, including Poisson and CBR (constant bit rate) traffic, can lead to misleading conclusions. Finally, we demonstrate the utility of Swing to project traffic demands into the future. We start by exposing the limitations of existing techniques due to their inability to understand/model evolution. Thus, we propose a simple mechanism that network administrators could use to generate traffic demands based on intuitively projected what-if scenarios.
A Credit Record Driven QoS Assurance Mechanism for SOC System
Authors: Xian-Zhen Yin, Jing Jiang, Zhen-Kuan Pan, Bai-Qiang Xia
Venue: Proceedings of the 2008 International Seminar on Business and Information Management - Volume 02 (2008)

As the importance of service’s continuity forService-Oriented Computing (SOC) system and presentQoS assurance mechanisms in SOC system did not takefull account of the impact of the service componentsdynamics. In order to solve this problem credit modeland credit function was put forward, CRD (CreditRecord Data) is used to quantize the SOC system’sdynamic. A new QoS assurance mechanism which basedon the service schedule is proposed, service reserve andservice backup algorithm droved by CRD respectively toachieve risk aversion, inhibiting, prevent and riskcompensation. Distinct services with different QoS leveluse CRD then give priority to services with high QoSlevel and schedule them with tasks at first. In the servicelife capture credit event and manage risks. Simulationexperiments have been done, the results show that thisQoS assurance mechanism can reduce the impact causedby system’s dynamics, ensure system services’ continuityand enhance the system’s QoS.
Pseudo-equivalence of fuzzy PI controller
Authors: Constantin Volosencu
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

This paper presents a pseudo-equivalence of the digital PI fuzzy controllers with the PI linear controllers in the continuous time domain. A method to design PI fuzzy controller is presented. Transfer functions and equivalence relations between controller's parameters are obtained for the common structures of the PI fuzzy controllers. The pseudo-equivalence is made based on a grapho-analithic analysis based on transfe characteristics of the fuzzy block, the linearization of the fuzzy block around the origin and the usage of the gain in origin obtained as an origin limit of the nonlinear gain of the fuzzy block. An algorithm of equivalence presented. Some advantages of this method are emphasized.
Searching for Definitional Answers on the Web Using Surface Patterns
Authors: Alejandro Figueroa, Günter Neumann, John Atkinson
Venue: Computer (2009)

A novel question-answering system employs query rewriting techniques to increase the probability of extracting nuggets from various Web snippets by matching surface patterns. Experimental results show the approach's promise versus existing techniques.
Virtual Rome: a FOSS approach to WEB3D
Authors: Luigi Calori, Carlo Camporesi, Sofia Pescarin
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

The goal of VirtualRome project (www.virtualrome.it) is to provide a web-based infrastructure for distribution, collection, annotation and sharing over the web of 3D interactive content such as actual and reconstructed landscape. For this project we have developed a framework for the integration of 3D realtime application within web browsers; the full functionality is currently available only for Windows Firefox, limited versions are available for Firefox Linux and Explorer. We present a completely FOSS approach to the web deployment of a 3d database consisting of landscape data at different time and different resolution. Components of a deployment platform will be analyzed and We will outline our approach comparing with other available systems.
Hybrid testbeds for QoS management in opaque MANETS
Authors: Pratik K. Biswas, Alex Poylisher, Ritu Chadha, Abhrajit Ghosh
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

The design of QoS mechanisms for wireless networks in general, and mobile ad hoc networks (MANETs) in particular, is a challenging task. The challenges are further compounded when the characteristics of the intermediate network segments are not observable from the originating segment, and as a consequence these segments have to be treated as opaque networks. End-to-end QoS assurance for such opaque networks, consisting of admission control and quality adjustment, can be based on techniques for dynamically measuring throughput representing the state of these networks. Testing these QoS mechanisms poses a special technical challenge due to the difficulty of conducting experiments in a MANET environment at a scale larger than a dozen nodes or so. In this paper, we describe a distributed and hybrid testbed that has been deployed for running large-scale experiments to demonstrate the efficacy of a measurement-based QoS solution. The infrastructure for the testbed provides an integrated platform consisting of real nodes running the actual software under test, augmented with a simulated network environment. We define a set of metrics and run experiments to evaluate the effectiveness of the QoS solution as well the performance of the deployed testbed. We propose an alternate architecture that employs a Xen-based virtualization of the real nodes from the deployed testbed. We compare the performances of the virtualized architecture with the non-virtualized one vis-&agrave;-vis latency and resource utilization. Our goal is to establish benchmarks for running large-scale experiments on performance and QoS measurements in virtualized environments.
Quantum minimization for adapting ANFIS outputs to its nonlinear generalized autoregressive conditional heteroscedasticity
Authors: Bao Rong Chang, Hsiu-Fen Tsai
Venue: Applied Intelligence (2009)

Volatility clustering degrades the efficiency and effectiveness of time series prediction and gives rise to large residual errors. This is because volatility clustering suggests a time series where successive disturbances, even if uncorrelated, are yet serially dependent. Traditional time-series forecast model such as grey model (GM) or auto-regressive moving-average (ARMA) has often encountered the overshoot effect, thus leading to the deterioration of its predictive accuracy. To overcome the overshoot and volatility clustering problems at the same time, an adaptive neuro-fuzzy inference system (ANFIS) is combined with a nonlinear generalized autoregressive conditional heteroscedasticity (NGARCH) model that is adapted by quantum minimization (QM) so as to tackle the problem of overshooting situation and time-varying conditional variance residual errors. The proposed method significantly reduces large residual errors in forecasts because the overshoot and volatility clustering effects are regulated to trivial levels. Two experiments using real financial and geographic data series, respectively, compare the proposed method and a number of well-known alternative methods. Results show that forecasting performance by the proposed method produces superior results, with good speed of computation. Goodness of fit of the proposed method is tested by Ljung-Box Q-test. It is concluded that the ANFIS/NGARCH composite model adapted by QM performs very well for improved predictive accuracy of irregular non-periodic short-term time series forecast and will be of interest to the science of statistical prediction of time series.
The formation of inter-organizational information sharing networks in public safety: Cartographic insights on rational choice and institutional explanations
Authors: Christine B. Williams, Martin Dias, Jane Fedorowicz, Dax Jacobson, Sonia Vilvovsky, Steve Sawyer, Michael Tyworth
Venue: Information Polity (2009)

In this article we offer visual depictions and analysis of contextual factors relative to the presence of public safety networks (PSNs) in the United States (US). A PSN combines shared technological infrastructures for supporting information sharing, computing interoperability and interagency interactions involving policing, criminal justice, and emergency response. The broad research objective is to explain the formation of PSNs based upon factors derived from rational choice and institutional theories. To do so we develop maps to represent our data analysis. This analysis suggests that our approach is promising for generating insights about PSNs and, by extension, about other types of inter-organizational collaborations focusing on using information and communication technologies to enable information-sharing.
Brief paper: Set-membership filtering for systems with sensor saturation
Authors: Fuwen Yang, Yongmin Li
Venue: Automatica (Journal of IFAC) (2009)

This paper addresses the set-membership filtering problem for a class of discrete time-varying systems with sensor saturation in the presence of unknown-but-bounded process and measurement noises. A sufficient condition for the existence of set-membership filter is derived. A convex optimisation method is proposed to determine a state estimation ellipsoid that is a set of states compatible with sensor saturation and unknown-but-bounded process and measurement noises. A recursive algorithm is developed for computing the ellipsoid that guarantees to contain the true state by solving a time-varying linear matrix inequality. Simulation results are provided to demonstrate the effectiveness of the proposed method.
Sparse higher order conditional random fields for improved sequence labeling
Authors: Xian Qian, Xiaoqian Jiang, Qi Zhang, Xuanjing Huang, Lide Wu
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse Higher Order Conditional Random Fields (SHO-CRFs), which are able to handle local features and sparse higher order features together using a novel tractable exact inference algorithm. Our main insight is that states and transitions with same potential functions can be grouped together, and inference is performed on the grouped states and transitions. Though the complexity is not polynomial, SHO-CRFs are still efficient in practice because of the feature sparseness. Experimental results on optical character recognition and Chinese organization name recognition show that with the same higher order feature set, SHO-CRFs significantly outperform previous approaches.
Large System Performance of SPEC OMP2001 Benchmarks
Authors: Hideki Saito, Greg Gaertner, Wesley Jones, Rudolf Eigenmann, Hidetoshi Iwashita, Ron Lieberman, Matthijs Waveren, Brian Whitney
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

Performance characteristics of application programs on large-scale systems are often significantly different from those on smaller systems. SPEC OMP2001 is a benchmark suite intended for measuring performance of modern shared memory parallel systems. The first component of the suite, SPEC OMPM2001, is developed for medium-scale (4- to 16-way) systems. We present our experiences on benchmark development in achieving good scalability using the OpenMP API. This paper then analyzes the published results of SPEC OMPM2001 on large systems (32-way and larger), based on application program behavior and systems' architectural features. The ongoing development of the SPEC OMP2001 benchmark suites is also discussed. Its main feature is the increased data set for large-scale systems. We refer to this suite as SPEC OMPL2001, in contrast to the current SPEC OMPM2001 (medium data set) suite.
MulTFRC: providing weighted fairness for multimediaapplications (and others too!)
Authors: Dragana Damjanovic, Michael Welzl
Venue: ACM SIGCOMM Computer Communication Review (2009)

When data transfers to or from a host happen in parallel, users do not always consider them to have the same importance. Ideally, a transport protocol should therefore allow its users to manipulate the fairness among flows in an almost arbitrary fashion. Since data transfers can also include real-time media streams which need to keep delay | and hence buffers | small, the protocol should also have a smooth sending rate. In an effort to satisfy the above requirements, we present MulTFRC, a congestion control mechanism which is based on the TCP-friendly Rate Control (TFRC) protocol. It emulates the behavior of a number of TFRC flows while maintaining a smooth sending rate. Our simulations and a real-life test demonstrate that MulTFRC performs significantly better than its competitors, potentially making it applicable in a broader range of settings than what TFRC is normally associated with.
Parallel community detection on large networks with propinquity dynamics
Authors: Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a novel community detection algorithm, which utilizes a dynamic process by contradicting the network topology and the topology-based propinquity, where the propinquity is a measure of the probability for a pair of nodes involved in a coherent community structure. Through several rounds of mutual reinforcement between topology and propinquity, the community structures are expected to naturally emerge. The overlapping vertices shared between communities can also be easily identified by an additional simple postprocessing. To achieve better efficiency, the propinquity is incrementally calculated. We implement the algorithm on a vertex-oriented bulk synchronous parallel(BSP) model so that the mining load can be distributed on thousands of machines. We obtained interesting experimental results on several real network data.
Assessment of classification and indexing of an agricultural journal based on metadata in AGRIS and CAB Abstracts databases
Authors: Tomaz Bartol
Venue: International Journal of Metadata, Semantics and Ontologies (2009)

Agricultural thesauri and classification schemes are being increasingly upgraded as ontologies, prompting end-user awareness of the concept of structured taxonomies and metadata. Related agricultural databases, such as Agris and CAB Abstracts, exhibit differences in subject headings, indexing and classification what we illustrate on the example of an animal and plant production journal Acta Agriculturae Slovenica. Variations are attributable to differences among descriptors, categories, indexing rules, and information professionals. Similar search queries or syntax retrieves different documents. Certain level of replication in different databases, however, enhances retrieval recall and, in turn, boosts international visibility of scientific papers or documents.
Localization in time and space for wireless sensor networks: A Mobile Beacon approach
Authors: Azzedine Boukerche, Horacio A. B. F. Oliveira, Eduardo F. Nakamura, Antonio A. F. Loureiro
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Localization in time and space can be defined as the problem of solving both synchronization and positioning problems at the same time. This is a key problem for wireless sensor networks that need to determine the timing and location information of detected phenomena, especially for tracking applications. In this paper, we discuss the relationship between these two problems and propose the Mobilis (Mobile Beacon for Localization and Synchronization) algorithm, a new time-space localization algorithm for wireless sensor networks. The main aspect of the Mobilis algorithm is the use of a mobile beacon for both localization and synchronization. A mobile beacon is a node that is aware of its time and position (e.g. equipped with a GPS receiver) and that has the ability to move around the sensor field. In our algorithm, the synchronization component uses the packets required by the positioning component to improve its performance. Similarly, the positioning component benefits from the communication required by the synchronization component to decrease errors. We also present an extensive set of experiments and simulations to evaluate the performance of our algorithm.
Joint Throughput Optimization for Wireless Mesh Networks
Authors: Xiang-Yang Li, Ashraf Nusairat, Yanwei Wu, Yong Qi, JiZhong Zhao, Xiaowen Chu, Yunhao Liu
Venue: IEEE Transactions on Mobile Computing (2009)

In this paper, we address the problem of joint channel assignment, link scheduling, and routing for throughput optimization in wireless networks with multiradios and multichannels. We mathematically formulate this problem by taking into account the interference, the number of available radios the set of usable channels, and other resource constraints at nodes. We also consider the possible combining of several consecutive channels into one so that a network interface card (NIC) can use the channel with larger range of frequencies and thus improve the channel capacity. Furthermore, we consider several interference models and assume a general yet practical network model in which two nodes may still not communicate directly even if one is within the transmission range of the other. We designed efficient algorithm for throughput (or fairness) optimization by finding flow routing, scheduling of transmissions, and dynamic channel assignment and combining. We show that the performance, fairness and throughput, achieved by our method is within a constant factor of the optimum. Our model also can deal with the situation when each node will charge a certain amount for relaying data to a neighboring node and each flow has a budget constraint. Our extensive evaluation shows that our algorithm can effectively exploit the number of channels and radios. In addition, it shows that combining multiple channels and assigning them to a single user at some time slots indeed increases the maximum throughput of the system compared to assigning a single channel.
Rapid Prototyping of Digital Systems: SOPC Edition, 1st edition
Authors: James O. Hamblen, Tyson S. Hall, Michael D. Furman
Venue:  (2007)

New to this edition is an introduction to embedded operating systems for SOPC designs. The Clinux OS is configured for Altera's DE1 and DE2 boards and is provided ona DVD along with several application programs. Featuring four accelerated tutorials on the Quartus II and Nios II design environments, this edition progresses from introductory programmable logic to full-scale SOPC design integrating hardware implementation, software development, operating system support, state-of-the-art I/O, and IP cores. This edition features Altera's new 7.1 Quartus II CAD and Nios II SOPC tools and includes projects for Altera's DE1, DE2, UP3, UP2, and UP1 FPGA development boards. Laboratory projects provided on the book's DVD include complete projects for video graphics and text, mouse and keyboard input, and three separate computer examples including a Nios II "reference" design for the DE2, DE1, and UP3 FPGA boards.