ppxscal/embedding_network huggingface dataset:
Content-Adaptive Robust Image Watermarking with Posterior HMM-Based Detector
Authors: Chuntao Wang, Jiangqun Ni, Rongyue Zhang, Goo-Rak Kwon, Sung-Jea Ko
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Robustness and invisibility are two contrary constraints for robust invisible watermarking. Instead of the conventional strategy with human visual system (HVS) model, this paper presents a content-adaptive approach to further optimize the constraint between them. To reach this target, the entropy-based and integrated HVS (IHVS) based measures are constructed so as to adaptively choose the suitable components for watermark insertion and detection. Such a kind of scheme potentially gives rise to synchronization problem between the encoder and decoder under the framework of blind watermarking, which is then solved by incorporating the repeat-accumulate (RA) code with erasure and error correction. Moreover, a new hidden Markov model (HMM) based detector in wavelet domain is introduced to reduce the computation complexity and is further developed into a posterior one to avoid the transmission of HMM parameters with only a little sacrifice of detection performance. Experimental results show that the proposed algorithm can obtain considerable improvement in robustness performance with the same distortion as the traditional one.
Spectrum Modification for Emotional Speech Synthesis
Authors: Anna Přibilová, Jiří Přibil
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

Emotional state of a speaker is accompanied by physiological changes affecting respiration, phonation, and articulation. These changes are manifested mainly in prosodic patterns of F0, energy, and duration, but also in segmental parameters of speech spectrum. Therefore, our new emotional speech synthesis method is supplemented with spectrum modification. It comprises non-linear frequency scale transformation of speech spectral envelope, filtering for emphasizing low or high frequency range, and controlling of spectral noise by spectral flatness measure according to knowledge of psychological and phonetic research. The proposed spectral modification is combined with linear modification of F0 mean, F0 range, energy, and duration. Speech resynthesis with applied modification that should represent joy, anger and sadness is evaluated by a listening test.
Steering actors through a virtual set employing vibro-tactile feedback
Authors: Björn Wöldecke, Tom Vierjahn, Matthias Flasko, Jens Herder, Christian Geiger
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Actors in virtual studio productions are faced with the challenge that they have to interact with invisible virtual objects because these elements are rendered separately and combined with the real image later in the production process. Virtual sets typically use static virtual elements or animated objects with predefined behavior so that actors can practice their performance and errors can be corrected in the post production. With the demand for inexpensive live recording and interactive TV productions, virtual objects will be dynamically rendered at arbitrary positions that cannot be predicted by the actor. Perceptive aids have to be employed to support a natural interaction with these objects. In our work we study the effect of haptic feedback for a simple form of interaction. Actors are equipped with a custom built haptic belt and get vibro-tactile feedback during a small navigational task (path following). We present a prototype of a wireless vibro-tactile feedback device and a small framework for evaluating haptic feedback in a virtual set environment. Results from an initial pilot study indicate that vibro-tactile feedback is a suitable non-visual aid for interaction that is at least comparable to audio-visual alternatives used in virtual set productions.
Analysis of hp discontinuous Galerkin methods for incompressible two-phase flow
Authors: Yekaterina Epshteyn, Beatrice Rivière
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we prove the convergence of a class of discontinuous Galerkin methods for solving the fully coupled incompressible two-phase flow problem in the non-degenerate case. Estimates in both the mesh size and the polynomial degrees are obtained. Numerical convergence rates confirm the theoretical results.
A real-time prediction procedure of the state of an electrical distribution system
Authors: Stefano D'ottavi, Francesco Muzi, Luigi Passacantando
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

An innovative digital procedure for real-time prediction of the state of an electrical distribution system is described. The method can promptly identify any change in the impedance values of distribution networks. When changes are slow, diagnostic processes will be carried out, whereas when very quick changes occur protection processes will be activated. The diagnostic process can be usefully adopted to schedule effective, economic maintenance. The proposed method is able to detect a number of anomalies, even though this paper is especially targeted at the check of phase-to-phase insulation levels.
Improving the New Product Development Process through ICT Systems in the Aerospace Industry - A Report on Case Study Research
Authors: Raul Brandao, Martin Wynn
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

