ALBERT

Description: This paper describes the Ontologies of Linguistic Annotation (OLiA) as one of the data sets currently available as part of Linguistic Linked Open Data (LLOD) cloud. Within the LLOD cloud, the OLiA ontologies serve as a reference hub for annotation terminology for linguistic phenomena on a great band-width of languages, they have been used to facilitate interoperability and information integration of linguistic annotations in corpora, NLP pipelines, and lexical-semantic resources and mediate their linking with multiple community-maintained terminology repositories. Content Type Journal Article Pages - DOI 10.3233/SW-140167 Authors Christian Chiarcos, Applied Computational Linguistics (ACoLi), Department of Computer Science and Mathematics, Goethe-University Frankfurt am Main, Germany, http://acoli.cs.uni-frankfurt.de Maria Sukhareva, Applied Computational Linguistics (ACoLi), Department of Computer Science and Mathematics, Goethe-University Frankfurt am Main, Germany, http://acoli.cs.uni-frankfurt.de Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: This paper describes the publication and linking of (parts of) PAROLE SIMPLE CLIPS (PSC), a large scale Italian lexicon, to the Semantic Web and the Linked Data cloud using the lemon model. The main challenge of the conversion is discussed, namely the reconciliation between the PSC semantic structure which contains richly encoded semantic information, following the qualia structure of the Generative Lexicon theory and the lemon view of lexical sense as a reified pairing of a lexical item and a concept in an ontology. The result is two datasets: one consists of a list of lemon lexical entries with their lexical properties, relations and senses; the other consists of a list of OWL individuals representing the referents for the lexical senses. These OWL individuals are linked to each other by a set of semantic relations and mapped onto the SIMPLE OWL ontology of higher level semantic types. Content Type Journal Article Pages - DOI 10.3233/SW-140168 Authors Riccardo Del Gratta, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Francesca Frontini, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Fahad Khan, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Monica Monachini, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: The decentralized many-to-many negotiation for resource allocation in Cloud and multi-agent systems presents numerous challenges, including ones related to the buyer strategy which is the focus of the present paper. Current approaches deriving required resources each bid must ask for aren't in all market cases an optimal choice. For this reason, we have proposed a hybrid negotiation strategy consisting of a combination of two modes of negotiation strategies that generates required resources of each bid in parallel, the first one is an existent fixed negotiation strategy and the second one is a learning selection strategy over the buyer's agreement space. Moreover, acting dynamically in the market place by adjusting appropriately the buyer's resource provisioning times and calling for proposal to hand over contracted resources in order to break some deadlocks involving buyers' tasks has been shown via simulation results to achieve better performances both in terms of social welfare and buyer utility. Content Type Journal Article Pages 165-183 DOI 10.3233/MGS-140221 Authors Mohamed Raouf Habes, Department of Computer Science, University of Badji Mokhtar, Annaba, Algeria Habiba Belleili-Souici, Department of Computer Science, University of Badji Mokhtar, Annaba, Algeria Laurent Vercouter, INSA de Rouen, Saint-Etienne du Rouvray, France Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 10 Journal Issue Volume 10, Number 3 / 2014

Description: In future energy systems, peaks in the daily electricity generation and consumption are expected to increase. The "smart grid" concept aims to maintain high levels of efficiency in the energy system by establishing distributed intelligence. Software agents (operating on devices with unknown computational capabilities) can implement dynamic and autonomous decision making about energy usage and generation, e.g. in domestic households, farms or offices. To reach satisfactory levels of efficiency and reliability, it is crucial to include planning-ahead of the energy-involving activities. Market mechanisms are a promising approach for large-scale coordination problems about energy supply and demand, but existing electricity markets either do not involve planning-ahead sufficiently or require a high level of sophistication and computing power from participants, which is not suitable for smart grid settings. This paper proposes a new market mechanism for smart grids, ABEM (Ahead- and Balancing Energy Market). ABEM performs an ahead market and a last-minute balancing market, where planning-ahead in the ahead market supports both binding ahead-commitments and reserve capacities in bids (which can be submitted as price functions). These features of planning-ahead reflect the features in modern wholesale electricity markets. However, constructing bids in ABEM is straightforward and fast. We also provide a model of a market with the features mentioned above, which a strategic agent can use to construct a bid (e.g. in ABEM), using a decision-theoretic approach. We evaluate ABEM experimentally in various stochastic scenarios and show favourable outcomes in comparison with a benchmark mechanism. Content Type Journal Article Pages 137-163 DOI 10.3233/MGS-140220 Authors Nicolas Höning, Centrum Wiskunde en Informatica, Amsterdam, The Netherlands Han La Poutré, Centrum Wiskunde en Informatica, Amsterdam, The Netherlands Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 10 Journal Issue Volume 10, Number 3 / 2014

Description: The Belief-Desire-Intention (BDI) model of agency provides a powerful technique for describing goal-based behavior for both individual agents and, more recently, agent teams. Numerous frameworks have been developed since the model was first proposed in the early 1980's. However, none of these frameworks have explicitly represented intention, which has meant that intention-based reasoning has had no direct framework support. Given the importance of this in the development of practical agent applications, we consider this to be a major shortcoming of existing frameworks. This paper explores how explicitly represented goals can be used as both a unifying modeling concept for the management of intention, and as the basis for a BDI framework. The exploration is grounded both in terms of software – a recently developed BDI framework called GORITE and in application – an execution system for a robotic assembly cell. Both are discussed in detail. Content Type Journal Article Pages 119-136 DOI 10.3233/MGS-140219 Authors D. Jarvis, School of Engineering and Technology, Central Queensland University, Brisbane, Queensland, Australia J. Jarvis, School of Engineering and Technology, Central Queensland University, Brisbane, Queensland, Australia R. Rönnquist, Intendico Pty. Ltd., Carlton, Australia Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 10 Journal Issue Volume 10, Number 3 / 2014

Description: In recent years, Bayesian Network has become an important modeling method for decision making problems of real-world applications. In this paper learning parameters of a fuzzy Bayesian Network (BN) based on imprecise/fuzzy observations is considered, where imprecise observations particularly refers to triangular fuzzy numbers. To achieve this, an extension to fuzzy probability theory based on imprecise observations is proposed which employs both the "truth" concept of Yager and the Extension Principle in fuzzy set theory. In addition, some examples are given to demonstrate the concepts of the proposed idea. The aim of our suggestion is to be able to estimate joint fuzzy probability and the conditional probability tables (CPTs) of Bayesian Network based on imprecise observations. Two real-world datasets, Car Evaluation Database (CED) and Extending Credibility (EC), are employed where some of attributes have crisp (exact) and some of them have fuzzy observations. Estimated parameters of the CED's corresponding network, using our extension, are shown in tables. Then, using Kullback-Leibler divergence, two scenarios are considered to show that fuzzy parameters preserve more knowledge than that of crisp parameters. This phenomenon is also true in cases where there are a small number of observations. Finally, to examine a network with fuzzy parameters versus the network with crisp parameters, accuracy result of predictions is provided which shows improvements in the predictions. Content Type Journal Article Pages 167-180 DOI 10.3233/KES-140296 Authors Mostafa Ghazizadeh-Ahsaee, Ferdowsi University of Mashhad, Mashhad, Iran Mahmoud Naghibzadeh, Ferdowsi University of Mashhad, Mashhad, Iran Bahram Sadeghpour Gildeh, Ferdowsi University of Mashhad, Mashhad, Iran Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014

Description: This paper presents an interactive verifier for logic programs. These logic programs are constructed by a schema-based method. Each program is associated with proof schemes due to the program development method. The correctness proof of a program is guided by its associated proof schemes. The main components of the verifier are the prover which carries out the proof steps, the knowledge base (KB) which includes representations of all theories and transformation rules, the KB update which supports the update of KB and the graphical user interface (GUI). The emphasis in the design of this proof checker is on effective guidance of the proof based on the activated proof schemes and on performance by the verifier of tedious, trivial and time consuming tasks. The difficult proof decisions are taken by the user, then, the proof checker applies them. The design of the interface is based on providing the user the required support for the proof of a theorem and for the update of KB. This system is an effective and useful tool for the interactive verification of non-trivial logic programs. Content Type Journal Article Pages 143-156 DOI 10.3233/KES-140294 Authors Emmanouil Marakakis, Department of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Greece Haridimos Kondylakis, Department of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Greece Nikos Papadakis, Department of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Greece Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014

Description: We concern the issue of preference recommendation towards more reliable recommender system. General recommender system provides a collection of items or several bests of them, on the basis of a fixed preference constraint. However, the realistic preference from users may be such complicated that makes conventional recommender system unreliable. In real-world applications, e.g. travel planning or hotel selection, specific constraints may be involved like a limited travel time or an appropriate budget for hotel accommodation. Motivated by these applications, we investigate the constrained preference recommendation (CPR), in which two main types are studied including Threshold-CPR (T-CPR) and Range-CPR (R-CPR). We firstly analyze and define the related problems. Then, we provide solutions with illustration of problem-solving procedure. The results are analogized with other representative techniques. Finally, we provide an extension study on the general CPR problems. Therein, we firstly provide a normalized system for constraint representation. Secondly, we utilize the proposed normalized system to analyze representative literature. Content Type Journal Article Pages 157-165 DOI 10.3233/KES-140295 Authors Anming Li, Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong, China Junyi Chai, Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong, China Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014

Description: The purpose of security checks at airports is to achieve a reduction in the risk of malevolent attacks on the aviation system. The introduction of new security measures aims at reducing this perceived level of risk, and often takes place as a direct reaction to (attempted) attacks. This procedure means that offenders remain one step ahead of security agents. The aim of the approach presented here is to overcome this shortfall by supporting decision-making in the context of airport security by a systematically created knowledge base. The combination of two well-accepted methods – scenario analysis and structural complexity management – supports a structured knowledge acquisition process that serves as a basis for the proactive identification of system weaknesses. Furthermore, this combination of methods can be applied to the search for optimisation potentials concerned with possible future threats. The basis for the approach is composed of threat scenario components, security measures and dependencies between these elements. A Multiple-Domain Matrix is applied for system modelling. Clustering of threat scenarios and intensity of relations to security measures are used for analysis. The interpretation of findings makes use of portfolio representations. Content Type Journal Article Pages 191-200 DOI 10.3233/KES-140300 Authors Mara Cole, Bauhaus Luftfahrt e.V., Munich, Germany Maik Maurer, Institute of Product Development, Technische Universität München, Garching, Germany Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014

Description: A generalized Bayesian inference nets model (GBINM) to aid developers to construct self-adaptive Bayesian inference nets for various applications and a new approach of defining and assigning statistical parameters to Bayesian inference nodes needed to calculate propagation of probabilities and address uncertainties are proposed. GBINM and the proposed approach are applied to design an intelligent medical system to diagnose cardiovascular diseases. Thousands of site-sampled clinical data are used for designing and testing such a constructed system. The preliminary diagnostic results show that the proposed methodology has salient validity and effectiveness Content Type Journal Article Pages 181-190 DOI 10.3233/KES-140299 Authors Booma Devi Sekar, Department of ECE, Faculty of Science and Technology, University of Macau, Macau, China Mingchui Dong, Department of ECE, Faculty of Science and Technology, University of Macau, Macau, China Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014

Description: This paper presents a cost optimization model for scheduling scientific workflows on IaaS clouds such as Amazon EC2 or RackSpace. We assume multiple IaaS clouds with heterogeneous virtual machine instances, with limited number of instances per cloud and hourly billing. Input and output data are stored on a cloud object store such as Amazon S3. Applications are scientific workflows modeled as DAGs as in the Pegasus Workflow Management System. We assume that tasks in the workflows are grouped into levels of identical tasks. Our model is specified using mathematical programming languages (AMPL and CMPL) and allows us to minimize the cost of workflow execution under deadline constraints. We present results obtained using our model and the benchmark workflows representing real scientific applications in a variety of domains. The data used for evaluation come from the synthetic workflows, from general purpose cloud benchmarks, as well as from the data measured in our own experiments with Montage, an astronomical application, executed on Amazon EC2 cloud. We indicate how this model can be used for scenarios that require resource planning for scientific workflows and their ensembles. Content Type Journal Article Pages - DOI 10.3233/SPR-140406 Authors Maciej Malawski, Department of Computer Science AGH, Kraków, Poland Kamil Figiela, Department of Computer Science AGH, Kraków, Poland Marian Bubak, Department of Computer Science AGH, Kraków, Poland Ewa Deelman, USC Information Sciences Institute, Marina del Rey, CA, USA Jarek Nabrzyski, Center for Research Computing, University of Notre Dame, Notre Dame, IN, USA. E-mails: malawski@agh.edu.pl, kfigiela@agh.edu.pl, bubak@agh.edu.pl, deelman@isi.edu, naber@nd.edu Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: Semantic Web services frameworks provides the means to automatically discover, rank, compose and invoke services according to user requirements and preferences. However, current preference models offer limited expressiveness and they are tightly coupled with underlying discovery and ranking mechanisms. Furthermore, these mechanisms present performance, interoperability and integration issues that prevent the uptake of semantic technologies in these scenarios. In this work, we discuss three interrelated contributions on preference modeling, discovery optimization, and flexible, integrated ranking, tackling specifically the identified challenges on those areas using a lightweight approach. Content Type Journal Article Pages - DOI 10.3233/AIC-140644 Authors José María García, University of Seville, Sevilla, Spain. E-mail: josemgarcia@us.es Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: This work proposes novel methodologies to improve the use of Light Detection And Ranging (LiDAR) for environmental purposes, especially for thematic mapping (LiDAR only or fused with other remote sensors) and the estimation of forest variables. The methodologies make use of well-known techniques from soft computing (machine learning and evolutionary computation) and their adaptation to develop LiDAR-derived products. Content Type Journal Article Pages - DOI 10.3233/AIC-140643 Authors Jorge Garcia-Gutierrez, Department of Computer Languages and Systems, University of Seville, Seville, Spain. E-mail: jorgarcia@us.es Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: To meet the increasing challenges on global warming and customer demands, the current hierarchical structure of electric power grid is undergoing a rapid change by focusing on high efficiency, reliability and flexibility. To address such challenges, the new concept of smart grid with a sophisticated communication infrastructure has emerged. While power grid systems are based on traditional information architectures at present, the evolving smart grid has a strong need on communication connections among a huge amount of distributed elements, such as generators, substations, monitoring sensors and customers. However, the power industry is facing dilemma that communication resources are limited due to the lack of wireless spectrum resources and the restrictions of wired applications. This paper firstly provides the architecture of the wide-area monitoring system for smart grid by applying a spectrum sensing and sharing technique of cognitive radio, based on an overview of the current communication technologies. Afterwards, the paper presents the feasible application of cognitive communication architecture on the existing power quality monitoring system by combining long-term and short-term monitoring approaches. Content Type Journal Article Pages 335-350 DOI 10.3233/MGS-130212 Authors Ling Luo, State Grid Shanghai Electric Power Research Institute, Shanghai, China Yucan Yang, State Grid Shanghai Training Center, Shanghai, China Jian Zhou, State Grid Shanghai Electric Power Research Institute, Shanghai, China Qi Zhao, State Grid Shanghai Maintenance Company, Shanghai, China Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 9 Journal Issue Volume 9, Number 4 / 2013

