ppxscal/embedding_network huggingface dataset:
Design of frame dependency for VCR streaming videos
Authors: Kai-Chao Yang, Chun-Ming Huang, Jia-Shung Wang
Venue: Image Communication (2007)

The structure of Group of pictures (GOP) is favorable for GOP-based random-access operations, while inside the GOP, the sequential coding dependency between frames is unfavorable for frame-based random-access or fast-scan operations. In a video streaming system, when some VCR operations such as fast-scan operations are performed, they may cause serious server load or network load due to the speed-up of transmitting frames. In this paper, we formulated the fast-scan and random-access operations of VCR functionality, and proposed a novel frame dependency to eliminate extra server load and minimize requirements of the network bandwidth when performing fast-scan and random-access operations. With the proposed structure, the server does not have to speed up the transmission rate of frames to fulfill the requested playback rate. The number of frames to be transmitted is also significantly reduced, and thus the network load can be decreased.
Narrowband channel extraction for wideband receivers
Authors: M. L. Welborn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

One of the most computationally intensive processing stages of a wideband digital receiver is the extraction of a narrowband channel from a wideband input signal. In implementations that compute the convolutional sum, the computation is proportional to the bandwidth of the input signal. This paper shows how to break this dependence, reducing the limiting factor to the requirement to maintain a sufficient output signal-to-noise ratio (SNR). This paper describes two complementary algorithms for efficient channel extraction in wideband receivers. The first allows the required frequency translation to be performed at the lower sample rate of the channel filter output. The second algorithm decouples the effect of interference rejection from the SNR improvement and improves the computational efficiency of filtering by using only a subset of the input samples. Additionally, we present a simple model to quantify the effects of this technique and experimental verification using a wideband software radio receiver.
Performance analysis of a GI[X]/Geo/m/N queue with partial- and total-batch rejection
Authors: V. Goswami, S. K. Samanta
Venue: Computers Mathematics with Applications (2007)

This paper analyzes a discrete-time multiserver finite-buffer queueing system with batch renewal arrivals in which inter-batch time of batches and service times of customers are, respectively, arbitrarily and geometrically distributed. Each customer gets service from only one server. Using the supplementary variable and the imbedded Markov chain techniques, we obtain the state probabilities at prearrival, arbitrary and outside observer's observation epochs for partial- and total-batch rejection policies. The blocking probability of the first-, an arbitrary- and the last-customer in a batch, and other performance measures along with some numerical results have been discussed. The analysis of actual waiting-time distributions measured in slots of the first-, an arbitrary- and the last-customer in an accepted batch has also been investigated. Finally, it is shown that in the limiting case the results obtained in this paper tend to the continuous-time counterpart.
Coevolutionary design of Takagi-Sugeno fuzzy systems
Authors: M. R. Delgado, F. Von Zuben, F. Gomide
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper suggests a coevolutionary approach to design Takagi-Sugeno fuzzy models. The coevolutionary process induces cooperation among individuals of genetically different populations, the species. Populations from four species represent partial solutions to the fuzzy modeling problem. Cooperation is also achieved via fitness sharing, once the fitness of an individual depends on the fitness of individuals of different species. The performance of the proposed approach is evaluated using a function approximation problem with noisy data, and a classification problem.
Chaotic algorithms for data encryption
Authors: M. I. Sobhy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A system of encryption based on chaotic algorithms is described. The system is used for encrypting text and image files for the purpose of creating secure data bases and for sending secure e-mail messages. The system is also implemented on an FPGA for real-time applications. Levels of security several orders of magnitude better than published systems have been achieved.
An analytical QoS service model for delay-based differentiation
Authors: Christos Bouras, Afrodite Sevasti
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