This paper explores the role of Information and Communication Technology (ICT) systems in the new product development process in the aerospace industry. A literature review and an in-depth case study are used to answer specific research hypothesis, reflecting the suitability of qualitative research methods in this field. The case study employed a detailed questionnaire, interviews and observation to support the literature review. Research findings indicate a strong correlation between ICT systems implementation and business process improvement. This is identified as a clear benefit for engineering/manufacturing aerospace companies.
Attaining High Performance in General-Purpose Computations on Current Graphics Processors
Authors: Francisco D. Igual, Rafael Mayo, Enrique S. Quintana-Ortí
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The increase in performance of the last generations of graphics processors (GPUs) has made this class of hardware a coprocessing platform of remarkable success in certain types of operations. In this paper we evaluate the performance of linear algebra and image processing routines, both on classical and unified GPU architectures and traditional processors (CPUs). From this study, we gain insights on the properties that make an algorithm likely to deliver high performance on a GPU.
Yield-aware hierarchical optimization of large analog integrated circuits
Authors: Guo Yu, Peng Li
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Hierarchical optimization using building circuit block pareto performance models is an efficient and well established approach for optimizing the nominal performances of large analog circuits. However, the extension to yield-aware hierarchical methodology, as dictated by the need for safeguarding chip manufacturability in scaled technologies, is completely nontrivial. We address two fundamental difficulties in achieving such a methodology: yield-aware pareto performance characterization at the building block level and yield-aware system-level optimization problem formulation. It is shown that our approach is not only able to effectively capture the block performance trade-offs at different yield levels, but also correctly formulate the whole system yield and efficiently perform system-level optimization in presence of process variations. Our approach extends the efficiency of hierarchical analog optimization, enjoyed for improving nominal circuit performances, to yield-aware optimization. Our methodology is demonstrated by the hierarchical optimization of a phased locked loop (PLL) consisting of multiple circuit blocks.
A case for application aware channel access in wireless networks
Authors: Ashish Sharma, Elizabeth M. Belding
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

The increasing reliance of users on wireless networks for Internet connectivity has posed two significant challenges for mobile networking research. The first challenge is to provide high quality of service for interactive real-time applications such as VoIP and video conferencing. The second challenge is to reduce the energy consumption of mobile devices and improve battery life. Past research has focused on separately addressing these seemingly conflicting goals in distributed medium access based wireless networks. Contrary to the traditional tiered networking approach, we argue that an application aware approach to medium access and power saving has the potential to significantly improve the performance of real-time applications and conserve battery power on mobile devices. As a proof of concept, we present the design and implementation of Rendezvous - an application aware MAC protocol. Rendezvous uses short term dynamic channel reservations to achieve higher quality of service and increased power saving opportunities for mobile devices running VoIP and real-time video applications. A preliminary evaluation from our testbed implementation reveals promising results, motivating the need and opportunity for future research in the direction of application awareness at lower layers of the networking stack.
Proceedings of the Third Workshop on Dependable Distributed Data Management
Venue: European Conference on Computer Systems (2009)

Relational databases have been for a long time the keystone of information systems' dependability. There is however a growing call for unprecedented levels of scalability that challenges traditional data management architectures, namely, to cope with cloud computing and peer-to-peer systems. A major trend in all such emerging proposals, with a profound impact in dependability, is that large scale distribution is a core assumption in their design. The goal of Workshop on Dependable Distributed Data Management is thus to bring together researchers and practitioners from systems, database and dependability communities to discuss the current state of the art, pending challenges and trends, and novel solutions in the design, implementation and deployment of distributed and dependable data management systems. For the current edition, co-located with the EuroSys 2009 Conference in Nuremberg, Germany, position papers were solicited and selected based on their relevance to the workshop topic, looking forward to a lively and fruitful debate. In the end, nine papers were select in topics ranging from distributed database dependability, manageability, and scalability, to messaging infrastructures, and data management service abstractions. The workshop program is complemented by a talk on the emerging cloud computing paradigm and a discussion panel.
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
Authors: Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter Scheuermann, Isabel F. Cruz
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

