ppxscal/embedding_network huggingface dataset:
Multiple influences on gaze and attention behavior for embodied agents
Authors: Norman I. Badler
Venue:  (2006)

Our objective is to develop a computational model of multiple influences on eye gaze behavior for an embodied agent in a dynamic environment. An embodied agent should possess human attention attributes so that its eyes and resultant head movements convey appropriate and humanly understandable communicative behaviors. Suppressed or inappropriate eye movements can damage the visual effectiveness of an embodied agent. Visual attention models may be the key to leading animated agents out of the "uncanny valley" where increasing visual appearance accuracy results in a ghoulish appearance when animated. Visual perceptual capability, human-like imperfect cognitive ability, interpersonal interaction, and some aspects of internal cognitive state influence attention and eye gaze behaviors. Visual perceptual capability starts with an early vision process that exhibits changes in visual sensitivity such as night vision and flash blindness under changing scene illumination. Visual attention directs the limited gaze resource to resolve visual competition with the cooperation of top-down attention and conspicuous bottom-up guidance. Grounded in psychological studies, this model has four factors---conspicuity, mental workload, expectation and capacity---that determine successful attention allocation. The attention model replicates many aspects of normal human function as well as some of its imperfect behaviors, such as inattentional blindness. We implement and integrate attentional models into conversational agents in which gaze role is not only modeled based on the social aspects of interaction behaviors such as turn-taking and feedback signals, but also driven by peripheral events and abrupt onset. The attentional model is a separable component of an intelligent agent architecture, so that it may be transplanted to other applications, such as a virtual driver. Our contributions are a computational attention model, rational quantification of the inattention factors, integration into a general eye gaze model, application of the completed model to animated agents.
A virtual classroom via dataconferencing: a multi-institutional experience
Authors: S. Starrett
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper presents the experience of five faculty from four universities who are co-developing and team teaching courses using the world-wide web (WWW). In particular two novel power engineering courses, Flexible Control of Transmission Systems and Flexible Control of Distribuction Systems, introduce the student to the application of power electronic-based controllers, known specifically as flexible AC transmission systems (FACTS) controllers, to enhance the performance of the transmission and distribution systems in an electric power system. In order to leverage faculty expertise in the various topics included in each course, a unique partnership was formed among five faculty from the following universities: University of Arkansas, Kansas State University, University of Missouri-Rolla and Purdue University. In order to achieve the most effective presentation, in the presence of geographical, cost, time and technology constraints, the co-developers decided to pursue various distance learning strategies to link the four universities together in a live interactive virtual classroom utilizing dataconferencing software and the WWW. In this paper we address the trials and tribulations of our experience. In particular, we discuss the use of video tape technology by mail, the use of live audio and video via an integrated service digital network (ISDN) approach, and lastly, dataconferencing software in conjunction with telephone conferencing. Each of these alternative methodologies are examined in detail and are compared and contrasted from a cost and pedagogical point of view based on our experiences.
Incremental enrolment of speech recognizers
Authors: C. Mokbel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

Classical adaptation approaches generally allow a reliably trained model to match a particular condition. In this paper, we define an incremental version of the segmental-EM algorithm. This method permits one to incrementally enrich a model first trained with a limited amount of data. Resource memory constraints allow only the initial data statistics to be stored. The proposed method uses these statistics by fixing, within the segmental-EM algorithm applied on both initial and new data, the initial optimal paths in the model for the initial data. We proved theoretically that this is equivalent to the segmental MAP adaptation with specific choice of priors. Experiments on two speaker dependent telephone databases, showed that the approach permitted one to incrementally integrate new conditions of use. The performance was slightly less than that obtained with classical training over the whole data. As expected with the MAP interpretation of the algorithm, initial data characteristics influence largely the model evolution.
Generalized α-invexity and nondifferentiable minimax fractional programming
Authors: S. K. Mishra, R. P. Pant, J. S. Rautela
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we study a nondifferentiable minimax fractional programming problem under the assumptions of @a-invex function. In this paper we utilize the concept of @a-invexity [M.A. Noor, On generalized preinvex functions and monotonicities, J. Inequalities Pure Appl. Math. 5 (2004) 1-9] and pseudo-@a-invexity [S.K. Mishra, M.A. Noor, On vector variational-like inequality problems, J. Math. Anal. Appl. 311 (2005) 69-75]. We also introduce the concept of strict pseudo-@a-invex and quasi-@a-invex functions. We derive Karush-Kuhn-Tucker-type sufficient optimality conditions and establish weak, strong and converse duality theorems for the problem and its three different dual problems. The results in this paper extend several known results in the literature.
SNR analysis of time-frequency distributions
Authors: Weifeng Mu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The SNR analysis has been widely used to evaluate the performance of time-frequency (t-f) distributions. Often the SNR is defined at a specific t-f location or using the averaged variance over the entire t-f domain. In this paper, a new SNR measure is provided based on averaging along the signal t-f signature and its properties for linear FM signals are delineated. It is shown that the SNR increases for increased integration range, and is not highly sensitive to the FM sweeping rate.
A novel fuzzy compensation multi-class support vector machine
Authors: Yong Zhang, Zhong-Xian Chi, Xiao-Dan Liu, Xiang-Hai Wang
Venue: Applied Intelligence (2007)

