ppxscal/embedding_network huggingface dataset:
Algorithms for scalable and network-adaptive video coding and transmission
Authors: Antonio Ortega
Venue:  (2007)

Real-time multimedia services over the Internet face some fundamental challenges due to time constraints of those applications and network variations in bandwidth, delay and packet loss rate. Our research addresses the problem of network-adaptive video coding and streaming based on source codecs that provide scalability to match the network environments. The first part of the thesis focuses on scheduling algorithm design for network-adaptive video streaming. We extend previous work on rate-distortion optimized video streaming to address more general coding techniques that support multiple decoding paths to enhance adaptation flexibility. Prior work had only considered a single decoding path. Examples of multiple decoding paths include cases where there are multiple redundant representations of the media data or where error concealment is used. An example of these codes is our proposed multiple description layered coding (MDLC), which combines the advantages of layered coding and multiple description coding. This work is composed of several main components: (1) a new source model called directed acyclic hyperGraph (DAHG) to estimate the expected end-to-end distortion; (2) rate-distortion based scheduling algorithms to adjust dynamically the system's real-time redundancy to match the channel behavior; and (3) performance analysis on both source redundancy and transport redundancy. Experimental results show that the proposed streaming framework can provide a very robust and efficient video communication for real-time applications over lossy packet networks. The second part proposes a framework for adaptive scalable video coding using Wyner-Ziv techniques. The current scalable video coding standards suffer to some degree from a combination of lower coding performance and higher coding complexity, as compared to non-scalable coding. A key issue is how to exploit temporal correlation efficiently in scalable coding. We propose a novel scalable coding approach by introducing distributed source coding in enhancement layer prediction in order to achieve a better coding performance with reasonable encoding complexity. Experimental results show significant improvements in coding efficiency over MPEG-4 FGS, especially for video sequences with high temporal correlation.
Explaining Internet service quality in social security agencies using institutional theory
Authors: Anu Toots
Venue: Information Polity (2006)

This paper tries to apply institutional theory to the analysis of Internet-based social security services. I argue that institutional features of service providers matter significantly in the quality of websites. Diverse quality of websites in turn, is a crucial factor in explaining what causes different take-up rates of e-services. The article tests the relevance of empirical and normative accounts of institutional theory to explanation of the quality of public e-services. The websites of five institutions, which provide social insurance in Estonia, serve as the empirical base for the research. Results indicate that the extent of power (de)concentration is a more crucial variable in having citizen-oriented websites than the policy content or public-private ownership.
An Approximate Controller for Nonlinear Networked Control Systems with Time Delay
Authors: Peng Liu, Ping Zhou, Chuanwen Liu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

An approximation controller is developed to obtain an optimal control for nonlinear networked control systems (NCS) with time delay. In the approach only the non-linear compensating term, solution of a sequence of adjoint vector differential equations, is required iteration. By taking the finite iteration of non-linear compensating term of optimal solution sequence, a suboptimal control law for NCS can be obtained.
Model predictive control of a batch reactor with membrane-based separation
Authors: P. Thitiyasook, P. Kittisupakorn
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Recently, a batch reactor integrated with membrane-based separation has been a research area of growing interest and address for improving process performance in order to achieve a high desired product yield. The inclusive of membrane-based separation can shift the equilibrium of chemical reaction by selectively removing the reaction products, by-product species from reaction mixtures and therefore increase the yield of a desired product. In this work, a batch reactor with membrane-base separation for esterification has been studied. To operate the reactor efficiently, an optimal temperature has been determined to achieve best reaction rate and membrane permeability for overall batch. Furthermore, Model Predictive Control (MPC) coupled with an Extended Kalman Filter (EKF) has been designed and implemented to track the optimal temperature profile. The performance of the designed controller has been compared to that of a Generic Model Control (GMC) with Extended Kalman Filter techniques (EKF). Simulation studies have shown that the proposed controller can successfully control the reactor temperature at a desired set point and it is much more effective than the GMC in nominal, plant/model mismatch and noise cases.
AGN Simulation and Validation Model
Authors: Fabrício M. Lopes, Roberto M. Cesar,  Jr, Luciano F. Costa
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

An important question in computational biology is how genes are regulated and interact through gene networks. Some methods for the identification of gene networks from temporal data were proposed. An important open problem regards how to validate such resulting networks. This work presents an approach to validate such algorithms, considering three main aspects: (1) AGN model generation and simulation; (2) gene network identification; (3) validation of identified network.
Towards a Library of Workflow User Interface Patterns
Authors: Josefina Guerrero García, Jean Vanderdonckt, Juan Manuel Calleros, Marco Winckler
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

