ppxscal/embedding_network huggingface dataset:
Adaptive QoS Resource Management in Dynamic Environments
Authors: Saurav Chatterjee, Michael Brown
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

As greater numbers of end users run both multimedia applications and traditional desktop applications (word processing, spreadsheets, etc.) on the same distributed system (e.g., an office intranet or the Internet), the issue of how to provide adaptive quality of service (QoS) in a highly dynamic, shared, and heterogeneous resource environment becomes very important. While Java is an elegant solution to the heterogeneity problem, it lacks adaptive QoS support, which is critical to multimedia and other real-time applications. Our ERDoS (End-to-End Resource Management of Distributed Systems) project presents solutions to the adaptation problem. We will demonstrate our innovative content-based adaptation algorithm, embedded within the Java Virtual Machine (JVM) using a set of multimedia applications on a laptop computer running Linux.
On the interday homogeneity in the intraday rate of trading
Authors: Chad R. Bhatti
Venue: Mathematics and Computers in Simulation (2009)

In this paper we perform a computationally intensive empirical investigation of interday homogeneity in the intraday rate of trading for six NYSE-traded stocks. For each of these six stocks, we test the homogeneity of the kth trading day to the remainder of the sample using a likelihood ratio test for each of the forty trading days in the sample. At the &alpha;=0.01 level, we find that about one-half of all trading days considered are homogeneous to the remainder of the sample, although this proportion varies across individual samples.
A new method based on extension theory for partial discharge pattern recognition
Authors: Hung-Cheng Chen, Feng-Chang Gu, Chun-Yao Lee
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

This paper proposes a new partial discharge (PD) pattern recognition method base on the extension theory. First, five types of defect models are well-designed on the base of investigation of many power equipment failures. A commercial PD detector is used to measure the three-dimension (3D) PD patterns, then two fractal features (fractal dimension and lacunarity) and mean discharges of phase windows are extracted from the raw 3D PD patterns. Second, the matter-element models of the PD defect types are built according to the PD features derived from practical experimental results. The PD defect type can be directly identified by correlation degrees between the tested pattern and the matter-element models. To demonstrate the effectiveness of the proposed method, comparative studies using a multilayer neural network (MNN) are conducted on 200 sets of field-test PD patterns with rather encouraging results.
Model driven provisioning: bridging the gap between declarative object models and procedural provisioning tools
Authors: Kaoutar El Maghraoui, Alok Meghranjani, Tamar Eilam, Michael Kalantar, Alexander V. Konstantinou
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Today's enterprise data centers support thousands of mission-critical business applications composed of multiple distributed heterogeneous components. Application components exhibit complex dependencies on the configuration of multiple data center network, middleware, and related application resources. Applications are also associated with extended life-cycles, migrating from development to testing, staging and production environments, with frequent roll-backs. Maintaining end-to-end data center operational integrity and quality requires careful planning of (1) application deployment design, (2) resource selection, (3) provisioning operation selection, parameterization and ordering, and (4) provisioning operation execution. Current data center management products are focused on workflow-based automation of the deployment processes. Workflows are of limited value because they hard-code many aspects of the process, and are thus sensitive to topology changes. An emerging and promising class of model-based tools is providing new methods for designing detailed deployment topologies based on a set of requirements and constraints. In this paper we describe an approach to bridging the gap between generated "desired state" models and the elemental procedural provisioning operations supported by data center resources. In our approach, we represent the current and desired state of the data center using object models. We use AI planning to automatically generate workflows that bring the data center from its current state to the desired state. We discuss our optimizations to Partial Order Planning algorithms for the provisioning domain. We validated our approach by developing and integrating a prototype with a state of the art provisioning product. We also present initial results of a performance study.
Mathematical Document Retrieval for Problem Solving
Authors: Sidath Harshanath Samarasinghe, Siu Cheung Hui
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Solving mathematical problems is both challenging anddifficult for many students. This paper proposes a documentretrieval approach to help solve mathematical problems. Theproposed approach is based on Kohonen’s Self-Organizing Maps for data clustering of similar mathematical documents from a mathematical document database. Based on a user query problem, similar mathematical documents with their associated solutions are retrieved in order to provide hints or solutions on solving the user problem. In this paper, we will discuss the proposed mathematical document retrieval approach. The performance of the proposed approach will also be presented in comparison with other clustering techniques.
Retexturing in the Presence of Complex Illumination and Occlusions
Authors: Julien Pilet, Vincent Lepetit, Pascal Fua
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

