ppxscal/embedding_network huggingface dataset:
Gestural mind markers in ECAs
Authors: Isabella Poggi, Catherine Pelachaud, Emanuela Magno Caldognetto
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We aim at creating expressive Embodied Conversational Agents (ECAs) able to communicate multimodally with a user or with other ECAs. In this paper we focus on the Gestural Mind Markers, that is, those gestures that convey information on the Speaker's Mind; we present the ANVIL-SCORE, a tool to analyze and classify multimodal data that is a semantically augmented version of Kipp's ANVIL [2].
On the Errors That Learning Machines Will Make
Authors: W A Biermann, C K Gilbert, Fahmy,  A, Koster,  B
Venue:  (1991)

\indent Associated with each learning system there is a class of learnable behaviors. If the target behavior to be acquired is in the learnable class, it will be learned perfectly. If it is outside that class, the machine will only be able to acquire a behavior that approximates the target and it will always make errors. It is desirable for a learning machine to have a large learnable class to maximize the chances of acquiring the unknown behavior and to minimize the expected error when only an approximation is possible. However, it is also desirable to have a small learnable class so that learning can be achieved rapidly. Thus the design of learning machines involves selecting a position on the spectrum: minimum error and slow learning time versus larger error and faster learning time. Machines that have fast learning times, relatively small learnable classes, and thus relatively large expected errors are called ``realization sparse'''' in this paper. It is shown that many common learning systems are of this type including signature tables, linear system models, and conjunctive normal form expression based systems. These studies lead to the concept of an ``optimum'''' machine which spreads its learnable behaviors across the behavior space in a manner to minimize the expected error. An approximation to such optimum machines is presented and its behavior is compared to the more traditional learning machines.
A machine learning technique for monitoring database systems
Authors: H. Mathkour, A. Al-Salamah
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

A machine learning technique based database monitoring system is introduced. We report on a system which makes use of effective machine learning techniques to analyze user's queries and make appropriate, valuable suggestions to the database administrator (DBA) to fine tune the performance of the database at hand. The system uses several machine learning algorithms to monitor the queries and attempt to extract commonalities exhibited by the queries. The concepts learnt are passed to another module of the system which will perform the restructuring of the database. We also report on the design and development of a carefully selected database application and the set of queries formed for the system.
Flash MX Application Design and Development
Authors: Jessica Speigel
Venue:  (2002)

:Finally! Not just another Flash book. Build three of the most sought-after web applications from Jessica Speigel, co-founder of one of the most popular Flash resources-were-here.com. Flash MX Application Design and Development shows serious Flash developers how to create sophisticated, real-world applications using Macromedia Flash MX. By deconstructing three high-caliber, well-designed web applications, Speigel provides all the techniques necessary to successfully create these applications for your own web sites. In addition, each project is broken down into easily digested chapters that include explanations for using the supplied server-side code in a project-based format. In no time, you will create a full-featured e-commerce site; a multiplayer game featuring speech bubble chat and theme game rooms; and an online community complete with forum, user registration, and search capabilities! Flash MX Application Design and Development also serves as an excellent resource for Flash developers, including a generous share of tips, pitfalls, usability notes, and "Whys" that explain why the author employs a certain technique and explores alternative methods. 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
Parallel h-v Drawings of Binary Trees
Authors: Panagiotis Metaxas, Grammati E. Pantziou, Antonios Symvonis
Venue:  (1993)

In this paper we present a method to obtain optimal h-v and inclusion drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in $O(\log^2 n)$ parallel time by using a polynomial number of EREW processors. The number of processors reduces substantially when we study minimum area drawings. The method can be extended to compute optimal inclusion layouts in the case where each leaf $l$ of the tree is represented by rectangle $l_x \times l_y$ (the dimensions of which are part of the input). For polynomial area layouts, our work places the problem of obtaining optimal size h-v or inclusion drawings in NC, presenting the first algorithm with polylogarithmic time complexity. Our method also yields an NC algorithm for the slicing floorplanning problem. Whether this problems was in NC was an open question~\cite{CT90}.
An advanced environment supporting structured parallel programming in Java
Authors: M. Aldinucci, M. Danelutto, P. Teti
Venue: Future Generation Computer Systems (2003)