Description: Criminal behaviour often involves a combination of physical, mental, social and environmental (multi-)agent aspects, such as neurological deviations, hormones, arousal, (non)empathy, targets and social control. To study the dynamics of these aspects, this paper contributes a dynamical agent-based approach for analysis and simulation of criminal behaviour. It involves dynamically generated desires and beliefs in opportunities within the social environment, both based on literature on criminal behaviour. The approach is illustrated for the case of an Intermittent Explosive Disorder. Content Type Journal Article Pages 315-334 DOI 10.3233/MGS-130211 Authors Tibor Bosse, Department of Artificial Intelligence, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands Charlotte Gerritsen, Department of Artificial Intelligence, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands Jan Treur, Department of Artificial Intelligence, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 9 Journal Issue Volume 9, Number 4 / 2013

Description: This paper presents the Juste-Neige system for predicting the snow height on the ski runs of a resort using an agent-based simulation software. The aim of Juste-Neige is to facilitate snow cover management in order to i) reduce the production cost of artificial snow and to improve the profit margin for the companies managing the ski resorts; and ii) to reduce the water and energy consumption, and thus to reduce the environmental impact, by producing only the snow needed for a good skiing experience. The software provides maps with the predicted snow heights for the predicted days. On these maps, the areas most exposed to snow erosion are highlighted. The software proceeds in three steps: i) interpolation of snow height measurements with a neural network; ii) local meteorological forecasts for every ski resort; iii) simulation of the impact caused by skiers using a multi-agent system. The software has been evaluated in the ski resort of Verbier in Switzerland and provides predictions that are useful for the management of the ski runs. This paper presents the software in general and the agent-based simulation in particular. Content Type Journal Article Pages 279-299 DOI 10.3233/MGS-130209 Authors Marc Revilloud, French Institute of Science Technology for Transport, Development and Networks, Versailles, France Jean-Christophe Loubier, University of Applied Sciences and Arts Western Switzerland, Sierre, Switzerland Marut Doctor, University of Applied Sciences and Arts Western Switzerland, Sierre, Switzerland Mikhail Kanevski, University of Lausanne, Lausanne, Switzerland Vadim Timonin, University of Lausanne, Lausanne, Switzerland Michael Ignaz Schumacher, University of Applied Sciences and Arts Western Switzerland, Sierre, Switzerland Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 9 Journal Issue Volume 9, Number 4 / 2013

Description: A novel learning methodology based on a hybrid mechanism for training interval singleton type-2 Takagi-Sugeno-Kang fuzzy logic systems uses recursive orthogonal least-squares to tune the type-1 consequent parameters and the steepest descent method to tune the interval type-2 antecedent parameters. The proposed hybrid-learning algorithm changes the interval type-2 model parameters adaptively to minimize some criteria function as new information becomes available and to match desired input-output data pairs. Its antecedent sets are type-2 fuzzy sets, its consequent sets are type-1 fuzzy sets, and its inputs are singleton fuzzy numbers without uncertain standard deviations. As reported in the literature, the performance indices of hybrid models have proved to be better than those of the individual training mechanisms used alone. Experiments were carried out involving the application of hybrid interval type-2 Takagi-Sugeno-Kang fuzzy logic systems for modeling and prediction of the scale-breaker entry temperature in a hot strip mill for three different types of coils. The results demonstrate how the interval type-2 fuzzy system learns from selected input-output data pairs and improves its performance as hybrid training progresses. Content Type Journal Article Pages 125-135 DOI 10.3233/HIS-130188 Authors Gerardo M. Méndez, Centro de Manufactura Avanzada, Corporación Mexicana de Investigación en Materiales SA de CV – COMIMSA, Saltillo, Coah, México J. Cruz Martinez, Departamento de Economía y Administración, Instituto Tecnológico de Nuevo León, Cd. Guadalupe, N.L., México David S. González, Centro de Manufactura Avanzada, Corporación Mexicana de Investigación en Materiales SA de CV – COMIMSA, Saltillo, Coah, México F. Javier Rendón-Espinoza, Departamento de Economía y Administración, Instituto Tecnológico de Nuevo León, Cd. Guadalupe, N.L., México Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 2 / 2014

Description: Obstacle detection is a fundamental issue of robot navigation and there have been several proposed methods for this problem. In this paper, we propose a new approach to find out obstacles on Depth Camera streams. The proposed approach consists of three stages. First, preprocessing stage is for noise removal. Second, different depths in a frame are clustered based on the Interval Type-2 Fuzzy Subtractive Clustering algorithm. Third, the objects of interest are detected from the obtained clusters. Beside that, it gives an improvement in the Interval Type-2 Fuzzy Subtractive Clustering algorithm to reduce the time consuming. In theory, it is at least 3700 times better than the original one, and approximate 980100 in practice on our depth frames. The results conducted on frames demonstrate that the distance from the camera to objects retrieved is exact enough for indoor robot navigation problems. Content Type Journal Article Pages 97-107 DOI 10.3233/HIS-130186 Authors Mau Uyen Nguyen, Department of Information Systems, Le Quy Don Technical University, Hanoi, Vietnam Long Thanh Ngo, Department of Information Systems, Le Quy Don Technical University, Hanoi, Vietnam Thanh Tinh Dao, Department of Information Systems, Le Quy Don Technical University, Hanoi, Vietnam Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 2 / 2014

Description: In this paper we study L-fuzzy proximity spaces, where L represents a completely distributive lattice.We shall investigate the level decomposition of L-fuzzy proximity on X and the corresponding L-fuzzy proximity continuous maps. In addition, we shall establish the representation theorems of L-fuzzy proximity on X. Content Type Journal Article Pages 137-144 DOI 10.3233/HIS-130189 Authors M. El-Dardery, Department of Mathematics, Faculty of Science, Fayoum University, Fayoum, Egypt J. Zhang, College of Science, North China University of Technology, Beijing, China Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 2 / 2014

Description: This paper revisits a class of recently proposed so-called invariant manifold methods for zero finding of ill-posed problems, showing that they can be profitably viewed as homotopy methods, in which the homotopy parameter is interpreted as a learning parameter. Moreover, it is shown that the choice of this learning parameter can be made in a natural manner from a control Liapunov function approach (CLF). From this viewpoint, maintaining manifold invariance is equivalent to ensuring that the CLF satisfies a certain ordinary differential equation, involving the learning parameter, that allows an estimate of rate of convergence. In order to illustrate this approach, algorithms recently proposed using the invariant manifold approach, are rederived, via CLFs, in a unified manner. Adaptive regularization parameters for solving linear algebraic ill-posed problems were also proposed. This paper also shows that the discretizations of the ODEs to solve the zero finding problem, as well as the different adaptive choices of the regularization parameter, yield iterative methods for linear systems, which are also derived using the Liapunov optimizing control (LOC) method. Content Type Journal Article Pages 109-123 DOI 10.3233/HIS-130187 Authors Fernando Pazos, Department of Electrical Engineering, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil Amit Bhaya, Department of Electrical Engineering, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 2 / 2014

Description: In this paper, Particle Swarm Optimization with Constriction Factor and Inertia Weight Approach is hybridized with Wavelet Mutation (PSOCFIWA-WM) strategy for the optimal design of linear phase FIR filters. Real coded genetic algorithm (RGA), particle swarm optimization (PSO) and particle swarm optimization with constriction factor and inertia weight (PSOCFIWA) have also been adopted for the sake of comparison. PSOCFIWA-WM incorporates a new definition of swarm updating in PSOCFIWA with the help of wavelet based mutation. Wavelet mutation enhances the effectiveness of PSOCFIWA to explore the multidimensional solution space more effectively. In this design approach, filter length, pass band and stop band edge frequencies, feasible pass band and stop band ripple sizes are specified. A comparison of simulation results reveals the optimization superiority of the proposed technique over the other optimization techniques for the solution of FIR low pass (LP), high pass (HP), band pass (BP) and band stop (BS) filter designs. Content Type Journal Article Pages 81-96 DOI 10.3233/HIS-130185 Authors S.K. Saha, Department of Electronics and Communication Engineering, National Institute of Technology, Durgapur, West Bengal, India R. Kar, Department of Electronics and Communication Engineering, National Institute of Technology, Durgapur, West Bengal, India D. Mandal, Department of Electronics and Communication Engineering, National Institute of Technology, Durgapur, West Bengal, India S.P. Ghoshal, Department of Electrical Engineering, National Institute of Technology, Durgapur, West Bengal, India Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 2 / 2014

