ppxscal/embedding_network huggingface dataset:
Dual-Level Parallelism Exploitation with OpenMP in Coastal Ocean Circulation Modeling
Authors: Marc González, Eduard Ayguadé, Xavier Martorell, Jesús Labarta, Phu V. Luong
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

Two alternative dual-level parallel implementations of the Multiblock Grid Princeton Ocean Model (MGPOM) are compared in this paper. The first one combines the use of two programming paradigms: message passing with the Message Passing Interface (MPI) and shared memory with OpenMP (version called MPI-OpenMP); the second uses only OpenMP (version called OpenMP-Only). MGPOM is a multiblock grid code that enables the exploitation of two levels of parallelism.The MPI-OpenMP implementation uses MPI to parallelize computations by assigning each grid block to a unique MPI process. Since not all grid blocks are of the same size, the workload between processes varies. OpenMP is used within each MPI process to improve load balance. The alternative OpenMP-Only implementation uses some extensions proposed to OpenMP that defines thread groups in order to efficiently exploit the available two levels of parallelism. These extensions are supported by a research OpenMP compiler named NanosCompiler.Performance results of the two implementations from the MGPOM code on a 20-block grid for the Arabian Gulf simulation demonstrate the efficacy of the OpenMP-Only versions of the code. The simplicity of the OpenMP implementation as well as the possibility of using and simply defining policies to dynamically change the allocation of OpenMP threads to the two levels of parallelism is the main result of this study and suggests to consider this alternative for the parallelization of future applications.
Troubled asset relief program, bank interest margin and default risk in equity return: an option-pricing model
Authors: Jyh-Jiuan Lin, Ching-Hui Chang, Jyh-Horng Lin
Venue: WSEAS Transactions on Mathematics (2009)

Will banks be willing to sell their toxic loans with the help of the Troubled Asset Relief Program (TARP)? The answer is yes as long as bids are high enough to tempt banks to deal. With the TARP's help, an increase in the toxic loans sold to the government increases the bank's margin and decreases the bank's default probability in equity return when the bank encounters greater risk. This paper concludes that setting up the TARP for the 'bad bank' solution may be a good move for retail banking, resulting in high margin and low default risk when its target banks are willing sellers.
Lightweight management of scalable and personalised media in mobile IPTV networks
Authors: Laura Arnaiz, Lara García, Lara García, Federico Álvarez, José Manuel Menéndez, Guillermo Cisneros
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

In the present paper a novel system for scalable and personalised media management and its architecture is presented. The proposed solution is based on the creation of a secure and adaptable content delivery architecture and the underlying mechanisms to ensure the correct content management which, along with the content protection mechanisms, can be useful for, on one hand, ensuring user privacy and, on the other hand, enabling the possibility of offering commercial IPTV services over a mobile environment. The aim of the system is to enable personalised view, scalable, seamless and trusted multimedia content delivery, while protecting content from unauthorised access.
A magneto-statics inspired transform for structure representation and analysis of digital images
Authors: Xiao-Dong Zhuang, Nikos E. Mastorakis
Venue: WSEAS Transactions on Computers (2009)

Physical-field inspired methodology has become a new branch in image processing techniques. In this paper, a novel image transform is proposed imitating the source reverse of magneto-static field. The image is taken as a vertical magnetic field, and its curl is estimated as the virtual source of the field for image structure representation and analysis. The restoration from the virtual source to the image is also investigated, based on which a method of image estimation and restoration from its gradient field is proposed. The experimental results indicate that the proposed curl source reverse provides effective image structure representation, which can be exploited in further image processing tasks.
Evaluating Scientific Abstracts with a Genre-specific Rubric
Authors: Sandra Aluísio, Ethel Schuster, Valéria Feltrim, Adalberto Pessoa, Osvaldo Oliveira
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

We propose a rubric to analyze abstracts of scientific papers. It is based on experiments carried out with a writing tool to assist non-native English speakers in producing abstracts in the field of Pharmaceutical Sciences, referred to as SciPo-Farmácia. The rubric has a 3-fold purpose: (1) as a facility to be plugged into SciPo-Farmácia to score students texts, (2) to help domain experts improve both the contents and the language of the text; and (3) to evaluate published articles in order to extend the text database of SciPo-Farmácia.
Parallel Algorithms for Dandelion-Like Codes
Authors: Saverio Caminiti, Rossella Petreschi
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