In this work we present Lithium, a pure Java structured parallel programming environment based on skeletons (common, reusable and efficient parallelism exploitation patterns). Lithium is implemented as a Java package and represents both the first skeleton based programming environment in Java and the first complete skeleton based Java environment exploiting macro-data flow implementation techniques.Lithium supports a set of user code optimizations which are based on skeleton rewriting techniques. These optimizations improve both absolute performance and resource usage with respect to original user code. Parallel programs developed using the library run on any network of workstations provided the workstations support plain JRE. The paper describes the library implementation, outlines the optimization techniques used and eventually presents the performance results obtained on both synthetic and real applications.
An Open Visualization Toolkit for Reverse Architecting
Authors: Alexandru Telea, Alessandro Maccari, Claudio Riva
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Maintenance and evolution of complex software systems (such as large telecom embedded devices) involve activities such as reverse engineering (RE) and software visualization. Although several RE tools exist, we found their architecture hard to adapt to the domain specific requirements posed by our current practice in Nokia. In this paper, we present an open architecture which allows easy prototyping of RE data exploration and visualizationscenarios for a large range of domain models. We pay special attention to the visual and interactive requirements of the reverse engineering process. This article describes the basic architecture of our toolkit, compares it to the existing RE environments and present several visualizations taken from real cases.
Finite element and finite volume discretizations of Drift-Diffusion type fluid models for semiconductors
Authors: Franco Brezzi, L. D Marini, Stefano Micheletti, Paola Pietra, Riccardo Sacco, Song Wang
Venue:  (2002)

This paper contains an overview on numerical schemes for some of the most widely used fluid models for semiconductor device simulation, namely, Drift-Diffusion model, Energy-Transport and Energy-Balance models. The presentation focuses on the use of finite elements and finite volumes for formulations in density variables.
Evolutionary computation in air traffic control planning
Authors: Cees H.M. Kemenade, C. F.W. Hendriks, H. H. Hesselink, Joost N. Kok
Venue:  (1995)

Air Traffic Control is involved in the real-time planning of aircraft trajectories. This problem is a heavily constrained optimization problem. We concentrate on free-route planning, in which aircraft are not required to fly over way points. The choice of a proper representation for this real-world problem is non-trivial. We propose a two level representation: one level on which the evolutionary operators work, and a derived level on which we do calculations. Furthermore we show that a specific choice of the fitness function is important for finding good solutions to large problem instances. We use a hybrid approach in the sense that we use knowledge about air traffic control by using a number of heuristics. We have built a prototype of a planning tool, and this resulted in a flexible tool for generating a free-route planning of minimal cost, for a number of aircraft.
A Framework for Scheduling and Context Allocation in Reconfigurable Computing
Authors: R. Maestre, M. Fernandez, R. Hermida, N. Bagherzadeh
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Reconfigurable computing is emerging as a viable design alternative to implement a wide range of computationally intensive applications. The scheduling problem becomes a really critical issue in achieving the high performance that these kind of applications demands. This paper describes the different aspects regarding the scheduling problem in a reconfigurable architecture. We also propose a general strategy in order to perform at compilation time a scheduling that includes all possible optimizations regarding context (configuration) and data transfers. In particular, we focus especially on the methodology and mechanisms to solve the context scheduling. Some experimental results are presented to validate our assumptions. Finally, the problem of data transfers is only formulated and will be addressed in future work.
Microsoft .NET Passport: A Security Analysis
Authors: Rolf Oppliger
Venue: Computer (2003)

Part of its .NET initiative, Microsoft's set of Web services includes .NET Passport, a password-based user authentication and single sign-in service. The system offers a simple and sufficiently secure alternative to privilege-management infrastructures and public-key infrastructure for many applications and services.Released in 1999 and used in many Web-based applications and services, .NET Passport and its SSI service have been criticized for poor security and privacy. Its centralized nature makes it possible that other problems and security breaches will occur.
Restricted Turing Reducibilities and the Structure of the Polynomial Time Hierarchy
Authors: Jim Kadin
Venue:  (1988)