Description: In this paper we describe the Semantic Quran dataset, a multilingual RDF representation of translations of the Quran. The dataset was created by integrating data from two different semi-structured sources and aligned to an ontology designed to represent multilingual data from sources with a hierarchical structure. The resulting RDF data encompasses 43 different languages which belong to the most under-represented languages in the Linked Data Cloud, including Arabic, Amharic and Amazigh. We designed the dataset to be easily usable in natural-language processing applications with the goal of facilitating the development of knowledge extraction tools for these languages. In particular, the Semantic Quran is compatible with the Natural-Language Interchange Format and contains explicit morpho-syntactic information on the utilized terms. We present the ontology devised for structuring the data. We also provide the transformation rules implemented in our extraction framework. Finally, we detail the link creation process as well as possible usage scenarios for the Semantic Quran dataset. Content Type Journal Article Pages - DOI 10.3233/SW-140137 Authors Mohamed Ahmed Sherif, Universität Leipzig, Institut für Informatik, AKSW, Postfach 100920, D-04009 Leipzig, Germany. E-mail: {Sherif,NgongaNgomo}@informatik.uni-leipzig.de Axel-Cyrille Ngonga Ngomo, Universität Leipzig, Institut für Informatik, AKSW, Postfach 100920, D-04009 Leipzig, Germany. E-mail: {Sherif,NgongaNgomo}@informatik.uni-leipzig.de Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: The world is losing some of its 7,000 languages. Hypothesizing that language attrition might subside if all languages were intertranslatable, the PanLex project supports panlingual lexical translation by integrating all known lexical translations. Semantic Web technologies can flexibly represent and reason with the content of its database and interlink it with linguistic and other resources and annotations. Conversely, PanLex, with its collection of translation links between more than a billion pairs of lexemes from more than 9,000 language varieties, can improve the coverage of the Linguistic Web of Data. We detail how we transformed the content of the PanLex database to RDF, established conformance with the lemon and GOLD data models, interlinked it with Lexvo and DBpedia, and published it as Linked Data and via SPARQL. Content Type Journal Article Pages - DOI 10.3233/SW-140138 Authors Patrick Westphal, University of Leipzig, Germany. E-mail: {pwestphal,cstadler}@informatik.uni-leipzig.de Claus Stadler, University of Leipzig, Germany. E-mail: {pwestphal,cstadler}@informatik.uni-leipzig.de Jonathan Pool, The Long Now Foundation, San Francisco, USA. E-mail: pool@panlex.org Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: In this paper, we present the methodology for the introduction to scientific computing based on model-centered learning. We propose multiphase queueing systems as a basis for learning objects. We use Python and parallel programming for implementing the models and present the computer code and results of stochastic simulations. Content Type Journal Article Pages - DOI 10.3233/SPR-140377 Authors Vladimiras Dolgopolovas, Informatics Methodology Department, Institute of Mathematics and Informatics of Vilnius University, Vilnius, Lithuania Valentina Dagienė, Informatics Methodology Department, Institute of Mathematics and Informatics of Vilnius University, Vilnius, Lithuania Saulius Minkevčius, Operational Research Sector at System Analysis Department, Institute of Mathematics and Informatics of Vilnius University, Vilnius, Lithuania Leonidas Sakalauskas, Operational Research Sector at System Analysis Department, Institute of Mathematics and Informatics of Vilnius University, Vilnius, Lithuania Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: The paper presents a formal description of a subset of the Alvis language designed for the modelling and formal verification of concurrent systems. Alvis combines possibilities of a formal models verification with flexibility and simplicity of practical programming languages. Alvis provides a graphical modelling of interconnections among agents and a high level programming language used for the description of agents behaviour. Its semantic depends on the so-called system layer. The most universal system layer α 0 , described in the paper, makes Alvis similar to other formal languages like Petri nets, process algebras, time automata, etc. Content Type Journal Article Pages 161-176 DOI 10.3233/FI-2014-967 Authors Marcin Szpyrka, AGH University of Science and Technology, Department of Applied Computer Science, Al. Mickiewicza 30, 30-059 Krakow, Poland. {mszpyrka,ptm,Rafal.Mrowka,kotulski}@agh.edu.pl Piotr Matyasik, AGH University of Science and Technology, Department of Applied Computer Science, Al. Mickiewicza 30, 30-059 Krakow, Poland. {mszpyrka,ptm,Rafal.Mrowka,kotulski}@agh.edu.pl Rafał Mrówka, AGH University of Science and Technology, Department of Applied Computer Science, Al. Mickiewicza 30, 30-059 Krakow, Poland. {mszpyrka,ptm,Rafal.Mrowka,kotulski}@agh.edu.pl Leszek Kotulski, AGH University of Science and Technology, Department of Applied Computer Science, Al. Mickiewicza 30, 30-059 Krakow, Poland. {mszpyrka,ptm,Rafal.Mrowka,kotulski}@agh.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: In this essay, we analyze various often semantically identified notions of separating things. In doing this, we contrast the set–theoretical approach based on the notion of an element/point with the mereological approach based on the notion of a part, hence, pointless. We address time aspect of the notion of a boundary and related notions as well as approximate notions defined in the realm of rough (approximate) mereology. Content Type Journal Article Pages 149-159 DOI 10.3233/FI-2014-966 Authors Lech Polkowski, Polish–Japanese Institute of Information Technology, Koszykowa 86, 02008 Warszawa, Poland. polkow@pjwstk.edu.pl Maria Semeniuk-Polkowska, Chair of Formal Linguistics, Warsaw University, Dobra 55, 00312 Warszawa, Poland. m.polkowska@uw.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: We discuss an approach for dealing with uncertainty in complex systems. The approach is based on interactive computations over complex objects called here complex granules (c-granules, for short). Any c-granule consists of a physical part and a mental part linked in a special way. We begin from the rough set approach and next we move toward interactive computations on c-granules. From our considerations it follows that the fundamental issues of intelligent systems based on interactive computations are related to risk management in such systems. Our approach is a step toward realization of the Wisdom Technology (WisTech) program. The approach was developed over years of work on different real-life projects. Content Type Journal Article Pages 69-84 DOI 10.3233/FI-2014-961 Authors Andrzej Jankowski, Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland. a.jankowski@ii.pw.edu.pl Andrzej Skowron, Institute of Mathematics, The University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. skowron@mimuw.edu.pl Roman W. Swiniarski, Department of Computer Science, San Diego State University, 5500 Campanile Drive San Diego, CA 92182, USA, and Institute of Computer Science Polish Academy of Sciences, Jana Kazimierza 5, 01-248 Warsaw, Poland. rswiniarski@mail.sdsu.edu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: Networks of Timed Automata (NTA) and Time Petri Nets (TPNs) are well-established formalisms used to model, analyze and control industrial real-time systems. The underlying theories are usually developed in different scientific communities and both formalisms have distinct strong points: for instance, conciseness for TPNs and a more flexible notion of urgency for NTA. The objective of the paper is to introduce a new model allowing the joint use of both TPNs and NTA for the modeling of timed systems. We call it Clock Transition System (CTS). This new model incorporates the advantages of the structure of Petri nets, while introducing explicitly the concept of clocks. Transitions in the network can be guarded by an expression on the clocks and reset a subset of them as in timed automata. The urgency is introduced by a separate description of invariants. We show that CTS allow to express TPNs (even when unbounded) and NTA. For those two classical models, we identify subclasses of CTSs equivalent by isomorphism of their operational semantics and provide (syntactic) translations. The classical state-space computation developed for NTA and then adapted to TPNs can easily be defined for general CTSs. Armed with these merits, the CTS model seems a good candidate to serve as an intermediate theoretical and practical model to factor out the upcoming developments in the TPNs and the NTA scientific communities. Content Type Journal Article Pages 85-100 DOI 10.3233/FI-2014-962 Authors Claude Jard, Université de Nantes, LINA, Nantes, France. Claude.Jard@univ-nantes.fr Didier Lime, École Centrale de Nantes, IRCCyN, Nantes, France. Didier.Lime@irccyn.ec-nantes.fr Olivier H. Roux, École Centrale de Nantes, IRCCyN, Nantes, France. Olivier-H.Roux@irccyn.ec-nantes.fr Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: This paper outlines the primary steps to investigate if artificial agents can be considered as true substitutes of humans. Based on a Socially augmented microworld (SAM) human tracking behavior was analyzed using time series. SAM involves a team of navigators jointly steering a driving object along different virtual tracks containing obstacles and forks. Speed and deviances from track are logged, producing high-resolution time series of individual (training) and cooperative tracking behavior. In the current study 52 time series of individual tracking behavior on training tracks were clustered according to different similarity measures. Resulting clusters were used to predict cooperative tracking behavior in fork situations. Results showed that prediction was well for tracking behavior shown at the first and, moderately well at the third fork of the cooperative track: navigators switched from their trained to a different tracking style and then back to their trained behavior. This matches with earlier identified navigator types, which were identified on visual examination. Our findings on navigator types will serve as a basis for the development of artificial agents, which can be compared later to behavior of human navigators. Content Type Journal Article Pages 133-147 DOI 10.3233/FI-2014-965 Authors Vladimir Kurbalija, Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Trg D. Obradovica 4, 21000 Novi Sad, Serbia. kurba@dmi.uns.ac.rs, mira@dmi.uns.ac.rs Mirjana Ivanović, Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Trg D. Obradovica 4, 21000 Novi Sad, Serbia. kurba@dmi.uns.ac.rs, mira@dmi.uns.ac.rs Charlotte von Bernstorff, Institute of Psychology, Humboldt University Berlin, Rudower Chaussee 18, 12489 Berlin, Germany. charlotte.bernstorff@hu-berlin.de, jens.nachtwei@hu-berlin.de Jens Nachtwei, Institute of Psychology, Humboldt University Berlin, Rudower Chaussee 18, 12489 Berlin, Germany. charlotte.bernstorff@hu-berlin.de, jens.nachtwei@hu-berlin.de Hans-Dieter Burkhard, Institute of Informatics, Humboldt University Berlin, Rudower Chaussee 25, 12489 Berlin, Germany. hdb@informatik.hu-berlin.de Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: We present structural properties of languages constructed with catenation and shuffle, comprising iteration lemmata and closure properties of the language classes, as well as decidability results that follow. Content Type Journal Article Pages 117-132 DOI 10.3233/FI-2014-964 Authors Manfred Kudlek, University of Hamburg, Germany Nils Erik Flick, University of Oldenburg, Germany. flick@informatik.uni-oldenburg.de Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: Unified State Model (USM) is a single data model that allows conveying objects of major programming languages and databases. USM exploits and emphasizes common properties of their data models. USM is equipped with mappings from these data models onto it. With USM at hand, we have faced the next natural research question whether numerous query languages for the data subsumed by USM can be clearly mapped onto a common language. We have designed and proposed such a language called the Unified Query Language (UQL). UQL is intended to be a minimalistic and elegant query language that allows expressing queries of languages of data models covered by USM. In this paper we define UQL and its concise set of operators. Next we conduct a mild introduction into UQL features by showing examples of SQL and ODMG OQL queries and their mapping onto UQL. We conclude by presenting the mapping of the theoretical foundations of these two major query languages onto UQL. They are the multiset relational algebra and the object query algebra. This is an important step towards the establishment of a fully-fledged common query language for USM and its subsumed data models. Content Type Journal Article Pages 177-192 DOI 10.3233/FI-2014-968 Authors Piotr Wiśniewski, Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland. pikonrad@mat.umk.pl Krzysztof Stencel, Institute of Informatics, University of Warsaw, Warsaw, Poland. stencel@mimuw.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: In this paper we study the complexity of HORNETS, an algebraic extension of object nets. We define a restricted class: safe, elementary HORNETS, to guarantee finite state spaces. It will turn out, that the reachability problem for this class requires exponential space, which is a major increase when compared to safe, elementary object nets, which require polynomial space. Content Type Journal Article Pages 101-115 DOI 10.3233/FI-2014-963 Authors Michael Köhler-Bußmeier, University of Hamburg, Department for Informatics, Vogt-Kölln-Straße 30, D-22527 Hamburg, Germany. koehler@informatik.uni-hamburg.de Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: Computational steering is an interactive remote control of a long running application. The user can adopt it, e.g., to adjust simulation parameters on the fly. Simulation of large-scale biochemical networks is often computationally expensive, particularly stochastic and hybrid simulation. Such extremely time-consuming computations necessitate an interactive mechanism to permit users to try different paths and ask “what-if-questions” while the simulation is in progress. Furthermore, with the progress of computational modelling and the simulation of biochemical networks, there is a need to manage multi-scale models, which may contain species or reactions at different scales. In this context, Petri nets are of special importance, since they provide an intuitive visual representation of reaction networks. In this paper, we introduce a framework and its implementation for combining Petri nets and computational steering for the representation and interactive simulation of biochemical networks. The main merits of the developed framework are: intuitive representation of biochemical networks by means of Petri nets, distributed collaborative and interactive simulation, and tight coupling of simulation and visualisation. Content Type Journal Article Pages 49-67 DOI 10.3233/FI-2014-960 Authors Mostafa Herajy, Department of Mathematics and Computer Science, Faculty of Science, Port Said University, 42521 - Port Said, Egypt. mherajy@sci.psu.edu.eg Monika Heiner, Computer Science Institute, Brandenburg University of Technology, D-03013 Cottbus, Germany. monika.heiner@informatik.tu-cottbus.de Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: In the paper, we attempt to identify the crucial determinants of innovativeness economy and the correlations between the determinants. We based our research on the Innovativeness Union Scoreboard (IUS) dataset. In order to solve the problem, we propose to use the Double Self-Organizing Feature Map (SOM) approach. In the first step, countries, described by determinants of innovativeness economy, are clustered using SOMs according to five year time series for each determinant separately. In the second step, results of the first step are clustered again using SOM to obtain the final correlation represented in the form of a minimal spanning tree. We propose some modifications of the clustering process using SOMs to improve classification results and efficiency of the learning process. Content Type Journal Article Pages 37-48 DOI 10.3233/FI-2014-959 Authors Marta Czyżewska, University of Information Technology and Management, Sucharskiego Str. 2, 35-225 Rzeszów, Poland. mczyzewska@wsiz.rzeszow.pl, jszkola@wsiz.rzeszow.pl, kpancerz@wsiz.rzeszow.pl Jarosław Szkoła, University of Information Technology and Management, Sucharskiego Str. 2, 35-225 Rzeszów, Poland. mczyzewska@wsiz.rzeszow.pl, jszkola@wsiz.rzeszow.pl, kpancerz@wsiz.rzeszow.pl Krzysztof Pancerz, University of Information Technology and Management, Sucharskiego Str. 2, 35-225 Rzeszów, Poland. mczyzewska@wsiz.rzeszow.pl, jszkola@wsiz.rzeszow.pl, kpancerz@wsiz.rzeszow.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: The paper describes a new tool for study relationships between length and coverage of exact decision rules. This tool is based on dynamic programming approach. We also present results of experiments with decision tables from UCI Machine Learning Repository. Content Type Journal Article Pages 1-13 DOI 10.3233/FI-2014-956 Authors Talha Amin, Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {talha.amin, igor.chikalov, mikhail.moshkov}@kaust.edu.sa; beata.zielosko@us.edu.pl Igor Chikalov, Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {talha.amin, igor.chikalov, mikhail.moshkov}@kaust.edu.sa; beata.zielosko@us.edu.pl Mikhail Moshkov, Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {talha.amin, igor.chikalov, mikhail.moshkov}@kaust.edu.sa; beata.zielosko@us.edu.pl Beata Zielosko, Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {talha.amin, igor.chikalov, mikhail.moshkov}@kaust.edu.sa; beata.zielosko@us.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: Petri net structures are used as communication model of network systems where message transfer channels are represented by the nets' edges, communicating agents - by nets' places and actions of communication - by nets' transitions, which here are called transmissions. The role of (structured) tokens play send/receive statements, that arrive at random, which makes the distribution of edges change dynamically. In this sense a net is self-modyfying: although the set of agents-places is fixed, the channels and communicating actions vary in the course of the net activity. Problems of deadlock and fairness is investigated. Content Type Journal Article Pages 27-36 DOI 10.3233/FI-2014-958 Authors Ludwik Czaja, University of Economics and Computer Science Vistula in Warsaw and University of Warsaw, Poland. lczaja@mimuw.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: This paper presents a new tool for the study of relationships between the total path length or the average depth and the number of misclassifications for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [9] and datasets representing Boolean functions with 10 variables. Content Type Journal Article Pages 15-26 DOI 10.3233/FI-2014-957 Authors Igor Chikalov, Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {igor.chikalov, shahid.hussain, mikhail.moshkov}@kaust.edu.sa Shahid Hussain, Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {igor.chikalov, shahid.hussain, mikhail.moshkov}@kaust.edu.sa Mikhail Moshkov, Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {igor.chikalov, shahid.hussain, mikhail.moshkov}@kaust.edu.sa Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 129 Journal Issue Volume 129, Number 1-2 / 2014

Description: The Web has become the primary source of information containing both structured and unstructured information. A good example is e-commerce where products are usually described by technical specifications (structured data) and textual user reviews (unstructured data). Both sources of information complement each other, covering quantifiable as well as perceived aspects of each product. In fact, for most searches users will have more or less abstract concepts in mind, as opposed to clear cut categorical information. In this paper, we develop a novel approach to reveal implicit product features for querying, by combining structured product data with natural-language product reviews. Using a self-supervised learning technique we progressively build a query-aware representation of the product domain under consideration. This representation can then effectively be used for intuitive querying. We performed extensive experiments confirming the effectiveness of our approach over real world product data. In particular, our evaluations show vastly improved precision and recall over the respective IR techniques. Content Type Journal Article Pages 1-14 DOI 10.3233/WIA-140282 Authors Silviu Homoceanu, Institute for Information Systems, Technische Universität Braunschweig, Braunschweig, Germany. E-mail: {silviu,balke}@ifis.cs.tu-bs.de Wolf-Tilo Balke, Institute for Information Systems, Technische Universität Braunschweig, Braunschweig, Germany. E-mail: {silviu,balke}@ifis.cs.tu-bs.de Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 1 / 2014

Description: In the past years various methods have been developed which require semantic annotations of Web services as an input. Such methods typically leverage discovery, match-making, composition and execution of Web services in dynamic settings. At the same time a number of automated Web service annotation approaches have been proposed for enabling application of these methods in settings where it is not feasible to provide the annotations manually. However, lack of effective automated evaluation frameworks has seriously limited proper assessment of the constructed annotations in settings where the overall annotation quality of large quantities of Web services needs to be evaluated. This paper describes an evaluation framework for measuring the quality of semantic annotations for a large number of real-world Web services from heterogeneous application domains. The evaluation framework is generally based on analyzing properties of Web service networks constructed from semantic annotations of the Web services. More specifically, we measure scale-free, small-world and correlation degree properties of the networks to evaluate the overall quality of annotations. The evaluation is demonstrated using annotations constructed semi-automatically for a set of publicly available WSDL documents containing descriptions of about 200 000 Web service operations. Content Type Journal Article Pages 15-34 DOI 10.3233/WIA-140283 Authors Shahab Mokarizadeh, Software and Computer System Department, ICT School, Forum 105, 164 40 Kista, Sweden. E-mail: info@ict.kth.se Peep Küngas, Institute of Computer Science, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia. E-mail: peep.kungas@ut.ee Mihhail Matskin, Software and Computer System Department, ICT School, Forum 105, 164 40 Kista, Sweden. E-mail: info@ict.kth.se Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 1 / 2014

Description: We derive quantitative results regarding sets of n-bit strings that have different dependency or independency properties. Let C(x) be the Kolmogorov complexity of the string x. A string y has α dependency with a string x if C(y) − C(y | x) ≥ α. A set of strings {x 1 , . . . , x t } is pairwise α-independent if for all i ≠ j, C(x i ) − C(x i | x j ) 〈 α. A tuple of strings (x 1 , . . . , x t ) is mutually α-independent if C(x π(1) . . . x π(t) ) 〉 C(x 1 )+. . .+C(x t ) − α, for every permutation π of [t]. We show that: • For every n-bit string x with complexity C(x) ≥ α + 7 log n, the set of n-bit strings that have α dependency with x has size at least (1/poly(n))2 n−α . In case α is computable from n and C(x) ≥ α + 12 log n, the size of the same set is at least (1/C)2 n−α − poly(n)2 α , for some positive constant C. • There exists a set of n-bit strings A of size poly(n)2 α such that any n-bit string has α-dependency with some string in A. • If the set of n-bit strings {x 1 , . . . , x t } is pairwise α-independent, then t ≤ poly(n)2 α . This bound is tight within a poly(n) factor, because, for every n, there exists a set of n-bit strings {x 1 , . . . , x t } that is pairwise α-dependent with t = (1/poly(n)) · 2 α (for all α ≥ 5 log n). • If the tuple of n-bit strings (x 1 , . . . , x t ) is mutually α-independent, then t ≤ poly(n)2 α (for all α ≥ 7 log n + 6). Content Type Journal Article Pages 485-497 DOI 10.3233/FI-2014-1027 Authors Marius Zimand, Department of Computer and Information Sciences, Towson University, Baltimore, MD, USA. mzimand@towson.edu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: We introduce and briefly investigate P systems with controlled computations. First, P systems with label restricted transitions are considered (in each step, all rules used have either the same label, or, possibly, the empty label, λ), then P systems with the computations controlled by languages (as in context-free controlled grammars). The relationships between the families of sets of numbers computed by the various classes of controlled P systems are investigated, also comparing them with length sets of languages in Chomsky and Lindenmayer hierarchies (characterizations of the length sets of ET0L and of recursively enumerable languages are obtained in this framework). A series of open problems and research topics are formulated. Content Type Journal Article Pages 451-464 DOI 10.3233/FI-2014-1025 Authors Kamala Krithivasan, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai-36, India. kamala@iitm.ac.in Gheorghe Păun, Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucureşti, Romania. gpaun@us.es, ghpaun@gmail.com Ajeesh Ramanujan, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai-36, India. ajeeshramanujan@gmail.com Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: This note describes our experiments aiming to empirically test the ability of machine learning models to act as decision oracles for NP problems. Focusing on satisfiability testing problems, we have generated random 3-SAT instances and found out that the correct branch prediction accuracy reached levels in excess of 99%. The branching in a simple backtracking-based SAT solver has been reduced in more than 90% of the tested cases, and the average number of branching steps has reduced to between 1/5 and 1/3 of the one without the machine learning model. The percentage of SAT instances where the machine learned heuristic-enhanced algorithm solved SAT in a single pass reached levels of 80-90%, depending on the set of features used. Content Type Journal Article Pages 441-450 DOI 10.3233/FI-2014-1024 Authors Cristian Grozea, Fraunhofer FOKUS, Kaiserin Augusta Allee 31, 10589 Berlin, Germany. cristian.grozea@fokus.fraunhofer.de Marius Popescu, University of Bucharest, Academiei 14, Bucharest, Romania. popescunmarius@gmail.com Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: We propose a novel approach to justify and guide regularisation of an ill-posed one-dimensional global optimisation with multiple solutions using a massively parallel (P system) model of the solution space. Classical optimisation assumes a well-posed problem with a stable unique solution. Most of important practical problems are ill posed due to an unstable or non-unique global optimum and are regularised to get a unique best-suited solution. Whilst regularisation theory exists largely for unstable unique solutions, its recommendations are often routinely applied to inverse optical problems with essentially non-unique solutions, e.g. computer stereo vision or image segmentation, typically formulated in terms of global energy minimisation. In these cases the recommended regularisation becomes purely heuristic and does not guarantee a unique solution. As a result, classical optimisation algorithms: dynamic programming (DP) and belief propagation (BP) – meet with difficulties. Our recent concurrent propagation (CP), leaning upon the P systems paradigm, extends DP and BP to always detect whether the problem is ill posed or not and store in the ill-posed case an entire space of solutions that yield the same global optimum. This suggests a radically new path to proper regularisation: select the best-suited unique solution by exploring statistical and structural features of this space. We propose a P systems based implementation of CP and set out as a case study an application of CP to the image matching problem in stereo vision. Content Type Journal Article Pages 465-483 DOI 10.3233/FI-2014-1026 Authors Radu Nicolescu, Department of Computer Science, The University of Auckland, Auckland, New Zealand. r.nicolescu@auckland.ac.nz Georgy Gimel’farb, Department of Computer Science, The University of Auckland, Auckland, New Zealand. r.nicolescu@auckland.ac.nz John Morris, Department of Computer Science, The University of Auckland, Auckland, New Zealand. r.nicolescu@auckland.ac.nz Patrice Delmas, Department of Computer Science, The University of Auckland, Auckland, New Zealand. r.nicolescu@auckland.ac.nz Rui Gong, Department of Computer Science, The University of Auckland, Auckland, New Zealand. r.nicolescu@auckland.ac.nz Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We complete this classification by showing — what we believe is quite an unexpected result—that the logic of subintervals, the fragment of the Halpern–Shoham logic where only the operator “during”, or D, is allowed, is undecidable over discrete structures. This is surprising as this, apparently very simple, logic is decidable over dense orders and its reflexive variant is known to be decidable over discrete structures. Our result subsumes a lot of previous undecidability results of fragments that include D. Content Type Journal Article Pages 217-240 DOI 10.3233/FI-2014-1011 Authors Jerzy Marcinkowski, Institute of Computer Science, University Of Wrocław, Poland. jma@cs.uni.wroc.pl;jmi@cs.uni.wroc.pl Jakub Michaliszyn, Institute of Computer Science, University Of Wrocław, Poland. jma@cs.uni.wroc.pl;jmi@cs.uni.wroc.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 2 / 2014

