ppxscal/embedding_network huggingface dataset:
Rationale Behind the Design of the EduVisor Software Visualization Component
Authors: Jan Moons, Carlos De Backer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The EduVisor software visualization component is a new pedagogical tool specifically developed to address some wide-spread problems in teaching object-oriented technology to novice programmers. The visualization tool is integrated in a world-class IDE, and shows the students the structure of their own creations at runtime. EduVisor is based on a solid grounding in literature and over 25 years of combined experience in teaching a CS1 course. With this component we have set the goal of helping our students progress faster through the most difficult initial stages of programming.
Classification performance evaluation of single-layer perceptron with Choquet integral-based TOPSIS
Authors: Yi-Chung Hu
Venue: Applied Intelligence (2008)

This paper interprets an output of the single-layer perceptron as the synthetic evaluation of the similarity between the input pattern and two classes for two-class pattern classification problems. For this, an appropriate tool for multiple attribute decision making, TOPSIS, can be an appropriate tool. A novel single-layer perceptron based on the TOPSIS is proposed by measuring the grades of similarity between an input pattern and the typical patterns of the respective classes. To obtain the relative similarity in terms of certain distance measure, since the interaction among attributes cannot be ignored, the nonlinear Choquet integral with respect to the fuzzy measure is incorporated into the activation function. Moreover, a genetic algorithm-based method is designed to determine the connection weights, which are interpreted as the degrees of importance of the respective input signals. The experimental results further demonstrate that classification results obtained by the single-layer perceptron with the Choquet integral-based TOPSIS are comparable to those obtained by the other fuzzy or non-fuzzy classification methods.
Prediction of the impact point for spin and fin stabilized projectiles
Authors: Dimitrios N. Gkritzapis, Dionissios P. Margaris, Elias E. Panagiotopoulos, George Kaimakamis, Konstantinos Siassiakos
Venue: WSEAS Transactions on Information Science and Applications (2008)

A method for real time in flight prediction of the ground impact point of indirect fire projectiles is investigated. The projectiles is assumed to be both rigid (non-flexible), and rotationally symmetric about its spin axis launched at low and high pitch angles. A six degree of freedom projectile model solution is used to propagate the projectile state from an arbitrary point along the trajectory to the ground impact point. The projectiles manoeuvring motion depends on the most significant force and moment variations, in addition to gravity. The developed computational method gives satisfactory agreement with published data of verified experiments and computational codes on atmospheric projectile trajectory analysis for various initial firing flight conditions.
A bootstrap-based aggregate classifier for model-based clustering
Authors: José G. Dias, Jeroen K. Vermunt
Venue: Computational Statistics (2008)

In model-based clustering, a situation in which true class labels are unknown and that is therefore also referred to as unsupervised learning, observations are typically classified by the Bayes modal rule. In this study, we assess whether alternative classifiers from the classification or supervised-learning literature--developed for situations in which class labels are known--can improve the Bayes rule. More specifically, we investigate the performance of bootstrap-based aggregate (bagging) rules after adapting these to the model-based clustering context. It is argued that specific issues, such as the label-switching problem, have to be carefully addressed when using bootstrap methods in model-based clustering. Our two Monte Carlo studies show that classification based on the Bayes rule is rather stable and difficult to improve by bootstrap-based aggregate rules, even for sparse data. An empirical example illustrates the various approaches described in this paper.
Novel pathway compendium analysis elucidates mechanism of pro-angiogenic synthetic small molecule
Authors: Kristen A. Wieghaus, Erwin P. Gianchandani, Mikell A. Paige, Milton L. Brown, Edward A. Botchwey, Jason A. Papin
Venue: Bioinformatics (2008)

