Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted

Sedation palliative: aspects cliniques pratiques [Clinical and practical aspects of palliative sedation]

Un certain nombre de patients palliatifs en fin de vie présentent des symptômes qui ne peuvent pas être soulagés malgré la mise en oeuvre de tous les moyens traditionnels à disposition. Pour ces patients, lorsque des symptômes réfractaires induisent une souffrance intolérable, la sédation palliative est un moyen de dernier recours qui peut leur offrir un soulagement transitoire ou même définitif. Tout en présentant les enjeux éthiques, cet article explore les dimensions cliniques d'ordre pratique qui peuvent se présenter lors d'une sédation palliative chez un patient en fin de vie. Patients at the end-of-life may present with refractory symptoms which cannot be adequately relieved despite the use of all traditional means. When refractory symptoms lead to intolerable suffering, palliative sedation is a last recourse temporary or definitive treatment. While discussing ethical issues, clinical practice dimensions of palliative sedation are explored in this article

A practical guide for the formulation of propositions in the bayesian approach to DNA evidence interpretation in an adversarial environment

The interpretation of complex DNA profiles is facilitated by a Bayesian approach. This approach requires the development of a pair of propositions: one aligned to the prosecution case and one to the defense case. This note explores the issue of proposition setting in an adversarial environment by a series of examples. A set of guidelines generalize how to formulate propositions when there is a single person of interest and when there are multiple individuals of interest. Additional explanations cover how to handle multiple defense propositions, relatives, and the transition from subsource level to activity level propositions. The propositions depend on case information and the allegations of each of the parties. The prosecution proposition is usually known. The authors suggest that a sensible proposition is selected for the defense that is consistent with their stance, if available, and consistent with a realistic defense if their position is not known.

Fingermark age determinations: legal considerations, review of the literature and practical propositions

The question of the age of fingermarks is often raised in investigations and trials when suspects admit that they have left their fingermarks at a crime scene but allege that the contact occurred at a different time than the crime and for legal reasons. In the first part of this review article, examples from American appellate court cases will be used to demonstrate that there is a lack of consensus among American courts regarding the admissibility and weight of testimony from expert witnesses who provide opinions about the age of fingermarks. Of course, these issues are not only encountered in America but have also been reported elsewhere, for example in Europe. The disparity in the way fingermark dating cases were managed in these examples is probably due to the fact that no methodology has been validated and accepted by the forensic science community so far. The second part of this review article summarizes the studies reported on fingermark dating in the literature and highlights the fact that most proposed methodologies still suffer from limitations preventing their use in practice. Nevertheless, several approaches based on the evolution of aging parameters detected in fingermark residue over time appear to show promise for the fingermark dating field. Based on these approaches, the definition of a formal methodological framework for fingermark dating cases is proposed in order to produce relevant temporal information. This framework identifies which type of information could and should be obtained about fingermark aging and what developments are still required to scientifically address dating issues.

The practical application of e-Portfolio at the Open University of Catalonia : assessment of competence based learning

The paper presents the results of the piloting or pilot test in a virtual classroom. This e-portfolio was carried out in the 2005-2006 academic year, with students of the Doctorate in Information Society, at the Open University of Catalonia. The electronic portfolio is a strategy for competence based assessment. This experience shows the types of e-portfolios, where students show their work without interactions, and apply the competence-based learning theories in an interactive portfolio system. The real process of learning is developed in the competency based system, the portfolio not only is a basic bio document, has become a real space for learning with competence model. The paper brings out new ideas and possibilities: the competence-based learning promotes closer relationships between universities and companies and redesigns the pedagogic act.

Pose-based SLAM with probabilistic scan matching algorithm using a mechanical scanned imaging sonar

This paper proposes a pose-based algorithm to solve the full SLAM problem for an autonomous underwater vehicle (AUV), navigating in an unknown and possibly unstructured environment. The technique incorporate probabilistic scan matching with range scans gathered from a mechanical scanning imaging sonar (MSIS) and the robot dead-reckoning displacements estimated from a Doppler velocity log (DVL) and a motion reference unit (MRU). The proposed method utilizes two extended Kalman filters (EKF). The first, estimates the local path travelled by the robot while grabbing the scan as well as its uncertainty and provides position estimates for correcting the distortions that the vehicle motion produces in the acoustic images. The second is an augment state EKF that estimates and keeps the registered scans poses. The raw data from the sensors are processed and fused in-line. No priory structural information or initial pose are considered. The algorithm has been tested on an AUV guided along a 600 m path within a marina environment, showing the viability of the proposed approach