Description: The theory of rough sets provides a widely used modern tool, and in particular, rough sets induced by quasiorders are in the focus of the current interest, because they are strongly interrelated with the applications of preference relations and intuitionistic logic. In this paper, a structural characterisation of rough sets induced by quasiorders is given. These rough sets form Nelson algebras defined on algebraic lattices. We prove that any Nelson algebra can be represented as a subalgebra of an algebra defined on rough sets induced by a suitable quasiorder. We also show that Monteiro spaces, rough sets induced by quasiorders and Nelson algebras defined on T 0 -spaces that are Alexandrov topologies can be considered as equivalent structures, because they determine each other up to isomorphism. Content Type Journal Article Pages 205-215 DOI 10.3233/FI-2014-1010 Authors Jouni Järvinen, Sirkankuja 1, 20810 Turku, Finland. Jouni.Kalervo.Jarvinen@gmail.com Sándor Radeleczki, Institute of Mathematics, University of Miskolc, 3515 Miskolc-Egyetemváros, Hungary. matradi@uni-miskolc.hu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 2 / 2014

Description: A widely used class of approximate pattern matching algorithms work in two stages, the first being a filtering stage that uses spaced seeds to quickly discards regions where a match is not likely to occur. The design of effective spaced seeds is known to be a hard problem. In this setting, we propose a family of lossless spaced seeds for matching with up to two errors based on mathematical objects known as perfect rulers. We analyze these seeds with respect to the tradeoff they offer between seed weight and the minimum length of the pattern to be matched. We identify a specific property of rulers, namely their skewness, which is closely related to the minimum pattern length of the derived seeds. In this context, we study in depth the specific case of Wichmann rulers and investigate the generalization of our approach to the larger class of unrestricted rulers. Although our analysis is mainly of theoretical interest, we show that for pattern lengths of practical relevance our seeds have a larger weight, hence a better filtration efficiency, than the ones known in the literature. Content Type Journal Article Pages 187-203 DOI 10.3233/FI-2014-1009 Authors Lavinia Egidi, DiSIT, Computer Science Institute, Università del Piemonte Orientale, Italy. lavinia.egidi@unipmn.it; giovanni.manzini@unipmn.it Giovanni Manzini, DiSIT, Computer Science Institute, Università del Piemonte Orientale, Italy. lavinia.egidi@unipmn.it; giovanni.manzini@unipmn.it Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 2 / 2014

Description: Powerful algebraic techniques have been developed for classical sequential computation. Many of them are based on regular expressions and the associated regular algebra. For parallel and interactive computation, extensions to handle 2-dimensional patterns are often required. Finite interactive systems, a 2-dimensional version of finite automata, may be used to recognize 2-dimensional languages. In this paper we present a blueprint for getting a formal representation of parallel, interactive programs and of their semantics. It is based on a recently introduced approach for getting regular expressions for 2-dimensional patterns, particularly using words of arbitrary shapes and powerful control mechanisms on composition. We extend the previously defined class of expressions n2RE with new control features, progressively increasing the expressive power of the formalism up to a level where a procedure for generating the words accepted by finite interactive systems may be obtained. Targeted applications come from the area of modelling, specification, analysis and verification of structured interactive programs via the associated scenario semantics. Content Type Journal Article Pages 313-336 DOI 10.3233/FI-2014-1017 Authors Iulia Teodora Banu-Demergian, Department of Computer Science, University of Bucharest, Romania. th_iulia84@yahoo.com; gheorghe.stefanescu@fmi.unibuc.ro Gheorghe Stefanescu, Department of Computer Science, University of Bucharest, Romania. th_iulia84@yahoo.com; gheorghe.stefanescu@fmi.unibuc.ro Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: We introduce a stochastic extension of CCS endowed with structural operational semantics expressed in terms of measure theory. The set of processes is organised as a measurable space by the sigma-algebra generated by structural congruence. The structural operational semantics associates to each process a set of measures over the space of processes. The measures encode the rates of the transitions from a process (state of a system) to a measurable set of processes. We prove that the stochastic bisimilarity is a congruence, which extends the structural congruence. In addition to an elegant operational semantics, our calculus provides a canonic way to define metrics on processes that measure how similar two processes are in terms of behaviour. Content Type Journal Article Pages 351-371 DOI 10.3233/FI-2014-1019 Authors Luca Cardelli, Microsoft Research Cambridge, UK. luca@microsoft.com Radu Mardare, Dept. of Computer Science, Aalborg University, Denmark. mardare@cs.aau.dk Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: We extend the study of networks of evolutionary processors accepting words to a similar model, processing rectangular pictures. To this aim, we introduce accepting networks of evolutionary picture processors and investigate their computational power. We show that these networks can accept the complement of any local picture language as well as picture languages that are not recognizable. Some open problems regarding decidability issues and closure properties are finally discussed. Content Type Journal Article Pages 337-349 DOI 10.3233/FI-2014-1018 Authors Paolo Bottoni, Department of Computer Science, “Sapienza”, University of Rome, Via Salaria 113, 00198 Rome, Italy. bottoni@di.uniroma1.it; Anna Labella, Department of Computer Science, “Sapienza”, University of Rome, Via Salaria 113, 00198 Rome, Italy. labella@di.uniroma1.it Victor Mitrana, Department of Computer Science, University of Bucharest, Str. Academiei nr. 14, 010014, Bucharest, Romania. mitrana@fmi.unibuc.ro Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 3-4 / 2014

Description: We study, on the basis of a simple neural–network like system that we call a spatial network, how several properties of two evolvable systems: a nervous system and computer software, could influence on the evolvability of a genetic algorithm. The following properties are modelled: hierarchical modularity, mirroring, extensive variability and quantitative genetic traits. By mirroring we understand mimicking of the structure of processed data by the structure of the processing algorithm. We estimate the evolvability of several examples of the presented networks, which perform simple image processing tasks, like stereo–to–depth. The evaluation is done by studying the size of these networks' genotype. Content Type Journal Article Pages 253-278 DOI 10.3233/FI-2014-1013 Authors Artur Rataj, Institute of Theoretical and Applied Computer Science, Bałtycka 5, Gliwice, Poland. arataj@iitis.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 131 Journal Issue Volume 131, Number 2 / 2014

Description: A topic model capable of assigning word pairs to associated topics is developed to explore people's activities. Considering that the form of word pairs led by verbs is a more effective way to express people's activities than separate words, we incorporate the word-connection model into the smoothed Latent Dirichlet Allocation (LDA) to ensure that the words are well paired and assigned to the associated topics. To quantitatively and qualitatively evaluate the proposed model, two datasets were built using Twitter posts as data sources: the wish-related and the geographical information-related datasets. The experiment results using the wish-related dataset indicate that the relatedness of words plays a key role in forming reasonable pairs, and the proposed model, word-pair generative Latent Dirichlet Allocation (wpLDA), performs well in clustering. Results obtained using the geographical information-related dataset demonstrate that the proposed model works well for discovering people's activities, in which the activities are understandably represented with an intuitive character. Content Type Journal Article Pages 193-209 DOI 10.3233/WIA-140292 Authors Dandan Zhu, Research into Artifacts, Center for Engineering (RACE), The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8568, Japan Yusuke Fukazawa, Services and Solution Development Department, NTT DoCoMo, Inc., NTT DoCoMo R&D Center 3-5 Hikari-no-oka, Yokosuka, Kanagawa 239-8536, Japan Eleftheerios Karapetsas, Research into Artifacts, Center for Engineering (RACE), The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8568, Japan Jun Ota, Research into Artifacts, Center for Engineering (RACE), The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8568, Japan Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 2 / 2014

Description: We propose a syntactic possibilistic belief-change operator, which operates on a belief base of necessity-valued formulas. Such a base may be regarded as a finite and compact encoding of a possibility distribution over a possibly infinite set of interpretations. The proposed operator is designed so that it behaves like a semantic possibilistic belief-change operator for BDI agents recently proposed in the literature. The equivalence of the semantic and syntactic operators is then proved. Experimental results are presented. The aim of these experiments is to demonstrate that the cost of belief revision (expressed in terms of the number of entailment checks required) as well as the size of the belief base do not explode as the number of new pieces of information (formulas) supplied increases. Content Type Journal Article Pages 155-169 DOI 10.3233/WIA-140290 Authors Célia da Costa Pereira, Université Nice Sophia Antipolis, I3S, UMR 7271, 06900 Sophia Antipolis, France. E-mail: {celia.pereira,andrea.tettamanzi}@unice.fr Andrea G.B. Tettamanzi, Université Nice Sophia Antipolis, I3S, UMR 7271, 06900 Sophia Antipolis, France. E-mail: {celia.pereira,andrea.tettamanzi}@unice.fr Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 2 / 2014

Description: Multi-agent systems research has been drawing innovative insights from other disciplines such as philosophy and cognitive science. While cognitive studies have shown that over 95% of human decisions conform to the recognition-primed decision making (RPD) model, there still lacks formal descriptions of RPD from agent perspective. The objective of this study is to establish a formal connection between agent mental attitudes and the meta-cognition concepts as used in RPD. We adopt the intentional attitudes as introduced in the SharedPlans theory to model the RPD process and its cognitive activities. In particular, situation recognition is framed as the formation of potential intentions, mental simulation and expectancy monitoring are modeled as two processes for intention evolution, and recognition diagnosis is linked to the notion of intention reconsideration. Such a mentalistic modeling of recognition suggests that the RPD process offers an ideal framework that can systematically integrate intention formation, intention evaluation, and intention reconsideration—three key activities that BDI agents typically implement. This study also indicates that agent-based modeling is a viable approach for formally studying meta-cognition concepts and team cognition concepts. Content Type Journal Article Pages 139-154 DOI 10.3233/WIA-140289 Authors Xiaocong Fan, School of Engineering, Behrend College, The Pennsylvania State University, 5101 Jordan Road, Erie, PA 16563, USA. E-mail: xfan@psu.edu Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 2 / 2014

Description: Previously, we constructed the Japanese Wikipedia Ontology (JWO) via a semi-automatic process using the Japanese Wikipedia, but it had problems due to a lack of upper classes and appropriate definitions of properties. Thus, the aim of the current study was to complement the upper classes in JWO by refining and integrating JWO and Japanese WordNet (JWN) to build a class hierarchy with defined properties based on the considerations of property inheritance. To achieve this, we developed tools that help users to refine the class-instance relationships, to identify the JWO classes that need to be aligned with JWN synsets, and to align the JWO classes with the JWN synsets via user interaction. We also integrated JWO and JWN using a domain ontology development environment, DODDLE-OWL. We also propose a method for building a class hierarchy with defined properties by elevating the common properties defined in sibling classes to higher classes in JWO. Content Type Journal Article Pages 211-233 DOI 10.3233/WIA-140293 Authors Takeshi Morita, School of Social Informatics, Aoyama Gakuin University, Sagamihara-shi, Japan Yuka Sekimoto, Faculty of Science and Technology, Keio University, Yokohama-shi, Japan. E-mail: {s_tamagawa,yamaguti}@ae.keio.ac.jp Susumu Tamagawa, Faculty of Science and Technology, Keio University, Yokohama-shi, Japan. E-mail: {s_tamagawa,yamaguti}@ae.keio.ac.jp Takahira Yamaguchi, Faculty of Science and Technology, Keio University, Yokohama-shi, Japan. E-mail: {s_tamagawa,yamaguti}@ae.keio.ac.jp Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 2 / 2014

Description: Resource management is a key challenge in multiagent systems. It is especially important in dynamic environments where decisions need to be made quickly and when decisions can get obsolete quickly. In wireless local area networks (WLANs), resource management includes dynamic channel assignment, dynamic transmit power control and load balancing of WLANs traffic. In this work, we present a novel decentralized framework and a distributed optimization algorithm DLB-SDPOP for load balancing in complex WLANs. Our self-stabilizing algorithm focuses on repairing the network structure instead of reconstructing it when network perturbations occur. It controls the complexity of problem solving by utilizing efficient search and leverages uncertainty to reduce the possibility of reaching myopic solutions. The size and number of inter-agent communication messages are significantly reduced using a communication filtering mechanism. We categorize different scenarios based on key characteristics (i.e., load, dynamics and uncertainty) in WLANs and compare our algorithm with other state of the art distributed constraint optimization algorithms in each scenario. Our empirical results show that our distributed approach improves WLANs load balancing performance significantly. Content Type Journal Article Pages 111-138 DOI 10.3233/WIA-140288 Authors Shanjun Cheng, AltiSource, Greensboro, NC, USA. E-mail: chengshanjun@gmail.com Anita Raja, Department of Software and Information Systems, The University of North Carolina at Charlotte, Charlotte, NC, 28223, USA. E-mail: anraja@uncc.edu Jiang Xie, Department of Electrical and Computer Engineering, The University of North Carolina at Charlotte, Charlotte, NC, 28223, USA. E-mail: jxie1@uncc.edu Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 2 / 2014

