ppxscal/embedding_network huggingface dataset:
A unified framework of HMM adaptation with joint compensation of additive and convolutive distortions
Authors: Jinyu Li, Li Deng, Dong Yu, Yifan Gong, Alex Acero
Venue: Computer Speech and Language (2009)

In this paper, we present our recent development of a model-domain environment robust adaptation algorithm, which demonstrates high performance in the standard Aurora 2 speech recognition task. The algorithm consists of two main steps. First, the noise and channel parameters are estimated using multi-sources of information including a nonlinear environment-distortion model in the cepstral domain, the posterior probabilities of all the Gaussians in speech recognizer, and truncated vector Taylor series (VTS) approximation. Second, the estimated noise and channel parameters are used to adapt the static and dynamic portions (delta and delta-delta) of the HMM means and variances. This two-step algorithm enables joint compensation of both additive and convolutive distortions (JAC). The hallmark of our new approach is the use of a nonlinear, phase-sensitive model of acoustic distortion that captures phase asynchrony between clean speech and the mixing noise. In the experimental evaluation using the standard Aurora 2 task, the proposed Phase-JAC/VTS algorithm achieves 93.32% word accuracy using the clean-trained complex HMM backend as the baseline system for the unsupervised model adaptation. This represents high recognition performance on this task without discriminative training of the HMM system. The experimental results show that the phase term, which was missing in all previous HMM adaptation work, contributes significantly to the achieved high recognition accuracy.
Cost Control in Service Composition Environments
Authors: Jörg Niemöller, Raphaël Quinet, Roman Levenshteyn, Ioannis Fikouras
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper investigates requirements and proposes solutions for charging of composite services. An analysis of the relations between the service user, service broker and service provider with respect to charging suggests that the price a service broker asks from the user of a composite service is in general decoupled from the price the service broker pays to the service providers of the component services used to create the composite service. Cost control mechanisms as part of the service selection are therefore essential for the service broker. This paper proposes a cost control mechanism based on instantaneous service price prediction.
An improved partial Haar dual adaptive filter for rapid identification of a sparse echo channel
Authors: P. Kechichian, B. Champagne
Venue: Signal Processing (2009)

Recently, a coupled echo canceller was proposed that uses two short adaptive filters for sparse echo cancellation. The first filter operates in the partial Haar domain and is used to locate the channel's dispersive region; the second filter is then centered around this location to cancel the echo in the time domain. In this paper, we propose feasible solutions to improve the performance of this partial Haar dual adaptive filter (PHDAF) in practical applications. These include: (1) alleviating the dependence of the PHDAFs performance on the echo-path impulse response's bulk delay; (2) improving the tracking performance of the PHDAF in response to abrupt changes in the echo path; and (3) extending the original PHDAF structure to support the cancellation of multiple echoes. The proposed algorithmic solutions exploit the Haar transform's polyphase representation and make use of a novel peak tendency estimator (PTE) based on Dezert-Smarandache theory (DSmT). The improved PHDAF is evaluated in terms of its mean-square error (MSE) curves and its mean time to properly locate a dispersive region for different SNRs. Results show that enhanced performance can be obtained using the proposed solutions at a minimal increase in computational cost.
A Bayesian Approach for Estimating and Replacing Missing Categorical Data
Authors: Xiao-Bai Li
Venue: Journal of Data and Information Quality (JDIQ) (2009)

We propose a new approach for estimating and replacing missing categorical data. With this approach, the posterior probabilities of a missing attribute value belonging to a certain category are estimated using the simple Bayes method. Two alternative methods for replacing the missing value are proposed: The first replaces the missing value with the value having the estimated maximum probability; the second uses a value that is selected with probability proportional to the estimated posterior distribution. The effectiveness of the proposed approach is evaluated based on some important data quality measures for data warehousing and data mining. The results of the experimental study demonstrate the effectiveness of the proposed approach.
A class of random fuzzy programming and its application to supply chain design
Authors: Jiuping Xu, Yanan He, Mistsuo Gen
Venue: Computers and Industrial Engineering (2009)