We present a non-rigid registration technique that achieves spatial, photometric, and visibility accuracy. It lets us photo-realistically augment 3D deformable surfaces under complex illumination conditions and in spite of severe occlusions. There are many approaches that address some of these issues but very few that simultaneously handle all of them as we do. We use triangulated meshes to model the geometry and introduce explicit visibility maps as well as separate illumination parameters for each mesh vertex. We cast our registration problem in an Expectation Maximization framework that allows robust and fully automated operation. It provides explicit illumination and occlusion models that can be used for rendering purposes.
Assessing Scrum-based software development process measurement from COBIT perspective
Authors: Viljan Mahnic, Natasa Zabkar
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper we present the results of the assessment of Scrum-based software development process measurement using COBIT criteria. At first we present our proposal for the model of the Scrum performance measurement. Then we give a short description of COBIT - a model for IT governance, which is commonly used in the IS auditing environment. After that we present the indicators for selected COBIT processes for system development life cycle and use them as criteria for our assessment. This is followed by the analysis of the assessment results. In the end we propose some adjustments to our model.
Removing Redundancy from Answer Set Programs
Authors: Tomi Janhunen
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In answer set programming, ground programs are used as intermediate representations of logic programs for which answer sets are computed. It is typical that such programs contain many redundant rules--increasing the length of the program unnecessarily. In this article, we address redundancy of rules in answer set programs, and in particular, in program modules that are used as components of programs. To this end, we provide an exact semantical characterization of redundancy and present a translation-based method for detecting redundant rules. A prototype implementation, the modular optimizer (modopt), has been developed in the context of the smodels system. In the experimental part, we study the effects of modular optimization on lengths and run times of programs.
GMSK Demodulator Using Costas Loop for Software-Defined Radio
Authors: Santosh Shah, V. Sinha
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

DSP based implementation of Gaussian Minimum Shift Keying (GMSK) demodulator using Costas loop has been described. The demodulator consists of a Costas loop for carrier recovery, data recovery, and phase detection. For low data rates, we have tested the scheme on a TI’s DSP TMS-320C6713. These are implemented using MATLAB and SIMULINK tools and tested on TI’s DSP using Code Composure Studio (CCS). Carrier has been recovered using a loop of center-frequency locking scheme as in Binary Phase Shift Keying (BPSK) Costas-loop. Demodulator performance for AWGN channel for different data rates is shown. Performance is measured for Bandwidth Time product (BT = 0.3 and 0.5) with data rate between 8 kbps to 256 kbps. Bit synchronization and image coding and decoding are designed according to the need of demodulator. The scheme may find its use in Software-Defined Radio (SDR)applications.
Milestones: Mythical Signals in UML to Analyze and Monitor Progress
Authors: Richard Torbjørn Sanders, Øystein Haugen
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

Many applications are evolving towards Service Oriented Architecture (SOA) with technologies such as Web services. Services can be modeled platform independently through UML2 collaborations in the upcoming UML profile for services, SoaML. We observe an increasing need for validation of services. However, such validation is often based on syntactic descriptions of the services and of their interfaces, which are insufficient to ensure that desired liveness properties are satisfied. In this paper, we present a language construct called "milestone" embedded in UML and define its semantics using mythical signals. We show how this interpretation of milestones can be used for liveness analysis and for runtime monitoring of services. The approach is illustrated with a simple bidding service.
A Modified Kernels-Alternated Error Diffusion Watermarking Algorithm for Halftone Images
Authors: Linna Tang, Jiangqun Ni, Chuntao Wang, Rongyue Zhang
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

Digital Halftoning is the rendition of continues-tone images on two-level displays. A modified kernels-alternated error diffusion (KAEDF) watermarking algorithm for halftone images is presented in this paper, which can achieve relatively large embedding rate with good visual quality and high robustness. With the introduction of threshold modulation in error diffusion, the proposed algorithm greatly eliminates the edge sharpening and noise shaping distortion of the watermarked halftone image due to the conventional error diffusion algorithm. Consequently, more spectral distribution features in DFT domain characterized with the two alternated kernels, i.e., Jarvis and Stucki, are preserved in the resulting watermarked halftone image, which greatly improves the performance of watermark decoding. Instead of the original grey level image, the one generated with the inverse halftone algorithm is utilized to determine the local threshold for blind watermark detection. Extensive simulations are carried out, which demonstrates that the modified KAEDF watermarking algorithm achieves significant improvements in performance of visual quality and watermark decoding rate.
Using Requirements to Define Services for Service-Centric Food Traceability Information Systems
Authors: James Lockerbie, Kristine Karlsen, Michele Puccio, Vito Morreale, Susanna Bonura
Venue: Proceedings of the 2008 International Workshop on Service-Oriented Computing Consequences for Engineering Requirements (2008)