This paper presents a novel fuzzy compensation multi-class support vector machine (FCM-SVM) to improve the outlier and noise sensitivity problem of traditional support vector machine (SVM) for multi-class data classification. The basic idea is to give the dual effects to penalty term through treating every data point as both positive and negative classes, but with different memberships. We fuzzify penalty term, compensate weight to classification, reconstruct the optimization problem and its restrictions, reconstruct {Lagrangian} formula, and present the theoretic deduction. By this way the new fuzzy compensation multi-class support vector machine is expected to have more generalization ability while preserving the merit of insensitive to outliers. Experimental results on benchmark data set and real data set show that the proposed method reduces the effect of noise data and yields higher classification rate than traditional multi-class SVM does.
Generalizing DPLL and satisfiability for equalities
Authors: Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema
Venue: Information and Computation (2007)

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic. Sufficient conditions are identified for proving soundness, termination and completeness of GDPLL. We show how the original DPLL procedure is an instance. Subsequently the GDPLL instances for equality logic, and the logic of equality over infinite ground term algebras are presented. Based on this, we implemented a decision procedure for inductive datatypes. We provide some new benchmarks, in order to compare variants.
An account of the use of synoptic assessment for students in the area of databases at level 2
Authors: Andrea Gorra, Sanela Lazarevski, Jackie Campbell
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

The purpose of this poster is to share innovative teaching methods at Leeds Metropolitan University in the Innovation North Faculty of Information and Technology (INN Faculty). An explorative study has been undertaken to provide an initial evaluation of the use of synoptic assessments within the subject area of Computing. Synoptic assessments, also known as integrated assessments, help to enable students to make connections between modules, to increase the level of student engagement and to provide teaching staff with the opportunity to adopt a holistic approach to delivering modules. This type of assessment pulls together independent assessments from a number of modules into a single assessment exercise. Synoptic assessment is driven by providing an environment for synoptic learning via a supporting course structure. For this reason, the course structures of the Innovation North Faculty are described for all three undergraduate levels. See Table 1 for an example of the course structure for Level 2. A series of semi-structured interviews were conducted to learn about staff and students' perspectives on integrated assessments and their views of the learning environment in general. Twenty computing students were approached to talk about their experience with and opinions of integrated assessments. In addition to the student interviews, ten members of academic teaching staff were interviewed. The findings are the result of an exploratory study and should be taken as indicative. The use of synoptic assessments within the INN Faculty is currently evaluated in depth as part of the CETL ALiC project [1, 2] and results will be published in the near future. The analysis of the interviews indicates that students perceive the delivery pattern of block teaching and pairing of modules as beneficial. The main reason for this is that it enables students to concentrate on two subject areas at a time in comparison to the traditional semester structure of four modules. Potential areas for concern are the nature of modules that are paired and a fair marking scheme. Teaching staff feel that the synoptic assessment enabled by a case study has worked well for the students. However, issues with timetabling need to be considered, and dependencies between the paired modules need to be avoided.
A Cooperative Approach for Analyzing Intrusions in Mobile Ad hoc Networks
Authors: Hadi Otrok, Mourad Debbabi, Chadi Assi, Prabir Bhattacharya
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In this paper, we consider the problem of reducing the number of false positives generated by cooperative Intrusion Detection Systems (IDSs) in Mobile Ad hoc Networks (MANETs). We define a flexible scheme using security classes, where an IDS is able to operate in different modes at each security class. This scheme helps in minimizing false alarms and informing the prevention system accurately about the severity of an intrusion. Shapley value is used to formally express the cooperation among all the nodes. To the best of our knowledge, there has not been any study for the case where the intrusions in MANETs are analyzed, in order to decrease false positives, using cooperative game theory. Our game theoretic model assists in analyzing the contribution of each mobile node on each security class in order to decrease false positives taking into consideration the reputation of nodes. Simulation results are given to validate the efficiency of our model in detecting intrusions and reducing false positives.
Playing with your brain: brain-computer interfaces and games
Authors: Anton Nijholt, Desney Tan
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this workshop we investigate a possible role of brain-computer interaction in computer games and entertainment computing. The assumption is that brain activity, whether it is consciously controlled and directed by the user or just recorded in order to obtain information about the user's affective state, should be modeled in order to provide appropriate feedback and a context where brain activity information is one of the multi-modal interaction modalities that is provided to the user.
Delay testing based on transition faults propagated to all reachable outputs
Authors: B. Vaidya, M. B. Tahoori
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