A collection of user interface design patterns for workflow infor ma tion systems is presented. Each Workflow User Interface Pattern (WUIP) is characterized by properties expressed in the PLML markup language for expressing patterns and augmented by additional attributes and models at tached to the pattern: the abstract user interface and the corresponding task model. These models are specified in a User Interface Description Langua ge. All WUIPs are stored in a library and can be retrieved within a workflow editor that links each workflow pattern to its corresponding WUIP, thus giving rise to a user interface for each workflow pattern. The software then gathers these UIs and the ones corresponding to workflow tasks into a user interface flow, a new concept introduced for specifying the intertwining of interfaces used by workers and the workflow manager in a single workflow.
Preliminary Application of a DGV System Using a Single Intensified Camera in a Supersonic Wind Tunnel
Authors: P. Wernert, B. Martinez
Venue: Journal of Visualization (2005)

A DGV system using a continuous wave Argon laser and an optical arrangement with a single intensified camera has been set up at the ISL blow-down supersonic wind tunnel. The first tests have been performed over a 12.5&deg; 2D wedge at a freestream Mach number of 2. A mean velocity field has been calculated from 28 individual measurements. When compared to the theoretical velocity distribution, deviations of 8% to 15% have been obtained. Preliminary tests have also been performed on a missile-like model equipped with a lateral jet system. Individual as well as mean velocity fields are presented.
Characters of table algebras and applications to association schemes
Authors: Bangteng Xu
Venue: Journal of Combinatorial Theory Series A (2008)

Hanaki [A. Hanaki, Representations of association schemes and their factor schemes, Graphs Combin. 19 (2003) 195-201; A. Hanaki, Characters of association schemes and normal closed subsets, Graphs Combin. 19 (2003) 363-369] generalized many properties of characters of finite groups to characters of association schemes. In this paper we show that many of these properties also hold for table algebras. Our approach is not to generalize the proofs in [A. Hanaki, Representations of association schemes and their factor schemes, Graphs Combin. 19 (2003) 195-201; A. Hanaki, Characters of association schemes and normal closed subsets, Graphs Combin. 19 (2003) 363-369] to table algebras, but to prove many stronger properties, and then obtain results in [A. Hanaki, Representations of association schemes and their factor schemes, Graphs Combin. 19 (2003) 195-201; A. Hanaki, Characters of association schemes and normal closed subsets, Graphs Combin. 19 (2003) 363-369] as direct consequences.
Fast Solution for Large-Scale 2-D Convection-Diffusion, Reacting Flows
Authors: Hoang Duc Minh, Hans Georg Bock, Steffen Tischer, Olaf Deutschmann
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

2-D convection-diffusion, reacting flows in a single channel of catalytic monoliths are investigated. The fluid dynamics are modelled by a steady state, boundary-layer equations, which is a large system of parabolic partial differential equations (PDEs) with nonlinear boundary conditions arising from the coupling between the gas-phase and surface processes. The chemical processes are modelled using detailed chemistry. The PDEs are semi-discretized by a method of lines leading to a large-scale, structured differential algebraic equations (DAEs). The DAEs are solved using a tailored BDF code. We exploit the structure of the Jacobian and freeze the diffusion coefficients during approximation of Jacobian by the finite difference. By applying our approach, the computation times have been reduced by a factor of 4 to 10 and more depending on the particular problem.
From Microarrays to Promoters: The Visual Story of Stat3
Authors: Urska Cvek, Marjan Trutschl, Zanobia Syed, John L. Clifford
Venue: Proceedings of the 2008 Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (2008)

High-throughput technologies have established themselves as indispensable for the study of biological systems, from gene expression level changes, protein concentrations, to their modifications and interactions in complex diseases and systems. This kind of data analysis is not well served by the biostatistical techniques traditionally applied to biomedical and clinical data sets. Non-trivial patterns are most often discovered using visual and other computational tools applied to this data. We derive patterns and information from a series of differentially expressed genes on eight microarrays combined with analysis of promoter regions using regular expression-driven examination of short representative sequences called motifs. These non-trivial patterns are used to aid the discovery process through the use of information visualization and by harnessing user’s perceptual and cognitive capabilities.
On Straight Line Segment Detection
Authors: Rafael Grompone Von Gioi, Jérémie Jakubowicz, Jean-Michel Morel, Gregory Randall
Venue: Journal of Mathematical Imaging and Vision (2008)