This paper reports empirical research on our requirements processes and methods for engineering service-centric food traceability information systems. We address the need for providing requirements for the service provider and service integrator by developing new structures, architectures and techniques needed to derive services from a requirements specification. Our results are demonstrated by addressing four specific challenges that we currently lack process and method advice for. The paper reports our experiences and concludes with our lessons learned.
A global checkpointing model for error recovery
Authors: Krishna Kant
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The paper proposes a new concept for providing software fault tolerance in concurrent systems. It combines the traditional global-checkpointing mechanism with the recovery-block concept in order to come up with an easily implementable errorrecovery mechanism. This mechanism involves smaller overhead in case of moderate to high process interaction than the schemes considered in the past, which are based upon the idea of local checkpointing. A model for computing the optimum checkpointing interval is also presented. A particular distribution is hypothesized for the coverage of the recovery and the behavior of the model studied in detail for this case.
Research on the MPEG-2 Video Watermarking Scheme Based on Spread Spectrum Technology
Authors: Liang Huang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Digital watermarking is an effective technology for digital products copyright protection and data security maintenance as well as an important branch of information hiding technology. A kind of MPEG-2 video watermarking scheme based on spread spectrum technology is introduced in this paper. First starting with MPEG-2 compressed video standard and then the algorithm principle of video watermarking is given, after video streams are partly decoded, the watermarking information modulated by m sequence is embedded into the direct current coefficients of chroma DCT of video I frame. Because of partly decoding, the computational complexity of complete decoding and recodingis reduced and watermark embedding speed is increased, finally, the concrete video watermarking implementation scheme is proposed from watermark embedding and extraction.
Large vocabulary continuous speech recognition using associative memory and hidden Markov model
Authors: Zöhre Kara Kayikci, Günter Palm
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

We attempted to improve recognition accuracy, avoiding extensive retraining when the vocabulary is changed or extended, by applying a hidden Markov model and neural associative memory based hybrid approach to continuous speech recognition. In this approach hidden Markov models are used for subword-unit recognition such as syllables. For a given subword-unit sequence a network of neural associative memories generates first spoken single words and then the whole sentence. The fault-tolerance property of neural associative memory enables the system to correctly recognize words although they are not perfectly pronounced or run into each other. The approach are evaluated for TIMIT, and for WSJ1 5k and 20k test sets. The obtained results are encouraging.
A faster approximation scheme for timing driven minimum cost layer assignment
Authors: Shiyan Hu, Zhuo Li, Charles J. Alpert
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignment manifests enormous potential in drastically reducing wire delay. This is due the fact that wires on thick metals are much less resistive than those on thin metals. Nevertheless, it is not desired to assign all wires to thick metals and the right strategy is to only use minimal thick-metal routing resources for meeting the timing constraints. This timing driven minimum cost layer assignment problem is NP-Complete, and a fast algorithm with provable approximation bound is highly desired. In this paper, a new fully polynomial time approximation scheme is proposed. It is based on a linear-time dynamic programming algorithm for bounded-cost layer assignment and efficient oracle queries. The proposed algorithm can approximate the optimal layer assignment solution in O(mn2/ε) time within a factor of 1+ε for any ε>0, where n is the tree size and m is the number of routing layers. This significantly improves the previous work. The new algorithm is also highly practical. Our experiments on industrial netlists demonstrate that the new algorithm runs up to 6.5times faster than the optimal dynamic programming with few percent additional wire as guaranteed theoretically. This gives another 2x speedup over the previous work.
Reconcilable differences
Authors: Todd J. Green, Zachary G. Ives, Val Tannen
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