We consider the class of Dandelion-like codes, i.e., a class of bijective codes for coding labeled trees by means of strings of node labels. In the literature it is possible to find optimal sequential algorithms for codes belonging to this class, but, for the best of our knowledge, no parallel algorithm is reported. In this paper we present the first encoding and decoding parallel algorithms for Dandelion-like codes. Namely, we design a unique encoding algorithm and a unique decoding algorithm that, properly parametrized, can be used for all Dandelion-like codes. These algorithms are optimal in the sequential setting. The encoding algorithm implementation on an EREW PRAM is optimal, while the efficient implementation of the decoding algorithm requires concurrent reading. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Toward a Fuzzy Domain Ontology Extraction Method for Adaptive e-Learning
Authors: Raymond Y. K. Lau, Dawei Song, Yuefeng Li, Terence C. H. Cheung, Jin-Xing Hao
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

With the widespread applications of electronic learning (e-Learning) technologies to education at all levels, increasing number of online educational resources and messages are generated from the corresponding e-Learning environments. Nevertheless, it is quite difficult, if not totally impossible, for instructors to read through and analyze the online messages to predict the progress of their students on the fly. The main contribution of this paper is the illustration of a novel concept map generation mechanism which is underpinned by a fuzzy domain ontology extraction algorithm. The proposed mechanism can automatically construct concept maps based on the messages posted to online discussion forums. By browsing the concept maps, instructors can quickly identify the progress of their students and adjust the pedagogical sequence on the fly. Our initial experimental results reveal that the accuracy and the quality of the automatically generated concept maps are promising. Our research work opens the door to the development and application of intelligent software tools to enhance e-Learning.
A distributed control framework for performance management of virtualized computing environments: some preliminary results
Authors: Rui Wang, Nagarajan Kandasamy
Venue: Proceedings of the 1st workshop on Automated control for datacenters and clouds (2009)

There is growing incentive to reduce the power consumed by data centers. Virtualization is a promising approach to consolidating multiple online services onto a smaller number of computing resources. By dynamically provisioning virtual machines, consolidating the workload, and turning servers on and off as needed, data center operators can maintain desired service-level agreements with end users while achieving higher server utilization and energy efficiency. This paper proposes a distributed cooperative control framework for the power and performance management of virtualized computing environments, and presents some preliminary results aimed at establishing the feasibility of this approach.
Particle Filter SLAM with High Dimensional Vehicle Model
Authors: David Törnqvist, Thomas B. Schön, Rickard Karlsson, Fredrik Gustafsson
Venue: Journal of Intelligent and Robotic Systems (2009)

This work presents a particle filter method closely related to Fastslam for solving the simultaneous localization and mapping (slam) problem. Using the standard Fastslam algorithm, only low-dimensional vehicle models can be handled due to computational constraints. In this work, an extra factorization of the problem is introduced that makes high-dimensional vehicle models computationally feasible. Results using experimental data from an unmanned aerial vehicle (helicopter) are presented. The proposed algorithm fuses measurements from on-board inertial sensors (accelerometer and gyro), barometer, and vision in order to solve the slam problem.
Constraint Models for Sequential Planning
Authors: Roman Barták, Daniel Toropila
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Planning and constraint satisfaction are important areas of Artificial Intelligence, but surprisingly constraint satisfaction techniques are not widely applied to planning problems where dedicated solving algorithms dominate. Classical AI planning deals with finding a sequence of actions that transfer the initial state of the world into a desired state. One of the main difficulties of planning is that the size of the solution --- the length of the plan --- is unknown in advance. On the other hand, a constraint satisfaction problem needs to be fully specified in advance before the constraint model goes to the solver. As Kautz and Selman showed, the problem of shortest-plan planning can be translated to a series of SAT problems, where each SAT instance encodes the problem of finding a plan of a given length. First, we start with finding a plan of length 1 and if it does not exist then we continue with a plan of length 2 etc. until the plan is found. The same approach can be applied when constraint satisfaction is used instead of SAT. There exists a straightforward constraint model of this type but more advanced constraint models exploit the structure of a so called planning graph, namely GP-CSP and CSP-PLAN. There also exist hand-crafted constraint models for particular planning problems such as CPlan. All these models share the logical representation of the problem where Boolean variables describe whether a given proposition holds in a given state and whether a given action is applied to a given state. Constraints are in the form of logical formulae (frequently implications). In our opinion, these models do not exploit fully the potential of constraint satisfaction, namely domain filtering techniques and global constraints. Therefore, we suggested to use multi-valued representation of states based on the state variable formalism SAS + that contributes to fewer variables with larger domains where domain filtering pays off. Also, we proposed to encapsulate the sets of logical constraints into combinatorial constraints with an extensionally defined set of admissible tuples. This extended abstract summarizes our recent results in the design of constraint models for planning problems presented in [1,2].
IBM MQ Series and Websphere MQ Interview Questions, Answers, and Explanations: Unofficial MQ Series Certification Review
Authors: Terry Sanchez-Clark
Venue:  (2007)

