ppxscal/embedding_network huggingface dataset:
Project Management in Information System Development Education
Authors: Toyohiko Hirota
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

We have taught a laboratory course on system development at the School of Information Science of Kyushu Sangyo University since 2004. Based on our experience, we decided to address various problems of the education in information system development. We categorized these problems from three viewpoints. First, from the viewpoint of system development, the specific project and the method of development are important. Second, from the viewpoint of the project laboratory, it is difficult for students to do their projects effectively. Third, from the viewpoint of project management, it is a problem for both teachers and students to follow the progress of a project and to maintain control of it. In 2007, in order to solve these problems, we made several improvements, including adding Personal Software Process and Earned Value Management.
Sequential Bayesian prediction in the presence of changepoints
Authors: Roman Garnett, Michael A. Osborne, Stephen J. Roberts
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We introduce a new sequential algorithm for making robust predictions in the presence of changepoints. Unlike previous approaches, which focus on the problem of detecting and locating changepoints, our algorithm focuses on the problem of making predictions even when such changes might be present. We introduce nonstationary covariance functions to be used in Gaussian process prediction that model such changes, then proceed to demonstrate how to effectively manage the hyperparameters associated with those covariance functions. By using Bayesian quadrature, we can integrate out the hyperparameters, allowing us to calculate the marginal predictive distribution. Furthermore, if desired, the posterior distribution over putative changepoint locations can be calculated as a natural byproduct of our prediction algorithm.
Performance Evaluation of Collective Write Algorithms in MPI I/O
Authors: Mohamad Chaarawi, Suneet Chandok, Edgar Gabriel
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

MPI is the de-facto standard for message passing in parallel scientific applications. MPI-IO is a part of the MPI-2 specification defining file I/O operations in the MPI world. MPI-IO enables performance optimizations for collective file I/O operations as it acts as a portability layer between the application and the file system. The goal of this study is to optimize collective file I/O operations. Three different algorithms for performing collective I/O operations have been developed, implemented, and evaluated on a PVFS2 file system and over NFS. The results indicate that different algorithms promise the highest write bandwidth for different number of processors, application settings and file systems, making a one-size-fits-all solution inefficient. 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
3D Signatures for Fast 3D Face Recognition
Authors: Chris Boehnen, Tanya Peters, Patrick J. Flynn
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

We propose a vector representation (called a 3D signature) for 3D face shape in biometrics applications. Elements of the vector correspond to fixed surface points in a face-centered coordinate system. Since the elements are registered to the face, comparisons of vectors to produce match scores can be performed without a probe to gallery alignment step such as an invocation of the iterated closest point (ICP) algorithm in the calculation of each match score. The proposed 3D face recognition method employing the 3D signature ran more than three orders of magnitude faster than a traditional ICP based distance implementation, without sacrificing accuracy. As a result, it is feasible to apply distance based 3D face biometrics to recognition scenarios that, because of computational constraints, may have previously been limited to verification. Our use of more complex shape regions, which is a trivial task with the use of 3D signatures, improves biometric performance over simple spherical cut regions used previously [1]. Experimental results with a large database of 3D images demonstrate the technique and its advantages.
A global meta-analysis of microarray expression data to predict unknown gene functions and estimate the literature-data divide
Authors: Jonathan D. Wren
Venue: Bioinformatics (2009)

Motivation: Approximately 9334 (37%) of Human genes have no publications documenting their function and, for those that are published, the number of publications per gene is highly skewed. Furthermore, for reasons not clear, the entry of new gene names into the literature has slowed in recent years. If we are to better understand human/mammalian biology and complete the catalog of human gene function, it is important to finish predicting putative functions for these genes based upon existing experimental evidence. Results: A global meta-analysis (GMA) of all publicly available GEO two-channel human microarray datasets (3551 experiments total) was conducted to identify genes with recurrent, reproducible patterns of co-regulation across different conditions. Patterns of co-expression were divided into parallel (i.e. genes are up and down-regulated together) and anti-parallel. Several ranking methods to predict a gene's function based on its top 20 co-expressed gene pairs were compared. In the best method, 34% of predicted Gene Ontology (GO) categories matched exactly with the known GO categories for ~5000 genes analyzed versus only 3% for random gene sets. Only 2.4% of co-expressed gene pairs were found as co-occurring gene pairs in MEDLINE. Conclusions: Via a GO enrichment analysis, genes co-expressed in parallel with the query gene were frequently associated with the same GO categories, whereas anti-parallel genes were not. Combining parallel and anti-parallel genes for analysis resulted in fewer significant GO categories, suggesting they are best analyzed separately. Expression databases contain much unexpected genetic knowledge that has not yet been reported in the literature. A total of 1642 Human genes with unknown function were differentially expressed in at least 30 experiments. Availability: Data matrix available upon request. Contact: jdwren@gmail.com Supplementary information: Supplementary data are available at Bioinformatics online. 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
What's mine is mine; what's yours is mine: private ownership of ICTs as a threat to transparency
Authors: Ronnie Cohen, Janine S. Hiller
Venue: Ethics and Information Technology (2009)