Motivation: Computational techniques have been applied to experimental datasets to identify drug mode-of-action. A shortcoming of existing approaches is the requirement of large reference databases of compound expression profiles. Here, we developed a new pathway-based compendium analysis that couples multi-timepoint, controlled microarray data for a single compound with systems-based network analysis to elucidate drug mechanism more efficiently. Results: We applied this approach to a transcriptional regulatory footprint of phthalimide neovascular factor 1 (PNF1)—a novel synthetic small molecule that exhibits significant in vitro endothelial potency—spanning 1–48 h post-supplementation in human micro-vascular endothelial cells (HMVEC) to comprehensively interrogate PNF1 effects. We concluded that PNF1 first induces tumor necrosis factor-alpha (TNF-α) signaling pathway function which in turn affects transforming growth factor-beta (TGF-β) signaling. These results are consistent with our previous observations of PNF1-directed TGF-β signaling at 24 h, including differential regulation of TGF-β-induced matrix metalloproteinase 14 (MMP14/MT1-MMP) which is implicated in angiogenesis. Ultimately, we illustrate how our pathway-based compendium analysis more efficiently generates hypotheses for compound mechanism than existing techniques. Availability: The microarray data generated as part of this study are available in the Gene Expression Omnibus ( http://www.ncbi.nlm.nih.gov/geo/). Contact:botchwey@virginia.edu; papin@virginia.edu Supplementary information:Supplementary data are available at Bioinformatics online.
Peptide Finder
Authors: Anastasia Alexandridou, George Th. Tsangaris, Konstantinos Vougas, Konstantina Nikita, George Spyrou
Venue: Bioinformatics (2008)

Summary: The identification of unknown amino acid sequences of peptides as well as protein identification is of great significance in proteomics. Here, we present a publicly available web application that facilitates a high resolution mapping of measured molecular masses to peptides and proteins, irrespectively of the enzyme/digestion method used. Furthermore, multi-filtering may be applied in terms of measured mass tolerance, molecular mass and isoelectric point range as well as pattern matching to refine the results. This approach serves complementary to the existing solutions for protein identification and gives insights in novel peptides discovery and protein identification at the cases where the identification scores from the other approaches may be below significance threshold. Peptide Finder has been proven useful in proteomics procedures with experimental data from MALDI-TOF. Availability: Peptide Finder web-application is available at http://bioserver-1.bioacademy.gr/Bioserver/PeptideFinder/. Contact: gspyrou@bioacademy.gr
SF1: introduction to ada
Authors: Michael B. Feldman
Venue: ACM SIGAda Ada Letters (2008)

Level - Beginner, but attendees should have some experience with a high-level programming language. This tutorial is designed for those who have some familiarity with a programming language, but who are new to Ada. In the morning, we will discuss the basics of programming in Ada, including types, packages, syntax rules, and other Ada programming constructs. In the afternoon, we will cover Ada's object-oriented programming and concurrent-programming features. Many examples will be shown; freely downloadable Ada programming environments and tools will be demonstrated.
Multi-granularity sampling for simulating concurrent heterogeneous applications
Authors: Melhem Tawk, Khaled Z. Ibrahim, Smail Niar
Venue: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems (2008)

Detailed or cycle-accurate/bit-accurate (CABA) simulation is a critical phase in the design flow of embedded systems. However, with increasing system complexity, full detailed simulation is prohibitively slower than the hardware being simulated. In this paper, we present an approach that uses the sampling technique to speed up the design flow of Multiprocessor System-on-Chip (MPSoC) systems. Based on the dynamic behavior of the applications running concurrently, our method dynamically chooses between multiple granularities of the sampling phase. The similarities of the execution phases for all possible granularities are first analyzed, then transitions between phase overlaps are discretized. To facilitate the detection of repetitions, one phase, with an appropriate granularity, is chosen per process. Unlike most other proposals, the associated performance is usually accurate enough not to need repeated resampling. The use of checkpointing in conjunction with our approach is simplified because the amount of the needed disk space is significantly reduced. Experimental results show that the simulation of concurrent heterogeneous applications can be accelerated by a factor of up to 60x, while maintaining an average performance estimation error lower than 5%.
Achieving evenhandedness in certified email system for contract signing
Authors: Kenji Imamoto, Jianying Zhou, Kouichi Sakurai
Venue: International Journal of Information Security (2008)

Certified email is a system which enables a sender to prove a receiver&#x2019;s receipt of email. Such a system can be used for applications related to electronic commerce on the Internet. This paper considers a situation where a sender or a receiver wants to change his/her mind due to the change of mail content value (e.g., stock, auction, gambling) during the transaction. We point out that no traditional certified email systems have been designed for such a case, thus one of the participants can be at a disadvantage. To avoid this problem, we propose an evenhanded certified email system in which each participant can change his/her choice, either cancel or finish the transaction, at any time during the transaction.
On the Stability and Accuracy of the Spectral Difference Method
Authors: Kris Abeele, Chris Lacor, Z. J. Wang
Venue: Journal of Scientific Computing (2008)

In this article, it is shown that under certain conditions, the spectral difference (SD) method is independent of the position of the solution points. This greatly simplifies the design of such schemes, and it also offers the possibility of a significant increase in the efficiency of the method. Furthermore, an accuracy and stability study, based on wave propagation analysis, is presented for several 1D and 2D SD schemes. It was found that higher than second-order 1D SD schemes using the Chebyshev---Gauss---Lobatto nodes as the flux points have a weak instability. New flux points were identified which produce accurate and stable SD schemes. In addition, a weak instability was also found in 2D third- and fourth-order SD schemes on triangular grids. Several numerical tests were performed to verify the analysis.
A skip-list approach for efficiently processing forecasting queries
Authors: Tingjian Ge, Stan Zdonik
Venue: Proceedings of the VLDB Endowment (2008)

Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support prediction queries over time series data. Prediction relies on model building which can be too expensive to be practical if it is based on a large number of data points. We propose to use statistical tests of hypotheses to choose a proper subset of data points to use for a given prediction query interval. This involves two steps: choosing a proper history length and choosing the number of data points to use within this history. Further, we use an I/O conscious skip list data structure to provide samples of the original data set. Based on the statistics collected for a query workload, which we model as a probability mass function (PMF) over query intervals, we devise a randomized algorithm that selects a set of pre-built models (PM's) to construct, subject to some maintenance cost constraint when there are updates. Given this set of PM's, we discuss interesting query processing strategies for not only point queries, but also range, aggregation, and JOIN queries. We conduct a comprehensive empirical study on real world datasets to verify the effectiveness of our approaches and algorithms.
Methodology for the use of DSSAT models for precision agriculture decision support
Authors: Kelly R. Thorp, Kendall C. DeJonge, Amy L. Kaleita, William D. Batchelor, Joel O. Paz
Venue: Computers and Electronics in Agriculture (2008)

A prototype decision support system (DSS) called Apollo was developed to assist researchers in using the Decision Support System for Agrotechnology Transfer (DSSAT) crop growth models to analyze precision farming datasets. Because the DSSAT models are written to simulate crop growth and development within a homogenous unit of land, the Apollo DSS has specialized functions to manage running the DSSAT models to simulate and analyze spatially variable land and management. The DSS has modules that allow the user to build model input files for spatial simulations across predefined management zones, calibrate the models to simulate historic spatial yield variability, validate the models for seasons not used for calibration, and estimate the crop response and environmental impacts of nitrogen, plant population, cultivar, and irrigation prescriptions. This paper details the functionality of Apollo, and presents the results of an example application.
Javert: fully automatic mining of general temporal properties from dynamic traces
Authors: Mark Gabel, Zhendong Su
Venue: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering (2008)

Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They express formal correctness requirements of an application's ordering of specific actions and events during execution, such as the strict alternation of acquisition and release of locks. Despite their importance, temporal specifications are often missing, incomplete, or described only informally. Many techniques have been proposed that mine such specifications from execution traces or program source code. However, existing techniques mine only simple patterns, or they mine a single complex pattern that is restricted to a particular set of manually selected events. There is no practical, automatic technique that can mine general temporal properties from execution traces. In this paper, we present Javert, the first general specification mining framework that can learn, fully automatically, complex temporal properties from execution traces. The key insight behind Javert is that real, complex specifications can be formed by composing instances of small generic patterns, such as the alternating pattern ((ab)) and the resource usage pattern ((ab c)). In particular, Javert learns simple generic patterns and composes them using sound rules to construct large, complex specifications. We have implemented the algorithm in a practical tool and conducted an extensive empirical evaluation on several open source software projects. Our results are promising; they show that Javert is scalable, general, and precise. It discovered many interesting, nontrivial specifications in real-world code that are beyond the reach of existing automatic techniques.
A Python Library for Provenance Recording and Querying
Authors: Carsten Bochner, Roland Gude, Andreas Schreiber
Venue: Provenance and Annotation of Data and Processes: Second International Provenance and Annotation Workshop, IPAW 2008, Salt Lake City, UT, USA, June 17-18, 2008. Revised Selected Papers (2008)

In many application domains the provenance of data plays an important role. It is often required to get store detailed information of the underlying processes that led to the data (e.g., results of numerical simulations) for the purpose of documentation or checking the process for compliance to applicable regulations. Especially in science and engineering more and more applications are being developed in Python, which is used either for development of the whole application or as a glue language for coordinating codes written in other programming languages. To easily integrate provenance recording into applications developed in Python, a provenance client library with a suitable Python API is useful. In this paper we present such a Python client library for recording and querying provenance information. We show an exemplary application, explain the overall architecture of the library, and give some details on the technologies used for the implementation.
Utilizing Wiki-Systems in higher education classes: a chance for universal access?
Authors: Martin Ebner, Michael Kickmeier-Rust, Andreas Holzinger
Venue: Universal Access in the Information Society (2008)

Wikis are a website technology for mass collaborative authoring. Today, wikis are increasingly used for educational purposes. Basically, the most important asset of wikis is free and easy access for end users: everybody can contribute, comment and edit&#x2014;following the principles of Universal access. Consequently, wikis are ideally suited for collaborative learning and a number of studies reported a great success of wikis in terms of active participation, collaboration, and a rapidly growing content. However, the wikis success in education was often linked either to direct incentives or even pressure. This paper strongly argues that this contradicts the original intentions of wikis and, furthermore, weakens the psycho-pedagogical impact. A study is presented which focuses on investigating the success of wikis in higher education, when students are neither enforced to contribute nor directly rewarded similar to the principles of Wikipedia. Amazingly, the results show that, in total, none of the N&#x00a0;=&#x00a0;287 students created new articles or edited existing ones during a whole semester. It is concluded that the use of Wiki-Systems in educational settings is much more complicated, and it needs more time to develop a kind of &#x201c;give-and-take&#x201d; generation.
Planning for Coordination and Coordination for Planning
Authors: Edmund H. Durfee
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

Except in very controlled or fortuitous circumstances, good coordination between agents does not spontaneously occur. In general, agents need to plan for coordination, anticipating how their activities can affect each other and choosing actions that dovetail well together to achieve their separate and common goals. Of course, this is easier said than done, since the potential space of agents' action and interaction sequences to consider is intractable. I discuss some technologies that make it practical to plan for good coordination by exploiting algorithmic, representational, and problem-specific structure. Furthermore, when conducted by the involved agents, the processes for planning coordination need to be coordinated themselves. Toward this end, I also outline meta-level strategies for coordinating the agents' planning processes.
Efficient likelihood evaluation and dynamic Gaussian selection for HMM-based speech recognition
Authors: Jun Cai, Ghazi Bouselmi, Yves Laprie, Jean-Paul Haton
Venue: Computer Speech and Language (2009)

LVCSR systems are usually based on continuous density HMMs, which are typically implemented using Gaussian mixture distributions. Such statistical modeling systems tend to operate slower than real-time, largely because of the heavy computational overhead of the likelihood evaluation. The objective of our research is to investigate approximate methods that can substantially reduce the computational cost in likelihood evaluation without obviously degrading the recognition accuracy. In this paper, the most common techniques to speed up the likelihood computation are classified into three categories, namely machine optimization, model optimization, and algorithm optimization. Each category is surveyed and summarized by describing and analyzing the basic ideas of the corresponding techniques. The distribution of the numerical values of Gaussian mixtures within a GMM model are evaluated and analyzed to show that computations of some Gaussians are unnecessary and can thus be eliminated. Two commonly used techniques for likelihood approximation, namely VQ-based Gaussian selection and partial distance elimination, are analyzed in detail. Based on the analyses, a fast likelihood computation approach called dynamic Gaussian selection (DGS) is proposed. DGS approach is a one-pass search technique which generates a dynamic shortlist of Gaussians for each state during the procedure of likelihood computation. In principle, DGS is an extension of both techniques of partial distance elimination and best mixture prediction, and it does not require additional memory for the storage of Gaussian shortlists. DGS algorithm has been implemented by modifying the likelihood computation procedure in HTK 3.4 system. Experimental results on TIMIT and WSJ0 corpora indicate that this approach can speed up the likelihood computation significantly without introducing apparent additional recognition error.
A rugged militarily fieldable mass store (MEM-BRAIN file)
Authors: W. A. Farrand, R. B. Horsfall, N. E. Marcum, W. D. Williams
Venue: Proceedings of the April 18-20, 1967, spring joint computer conference (1967)

Military systems often operate on a data base larger than is economically feasible for internal main store. Therefore, they require the use of auxiliary storage. There are many forms of auxiliary store. Each has characteristics which make it the optimum choice for certain tasks. Factors characterizing the domains of utility of some auxiliary storage systems are: Fixed Head Drums: Under 4 million bits Magnetic Real Tape Systems: Over 1/2 sec. average random access/block Woven Wire Systems: Under 10 million bits Tape Loop Systems: Under 50 million bits Roving Head Drums: Under 50 million bits Tape Strip Files: Over 1/2 sec. average random access (unit documents) Disk Pack Systems: 20--50 million bits/pack (interchangeable data base) Fixed Head Disk Files: Under 500 million bits Roving Head Disk Files: Under 100 ms average access and over 50 million bits