OpenRaiser/Intern-Atlas huggingface dataset:
Modelling Competences for Partner Selection in Service-Oriented Virtual Organization Breeding Environments
Venue: arXiv cs.SE 2011
Year: 2011

In the context of globalization and dynamic markets, collaboration among organizations is a condition sine qua non for organizations, especially small and medium enterprises, to remain competitive. Virtual organizations have been proposed as an organizational structure adapted to collaboration among organizations. The concept of Virtual Organization Breeding Environment (VOBE) has been proposed as a means to support the creation and operation of virtual organizations. With the rise of the service-oriented architecture (SOA), the concept of service-oriented VOBE (SOVOBE) has been proposed as a VOBE systematically organized around the concept of services. In the context of SOVOBEs, novel competence models supporting both service orientation and collaboration among organizations have to be developed to support efficiently partner selection, a key aspect of VO creation. In this paper, such a competence model is presented. Our competence model consists of a competence description model, a competence verification method, and a competence search method. The competence description model is an information model to describe organizations, their competences, and services they provides. The competence verification method enables the verification of the reliance and relevance of competence descriptions. The competence search method allows a VO planner to select appropriate partners based on VO specifications, encompassing competence requirements. Finally, implementation concerns based on the development of the prototype ErGo system are presented.
Efficient Super-Peer-Based Queries Routing: Simulation and Evaluation
Venue: arXiv cs.DB 2011
Year: 2011

Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of internet traffic. P2P systems have emerged as a popular way to share huge volumes of data. Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of P2P systems called schema- based. In such systems each peer is a database management system in itself, ex-posing its own schema. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. In such settings, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. The usability of these systems depends on effective techniques to find and retrieve data; however, efficient and effective routing of content- based queries is an emerging problem in P2P networks. In this paper, we propose an architecture, based on super-peers, and we focus on query routing. Our approach considers that super-Peers having similar interests are grouped together for an efficient query routing method. In such groups, called Knowledge-Super-Peers (KSP), super-peers submit queries that are often processed by members of this group.
Coron : Plate-forme d'extraction de connaissances dans les bases de données
Venue: arXiv cs.DB 2011
Year: 2011

Coron is a domain and platform independent, multi-purposed data mining toolkit, which incorporates not only a rich collection of data mining algorithms, but also allows a number of auxiliary operations. To the best of our knowledge, a data mining toolkit designed specifically for itemset extraction and association rule generation like Coron does not exist elsewhere. Coron also provides support for preparing and filtering data, and for interpreting the extracted units of knowledge.
Tractability results for the Double-Cut-and-Join circular median problem
Venue: arXiv cs.DM 2011
Year: 2011

The circular median problem in the Double-Cut-and-Join (DCJ) distance asks to find, for three given genomes, a fourth circular genome that minimizes the sum of the mutual distances with the three other ones. This problem has been shown to be NP-complete. We show here that, if the number of vertices of degree 3 in the breakpoint graph of the three input genomes is fixed, then the problem is tractable
An image processing of a Raphael's portrait of Leonardo
Venue: arXiv cs.CV 2011
Year: 2011

In one of his paintings, the School of Athens, Raphael is depicting Leonardo da Vinci as the philosopher Plato. Some image processing tools can help us in comparing this portrait with two Leonardo's portraits, considered as self-portraits.
Principles of Solomonoff Induction and AIXI
Venue: arXiv cs.AI 2011
Year: 2011

We identify principles characterizing Solomonoff Induction by demands on an agent's external behaviour. Key concepts are rationality, computability, indifference and time consistency. Furthermore, we discuss extensions to the full AI case to derive AIXI.
Virtual Worlds as a Support to Engineering Teaching
Venue: arXiv cs.CY 2011
Year: 2011

Virtual Worlds (VWs) are an emerging technology used by a growing number of educational institutions around the world. It is an environment, a way of learning and an educational tool that allows different levels of online interaction. In the course "Programming I", of the career Informatics Engineering at Universidad de Valparaíso, we conducted a pilot experience with the VW of Second Life, in order to evaluate the potential of using VWs in the teaching practice.
Threshold phenomena in k-dominant skylines of random samples
Venue: arXiv cs.DS 2011
Year: 2011

