Secure & trusted communication in emergency situations

In this paper we propose SETS, a protocol with main aim to provide secure and private communication during emergency situations. SETS achieves security of the exchanged information, attack resilience and user’s privacy. In addition, SETS can be easily adapted for mobile devices, since field experimental results show the effectiveness of the protocol on actual smart-phone platforms

Individual and Domain Adaptation in Sentence Planning for Dialogue

One of the biggest challenges in the development and deployment of spoken dialogue systems is the design of the spoken language generation module. This challenge arises from the need for the generator to adapt to many features of the dialogue domain, user population, and dialogue context. A promising approach is trainable generation, which uses general-purpose linguistic knowledge that is automatically adapted to the features of interest, such as the application domain, individual user, or user group. In this paper we present and evaluate a trainable sentence planner for providing restaurant information in the MATCH dialogue system. We show that trainable sentence planning can produce complex information presentations whose quality is comparable to the output of a template-based generator tuned to this domain. We also show that our method easily supports adapting the sentence planner to individuals, and that the individualized sentence planners generally perform better than models trained and tested on a population of individuals. Previous work has documented and utilized individual preferences for content selection, but to our knowledge, these results provide the first demonstration of individual preferences for sentence planning operations, affecting the content order, discourse structure and sentence structure of system responses. Finally, we evaluate the contribution of different feature sets, and show that, in our application, n-gram features often do as well as features based on higher-level linguistic representations

Topological phase transition and two dimensional topological insulators in Ge-based thin films

We discuss possible topological phase transitions in Ge-based thin films of Ge(Bi$_x$Sb$_{1-x}$)$_2$Te$_4$ as a function of layer thickness and Bi concentration $x$ using the first principles density functional theory framework. The bulk material is a topological insulator at $x$ = 1.0 with a single Dirac cone surface state at the surface Brillouin zone center, whereas it is a trivial insulator at $x$ = 0. Through a systematic examination of the band topologies we predict that thin films of Ge(Bi$_x$Sb$_{1-x}$)$_2$Te$_4$ with $x$ = 0.6, 0.8 and 1.0 are candidates for two-dimensional (2D) topological insulators, which would undergo a 2D topological phase transition as a function of $x$. A topological phase diagram for Ge(Bi$_x$Sb$_{1-x}$)$_2$Te$_4$ thin films is presented to help guide their experimental exploration.Comment: 7 pages, 5 figures, Accepted for publication in Physical Review B (2012

Geometric Morphology of Granular Materials

We present a new method to transform the spectral pixel information of a micrograph into an affine geometric description, which allows us to analyze the morphology of granular materials. We use spectral and pulse-coupled neural network based segmentation techniques to generate blobs, and a newly developed algorithm to extract dilated contours. A constrained Delaunay tesselation of the contour points results in a triangular mesh. This mesh is the basic ingredient of the Chodal Axis Transform, which provides a morphological decomposition of shapes. Such decomposition allows for grain separation and the efficient computation of the statistical features of granular materials.Comment: 6 pages, 9 figures. For more information visit http://www.nis.lanl.gov/~bschlei/labvis/index.htm

Privacy-preserving scheme for mobile ad hoc networks.

This paper proposes a decentralized trust establishment protocol for mobile ad hoc networks (MANETs), where nodes establish security associations. In order to achieve privacy and security, we use homomorphic encryption and polynomial intersection so as to find the intersection of two sets. The first set represents a list of recommenders of the initiator and the second set is a list of trusted recommenders of the responder. The intersection of the sets represents a list of nodes that recommend the first node and their recommendations are trusted by the second node. In our experimental results we show that our scheme is effective even if there are 30 trusted nodes