ppxscal/embedding_network huggingface dataset:
Maximum-likelihood motion estimation of a human face
Authors: G. Matrinez
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

An algorithm for estimating the three-dimensional motion of a human face from a monocular image sequence is investigated. For motion estimation, the shape of a human face is described by a three-dimensional rigid triangular mesh and its motion by six parameters: one three-dimensional translation vector and three rotation angles. The motion parameters are estimated by maximizing the conditional probability of the frame to frame intensity differences at observation points. The conditional probability is a function of the motion parameters, the frame to frame intensity differences and the covariance matrix of the intensity error at the observation points. The intensity error is supposed to be the result of the camera noise and the position error attributed to the shape estimation errors and the motion estimation errors occurred by the motion analysis of previous frames. The algorithm was applied to different real image sequences depicting a moving human face with very encouraging results. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Distributed, Real-Time Programming on Commodity POSIX Systems: A Preliminary Report
Authors: Stefan D. Bruda, Petter Haggholm, Scott Stoddard
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

We present an incipient implementation of a programming language that allows programming of real-time applications distributed over a network. We have several goals in mind: First, the language should be built on a sound semantics and offer support for model-based conformance testing. At the same time the language should place the normal programmer (who tends to shy away from exceedingly formal constructs) in a comfortable environment. Thirdly, programs written in this language should run on commodity systems, without relying on real-time support from the kernel. Finally, the language separates the code from timing restrictions, thus allowing for code re-use.
Enabling Run-Time System Verification through Built-In Testing
Authors: Daniel Brenner
Venue: Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques (2006)

Today component-based technologies play an important role in system development. However, although the technologies used to define, implement, and assemble components and systems of components have improved significantly over recent years, verification techniques have not yet caught up. Correctness and reliability of component-based systems are still often checked using traditional testing techniques. These techniques are unable to use the knowledge about the structure of the systems and its components. Therefore, an approach is needed to reduce the effort involved in system testing. Clearly, the best would be to automate large parts of the testing process. Built-in tests - tests that are packaged with components - are a good basis for such an approach.
Grooming of Multicast Sessions in Sparse Splitting WDM Mesh Networks using Virtual Source Based Trees
Authors: N. Sreenath, Balaji Palanisamy, S. R. Nadarajan
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the opticalelectronic- optical (O/E/O) conversion. We study the problem of assigning routes and wavelengths to the multicast sessions with the objective of minimizing the resources required for electronic copying. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom. The performance of the proposed heuristic is studied and compared through extensive simulation experiments.
A churn and mobility resistant approach for DHTs
Authors: Olaf Landsiedel, Stefan Götz, Klaus Wehrle
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

