ppxscal/embedding_network huggingface dataset:
LearningOnWeb: development of a SCORM compliant learning management system
Authors: Norberto Henriques, Damyan Slavov, António José Mendes
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper describes in general terms a new SCORM compliant learning management system (LMS). currently under development at the University of Coimbra. This project pretends to develop an environment that provides a set of tools that will support a richer experience for both students and teachers, not only allowing the utilization of high quality contents, but especially facilitating the creation of good learning contexts where students and teachers can collaborate and create real learning communities.
An architecture for personal semantic web information retrieval system
Authors: Haibo Yu, Tsunenori Mine, Makoto Amamiya
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The semantic Web and Web service technologies have provided both new possibilities and challenges to automatic information processing. There are a lot of researches on applying these new technologies into current personal Web information retrieval systems, but no research addresses the semantic issues from the whole life cycle and architecture point of view. Web services provide a new way for accessing Web resources, but until now, they have been managed separately from traditional Web contents resources. In this poster, we propose a conceptual architecture for a personal semantic Web information retrieval system. It incorporates semantic Web, Web services and multi-agent technologies to enable not only precise location of Web resources but also the automatic or semi-automatic integration of hybrid Web contents and Web services.
Some Issues in Solving the Anomaly Detection Problem using Immunological Approach
Authors: Franciszek Seredynski, Pascal Bouvry
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Results of an experimental study of an anomaly detection system based on the paradigm of artificial immune systems (AISs) are presented. Network traffic data are mapped into antibodies or antigenes either by using selected general parameters of the traffic or by using selected protocols headers. Similarities between signatures of attackers and antibodies are measured either using Euclidean distance or normalized Hamming distance. We study the influence of different methods of generation of antibodies and the traffic data coding on the performance of the anomaly detection system.
Studying mathematical induction and recursive programming together
Authors: Keith Brandt, Margaret Richey
Venue: Journal of Computing Sciences in Colleges (2004)

Mathematical induction is a proof technique used throughout math-ematics, and recursion is a programming concept frequently used in computer science. This note will explore the parallel between induction proofs and recursive programs by providing several example problems that lead to an induction proof and a corresponding recursive program. We feel that students who are exposed to this parallel will gain a deeper understanding of both topics.
Making adiabatic circuits attractive for todays VLSI industry by multi-mode operation-adiabatic mode circuits
Authors: Stephan Henzler, Thomas Nirschl, Matthias Eireiner, Ettore Amirante, Doris Schmitt-Landsiedel
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Quasi adiabatic circuits like the efficient charge recovery logic (ECRL) are known to reduce dynamic power dissipation of digital CMOS circuits significantly. The possible operation frequencies have been continuously increased due to technology scaling. Anyway, the field of operation is limited to medium performance applications. If it was possible to operate a given adiabatic circuit also at extremely high frequencies there would be many new applications: A circuit working at a medium frequency most of the time and at high frequencies only for some burst mode operations could be implemented in adiabatic logic. This paper presents a new perspective of adiabatic circuits called adiabatic mode circuits. These circuits can be operated in a quasi adiabatic low-power mode but also in a high frequency domino mode if high speed data processing is required. Based on the 3-transistor DRAM cell a novel 3-transistor memory cell capable for adiabatic and conventional operation is presented. Thus new systems with a small total power consumption but temporarily high performance can be constructed.
Making the Kernel Responsible: A New Approach to Detecting & Preventing Buffer Overflows
Authors: William R. Speirs
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

This paper takes the stance that the kernel is responsible for preventing user processes from interfering with each other, and the overall secure operation of the system. Part of ensuring overall secure operation of the computer is preventing buffers in memory from having too much data written to them, overflowing them. This paper presents a technique for obtaining the writable bounds of any memory address. A new system call for obtaining these bounds, ptrbounds, is described that implements this technique. The system call was implemented in the Linux 2.4 kernel and can be used to detect most buffer overflow situations. Once an overflow has been detected it can be dealt with in a number of ways, including to limit the amount of information written to the buffer. Also, a method for accurately tracking the allocation of memory on the stack is proposed to enhance the accuracy of the technique. The intended use of ptrboundsis to provide programmers with a method for checking the bounds of pointers before writing data, and to automatically check the bounds of pointers passed to the kernel.
The United States and Russia Evaluate Plutonium Disposition Options with Multiattribute Utility Theory
Authors: John C. Butler, Alexander N. Chebeskov, James S. Dyer, Thomas A. Edmunds, Jianmin Jia, Vladimir I. Oussanov
Venue: Interfaces (2005)

