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

Poorly differentiated clusters (PDC) in colorectal cancer: what is and ought to be known.

BACKGROUND: The counting of poorly differentiated clusters of 5 or more cancer cells lacking a gland-like structure in a tumor mass has recently been identified among the histological features predictive of poor prognosis in colorectal cancer. MAIN BODY: Poorly differentiated clusters can easily be recognized in the histological sections of colorectal cancer routinely stained with haematoxylin and eosin. Despite some limitations related to specimen fragmentation, counting can also be assessed in endoscopic biopsies. Based on the number of poorly differentiated clusters that appear under a microscopic field of a ×20 objective lens (i.e., a microscopic field with a major axis of 1 mm), colorectal cancer can be graded into malignancies as follows: tumors with <5 clusters as grade 1, tumors with 5 to 9 clusters as grade 2, and tumors with ≥10 clusters as grade 3. High poorly differentiated cluster counts are significantly associated with peri-neural and lympho-vascular invasion, the presence of nodal metastases or micrometastases, as well as shorter overall and progression free survival to colorectal cancer. CONCLUSION: The morphological aspects and clinical relevance of poorly differentiated clusters counting in colorectal cancer are discussed in this review.

A Forwarding Cooperation Protocol for Plain and Cluster-based Ad Hoc Networks

Peer-reviewed

Emergence and development of a financial cluster: the evolution of Andorra’s banking deposits in the long-term, 1931-2007

This paper explores the origins of Andorra’s financial cluster. It shows that the free movement of currency, the protection of infant industry, and geographical concentration lie at the foundation of the cluster’s competitive advantage. Drawing on a new set of data, the paper also provides for the first time an estimate of the total deposits held by Andorra’s banks between 1931 and 2007. Based on this new information, the paper reaches the conclusion that the development of the cluster went through four distinct phases in which large companies, acting as leaders, played an important role in enhancing the cluster’s business capabilities.

Optical Encryption using Photon-Counting Polarimetric Imaging

We present a polarimetric-based optical encoder for image encryption and verification. A system for generating random polarized vector keys based on a Mach-Zehnder configuration combined with translucent liquid crystal displays in each path of the interferometer is developed. Polarization information of the encrypted signal is retrieved by taking advantage of the information provided by the Stokes parameters. Moreover, photon-counting model is used in the encryption process which provides data sparseness and nonlinear transformation to enhance security. An authorized user with access to the polarization keys and the optical design variables can retrieve and validate the photon-counting plain-text. Optical experimental results demonstrate the feasibility of the encryption method.

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

Aspectos técnicos envolvidos na construção de um "cluster beowulf"

Beowulf cluster is perhaps the cheapest way to construct a high performance computers. The strategy of reaching a high power computing isn't so difficult, but buying and configurating should be done carefully. Technical aspects of hardware components and message-passing libraries are considered, with some results given as 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

Quantum-to-classical crossover in full counting statistics

The reduction of quantum scattering leads to the suppression of shot noise. In this Letter, we analyze the crossover from the quantum transport regime with universal shot noise to the classical regime where noise vanishes. By making use of the stochastic path integral approach, we find the statistics of transport and the transmission properties of a chaotic cavity as a function of a system parameter controlling the crossover. We identify three different scenarios of the crossover.

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 role of fast atom bombardment mass spectroscopy (FABMS) in cluster characterization

Fast atom bombardment mass spectroscopy has been used to study a large number of cationic phosphine-containing transition-metal-gold clusters, which ranged in mass from 1000 to 4000. Many of these clusters have been previously characterized and were examined in order to test the usefulness of the FABMS technique. Results showed that FABMS is excellent in giving the correct molecular formula and when combined with NMR, IR, and microanalysis gave a reliable characterization for cationic clusters¹. Recently FABMS has become one of the techniques employed as routine in cluster characterization2,3 and also is an effective tool for the structure analysis of large biomolecules4. Some results in the present work reinforce the importance of these data in the characterization of clusters in the absence of crystals with quality for X-ray analysis.

Cómo aplicar un cluster jerárquico en SPSS

L'anàlisi de conglomerats o cluster és una tècnica multivariant que busca agrupar elements o variables tractant d'aconseguir la màxima homogeneïtat en cada grup i la major diferència entre ells, mitjançant una estructura jerarquitzada per poder decidir quin nivell jeràrquic és el més apropiat per establir la classificació. El programa SPSS disposa de tres tipus d'anàlisi de conglomerats: l'anàlisi de conglomerats jeràrquic, bietàpic i de K mitjanes. Aplicarem el mètode jeràrquic com el més idoni per determinar el nombre òptim de conglomerats existent en les dades i el contingut dels mateixos per al nostre cas pràctic.

A Fair and Secure Cluster Formation Process for Ad Hoc Networks

An efficient approach for organizing large ad hoc networks is to divide the nodesinto multiple clusters and designate, for each cluster, a clusterhead which is responsible forholding intercluster control information. The role of a clusterhead entails rights and duties.On the one hand, it has a dominant position in front of the others because it manages theconnectivity and has access to other node¿s sensitive information. But on the other hand, theclusterhead role also has some associated costs. Hence, in order to prevent malicious nodesfrom taking control of the group in a fraudulent way and avoid selfish attacks from suitablenodes, the clusterhead needs to be elected in a secure way. In this paper we present a novelsolution that guarantees the clusterhead is elected in a cheat-proof manner.