Skylines emerged as a useful notion in database queries for selecting representative groups in multivariate data samples for further decision making, multi-objective optimization or data processing, and the $k$-dominant skylines were naturally introduced to resolve the abundance of skylines when the dimensionality grows or when the coordinates are negatively correlated. We prove in this paper that the expected number of $k$-dominant skylines is asymptotically zero for large samples when $1\le k\le d-1$ under two reasonable (continuous) probability assumptions of the input points, $d$ being the (finite) dimensionality, in contrast to the asymptotic unboundedness when $k=d$. In addition to such an asymptotic zero-infinity property, we also establish a sharp threshold phenomenon for the expected ($d-1$)-dominant skylines when the dimensionality is allowed to grow with $n$. Several related issues such as the dominant cycle structures and numerical aspects, are also briefly studied.
A Scalable Video Search Engine Based on Audio Content Indexing and Topic Segmentation
Venue: arXiv cs.MM 2011
Year: 2011

One important class of online videos is that of news broadcasts. Most news organisations provide near-immediate access to topical news broadcasts over the Internet, through RSS streams or podcasts. Until lately, technology has not made it possible for a user to automatically go to the smaller parts, within a longer broadcast, that might interest them. Recent advances in both speech recognition systems and natural language processing have led to a number of robust tools that allow us to provide users with quicker, more focussed access to relevant segments of one or more news broadcast videos. Here we present our new interface for browsing or searching news broadcasts (video/audio) that exploits these new language processing tools to (i) provide immediate access to topical passages within news broadcasts, (ii) browse news broadcasts by events as well as by people, places and organisations, (iii) perform cross lingual search of news broadcasts, (iv) search for news through a map interface, (v) browse news by trending topics, and (vi) see automatically-generated textual clues for news segments, before listening. Our publicly searchable demonstrator currently indexes daily broadcast news content from 50 sources in English, French, Chinese, Arabic, Spanish, Dutch and Russian.
Shape and Trajectory Tracking of Moving Obstacles
Venue: arXiv cs.GR 2011
Year: 2011

This work presents new methods and algorithms for tracking the shape and trajectory of moving reflecting obstacles with broken rays, or rays reflecting at an obstacle. While in tomography the focus of the reconstruction method is to recover the velocity structure of the domain, the shape and trajectory reconstruction procedure directly finds the shape and trajectory of the obstacle. The physical signal carrier for this innovative method are ultrasonic beams. When the speed of sound is constant, the rays are straight line segments and the shape and trajectory of moving objects will be reconstructed with methods based on the travel time equation and ellipsoid geometry. For variable speed of sound, we start with the eikonal equation and a system of differential equations that has its origins in acoustics and seismology. In this case, the rays are curves that are not necessarily straight line segments and we develop algorithms for shape and trajectory tracking based on the numerical solution of these equations. We present methods and algorithms for shape and trajectory tracking of moving obstacles with reflected rays when the location of the receiver of the reflected ray is not known in advance. The shape and trajectory tracking method is very efficient because it is not necessary for the reflected signal to traverse the whole domain or the same path back to the transmitter. It could be received close to the point of reflection or far away from the transmitter. This optimizes the energy spent by transmitters for tracking the object, reduces signal attenuation and improves image resolution. It is a safe and secure method. We also present algorithms for tracking the shape and trajectory of absorbing obstacles. The new methods and algorithms for shape and trajectory tracking enable new applications and an application to one-hop Internet routing is presented.
Optimal Offline Broadcast Scheduling with an Energy Harvesting Transmitter
Venue: arXiv cs.IT 2011
Year: 2011

We consider an energy harvesting transmitter broadcasting data to two receivers. Energy and data arrivals are assumed to occur at arbitrary but known instants. The goal is to minimize the total transmission time of the packets arriving within a certain time window, using the energy that becomes available during this time. An achievable rate region with structural properties satisfied by the two-user AWGN BC capacity region is assumed. Structural properties of power and rate allocation in an optimal policy are established, as well as the uniqueness of the optimal policy under the condition that all the data of the "weaker" user are available at the beginning. An iterative algorithm, DuOpt, based on block coordinate descent that achieves the same structural properties as the optimal is described. Investigating the ways to have the optimal schedule of two consecutive epochs in terms of energy efficiency and minimum transmission duration, it has been shown that DuOpt achieves best performance under the same special condition of uniqueness.
Enhancing Information Systems Security in Educational Organizations in KSA through proposing security model
Venue: arXiv cs.OH 2011
Year: 2011

It is well known that technology utilization is not restricted for one sector than the other anymore, Educational organizations share many parts of their information systems with commercial organizations. In this paper we will try to identify the main characteristics of information systems in educational organizations, then we will propose a model of two parts to enhance the information systems security, the first part of the model will handle the policy and laws of the information system, the second part will provide a technical approach on how to audit and subsequently maintain the security of information system.
Autonomic Management for Multi-agent Systems
Venue: arXiv cs.MA 2011
Year: 2011