The Ultimate Reference & Learning Guide for Websphere MQ and IBM MQ Series careers! Over 150 Certification Questions, Answers, and Explanations IBM Websphere MQ (Formerly MQ Series) in many ways started the multiplatform messaging revolution, and has now become an indispensable skill set for Information Technology professionals. From beginners looking for information to prepare for an interview, to project managers looking to screen candidates - this book will help you understand what you need to know about MQ, and what you can safely ignore. The book starts by providing an overview of WebSphere MQ architecture, describing the brand of technologies - and then provides a comprehensive set of questions, answers, and explanations that will allow the reader to quickly understand the most important issues in IBM MQ. This book is for readers who must absolutely land their next job in MQ Series, and who want to improve their existing positions. Equity Press readers have a need for information they can use right now. Our series of IBM interview questions books is a direct answer to that need for instant information in the modern workplace. Our books are written by IBM practitioners and expert authors who have varied vast experiences in the world of information technology. If great careers begin with a good book, the best careers begin with Equity Press. Key topics include: Operation and Maintenance, Interaction with DB2, Security and Authentication, Tips & Tricks
Qualities in Possible Worlds
Authors: Stefano Borgo, Claudio Masolo
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

The paper analyzes how and under which assumptions it is possible to compare (in a relationist setting and relatively to qualities) entities living in different worlds. We begin with a standard technique to construct quality kinds via an abstraction process. In the first case, the process is applied across all the possible worlds and we show that the resulting quality system has problematic consequences. Then, we focus on the alternatives that arise when the abstraction process is applied within each single world independently, i.e., assuming similarity judgments make sense only when referring to entities living in the same world. This situation leads to worlds with unrelated quality systems and we look at the problem of quality comparison across worlds. We analyze under which assumptions this comparison is possible and discuss its limits by considering the structural information that one can infer from the elements shared by (two or more) overlapping worlds. Exploiting the use of such information and comparing this situation with the construction of time in branching worlds, it becomes possible to relate and (in a sense to be explained) to 'tune' the quality systems of different worlds. Motivations for this work come from epistemological considerations. Consider a possible world as a context or an information system. The framework we develop helps to understand whether the quality systems of the two contexts (information systems) can be related and, if so, it provides a basic methodology to formally link them.
Exploring Bad Code Smells Dependencies
Authors: Błażej Pietrzak, Bartosz Walter
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Code smells reveal in different ways: with code metrics, existence of particular elements in an abstract syntax tree, specific code behavior or subsequent changes in the code. One of the least explored smell indicators is the presence of other smells. In the paper we discuss and analyze different relations existing among smells and suggest how to exploit this information in order to facilitate discovering of other smells. The considerations are completed with analysis of a Large Class smell and its related odors within a popular open source project codebase.
A model-driven environment for the deployment of pervasive service-oriented applications
Authors: Antonin Chazalet, Philippe Lalanda
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

