ppxscal/embedding_network huggingface dataset:
Selected AI-related dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 95 (January 1986) (1986)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel
Authors: Elia Ardizzoni Alan A. Bertossi M. Cristina Pinotti
Venue: IEEE Transactions on Computers (2005)

Broadcast is an efficient and scalable way of transmitting data to an unlimited number of clients that are listening to a channel. Cyclically broadcasting data over the channel is a basic scheduling technique, which is known as flat scheduling. When multiple channels are available, a data allocation technique is needed to assign data to channels. Partitioning data among channels in an unbalanced way, depending on data popularities, is an allocation technique known as skewed allocation. In this paper, the problem of data broadcasting over multiple channels is considered, assuming skewed data allocation to channels and flat data scheduling per channel, with the objective of minimizing the average waiting time of the clients. First, several algorithms, based on dynamic programming, are presented which provide optimal solutions for N data items and K channels. Specifically, for data items with uniform lengths, an O(NK\log N) time algorithm is proposed, which improves over the previously known O(N^2K) time algorithm. When K \le 4, a simpler O(N\log N) time algorithm is exhibited which requires only O(N) time if the data items are sorted. Moreover, for data items with nonuniform lengths, it is shown that the problem is NP-hard when K=2 and strong NP-hard for arbitrary K. In the former case, a pseudopolynomial algorithm is discussed whose time is O(NZ), where Z is the sum of the data lengths. In the latter case, an algorithm is devised with time exponential in the maximum data length, which can optimally solve, in reasonable time, only small instances. For larger instances, a new heuristic is devised which is experimentally tested on some benchmarks whose popularities are characterized by Zipf distributions. Such experimental tests reveal that the new heuristic proposed here always outperforms the best previously known heuristic in terms of solution quality.
Self-timed communication platform for implementing high-performance systems-on-chip
Authors: Pasi Liljeberg, Juha Plosila, Jouni Isoaho
Venue: Integration, the VLSI Journal (2004)

This paper discusses design of a modular self-timed communication platform aimed for high-performance globally asynchronous locally synchronous system-on-chip applications. The platform is based on a concurrent multitopology bus architecture with pipelined locally controlled transfer stages. Behavioral specification, handshake timing analysis technique and asynchronous circuit solutions for transfer stages are presented. Synchronization problems in component and bus communication are solved using self-timed approach. Deadlock prevention is implemented in logic level as a local autonomous function within each transfer stage. Different topologies and their building blocks are analyzed in terms of throughput, latency and implementation cost. According to simulations using a 0.18 µm technology, the overall maximum performance varied between 4.9 and 6.6 Gword/s depending on communication pattern and the bus topology.
Evaluating an ambient display for the home
Authors: Sunny Consolvo, Jeffrey Towle
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present our experiences with evaluating an ambient display for the home using two different evaluation techniques: the recently proposed 'Heuristic Evaluation of Ambient Displays' and an in situ, 3-week long, Wizard of Oz evaluation. We compare the list of usability violations found in the heuristic evaluation to the set of problems that were discovered in the in situ evaluation. Overall, the 'Heuristic Evaluation of Ambient Displays' was effective - 75% of known usability problems were found by eight evaluators (39-55% were found by 3-5 evaluators). However, the most severe usability problem found in the in situ evaluation was not identified in the heuristic evaluation. Because the problem directly violated one of the heuristics, we believe that the problem is not with the heuristics, but rather that evaluators have minimal experience with ambient displays for the home.
An artificial life environment for autonomous virtual agents with multi-sensorial and multi-perceptive features: Research Articles
Authors: Toni Conde, Daniel Thalmann
Venue: Computer Animation and Virtual Worlds (2004)

Our approach is based on the multi-sensory integration of the standard theory of neuroscience, where signals of a single object coming from distinct sensory systems are combined. The acquisition steps of signals, filtering, selection and simplification intervening before proprioception, active and predictive perception are integrated into virtual sensors and a virtual environment. We will focus on two aspects: 1) the assignment problem: determining which sensory stimuli belong to the same virtual object and (2) the sensory recoding problem: recoding signals in a common format before combining them. We have developed three novel methodologies to map the information coming from the virtual sensors of vision, audition and touch as well as that of the virtual environment in the form of a &lsquo;cognitive map&rsquo;. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Access Hacks (Hacks)
Authors: Ken Bluttman
Venue:  (2005)