The increased need for Quality of Service (QoS) in today's IP networks has concentrated a lot of research and implementation efforts. Carefully designed and managed priority services are essential for quality-demanding traffic, especially in large-scale IP-based environments where aggregation of flows is extensive and a variety of traffic types co-exist. Although individual mechanisms have been widely investigated, not much related work exists on integrated approaches to QoS provisioning that are also feasible to implement. This work presents a thorough approach to the design, dimensioning and provisioning of a high-priority service for high-quality-demanding traffic over an IP network. Our approach employs efficient scheduling and a dynamic admission control scheme while demonstrating an outstanding performance in terms of the quality offered to QoS-demanding traffic. A novel feature is also introduced: while other existing schemes only focus on provisioning of service rate guarantees, ours achieves in addition differentiation of the end-to-end delay perceived by IP flows.
SEAMS 2007: Software Engineering for Adaptive and Self-Managing Systems
Authors: Betty H. C. Cheng, Rogerio de Lemos, Stephen Fickas, David Garlan, Marin Litoiu, Jeff Magee, Hausi A. Muller, Richard Taylor
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The objective of the SEAMS (Software Engineering for Adaptive and Self-managing Systems) workshops is to consolidate the interest in the software engineering community on autonomic, self-managing, self-healing, self-optimizing, self-configuring, and self-adaptive systems. SEAMS provides a forum for researchers to share new results, raise awareness, and promote collaboration within the community. The SEAMS 2007 workshop builds on the great success of SEAMS 2006 at ICSE in Shanghai to assess progress and identify challenges in this area.
Segmentation of specific speech signals from multi-dialog environment using SVM and wavelet
Authors: T. K. Truong, Chien-Chang Lin, Shi-Huang Chen
Venue: Pattern Recognition Letters (2007)

In this paper, a novel multi-speaker segmentation technique is presented. This technique makes use of wavelets and support vector machines (SVMs) to segment specific speakers' speech signals from multi-dialog environments. The proposed method first applies wavelets to determine the acoustical features such as subband power and pitch information from a given multi-dialog speech data. Then the multi-speaker segmentation of the given multi-dialog speech data can be accomplished by the use of a bottom-up SVM over these acoustical features and additional parameters, such as frequency cepstral coefficients. A public audio database, Aurora-2, is used to evaluate the performances of the proposed method. Experimental results show that the accuracy of multi-speaker segmentation is 100% achieved in the combination of two speakers. And the segmental accuracy can achieve at least 94.12% and 85.93% for 4-speaker and 8-speaker conditions, respectively.
Observer-Based Constrained Model Predictive Control of Substrate in Fed-Batch Bioreactor
Authors: Xu Zhe, Mingtao Kang, Hak Kyeong Kim, Sang Bong Kim
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The fed-batch fermentation process is considerably difficult to control accurately owing to its inherent nonlinear and time variant dynamics. To overcome the problems, an observer-based constrained model predictive control is presented for controlling the substrate feeding in bioreactor. First, the modified observer is used for obtaining full state information. Next, from the full state information, the controller is implemented using input output linearization method. The proposed controller (OCMPC) is compared with other controllers to show the effectiveness of the proposed controller. The simulation results have better tracking performance of output plant to the reference in the proposed controller than the others.
Exploiting underlying structure for detailed reconstruction of an internet-scale event
Authors: Abhishek Kumar, Vern Paxson, Nicholas Weaver
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Network "telescopes" that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spread of worms and the backscatter from flooding attacks that use spoofed source addresses. Current telescope analyses produce detailed tabulations of packet rates, victim population, and evolution over time. While such cataloging is a crucial first step in studying the telescope observations, incorporating an understanding of the underlying processes generating the observations allows us to construct detailed inferences about the broader "universe" in which the Internet-scale activity occurs, greatly enriching and deepening the analysis in the process. In this work we apply such an analysis to the propagation of the Witty worm, a malicious and well-engineered worm that when released in March 2004 infected more than 12,000 hosts world-wide in 75 minutes. We show that by carefully exploiting the structure of the worm, especially its pseudo-random number generation, from limited and imperfect telescope data we can with high fidelity: extract the individual rate at which each infectee injected packets into the network prior to loss; correct distortions in the telescope data due to the worm's volume overwhelming the monitor; reveal the worm's inability to fully reach all of its potential victims; determine the number of disks attached to each infected machine; compute when each infectee was last booted, to sub-second accuracy; explore the "who infected whom" infection tree; uncover that the worm specifically targeted hosts at a US military base; and pinpoint Patient Zero, the initial point of infection, i.e., the IP address of the system the attacker used to unleash Witty.
A new approach to distributed memory management in the mach microkernel
Authors: Stephan Zeisset, Stefan Tritscher, Martin Mairandres
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