A concurrent region growing algorithm guided by circumscribed contours

Image segmentation of natural scenes constitutes a major problem in machine vision. This paper presents a new proposal for the image segmentation problem which has been based on the integration of edge and region information. This approach begins by detecting the main contours of the scene which are later used to guide a concurrent set of growing processes. A previous analysis of the seed pixels permits adjustment of the homogeneity criterion to the region's characteristics during the growing process. Since the high variability of regions representing outdoor scenes makes the classical homogeneity criteria useless, a new homogeneity criterion based on clustering analysis and convex hull construction is proposed. Experimental results have proven the reliability of the proposed approach

Seleção de variáveis em QSAR

The process of building mathematical models in quantitative structure-activity relationship (QSAR) studies is generally limited by the size of the dataset used to select variables from. For huge datasets, the task of selecting a given number of variables that produces the best linear model can be enormous, if not unfeasible. In this case, some methods can be used to separate good parameter combinations from the bad ones. In this paper three methodologies are analyzed: systematic search, genetic algorithm and chemometric methods. These methods have been exposed and discussed through practical examples.

Shout and Act: an Algorithm for Digital Objects Preservation Inspired from Rescue Robots

We adapt the Shout and Act algorithm to Digital Objects Preservation where agents explore file systems looking for digital objects to be preserved (victims). When they find something they “shout” so that agent mates can hear it. The louder the shout, the urgent or most important the finding is. Louder shouts can also refer to closeness. We perform several experiments to show that this system works very scalably, showing that heterogeneous teams of agents outperform homogeneous ones over a wide range of tasks complexity. The target at-risk documents are MS Office documents (including an RTF file) with Excel content or in Excel format. Thus, an interesting conclusion from the experiments is that fewer heterogeneous (varying skills) agents can equal the performance of many homogeneous (combined super-skilled) agents, implying significant performance increases with lower overall cost growth. Our results impact the design of Digital Objects Preservation teams: a properly designed combination of heterogeneous teams is cheaper and more scalable when confronted with uncertain maps of digital objects that need to be preserved. A cost pyramid is proposed for engineers to use for modeling the most effective agent combinations

An energy efficient vertical handover decision algorithm

As wireless communications evolve towards heterogeneousnetworks, mobile terminals have been enabled tohandover seamlessly from one network to another. At the sametime, the continuous increase in the terminal power consumptionhas resulted in an ever-decreasing battery lifetime. To that end,the network selection is expected to play a key role on howto minimize the energy consumption, and thus to extend theterminal lifetime. Hitherto, terminals select the network thatprovides the highest received power. However, it has been provedthat this solution does not provide the highest energy efficiency.Thus, this paper proposes an energy efficient vertical handoveralgorithm that selects the most energy efficient network thatminimizes the uplink power consumption. The performance of theproposed algorithm is evaluated through extensive simulationsand it is shown to achieve high energy efficiency gains comparedto the conventional approach.

The Transformation of Practical Teaching Focusing on Dialogic Learning

This study investigates the transformation of practical teaching in a Catalan school, connected to the design, implementation and development of project-based learning, and focusing on dialogic learning to investigate its limits and possibilities. Qualitative and design-based research (DBR) methods are applied. These methods are based on empirical educational research with the theory-driven of learning environments. DBR is proposed and applied using practical guidance for the teachers of the school. It can be associated with the current proposals for Embedding Social Sciences and Humanities in the Horizon 2020 Societal Challenges. This position statement defends the social sciences and the humanities as the most fundamental and important ideas to face all societal challenges. The results of this study show that before the training process, teachers apply dialogic learning in specific moments (for example, when they speak about the weekend); however, during the process and after the process, they work systematically with dialogic learning through the PEPT: they start and finish every activity with a individual and group reflection about their own processes, favouring motivation, reasoning and the implication of all the participants. These results prove that progressive transformations of teaching practice benefit cooperative work in class

Escacs, un sistema intel·ligent