This work addresses the problem of processing continuous nearest neighbor (NN) queries for moving objects trajectories when the exact position of a given object at a particular time instant is not known, but is bounded by an uncertainty region. As has already been observed in the literature, the answers to continuous NN-queries in spatio-temporal settings are time parameterized in the sense that the objects in the answer vary over time. Incorporating uncertainty in the model yields additional attributes that affect the semantics of the answer to this type of queries. In this work, we formalize the impact of uncertainty on the answers to the continuous probabilistic NN-queries, provide a compact structure for their representation and efficient algorithms for constructing that structure. We also identify syntactic constructs for several qualitative variants of continuous probabilistic NN-queries for uncertain trajectories and present efficient algorithms for their processing.
A Method to Support Web Evolution by Modeling Static Structure and Dynamic Behavior
Authors: Junhua Wu, Baowen Xu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Software evolution is an important activity in software life cycle. The Web application is very different from traditional software in design and composition. It needs maintained more frequently. So the automatic evolution support is a critical part in Web engineering. This paper uses Markov chain to model Web users’ browser behavior by statistic analysis of Web log. And transition probability is used as weight in model. By it a model of browse centrality is built. Contrasting it with static model of structure centrality we propose an algorithm based on rules about automatic evolution of Web link structure.
On the penalty-projection method for the Navier-Stokes equations with the MAC mesh
Authors: C. Févrière, J. Laminie, P. Poullet, Ph. Angot
Venue: Journal of Computational and Applied Mathematics (2009)