Autonomic computing is a computing system that can manage itself by self-configuration, self-healing, self-optimizing and self-protection. Researchers have been emphasizing the strong role that multi agent systems can play progressively towards the design and implementation of complex autonomic systems. The important of autonomic computing is to create computing systems capable of managing themselves to a far greater extent than they do today. With the nature of autonomy, reactivity, sociality and pro-activity, software agents are promising to make autonomic computing system a reality. This paper mixed multi-agent system with autonomic feature that completely hides its complexity from users/services. Mentioned Java Application Development Framework as platform example of this environment, could applied to web services as front end to users. With multi agent support it also provides adaptability, intelligence, collaboration, goal oriented interactions, flexibility, mobility and persistence in software systems
Workbook Structure Analysis - "Coping with the Imperfect"
Venue: arXiv cs.SE 2011
Year: 2011

This Paper summarises the operation of software developed for the analysis of workbook structure. This comprises: the identification of layout in terms of filled areas formed into "Stripes", the identification of all the Formula Blocks/Cells and the identification of Data Blocks/Cells referenced by those formulas. This development forms part of our FormulaDataSleuth toolset. It is essential for the initial "Watching" of an existing workbook and enables the workbook to be subsequently managed and protected from damage.
Spreadsheets in Financial Departments: An Automated Analysis of 65,000 Spreadsheets using the Luminous Technology
Venue: arXiv cs.SE 2011
Year: 2011

Spreadsheet technology is a cornerstone of IT systems in most organisations. It is often the glue that binds more structured transaction-based systems together. Financial operations are a case in point where spreadsheets fill the gaps left by dedicated accounting systems, particularly covering reporting and business process operations. However, little is understood as to the nature of spreadsheet usage in organisations and the contents and structure of these spreadsheets as they relate to key business functions with few, if any, comprehensive analyses of spreadsheet repositories in real organisations. As such this paper represents an important attempt at profiling real and substantial spreadsheet repositories. Using the Luminous technology an analysis of 65,000 spreadsheets for the financial departments of both a government and a private commercial organisation was conducted. This provides an important insight into the nature and structure of these spreadsheets, the links between them, the existence and nature of macros and the level of repetitive processes performed through the spreadsheets. Furthermore it highlights the organisational dependence on spreadsheets and the range and number of spreadsheets dealt with by individuals on a daily basis. In so doing, this paper prompts important questions that can frame future research in the domain.
Towards Evaluating the Quality of a Spreadsheet: The Case of the Analytical Spreadsheet Model
Venue: arXiv cs.SE 2011
Year: 2011

We consider the challenge of creating guidelines to evaluate the quality of a spreadsheet model. We suggest four principles. First, state the domain-the spreadsheets to which the guidelines apply. Second, distinguish between the process by which a spreadsheet is constructed from the resulting spreadsheet artifact. Third, guidelines should be written in terms of the artifact, independent of the process. Fourth, the meaning of "quality" must be defined. We illustrate these principles with an example. We define the domain of "analytical spreadsheet models", which are used in business, finance, engineering, and science. We propose for discussion a framework and terminology for evaluating the quality of analytical spreadsheet models. This framework categorizes and generalizes the findings of previous work on the more narrow domain of financial spreadsheet models. We suggest that the ultimate goal is a set of guidelines for an evaluator, and a checklist for a developer.
In Search of a Taxonomy for Classifying Qualitative Spreadsheet Errors
Venue: arXiv cs.SE 2011
Year: 2011

Most organizations use large and complex spreadsheets that are embedded in their mission-critical processes and are used for decision-making purposes. Identification of the various types of errors that can be present in these spreadsheets is, therefore, an important control that organizations can use to govern their spreadsheets. In this paper, we propose a taxonomy for categorizing qualitative errors in spreadsheet models that offers a framework for evaluating the readiness of a spreadsheet model before it is released for use by others in the organization. The classification was developed based on types of qualitative errors identified in the literature and errors committed by end-users in developing a spreadsheet model for Panko's (1996) "Wall problem". Closer inspection of the errors reveals four logical groupings of the errors creating four categories of qualitative errors. The usability and limitations of the proposed taxonomy and areas for future extension are discussed.
Multimedia-based Medicinal Plants Sustainability Management System
Venue: arXiv cs.OH 2011
Year: 2011

