ppxscal/embedding_network huggingface dataset:
Software Aging Prediction Model Based on Fuzzy Wavelet Network with Adaptive Genetic Algorithm
Authors: Meng Hai Ning, Qi Yong, Hou Di, Chen Ying, Zhao Ji Zhong
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

According to the characteristics of the operational behavior and runtime state of application sever, the resource consumption time series are observed and modeled by fuzzy wavelet network (FWN) with fuzzy logic inference and learning capability. The objective is to model the extracted data series of systematic performance parameters to predict software aging in application server. The dimensionality of input variables of FWN is reduced by principal components analysis (PCA), and the structure and parameters of FWN are optimized with adaptive genetic algorithm (GA). Judging by the model, we can get the aging threshold before application server failed and preventively maintenance the application server before systematic parameter value reaches the threshold. The experiments are carried out to validate the efficiency of the proposed model and show that the aging prediction model based on FWN with adaptive genetic algorithm is superior to the neural network (NN) model and wavelet network (WN) model in the aspects of convergence rate and prediction precision.
Discriminative Learning of Mixture of Bayesian Network Classifiers for Sequence Classification
Authors: Minyoung Kim, Vladimir Pavlovic
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

A mixture of Bayesian Network Classifiers(BNC) has a potential to yield superior classification and generative performance to a single BNC model. We introduce novel discriminative learning methods for mixtures of BNCs. Unlike a single BNC model where the discriminative learning resorts to a gradient search, we can exploit the properties of a mixture to alleviate the complex learning task. The proposed method adds mixture components recursively via functional gradient boosting while maximizing the conditional likelihood. This method is highly efficient as it reduces to generative learning of a base BNC model on weighed data. The proposed approach is particularly suited to sequence classification problems where the kernels in the base model are usually too complex for effective gradient search. We demonstrate the improved classification performance of the proposed methods in an extensive set of evaluations on time-series sequence data, including human motion classification problems.
Effects of cognitive style and automation on usability
Authors: R. James Holzworth
Venue:  (2006)

The present research extends Cooper's (1976) analytic and holistic cognitive styles beyond the visual discrimination paradigm and into a multi-attribute, decision-making context of varying automation levels. Two experiments examined the impact of cognitive style, short-term memory (STM) capacity, and training on the computer interface usability of a pilot simulation task. Accuracy scores and perceptions of workload and situation awareness were dependent variables. The implementation of automation levels during the training session was the greatest predictor of transfer performance. Participants with a quasi-rational cognitive style who experienced adaptive automation during the training session performed the transfer task better than participants with an analytic or holistic cognitive style. The transfer performance of analytic and holistic participants was contingent upon the window design and the level of automation during the transfer task.
Spectral difference method for unstructured grids I: basic formulation
Authors: Yen Liu, Marcel Vinokur, Z. J. Wang
Venue: Journal of Computational Physics (2006)

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids is developed. It combines the best features of structured and unstructured grid methods to attain computational efficiency and geometric flexibility; it utilizes the concept of discontinuous and high-order local representations to achieve conservation and high accuracy; and it is based on the finite-difference formulation for simplicity. Universal reconstructions are obtained by distributing unknown and flux points in a geometrically similar manner for all unstructured cells. Placements of these points with various orders of accuracy are given for the triangular elements. Accuracy studies of the method are carried out with the two-dimensional linear wave equation and Burgers' equation, and each order of accuracy is verified numerically. Numerical solutions of plane electromagnetic waves incident on perfectly conducting circular cylinders are presented and compared with the exact solutions to demonstrate the capability of the method. Excellent agreement has been found. The method is much simpler than the discontinuous Galerkin and spectral volume methods for unstructured grids.
Principles of direct chaotic communications
Authors: A. S. Dmitriev, A. I. Panas, K. V. Zakharchenko
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Basics of the theory of direct chaotic communications is presented. We introduce the notion of chaotic radio pulse and consider signal structures and modulation methods applicable in direct chaotic schemes. Signal processing in noncoherent and coherent receivers is discussed. The efficiency of direct chaotic communications is investigated by means of numerical simulation. Potential application areas are analyzed, including multiple access systems.
He's Baaack!
Authors: Paul Dubois
Venue: Computing in Science and Engineering (2006)