Data from the test floor has shown that transition faults propagated to all reachable outputs (TARO) is more effective in detecting defective chips compared to conventional transition faults [Tseng et al. 2001]. This paper describes an efficient approach to generate tests pattern based on TARO metric using Boolean satisfiability. The problem of test pattern generation is converted to an instance of Boolean satisfiability and the recent development in the design of efficient SAT solvers has helped to speed up the process of test generation extensively. Experimental results on several benchmarks show the effectiveness of this technique.
On the processing of piecewise-constant signals by hierarchical models with application to single ion channel currents
Authors: P. M. Djuric
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A new approach for the processing of piecewise-constant signals is proposed. It is based on modeling the observed data as a sum of a random signal and noise. The random signal has a Gibbs distribution, and the noise is Gaussian. A MAP criterion is derived for joint estimation of the number of signal levels and reconstruction of the signal. The criterion comprises of three terms, one corresponding to the likelihood of the data and two to penalties. One penalty term penalizes for unnecessary transitions, and the other, for unnecessary levels. The method has been tested on synthesized data and applied to single ion channel recordings.
Fabrication comb-drive device by MEMS and electroplating
Authors: Chien Chao-Heng, Chen Shi-Hao
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A micro actuator as an electrostatic comb driver fabricated by MEMS surface micromachining technique and electroplating technique will be presented in this paper. The electroplating technique is applied to deposit nickel as the structure layer that is instead of the conventional polysilicon structure layer deposited by CVD technique. Using electroplated nickel instead of CVD-polysilicon, the fabrication process involves low-temperature electro-plating process; therefore, it is well suited for the post-IC process.
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Authors: Stefan S. Dantchev
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We prove a dichotomy theorem for the rank of the uniformly generated(i.e. expressible in First-Order (FO) Logic) propositional tautologiesin both the Lovász-Schrijver (LS) and Sherali-Adams (SA) proofsystems. More precisely, we first show that the propositional translationsof FO formulae that are universally true, i.e. hold in all finiteand infinite models, have LS proofs whose rank is constant, independentlyfrom the size of the (finite) universe. In contrast to that, we provethat the propositional formulae that hold in all finite models butfail in some infinite structure require proofs whose SA rank grows poly-logarithmically with the size of the universe. Up to now, this kind of so-called "Complexity Gap" theorems have been known for Tree-like Resolution and, in somehow restrictedforms, for the Resolution and Nullstellensatz proof systems. As faras we are aware, this is the first time the Sherali-Adams lift-and-projectmethod has been considered as a propositional proof system. An interesting feature of the SA proof system is that it is static and rank-preserving simulates LS, the Lovász-Schrijver proof system without semidefinitecuts.
Curriculum in high-performance scientific computing
Authors: E. R. Jessup
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The purpose of this paper is to report on an undergraduate course in the use of high-performance computing systems in scientific and engineering applications. The course and the instructional materials on which it is based were developed at the University of Colorado at Boulder (UCB). Its development was supported by the National Science Foundation under a CISE Educational Infrastructure grant, and it has been taught at UCB since 1991.
Introducing computer science fundamentals before programming
Authors: R. L. Shackelford
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

