Pattern analysis of dermoscopic images based on Markov random fields

In this paper a method for detecting different patterns in dermoscopic images is presented. In order to diagnose a possible skin cancer, physicians assess the lesion based on different rules. While the most famous one is the ABCD rule (asymmetry, border, colour, diameter), the new tendency in dermatology is to classify the lesion performing a pattern analysis. Due to the colour textured appearance of these patterns, this paper presents a novel method based on Markov random field (MRF) extended for colour images that classifies images representing different dermatologic patterns. First, each image plane in L^*a^*b^* colour space is modelled as a MRF following a finite symmetric conditional model (FSCM). Coupling of colour components is taken into account by supposing that features of the MRF in the three colour planes follow a multivariate Normal distribution. Performance is analysed in different colour spaces. The best classification rate is 86% on average.     

Task-Space Modular Dynamics for Dual-Arms Expressed through a Relative Jacobian

This paper presents modular dynamics for dual-arms, expressed in terms of the kinematics and dynamics of each of the stand-alone manipulators. The two arms are controlled as a single manipulator in the task space that is relative to the two end-effectors of the dual-arm robot. A modular relative Jacobian, derived from a previous work, is used which is expressed in terms of the stand-alone manipulator Jacobians. The task space inertia is expressed in terms of the Jacobians and dynamics of each of the stand-alone manipulators. When manipulators are combined and controlled as a single manipulator, as in the case of dual-arms, our proposed approach will not require an entirely new dynamics model for the resulting combined manipulator. But one will use the existing Jacobians and dynamics model for each of the stand-alone manipulators to come up with the dynamics model of the combined manipulator. A dual-arm KUKA is used in the experimental implementation.     

Authorship verification applied to detection of compromised accounts on online social networks

Compromising legitimate accounts has been the most used strategy to spread malicious content on OSN (Online Social Network). To address this problem, we propose a pure text mining approach to check if an account has been compromised based on its posts content. In the first step, the proposed approach extracts the writing style from the user account. The second step comprehends the k-Nearest Neighbors algorithm (k-NN) to evaluate the post content and identify the user. Finally, Baseline Updating (third step) consists of a continuous updating of the user baseline to support the current trends and seasonality issues of user’s posts. Experiments were carried out using a dataset from Twitter composed by tweets of 1000 users. All the three steps were individually evaluated, and the results show that the developed method is stable and can detect the compromised accounts. An important observation is the Baseline Updating contribution, which leads to an enhancement of accuracy superior of 60 %. Regarding average accuracy, the developed method achieved results over 93 %.     

The shape of feature code: an analysis of twenty C-preprocessor-based systems