Des dels inicis dels ordinadors com a màquines programables, l’home ha intentat dotar-los de certa intel•ligència per tal de pensar o raonar el més semblant possible als humans. Un d’aquests intents ha sigut fer que la màquina sigui capaç de pensar de tal manera que estudiï jugades i guanyi partides d’escacs. En l’actualitat amb els actuals sistemes multi tasca, orientat a objectes i accés a memòria i gràcies al potent hardware del que disposem, comptem amb una gran varietat de programes que es dediquen a jugar a escacs. Però no hi ha només programes petits, hi ha fins i tot màquines senceres dedicades a calcular i estudiar jugades per tal de guanyar als millors jugadors del món. L’objectiu del meu treball és dur a terme un estudi i implementació d’un d’aquests programes, per això es divideix en dues parts. La part teòrica o de l’estudi, consta d’un estudi dels sistemes d’intel•ligència artificial que es dediquen a jugar a escacs, estudi i cerca d’una funció d’avaluació vàlida i estudi dels algorismes de cerca. La part pràctica del treball es basa en la implementació d’un sistema intel•ligent capaç de jugar a escacs amb certa lògica. Aquesta implementació es porta a terme amb l’ajuda de les llibreries SDL, utilitzant l’algorisme minimax amb poda alfa-beta i codi c++. Com a conclusió del projecte m’agradaria remarcar que l’estudi realitzat m’ha deixat veure que crear un joc d’escacs no era tan fàcil com jo pensava però m’ha aportat la satisfacció d’aplicar tot el que he après durant la carrera i de descobrir moltes altres coses noves.

ContinuousMultimodal Global Optimization with Differential Evolution-Based Methods

Metaheuristic methods have become increasingly popular approaches in solving global optimization problems. From a practical viewpoint, it is often desirable to perform multimodal optimization which, enables the search of more than one optimal solution to the task at hand. Population-based metaheuristic methods offer a natural basis for multimodal optimization. The topic has received increasing interest especially in the evolutionary computation community. Several niching approaches have been suggested to allow multimodal optimization using evolutionary algorithms. Most global optimization approaches, including metaheuristics, contain global and local search phases. The requirement to locate several optima sets additional requirements for the design of algorithms to be effective in both respects in the context of multimodal optimization. In this thesis, several different multimodal optimization algorithms are studied in regard to how their implementation in the global and local search phases affect their performance in different problems. The study concentrates especially on variations of the Differential Evolution algorithm and their capabilities in multimodal optimization. To separate the global and local search search phases, three multimodal optimization algorithms are proposed, two of which hybridize the Differential Evolution with a local search method. As the theoretical background behind the operation of metaheuristics is not generally thoroughly understood, the research relies heavily on experimental studies in finding out the properties of different approaches. To achieve reliable experimental information, the experimental environment must be carefully chosen to contain appropriate and adequately varying problems. The available selection of multimodal test problems is, however, rather limited, and no general framework exists. As a part of this thesis, such a framework for generating tunable test functions for evaluating different methods of multimodal optimization experimentally is provided and used for testing the algorithms. The results demonstrate that an efficient local phase is essential for creating efficient multimodal optimization algorithms. Adding a suitable global phase has the potential to boost the performance significantly, but the weak local phase may invalidate the advantages gained from the global phase.

Lautanauhaohjeen muodostus tavoitekuviosta geneettisellä algoritmilla

Lautanauhatekniikka on monipuolinen menetelmä esimerkiksi kuvioitujen nauhojen kutomiseen, mutta uusien kuvioaiheiden suunnittelu, tai aloittelijalle jo valmiiden ohjeettomien kuviomallien jäljittely, voi helposti käydä työlääksi menetelmän ominaispiirteiden johdosta. Tämän työn tavoitteena oli kehittää ohjelmallinen työkalu auttamaan näissä ongelmissa automatisoimalla kudontaohjeen etsintä käyttäjän laatimalle tavoitekuviolle. Ratkaisumenetelmän perustaksi valittiin geneettinen algoritmi, minkä johdosta työn keskeisintutkimusongelma oli kartoittaa algoritmin perusoperaatioiden parametrien ja tavoitekuvion kompleksisuuden keskinäisiä riippuvuuksia riittävästi toimivien arvosuositusten antamiseen ohjelman tulevassa käytännön käytössä. Työssä ei kehitetty sovellusalueeseen mukautettuja evoluutiooperaatioita, vaan keskityttiin luomaan hyvin tunnetuista elementeistä perusta, jota voi myöhemmin kehittää eteenpäin.