Exact query reformulation using views in positive relational languages is well understood, and has a variety of applications in query optimization and data sharing. Generalizations to larger fragments of the relational algebra (RA) --- specifically, support for the difference operator --- would increase the options available for query reformulation, and also apply to view adaptation (updating a materialized view in response to a modified view definition) and view maintenance. Unfortunately, most questions about queries become undecidable in the presence of difference/negation. We present a novel way of managing this difficulty via an excursion through a non-standard semantics, Z-relations, where tuples are annotated with positive or negative integers. We show that under Z-semantics RA queries have a normal form as a single difference of positive queries and this leads to the decidability of equivalence. In most real-world settings with difference, it is possible to convert the queries to this normal form. We give a sound and complete algorithm that explores all reformulations of an RA query (under Z-semantics) using a set of RA views, finitely bounding the search space with a simple and natural cost model. We investigate related complexity questions, and we also extend our results to queries with built-in predicates. Z-relations are interesting in their own right because they capture updates and data uniformly. However, our algorithm turns out to be sound and complete also for bag semantics, albeit necessarily only for a subclass of RA. This subclass turns out to be quite large and covers generously the applications of interest to us. We also show a subclass of RA where reformulation and evaluation under Z-semantics can be combined with duplicate elimination to obtain the answer under set semantics.
High-Performance Image Annotation and Retrieval for Weakly Labeled Images Using Latent Space Learning
Authors: Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi, Nobuyuki Otsu
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Image annotation and retrieval are among the most promising new internet search technologies and have widespread applications. However, the task is very difficult because of the generic nature of the target images. In this paper, we propose a high speed and high accuracy image annotation and retrieval method for miscellaneous objects and scenes. This method combines the higher-order local auto-correlation (HLAC) features with the probabilistic canonical correlation analysis framework. A distance between images can be defined in the intrinsic feature space for annotation using latent space learning between images and labels. The HLAC features have additive and position invariance properties, which makes them well-suited for images in which the positions and number of objects are arbitrary. The proposed method is shown to be faster and more accurate than previously published methods.
Classification of Similar 3D Objects with Different Types of Features from Multi-view Images
Authors: Hitoshi Niigaki, Kazuhiro Fukui
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper proposes a method for classifying 3D objects with similar appearances using different types of features from multi-view images. We can find this type of task in various practical applications, such as flaw inspection of industrial components, quality checking, ans screening of fruits and vegetables. In this paper, as an example such a concrete task, we will deal with the problem of classifying apples, a task that is difficult even for human vision. To tackle this task, we will introduce the mutual subspace method (MSM)-based methods as a weak classifiers in an ensemble learning framework. In addition, we will consider three types of features: shape, texture and color in the terms of invariants of position and scale, as input vectors of each MSM-based classifier. The effectiveness of the proposed method will be demonstrated through the results of evaluation experiments using 100 apples.
Automatic control system for heating systems in buildings based on measuring the heat exchange through outer surfaces
Authors: Daniel Popescu, Calin Ciufudean
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The article proposes a solution for automatic control of heating systems in buildings through control of the temperatures of outer building's surfaces. Imposed thermal comfort is assured with reduced energy demand. The electrical signal obtained from thermal maps created with the perimeter monitoring system for temperatures of outer building's surfaces, represents the measured signal used to control the heat quantity produced in the heating system. The method of implementation and the working principle of the automatic control system are presented for the heating system of a real building chosen for experiments. The control method accounts for heat losses through the building's envelope, so it is adapted to the global characteristics of the heated building.
Quasi-Developable Mesh Surface Interpolation via Mesh Deformation
Authors: Kai Tang, Ming Chen
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

We present a new algorithm for finding a most "developable" smooth mesh surface to interpolate a given set of arbitrary points or space curves. Inspired by the recent progress in mesh editing that employs the concepts of preserving the Laplacian coordinates and handle-based shape editing, we formulate the interpolation problem as a mesh deformation process that transforms an initial developable mesh surface, such as a planar figure, to a final mesh surface that interpolates the given points and/or curves. During the deformation, the developability of the intermediate mesh is maintained by means of preserving the zero-valued Gaussian curvature on the mesh. To treat the high nonlinearity of the geometric constrains owing to the preservation of Gaussian curvature, we linearize those nonlinear constraints using Taylor expansion and eventually construct a sparse and over-determined linear system which is subsequently solved by a robust least-squares solution. By iteratively performing this procedure, the initial mesh is gradually and smoothly "dragged" to the given points and/or curves. The initial experimental data has shown some promising aspects of the proposed algorithm as a general quasi-developable surface interpolation tool.