Description: In this paper we empirically investigate the feasibility of using peer-designed agents (PDAs) instead of people for the purpose of mechanism evaluation. This approach has been increasingly advocated in agent research in recent years, mainly due to its many benefits in terms of time and cost. Our experiments compare the behavior of 31 PDAs and 150 people in a legacy eCommerce-based price-exploration setting, using different price-setting mechanisms and diverse performance measures. The results show a varying level of similarity between the aggregate behavior obtained when using people and when using PDAs. In some settings similar results were obtained, in others the use of PDAs rather than people yielded substantial differences. This suggests that the ability to generalize results from one successful implementation of PDA-based systems to another, regarding the use of PDAs as a substitute for people in system evaluations, is quite limited. The decision to prefer PDAs for mechanism evaluation is therefore setting dependent and the applicability of the approach must be re-evaluated when switching to a new setting or using a different measure. Furthermore, we show that even in settings where the aggregate behavior is found to be similar, the individual strategies used by agents in each group highly vary. Finally, we report the results of an extensive comparative analysis of the level of optimality reflected in people's and PDAs' individual decisions in our decision making setting. The results show that the decisions of both groups are far from optimal, however the use of PDAs results in strategies that are more than twice as close to the optimal ones. Content Type Journal Article Pages 171-191 DOI 10.3233/WIA-140291 Authors Avshalom Elmalech, Computer Science Department, Bar-Ilan University, Ramat-Gan, Israel. E-mail: {elmalea,sarned}@cs.biu.ac.il David Sarne, Computer Science Department, Bar-Ilan University, Ramat-Gan, Israel. E-mail: {elmalea,sarned}@cs.biu.ac.il Journal Web Intelligence and Agent Systems Online ISSN 1875-9289 Print ISSN 1570-1263 Journal Volume Volume 12 Journal Issue Volume 12, Number 2 / 2014