In the face of ubiquitous information communication technology, the presence of blogs, personal websites, and public message boards give the illusion of uncensored criticism and discussion of the ethical implications of business activities. However, little attention has been paid to the limitations on free speech posed by the control of access to the Internet by private entities, enabling them to censor content that is deemed critical of corporate or public policy. The premise of this research is that transparency alone will not achieve the desired results if ICT is used in a one way system, controlled by the provider of information. Stakeholders must have an avenue using the same technology to respond to and interact with the information. We propose a model that imposes on corporations a public trust, requiring these gatekeepers of communication technology to preserve individual rights to criticism and review.
Intention Is Commitment with Expectation- An Amendement to the Cohen-Levesque Theory of Intention
Authors: James Creel
Venue:  (2007)

In the interest of rigorous reasoning about agents and their interaction with environments, much work has been devoted to characterizing the nature of intention and its role in cognition and action. Logicians and computer scientists have developed numerous formal systems capturing various aspects of the philosophically established desiderata for a notion of intention. Philip Cohen and Hector Levesque give perhaps the most famous and venerable formal logic of intention in their paper "Intention Is Choice with Commitment." However, Munindar Singh has given a profound criticism of that theory, showing, among other things, that under the theory agents can bring about their intentions simply by virtue of having them without necessarily taking action. This work presents an amended version of the original logic, which preserves the advantages of the original while addressing Singh's criticisms. The motivations for the amendments reveal an oft-ignored desiderata for intention: that action is not intended for its own sake, but rather for an intended outcome. This work is addressed to logicians and computer scientists interested in the formalization of rational agency. 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
Towards a Lightweight HPF Compiler
Authors: Hidetoshi Iwashita, Kohichiro Hotta, Sachio Kamiya, Matthijs Waveren
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

The UXP/V HPF compiler, that has been developed for the VPP series vector-parallel supercomputers, extracts the highest performance from the hardware. However, it is getting difficult for developers to concentrate on a specific hardware. This paper describes a method of developing an HPF compiler for multiple platforms without losing performance. Advantage is taken of existing technology. The code generator and runtime system of VPP Fortran are reused for high-end computers; MPI is employed for general distributed environments, such as a PC cluster. Following a performance estimation on different systems, we discuss effectiveness of the method and open issues.
A method to retrieve telops based on the distance of character image features between queries and telops
Authors: Masami Shishibori, Nobuki Nishikawa, Kenji Kita
Venue: International Journal of Computer Applications in Technology (2009)

Video scene retrieval methods based on telop characters can retrieve the corresponding scenes to the query from the huge video data. In this paper, a new video scene retrieval method based on telop characters is proposed. In order to specify the suitable scene, this method recognises the only corresponding telop characters to the query keyword, not all the characters. This method calculates the distance between each image features of telop characters and template image features of query keyword. The number of distance calculations can decrease by indexing the multi-dimensional data for image features of telop characters. Experimental results, using 91 query keywords, show that the average precision of the proposed method using the 1-gram feature becomes 98.61&#37; and using the 2-gram feature becomes 99.59&#37;. Moreover, the retrieval time can be obtained in about 0.5 sec when using the 2-gram feature.
Plenary lecture 1: particle methods applied in biology and chemistry
Authors: Franck Assous
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