Supply chain design problems have recently raised a lot of interest since the opportunity of an integrated management of the supply chain can reduce the propagation of undesirable events through the network and can affect decisively the profitability of the members. Often uncertainties may be associated with demand, supply or various relevant costs. In most of the existing models uncertainties are treated as randomness and are handled by appealing to probability theory. However, in certain situations uncertainties are due to random fuzziness and in these case the random fuzzy programming is applicable, while no attempt has been made to define those uncertain parameters as random fuzzy variables. We propose a random fuzzy programming model and a methodology for solving a multi-stage supply chain design problem of a realistic scale in the random fuzzy environment. Based on the concept of random fuzzy variable, we use probability theory, fuzzy set theory and optimizing theory as our research tool. At a given possibility @a, we provide an auxiliary programming model of the random fuzzy programming and convert it to a deterministic mixed 0-1 integer programming model, of which the optimal solutions are proved to exist. Then we present a novel technique called spanning-tree based on genetic algorithm (st-GA) to get the heuristic solutions. A computational example involving a relatively large supply chain is presented to highlight the significance of the random fuzzy model as well as the effectiveness of the proposed solution method. Random fuzzy variable is a very useful tool to describe the uncertain parameters and our methodology may be applied to any optimization problems with random fuzzy factors.
An efficient computational procedure for determining the container-loading pattern
Authors: Chen-Fu Chien, Chia-Yen Lee, Yi-Chao Huang, Wen-Ting Wu
Venue: Computers and Industrial Engineering (2009)

Supply chain and global logistics are driven by strategically focusing on core competences, outsourcing manufacturing to pursue higher value proposition in the supply chain, radically improving the return of capital investments and providing total solutions to targeted customers. The container-loading research has important industrial and commercial application for global logistics. In practice, loading pooled shipment into containers is a complex procedure that has relied largely on the workers' experience. We developed an efficient computational procedure involving three-dimensional cutting for determining near-optimal container-loading patterns to minimize the waste of container space. We used numerical examples from a motor company that imports key components from Japan, produces parts in Taiwan, and assembles cars in China to estimate its validity and discussed the effectiveness of the proposed solution. This study concludes with a discussion of future research.
fP2P-HN: A P2P-based route optimization architecture for mobile IP-based community networks
Authors: Ruben Cuevas, Albert Cabellos-Aparicio, Angel Cuevas, Jordi Domingo-Pascual, Arturo Azcorra
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Wireless technologies are rapidly evolving and the users are demanding the possibility of changing their point of attachment to the Internet (i.e. Access Routers) without breaking the IP communications. This can be achieved by using Mobile IP or NEMO. However, mobile clients must forward their data packets through its Home Agent (HA) to communicate with its peers. This sub-optimal route (lack of route optimization) considerably reduces the communications performance, increases the delay and the infrastructure load. In this paper, we present fP2P-HN, a Peer-to-Peer-based architecture that allows deploying several HAs throughout the Internet. With this architecture, a Mobile Node (MN) or a Mobile Community Network (i.e. a NEMO) can select a closer HA to its topological position in order to reduce the delay of the paths towards its peers. fP2P-HN uses a Peer-to-Peer network to signal the location of the different HAs. Additionally, it uses flexible HAs that significantly reduce the amount of packets processed by the HA itself. The main advantages of the fP2P-HN over the existing ones are that it is scalable, it reduces the communications delay and the load at the HAs. Since one of the main concerns in mobility is security, our solution provides authentication between the HAs and the MNs. We evaluate the performance of the fP2P-HN by simulation. Our results show that the fP2P-HN is scalable since the amount of signalling messages per HA does not increase, even if the number of deployed HAs increases. We also show that the average reduction of the communication's delay compared to Mobile IP/NEMO is 23% (with a minimum deployment) and the reduction of the load at the HA is at least 54%.
Complexity Analysis of Pipeline Mapping Problems in Distributed Heterogeneous Networks
Authors: Yi Gu, Qishi Wu, Mengxia Zhu, Nageswara S. V. Rao
Venue: International Journal of Distributed Sensor Networks (2009)

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: interactive applications where a single dataset is sequentially processed along a pipeline; and streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: Minimum Endtoend Delay with No Node Reuse (MEDNNR), Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, “contiguous node reuse” means that multiple contiguous modules along the pipeline may run on the same node and “arbitrary node reuse” imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.
ON MODELINGModels of models
Authors: Hugh Dubberly
Venue: interactions (2009)