In this paper, we describe a two course sequence that has been taught to majors in computer science and a variety of other disciplines. The first course is called "Introduction to Computing"; the second course is "Introduction to Programming". The "Computing" course is a ten-week course that includes material on the following: the "computing perspective" (the algorithmic model as a way of thinking); foundational concepts underlying program design and implementation, including: algorithmic methods, static and dynamic data structures, and design using abstraction; fundamental notions of algorithm analysis and computability; and use of application tools such as e-mail, Web browsers, word processors, spreadsheets, databases, and equation solvers. Building on this foundational pre-programming material, students in the "Programming" course are able to learn rapidly the skills in program design, implementation, and debugging necessary to solve computational problems in a high-level programming language. We emphasize effective use of abstraction and the acquisition of software development skills that are language independent. Our experience with these courses has convinced us that it is possible to introduce the conceptual foundations of computer science to beginning students in a way that both engages them and gives them a basis for learning advanced ways to solve problems using computing, either via programming or through use of modern, highly-programmable commercial applications.
Semantic parsing with structured SVM ensemble classification models
Authors: Le-Minh Nguyen, Akira Shimazu, Xuan-Hieu Phan
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We present a learning framework for structured support vector models in which boosting and bagging methods are used to construct ensemble models. We also propose a selection method which is based on a switching model among a set of outputs of individual classifiers when dealing with natural language parsing problems. The switching model uses subtrees mined from the corpus and a boosting-based algorithm to select the most appropriate output. The application of the proposed framework on the domain of semantic parsing shows advantages in comparison with the original large margin methods.
Maximum a posteriori adaptation for large scale HMM recognizers
Authors: G. Zavaliagkos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present a framework for maximum a posteriori (MAP) adaptation of large scale HMM recognizers. First we review the standard MAP adaptation for Gaussian mixtures. We then show how MAP can be used to estimated transformations which are shared across many parameters. Finally, we combine both techniques: each of the HMM models is adapted based on an interpolation of MAP estimates obtained under varying degrees of sharing. We evaluate this algorithm for adaptation of a continuous density HMM with 96 K Gaussians and show that very satisfactory improvements can be achieved, especially for adaptation of non-native speakers of American English.
Objective-Tcl: an object-oriented Tcl environment
Authors: Pedja Bogdanovich
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

Objective-Tcl is an object-oriented extension to Tcl modeled after the Objective-C extension to the C language. The Objective-Tcl system facilitates sending messages to Objective-C objects from the interpreter without the need for any interface specification. The information stored in the Objective-C runtime system is used. In addition, Objective-Tcl facilitates defining classes and categories (collections of methods) in the Objective-Tcl interpreter. It is transparent to the runtime system if a method is implemented in Objective-C or in Objective-Tcl. In fact, a class can have a mixed implementation--certain methods can be implemented in Objective-C, while other methods can be implemented in Objective-Tcl. For Tcl, Objective-Tcl provides a seamless integration with the low-level compiled language (i.e., Objective-C), as well as a dynamic object-oriented environment which promotes more structured programming in Tcl. For Objective-C, Objective-Tcl provides an interactive development environment which promotes rapid prototyping.
Using software distributions to understand the relationship among free and open source software projects
Authors: Daniel M. German
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Success in the open source software world has been measured in terms of metrics such as number of downloads, number of commits, number of lines of code, number of participants, etc. These metrics tend to discriminate towards applications that are small and tend to evolve slowly. A problem is, however, how to identify applications in these latter categories that are important. Software distributions specify the dependencies needed to build and to run a given software application. We use this information to create a dependency graph of the applications contained in such a distribution. We explore the characteristics of this graph, and use it to define some metrics to quantify the dependencies (and dependents) of a given software application. We demonstrate that some applications that are invisible to the final user (such as libraries) are widely used by end-user applications. This graph can be used as a proxy to measure success of small, slowly evolving free and open source software.