Particle method is a well-known approach that has been used for a long time in charged particle beams or plasma physics modeling. In recent years, particle based methods have become widespread tools for approximating solutions of ordinary/partial differential equations in a variety of fields. In these methods, a solution of a given equation is represented by a finite set of particles, located in points xi and carrying masses ωi. Equations of evolution in time are then written to describe the dynamics of the location of the particles and their weights. The aim of this lecture is to show that this method can provide a useful tool of simulation in biology and chemistry. In the first part, we recall the principles and the basic properties of the particle method. Numerical and algorithm considerations are also exposed. In the second part, examples of reformulation of problems from other fields, like chemistry and biology, which allow the use of particle based modeling, are presented.
A novel graph based approach for automatic composition of high quality grid workflows
Authors: Jun Qin, Thomas Fahringer, Radu Prodan
Venue: Proceedings of the 18th ACM international symposium on High performance distributed computing (2009)

The workflow paradigm is one of the most important programming models for the Grid. The composition of Grid workflows has been widely studied in the Grid community. However, there is still a lack of a general and efficient approach for automatic composition of Grid workflows. In this paper, we present a STRIPS (Stanford Research Institute Problem Solver) based formal definition of the Grid workflow composition problem, followed by a novel graph based algorithm for automatic composition of high quality (portable, fault tolerant and optimized) Grid workflows. Our algorithm searches for semantic descriptions of workflow activities, i.e., Activity Functions (AFs), defined by ontologies and composes them into Grid workflows using AF Data Dependence (ADD) graphs. The composition process consists of three phases: ADD graph creation, workflow extraction, and workflow optimization. The worst case complexity of our algorithm is quadratic in the number of AFs. An extension of our algorithm to compose Grid workflows with branches and loops is also presented. Experimental results illustrate the effectiveness and efficiency of our approach: (i) the measured worst case execution time of our algorithm further proofs the analyzed time complexity; (ii) the composition of the real world meteorology Grid workflow application MeteoAG with our algorithm takes approximate half a second; and (iii) the execution time of the MeteoAG workflow when running on the Austrian Grid is reduced by up to 25% and the speedup is increased by up to 2.24 by applying our workflow optimization techniques.
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
Authors: Dorit Aharonov, Vaughan Jones, Zeph Landau
Venue: Algorithmica (2009)

The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field Theory ( ). The works of Freedman, Kitaev, Larsen and Wang provide an efficient simulation of by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient (namely, polynomial) quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, e 2&pi; i/5, and moreover, that this problem is -complete. Unfortunately, this important algorithm was never explicitly formulated. Moreover, the results of Freedman et al. are heavily based on , which makes the algorithm essentially inaccessible to computer scientists. We provide an explicit and simple polynomial quantum algorithm to approximate the Jones polynomial of an n strands braid with m crossings at any primitive root of unity e 2&pi; i/k , where the running time of the algorithm is polynomial in m, n and k. Our algorithm is based, rather than on , on well known mathematical results (specifically, the path model representation of the braid group and the uniqueness of the Markov trace for the Temperley-Lieb algebra). By the results of Freedman et al., our algorithm solves a complete problem. Our algorithm works by encoding the local structure of the problem into the local unitary gates which are applied by the circuit. This structure is significantly different from previous quantum algorithms, which are mostly based on the Quantum Fourier transform. Since the results of the current paper were presented in their preliminary form, these ideas have been extended and generalized in several interesting directions. Most notably, Aharonov, Arad, Eban and Landau give a simplification and extension of these results that provides additive approximations for all points of the Tutte polynomial, including the Jones polynomial at any point, and the Potts model partition function at any temperature and any set of coupling strengths. We hope and believe that the ideas presented in this work will have other extensions and generalizations.
Dynamic interaction networks in modelling and predicting the behaviour of multiple interactive stock markets
Authors: Harya Widiputra, Russel Pears, Antoaneta Serguieva, Nikola Kasabov
Venue: International Journal of Intelligent Systems in Accounting and Finance Management (2009)

The behaviour of multiple stock markets can be described within the framework of complex dynamic systems. A representative technique of the framework is the dynamic interaction network (DIN), recently developed in the bioinformatics domain. DINs are capable of modelling dynamic interactions between genes and predicting their future expressions. In this paper, we adopt a DIN approach to extract and model interactions between stock markets. The network is further able to learn online and updates incrementally with the unfolding of the stock market time-series. The approach is applied to a case study involving 10 market indexes in the Asia Pacific region. The results show that the DIN model reveals important and complex dynamic relationships between stock markets, demonstrating the ability of complex dynamic systems approaches to go beyond the scope of traditional statistical methods. Copyright &copy; 2009 John Wiley & Sons, Ltd.
A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
Authors: Zuqiang Meng, Zhongzhi Shi
Venue: Information Sciences: an International Journal (2009)