As part of the Microsoft Office suite, Access has become the industry's leading desktop database management program for organizing, accessing, and sharing information. But taking advantage of this product to build increasingly complex Access applications requires something more than your typical how-to book. What it calls for is Access Hacks from O'Reilly. This valuable guide provides direct, hands-on solutions that can help relieve the frustrations felt by users struggling to master the program's various complexities. For experienced users, Access Hacks offers a unique collection of proven techniques and tools that enable them to take their database skills and productivity to the next level. For Access beginners, it helps them acquire a firm grasp of the program's most productive features. A smart collection of insider tips and tricks, Access Hacks covers all of the program's finer points. Among the multitude of topics addressed, it shows users how to: work with Access in multi-user environmentsutilize SQL querieswork with external data and programsintegrate Access with third-party products Just imagine: a learning process without the angst. Well, Access Hacks delivers it with ease, thanks to these down-and-dirty techniques not collected together anywhere else. Part of O'Reilly's best-selling Hacks series, Access Hacks is based on author Ken Bluttman's two decades of real-world experience in database programming and business application building. It's because of his vast experiences that the book is able to offer such a deep understanding of the program's expanding possibilities.
Transformations of software models into performance models
Authors: Vittorio Cortellessa, Antinisca Di Marco, Paola Inverardi
Venue: Proceedings of the 27th international conference on Software engineering (2005)

It is widely recognized that in order to make performance validation an integrated activity along the software lifecycle it is crucial to be supported from automated approaches. Easiness to annotate software models with performance parameters (e.g. the operational profile) and automated translations of the annotated models into "ready-to-validate" models are the key challenges in this direction. Several methodologies have been introduced in the last few years to address these challenges. The tutorial introduces the attendance to the main methodologies for annotating and transforming software models into performance models.
A Two Level Approach for Scene Recognition
Authors: Le Lu, Kentaro Toyama, Gregory D. Hager
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Classifying pictures into one of several semantic categories is a classical image understanding problem. In this paper, we present a stratified approach to both binary (outdoor-indoor) and multiple category of scene classification. We first learn mixture models for 20 basic classes of local image content based on color and texture information. Once trained, these models are applied to a test image, and produce 20 probability density response maps (PDRM) indicating the likelihood that each image region was produced by each class. We then extract some very simple features from those PDRMs, and use them to train a bagged LDA classifier for 10 scene categories. For this process, no explicit region segmentation or spatial context model are computed. To test this classification system, we created a labeled database of 1500 photos taken under very different environment and lighting conditions, using different cameras, and from 43 persons over 5 years. The classification rate of outdoor-indoor classification is 93.8%, and theclassification rate for 10 scene categories is 90.1%. As a byproduct, local image patches can be contextually labeled into the 20 basic material classes by using Loopy Belief Propagation [33] as an anisotropic filter on PDRMs, producing an image-level segmentation if desired.
Book review: Object-Oriented Simulation with Hierarchical, Modular Models by Bernard P. Zeigler (Academic Press)
Venue: ACM SIGART Bulletin (1990)

Bernard Zeigler's book, titled "Object-Oriented Simulation with Hierarchical, Modular Models" and subtitled "Intelligent Agents and Endomorphic Systems", will be most valuable to individuals interested in model development to support simulation within an object oriented environment. This book may be easily read by people not familiar with the simulation literature or Zeigler's previous work. Ideally one should have some familiarity with the basic notions of object oriented design or programming, but even that is not really necessary. This review will summarize the work presented in this book and then conclude with a short critique with regard to the authors stated objective, to make accessible to broad audience "... the concepts of reusable, multifacetted, multi-abstraction, model bases and endomorphic systems".
A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem
Authors: Jesús M. Jorge
Venue: Journal of Global Optimization (2005)

The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria decision making. However, Q is in itself a difficult global optimization problem, whose local optima, frequently large in number, need not be globally optimal. Indeed, this is due to the fact that the feasible region of Q is, in general, a nonconvex set. In this paper we present a monotonically increasing algorithm that finds an exact, globally-optimal solution for Q. Our approach does not require any hypothesis on the boundedness of neither the efficient set EP nor the optimal objective value. The proposed algorithm relies on a simplified disjoint bilinear program that can be solved through the use of well-known specifically designed methods within nonconvex optimization. The algorithm has been implemented in C and preliminary numerical results are reported.
A cross-program investigation of students' perceptions of agile methods
Authors: Grigori Melnik, Frank Maurer
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Research was conducted on using agile methods in software engineering education. This paper explores the perceptions of students from five different academic levels of agile practices. Information has been gathered through the collection of quantitative and qualitative data over three academic years, and analysis reveals student experiences, mainly positive but also some negative. Student opinions indicate the preference to continue to use agile practices at the workplace if allowed. A way these findings may potentially be extrapolated to the industrial settings is discussed. Finally, this report should encourage other academics considering adoption of agile methods in their computer science or software engineering curricula.
Exploring the potential for using the grid to support health impact assessment modelling
Authors: David Piggott, Conor Teljeur, Alan Kelly
Venue: Parallel Computing (2004)