Medicinal plants are increasingly recognized worldwide as an alternative source of efficacious and inexpensive medications to synthetic chemo-therapeutic compound. Rapid declining wild stocks of medicinal plants accompanied by adulteration and species substitutions reduce their efficacy, quality and safety. Consequently, the low accessibility to and non-affordability of orthodox medicine costs by rural dwellers to be healthy and economically productive further threaten their life expectancy. Finding comprehensive information on medicinal plants of conservation concern at a global level has been difficult. This has created a gap between computing technologies' promises and expectations in the healing process under complementary and alternative medicine. This paper presents the design and implementation of a Multimedia-based Medicinal Plants Sustainability Management System addressing these concerns. Medicinal plants' details for designing the system were collected through semi-structured interviews and databases. Unified Modelling Language, Microsoft-Visual-Studio.Net, C#3.0, Microsoft-Jet-Engine4.0, MySQL, Loquendo Multilingual Text-to-Speech Software, YouTube, and VLC Media Player were used. Keywords: Complementary and Alternative Medicine, conservation, extinction, medicinal plant, multimedia, phytoconstituents, rural dwellers
Architecture of a Conference Management System Providing Advanced Paper Assignment Features
Venue: arXiv cs.DL 2011
Year: 2011

This paper proposes an architecture and assignment management model of a conference management system that performs a precise and accurate automatic assignment of reviewers to papers. The system relies on taxonomy of keywords to describe papers and reviewers' competences. The implied hierarchical structure of the taxonomy provides important additional information - the semantic relationships between the separate keywords. It allows similarity measures to take into account not only the number of exactly matching keywords between a paper and a reviewer, but in case of non-matching ones to calculate how semantically close they are. Reviewers are allowed to bid on the papers they would like to (or not like to) review and to explicitly state conflicts of interest (CoI) with papers. An automatic CoI detection is checking for additional conflicts based on institutional affiliation, co-authorship (within the local database) and previous co-authorship in the past (within the major bibliographic indexes and digital libraries). The algorithm for automatic assignment takes into account all - selected keywords, reviewers' bids and conflicts of interest and tries to find the most accurate assignment while maintaining load balancing among reviewers.
Reflexivity and the diagonal argument in proofs of limitative theorems
Venue: arXiv cs.LO 2011
Year: 2011

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. Gödel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-Gödel's theorem). The fact, that a formal system contains a sentence, which introduces reflexitivity, does not imply, that the same system does not contain a sentence or a proof procedure which solves this problem. Second basic method of proof - diagonal argument (i.e. showing non-eqiunumerosity of a program set with the set of real numbers) does not exclude existance of a single program, capable of computing all real numbers. In this work, we suggest an algorithm generating real numbers (arbitrary, infinite in the limit, binary strings), and we speculate it's meaning for theoretical computer science.
Aggregation of Composite Solutions: strategies, models, examples
Venue: arXiv cs.SE 2011
Year: 2011

The paper addresses aggregation issues for composite (modular) solutions. A systemic view point is suggested for various aggregation problems. Several solution structures are considered: sets, set morphologies, trees, etc. Mainly, the aggregation approach is targeted to set morphologies. The aggregation problems are based on basic structures as substructure, superstructure, median/consensus, and extended median/consensus. In the last case, preliminary structure is built (e.g., substructure, median/consensus) and addition of solution elements is considered while taking into account profit of the additional elements and total resource constraint. Four aggregation strategies are examined: (i) extension strategy (designing a substructure of initial solutions as "system kernel" and extension of the substructure by additional elements); (ii) compression strategy (designing a superstructure of initial solutions and deletion of some its elements); (iii) combined strategy; and (iv) new design strategy to build a new solution over an extended domain of solution elements. Numerical real-world examples (e.g., telemetry system, communication protocol, student plan, security system, Web-based information system, investment, educational courses) illustrate the suggested aggregation approach.
Relay Selection for Two-way Relaying with Amplify-and-Forward Protocols
Venue: arXiv cs.IT 2011
Year: 2011

In this paper, we propose a relay selection amplify-and-forward (RS-AF) protocol in general bi-directional relay networks with two sources and $N$ relays. In the proposed scheme, the two sources first transmit to all the relays simultaneously, and then a single relay with a minimum sum symbol error rate (SER) will be selected to broadcast the received signals back to both sources. To facilitate the selection process, we propose a simple sub-optimal Min-Max criterion for relay selection, where a single relay which minimizes the maximum SER of two source nodes will be selected. Simulation results show that the proposed Min-Max selection has almost the same performance as the optimal selection with lower complexity. We also present a simple asymptotic SER expression and make comparison with the conventional all-participate amplify-and-forward (AP-AF) relaying scheme. The analytical results are verified through simulations. To improve the system performance, optimum power allocation (OPA) between the sources and the relay is determined based on the asymptotic SER. Simulation results indicate that the proposed RS-AF scheme with OPA yields considerable performance improvement over an equal power allocation (EPA) scheme, specially with large number of relay nodes.