At the end of the Cold War, the United States and Russia entered into agreements to reduce the numbers of nuclear weapons in their arsenals. The excess-weapons plutonium recovered from dismantled weapons is extremely toxic in the environment, and the National Academy of Sciences has characterized the possibility that it could fall into the hands of terrorists as a "clear and present danger." A team of operations research analysts supported the Office of Fissile Materials Disposition (OFMD) in the US Department of Energy (DOE) by developing a multiattribute utility (MAU) model to evaluate alternatives for the disposition of the excess-weapons plutonium. Russian scientists modified the model with the aid of the US team and used it to evaluate Russia's disposition alternatives.
A Dynamic Kernel Logit Model for the Analysis of Longitudinal Discrete Choice Data: Properties and Computational Assessment
Authors: Karthik K. Srinivasan, Hani S. Mahmassani
Venue: Transportation Science (2005)

This paper focuses on the application of the kernel logit formulation to model dynamic discrete choice data. A dynamic kernel logit (DKL) formulation with normal errors is presented to model unordered discrete choice panel data. Investigating the theoretical foundations of the kernel logit model, it is demonstrated that the mixed logit error structure converges in distribution asymptotically to a suitable multivariate normal error structure. This result provides support for both cross-sectional kernel logit (CKL) and DKL models with normal errors. The calibration, identification, and specification issues associated with the latter model are also discussed.The performance of the proposed DKL model is assessed from the perspective of computational efficiency and estimate accuracy relative to the multinomial probit (MNP) model using a series of numerical experiments. Complexity analysis reveals that the DKL has a lower computational complexity than the MNP frequency simulator, which has an exponential complexity. Thus, for choice situations with a large number of alternatives ( J) in each time period, and/or large number of time periods ( T), the DKL model is faster than the corresponding MNP by more than an order of magnitude. This is also confirmed by computational experiments conducted using 32 synthetic data sets. The computational performance of the DKL relative to MNP appears to be the result of a trade-off between the number of Monte-Carlo draws required, and the computational cost of each draw. With fewer than 25 alternatives ( JT), the results suggest that it is more advantageous to use the probit model (MNP) compared to the DKL. There appears to be little advantage in applying the kernel logit formulation relative to the MNP to cross-sectional data with a few alternatives.Regarding computational accuracy, the numerical results suggest that the parameter estimates of both models (MNP and DKL) are comparable and close to the true values from which the data sets were generated. However, both DKL and MNP formulations may lead to the maximization of a nonconcave objective function, resulting in flat log-likelihood functions, and identification problems.
Control-Flow Independence Reuse via Dynamic Vectorization
Authors: Alex Pajuelo, Antonio Gonzalez, Mateo Valero
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Current processors exploit out-of-order execution and branch prediction to improve instruction level parallelism. When a branch prediction is wrong, processors flush the pipeline and squash all the speculative work. However, control-flow independent instructions compute the same results when they re-enter the pipeline down the correct path. If these instructions are not squashed, branch misprediction penalty can significantly be reduced. In this paper we present a novel mechanism that detects control-flow independent instructions, executes them before the branch is resolved, and avoids their re-execution in the case of a branch misprediction. The mechanism can detect and exploit control-flow independence even for instructions that are far away from the corresponding branch and even out of the instruction window. Performance figures show that the proposed mechanism can exploit control-flow independence for nearly 50% of the mispredicted branches, which results in a performance improvement that ranges from 14% to 17,8% for realistic configurations of forthcoming microprocessors.
A Powerful Direct Mechanism for Optimal WWW Content Replication
Authors: Samee Ullah Khan, Ishfaq Ahmad
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained data replication, certain data objects, as opposed to a complete site, are duplicated at multiple servers. In this paper, we abstract the distributed system as an agent-based model wherein mobile agents on behalf of their nodes continuously compete for allocation and reallocation of data objects. However, since these agents do not have a global view of the system, the optimization process becomes highly local. This localization may encourage these selfish agents to alter the output of the resource allocation mechanism in their favor by misreporting critical data such as the objects' popularity. This paper proposes a game theoretical resource allocation mechanism involving selfish agents. The mechanism ensures that the agents do not misreport, always follow the rules, and that a global optima is achieved. The mechanism is extensively evaluated against some wellknown algorithms, such as: greedy, branch and bound, game theoretical auctions and genetic algorithms. The experimental results reveal that the mechanism provides excellent solution quality, while maintaining fast execution time.
UPC condition in polynomially bounded o-minimal structures
Authors: Rafał Pierzchała
Venue: Journal of Approximation Theory (2005)