Description: Modern interconnects offer remote direct memory access (RDMA) features. Yet, most applications rely on explicit message passing for communications albeit their unwanted overheads. The MPI-3.0 standard defines a programming interface for exploiting RDMA networks directly, however, it's scalability and practicability has to be demonstrated in practice. In this work, we develop scalable bufferless protocols that implement the MPI-3.0 specification. Our protocols support scaling to millions of cores with negligible memory consumption while providing highest performance and minimal overheads. To arm programmers, we provide a spectrum of performance models for all critical functions and demonstrate the usability of our library and models with several application studies with up to half a million processes. We show that our design is comparable to, or better than UPC and Fortran Coarrays in terms of latency, bandwidth and message rate. We also demonstrate application performance improvements with comparable programming complexity. Content Type Journal Article Pages - DOI 10.3233/SPR-140383 Authors Robert Gerstenberger, Department of Computer Science, ETH Zurich, Zurich, Switzerland. E-mails: {robertge, bestam, htor}@inf.ethz.ch Maciej Besta, Department of Computer Science, ETH Zurich, Zurich, Switzerland. E-mails: {robertge, bestam, htor}@inf.ethz.ch Torsten Hoefler, Department of Computer Science, ETH Zurich, Zurich, Switzerland. E-mails: {robertge, bestam, htor}@inf.ethz.ch Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: This paper examines energy management in a heterogeneous processor consisting of an integrated CPU–GPU for high-performance computing (HPC) applications. Energy management for HPC applications is challenged by their uncompromising performance requirements and complicated by the need for coordinating energy management across distinct core types – a new and less understood problem. We examine the intra-node CPU–GPU frequency sensitivity of HPC applications on tightly coupled CPU–GPU architectures as the first step in understanding power and performance optimization for a heterogeneous multi-node HPC system. The insights from this analysis form the basis of a coordinated energy management scheme, called DynaCo, for integrated CPU–GPU architectures. We implement DynaCo on a modern heterogeneous processor and compare its performance to a state-of-the-art power- and performance-management algorithm. DynaCo improves measured average energy-delay squared (ED 2 ) product by up to 30% with less than 2% average performance loss across several exascale and other HPC workloads. Content Type Journal Article Pages - DOI 10.3233/SPR-140380 Authors Indrani Paul, Advanced Micro Devices, Inc. E-mails: {indrani.paul, vignesh.ravi, srilatha.manne}@amd.com, marora@eng.ucsd.edu Vignesh Ravi, Advanced Micro Devices, Inc. E-mails: {indrani.paul, vignesh.ravi, srilatha.manne}@amd.com, marora@eng.ucsd.edu Srilatha Manne, Advanced Micro Devices, Inc. E-mails: {indrani.paul, vignesh.ravi, srilatha.manne}@amd.com, marora@eng.ucsd.edu Manish Arora, Advanced Micro Devices, Inc. E-mails: {indrani.paul, vignesh.ravi, srilatha.manne}@amd.com, marora@eng.ucsd.edu Sudhakar Yalamanchili, Georgia Institute of Technology. E-mail: sudha@gatech.edu Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in contemporary large-scale partial differential equation simulation. In this paper, a lightweight implementation of a theoretically and numerically scalable preconditioner is presented in the context of overlapping methods. The performance of this work is assessed by numerical simulations executed on thousands of cores, for solving various highly heterogeneous elliptic problems in both 2D and 3D with billions of degrees of freedom. Such problems arise in computational science and engineering, in solid and fluid mechanics. While focusing on overlapping domain decomposition methods might seem too restrictive, it will be shown how this work can be applied to a variety of other methods, such as non-overlapping methods and abstract deflation based preconditioners. It is also presented how multilevel preconditioners can be used to avoid communication during an iterative process such as a Krylov method. Content Type Journal Article Pages - DOI 10.3233/SPR-140381 Authors Pierre Jolivet, Laboratoire J. Kuntzmannn, Université J. Fourier, Grenoble Cedex 9, France. E-mail: jolivet@ann.jussieu.fr Frédéric Hecht, Laboratoire J.-L. Lions, Université P. et M. Curie, Paris, France. E-mails: {hecht, nataf}@ann.jussieu.fr Frédéric Nataf, Laboratoire J.-L. Lions, Université P. et M. Curie, Paris, France. E-mails: {hecht, nataf}@ann.jussieu.fr Christophe Prud'homme, IRMA, Université de Strasbourg, Strasbourg Cedex, France. E-mail: prudhomme@unistra.fr Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: In 2010 Tim Berners-Lee introduced a 5 star rating to his Linked Data design issues page to encourage data publishers along the road to good Linked Data. What makes the star rating so effective is its simplicity, clarity, and a pinch of psychology – is your data 5 star? While there is an abundance of 5 star Linked Data available today, finding, querying, and integrating/interlinking these data is, to say the least, difficult. While the literature has largely focused on describing datasets, e.g., by adding provenance information, or interlinking them, e.g., by co-reference resolution tools, we would like to take Berners-Lee's original proposal to the next level by introducing a 5 star rating for Linked Data vocabulary use. Content Type Journal Article Category Editorial Pages - DOI 10.3233/SW-140135 Authors Krzysztof Janowicz, University of California, Santa Barbara, USA. E-mail: jano@geog.ucsb.edu Pascal Hitzler, Wright State University, Dayton, OH, USA. E-mail: pascal.hitzler@wright.edu Benjamin Adams, The University of Auckland, New Zealand. E-mail: b.adams@auckland.ac.nz Dave Kolas, Raytheon BBN Technologies, MD, USA. E-mail: dkolas@bbn.com Charles Vardeman II, University of Notre Dame, Notre Dame, IN, USA. E-mail: cvardema@nd.edu Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: OntoWiki is a front-end application for the Semantic Data Web, which was originally developed to support distributed knowledge engineering scenarios. Due to its extensibility it also serves as a development framework for knowledge intensive applications. On the surface, OntoWiki is a generic user interface for arbitrary RDF knowledge graphs. It supports the navigation through RDF knowledge bases using SPARQL-generated lists, tables and trees (e.g. class trees and taxonomies). All resources are automatically represented as hyperlinks and backlinks are created whenever feasible, thus enabling users to easily traverse entire knowledge graphs. Since all collections of resources displayed in OntoWiki are generated by SPARQL queries, they can be further refined by applying additional filters. In order to explore large datasets, a comprehensive statistical data management and visualization method was integrated. We render an architectural overview and explain the navigation, exploration and visualization features provided for RDF based information and derived statistics. To showcase the versatility of OntoWiki and its various deployments in the Linked Data Web, we describe some large-scale use cases in the domains of enterprise data integration, governmental data publication and digital humanities. This article is the first comprehensive presentation of OntoWiki summarizing the advancements after the initial publication in 2006 [4]. Content Type Journal Article Pages - DOI 10.3233/SW-140145 Authors Philipp Frischmuth, University of Leipzig, Institute of Computer Science, AKSW Group, Augustusplatz 10, D-04009 Leipzig, Germany. E-mail: {lastname}@informatik.uni-leipzig.de Michael Martin, University of Leipzig, Institute of Computer Science, AKSW Group, Augustusplatz 10, D-04009 Leipzig, Germany. E-mail: {lastname}@informatik.uni-leipzig.de Sebastian Tramp, University of Leipzig, Institute of Computer Science, AKSW Group, Augustusplatz 10, D-04009 Leipzig, Germany. E-mail: {lastname}@informatik.uni-leipzig.de Thomas Riechert, University of Leipzig, Institute of Computer Science, AKSW Group, Augustusplatz 10, D-04009 Leipzig, Germany. E-mail: {lastname}@informatik.uni-leipzig.de Sören Auer, University of Leipzig, Institute of Computer Science, AKSW Group, Augustusplatz 10, D-04009 Leipzig, Germany. E-mail: {lastname}@informatik.uni-leipzig.de Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: Landmark based heuristics are among the most accurate current known admissible heuristics for cost optimal planning. A disjunctive action landmark can be seen as a form of at-least-one constraint on the actions it contains. In many domains, there are many critical propositions which have to be established for a number of times. Previous landmarks are too weak to express this kind of general cardinality constraints. In this paper, we propose to generalize landmarks to multi-valued landmarks to model general cardinality constraints in cost optimal planning. We show existence of complete multi-valued landmark sets by explicitly constructing complete multi-valued action landmark sets for general planning tasks. Because exact lower bounds of general multi-valued action landmarks are intractable to extract and exploit, we introduce multi-valued proposition landmarks from which multi-valued action landmarks can be efficiently induced. Finally, we devise a linear programming based multi-valued landmark heuristic h lpml which extracts and exploits multi-valued landmarks using a linear programming solver. h lpml is guaranteed to be admissible and can be computed in polynomial time. Experimental evaluation on benchmark domains shows h lpml beats state-of-the-art admissible heuristic in terms of heuristic accuracy and achieves better overall coverage performance at the cost of using more CPU time. Content Type Journal Article Pages - DOI 10.3233/AIC-140622 Authors Lei Zhang, State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China. E-mails: zhanglei.com@gmail.com, {chjwang, jyxie}@nju.edu.cn Chong-Jun Wang, State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China. E-mails: zhanglei.com@gmail.com, {chjwang, jyxie}@nju.edu.cn Jun-Yuan Xie, State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China. E-mails: zhanglei.com@gmail.com, {chjwang, jyxie}@nju.edu.cn Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Discovering an effective team of experts toward accomplishing the specific task in social networks has been considered in many real projects. The communication and collaboration among the members and the small cardinality of the team are in the opposite direction to success of the projects. In this paper, we show that the type of a similarity function is also impressive. Its importance is revealed on determining what similar or dissimilar experts should be selected or rejected in the process of the assignment. Considering the graph of underlying social network as conceptual social networking websites, we attribute the team formation problem as a vertices similarity environment based on their common neighbors regarding their co-authored papers. Also, the implicit similarities are used with respect to inattention of additional intermediates between any two nodes in the graph. In addition, taking inspiration from human–human interactions, using just the implicit vertex similarities propose a collaborative recommendation that is based on the team formation framework. They can also identify effectors in social networks established by the structural equivalence relation. Thus, they make the algorithm faster on searching for members of the team. Moreover, the proficiency similarity measures of authors are considered as their potential characteristics that measure their skillfulness level and real contribution corresponding to the required skill. The combination of similarity measures in the cost function causes the algorithm to search the more effective team specially in equal situations. The experimental results on DBLP co-authorship graph show the effectiveness of using the new similarity measures in the proposed method. Content Type Journal Article Pages - DOI 10.3233/AIC-140628 Authors Maryam Sorkhi, Department of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran. E-mails: m.sorkhi.iust@gmail.com, s_hashemi@shirazu.ac.ir Sattar Hashemi, Department of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran. E-mails: m.sorkhi.iust@gmail.com, s_hashemi@shirazu.ac.ir Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Although sometimes it is necessary, no one likes to stay in a hospital, and patients who need to stay in bed but do not require constant medical surveillance prefer their own bed at home. At the same time, a patient in a hospital has a high cost for the community, that is not acceptable if the patient needs service only a few minutes a day. For these reasons, the current trend in Europe and North-America is to send nurses to visit patients at their home: this choice reduces costs for the community and gives better quality of life to patients. The challenge is to deliver the service in a cost effective manner without a detriment of the service quality. These social and health management issues have interesting implications from the mathematical viewpoint, introducing a challenging combinatorial optimization problem. The problem consists in assigning patients' services to traveling nurses and defining the nurse itineraries so the that the following optimization aspects are considered: the nurse workloads (including service as well as travel time) are balanced, patients are preferentially served by a single nurse or just a few ones, and the overall travel time is minimized. These objectives are somehow conflicting and a reasonable trade off must be found. The complexity of the problem calls for suitable optimization-based algorithmic supports to decisions, in particular in the perspective of an increasing diffusion of the service. This problem is known in the literature as the Home Health Care (HHC) problem. In this paper, we address the HHC problem in the municipality of Ferrara, a mid-sized city in the North of Italy. The problem is currently solved by hand, starting from a partitioning of patients based on predefined zones. We describe a Constraint Programming model that solves the HHC problem, and show significant improvements with respect to the current manual solution. Content Type Journal Article Pages - DOI 10.3233/AIC-140632 Authors Massimiliano Cattafi, Department of Electrical and Electronic Engineering, Imperial College London, United Kingdom. E-mail: m.cattafi@imperial.ac.uk Rosa Herrero, Department de Telecomunicació i Enginyeria de Sistemes, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain. E-mail: RHerrero.Math@gmail.com Marco Gavanelli, EnDIF, Università di Ferrara, Ferrara, Italy. E-mails: {marco.gavanelli,maddalena.nonato}@unife.it Maddalena Nonato, EnDIF, Università di Ferrara, Ferrara, Italy. E-mails: {marco.gavanelli,maddalena.nonato}@unife.it Federico Malucelli, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy. E-mail: malucell@elet.polimi.it Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Clustering techniques find homogeneous and distinguishable prototypes. Careful interpretation of these prototypes is crucial to assist the experts to better organize this know-how and to really improve their decision-making processes. The Traffic Lights Panel was introduced in 2009 as a postprocessing tool to provide understanding of clustering prototypes. In this work, annotated Traffic Lights Panel (aTLP) is presented as an enrichment of the TLP to manage the intrinsic uncertainty related with prototypes themselves. The aTLP handles uncertainty through a quantification of the prototypes' purity based on the variation coefficients (VC) and an associated color-based uncertainty model, with two dimensions – tone and saturation – representing nominal trend and purity of the prototype. An application to a waste-water treatment plant in Slovenia, in a discrete and continuous approach, suggests that aTLP seems a useful and friendly tool able to reduce the gap between data mining and effective decision support, towards informed-decisions. Content Type Journal Article Pages - DOI 10.3233/AIC-140611 Authors Karina Gibert, Knowledge Engineering and Machine Learning group, Dep. Statistics and Operation Research, Universitat Politècnica de Catalunya-BarcelonaTech, Spain. E-mail: karina.gibert@upc.edu Dante Conti, Dep. of Operations Research, Universidad de Los Andes, Mérida, Venezuela Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: User interfaces are a critical aspect of semantic knowledge representation systems, as users have to understand and use a formal representation language to model a particular domain of interest, which is known to be a difficult task. Things are even more challenging in a multilingual setting, where users speaking different languages have to create a multilingual ontology. To address these problems, we introduce a semantic wiki system that is based on controlled natural language to provide an intuitive yet formal interface. We use a well-defined subset of Attempto Controlled English (ACE) implemented in Grammatical Framework to automatically produce precise bidirectional translations between ACE and language fragments of a number of other natural languages, making the wiki content accessible multilingually. Because ACE has a partial but deterministic mapping to the Web Ontology Language, our wiki engine can offer automatic reasoning and question answering on the wiki content. Users speaking different languages can therefore build, query, and view a common knowledge base in their own language. We present the results of a user evaluation where participants using different languages were asked to write and assess statements about European geography. Our results show that users reach a high level of consensus, which is not negatively affected by the presence of automatic translation. Content Type Journal Article Pages - DOI 10.3233/SW-140152 Authors Kaarel Kaljurand, Institute of Computational Linguistics, University of Zurich, Switzerland. E-mail: kaljurand@gmail.com, kuhntobias@gmail.com, canedo@ifi.uzh.ch Tobias Kuhn, Institute of Computational Linguistics, University of Zurich, Switzerland. E-mail: kaljurand@gmail.com, kuhntobias@gmail.com, canedo@ifi.uzh.ch Laura Canedo, Institute of Computational Linguistics, University of Zurich, Switzerland. E-mail: kaljurand@gmail.com, kuhntobias@gmail.com, canedo@ifi.uzh.ch Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Description: Rough inclusion functions are mappings considered in rough set theory with which one can measure the degree of inclusion of a set (information granule) in a set (information granule) in line with rough mereology. On the other hand, similarity indices are mappings used in cluster analysis with which one can compare clusterings, and clustering methods with respect to similarity. In this article we show that a large number of similarity indices, known from the literature, can be generated by three simple rough inclusion functions, the standard rough inclusion function included. Content Type Journal Article Pages 149-163 DOI 10.3233/FI-2014-1068 Authors Anna Gomolińska, Institute of Informatics, Białystok University, Sosnowa 64, 15-887 Białystok, Poland. anna.gom@math.uwb.edu.pl Marcin Wolski, Department of Logic and Methodology of Science, Maria Curie-Skłodowska University, pl. Maria Curie-Skłodowska 4, 20-031 Lublin, Poland. marcin.wolski@umcs.lublin.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: The intention of this paper is to introduce a timed extension of transition systems with independence, and to study its categorical interrelations with other time-sensitive models. In particular, we show the existence of a chain of coreflections leading from a category of the model of timed transition systems with independence to a category of a specially defined model of marked Scott domains. As an intermediate semantics we use a timed extension of occurrence transition systems with independence, able to properly capture causality and independence relations which arise in the presence of time delays. Content Type Journal Article Pages 133-147 DOI 10.3233/FI-2014-1067 Authors Roman Dubtsov, A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia Elena Oshevskaya, Sobolev Institute of Mathematics, SB RAS, 4, Acad. Koptyug avenue, 630090, Novosibirsk, Russia Irina Virbitskaite, A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia. virb@iis.nsk.su Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: A network system is given as a set of Petri net-like structures called agents. Each agent has a singled out place interpreted as a communication port with ingoing edges labelled with send(p 1 , ..., p n ) and receive(q 1 , ..., q m ) commands, where p i , q j are names of ports of its interlocutors. Every such edge exits a transition emiting a request for send or receive message. A transmission channel between the agent and its intelocutors is established when its port holds a send or receive command, while ports of its interlocutors hold respective (matching) communication commands. This gives rise to communication between the agent and its interlocutors, after which the channel is disrupted: hence floating channels. Some behavioural properties of such network system are examined, their decision complexity, deadlock and fairness in their number. Content Type Journal Article Pages 123-132 DOI 10.3233/FI-2014-1066 Authors Ludwik Czaja, Academy of Finance and Business Vistula, Warsaw and Institute of Informatics, The University of Warsaw, Poland lczaja@mimuw.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: We investigate the relation between Combinatory Logic and Wang Tiles with the aim of studying Combinators as a programming language for Self-Assembly and DNA computing. We introduce a subset of Combinatory Logic, SKI # , which is Turing Complete, includes simply Typed Combinatory Logic and contains only combinators whose computations require finitely many different redexes. Then, we define a language of Tiles, SKI-Tile, for the representation and the computation of the terms of SKI # in Self-Assembly. Moreover, we introduce a program development methodology that given any computable function, expressed in SKI # , provides a finite set of Tiles that self-assemble to return the computations of the function applications. Finally, the methodology is applied to the derivation of a SKI-Tile program that self-assemble to compute the factorial function. Content Type Journal Article Pages 105-121 DOI 10.3233/FI-2014-1065 Authors Marco Bellia, Dipartimento di Informatica, Università di Pisa, Italy. {bellia,occhiuto}@di.unipi.it M. Eugenia Occhiuto, Dipartimento di Informatica, Università di Pisa, Italy. {bellia,occhiuto}@di.unipi.it Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: We show how to synthesise parameter values under which a given property, expressed in a certain extension of CTL, called RTCTL P , holds in a parametric timed Kripke structure. We prove the decidability of parameter synthesis for RTCTL P by showing how to restrict the infinite space of parameter valuations to its finite subset and employ a brute-force algorithm. The brute-force approach soon becomes intractable, therefore we propose a symbolic algorithm for RTCTL P parameter synthesis. Similarly to the fixed-point symbolic model checking approach, we introduce special operators which stabilise on the solution. The process of stabilisation is essentially a translation from the RTCTL P parameter synthesis problem to a discrete optimization task. We show that the proposed method is sound and complete and provide some complexity results. We argue that this approach leads to new opportunities in model checking, including the use of integer programming and related tools. Content Type Journal Article Pages 211-226 DOI 10.3233/FI-2014-1072 Authors Michał Knapik, Institute of Computer Science, PAS, Warsaw, Poland. mknapik@ipipan.waw.pl; penczek@ipipan.waw.pl Wojciech Penczek, Institute of Computer Science, PAS, Warsaw, Poland. mknapik@ipipan.waw.pl; penczek@ipipan.waw.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: Process mining is a relatively new field of computer science which deals with process discovery and analysis based on event logs. In this work we consider the problem of discovering workflow nets with cancellation regions from event logs. Cancellations occur in the majority of real-life event logs. In spite of huge amount of process mining techniques little has been done on cancellation regions discovery. We show that the state-based region algorithm gives labeled Petri nets with overcomplicated control flow structure for logs with cancellations. We propose a novel method to discover cancellation regions from the transition systems built on event logs and show the way to construct equivalent workflow net with reset arcs to simplify the control flow structure. Content Type Journal Article Pages 197-209 DOI 10.3233/FI-2014-1071 Authors Anna A. Kalenkova, National Research University Higher School of Economics (HSE), Moscow, 101000, Russia. {akalenkova,ilomazova}@hse.ru Irina A. Lomazova, National Research University Higher School of Economics (HSE), Moscow, 101000, Russia. {akalenkova,ilomazova}@hse.ru Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: SAT solving is an indispensable core component of numerous formal verification tools and has found widespread use in industry, in particular when using it in an incremental fashion, e.g., in Bounded Model Checking (BMC). On the other hand, for some applications SAT formulas are not expressive enough, whereas a description via Quantified Boolean Formulas (QBF) is much more adequate, for instance when dealing with partial designs. Motivated by the success of incremental SAT, in this paper we explore various approaches to solve QBF problems in an incremental fashion and thereby make this technology usable as a core component of BMC. Firstly, we realized an incremental QBF solver based on the state-of-the-art QBF solver QuBE: Taking profit from the reuse of some information from previous iterations, the search space can be pruned, in some cases, to even less than a quarter. However, the need for preprocessing QBF formulas prior to the solving phase, that in general cannot be paired with incremental solving because of the non-predictable elimination of variables in the future incremental steps, posed the question of incremental QBF preprocessing. In this context we present an approach for retaining the QBF formula being preprocessed while extending its clauses and prefix incrementally. This procedure results in a significant size reduction of the QBF formulas, hence leading to a reduced solving time. As this may come together with a high preprocessing time, we analyze various heuristics to dynamically disable incremental preprocessing when its overhead raises over a certain threshold and is not compensated by the reduced solving time anymore. For proving the efficacy of our methods experimentally, as an application we consider BMC for partial designs (i.e., designs containing so-called blackboxes which represent unknown parts). Here, we disprove realizability, that is, we prove that an unsafe state is reachable no matter how the blackboxes are implemented. We examine all these incremental approaches from both the point of view of the effectiveness of the single procedure and the benefits that a range of QBF solvers can take from it. On a domain of partial design benchmarks, engaging incremental QBF methods significant performance gains over non incremental BMC can be achieved. Content Type Journal Article Pages - DOI 10.3233/AIC-140633 Authors Christian Miller, Department of Computer Science, University of Freiburg, Georges-Köhler-Allee 051, 79110 Freiburg i. Br., Germany. E-mails: millerc@tf.uni-freiburg.de, paolo@tf.uni-freiburg.de, becker@tf.uni-freiburg.de Paolo Marin, Department of Computer Science, University of Freiburg, Georges-Köhler-Allee 051, 79110 Freiburg i. Br., Germany. E-mails: millerc@tf.uni-freiburg.de, paolo@tf.uni-freiburg.de, becker@tf.uni-freiburg.de Bernd Becker, Department of Computer Science, University of Freiburg, Georges-Köhler-Allee 051, 79110 Freiburg i. Br., Germany. E-mails: millerc@tf.uni-freiburg.de, paolo@tf.uni-freiburg.de, becker@tf.uni-freiburg.de Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Many scientists who implement computational science and engineering software have adopted the object-oriented (OO) Fortran paradigm. One of the challenges faced by OO Fortran developers is the inability to obtain high level software design descriptions of existing applications. Knowledge of the overall software design is not only valuable in the absence of documentation, it can also serve to assist developers with accomplishing different tasks during the software development process, especially maintenance and refactoring. The software engineering community commonly uses reverse engineering techniques to deal with this challenge. A number of reverse engineering-based tools have been proposed, but few of them can be applied to OO Fortran applications. In this paper, we propose a software tool to extract unified modeling language (UML) class diagrams from Fortran code. The UML class diagram facilitates the developers' ability to examine the entities and their relationships in the software system. The extracted diagrams enhance software maintenance and evolution. The experiments carried out to evaluate the proposed tool show its accuracy and a few of the limitations. Content Type Journal Article Pages - DOI 10.3233/SPR-140397 Authors Aziz Nanthaamornphong, Department of Information and Communication Technology, Prince of Songkla University, Hat Yai, Thailand Jeffrey Carver, Department of Computer Science, University of Alabama, Tuscaloosa, AL, USA Karla Morris, Sandia National Laboratories, Livermore, CA, USA Salvatore Filippone, Department of Civil and Computer Engineering, University of Rome – “Tor Vergata”, Roma, Italy Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: In signed social networks, relationship among nodes are types of positive (friendship) and negative (hostility). One absorbing issue in signed social networks is predicting sign of edges among people who are members of these networks. Other than edge sign prediction, one can define importance of people or nodes in networks via ranking algorithms. There exist few ranking algorithms for signed graphs, also few studies have shown role of ranking on link prediction problem. Hence, we were motivated to investigate ranking algorithms availed for signed graphs and their effect on sign prediction problem. This paper makes the contribution of using community detection approach for ranking algorithms in signed graphs. Therefore, community detection which is another active area of research in social networks is also investigated in this document. Community detection algorithms try to find groups of nodes in which they share common properties like similarity. We were able to devise three community-based ranking algorithms which are suitable for signed graphs, and also we evaluated these ranking algorithms via sign prediction problem. These ranking algorithms were tested on three large-scale datasets: Epinions, Slashdot and Wikipedia. We indicated that in some cases, these ranking algorithms outperform previous works because their prediction accuracies are better. Content Type Journal Article Pages - DOI 10.3233/SPR-140400 Authors Saeed Reza Shahriary, Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur, Malaysia. E-mails: shahriarysaeedreza@gmail.com, Fidah@um.edu.my Mohsen Shahriari, Advanced Community Information Systems (ACIS), RWTH Aachen University, Aachen, Germany. E-mail: shahriari@dbis.rwth-aachen.de Rafidah M.D. Noor, Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur, Malaysia. E-mails: shahriarysaeedreza@gmail.com, Fidah@um.edu.my Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: In this paper we investigate Timed Petri nets (TPN) with fixed, possibly zero, durations and maximal step semantics. We define a new state representation where a state is a pair of a marking for the places and a marking for the transitions (a matrix of clocks). For this representation of states we provide an algebraic state equation. Such a state equation lets us prove a sufficient condition for the non-reachability of a state in a TPN. This application of the state equation is subsequently illustrated by an example. Content Type Journal Article Pages 305-322 DOI 10.3233/FI-2014-1078 Authors Matthias Werner, Fakultät für Informatik, Technische Universität Chemnitz, Germany. matthias.werner@informatik.tu-chemnitz.de Louchka Popova-Zeugmann, Institut für Informatik, Humboldt-Universität zu Berlin, Germany. popova@informatik.hu-berlin.de Mario Haustein, Fakultät für Informatik, Technische Universität Chemnitz, Germany. mario.haustein@hrz.tu-chemnitz.de E. Pelz, LACL, UPEC, France. pelz@u-pec.fr Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: This paper investigates the automatic generation of a Map-Reduce program, which implements a heuristic for an NP-complete problem with machine learning. The objective is to automatically design a new concurrent algorithm that finds solutions of comparable quality to the original heuristic. Our approach, called Savant, is inspired from the savant syndrome. Its concurrency model is based on Map-Reduce. The approach is evaluated with the well-known Min-Min heuristic. Experimental results on two problem sizes are promising, the produced algorithm is able to find solutions of comparable quality. Content Type Journal Article Pages 287-302 DOI 10.3233/HIS-140200 Authors Frédéric Pinel, University of Luxembourg, Luxembourg, Luxembourg Bernabé Dorronsoro, University of Lille, Lille, France Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 4 / 2014