Mobile ad-hoc networks (MANETs) and distributed hash-tables (DHTs) share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc network. The mobile hash-table (MHT) [9] addresses this challenge by mapping a data item to a path through the environment. In contrast to existing DHTs, MHT does not to maintain routing tables and thereby can be used in networks with highly dynamic topologies. Thus, in mobile environments it stores data items with low maintenance overhead on the moving nodes and allows the MHT to scale up to several ten thousands of nodes.This paper addresses the problem of churn in mobile hash tables. Similar to Internet based peer-to-peer systems a deployed mobile hash table suffers from suddenly leaving nodes and the need to recover lost data items. We evaluate how redundancy and recovery technique used in the internet domain can be deployed in the mobile hash table. Furthermore, we show that these redundancy techniques can greatly benefit from the local broadcast properties of typical mobile ad-hoc networks.
Determination of the "best" system that meets a limit standard
Authors: Roy R. Creasey,  Jr., K. Preston White,  Jr., Melanie B. Marks, Bennie D. Waller
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes on-going research, where we compare, via simulation experiments, a stochastic system to a standard. We are particularly interested in a subset of standards we call limit standards. A limit standard is a maximum or minimum benchmark derived from requirements, another model, or the actual system. The problem is to determine if a system meets the limit standard at customer-defined probabilities. Then, for those systems that meet the limit standard, identify which system is the "best," or results in the lowest probability of reaching the standard. Current comparison methods are based on expected value and cannot solve this type of problem. We outline a two-step approach, using methods from acceptance sampling and ordered statistics, to solve this problem.
Finding the optimal production control policy using the production control framework
Authors: Sean M. Gahagan, Jeffrey W. Herrmann
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The production control policy affects the performance of a manufacturing system. Evaluating a production control policy usually requires simulation modeling due to the complex interactions that occur. This paper introduces a technique that optimizes production control of single product flow shops under hybrid production control by using the Production Control Framework. This simulation modeling template is designed to explore the production control domain. The paper demonstrates how this template can be used in conjunction with existing simulation optimization software to find an optimal production control policy. The decision variables are location of the push-pull interface and the number of kanbans at each workstation. The objectives include improving customer service and reducing work-in-process inventory.
An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems
Authors: Detong Zhu
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we propose a new affine scaling trust-region algorithm in association with nonmonotonic interior backtracking line search technique for solving nonlinear equality systems subject to bounds on variables. The trust-region subproblem is defined by minimizing a squared Euclidean norm of linear model adding the augmented quadratic affine scaling term subject only to an ellipsoidal constraint. By using both trust-region strategy and interior backtracking line search technique, each iterate switches to backtracking step generated by the general trust-region subproblem and satisfies strict interior point feasibility by line search backtracking technique. The global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion should bring about speeding up the convergence progress in some ill-conditioned cases. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.
Making a difference: exploiting the full potential of instructionally designed on-screen videos
Authors: Anna Ertelt, Alexander Renkl, Hans Spada
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

On-screen videos are a potentially powerful learning tool. However, their success depends on their instructional design. Videos allow the real-time demonstration of solution procedures and can yield fast and effective learning. Nonetheless, learning outcomes often cannot be maintained in the medium term. In order to foster deep and meaningful processing and thereby foster sustainable learning, the single actions of the solution process were segmented into small steps using labels (labeling) to indicate the learning content and/or an interactive push button (pacing) emphasizing the key feature of each step. 101 university students took part in this study. They examined an unknown computer application with on-screen videos. The results showed a clear advantage of videos with respect to declarative and procedural knowledge in comparison to a standard introduction of the computer application. Videos with labeling and without pacing supported the acquisition of declarative knowledge, whereas videos with pacing improved procedural knowledge.
Improving Recognition of Novel Input with Similarity
Authors: Jerod J. Weinman, Erik Learned-Miller
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Many sources of information relevant to computer vision and machine learning tasks are often underused. One example is the similarity between the elements from a novel source, such as a speaker, writer, or printed font. By comparing instances emitted by a source, we help ensure that similar instances are given the same label. Previous approaches have clustered instances prior to recognition. We propose a probabilistic framework that unifies similarity with prior identity and contextual information. By fusing information sources in a single model, we eliminate unrecoverable errors that result from processing the information in separate stages and improve overall accuracy. The framework also naturally integrates dissimilarity information, which has previously been ignored. We demonstrate with an application in printed character recognition from images of signs in natural scenes.
Design and Implementation of a Cross-Media Indexing System for the Reveal-This System
Authors: Murat Yakici, Fabio Crestani
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Despite the vast growth of heterogeneous, multimedia and increasingly multi-lingual digital content, there is a lack of integrated technology that facilitates its effective usage. The need is being expressed insistently by end-users, and professionals in content business, particularly, with respect to the re-use and re-purposing of multimedia content. The EU-IST Reveal-This (R-T) project addresses this fundamental need aiming at developing an umbrella technology able to provide retrieval, categorisation, summarisation and translation functionalities that will help users keep up with the explosion of digital content. The system is being developed to cope with digital content that is scattered over different platforms, different languages and different types of media. In order to effectively achieve this vision, the project sets the following two key technical and scientific objectives: 1) benefit from cross-media analysis and indexing techniques and 2) develop representations suitable for cross-media and language technologies that can extend the potential of content push and pull technologies. Research carried out in the project attempts to address all these issues. Inline with the objectives and central to the project, we propose an architectural unit called Cross-Media Indexing Component (CMIC) which constitutes the final layer of the Cross-Media Analysis and Indexing Subsystem. It is employed to cross analyse and leverage the individual potential of each indexing information generated by the analyzers of diverse modalities. In this paper, we focus on CMIC's role and its support for retrieval. The indexing and evaluation approaches are presented together with the status of work in progress.
Speaker-independent 3D face synthesis driven by speech and text
Authors: Arman Savran, Levent M. Arslan, Lale Akarun
Venue: Signal Processing (2006)

