ppxscal/embedding_network huggingface dataset:
On System of Generalized Vector Quasi-equilibrium Problems with Set-valued Maps
Authors: Jian-Wen Peng, Heung-Wing Joseph Lee, Xin-Min Yang
Venue: Journal of Global Optimization (2006)

In this paper, we introduce four new types of the system of generalized vector quasi-equilibrium problems with set-valued maps which include system of vector quasi-equilibrium problems, system of vector equilibrium problems, system of variational inequality problems, and vector equilibrium problems in the literature as special cases. We prove the existence of solutions for such kinds of system of generalized vector quasi-equilibrium problems. Consequently, we derive some existence results of a solution for the system of vector quasi-equilibrium problems and the generalized Debreu type equilibrium problem for vector-valued functions.
Efficient Construction of Pipelined Multibit-Trie Router-Tables
Authors: Kun Suk Kim, Sartaj Sahni
Venue: IEEE Transactions on Computers (2007)

Efficient algorithms to construct multibit tries suitable for pipelined router-table applications are developed. We first enhance the 1-phase algorithm of Basu and Narlikar [1], obtaining a 1-phase algorithm that is 2.5 to 3 times as fast. Next, we develop 2--phase algorithms that not only guarantee to minimize the maximum per-stage memory but also guarantee to use the least total memory subject to the former constraint. Our 2-phase algorithms not only generate better pipelined trees than those generated by the 1--phase algorithm, but they also take much less time. A node pull-up scheme that guarantees no increase in maximum per-stage memory as well as a partitioning heuristic that generates pipelined multibit tries requiring less maximum per-stage memory than required by the tries obtained using the 1-phase and 2-phase algorithms are also proposed.
Real-time frequency and 2-D angle estimation with sub-Nyquist spatio-temporal sampling
Authors: M. D. Zoltowski, C. P. Mathews
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

An algorithm is presented for real-time estimation of the frequency and azimuth and elevation angles of each signal incident upon an airborne antenna array system over a very wide frequency band, 2-18 GHz. The algorithm provides unambiguous frequency estimation despite severe temporal undersampling necessitated by cost/complexity of hardware considerations. The algorithm also provides unambiguous azimuth and elevation angle estimation over the entire 2-18 GHz bandwidth despite severe spatial undersampling at the higher end of this bank necessitated by mutual coupling considerations and resolving power requirements at the lower end of the band. Simulation results are presented demonstrating the capabilities of the algorithm.
An adaptive non-linear motion vector resampling algorithm for down-scaling video transcoding
Authors: C.-C. J. Kuo, N. Jayant
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we describe an adaptive non-linear motion vector resampling algorithm for video transcoding where spatial resolution down-scaling is involved. The incoming MPEG-2 video is spatially down-scaled by a factor of two, and transcoded to MPEG-1 video at lower bit rate. Since the heaviest computational load of encoding is the motion estimation process, motion vectors of the original video have to be reused from the bit stream. However, reusing motion vectors with down-scaling is not easy, since the four motion vectors to be down-scaled from original video are usually not well aligned. The motion vector reusing scheme greatly affects the performance of the transcoder since the decoded video quality depends on the performance of motion compensation as well as rate control. The performance of an alternative weighted averaging scheme tends to be degraded by inappropriate motion vectors. Experiments show that a motion vector selection algorithm indeed performs better than a weighted average method. The selection algorithm uses a likelihood score based on the investigation of statistical characteristics of the macroblocks associated with the best matching motion vectors. The motion vector having the highest likelihood score is selected to be reused. The weighted averaging scheme is also applied if there are macroblocks having the same highest scores. The experimental results with various bit rate and sequences show that the proposed algorithm provides improvement of PSNR by 0.2/spl I.utilde/0.7 dB on average and that the computational complexity is not much higher. Therefore, the overall transcoding performance and efficiency can be increased by the proposed algorithm.
Privacy Contracts as an Extension of Privacy Policies
Authors: Hendrik JG Oberholzer, Martin S. Olivier
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Individuals are becoming increasingly concerned regarding the protection of their personal information. In an attempt to ease the privacy concerns of individuals, organisations publish privacy policies, promising how they will handle personal information. However, privacy policies as such do not guarantee the protection of personal information and do not offer much customisation on an individual level. Individual privacy contracts are proposed as a solution to this problem. A privacy contract constitutes a legal base on which to contest privacy breaches, should any occur. Every data subject has to enter into a privacy contract (consisting of privacy agreements) with the data controller, otherwise no transactions can be performed between the two parties. A data subject must consent to a privacy agreement before the data controller can use the data of the transaction associated with the agreement. This paper presents the principles and a conceptual view of the management of privacy contracts.
Centralized and Distributed Multi-view Correspondence
Authors: Shai Avidan, Yael Moses, Yoram Moses
Venue: International Journal of Computer Vision (2007)