Service-oriented computing (SOC) defines an application as an assembly of loosely coupled software elements: services. Nowadays, SOC is very technology-driven. Engineers have to deal with numerous technologies for describing, publishing services and creating and manipulating services applications. In particular, the deployment of serviceoriented applications is a complex task, restricted to experts. By deploying, we mean installing, activating, deactivating, maintaining and deinstalling. This paper presents a modeldriven approach for the context-aware deployment of service-oriented applications in constrained services execution environments. This approach is based on several deployment-oriented meta-models and has been implemented in a tool. This work has been validated on an industrial use case.
Collaboration and Cognitive Tutoring: Integration, Empirical Results, and Future Directions
Authors: Andreas Harrer, Bruce M. McLaren, Erin Walker, Lars Bollen, Jonathan Sewall
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this paper, we describe progress we have made toward providing cognitive tutoring to students within a collaborative software environment. First, we have integrated a collaborative software tool, Cool Modes, with software designed to develop Cognitive Tutors (the Cognitive Tutor Authoring Tool). Our initial integration provides a means to capture data that acts as the foundation of a tutor for collaboration but does not yet fully support actual tutoring. Second, we've performed two exploratory studies in which dyads of students used our software to collaborate in solving modelling tasks. These studies uncovered five dimensions of observed behavior that point to the need for abstraction of student actions to better recognize, analyze, and correct collaborative steps in problem solving. We discuss plans to incorporate such analyses into our approach and to extend our tools to eventually provide tutoring of collaboration.
Engineering Utopia
Authors: J. Storrs Hall
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

The likely advent of AGI and the long-established trend of improving computational hardware promise a dual revolution in coming decades: machines which are both more intelligent and more numerous than human beings. This possibility raises substantial concern over the moral nature of such intelligent machines, and of the changes they will cause in society. Will we have the chance to determine their moral character, or will evolutionary processes and/or runaway self-improvement take the choices out of our hands?
A colour space based on the image content
Authors: Javier Vazquez, Maria Vanrell, Anna Salvatella, Eduard Vazquez
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

The main goal of this paper is to define a new colour space that represents the colour information of the image in such a way to give a more coherent spatiochromatic representation. This space can allow to improve the performance of the algorithms of blob detection. To build the space we base colour representation on the ridges of the colour image distribution since it has been proved that they capture the essential colours of the image. Then we will define a colour space where each channel depends on one of the ridges. Finally, to select the essential channels we apply a Constraint Satisfaction algorithm that allows to get a reduced number of channels minimizing the correlation between them.
Fuzzy Systems in Biomedicine
Authors: Georgios Dounias
Venue: Proceeding of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies (2007)

The chapter presents recent advances of fuzzy systems in biomedicine. A short introduction is made on the main concepts of fuzzy sets theory. Then, a survey of recent research reports (2000 and beyond) is performed, in order to map existing theoretical trends in fuzzy systems in biomedicine, as well as important real-world biomedical applications using fuzzy sets theory. The surveyed research reports are divided into different categories either (a) according to the medical practice (diagnosis, therapy and imaging-including signal processing) or (b) according to the kind of problem faced (device control, biological control, classification and pattern analysis, and prediction-association). Recently emerging biological topics related to gene expression data, molecular-cellular analysis and bioinformatics, using fuzzy sets theory, are also reported in the chapter.
The Impact of CABLE on Teaching Computer Programming
Authors: Ioana Chan Mow, Wing K. Au, Gregory C. R. Yates
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper reports the second of two studies on the impact of a Cognitive Apprenticeship-Based Learning Environment (CABLE) in the teaching of computer programming. The pedagogical model used in this study employs a combination of instructional strategies including directive support, responsive cognitive apprenticeship, collaborative learning, stimulating metacognition, using technologies via the use of tele-apprenticeship and online discussion. In an earlier study, students who participated within the CABLE project scored more highly on test scores, relative to comparable students who did not participate within CABLE, but these effects were found to be restricted to high-ability students. In the present study, students who participated within CABLE scored more highly than those participating within the non-CABLE group. However, with an enhanced CABLE environment, the benefits of CABLE were now evident in both ability groups, with the effects being more prominent within the low-ability group.
Model cortical responses for the detection of perceptual onsets and beat tracking in singing
Authors: Martin Coath, Susan L. Denham, Leigh M. Smith, Henkjan Honing, Amaury Hazan, Piotr Holonowicz, Hendrik Purwins
Venue: Connection Science (2009)

We describe a biophysically motivated model of auditory salience based on a model of cortical responses and present results that show that the derived measure of salience can be used to identify the position of perceptual onsets in a musical stimulus successfully. The salience measure is also shown to be useful to track beats and predict rhythmic structure in the stimulus on the basis of its periodicity patterns. We evaluate the method using a corpus of unaccompanied freely sung stimuli and show that the method performs well, in some cases better than state-of-the-art algorithms. These results deserve attention because they are derived from a general model of auditory processing and not an arbitrary model achieving best performance in onset detection or beat-tracking tasks.