Yes Jack, like Patton in France, I've broken out (of the Scientific Programming department) and am rolling like a juggernaut. This column will now come to you each issue and will be somewhat more wide-ranging than before. Meanwhile, this gives George Thiruvathukal and Konstantin Laufer more chances to express themselves, too, in their own sidebars. I hope you enjoy the column and continue to point me at new ideas that you think your fellow readers should learn about.
Modeling a Team-Based Astronomy task Using LAMS
Authors: James Roland Dalziel
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This presentation discusses modeling of a teambased astronomy task for school students using LAMS (the Learning Activity Management System) including consideration of modeling and run-time issues, and facilities for observation, traces and adaptation.
Architectural approaches to secure databases
Authors: H. Rex Hartson
Venue: ACM SIGSMALL Newsletter (1980)

The functional requirements of secure database systems, and underlying security mechanisms needed to support these requirements impose the need for these very general characteristics in a system design: modularity, simplicity, isolatability, and flexibility. It has been observed MANOF77 that thus far the solutions to data security problems have largely been ad hoc and brute force. A view that can stand back and consider the entire system architecture, rather than concentrating on tuning up individual mechanisms, offers hope for more elegant solutions in the future. Perhaps the single most important conclusion of this report is, not to suggest a solution or a particular system, but to recommend a direction and an approach. The bulk of the evidence and information that went into the making of this report points toward system architecture approaches as the most effective way to satisfy the increasingly complex and often competing requirements. In fact, it appears to be the only approach in which the design of such large systems can be understood and believed to be secure.
A Framework for Establishing Decentralized Secure Coalitions
Authors: Hongbin Zhou, Simon N. Foley
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

A coalition provides a virtual space across a network that allows its members to interact in a transparent manner. Coalitions may be formed for a variety of purposes. These range from simple spaces used by individuals to share resources and exchange information, to highly structured environments in which businesses and applications operate and may be governed according to regulation and contract (security policy). Coalitions may spawn further coalitions and coalitions may come-together and/or merge. This paper describes a logic-based language that provides a foundation for coalition regulation and contract in a manner that avoids authorization subterfuge and has a number of novel features that make it applicable to open systems. The language provides inter- and intra- coalition delegation, including identity, role and threshold based delegation operations. The logic is used to describe a decentralized infrastructure for establishing and regulating these coalitions. Coalitions are formed with the involvement of founders, constructors and oversight. Constructors are responsible for properly creating a coalition; this service can be provided by a third party. If the service is improperly provided then the constructor is subject to a penalty, which may be collected by another third party providing oversight.
Incremental planar motion
Authors: Tony Dean
Venue: Proceedings of the 36th conference on Winter simulation (2004)

A cellular engineer typically estimates system performance via simulation. An important input to this simulation is the average busy hour subscriber location distribution. The performance of some system features, such as admission control or carrier, antenna, or beam assignment, requires a dynamic mobility model which matches and maintains that distribution. The author discusses the requirements of such a model and presents easily implementable models satisfying those requirements.
Upstream demand projection and performance mapping in supply chains
Authors: Rahul R. Bagdia, Zbigniew J. Pasek
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper deals with modeling steady-state behavior of a single-product, pull-type, serial supply chain, frequently encountered in the automotive industries. The proposed analytical method enables projection of the end-customer demand information to upstream of the supply chain and estimate demand forecast at the individual tier levels. The supply chain performance assessment is based on the Due-Time Performance metric (DTP - probability to ship a required product/parts volume in a fixed time interval) under the assumption of customer demand following a discrete time Markov process, a special case for correlated demands. A numerical case study demonstrates the use of the DTP measure for a two-tier supply chain. The analytical results (verified by simulations) quantify important relationships in the supply chain, involving reliabilities of machines/stations, capacities of the buffers, demands correlation, and the due times and will find use in performance assessment, optimization and design of supply chains.
Performance analyses of the stochastic maximum likelihood and the subspace power estimation algorithms
Authors: S. D. Silverstein
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Theoretical relations for the estimation mean and variance are derived for the stochastic maximum likelihood (SML) and subspace power estimation (SPE) algorithms relevant to the estimation of the power of sinusoidal sources in Gaussian white noise. These analyses use perturbation theoretic techniques that generate expressions for the estimation moments that are applicable to finite as well as asymptotic data regimes. Simulation results of these power estimation algorithms are given for relatively harsh parameter scenarios involving combinations of: sparse data; 1/2 Rayleigh source separations; large source dynamic range differences, approximately 60 dB; and weak source SNRs of -5 dB. The simulations show that both algorithms perform comparably well from the relatively sparse to the large data regimes.
Effects on Statistical Features for Image by Quantization
Authors: Yanqing Guo, Weiwei Quan, Yanwu Zhu, Xingang You, Xiangwei Kong
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The changes of statistical features can be used to detect the existence of secret messages in images. In this paper, it is indicated that statistical distribution of the whole AC coefficients, such as Generalized Gaussian, Laplacian, Cauchy, etc. can be greatly affected by JPEG quantization process. Furthermore, a constraint condition concerned with quantization step is presented under which the coefficients of individual channel can be fit Laplacian distribution. Based on the constraint condition above, a new steganalytic method, which can achieve a high degree of detection reliability, is also proposed.
Web-service Based Human Resource Recruitment by Using Matchmaking Decision Support
Authors: Gilbert H. L. Luk, Dickson K. W. Chiu, Ho-fung Leung
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