Description: Recentering-Restarting Genetic Algorithms have been used successfully to evolve multiple epidemic networks and perform DNA error correction. This work studies variations of the Recentering-Restarting Genetic Algorithm for the purpose of evaluating its effectiveness for ordered gene problems. These variations use multiple seeds and two adaptive representations which use generating sets to produce local search. These algorithm variations are applied to what many considered the quintessential ordered gene problem, the Travelling Salesman Problem. Two distinct sets of experimental analysis was performed: first, using large problem instances to determine the effectiveness of the Recentering-Restarting Genetic Algorithm in comparison to benchmarks and second, studying many small problem instances ranging from 12 to 20 cities to determine if any one of the algorithm variations always outperforms the others. These algorithm variations were comparable to highly competitive optimization algorithms submitted to the DIMACS TSP implementation challenge. In studying the small problem instances, it was observed that no one algorithm always dominates on all problem instances within a domain. This study demonstrates how the Recentering-Restarting Genetic Algorithm is a useful tool for improving upon results generated by other powerful heuristics. Content Type Journal Article Pages 257-271 DOI 10.3233/HIS-140198 Authors James Alexander Hughes, Computer Science, Brock University, St. Catharines, ON, Canada Sheridan Houghten, Computer Science, Brock University, St. Catharines, ON, Canada Daniel Ashlock, Mathematics and Statistics, University of Guelph, Guelph, ON, Canada Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 4 / 2014

Description: Computational grids have been used to solve large scale problems in science, engineering and commerce. The task scheduling in computational grid is a complex optimization problem. Task scheduling is the fundamental issue in grid scheduling. The heuristic algorithms play a vital role in solving complex optimization problems. The distributive nature of Ant Colony Optimization (ACO) helps to find optimal or near optimal solution in efficient manner. Artificial Bee Colony Algorithm is one of the latest heuristics, which out performs classical heuristics, such as Tabu Search (TS), Simulated Annealing (SA), or even ACO. Its exploration capacity can be improved by modifying in the fitness value computation. The hybridization and the modifications in ACO and ABC improve the exploration and exploitation capability of the algorithms and enhance the convergence ability of the algorithm. The proposed hybridization of ABC algorithm with ACO algorithm reduces the waiting time, communication delay and makespan time of the schedule with good load balancing. It improves the convergence to the optimal solution. The proposed Pareto based hybrid ABC-ACO algorithm finds a population of solutions, then uses Pareto ranking to sort these solutions, and then derives the Pareto front for optimal task scheduling. The group of non-dominated solutions assists to schedule the tasks to the best available resources with a tradeoff between makespan and cost in the computational grid. Content Type Journal Article Pages 241-255 DOI 10.3233/HIS-140197 Authors K.R. Remesh Babu, Department of Information Technology, Government Engineering College, Idukki, Kerala, India P. Mathiyalagan, Department of CSE, Sri Ramakrishna Engineering College Coimbatore, Tamil Nadu, India S.N. Sivanandam, Karpagam College of Engineering, Tamil Nadu, India Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 4 / 2014

Description: Computer-aided diagnosis (CAD) of mammograms has received great attention because of its speed and consistency and could provide a promising solution. However, poor visibility of mammographic features addresses the necessity of accurate contrast enhancement technique. In the present study, we have examined the problem of fuzziness/impreciseness of mammograms such as inhomogeneous background, indistinct borders, ill-defined shapes, varying intensities of the suspicious region and low distinguishability from surroundings. Though fuzzy logic based contrast enhancement technique has good potential to handle the problem of impreciseness in mammograms, more generalized and flexible Vague Set approach is proposed here to capture the vagueness of mammograms. Performance of the proposed contrast enhancement technique is compared and evaluated with other two techniques using CAD based classification approach. Content Type Journal Article Pages 227-240 DOI 10.3233/HIS-140191 Authors Arpita Das, Department of Radio Physics and Electronics, University of Calcutta, Kolkata, India Mahua Bhattacharya, Indian Institute of Information Technology and Management, Gwalior, India Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 4 / 2014

Description: In this article we explore and develop a holistic scheme of self adaptive, individualized genetic operators combined with an adaptive tournament size together with a novel implementation of an inversion genetic operator which is suitable for tree based Genetic Programming. We test this scheme on several benchmark Binary Classification problems and find that the proposed techniques deliver superior performance when compared with both a tuned GP configuration and a feedback adaptive Genetic Programming implementation. Our results also demonstrate that an inversion operator may have a useful role to play in exploitation, particularly when used towards the end of evolution to facilitate gradual convergence of the learning system towards a good solution. Content Type Journal Article Pages 273-285 DOI 10.3233/HIS-140199 Authors Jeannie Fitzgerald, Bio-Computing and Developmental, Systems Group, University of Limerick, Limerick, Ireland Conor Ryan, Bio-Computing and Developmental, Systems Group, University of Limerick, Limerick, Ireland Journal International Journal of Hybrid Intelligent Systems Online ISSN 1875-8819 Print ISSN 1448-5869 Journal Volume Volume 11 Journal Issue Volume 11, Number 4 / 2014

Description: In this paper, Non-dominated Sorting Particle Swarm Optimization (NSPSO) is applied to design multiobjective robust Proportional-Integral-Derivative (PID) controllers for various industrial processes such as distillation column plant, liquid level control system and DC servo motor control system. Multiobjective robust PID controller design problem is formulated by minimizing Integral Squared Error (ISE) and balanced robust performance criteria. The performance of various optimal PID controllers is compared in terms of ISE and robust criteria. For the purpose of comparison, NSPSO and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) methods are considered. The performance of PID controllers obtained using NSPSO is better than that of NSGA-II. The results reveal that NSPSO yields better robustness and consistency in terms of integral squared error (ISE) and balanced robust performance criteria than NSGA-II for various industrial processes. Content Type Journal Article Pages - DOI 10.3233/AIC-140639 Authors C. Agees Kumar, Department of Electronics and Instrumentation Engineering, Noorul Islam College of Engineering, Kumaracoil, TamilNadu, India. E-mail: ageesofficials@gmail.com N. Kesavan Nair, Department of Electrical and Electronics Engineering, C.S.I. Institute of Technology, Thovalai, TamilNadu, India. E-mail: kesavannaireeecsit@gmail.com Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Acting in real world may be a difficult task for an agent, either software or robotic, because unexpected contingencies may arise at any step of the execution. Previous approaches to robust plan execution consider propositional goals to be achieved and time constraints to be satisfied. However, realistic plans must obey to constraints on continuous/consumable resources, too. To face the complexity in handling these resources, the paper proposes the notion of Multi Modality Action (MMA). The model allows to explicitly express the multiple execution modalities in which a given action can be executed; each execution modality models requirements/consequences on the involved consumable resources when that modality is selected. Relying on the MMA notion, the paper presents how the repair problem can be seen as a problem of reconfiguring actions modalities, and how it can be solved by exploiting a CSP encoding. The MMAs are employed by a new continual planner, FLEX-RR, which, exploiting the synergy from the reconfiguration and a numeric planning mechanism can efficiently repair on the fly the plan keeping it rather stable. An empirical analysis performed on three numeric planning domains, confirms the large benefits of FLEX-RR in terms of competence, efficiency and stability of the repaired plan. Content Type Journal Article Pages - DOI 10.3233/AIC-140629 Authors Enrico Scala, Dipartimento di Informatica, Università di Torino, corso Svizzera 185, 10149 Torino, Italy. E-mails: scala@di.unito.it, micalizio@di.unito.it, torasso@di.unito.it Roberto Micalizio, Dipartimento di Informatica, Università di Torino, corso Svizzera 185, 10149 Torino, Italy. E-mails: scala@di.unito.it, micalizio@di.unito.it, torasso@di.unito.it Pietro Torasso, Dipartimento di Informatica, Università di Torino, corso Svizzera 185, 10149 Torino, Italy. E-mails: scala@di.unito.it, micalizio@di.unito.it, torasso@di.unito.it Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties. Converting PEG to an executable parser is a rather straightforward task. Unfortunately, PEG is not well understood as a language definition tool. It is thus of a practical interest to construct PEGs for languages specified in some familiar way, such as Backus-Naur Form (BNF). The problem was attacked by Medeiros in an elegant way by noticing that both PEG and BNF can be formally defined in a very similar way. Some of his results were extended in a previous paper by this author. We continue here with further extensions. Content Type Journal Article Pages 257-270 DOI 10.3233/FI-2014-1075 Authors Roman R. Redziejowski, Giraf's Research, roman.redz@swipnet.se Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: Our research is focused on creation of a new object-oriented programming language for Physarum polycephalum computing. Physarum polycephalum is a one-cell organism that can be used for developing a biological architecture of different abstract devices, among others, the digital ones. In the paper, we use an abstract graphical language in the form of Petri nets to describe the Physarum polycephalum behavior. Petri nets are a good formalism to assist designers and support hardware design tools, especially in developing concurrent systems. At the beginning stage considered in this paper, we show how to build Petri net models, and next implement them as Physarum polycephalum machines, of basic logic gates AND, OR, NOT, and simple combinational circuits on the example of the 1-to-2 demultiplexer. Content Type Journal Article Pages 271-285 DOI 10.3233/FI-2014-1076 Authors Andrew Schumann, Institute of Biomedical Informatics, University of Information Technology and Management, Sucharskiego Str. 2, 35-225 Rzeszów, Poland. aschumann@wsiz.rzeszow.pl; kpancerz@wsiz.rzeszow.pl Krzysztof Pancerz, Institute of Biomedical Informatics, University of Information Technology and Management, Sucharskiego Str. 2, 35-225 Rzeszów, Poland. aschumann@wsiz.rzeszow.pl; kpancerz@wsiz.rzeszow.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: Concept learning in description logics (DLs) is similar to binary classification in traditional machine learning. The difference is that in DLs objects are described not only by attributes but also by binary relationships between objects. In this paper, we develop the first bisimulation-based method of concept learning in DLs for the following setting: given a knowledge base KB in a DL, a set of objects standing for positive examples and a set of objects standing for negative examples, learn a concept C in that DL such that the positive examples are instances of C w.r.t. KB, while the negative examples are not instances of C w.r.t. KB. We also prove soundness of our method and investigate its C-learnability. Content Type Journal Article Pages 287-303 DOI 10.3233/FI-2014-1077 Authors Thanh-Luong Tran, Faculty of Information Technology, College of Sciences, Hue University, 77 Nguyen Hue, Hue city, Vietnam Quang-Thuy Ha, Faculty of Information Technology, VNU University of Engineering and Technology, 144 Xuan Thuy, Hanoi, Vietnam Thi-Lan-Giao Hoang, Faculty of Information Technology, College of Sciences, Hue University, 77 Nguyen Hue, Hue city, Vietnam Linh Anh Nguyen, Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland Hung Son Nguyen, Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. son@mimuw.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: Opacity testing is formalized and studied. We specify opacity testers as well as tested systems by (timed) process algebras. We model various testers according to how sophisticated observations of tested system they can make and which kind of conclusions they can obtain. We use this technique to define several realistic security properties. The properties are studied and compared with other security concepts. Content Type Journal Article Pages 165-179 DOI 10.3233/FI-2014-1069 Authors Damas P. Gruska, Institute of Informatics, Comenius University, Mlynska dolina, 842 48 Bratislava, Slovakia. gruska@fmph.uniba.sk Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: The notion of a boundary belongs in the canon of the most important notions of mereotopology, the topological theory induced by mereological structures; the importance of this notion rests not only in its applications to practical spatial reasoning, e.g., in geographical information systems, where it is usually couched under the term of a contour and applied in systems related to economy, welfare, climate, wildlife etc., but also in its impact on reasoning schemes elaborated for reasoning about spatial objects, represented as regions, about spatial locutions etc. The difficulty with this notion lies primarily in the fact that boundaries are things not belonging in mereological universa of things of which they are boundaries. Various authors, from philosophers through mathematicians to logicians and computer scientists proposed schemes for defining and treating boundaries. We propose two approaches to boundaries; the first aims at defining boundaries as things possibly in the universe in question, i.e., composed of existing things, whereas the second defines them as things in a meta–space built over the mereological universe in question, i.e., we assume a priori that boundaries are in a sense ‘things at infinity’, in an agreement with the topological nature of boundaries. Of the two equivalent topological definitions of a boundary, the first, global, defining the boundary as the difference between the closure and the interior of the set, and the second, local, defining it as the set of boundary points whose all neighborhoods transect the set, the first calls for the first type of the boundary and the second is best fitted for the meta–boundary. In the text that follows, we discuss mereology and rough mereology notions (sects. 2, 3), the topological approach to the notion of a boundary and the model ROM with which we illustrate our discussion (sect. 4), the mereology approach (sect. 5), and the approach based on rough mereology and granular computing in the framework of rough mereology (sect. 6). Content Type Journal Article Pages 241-255 DOI 10.3233/FI-2014-1074 Authors Lech Polkowski, Polish-Japanese Institute of Information Technology, Koszykowa str. 86, 02-008 Warszawa, Poland. polkow@pjwstk.edu.pl Maria Semeniuk–Polkowska, Chair of Formal Linguistics, University of Warsaw, Dobra str. 55, 00-312 Warszawa, Poland. m.polkowska@uw.edu.pl Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: Artificial Neural Networks are of much interest for many practical reasons. As of today, they are widely implemented. Of many possible ANNs, the most widely used one is the back-propagation model with direct connection. In this model the input layer is fed with input data and each subsequent layers are fed with the output of preceding layer. This model can be extended by feeding the input data to each layer. This article argues that this new model, named Cross Forward Connection, is optimal than the widely used Direct Connection. Content Type Journal Article Pages 227-240 DOI 10.3233/FI-2014-1073 Authors Stanisław Płaczek, Vistula University, Warsaw, Poland. stanislaw.placzek@wp.pl, bijaya.adhikari1991@gmail.com Bijaya Adhikari, Vistula University, Warsaw, Poland. stanislaw.placzek@wp.pl, bijaya.adhikari1991@gmail.com Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: Information granules (infogranules, for short) are widely discussed in the literature. In particular, let us mention here the rough granular computing approach based on the rough set approach and its combination with other approaches to soft computing. However, the issues related to interactions of infogranules with the physical world and to perception of interactions in the physical world by infogranules are not well elaborated yet. On the other hand the understanding of interactions is the critical issue of complex systems. We propose to model complex systems by interactive computational systems (ICS) created by societies of agents. Computations in ICS are based on complex granules (c-granules, for short). In the paper we concentrate on some basic issues related to interactive computations based on c-granules performed by agents in the physical world. Content Type Journal Article Pages 181-196 DOI 10.3233/FI-2014-1070 Authors Andrzej Jankowski, Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland. a.jankowski@ii.pw.edu.pl Andrzej Skowron, Institute of Mathematics, The University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. skowron@mimuw.edu.pl Roman W. Swiniarski, Department of Computer Science, San Diego State University, 5500 Campanile Drive San Diego, CA 92182, USA. rswiniarski@mail.sdsu.edu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 133 Journal Issue Volume 133, Number 2-3 / 2014