A probabilistic algorithm is presented for finding correspondences across multiple images in systems with large numbers of cameras and considerable overlap. The algorithm employs the theory of random graphs to provide an efficient probabilistic algorithm that performs Wide-baseline Stereo (WBS) comparisons on a small number of image pairs, and then propagates correspondence information among the cameras. A concrete mathematical analysis of its performance is given. The algorithm is extended to handle false-positive and false-negative failures of the WBS computations. We characterize the detectability of the existence of such failures, and propose an efficient method for this detection. Based on this, we propose a heuristic method for discarding false matches, and demonstrate its effectiveness in reducing errors.Since in many multi-camera applications cameras are attached to processors that handle local processing and communication, it is natural to consider distributed solutions that make use of the local processors and do not use a central computer. Our algorithm is especially suited to run in a distributed setting. If the local processors are sufficiently powerful, this allows an order of magnitude increase in computational efficiency. More importantly, a distributed implementation provides strong robustness guarantees, and eliminates the existence of a single point of failure that is inherent when the application is coordinated by a central computer. We show how to efficiently overcome processor crashes and communication failures with a minimal reduction in the quality of the algorithm's results.
Flatness Conservation in the n-trailer System Equipped with a Sliding Kingpin Mechanism
Authors: V. Deligiannis, G. Davrazos, S. Manesis, T. Arampatzis
Venue: Journal of Intelligent and Robotic Systems (2006)

Nonlinear systems, which are differentially flat, have several properties that can be useful on designing effective controllers. In this paper we show that the n-trailer system equipped with a sliding kingpin mechanism is a differentially flat system, like its non-sliding kingpin counter part. The sliding kingpin technique is used to eliminate the undesired deviation of the path of each intermediate vehicle from that of the leading one (off-tracking phenomenon). The linearizing outputs of the flat system are the Cartesian coordinates of the middle of the last semi-trailer's axle. The state space and the kinematic equations of the new modified system are derived and the conditions for flatness are examined. The flatness conservation is also checked relatively to several kinds of dynamic sliding feedback control.
Further study of the SDMP method for parameter estimation of multiple transients
Authors: J. B. Evans, Yingbo Hua
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