In this paper we describe a new approach towards extending Mach virtual memory semantics across the node boundaries of a multicomputer system. At its core, the Advanced Shared Virtual Memory (ASVM) system employs algorithms from the realm of shared virtual memory that were adapted and extended to create a system that is efficient and scalable and supports full VM semantics, paging between node memories and efficient execution of SVM applications. Our performance measurements demonstrate ASVM's superior efficiency and scalability compared to its predecessor, the Extended Memory Manager (XMM) that is part of the Mach kernel's NORMA distribution.
Architectures for generalized 2D FIR filtering using separable filter structures
Authors: M. S. Andrews
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The problem of generalized 2D FIR filtering for large filter kernel sizes can be computationally prohibitive when required in real-time, such as with video applications. In this paper, we describe architectures and design methods for generalized 2D FIR filtering employing LOGIC Devices' LF33xx (HV filter) family of devices. The LF33xx family of devices is designed to perform dimensionally separate filtering (row/column) along orthogonal axes (horizontal direction and vertical direction for video applications). Additionally, we will briefly review 2D filter design and kernel separability theory.
Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension
Authors: David Coeurjolly, Annick Montanvert
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In binary images, the Distance Transformation (DT) and the geometrical skeleton extraction are classic tools for shape analysis. In this paper, we present time optimal algorithms to solve the reverse Euclidean distance transformation and the reversible medial axis extraction problems for d-dimensional images. We also present a d-dimensional medial axis filtering process that allows us to control the quality of the reconstructed shape.
Valid Transformations: A New Class of Loop Transformations
Authors: Minjoong Rim, Rajiv Jain
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

In this paper we present a new class of loop optimizing transformations called valid transformations. This class of transformations are different from existing ones in that valid transformations can be illegal and can result in incorrect non-pipelined designs. Nevertheless, valid transformations have feasible pipeline schedules which is important for scheduling loops. We present an example valid transformation called loop expansion which can help explore a larger design space and helps in producing cost-performance efficient designs. Several examples are used to demonstrate the efficacy of the proposed transformations.
XFree86 - past present, future
Authors: Dirk Hohndel
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

This talk will give a quick tour of the history of XFree86, of the current state of things, and will focus on where we are headed with XFree86-4.0.
Interactive AR bowling system by vision-based tracking
Authors: Yuko Uematsu, Hideo Saito
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

This paper presents an interactive bowling system using vison-based tracking for AR. With the bowling system, a user can enjoy the bowling game by rolling a real ball down a bowling lane model placed on a tabletop in the real world. On the lane model, there are virtual pins generated with CG. The virtual pins are overlaid onto the input images, which are captured by a web-camera attached to a hand-held tablet PC, according to the camera motion. The camera motion is estimated by multiple 2D markers which are also placed on the tabletop around the lane model. The lane and the ball are also tracked by vision-based tracking. According to the detected ball's trajectory on the lane, the geometrical relationship between the real ball and the virtual pins is computed to judge whether the ball is touching any pins or not. After judging, the pins touching the ball are knocked down. Our vision-based tracking method can run in real-time, so it can also be applied to other interactive applications.
Use of local entropy changes as a measure for identification of facial expressions
Authors: D. Gokcay
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Facial expression recognition systems have developed rapidly. Most of the current systems are based on complex measures such as motion parameters, or models of muscular activity. On the other hand, entropy is a simple, yet powerful tool in discriminating activity in subsequent frames. In this study, we examined the use of local entropy changes in the identification of facial expressions. Six basic emotional facial expressions are collected from subjects as video sequences. The face is partitioned into rectangular boxes blindly, without considering the location of facial features. A Bayesian classifier is used to identify the expressions by looking at the patterns of entropy changes in the individual boxes. The results are satisfactory for the three expressions happy, surprised and sad, and exhibit consistency with the behavioral pattern reported in psychology literature.
A study of solitary waves in a tapered aorta by using the theory of solitons
Authors: J. C. Misra, M. K. Patra
Venue: Computers Mathematics with Applications (2007)