In this study, a complete system that generates visual speech by synthesizing 3D face points has been implemented. The estimated face points drive MPEG-4 facial animation. This system is speaker independent and can be driven by audio or both audio and text. The synthesis of visual speech was realized by a codebook-based technique, which is trained with audio-visual data from a speaker. An audio-visual speech data set in Turkish language was created using a 3D facial motion capture system that was developed for this study. The performance of this method was evaluated in three categories. First, audio-driven results were reported, and compared with the time-delayed neural network (TDNN) and recurrent neural network (RNN) algorithms, which are popular in speech-processing field. It was found out that TDNN performs best and RNN performs worst for this data set. Second, results for the codebook-based method after incorporating text information were given. It was seen that text information together with the audio improves the synthesis performance significantly. For many applications, the donor speaker for the audio-visual data will not be available to provide audio data for synthesis. Therefore, we designed a speaker-independent version of this codebook technique. The results of speaker-independent synthesis are important, because there are no comparative results reported for speech input from other speakers to animate the face model. It was observed that although there is small degradation in the trajectory correlation (0.71-0.67) with respect to speaker-dependent synthesis, the performance results are quite satisfactory. Thus, the resulting system is capable of animating faces realistically from input speech of any Turkish speaker.
CROWN-ST: A Security and Trustworthiness Architecture for CROWN
Authors: Qin Li, Jianxin Li, Jinpeng Huai, Xingang Liu, Chunming Hu
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

CROWN is a service-oriented grid computing middleware enabling resources integration in multiple heterogeneous domains and establishing dynamic cooperative relationship among researchers nationwide and worldwide. However, several security challenges should be addressed in CROWN due to the heterogeneous distribution of resources and the dynamic collaborations and resource sharing. In this paper, we present a security and trustworthiness architecture, CROWN-ST, for CROWN. The aim of this architecture is to provide a fine-grained and extensible framework for security and trustworthiness that enables employing distributed access control and dynamic trust establishment among service providers and consumers in a Grid environment. Based on this open and flexible architecture, a series of fundamental services which consist of secure communication, authentication, access control, credential federation, trust management and negotiation are implemented. Finally, comprehensive experimental studies are conducted to demonstrate the feasibility and performance of current CROWN-ST implementation.
A study on the effects of the neutral inductor on the modeling and performance of a four-wire three-phase/switch/level fixed-frequency rectifier
Authors: Hadi Youssef Kanaan, Kamal Al-Haddad, Farhat Fnaiech
Venue: Mathematics and Computers in Simulation (2006)

This paper presents a performance evaluation of three-phase, three-switch, three-level, fixed-frequency pulse-width-modulated (PWM) rectifier, when an inductive connection is added between the DC-side capacitive mid-point and the AC-side source neutral. A new continuous-mode model that takes into account the presence of the added zero-sequence inductor is developed using the state-state averaging technique in the synchronous frame. The stability and the performance of the converter in terms of input current Total Harmonic Distortion (THD), power factor and DC voltage regulation are investigated, even for operation under unbalanced DC loads. The converter characteristics are evaluated for different values of the zero-sequence inductor in an attempt to derive useful optimized criteria for the design of the converter. The proposed study is supported by numerical simulations that are carried out a switching-functions-based model of the converter.
Design and Implementation of the PLC Control Lab Using GSM System
Authors: Ping-Huang Wu, Chin-Hwa Kuo, Chin-Chung Lin, Pei-Lin Wu
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