Feature annotations (e.g., code fragments guarded by #ifdef C-preprocessor directives) control code extensions related to features. Feature annotations have long been said to be undesirable. When maintaining features that control many annotations, there is a high risk of ripple effects. Also, excessive use of feature annotations leads to code clutter, hinder program comprehension and harden maintenance. To prevent such problems, developers should monitor the use of feature annotations, for example, by setting acceptable thresholds. Interestingly, little is known about how to extract thresholds in practice, and which values are representative for feature-related metrics. To address this issue, we analyze the statistical distribution of three feature-related metrics collected from a corpus of 20 well-known and long-lived C-preprocessor-based systems from different domains. We consider three metrics: scattering degree of feature constants, tangling degree of feature expressions, and nesting depth of preprocessor annotations. Our findings show that feature scattering is highly skewed; in 14 systems (70 %), the scattering distributions match a power law, making averages and standard deviations unreliable limits. Regarding tangling and nesting, the values tend to follow a uniform distribution; although outliers exist, they have little impact on the mean, suggesting that central statistics measures are reliable thresholds for tangling and nesting. Following our findings, we then propose thresholds from our benchmark data, as a basis for further investigations.     

Applying intelligent agents and semantic web services in eGovernment environments

The increasing volume of eGovernment‐related services is demanding new approaches for service integration and interoperability in this domain. Semantic web (SW) technologies and applications can leverage the potential of eGovernment service integration and discovery, thus tackling the problems of semantic heterogeneity characterizing eGovernment information sources and the different levels of interoperability. eGovernment services will therefore be semantically described in the foreseeable future. In an environment with semantically annotated services, software agents are essential as the entities responsible for exploiting the semantic content in order to automate some tasks, and so enhance the user's experience. In this paper, we present a framework that provides a seamless integration of semantic web services and intelligent agents technologies by making use of ontologies to facilitate their interoperation. The proposed framework can assist in the development of powerful and flexible distributed systems in complex, dynamic, heterogeneous, unpredictable and open environments. Our approach is backed up by a proof‐of‐concept implementation, where the breakthrough of integrating disparate eGovernment services has been tested.     

Superpipelined high-performance optical-flow computation architecture

Optical-flow computation is a well-known technique and there are important fields in which the application of this visual modality commands high interest. Nevertheless, most real-world applications require real-time processing, an issue which has only recently been addressed. Most real-time systems described to date use basic models which limit their applicability to generic tasks, especially when fast motion is presented or when subpixel motion resolution is required. Therefore, instead of implementing a complex optical-flow approach, we describe here a very high-frame-rate optical-flow processing system. Recent advances in image sensor technology make it possible nowadays to use high-frame-rate sensors to properly sample fast motion (i.e. as a low-motion scene), which makes a gradient-based approach one of the best options in terms of accuracy and consumption of resources for any real-time implementation. Taking advantage of the regular data flow of this kind of algorithm, our approach implements a novel superpipelined, fully parallelized architecture for optical-flow processing. The system is fully working and is organized into more than 70 pipeline stages, which achieve a data throughput of one pixel per clock cycle. This computing scheme is well suited to FPGA technology and VLSI implementation. The developed customized DSP architecture is capable of processing up to 170 frames per second at a resolution of 800 × 600 pixels. We discuss the advantages of high-frame-rate processing and justify the optical-flow model chosen for the implementation. We analyze this architecture, measure the system resource requirements using FPGA devices and finally evaluate the system’s performance and compare it with other approaches described in the literature.     

Compact yet efficient hardware implementation of artificial neural networks with customized topology

There are several neural network implementations using either software, hardware-based or a hardware/software co-design. This work proposes a hardware architecture to implement an artificial neural network (ANN), whose topology is the multilayer perceptron (MLP). In this paper, we explore the parallelism of neural networks and allow on-the-fly changes of the number of inputs, number of layers and number of neurons per layer of the net. This reconfigurability characteristic permits that any application of ANNs may be implemented using the proposed hardware. In order to reduce the processing time that is spent in arithmetic computation, a real number is represented using a fraction of integers. In this way, the arithmetic is limited to integer operations, performed by fast combinational circuits. A simple state machine is required to control sums and products of fractions. Sigmoid is used as the activation function in the proposed implementation. It is approximated by polynomials, whose underlying computation requires only sums and products. A theorem is introduced and proven so as to cover the arithmetic strategy of the computation of the activation function. Thus, the arithmetic circuitry used to implement the neuron weighted sum is reused for computing the sigmoid. This resource sharing decreased drastically the total area of the system. After modeling and simulation for functionality validation, the proposed architecture synthesized using reconfigurable hardware. The results are promising.     

Neurotrophic control of ovarian development

Substantial evidence now exists indicating that the neurotrophins, a family of growth factors required for the survival, development, and differentiation of various neuronal populations of the nervous system, are also important for the development of nonneuronal tissues. Such a function was first suggested by studies showing the presence of high-affinity neurotrophin receptors in a variety of nonneuronal tissues including those of the cardiovascular, endocrine, immune, and reproductive systems. Within the latter, the gonads appear to be a preferential site of neurotrophin action as suggested by the presence in the mammalian ovary of at least four of the five known neurotrophins and all of the neurotrophin receptors thus far identified. While the various functions that the neurotrophins may have in the ovary are still being elucidated, it is now clear that in addition to recruiting the ovarian innervation, they play a direct role in the regulation of two different maturational periods that are critical for the acquisition of female reproductive function: early follicular development and ovulation. Neurotrophins facilitate the development of newly formed follicles by promoting the initial differentiation and the subsequent growth of primordial follicles. These actions appear to be related to the ability of neurotrophins to sustain the proliferation of both mesenchymal and granulosa cells, and to induce the synthesis of follicle stimulating hormone (FSH) receptors. At the time of the first ovulation, neurotrophins contribute to the ovulatory cascade by increasing prostaglandin E(2) release, reducing gap junction communication, and inducing cell proliferation within the thecal compartment of preovulatory follicles.     

Nanotribological characterization of human hair and skin using atomic force microscopy

Healthy hair and skin is highly desired. Characterization of their morphological, frictional, and adhesive properties (tribological properties) is essential to enhance understanding of hair and skin and to advance the science. Literature on the tribological characterization of hair and skin is scarce to date. The paper presents nanotribological data and analysis on hair (Caucasian, Asian, and African hair at virgin, chemo-mechanically damaged, and treated conditions) and synthetic hair and skin, as well as roughness data of human skin replica. Roughness statistics are presented to characterize the vertical and spatial surface parameters. Average coefficient of friction values were determined for each ethnicity and hair type, and are discussed. The directionality dependence of friction is also discussed. Magnitude and spatial distribution of adhesive force are used to estimate thickness and distribution of the conditioner film.     

Daily recovery experiences: The role of volunteer work during leisure time.

This study focused on the role of volunteer work for daily recovery from work. In a 1-week diary study with 166 employees, we assessed the amount of time spent on volunteer work during leisure time, and the recovery facets of psychological detachment from work (i.e., mentally switching off from work), mastery experiences (i.e., pursuing challenging activities), and community experiences (i.e., cultivating relationships) every day before participants went to bed. Results from hierarchical linear modeling (n = 529 days) showed volunteer work during leisure time to be positively related to mastery experiences and community experiences suggesting volunteer work to contribute to successful recovery by creating new resources. (PsycINFO Database Record (c) 2010 APA, all rights reserved)