We prove that UPC condition holds in o-minimal structures generated by some quasi-analytic classes of C∞ functions. We also give a sufficient and necessary condition for a bounded set A ⊂ R2 definable in some polynomially bounded o-minimal structure to be UPC.
Modeling Viral Spread by Random Scanning and Its Relationship with the Epidemiological Model
Authors: Masato Uchida
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

This paper derives a set of discrete time difference equations that models the spreading process of computer viruses such as Code-Red and Slammer. We show that the derived equations can well evaluate the effect of countermeasures such as patching and disconnecting, which are often used to stop computer viruses, based on simulations and theories. In addition, by showing an exact relationship between the derived equations and a logistic equation, we give a clear answer to the problem: Why does the dynamics of viral spread follow a logistic equation?
A type system for certified binaries
Authors: Zhong Shao, Valery Trifonov, Bratin Saha, Nikolaos Papaspyrou
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

A certified binary is a value together with a proof that the value satisfies a given specification. Existing compilers that generate certified code have focused on simple memory and control-flow safety rather than more advanced properties. In this article, we present a general framework for explicitly representing complex propositions and proofs in typed intermediate and assembly languages. The new framework allows us to reason about certified programs that involve effects while still maintaining decidable typechecking. We show how to integrate an entire proof system (the calculus of inductive constructions) into a compiler intermediate language and how the intermediate language can undergo complex transformations (CPS and closure conversion) while preserving proofs represented in the type system. Our work provides a foundation for the process of automatically generating certified binaries in a type-theoretic framework.
Live data views: programming pervasive applications that use "timely" and "dynamic" data
Authors: Jay Black, Paul Castro, Archan Misra, Jerome White
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

In the absence of generic programming abstractions for dynamic data in most enterprise programming environments, individual applications treat data streams as a special case requiring custom programming. With the growing number of live data sources such as RSS feeds, messaging and presence servers, multimedia streams, and sensor data. a general-purpose client-server programming model is needed to easily incorporate live data into applications. In this paper, we present Live Data Views, a programming abstraction that represents live data as a time-windowed view over a set of data streams. Live Data Views allow applications to create and retrieve stateful abstractions of dynamic data sources in a uniform manner, via the application of intra- and inter- stream operators. We provide details of our model and evaluate a proof-of-concept Live Data Views implementation to monitor traffic conditions on a highway. We also provide the preliminary design of a J2EE-based implementation, and outline some of the research challenges raised by this abstraction in a distributed computing environment.
Robust spoken document retrieval methods for misrecognition and out-of-vocabulary keywords
Authors: Hiromitsu Nishizaki, Seiichi Nakagawa
Venue: Systems and Computers in Japan (2004)

This paper describes a Japanese spoken document retrieval system that is robust for Out-of-Vocabulary (OOV) words. A standard approach to spoken document retrieval is to automatically transcribe spoken documents into word sequences, which can be directly matched against queries. In this approach, the documents including OOV words and words misrecognized as other words cannot be retrieved. To avoid this problem, we propose a novel method of spoken document retrieval considering OOV keywords. One approach we use is to create an index from multiple recognizer outputs to deal with transcribed documents including misrecognized words. The index becomes better to use multiple recognizers which have different characteristics from one another. The other is to use both word-based indexing for in-vocabulary keywords and syllable-based indexing for OOV keywords, then switch them according to in-vocabulary&sol;OOV keywords in the query. Evaluation results clearly show that this approach benefits from the advantages of both indexing methods and that the proposed technique is quite effective in robustly retrieving spoken documents. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 44&ndash;53, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10697
ELDORADO
Authors: John Feo, David Harper, Simon Kahan, Petr Konecny
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

This paper introduces Eldorado, a third generation multithreaded architecture. Previous Cray multithreaded systems were plagued by unreliable hardware and high costs. Eldorado corrects these problems by using many parts built for other commercial systems. Its compute processor is a 500 MHZ multithreaded processor architecturally similar to the MTA-2 processor; but its interconnection network, I/O subsystem, and service processors are borrowed from other Cray systems. Eldorado retains the programming model, operating system, and tools of the MTA-2. It has the same capability as the MTA-2 to tolerate latencies and achieve high performance on programs that run poorly on SMP clusters. We present several programming examples to illustrate performance and scalability in the presence of high memory and synchronization latencies
Representing Honey Bee Behavior for Recognition Using Human Trainable Models
Authors: Adam Feldman, Tucker Balch
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