Description: This paper heuristically tackles a challenging scheduling problem arising in the field of hydraulic distribution systems in case of a contamination event, that is, optimizing the scheduling of a set of tasks so that the consumed volume of contaminated water is minimized. Each task consists of manually activating a given device, located on the hydraulic network of the water distribution system. In practice, once contamination has been detected, a given number of response teams move along the network to operate each device on site. The consumed volume of contaminated water depends on the time at which each device is operated, according to complex hydraulic laws, so that the value associated to each schedule must be evaluated by a hydraulic simulation. We explore the potentials of Genetic Algorithms as a viable tool for tackling this optimization-simulation problem. We compare different encodings and propose ad hoc crossover operators that exploit the combinatorial structure of the feasible region, featuring hybridization with Mixed Integer Linear Programming. Extensive computational results are provided for a real life hydraulic network of average size, showing the effectiveness of the approach. Indeed, we greatly improve upon common sense inspired solutions which are commonly adopted in practice. Content Type Journal Article Pages - DOI 10.3233/AIC-140638 Authors Marco Gavanelli, ENDIF, Università di Ferrara, Via Saragat, 1, 44122 Ferrara, Italy. E-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it, andrea.peano@unife.it, stefano.alvisi@unife.it, marco.franchini@unife.it Maddalena Nonato, ENDIF, Università di Ferrara, Via Saragat, 1, 44122 Ferrara, Italy. E-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it, andrea.peano@unife.it, stefano.alvisi@unife.it, marco.franchini@unife.it Andrea Peano, ENDIF, Università di Ferrara, Via Saragat, 1, 44122 Ferrara, Italy. E-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it, andrea.peano@unife.it, stefano.alvisi@unife.it, marco.franchini@unife.it Stefano Alvisi, ENDIF, Università di Ferrara, Via Saragat, 1, 44122 Ferrara, Italy. E-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it, andrea.peano@unife.it, stefano.alvisi@unife.it, marco.franchini@unife.it Marco Franchini, ENDIF, Università di Ferrara, Via Saragat, 1, 44122 Ferrara, Italy. E-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it, andrea.peano@unife.it, stefano.alvisi@unife.it, marco.franchini@unife.it Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula's satisfiability alone is insufficient. Often, some other properties of the formula need to be computed. This article focuses on one such property: the backbone of a formula, which is the set of literals that are true in all the formula's models. Backbones find theoretical applications in characterization of SAT problems and they also find practical applications in product configuration or fault localization. This article overviews existing algorithms for backbone computation and introduces two novel ones. Further, an extensive evaluation of the algorithms is presented. This evaluation demonstrates that one of the novel algorithms significantly outperforms the existing ones. Content Type Journal Article Pages - DOI 10.3233/AIC-140640 Authors Mikoláš Janota, IST/INESC-ID, Technical University of Lisbon, Lisbon, Portugal. E-mails: mikolas@sat.inesc-id.pt, ines@sat.inesc-id.pt Inês Lynce, IST/INESC-ID, Technical University of Lisbon, Lisbon, Portugal. E-mails: mikolas@sat.inesc-id.pt, ines@sat.inesc-id.pt Joao Marques-Silva, IST/INESC-ID, Technical University of Lisbon, Lisbon, Portugal. E-mails: mikolas@sat.inesc-id.pt, ines@sat.inesc-id.pt Journal AI Communications Online ISSN 1875-8452 Print ISSN 0921-7126

Description: Dimensionality reduction refers to a set of mathematical techniques used to reduce complexity of the original high-dimensional data, while preserving its selected properties. Improvements in simulation strategies and experimental data collection methods are resulting in a deluge of heterogeneous and high-dimensional data, which often makes dimensionality reduction the only viable way to gain qualitative and quantitative understanding of the data. However, existing dimensionality reduction software often do not scale to datasets arising in real-life applications, which may consist of thousands of points with millions of dimensions. In this paper, we propose a parallel framework for dimensionality reduction of large-scale data. We identify key components underlying the spectral dimensionality reduction techniques, and propose their efficient parallel implementation. We show that the resulting framework can be used to process datasets consisting of millions of points when executed on a 16,000-core cluster, which is beyond the reach of currently available methods. To further demonstrate applicability of our framework we perform dimensionality reduction of 75,000 images representing morphology evolution during manufacturing of organic solar cells in order to identify how processing parameters affect morphology evolution. Content Type Journal Article Pages - DOI 10.3233/SPR-140401 Authors Sai Kiranmayee Samudrala, Department of Mechanical Engineering, Georgia Institute of Technology, Atlanta, GA 30080, USA Jaroslaw Zola, Rutgers Discovery Informatics Institute, Rutgers University, Piscataway, NJ 08854, USA Srinivas Aluru, School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA Baskar Ganapathysubramanian, Department of Mechanical Engineering, Iowa State University, Ames, IA 50011, USA Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: This paper presents ideas for using coordinate-free numerics in modern Fortran to achieve code flexibility in the partial differential equation (PDE) domain. We also show how Fortran, over the last few decades, has changed to become a language well-suited for state-of-the-art software development. Fortran's new coarray distributed data structure, the language's class mechanism, and its side-effect-free, pure procedure capability provide the scaffolding on which we implement HPC software. These features empower compilers to organize parallel computations with efficient communication. We present some programming patterns that support asynchronous evaluation of expressions comprised of parallel operations on distributed data. We implemented these patterns using coarrays and the Message Passing Interface (MPI). We compared the codes' complexity and performance. The MPI code is much more complex and depends on external libraries. The MPI code on Cray hardware using the Cray compiler is 1.5–2 times faster than the coarray code on the same. The Intel compiler implements coarrays atop Intel's MPI library with the result apparently being 2–2.5 times slower than manually coded MPI despite exhibiting nearly linear scaling efficiency. As compilers mature and further improvements to coarrays comes in Fortran 2015, we expect this performance gap to narrow. Content Type Journal Article Pages - DOI 10.3233/SPR-140398 Authors Magne Haveraaen, Department of Informatics, University of Bergen, Bergen, Norway Karla Morris, Sandia National Laboratories, Livermore, CA, USA Damian Rouson, Stanford University, Stanford, CA, USA Hari Radhakrishnan, EXA High Performance Computing, Nicosia, Cyprus Clayton Carson, Stanford University, Stanford, CA, USA Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: Tablet computers and other mobile devices are widely used in education and other life activities. However, touch screen keyboards are not adapted to languages using alphabets with more letters than the English alphabet has. In this paper, we analyze the existing keyboards on such devices for various languages, influence of keyboard usability on the number of typing errors, and propose keyboard design guidelines for non-English languages. As an example, the layout for the Lithuanian language keyboard (32 native letters and 3 foreign letters) has been presented here. The described solution is not strictly related to the peculiarities of the Lithuanian language alphabet (apart from the number of letters), therefore it is suitable for other languages using a similar number of letters. Content Type Journal Article Pages 415-424 Authors Valentina Dagienė, Institute of Mathematics and Informatics, Vilnius University, Akademijos str. 4, LT-08663 Vilnius, Lithuania, e-mail: valentina.dagiene@mii.vu.lt, gintautas.grigas@mii.vu.lt, tatjana.jevsikova@mii.vu.lt Gintautas Grigas, Institute of Mathematics and Informatics, Vilnius University, Akademijos str. 4, LT-08663 Vilnius, Lithuania, e-mail: valentina.dagiene@mii.vu.lt, gintautas.grigas@mii.vu.lt, tatjana.jevsikova@mii.vu.lt Tatjana Jevsikova, Institute of Mathematics and Informatics, Vilnius University, Akademijos str. 4, LT-08663 Vilnius, Lithuania, e-mail: valentina.dagiene@mii.vu.lt, gintautas.grigas@mii.vu.lt, tatjana.jevsikova@mii.vu.lt Journal Informatica Online ISSN 1822-8844 Print ISSN 0868-4952 Journal Volume Volume 25 Journal Issue Volume 25, Number 3 / 2014

Description: The multidimensional positive definite advection transport algorithm (MPDATA) belongs to the group of nonoscillatory forward-in-time algorithms and performs a sequence of stencil computations. MPDATA is one of the major parts of the dynamic core of the EULAG geophysical model. The Intel Xeon Phi coprocessor is the first product based on the Intel Many Integrated Core (Intel MIC) architecture. This architecture offers notable performance advantages over traditional processors, and supports practically the same traditional parallel programming model. In this work, we outline an approach to adaptation of the 3D MPDATA algorithm to the Intel MIC architecture. In order to utilize computing resources available in Intel Xeon Phi, we propose the (3+1)D decomposition of MPDATA heterogeneous stencil computations. This approach is based on a combination of the loop tiling and fusion techniques, and allows us to ease memory and communication bounds and better exploit the theoretical floating point efficiency of target computing platforms. An important method of improving the efficiency of the (3+1)D decomposition is partitioning of available cores/threads into work teams. It allows us to reduce inter-cache communication overheads. This method also increases opportunities for the efficient distribution of MPDATA computation onto available resources of the Intel MIC architecture, as well as Intel and AMD CPUs. We discuss preliminary performance results obtained on two platforms, including either two Intel Xeon E5-2643 CPUs and Intel Xeon Phi 3120A, as well as two Intel Xeon E5-2697 v2 CPUs and Intel Xeon Phi 7120P. The top-of-the-line Intel Xeon Phi 7120P gives the best performance results for all the tests, and executes the MPDATA algorithm almost 2 times faster than two Intel Xeon E5-2697 v2 CPUs, totally containing 24 cores. Content Type Journal Article Pages - DOI 10.3233/SPR-140403 Authors Lukasz Szustak, Czestochowa University of Technology, Poland Krzysztof Rojek, Czestochowa University of Technology, Poland Tomasz Olas, Czestochowa University of Technology, Poland Lukasz Kuczynski, Czestochowa University of Technology, Poland Kamil Halbiniak, Czestochowa University of Technology, Poland Pawel Gepner, Intel Corporation Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: Architects and applications scientists often use performance models to explore a multi-dimensional design space of architectural characteristics, algorithm designs and application parameters. With traditional performance modeling tools, these explorations forced users to first develop a performance model, and then, repeatedly evaluate and analyze the model manually. These manual investigations proved laborious and error prone. More importantly, the complexity of this traditional process often forced users to simplify their investigations. To address this challenge of design space exploration, we extend our Aspen (Abstract Scalable Performance Engineering Notation) language with three new language constructs: user-defined resources, parameter ranges and a collection of costs in the abstract machine model. Then, we use these constructs to enable automated design space exploration via a nonlinear optimization solver. We show how four interesting classes of design space exploration scenarios can be derived from Aspen models and formulated as pure nonlinear programs. The analysis tools are demonstrated using examples based on Aspen models for a three-dimensional Fast Fourier Transform, the CoMD molecular dynamics proxy application and the DARPA Streaming Sensor Challenge Problem. Our results show that this approach can compose and solve arbitrary performance modeling questions quickly and rigorously when compared to the traditional manual approach. Content Type Journal Article Pages - DOI 10.3233/SPR-140402 Authors Kyle L. Spafford, Oak Ridge National Laboratory. E-mails: kyle.spafford@gmail.com, vetter@ornl.gov Jeffrey S. Vetter, Oak Ridge National Laboratory. E-mails: kyle.spafford@gmail.com, vetter@ornl.gov Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244

Description: We propose an adaptive inverse control scheme, which employs a neural network for the system identification phase and updates its weights in online mode. The theoretical basis of the method is given and its performance is illustrated by means of its application to different control problems showing that our proposal is able to overcome the problems generated by dynamic nature of the process or by physical changes of the system which originate important modifications in the process. A comparative experimental study is presented in order to show the more stable behavior of the proposed method in several working ranks. Content Type Journal Article Pages 401-414 Authors José Luis Calvo-Rolle, Department of Industrial Engineering, E.U. Politécnica, University of A Coruña,  Campus de Ferrol, Avda. 19 de Febrero s/n, 15405 Ferrol, Spain, e-mail: jlcalvo@udc.es Oscar Fontenla-Romero, Laboratory for Research and Development in Artificial Intelligence (LIDIA), Department of Computer Science, Faculty of Informatics, University of A Coruña, Campus de Elviña s/n, 15071 A Coruña, Spain, e-mail: ofontenla@udc.es, bperezs@udc.es, cibertha@udc.es Beatriz Pérez-Sánchez, Laboratory for Research and Development in Artificial Intelligence (LIDIA), Department of Computer Science, Faculty of Informatics, University of A Coruña, Campus de Elviña s/n, 15071 A Coruña, Spain, e-mail: ofontenla@udc.es, bperezs@udc.es, cibertha@udc.es Bertha Guijarro-Berdiñas, Laboratory for Research and Development in Artificial Intelligence (LIDIA), Department of Computer Science, Faculty of Informatics, University of A Coruña, Campus de Elviña s/n, 15071 A Coruña, Spain, e-mail: ofontenla@udc.es, bperezs@udc.es, cibertha@udc.es Journal Informatica Online ISSN 1822-8844 Print ISSN 0868-4952 Journal Volume Volume 25 Journal Issue Volume 25, Number 3 / 2014

Description: We consider the Multilevel Uncapacitated Facility Location Problem (MLUFLP) and propose a new efficient integer programming formulation of the problem that provides optimal solutions for the MLUFLP test instances unsolved to optimality up to now. Further, we design a parallel Memetic Algorithm (MA) with a new strategy for applying the local search improvement within the MA frame. The conducted computational experiments show that the proposed MA quickly reaches all known optimal and best known solutions from the literature and additionally improves several solutions for large-scale MLUFLP test problems. Content Type Journal Article Pages 439-466 Authors Miroslav Marić, Faculty of Mathematics, University of Belgrade, Studentski trg 16/IV, 11 000 Belgrade, Serbia, e-mail: maricm@matf.bg.ac.rs, zoricast@matf.bg.ac.rs, djenic@matf.bg.ac.rs, djapedjape@gmail.com Zorica Stanimirović, Faculty of Mathematics, University of Belgrade, Studentski trg 16/IV, 11 000 Belgrade, Serbia, e-mail: maricm@matf.bg.ac.rs, zoricast@matf.bg.ac.rs, djenic@matf.bg.ac.rs, djapedjape@gmail.com Aleksandar Djenić, Faculty of Mathematics, University of Belgrade, Studentski trg 16/IV, 11 000 Belgrade, Serbia, e-mail: maricm@matf.bg.ac.rs, zoricast@matf.bg.ac.rs, djenic@matf.bg.ac.rs, djapedjape@gmail.com Predrag Stanojević, Faculty of Mathematics, University of Belgrade, Studentski trg 16/IV, 11 000 Belgrade, Serbia, e-mail: maricm@matf.bg.ac.rs, zoricast@matf.bg.ac.rs, djenic@matf.bg.ac.rs, djapedjape@gmail.com Journal Informatica Online ISSN 1822-8844 Print ISSN 0868-4952 Journal Volume Volume 25 Journal Issue Volume 25, Number 3 / 2014

Description: This paper introduces a comparison of one linear and two nonlinear one-step-ahead predictive models that were used to describe the relationship between human emotional signals (excitement, frustration, and engagement/boredom) and virtual dynamic stimulus (virtual 3D face with changing distance-between-eyes). An input–output model building method is proposed that allows building a stable model with the smallest output prediction error. Validation was performed using the recorded signals of four volunteers. Validation results of the models showed that all three models predict emotional signals in relatively high prediction accuracy. Content Type Journal Article Pages 425-437 Authors Vytautas Kaminskas, Department of Systems Analysis, Vytautas Magnus University, Vileikos g. 8, 40444 Kaunas, Lithuania, e-mail: v.kaminskas@if.vdu.lt, e.vaskevicius@if.vdu.lt, a.vidugiriene@if.vdu.lt Egidijus Vaškevičius, Department of Systems Analysis, Vytautas Magnus University, Vileikos g. 8, 40444 Kaunas, Lithuania, e-mail: v.kaminskas@if.vdu.lt, e.vaskevicius@if.vdu.lt, a.vidugiriene@if.vdu.lt Aušra Vidugirienė, Department of Systems Analysis, Vytautas Magnus University, Vileikos g. 8, 40444 Kaunas, Lithuania, e-mail: v.kaminskas@if.vdu.lt, e.vaskevicius@if.vdu.lt, a.vidugiriene@if.vdu.lt Journal Informatica Online ISSN 1822-8844 Print ISSN 0868-4952 Journal Volume Volume 25 Journal Issue Volume 25, Number 3 / 2014