The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, play an major role in computational complexity theory, particularly in the study of such classes as P, NP, the polynomial time hierarchy (PH), and PSPACE. In this thesis, we consider polynomial time Turing reducibilities with various restricted oracle access mechanisms such as restrictions on the number of queries allowed or requiring that all queries be made at once, in parallel. Such restrictions are related to polynomial time truth-table and bounded truth-table reducibilities. We focus mostly on classes of languages reducible to NP sets via these reducibilities. For any integer $k, P^{NP[k]}$ is the class of languages recognizable in polynomial time with $k$ queries to an oracle from NP. The query hierarchy, QH, is $\bigcup_{k} P^{NP[k]}$. The class $P^{NP[\log n]}$ is the set of languages recognizable with $O(\log n)$ queries. Two related hierarchies are the Boolean hierarchy Boolean hierarchy (BH) and the parallel query hierarchy $(\rm QH_{||})$. The BH, QH, and $\rm QH_{||}$ intertwine to form a rich structure within $P^{NP}$: NP $\cup$ co-NP $\subseteq P^{NP[1]} \subseteq P^{NP[2]} \subseteq \cdots \subseteq QH = QH_{||} = BH \subseteq P^{NP[\log n]} \subseteq P^{NP}.$ We show that the structure of these classes is closely tied to the existence of nonuniform algorithms for NP and co-NP languages and to the structure of the PH as a whole. We improve Mahaney''s result for sparse Turing-complete sets for NP by showing that if there exists a sparse set $S \in NP$ such that co-NP $\subseteq NP^{S}$, then PH $\subseteq P^{NP[\log n]}$. We show that there are relativized worlds where this collapse is optimal, and thus we provide a clear distinction between the effects of a sparse many-one-complete set and a sparse Turing-complete set for NP. We prove that if the BH, QH, or $QH_{||}$ collapses, for instance, if $D^{P} =$co-$D^{P}$ or if $P^{NP[k]} = P^{NP[k+1]}$, then there exists a sparse set $S$ such that co-NP $\subseteq $NP^{S}$, and therefore the PH collapses to $P^{NP^{NP}[\log n]}$, a subclass of the $\Delta^{P}_{3}$ level of the PH. Hence the structure of unsatisfiable Boolean formulas, co-NP, and the whole PH are all closely related to the structure of the BH and to the issue of how deterministic polynomial time algorithms can access the information from NP oracles.
Enzyme Transistor Circuits for Biomolecular Computing
Authors: Masahiko Hiratsuka, Takafumi Aoki, Tatsuo Higuchi
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

A model of an enzyme transistor, a three-terminal biomolecular switching device, is proposed. Ideally, an enzyme transistor can be regarded as an artificial enzyme whose catalytic activity is controlled by some effector molecule. In this paper, we show that various biomolecular circuits can be constructed with enzyme transistors. Also, a possible approach to the implementation based on electrical control of enzyme reactions is discussed.
An Adaptive Multimodal Interface For Wireless Applications
Authors: Jie Yang, William Holtz, Weiyi Yang, Minh Tue Vo
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

In this paper, we present an adaptive multimodal interface for wireless computing applications. The system optimizes its performance by dynamically selecting its network service based on cost and performance requirements. We describe a prototype system and its application to demonstrate the proposed concept.
The Ultimate Planar Convex Hull Algorithm ?
Authors: David G. Kirkpatrick, Raimund Seidel
Venue:  (1983)