Efficient attribute reduction in large, incomplete decision systems is a challenging problem; existing approaches have time complexities no less than O(|C|^2|U|^2). This paper derives some important properties of incomplete information systems, then constructs a positive region-based algorithm to solve the attribute reduction problem with a time complexity no more than O(|C|^2|U|log|U|). Furthermore, our approach does not change the size of the original incomplete system. Numerical experiments show that the proposed approach is indeed efficient, and therefore of practical value to many real-world problems. The proposed algorithm can be applied to both consistent and inconsistent incomplete decision systems.
Evaluating ASP and commercial solvers on the CSPLib
Authors: Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This paper deals with three solvers for combinatorial problems: the commercial state-of-the-art solver Ilog OPL, and the research ASP systems DLV and SMODELS. The first goal of this research is to evaluate the relative performance of such systems, using a reproducible and extensible experimental methodology. In particular, we consider a third-party problem library, i.e., the CSPLib, and uniform rules for modelling and selecting instances. The second goal is to analyze the effects of a popular reformulation technique, i.e., symmetry breaking, and the impact of other modelling aspects, like global constraints and auxiliary predicates. Results show that there is not a single solver winning on all problems, and that reformulation is almost always beneficial: symmetry-breaking may be a good choice, but its complexity has to be carefully chosen, by taking into account also the particular solver used. Global constraints often, but not always, help OPL, and the addition of auxiliary predicates is usually worth, especially when dealing with ASP solvers. Moreover, interesting synergies among the various modelling techniques exist.
penalizedSVM
Authors: Natalia Becker, Wiebke Werft, Grischa Toedt, Peter Lichter, Axel Benner
Venue: Bioinformatics (2009)

Summary: Support vector machine (SVMs) classification is a widely used and one of the most powerful classification techniques. However, a major limitation is that SVM cannot perform automatic gene selection. To overcome this restriction, a number of penalized feature selection methods have been proposed. In the R package ‘penalizedSVM’ implemented penalization functions L1 norm and Smoothly Clipped Absolute Deviation (SCAD) provide automatic feature selection for SVM classification tasks. Availability: The R package ‘penalizedSVM’ is available from the Comprehensive R Archive Network ( http://cran.r-project.org/) under GPL-2 or later. Contact: natalia.becker@dkfz.de Supplementary information:Supplementary data are available at Bioinformatics online.
An artificial neural network digital design for time difference of arrival method used on passive multistatic radars
Authors: Nikos J. Farsaris
Venue: Proceedings of the 10th WSEAS international conference on Neural networks (2009)

The paper briefly describes the use of artificial neural networks for time difference of arrival method of acquisition and tracking of maneuverable and ballistic targets. For real time target detection a second order recurrent artificial neural network is designed and simulated in order to examine the capabilities and limitations of such a system. Simulation of target trajectories are made proving that a system implementing the above methods can be constructed and exploited as a tracking radar with the obvious advantages of a passive system (no transmitted power in radar bands) and modest gain antennas (of small dimensions thus easily portable or mobile).
EXPERTIUS: A Mexican Judicial Decision-Support System in the Field of Family Law
Authors: Enrique Cáceres
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

EXPERTIUS is the first Mexican AI and Law application. The system advices upon the determination of whether someone is entitled or not to a financial pension (under the so called “feeding obligation”), and upon the determination of the amount of that pension. EXPERTIUS is based on a multi-layered knowledge representation. At the first layer lies the so called heuristic or compiled knowledge needed to solve cognitive tasks. A set of cognitive tasks is associated to a set of decisions internal to particular procedural phases. A dialogical-confrontation structure supervenes on the decisions taken in the intermediate level.
Time series applied in Romanian economy
Authors: Daniela Damian, Neculai Patrascu, Claudia-Georgeta Carstea, Lucian Patrascu, Ioan-Gheorghe Ratiu, Nicoleta David
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This article presents a practical application of time series analysis in Romanian economy. Time series-based forecasting possesses has wide practical applications due to its capabilities for accurate prediction, using past values, with small error. Time series forecasting often uses Box-Jenkins Methodology also known as ARIMA. The subject of time series is of considerable interest, especially among researchers in economics, engineering, medicine and so on. The outstanding Integrated Auto Regressive Moving Average Model ARIMA (p, d, q) is widespread and very used in Finance and Economics.