Identifying and recording subject movements is a critical, but time-consuming step in animal behavior research. The task is especially onerous in studies involving social insects because of the number of animals that must be observed simultaneously. To address this, we present a system that can automatically analyze animal movements, and label them, by creating a behavioral model from examples provided by a human expert. Further, in conjunction with identifying movements, our system also recognizes the behaviors made up of these movements. Thus, with only a small training set of hand labeled data, the system automatically completes the entire behavioral modeling and labeling process. For our experiments, activity in an observation hive is recorded on video, that video is converted into location information for each animal by a vision-based tracker, and then numerical features such as velocity and heading change are extracted. The features are used in turn to label the sequence of movements for each observed animal, according to the model. Our approach uses a combination of kernel regression classification and hidden Markov model (HMM) techniques. The system was evaluated on several hundred honey bee trajectories extracted from a 15 minute video of activity in an observation hive.
Spectral characterization of cryptographic boolean functions satisfying the (extended) propagation criterion of degree l and order k
Authors: Michaël Quisquater, Bart Preneel, Joos Vandewalle
Venue: Information Processing Letters (2005)

The (extended) propagation criterion was defined in cryptography in order to analyze the security of cryptographic components with respect to differential cryptanalysis. In this paper, we obtain the spectral characterization of functions satisfying the (extended) propagation criterion of degree l and order k. This important problem was left open since the introduction of these functions more than ten years ago.
Natural Image Statistics for Natural Image Segmentation
Authors: Matthias Heiler, Christoph Schnörr
Venue: International Journal of Computer Vision (2005)

We integrate a model for filter response statistics of natural images into a variational framework for image segmentation. Incorporated in a sound probabilistic distance measure, the model drives level sets toward meaningful segmentations of complex textures and natural scenes. Despite its enhanced descriptive power, our approach preserves the efficiency of level set based segmentation since each region comprises two model parameters only. Analyzing thousands of natural images we select suitable filter banks, validate the statistical basis of our model, and demonstrate that it outperforms variational segmentation methods using second-order statistics.
A P2P genetic algorithm environment for the internet
Authors: K. C. Tan, M. L. Wang, W. Peng
Venue: Communications of the ACM (2005)

Effectively utilizing distributed computational resources while hiding the complexity of the network programming.
MailConfigurator: automatic configuration of e-mail accounts through Java mobile agents
Authors: Giacomo Cabri, Luca Ferrari, Letizia Leonardi
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

E-Mail is the most exploited service in the Internet. We present an application based on Java mobile agents to automatically perform required steps to register an account. The use of roles makes the development easier and the application adaptable, while the use of the Java technology improves portability. Even if our approach is used for e-mail account creation, our results can be applied to other scenarios.
Robust stability for delay Lur'e control systems with multiple nonlinearities
Authors: Yong He, Min Wu, Jin-Hua She, Guo-Ping Liu
Venue: Journal of Computational and Applied Mathematics (2005)

This paper deals with delay Lur'e control systems with multiple nonlinearities and time-varying structured uncertainties. First, some sufficient, and necessary and sufficient conditions for the existence of a Lyapunov functional in the extended Lur'e form with a negative definite derivative that guarantees delay-independent robust absolute stability are presented. Then, some new less conservative delay-dependent absolute stability criteria are derived that employ free weighting matrices to express the relationships between the terms in the Leibniz-Newton formula. All the criteria are based on linear matrix inequalities. Finally, a numerical example is presented to illustrate the effectiveness of the method.
Selected AI-Related Dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: ACM SIGART Bulletin (1990)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using DIALOG Information Services, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). The online file includes abstracts, which are not published in this listing, but the citations below do include reference to the published Dissertation Abstracts International (DAI), which contains the abstracts. Citations denoted by an MAI reference have abstracts in the published Masters Abstracts International. Other elements of the citation are author; university, degree, and, if available, number of pages; title; UMI order number and year-month of DAI; and one or more DAI subject descriptors chosen by the author of the dissertation. References are sorted by subject descriptor; in the event that there is more than one descriptor, the first is used. Within each descriptor, entries are sorted by author.