A good decision is made usually from gathering adequate information, working out the importance of individual factors, and choosing the best course of action. The quantity and quality of the information, the process of highlighting the important factors, and the duration to process the decision are critical. Nowadays, outsource hiring and recruitment companies have played an important role in many industries, for reducing the search duration and increasing the likeliness of employing the right person. However, there are too many human resource (HR) companies in the market. Submitting a request for each of them would need huge amount of time and effort to process. Intelligent autonomous Web services would be the best solution to solve this problem. Further, this can reduce the chance of human errors and bias. Therefore, e-HR Matchmaking Service (e-HR) is proposed to provide a standardized human resource searching, platform via the Web services, returning candidates from many different sources. The e-HR integrates with the sources' candidate management system and retrieves the relevant candidates matching the requirements. Also, the e-HR weights each result with configurable ranking criteria and presents the best matching results to the requesters, assisting them to make the best decision on hiring and hence reducing the effort of searching and interviewing.
Visualization of a closed three-dimensional surface using portal-based rendering
Authors: Michael Bui, Nick Lowe, Masahiro Takatsuka
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

The complexity and size of data is rapidly increasing in modern science, business and engineering. This has resulted in increasing demands for more sophisticated data analysis methods. Multidimensional scaling has been used to visualize large high-dimensional datasets in the form of a map. Such maps are very intuitive for us, as we are familiar with reading geographical maps. However, they typically result in a flat space (world), which presents undefined discontinuous edges at the end of the world.In order to provide a continuous space for visualizing high-dimensional data, a closed three-dimensional (3D) surface, such as surfaces of a sphere and a torus, has been used as a target mapping space for multi-dimensional scaling. This paper proposes an application of a portal-based rendering technique to visualize such closed 3D surfaces. This 3D rendering technique allows users to see and navigate through the surface in a natural manner. This eliminates any discontinuous boundaries usually introduced by a process of projection from 3D to two-dimensional space. Furthermore, as our initial investigations show, it is a general technique that is applicable to any closed 3D surface.
Negative ordered hyper-resolution as a proof procedure for disjunctive logic programming
Authors: Linh Anh Nguyen
Venue: Fundamenta Informaticae (2005)