It has become a trend to integrate automatic industries via Internet and wireless applications over network. Along with the advancement of technology development, research on wireless applications and remote control has become significant and popular today. Thus, we have designed and implemented a teaching platform with wireless applications and remote control using GSM system in the Mobile-PLC (M-PLC) control lab. The integration of the mobile control and measurement using the GSM Short Message Service (SMS) provides a teaching platform where students can learn anytime and anywhere. We can monitor machine operations using GSM system. The usability and economy of teaching media is apt, since cell phones are cheap, easy to operate and portable.
Detection of Scale Intervals in Digital Images
Authors: Kazuaki UEDA, Takashi BABA, Yuji NAKAGAWA, Kaname AMANO
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

If an image includes a ruler and some objects, we can estimate the size of the objects manually. In order to achieve a more accurate result, we developed a method for detecting scale intervals on the ruler. In our method, we transfer the digital image into a frequency domain by using Discrete Fourier Transform (DFT) so that a specific frequency appears. This requires that the image has a cyclic pattern such as the scale on a ruler. We can subsequently calculate the scale interval from the detected frequency.
GNeurAge: An Evolutionary Agent-Based System for Classification Tasks
Authors: Diogo F. Oliveira, Anne Canuto, Andre Campos
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

The use of intelligent agents in the structure of multiclassifier systems has been investigated in order to overcome some drawbacks of these systems and, as a consequence, to improve the performance of such systems. As a result of this, the NeurAge system was proposed. This system has presented good results in some centralized and distributed classification tasks. In this paper, an investigation of using evolutionary techniques in the functioning of the NeurAge (GNeurAge) is performed. In order to do this, we are going to use genetic algorithm in two different phases: in the choice of the initial classifier; and during the functioning of NeurAge (test phase).
A Modeling Paradigm for Integrated Modular Avionics Design
Authors: Abdoulaye Gamati, Christian Brunette, Romain Delamare, Thierry Gautier, Jean-Pierre Talpin
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

This paper presents the modeling paradigm for Integrated Modular Avionics Design MIMAD V0, which is an extensible component-oriented framework that enables high level models of systems designed on integrated modular avionics architectures. MIMAD relies on the Generic Modeling Environment (GME), a configurable object-oriented toolkit that supports the creation of domain-specific modeling and program synthesis environments. MIMAD is built upon a library of components within the POLYCHRONY platform, dedicated to the design of avionic applications. Its descriptions can be therefore transformed into POLYCHRONY's models in order to access the available formal tools and techniques for validation. Users do not need to be experts of formal methods (in particular, of the synchronous approach) to be able to manipulate the proposed concepts. This contributes to satisfying the present industrial demand on the use of general-purpose modeling formalisms for system design.
A performance evaluation of distributed dynamic channel allocation protocols for mobile networks: Research Articles
Authors: Azzedine Boukerche, Khalil El-Khatib, Tingxue Huang
Venue: Wireless Communications Mobile Computing (2007)

Technological advances coupled with the proliferation of wireless devices among mobile users require efficient resource management and reuse of the scare radio spectrum allocated to wireless and mobile communication systems. Several channel allocation protocols based on a mutual exclusion paradigm have been developed. However, very little data have been reported to compare these protocols. In this paper, we review four of the best known distributed dynamic channel and resource allocation algorithms based on the mutual exclusion paradigm. While the first three channel alloctaion protocols (Cao et al., Choy et al. and Prakash et al.) are based on the co-channel interference, the fourth protocol, which is known as DDRA, adopts the co-group interference approach. We present an extensive set of simulation experiments to evaluate and compare the performance of these four protocols using realistic scenarios. Our results indicate clearly that DDRA algorithm has shown the shortest response time and highest blocking rate among all of the four channel allocation protocols. Cao et al. algorithm exhibits a better blocking rate when compared to the three other schemes. This is due to the fact that it reuses communication channels optimally. Last, but not least, we discuss the basic fault tolerant machanisms that can be used to enhance further these protocols while dealing with the base stations, mobile hosts, or links' failure. Copyright &copy; 2006 John Wiley & Sons, Ltd.