By applying the soliton theory, a method is developed in this paper with an aim to study the flow properties of blood in large blood vessels. The theory takes into account the nonlinear terms of the Navier-Stokes equations as well as the large deformations of the aortic wall. The solutions of the equations of motion are restricted to the propagation of axisymmetric long waves. As for the equations governing the motion of the aorta, the longitudinal motion of the aortic wall is considered negligible. The radial motion is obtained directly from the pressure wave and the material behaviour of the aorta, by considering the motion of an elementary volume of the wall tissues. By using the experimentally measured values of the system parameters, computational work has been carried out to examine the change in radius, rate of change of radius, the dependence of the radius of the aorta on the longitudinal distance and the axial velocity distribution of blood in the aorta within a cardiac cycle. Variation of the stroke volume of the blood pulse is also determined for different taper angles of the aorta.
Cramer-Rao lower bounds for abrupt change parameters in additive and multiplicative noise
Authors: J. Y. Tourneret
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The paper addresses the problem of determining the Cramer-Rao lower bounds for noise and abrupt change parameters, for steplike signals corrupted by multiplicative and/or additive noise. Closed-form expressions are derived for an ideal step with a known changepoint. For an unknown changepoint, the noise-free signal is modeled by a sigmoidal function parametrized by location and step rise parameters. The noise and step change CRLBs are then shown to be well approximated by the more tractable expressions derived for a known changepoint.
An agent based approach to examining shared situation awareness
Authors: Simon Connelly, Peter Lindsay, Marcus Gallagher
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

With the increased interest in multi-user systems with distributed decision making tasks, such as network centric warfare and free-flight air traffic control, the concept of Shared Situation Awareness (SSA) has become more important. SSA relates to the awareness that different operators have of the system state and the information needs of their team-mates, in order to coordinate their actions effectively. However, there are many different definitions of SSA in the literature and no generally agreed methodology for measuring it. Investigation to date has primarily been conducted through human-in-the-loop (HIL) experiments, which typically are costly and return only subjective results. Agent based modelling has been proposed as a partial solution, using software agents to take the place of humans in experiments. This paper describes the application of agent based modelling to a multi-user system: namely, the SCUDhunt game. The paper examines different ways of sharing information between operators, and their effect on team performance in cases with less than perfect information. Agent based modelling enables performance to be tested on a wide range of scenarios quickly and repeatedly and yields insights that would be difficult to achieve through HIL experiments alone.
Call Management Policy Specification for the Asterisk Telephone Private Branch Exchange
Authors: George Konstantoulakis, Morris Sloman
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Both users and administrators need a flexible and easy to use means of specifying call management policies to take advantage of the call handling functionality for selective forwarding, cost based outward call routing, recording calls etc. which are supported by a VoIP PBX . This paper presents a case study of a system for specifying and implementing policies, as well as detecting and resolving policy conflicts for the Asterisk PBX.
Translation Templates to Support Strategy Development in PVS
Authors: Hongping Lim, Myla Archer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In presenting specifications and specification properties to a theorem prover, there is a tension between convenience for the user and convenience for the theorem prover. A choice of specification formulation that is most natural to a user may not be the ideal formulation for reasoning about that specification in a theorem prover. However, when the theorem prover is being integrated into a system development framework, a desirable goal of the integration is to make use of the theorem prover as easy as possible for the user. In such a context, it is possible to have the best of both worlds: specifications that are natural for a system developer to write in the language of the development framework, and representations of these specifications that are well matched to the reasoning techniques provided in the prover. In a tactic-based prover, these reasoning techniques include the use of tactics (or strategies) that can rely on certain structural elements in the theorem prover's representation of specifications. This paper illustrates how translation techniques used in integrating PVS into the TIOA (Timed Input/Output Automata) system development framework produce PVS specifications structured to support development of PVS strategies that implement reasoning steps appropriate for proving TIOA specification properties.
Adaptive modem connection lifetimes
Authors: Fred Douglis, Tom Killian
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

Internet Service Providers sometimes go to great lengths to minimize dial-up connection times, in order to make the best use of limited resources. Typically they disconnect users after a fixed period of complete inactivity, such as 10-15 minutes. We propose adaptive time-out policies that take past history into account, and we evaluate some of these policies using a trace from a production environment. We find that adaptive policies can reduce cumulative connection times and average simultaneous usage by about 10-20% compared to a conservative fixed threshold, in exchange for a moderate increase in the number of disconnections that inconvenience the user.