We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of queries are defined using disjunctive substitutions, which are more flexible than answer literals used in theorem proving systems.
Simple unification-based type inference for GADTs
Authors: Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn
Venue: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming (2006)

Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generalization of the data types of Haskell and ML. Recent works have given compelling examples of the utility of GADTs, although type inference is known to be difficult. Our contribution is to show how to exploit programmer-supplied type annotations to make the type inference task almost embarrassingly easy. Our main technical innovation is wobbly types, which express in a declarative way the uncertainty caused by the incremental nature of typical type-inference algorithms.
Developing New Customer Services for MDEs in e-time: A Platform-based Approach and Its Support System
Authors: Youping Yu, Shuqin Cai, Zhigao Liu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Based on Meyer's platform-based perspective of developing new services for service industries, a detailed platform-based approach aiming at developing customer service promptly, consistently, and cost-effectively for MDEs is proposed. The Customer Service Platform (CSP) that supporting customer service innovation and implementation and its application framework are given. Structure and functions of the Customer Service Platform Support System (CSPSS), which is the main center of the CSP, are provided. Empirical application of the approach and its support system is also demonstrated.
Facilitation of Implicit Motor Learning by Weak Transcranial Direct Current Stimulation of the Primary Motor Cortex in the Human
Authors: Michael A. Nitsche, Astrid Schauenburg, Nicolas Lang, David Liebetanz, Cornelia Exner, Walter Paulus, Frithjof Tergau
Venue: Journal of Cognitive Neuroscience (2003)

Transcranially applied weak direct currents are capable of modulating motor cortical excitability in the human. Anodal stimulation enhances excitability, cathodal stimulation diminishes it. Cortical excitability changes accompany motor learning. Here we show that weak direct currents are capable of improving implicit motor learning in the human. During performance of a serial reaction time task, the primary motor cortex, premotor, or prefrontal cortices were stimulated contralaterally to the performing hand. Anodal stimulation of the primary motor cortex resulted in increased performance, whereas stimulation of the remaining cortices had no effect. We conclude that the primary motor cortex is involved in the acquisition and early consolidation phase of implicit motor learning.
Signaling techniques using solitons
Authors: A. C. Singer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Solitons and the nonlinear evolution equations that support them arise in the description of a wide range of nonlinear physical phenomena including shallow water waves, piezoelectrics, and optical transmission in nonlinear fibers. Although such systems are nonlinear, they are exactly solvable and possess a class of remarkably robust solutions, known as solitons, which satisfy a nonlinear form of superposition. By exploiting the properties of solitons, such nonlinear systems may be attractive for a variety of signal processing problems including multiple access communications, private or low power transmission, and multiresolution transmission. We outline a number of modulation techniques using solitons, and explore some of the properties of such systems in the presence of additive channel corruption. We also discuss the use of a nonlinear LC network (transmission line model) and its soliton solutions for signal synthesis in a variety of modulation techniques.
Modelling physical hysteresis and control of a fine piezo-drive
Authors: Y. I. Somov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

New universal and constructible approach for mathematical description of physical hysteresis is presented. This approach is based on using set-valued differential equation with discontinuous right-side and on a shape parameterization of a hysteresis relation. Developed approach is efficiently applied for nonlinear dynamic research of the fine piezo-ceramic micro-drive for an image motion stabilization at a space Earth observing telescope.
From the Editor: Real-Time and Embedded Systems--Teaching Reliability
Authors: John Regehr
Venue: IEEE Distributed Systems Online (2006)

Although it would be rash to say that a general agreement exists on how to teach students to build reliable embedded systems, there's certainly a growing understanding of the issues. For one thing, reliability is hard to quantify; for another, computer science education has endemic problems in teaching software reliability. Reliability should be a first-order concern in embedded systems education instead of an afterthought.
Peg-Free Hand Shape Verification Using High Order Zernike Moments
Authors: Gholamreza Amayeh, George Bebis, Ali Erol, Mircea Nicolescu
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Hand-based verification is a key biometric technology with a wide range of potential applications both in industry and government. The focus of this work is on improving the efficiency, accuracy, and robustness of hand-based verification. In particular, we propose using high-order Zernike moments to represent hand geometry, avoiding the more difficult and prone to errors process of hand-landmark extraction (e.g., finding finger joints). The proposed system operates on 2D hand silhouette images acquired by placing the hand on a planar lighting table without any guidance pegs, increasing the ease of use compared to conventional systems. Zernike moments are powerful translation, rotation, and scale invariant shape descriptors. To deal with several practical issues related to the computation of highorder Zernike moments including computational cost and lack of accuracy due to numerical errors, we have employed an efficient algorithm that uses arbitrary precision arithmetic, a look-up table, and avoids recomputing the same terms multiple times [2]. The proposed hand-based authentication system has been tested on a database of 40 subjects illustrating promising results. Qualitative comparisons with state of the art systems illustrate comparable of better performance.