This paper explores the potential use of grid technology in healthcare, from the perspective of a European health authority in a Regional Healthcare Network (RHCN) seeking to model the effects of a proposed hospital closure programme. The paper reviews the strategic implications of using a 'grid-based' application to enable the collation and analyses of public health information (PHI) to support healthcare planning and capital development. The paper also considers relevant issues in relation to the analysis of data extracted from Electronic Health Records (EHR) systems and Patient Management Systems (PMS), across many hospitals and Primary Healthcare Centres (PHCC) in a region, via a grid-based application. The potential for the use of the grid to support PHI in compute and data intensive tasks is discussed, together with a proposed way forward for the development of a grid-based RHCN PHI service.The paper is based on an earlier paper presented by David Piggott at the First European HealthGrid Conference held in Lyons, France on 17th January 2003, together with subsequent research undertaken by Trinity College Dublin into the use of the grid to support healthcare impact assessment and planning applications.
The yellow active queue management algorithm
Authors: Chengnian Long, Bin Zhao, Xinping Guan, Jun Yang
Venue: Computer Networks and ISDN Systems (2005)

A new rate-based active queue management (AQM) algorithm, called Yellow, is proposed in the paper. Yellow uses the load factor (link utilization) as a main merit to manage congestion. To improve congestion control performance, a queue control function (QCF) is introduced as a secondary merit. The sufficient condition for globally asymptotic stability is presented based on Lyapunov theory. Furthermore, the principle for parameter settings is given based on the bounded stable conditions. We then illustrate that Yellow outperforms the recently proposed AQM algorithms in terms of link utilization, packet loss and robust performance through extensive simulations.
Polynomial operators and local smoothness classes on the unit interval
Authors: H. N. Mhaskar
Venue: Journal of Approximation Theory (2004)

We obtain a characterization of local Besov spaces of functions on [-1,1] in terms of algebraic polynomial operators. These operators are constructed using the coefficients in the orthogonal polynomial expansions of the functions involved. The example of Jacobi polynomials is studied in further detail. A by-product of our proofs is an apparently simple proof of the fact that the Cesàro means of a sufficiently high integer order of the Jacobi expansion of a continuous function are uniformly bounded.
Proposed mechanisms for coincidence detection in the auditory brainstem
Authors: Petr Marsalek, Petr Lansky
Venue: Biological Cybernetics (2005)

Sound localization in mammals uses two distinct neural circuits, one for low- and one for high-frequency bands. Recent experiments call for revision of the theory explaining how the direction of incoming sound is calculated. We propose such a revised theory. Our theory is based on probabilistic spiking and probabilistic delay of spikes from both sides. We have applied the mechanism originally proposed as an operation on spike trains resulting in multiplication of firing rates. We have adapted this mechanism for the case of synchronous spike trains. The mechanism has to detect spikes from both sides within a short time window. Therefore, in both circuits neurons act as coincidence detectors. In the excitatory low-frequency circuit we call the mechanism the excitatory coincidence detection, to distinguish it from the mechanism of the inhibitory coincidence detection in the high-frequency circuit. The times to first spike and gains of the two mechanisms are calculated. We show how the output gains of the mechanisms predict the dip within the human frequency sensitivity range. This dip has been described in human psychophysical experiments.
A P2P Approach for Membership Management and Resource Discovery in Grids
Authors: Carlo Mastroianni, Domenico Talia, Oreste Verta
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

As deployed Grids increase from tens to thousands of nodes, peer-to-peer (P2P) techniques and protocols can be used to implement scalable services and application in Grids. This paper proposes a P2P approach for handling two key services in Grid environments: membership management and resource discovery. The membership management service exploits the use of "contact nodes", i.e. of nodes elected within Virtual Organizations to facilitate the assignment of neighbours and the construction of interconnections between Grid nodes. The resource discovery service uses these interconnections to give Grid nodes the opportunity to explore the Grid and discover available resources. The paper analyzes the performance of the resource discovery service on Grid networks with different sizes.
A review of explanation methods for heuristic expert systems
Authors: Carmen Lacave, Francisco J. Diez
Venue: The Knowledge Engineering Review (2004)

Explanation of reasoning is one of the most important abilities an expert system should provide in order to be widely accepted. In fact, since MYCIN, many expert systems have tried to include some explanation capability. This paper reviews the methods developed to date for explanation in heuristic expert systems.
Impressions from the 1982 ACM Symposium on Lisp and Functional Programming
Authors: N. S. Sridharan
Venue: Issue 82 (October 1982) (1982)