We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $n$ is the size of the input set and $H$ is the size of the output set, i.e. the number of vertices found to be on the hull. We also show that this algorithm is asymptotically worst case optimal on a rather realistic model of computation even if the complexity of the problem is measured in terms of input as well as output size. The algorithm relies on a variation of the divide-and-conquer paradigm which we call the ``marriage-before-conquest'''' principle and which appears to be interesting in its own right.
A New Model of Exploiting Loop Parallelization Using Knowledge-Based Techniques
Authors: Chao-Tung Yang, Shian-Shyong Tseng, Chang-Jiun Tsai, Cheng-Der Chuang, Sun-Wen Chuang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we concentrate on three fundamental phases, data dependence testing, parallel loop transformation, and parallel loop scheduling, for loop parallelization in parallelizing compilers, running on multiprocessor systems. A new model of exploiting loop parallelization by using knowledge-based techniques is first proposed. The knowledge-based approach integrates existing data dependence tests, loop transformations and loop schedules, to make good use of their abilities for extracting more parallelisms. Repertory grid analysis and an attribute-ordering table to construct the knowledge base, respectively, then develop three rule-based systems, called the K-Test, IPLS and KPLT. These systems can choose an appropriate test, transform and schedule, then apply the resulting methods to perform loop parallelization and gain high speedup rate. For example, the KPLT a choose the appropriate loop transformations to reorder the execution of statements and loop iterations for parallelization. Unlike the previous researches that must use one-pass approach, we introduce the idea of multi-pass, which may explore more parallelism of loops. Experimental results show that our new model can achieve higher speedup on parallelizing compilers. Furthermore, for system maintenance and extensibility, our approach is obviously superior to others.
Comparison of model selection for regression
Authors: Vladimir Cherkassky, Yunqian Ma
Venue: Neural Computation (2003)

We discuss empirical comparison of analytical methods for model selection. Currently, there is no consensus on the best method for finite-sample estimation problems, even for the simple case of linear estimators. This article presents empirical comparisons between classical statistical methods--Akaike information criterion (AIC) and Bayesian information criterion (BIC)--and the structural risk minimization (SRM) method, based on Vapnik-Chervonenkis (VC) theory, for regression problems. Our study is motivated by empirical comparisons in Hastie, Tibshirani, and Friedman (2001), which claims that the SRM method performs poorly for model selection and suggests that AIC yields superior predictive performance. Hence, we present empirical comparisons for various data sets and different types of estimators (linear, subset selection, and k-nearest neighbor regression). Our results demonstrate the practical advantages of VC-based model selection; it consistently outperforms AIC for all data sets. In our study, SRM and BIC methods show similar predictive performance. This discrepancy (between empirical results obtained using the same data) is caused by methodological drawbacks in Hastie et al. (2001), especially in their loose interpretation and application of SRM method. Hence, we discuss methodological issues important for meaningful comparisons and practical application of SRM method. We also point out the importance of accurate estimation of model complexity (VC-dimension) for empirical comparisons and propose a new practical estimate of model complexity for k-nearest neighbors regression.
Open Software UNIX/OSF/UI, Etc.
Authors: Thomas W. Doeppner,  Jr.
Venue:  (1992)

We discuss the support of open software by the computer industry, particularly the UNIX-oriented computer industry. We look at the modern UNIX operating system and its competing implementations, OSF/1 and SVR4. A major theme in the area of open software is support for distributed computing. We discuss distributed file systems and then cover the more general topic of software architectures for distributed computing, concentrating on OSF''s DCE. Finally, we discuss the future of UNIX and its competition. This paper was originally presented as an invited talk at 1992 Conference on Computers in High-Energy Physics in Annecy, France.
Toward Content Based Retrieval from Scientific Text Corpora
Authors: Antonina Kloptchenko, Barbro Back, Ari Visa, Jarmo Toivonen, Hannu Vanharanta
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The growth of digitally available text information has created a need for effective information retrieval and text mining tools. We have used a content-based retrieval method that is built on a prototype-matching technique for clustering scientific text corpora, which in our case are the abstracts from The Hawaii International Conference on System Science 2001. Our aim is to retrieve the documents from a conference paper collection according to similarities in their contents and semantic structures. The method consists of "smart" document encoding on word and sentence levels, creating common word and sentence histograms using a vector quantization algorithm, and matching those histograms for every for document retrieval. In thepaper, we position our methods among the existing document clustering methods, explain the motivation behind the clustering of scientific conference papers, and give an example of using our prototype tool for content-based retrieval on the scientific abstract collection. The method offers a promising alternative for retrieval by content.
Wavelet Stabilization and Preconditioning for Domain Decomposition
Authors: Silvia Bertoluzza, Angela Kunoth
Venue:  (1999)

The aim of this paper is to propose a stabilization technique in order to circumvent the two inf-sup conditions needed for stability of the discretization of the Three Fields Formulation for domain decomposition methods. Realization of this technique in terms of wavelets is presented. Furthermore, the resulting discrete problem is shown to admit an asymptotically optimal preconditioner also based on wavelets. EMAIL:: aivlis@dragon.ian.pv.cnr.it KEYWORDS:: Three Fields Formulation, Domain Decomposition, Wavelets, Stabilization, Preconditioning.
Teach Yourself Visually Dreamweaver MX, 1 edition
Authors: Janine Warner, Ivonne Berkowitz
Venue:  (2002)

:Are you a visual learner? Do you prefer instructions that show you how to do something -- and skip the long-winded explanations? If so, then this book is for you. Open it up and you'll find clear, step-by-step screen shots that show you how to tackle more than 150 Dreamweaver MX tasks, from working with images, multimedia, templates, and DHTML to creating tables, frames, forms, and database-driven sites.
Expanding the Potential for Disk-Directed I/O
Authors: David Kotz
Venue:  (1995)

As parallel computers are increasingly used to run scientific applications with large data sets, and as processor speeds continue to increase, it becomes more important to provide fast, effective parallel file systems for data storage and for temporary files. In an earlier work we demonstrated that a technique we call disk-directed I/O has the potential to provide consistent high performance for large, collective, structured I/O requests. In this paper we expand on this potential by demonstrating the ability of a disk-directed I/O system to read irregular subsets of data from a file, and to filter and distribute incoming data according to data-dependent functions.
Selective Integration of Formal Methods in the Development of Electronic Control Units
Authors: Mirko Conrad, Dieter Hötzer
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

This paper introduces a dual approach for describing the software of embedded systems in motor vehicles. The approach divides the description into two parts, an operational model and a number of associated model properties. Starting from a tool-based software design with established structured methods that are basically suitable for the integration of mathematically precise techniques, proposals are made for the selective integration of formal methods into the description of properties of design components. By systematically checking these two views against each other, it is possible to detect and eliminate inconsistencies and errors in the modelling at an early stage of development. The presented approach aims at applying the advantages of a more formal approach to the development of automotive software in an industrial setting. For evaluation purposes, the presented concepts are applied to the software of a cruise control system.