We deal with the time-dependent Navier-Stokes equations (NSE) with Dirichlet boundary conditions on the whole domain or, on a part of the domain and open boundary conditions on the other part. It is shown numerically that combining the penalty-projection method with spatial discretization by the Marker And Cell scheme (MAC) yields reasonably good results for solving the above-mentioned problem. The scheme which has been introduced combines the backward difference formula of second-order (BDF2, namely Gear's scheme) for the temporal approximation, the second-order Richardson extrapolation for the nonlinear term, and the penalty-projection to split the velocity and pressure unknowns. Similarly to the results obtained for other projection methods, we estimate the errors for the velocity and pressure in adequate norms via the energy method.
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
Authors: Rajiv Gandhi, Juli&#x00e1;n Mestre
Venue: Algorithmica (2009)

The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, where vertices represent the storage devices, and edges represent data transfers required between pairs of devices. Each vertex has a non-negative weight, and each edge has a processing time. A vertex completes when all the edges incident on it complete; the constraint is that two edges incident on the same vertex cannot be processed simultaneously. The objective is to minimize the sum of weighted completion times of all vertices. Kim (J. Algorithms 55, 42&#x2013;57, 2005) gave an LP-rounding 3-approximation algorithm when edges have unit processing times. We give a more efficient primal-dual algorithm that achieves the same approximation guarantee. When edges have arbitrary processing times we give a primal-dual 5.83-approximation algorithm. We also study a variant of the open shop scheduling problem. This is a special case of the data migration problem in which the transfer graph is bipartite and the objective is to minimize the sum of completion times of edges. We present a simple algorithm that achieves an approximation ratio of $\sqrt{2}\approx1.414$, thus improving the 1.796-approximation given by Gandhi&#x00a0;et&#x00a0;al. (ACM Trans. Algorithms 2(1), 116&#x2013;129, 2006). We show that the analysis of our algorithm is almost tight.
Mathematical Techniques for Wireless Communication Systems Design and Analysis
Authors: C Tellambura
Venue:  (2007)

This excellent book presents the latest mathematical techniques for the design and analysis of wireless communication systems. It fills a gap in the current literature by presenting alternative frequency domain analysis techniques not previously discussed in one volume. Divided into three parts, this volume will cover subjects ranging from the mathematical preliminaries through to spread spectrum radio networks with packet diversity. It comprehensively and systematically discusses performance analysis techniques for digital communication systems over fading channels and their application in advanced transceiver design. It presents new perspectives on the subject by offering alternative techniques and their applications to advanced transceiver designs such as space-time coding and MIMO systems; focuses on the development of theories essential for planning and designing high capacity broadband wireless communication systems for indoor and outdoor propagation environments; discusses communication theory for fading channels, transmitter and receiver diversity mechanisms; and, provides an effective reference volume for researchers in communications and signal processing fields.
Path planning in image space for autonomous robot navigation in unstructured environments
Authors: Michael W. Otte, Scott G. Richardson, Jane Mulligan, Gregory Grudic
Venue: Journal of Field Robotics (2009)

Path planning systems using graph-search algorithms such as A* usually operate in uniform plan-view occupancy grids. However, the sensors used to construct these grids observe the environment in their own sample space based on sensor type and viewpoint. In this paper we present an image space technique for path planning in unknown unstructured outdoor environments. Our method differs from previous techniques in that we perform path search directly in image space&mdash;the native sensor space of the imaging sensor. After an image space path has been found, it is used for navigation in the real world. By operating at the resolution of the image sensor, image space planning facilitates accurate robot vs. obstacle localization and enables a high degree of movement precision. Our image space planning techniques can potentially be used with many different kinds of sensor data, and we experimentally evaluate the use of stereo disparity and color information. We present an extension to the basic image space planning system called the cylindrical planner that simulates a 2&pi; field of view with a cylindrically shaped occupancy grid. We believe that image space planning is well suited for use in the local subsystem of a hierarchical planner and implement a hybrid hierarchical planner that utilizes the cylindrical planner as a local planning subsystem and a two-dimensional Cartesian planner as the global planning subsystem. All three systems are implemented and experimentally tested on a real robot. We evaluate the failure modes of image space planning and discuss how to avoid them. We find that image space enables precise real-time, near-field planning. &copy; 2009 Wiley Periodicals, Inc.
Large information processing networks: development and operational experience
Authors: Howard Frank, Davis McCarn, Richard Sprague, M. U. Ayres, John Perra, George Feeney, Morton Blanchard
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

By 1980, 70% of all computers may be connected to terminals via extensive communication facilities. Information processing networks will influence nearly every segment of our economy with applications ranging from remote computing to credit verification and electronic funds transfer. The builders of these new networks will be faced with a host of problems such as selecting new devices, vendors, and common carrier offerings and operating systems in environments where multiple component failures are common. This session, whose panelists are experts in the art of making networks work, will address the problems encountered in building and operating large networks.
Note: Upper bounds of degree 3 for the probability of the union of events via linear programming
Authors: Pierangela Veneziani
Venue: Discrete Applied Mathematics (2009)

We consider the problem of generating upper bounds for the probability of the union of events when the individual probabilities of the events as well as the probabilities of pairs and triples of these events are known. By formulating the problem as a Linear Program, we can obtain bounds as objective function values corresponding to dual basic solutions. The upper bounds are based on underlying graph structures.
The effect of color space and wavelet bases in lossy wavelet compression
Authors: Jouni Pääkkönen, Niina Päivinen, Pekka Toivanen
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

In this paper we present how different color spaces and wavelet bases behave in lossy wavelet compression. We used three different wavelet base functions: Haar, Symlets and Biorthogonals. 11 different color spaces were tested. We chose four of the color spaces which were RGB, Ohta, L*u*v and YCbCr. All of these color spaces have different properties and the choice of the color space can alter the results. We aimed to excellent image quality. YCbCr and L*u*v color spaces produced the best results using the simplest wavelet base function Haar.
This Way Up
Authors: Smith, Foulkes
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A.T. Shank & Son have a bad day at the parlour when a falling boulder flattens their hearse. Emotional and literal pitfalls lie in wait for the odd couple as they make their way cross country with just a coffin for company. This short animated caper puts the fun back into funeral as their journey and relationship unravel on an epic scale.
OVSF Code Sharing and Reducing the Code Wastage Capacity in WCDMA
Authors: Davinder S. Saini, Sunil V. Bhooshan
Venue: Wireless Personal Communications: An International Journal (2009)

The non quantized nature of user rate wastes the code capacity in Orthogonal Variable Spreading Factor Codes (OVSF) based Code Division Multiple Access (CDMA) systems. The code sharing scheme in multi code CDMA is proposed to minimize the code rate wastage. The scheme combines the unused (wastage) capacity of already occupied codes to reduce the code blocking problem. Simulation results are presented to show the superiority of the proposed code assignment scheme as compared to existing schemes.
User/system interface within the context of an integrated corporate data base
Authors: Gene Altshuler, Bernard Plagman
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The world to come may be viewed as demanding the making of more decisions per unit time, the taking into account of more variables per decision, and the greater commitment of resources per decision.... At the same time that the environment is pressing for faster decisions, new esoteric technologies are demanding longer planning cycles, earlier and higher commitments of resources, and better integration and coordination of a greater number of interacting elements that make up new systems.