In this paper we propose a comprehensive method for detecting straight line segments in any digital image, accurately controlling both false positive and false negative detections. Based on Helmholtz principle, the proposed method is parameterless. At the core of the work lies a new way to interpret binary sequences in terms of unions of segments, for which a dynamic programming implementation is given. The proposed algorithm is extensively tested on synthetic and real images and compared with the state of the art.
New Results on Criteria for Choosing Delay in Strange Attractor Reconstruction
Authors: Yang Chen, Kazuyuki Aihara
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

The first minimum of mutual information (MI) is the most widely used criterion for choosing delay in delay-coordinates reconstruction of chaotic attractors. Recently, we proposed to use the independence measures grid occupancy (GO), quasientropy (QE), and Csiszar's generalized mutual information (GMI) as alternative criteria for choosing delay. In this paper, we study whether these criteria can outperform the MI in certain aspect. We generalize the definition of quality factor (QF), originally defined for QE, to make it also applicable for GO and GMI. We show that GO, QE, and GMI can have better QFs than that of MI, which means that they can have more prominent minima than the MI has. We also verify these results by numerical experiments.
Tactile metrology for active microsystems
Authors: S. B&#x00fc;tefisch, U. Brand, S. B&#x00fc;ttgenbach, G. Wilkening
Venue: Microsystem Technologies (2008)

Often active microsystems consist of hybrid structures. Usually tactile metrology is here the only possibility to check manufacturing tolerances in the sub-micrometer range and to guarantee a lasting quality assurance of the production. For characterizing microprobes with reference objects and for tactile measurements of micro-components a high precision 3d-positioning system was developed. The improvement of the probing system, which affects the measuring accuracy decisively, was the main topic of the research. First results of probing experiments are shown.
A Kernel Matching Pursuit Approach to Man-Made Objects Detection in Aerial Images
Authors: Wei Wang, Xin Yang, Shoushui Chen
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper describes a new aerial images segmentation algorithm. Kernel Matching Pursuit (KMP) method is introduced to deal with the nonlinear distribution of the man-made objects' features in the aerial images. In KMP algorithm, a lot of training samples containing substantive information are used to detect the man-made objects. With KMP classifier, pixels in large aerial images will be labeled as different prediction values, which can be classified linearly. Then the modified Mumford-Shah model, which comprises the features of the KMP prediction values, is built to segment the aerial image by necessary level set evolution. The proposed method is proven to be effective by the results of experiments.
An office document mashup for document-centric business processes
Authors: John M. Boyer, Eric Dunn, Maureen Kraft, Jun S.H. Liu, Mihir R. Shah, He Feng Su, Saurabh Tiwari
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

An office document mashup called 'Dual Forms' is presented to demonstrate the feasibility and advantages of imbuing an office document with intelligent interaction capabilities, access to web services of a service-oriented architecture (SOA), digital signatures for legally binding contractual agreements, and a self-submission capability that allows the document to flow through a collaborative network or business process.
An Algorithm for Robust Relative Influence Values Elicitation (ARRIVE)
Authors: S. E. Hegazy, C. D. Buckingham
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