Editor's note: This forum presents models relevant to interaction design and service design. It describes the models, how they might be used, and why they matter. It also describes the models' origins and contrasts related models.In its first year, forum articles described models of innovation process, design process (Analysis-Synthesis Bridge), customer experience cycle, learning in design and product development, the trend from a mechanical to a biological frame in design (era analysis), design research types (map), and interaction types (taxonomy).However, none of the articles presented a model of models. We correct that oversight here.
The Complete Idiot's Guide to Creating a Website, Pap/Cdr edition
Authors: Paul McFedries
Venue:  (2008)

The essential guide for getting the internet traffic every smallbusiness owner needs. CD included. Todays small-business websites require advanced features that visitors expect: streaming video and audio; e-commerce; custom surveys, forms, and polls; and discussion groups. This book covers all the basics of creating and publicizing a successful webpage. Free CD includes JavaScript and numerous templates Everything from design and publishing the site to automating and publicizing It 100 million websites as of 2006and it keeps on growing Simple and easy how-to for small businesses and organizations that cant afford a professional web designer
Auto-Wigner-Ville distribution via non-adaptive and adaptive signal decomposition
Authors: S. Ghofrani, D. C. McLernon
Venue: Signal Processing (2009)

In this work we derive general formulae for the first and the second conditional spectral moments, as well as the conditional spectral variance, according to the auto-Wigner-Ville distribution. We show that for any signal decomposition method, the first conditional spectral moment obtained via the auto-Wigner-Ville distribution is now exactly the weighted average instantaneous frequency of the decomposed signal and that it is also always real-valued. In addition, for many bilinear distributions there is no guarantee that the second conditional spectral moment (and therefore the conditional spectral variance) are always positive. We also show for any signal decomposition method based on any time-frequency elementary function with Gaussian envelopes and arbitrary polynomial phase, the above constraints are always satisfied. Although we use just two decomposition methods to verify our claim, Gabor and matching pursuit (MP), the derived expressions are true for any signal decomposition method. The auto-Wigner-Ville representation of the two different decomposition methods are examined together in addition to the original Wigner-Ville distribution with respect to: (i) concentration/resolution, (ii) noise reduction capabilities due to additive noise, and (iii) frequency and time resolvability.
Shape homeostasis in virtual embryos
Authors: Tim Andersen, Richard Newman, Tim Otter
Venue: Artificial Life (2009)

We have constructed a computational platform suitable for examining emergence of shape homeostasis in simple three-dimensional cellular systems. An embryo phenotype results from a developmental process starting with a single cell and its genome. When coupled to an evolutionary search, this platform can evolve embryos with particular stable shapes and high capacity for self-repair, even though repair is not genetically encoded or part of the fitness criteria. With respect to the genome, embryo shape and self-repair are emergent properties that arise from complex interactions among cells and cellular components via signaling and gene regulatory networks, during development or during repair. This report analyzes these networks and the underlying mechanisms that control embryo growth, organization, stability, and robustness to injury.
Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat
Venue: OZCHI; Vol. 287 (2008)