I returned from this conference with three distinct impressions: firstly, having Alonzo Church, Barkley Rosser and Haskell Curry together as Honored Guests of the conference; secondly, being totally entertained by the "performer" Peter Henderson presenting a rational reconstruction of an Escher woodcut using recursive function definitions1; and feeling that there were a number of astute British scientists who were thinking about foundational issues, who may soon make fundamental contributions to novel ways of computing!
Extension of the S-procedure and analysis of the multidimensional control systems using linear matrix inequalities
Authors: L. B. Rapoport
Venue: Automation and Remote Control (2005)

Consideration was given to a generalization of the so-called S-procedure in the problem of sign-definiteness of the quadratic form under quadratic constraints. Application of the algebraic criterion obtained to analysis of the multidimensional control system was discussed. The results were formulated in terms of solvability of the linear matrix inequalities.
Chained DLS-ICBP Neural Networks with Multiple Steps Time Series Prediction
Authors: Qun Dai, Songcan Chen
Venue: Neural Processing Letters (2005)

Based on the circular back-propagation (CBP) network, the improved circular back-propagation (ICBP) neural network was previously put forward and exhibits more general architecture than the former. It has a favorable characteristic that ICBP is better than CBP in generalization and adaptation though the number of its adaptable weights is generally less than that of CBP. The forecasting experiments on chaotic time series, multiple-input multiple-output (MIMO) systems and the data sets of daily life water consumed quantity have proved that ICBP has better capabilities of prediction and approximation than CBP. But in the above predicting process, ICBP neglects inherent structural changes and time correlation in time series themselves. In other words, they do not take into account the influence of different distances between observations and the predicting point on forecasting performance. The principle of discounted least-square (DLS) formulates this influence exactly. In this paper, the DLS principle is borrowed to construct the learning algorithm of DLS-ICBP. On this basis we construct chained DLS-ICBP neural networks by combining a new kind of chain structure to DLS-ICBP and investigate multiple steps time series prediction. We prove that DLS-ICBP has better single and multiple step predictive capabilities than ICBP through experiments on the data sets of Benchmarks and water consumed quantity.
A Novel Update Propagation Module for the Data Provenance Problem: A Contemplating Vision on Realizing Data Provenance from Models to Storage
Authors: Abed Elhamid Lawabni, Changjin Hong, David H. C. Du, Ahmed H. Tewfik
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

To date, the systems approach to science, which emphasizes the connections among phenomena studied at different scales and by different disciplines, is causing dramatic changes in how scientific results are communicated. These changes drive a shift on how to propagate data with certain properties so that it can be used intelligently by others. In this work we elaborate on three major factors governing the propagation module of data provenance. The proposed propagation module provides an efficient solution for many critical problems in the management and provenance of scientific data. Unlike previous work, our work aims at realizing data provenance from models to storage. The natural representation of data as objects and its utility for capturing provenance has led us to consider a new storage architecture based on the object-based storage (OSD) technology. An outline of this framework is discussed.
Cerebellar model arithmetic computer with pseudo-bacterial genetic algorithm and its hardware acceleration
Authors: Masahiro Miwa, Takeshi Furuhashi, Motoaki Matsuzaki, Shigeru Okuma
Venue: Systems and Computers in Japan (2004)

The cerebellar model arithmetic computer (CMAC) is a kind of neural network that is capable of high-speed learning. In the use of the CMAC, various parameters must be defined, but it is difficult to set the parameters adequately. The pseudo-bacterial genetic algorithm (PBGA) is a kind of evolutionary computation which offers local search. This paper considers adequate determination of the location of the boundary line, which is one of the parameters of the CMAC. For that purpose the PBGA is applied, and PBGA&sol;CMAC, which realizes the efficient search of the boundary line of the CMAC, is proposed. Furthermore, since PBGA&sol;CMAC requires a large amount of computation, a hardware implementation is considered in order to improve the computation speed. The computation involved in the learning rules of the CMAC is divided into four stages, and the structure is implemented as a pipeline. The pipeline implementation produces read-after-write hazards for the granular cell values. However, it is shown that the difference in performance from conventional CMAC learning rule is small, indicating the possibility of achieving high-speed learning. The speed of PBGA&sol;CMAC hardware is improved to 140 times the speed of operation by software. In order to present a guide for PBGA&sol;CMAC hardware, the hardware volume is evaluated, and it is shown that it can be implemented with precision sufficient for practice. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 14&ndash;23, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10437