This paper proposes an approach to solving node weightings in a tree structure. The tree represents expertise used to quantify risks associated with mental-health problems and it is incorporated within a web-based decision support system called GRiST. The aim of the algorithm is to find the set of relative node weightings in the tree that helps GRiST simulate the clinical risk judgements given by mental-health experts. The results show that a very large number of nodes (several thousand for GRiST) can have their weights calculated from the clinical judgements associated with a few hundred cases (200 for GRiST). This greatly reduces the experts' elicitation tasks by ensuring they do not need to provide their own estimation of node weights throughout the tree. The approach has the potential for reducing elicitation load in similar knowledge-engineering domains where relative weightings of node siblings are part of the parameter space.
The Speed of Convergence in Congestion Games under Best-Response Dynamics
Authors: Angelo Fanelli, Michele Flammini, Luca Moscardelli
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We investigate the speed of convergence of congestion games with linear latency functions under best response dynamics. Namely, we estimate the social performance achieved after a limited number of rounds, during each of which every player performs one best response move. In particular, we show that the price of anarchy achieved after k rounds, defined as the highest possible ratio among the total latency cost, that is the sum of all players latencies, and the minimum possible cost, is $O(\sqrt[2^{k-1}] {n})$, where n is the number of players. For constant values of k such a bound asymptotically matches the $\Omega(\sqrt[2^{k-1}] {n}/k)$ lower bound that we determine as a refinement of the one in [7]. As a consequence, we prove that order of loglogn rounds are not only necessary, but also sufficient to achieve a constant price of anarchy, i.e. comparable to the one at Nash equilibrium. This result is particularly relevant, as reaching an equilibrium may require a number of rounds exponential in n. We then provide a new lower bound of $\Omega(\sqrt[2^k-1] {n})$ for load balancing games, that is congestion games in which every strategy consists of a single resource, thus showing that a number of rounds proportional to loglogn is necessary and sufficient also under such a restriction.Our results thus solve the important left open question of the polynomial speed of convergence of linear congestion games to constant factor solutions.
Classify the Majority of the Total Bytes on the Internet
Authors: Jiao Wang, Yajian Zhou, Yixian Yang, Xinxin Niu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Traffic classification methods developed rapidly. Most of these methods have focused on high flow accuracy. However, the majority of the total bytes are occupied by a small part of flows. This flows may include P2P streaming, P2P file sharing, worms or DoS attack etc. Their effect to the internet is far more than the general applications. In this paper, we first analyze this type of applications and obtain significantly differences between them. And based on the analysis results we develop a classifier. Moreover, we design two methods to accelerate the classification performance, TCP packet accelerate and UDP packet heuristics method. Our experiment result shows that this classifier can classify the majority of total traffic.
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
Authors: Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm and claimed that it achieves an expected ratio of $\frac{89}{169}(1 - \epsilon)$ for any constant ¿> 0. However, their analysis was flawed. We present a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio very close to their claimed expected ratio.
Control-Based Real-Time Metadata Matching for Information Dissemination
Authors: Ming Chen, Xiaorui Wang, Raghul Gunasekaran, Hairong Qi, Mallikarjun Shankar
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Real-time information dissemination is of increasing importance to our society. Existing work mainly focuses on delivering information from sources to sinks in a timely manner based on established subscriptions, with the assumption that those subscriptions are persistent. However, the bottleneck of many real-time information dissemination systems is actually the matching process to continuously reevaluate such subscriptions between numerous sources and numerous sinks, in response to dynamically varying information attributes at runtime. In this paper, we propose a feedback controller to adaptively meet the response time constraints on metadata matching in an example information dissemination system. Our controller features a rigorous design based on well-established feedback control theory for guaranteed control accuracy and system stability. Empirical results on a physical test-bed demonstrate that our controller outperforms both an open-loop solution and a typical heuristic solution, by having more accurate control and better system quality of service.
Character N-Grams Translation in Cross-Language Information Retrieval
Authors: Jesús Vilares, Michael P. Oakes, Manuel Vilares
Venue: Proceedings of the 12th international conference on Applications of Natural Language to Information Systems: Natural Language Processing and Information Systems (2007)

This paper describes a new technique for the direct translation of character n-grams for use in Cross-Language Information Retrieval systems. This solution avoids the need for word normalization during indexing or translation, and it can also deal with out-of-vocabulary words. This knowledge-light approach does not rely on language-specific processing, and it can be used with languages of very different natures even when linguistic information and resources are scarce or unavailable. Our proposal also tries to achieve a higher speed during the n-gram alignment process with respect to previous approaches.
Using LiTGen, a realistic IP traffic model, to evaluate the impact of burstiness on performance
Authors: Chloé Rolland, Julien Ridoux, Bruno Baynat, Vincent Borrel
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

For practical reasons, network simulators have to be designed on traffic models as realistic as possible. This paper presents the evaluation of LiTGen, a realistic IP traffic model, for the generation of IP traffic with accurate time scale properties and performance. We confront LiTGen against real data traces using two methods of evaluation. These methods respectively allow to observe the causes and consequences of the traffic burstiness. Using a wavelet spectrum analysis, we first highlight the intrinsic characteristics of the traffic and show LiTGen's ability to reproduce accurately the captured traffic correlation structures over a wide range of timescales. Then, a performance analysis based on simulations quantifies the impact of these characteristics on a simple queuing system, and demonstrates LiTGen's ability to generate synthetic traffic leading to realistic performance. Finally, we conduct an investigation for a possible model reduction using memoryless assumptions.