It is my privilege to welcome you to this most tropical OZCHI conference, to celebrate with you 20 years of conferences and to thank you for traveling so far to do so. I chose our theme to recognise how interactions are critically defined by, as much as defining of, life-experiences in varied settings. A theme resonating with locating OZCHI08 in a place that, I hope, will invoke reflection on the opportunities and responsibilities that designing for cultural, social and ecological diversity brings. Welcome to the Proceedings of the Australasian Conference on Computer-Human Interaction. OZCHI is Australia and New Zealand's leading forum for work in all areas of human-computer interaction. As the annual conference for the Computer-Human Interaction Special Interest Group (CHISIG) of the Human Factors and Ergonomics Society of Australia (HFESA), OZCHI attracts an international community of researchers and practitioners with a wide range of interests, including usability, information architecture, interaction design, human factors and ergonomics, humancomputer interaction, information systems, software engineering, artificial intelligence, design, social sciences and management. This year's conference attracted 57 long papers, 61 short papers and 4 case studies as submissions. From these papers we accepted 28 long papers, 31 short papers and 1 case study for inclusion at the conference and in the proceedings. We also accepted 6 demos - 4 were reviewed and 2 were invited. These proceedings can be cited as: Vetere, F., Graham, C. & Satchell, C. (2008). Proceedings of the 20th Australasian Conference on Computer-Human Interaction (OZCHI'08) --- Designing for Habitat and Habitus, Cairns, Australia, 8-12 December 2008. ISBN 0-9803063-4-5. 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
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Authors: Jingu Kim, Haesun Park
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer class discovery. The mathematical formulation for NMF appears as a non-convex optimization problem, and various types of algorithms have been devised to solve the problem. The alternating nonnegative least squares (ANLS) framework is a block coordinate descent approach for solving NMF, which was recently shown to be theoretically sound and empirically efficient. In this paper, we present a novel algorithm for NMF based on the ANLS framework. Our new algorithm builds upon the block principal pivoting method for the nonnegativity constrained least squares problem that overcomes some limitations of active set methods. We introduce ideas to efficiently extend the block principal pivoting method within the context of NMF computation. Our algorithm inherits the convergence theory of the ANLS framework and can easily be extended to other constrained NMF formulations. Comparisons of algorithms using datasets that are from real life applications as well as those artificially generated show that the proposed new algorithm outperforms existing ones in computational speed.
Bilinear-pairing-based remote user authentication schemes using smart cards
Authors: Al-Sakib Khan Pathan, Choong Seon Hong
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper presents a detailed review of remote user authentication schemes with smart cards based on bilinear pairings. The first scheme regarding this was proposed by Manik et al. in 2006, which had been modified and improved later in several ways. Here, we analyze all the related proposed schemes, point out their weaknesses and flaws, and note down the sequence of improvements. After reviewing all the relevant schemes, we propose our scheme which is designed in such a way that it could ensure all sorts of facilities needed for remote user authentication procedure and could resist all types of known attacks. We present detailed validation, security, and performance analysis to prove the efficiency of our scheme.
How Many Test Vectors We Need to Detect a Bridging Fault?
Authors: Michele Favalli, Marcello Dalpasso
Venue: Journal of Electronic Testing: Theory and Applications (2009)

The growing dispersion of ICs' parameters poses relevant uncertainties on gate output conductances and logic thresholds which play a main role in bridging fault detection. In this evolving context, the quality of fault simulation and test generation tools making use of nominal parameters should be verified. To analyze this problem we have studied bridging fault detection in combinational ICs in the presence of growing variations of IC's parameters. Results show that a single test is not sufficient to ensure acceptable escape probabilities. Conversely, the minimal number of test vectors required to provide a null escape probability is upper bounded with respect to variations in the standard deviation of IC's parameters. This result has been verified by means of Monte Carlo electrical level simulation. We propose a method to derive these minimal test sets in the case of low frequency tests. A fault simulator and a test generator have been developed supporting the search of minimal test sets targeting a null escape probability. These tools have been applied to a set of combinational benchmarks.
Computational object recognition: a biologically motivated approach
Authors: Tim C. Kietzmann, Sascha Lange, Martin Riedmiller
Venue: Biological Cybernetics (2009)

We propose a conceptual framework for artificial object recognition systems based on findings from neurophysiological and neuropsychological research on the visual system in primate cortex. We identify some essential questions, which have to be addressed in the course of designing object recognition systems. As answers, we review some major aspects of biological object recognition, which are then translated into the technical field of computer vision. The key suggestions are the use of incremental and view-based approaches together with the ability of online feature selection and the interconnection of object-views to form an overall object representation. The effectiveness of the computational approach is estimated by testing a possible realization in various tasks and conditions explicitly designed to allow for a direct comparison with the biological counterpart. The results exhibit excellent performance with regard to recognition accuracy, the creation of sparse models and the selection of appropriate features.