A variant of the subspace decomposition matrix pencil (SDMP) method for estimating the angles of arrival of multiple transient signals is presented. The transient signals we consider here are modeled as the sum of complex exponentials. The SDMP-variant uses the same approach of the SDMP method to find the temporal poles. Then the SDMP-variant carries out a 1-D search for finding the spatial parameters (d.o.r's). The advantages of the SDMP-variant are (a) that there is no pairing routine required to match the estimated d.o.r's to the signal poles, (b) the noise sensitivity performance is better, and (c) the computation is more efficient. A sensitivity analysis is used to determine the performance, which is supported by simulation.
A Robot as a Teaching Assistant in an English Class
Authors: Zhen-Jia You, Chi-Yuh Shen, Chih-Wei Chang, Baw-Jhiune Liu, Gwo-Dong Chen
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Advancement in robotic research enables robot can assist human in many way. However, few researches have been done on applying on education. This paper reports field trials of using robot in an English learning classroom. In our experiment, the robot plays as a partner of a teacher. Five models of collaboration between teachers and robot are proposed. Teachers design the course flow in advance based on the learning content and these five models. Formative evaluations of the experiments are presented to show the impact of adopting robot in the classroom.
Information Hiding on Lossless Data Compression
Authors: Katsunari Yoshioka, Kotaro Sonoda, Osamu Takizawa, Tsutomu Matsumoto
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

We address a new class of Information hiding on lossless data compression. In our model, secret information is embedded into a compressed data (e.g. ZIP) in a way that the compressed data can still be decompressed by regular decompression process (e.g. UNZIP). The entity with secret key can extract the secret information from the compressed data. In this paper, we formally define the above model of information hiding on lossless data compression. Then, we focus on a particular compression method, namely LZSS, which is adopted in ZIP/LHA. We propose a new method, called IH-LZSS, that controls the trade-off between themaximum embeddable data size and compression rate. Some experimental results are also shown.
Extending WF^2 Q+ to Support a Dynamic Traffic Mix
Authors: Paolo Valente
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

WF^2Q+ is a packet scheduler providing optimal QoS guarantees at a low computational complexity. It allows a fraction of the total link capacity to be reserved to each packet flow to transmit, and it guarantees to each flow the minimum possible deviation with respect to its reserved service over any time interval. WF^2Q+ has been defined assuming that the set of the packet flows to transmit is fixed and known at system design time. Unfortunately, such assumption is widely violated in many systems, such as Web servers or Internet routers. In this paper we propose a general scheme for extending WF^2Q+ to support also the case where the set of packet flows to transmit is unknown beforehand and varies over time. The scheme preserves the service guarantees provided by WF^2Q+, and allows different tradeoffs to be realized between computational complexity and system responsiveness to changing traffic mixes. After investigating the pros and cons of the possible solutions based on such general scheme, we present a simple and efficient algorithm for enabling WF^2Q+ to support a dynamic traffic mix.
The Effect of Gender-Emotion Stereotypes in Communicating Emotion through Affective Agents
Authors: Boon Tan, Theo Kangsanant
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Affective agents are new and emerging technology that enables computer systems to communicate affects and socialize with human. Studies have shown that human interact with affective agents as if they are social actors. Recent researches suggest that affective agents exhibiting greater social presence and message involvement promote emotional communication. This paper examines the influence of gender-emotion stereotypes on user's message involvement and perceived social presence of affective agents. The experimental results suggest that affective agents communicating emotional events that are genderinconsistent exhibit greater social presence and higher user's message involvement.
An Empirical Explanation of the Chubb Illusion
Authors: R. Beau Lotto, Dale Purves
Venue: Journal of Cognitive Neuroscience (2001)

The perceived difference in brightness between elements of a patterned target is diminished when the target is embedded in a similar surround of higher luminance contrast (the Chubb illusion). Here we show that this puzzling effect can be explained by the degree to which imperfect transmittance is likely to have affected the light that reaches the eye. These observations indicate that this 'illusion' is yet another signature of the fundamentally empirical strategy of visual perception, in this case generated by the typical influence of transmittance on inherently ambiguous stimuli.
Integrating network-calculus-based simulation with packet-level simulation for TCP-operated networks
Authors: Hwangnam Kim
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

In this paper, we investigate the issue of integrating packet-level simulation with network-calculus-based simulation for TCP-operated networks in order to simultaneously achieve within one simulation framework the performance gains acquired by the latter and the packet-level details afforded by the former. In such mixed-mode simulation, a foreground flow is simulated at the packet-level while the other background flows are simulated in network-calculus-based simulation. One major challenge in realizing this notion is how to characterize the interaction between packet-level flows and network-calculus-based flows. In this paper, we develop the model of interaction at routers. We then implement mixed-mode simulation in ns-2, and conduct a simulation study to evaluate it in the perspective of efficiency in execution time and error discrepancy in simulation results.The simulation results indicate that mixed-mode simulation is an effective candidate for carrying out large-scale simulation for TCP networks since it makes significant performance improvement while retaining the packet-level details. Specifically, mixed-mode simulation achieves an order of magnitude or more improvement (maximally 20 times) in execution time and the improvement becomes more pronounced as the network size increases. On the other hand, the error discrepancy is within 1-2% of the bottleneck link capacity (e.g., the system throughput).
The design of S-boxes by simulated annealing
Authors: John A. Clark, Jeremy L. Jacob, Susan Stepney
Venue: New Generation Computing (2005)

Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task: several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.
The statistical distribution of the zeros of random paraorthogonal polynomials on the unit circle
Authors: Mihai Stoiciu
Venue: Journal of Approximation Theory (2006)

The orthogonal polynomials on the unit circle are defined by the recurrence relation Φk+1(z) = zΦk(z) - α-kΦk*(z), k ≥ 0, Φ0 = 1, where αk ∈ D for any k ≥ 0. If we consider n complex numbers α0, α1,...,αn-2 ∈ D and αn-1 ∈ ∂D, we can use the previous recurrence relation to define the monic polynomials Φ0, Φ1,...,Φi. The polynomial Φn(z) = Φn (z; α0,...,αn-2, αn-1) obtained in this way is called the paraorthogonal polynomial associated to the coefficients α0, α1,...,αn-1.We take α0, α1,...,αn-2 i.i.d, random variables distributed uniformly in a disk of radius r < 1 and αn-1 another random variable independent of the previous ones and distributed uniformly on the unit circle. For any n we will consider the random paraorthogonal polynomial Φn(z) = Φn(z; α0,...,αn-2, αn-1). The zeros of Φn are n random points on the unit circle.We prove that for any eiθ; ∈ ∂D the distribution of the zeros of Φn in intervals of size O(1/n) near eiθ; is the same as the distribution of n independent random points uniformly distributed on the unit circle (i.e., Poisson). This means that, for large n, there is no local correlation between the zeros of the considered random paraorthogonal polynomials.
Ariadne: a secure on-demand routing protocol for ad hoc networks
Authors: Yih-Chun Hu, Adrian Perrig, David B. Johnson
Venue: Wireless Networks (2005)

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
Power Optimization for Bus on Multimedia SoC
Authors: Ru Yang, Gang Feng, Donghai Li
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Reducing bus power consumption has become one of key issues for low power multimedia SoC design. The power which dissipated on interconnected bus includes the self transition power consumption and the coupled transition power consumption between every two signal lines. This paper, firstly propose an on-chip bus power consumption model. Then a heuristic algorithm is proposed to determine a physical order of signal lines in bus to minimize the power consumption on the interconnected bus. Experimental results show that the proposed heuristic algorithm is effective.
Plans as Products of Learning
Authors: Samin Karim, Budhitama Subagdja, Liz Sonenberg
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper presents motivations and current related work in the field of plan learning. Additionally, two approaches that achieve plan learning are presented. The two presented approaches are centred on the BDI framework of agency and have particular focus on plans, which, alongside goals, are the means to fulfil intentions in most pragmatic and theoretical realisations of the BDI framework. The first approach is a hybrid architecture that combines a BDI plan extractor and executor with a generic low-level learner. The second approach uses hypotheses to suggest incremental refinements of a priori plans. Both approaches achieve plan generation that is a result of experiential learning. We conclude by discussing issues related to these two approaches, and from other related work.
The missing link: dynamic components for ML
Authors: Andreas Rossberg
Venue: ACM SIGPLAN Notices (2006)

Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so far. We present the design and semantics of a simple yet expressive firstclass component system for ML. It provides dynamic linking in a type-safe and type-flexible manner, and allows selective execution in sandboxes. The system is defined solely by reduction to higherorder modules plus an extension with simple module-level dynamics, which we call packages. To represent components outside processes we employ generic pickling. We give a module calculus formalising the semantics of packages and pickling.
Atomic Human Action Segmentation Using a Spatio-Temporal Probabilistic Framework
Authors: Duan-Yu Chen, Sheng-Wen Shih, Hong-Yuan Mark Liao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, a framework for automatic atomic human action segmentation in continuous action sequences is proposed A star figure enclosed by a bounding convex polygon is used to effectively and uniquely represent the extremities of the silhouette of a human body. Thus, human actions are recorded as a sequence of the starJigure 's parameters, which is then used for action modeling. To model human actions in a compact manner while characterizing their spatiotemporal distributions, star $@re parameters are represented by Gaussian mixture models (GMM). Experiments to evaluate the performance of the proposed framework show that it can segment continuous human actions in an eficient and effective manner.
A simulation model of a helicopter ambulance service
Authors: Ersan Gunes, Roberto Szechtman
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We study two different operational scenarios for a regional air ambulance service-company which has bases in northern California. Two of these bases serve the land areas encompassed roughly in a circular area of radius 100 miles centered in Gilroy and Salinas, respectively; with a large part of their coverage areas reachable from either base. The base in Salinas currently operates one helicopter only from Thursday to Monday, whereas the base in Gilroy operates one helicopter 24/7. The company is considering extending the operation of one helicopter to 24/7 for its Salinas base. In this paper we analyze the operational impacts of that extension, and develop a framework that can be applied towards the study of the ambulance assignment problem faced by small operators.