Manipulation and Steering of Hyperbolic Surface Polaritons in Hexagonal Boron Nitride

Hexagonal boron nitride (hBN) is a natural hyperbolic material that supports both volume‐confined hyperbolic polaritons and sidewall‐confined hyperbolic surface polaritons (HSPs). In this work, efficient excitation, control, and steering of HSPs are demonstrated in hBN through engineering the geometry and orientation of hBN sidewalls. By combining infrared nanoimaging and numerical simulations, the reflection, transmission, and scattering of HSPs are investigated at the hBN corners with various apex angles. It is also shown that the sidewall‐confined nature of HSPs enables a high degree of control over their propagation by designing the geometry of hBN nanostructures.     

A Tutorial on Well-Composedness

Due to digitization, usual discrete signals generally present topological paradoxes, such as the connectivity paradoxes of Rosenfeld. To get rid of those paradoxes, and to restore some topological properties to the objects contained in the image, like manifoldness, Latecki proposed a new class of images, called well-composed images, with no topological issues. Furthermore, well-composed images have some other interesting properties: for example, the Euler number is locally computable, boundaries of objects separate background from foreground, the tree of shapes is well defined. Last, but not the least, some recent works in mathematical morphology have shown that very nice practical results can be obtained thanks to well-composed images. Believing in its prime importance in digital topology, we then propose this state of the art of well-composedness, summarizing its different flavors, the different methods existing to produce well-composed signals, and the various topics that are related to well-composedness.     

Prefix-projection global constraint and top-<Emphasis Type="Italic">k</Emphasis> approach for sequential pattern mining

Sequential pattern mining (SPM) is an important data mining problem with broad applications. SPM is a hard problem due to the huge number of intermediate subsequences to be considered. State of the art approaches for SPM (e.g., PrefixSpan Pei et al. 2001) are largely based on the pattern-growth approach, where for each frequent prefix subsequence, only its related suffix subsequences need to be considered, and the database is recursively projected into smaller ones. Many authors have promoted the use of constraints to focus on the most promising patterns according to the interests of the end user. The top-k SPM problem is also used to cope with the difficulty of thresholding and to control the number of solutions. State of the art methods developed for SPM and top-k SPM, though efficient, are locked into a rather rigid search strategy, and suffer from the lack of declarativity and flexibility. Indeed, adding new constraints usually amounts to changing the data-structures used in the core of the algorithm, and combining these new constraints often require new developments. Recent works (e.g. Kemmar et al. 2014; Négrevergne and Guns 2015) have investigated the use of Constraint Programming (CP) for SPM. However, despite their nice declarative aspects, all these modelings have scaling problems, due to the huge size of their constraint networks. To address this issue, we propose the Prefix-Projection global constraint, which encapsulates both the subsequence relation as well as the frequency constraint. Its filtering algorithm relies on the principle of projected databases which allows to keep in the variables domain, only values leading to a frequent pattern in the database. Prefix-Projection filtering algorithm enforces domain consistency on the variable succeeding the current frequent prefix in polynomial time. This global constraint also allows for a straightforward implementation of additional constraints such as size, item membership, regular expressions and any combination of them. Experimental results show that our approach clearly outperforms existing CP approaches and competes well with the state-of-the-art methods on large datasets for mining frequent sequential patterns, sequential patterns under various constraints, and top-k sequential patterns. Unlike existing CP methods, our approach achieves a better scalability.     

Reliable self‐deployment of distributed cloud applications

Cloud applications consist of a set of interconnected software elements distributed over several virtual machines, themselves hosted on remote physical servers. Most existing solutions for deploying such applications require human intervention to configure parts of the system, do not conform to functional dependencies among elements that must be respected when starting them, and do not handle virtual machine failures that can occur when deploying an application. This paper presents a self‐deployment protocol that was designed to automatically configure a set of software elements to be deployed on different virtual machines. This protocol works in a decentralized way, that is, there is no need for a centralized server. It also starts the software elements in a certain order, respecting important architectural invariants. This protocol supports virtual machine and network failures and always succeeds in deploying an application when faced with a finite number of failures. Designing such highly parallel management protocols is difficult; therefore, formal modeling techniques and verification tools were used for validation purposes. The protocol was implemented in Java and was used to deploy industrial applications. Copyright © 2016 John Wiley & Sons, Ltd.     

A French clinical corpus with comprehensive semantic annotations: development of the Medical Entity and Relation LIMSI annOtated Text corpus (MERLOT)

Quality annotated resources are essential for Natural Language Processing. The objective of this work is to present a corpus of clinical narratives in French annotated for linguistic, semantic and structural information, aimed at clinical information extraction. Six annotators contributed to the corpus annotation, using a comprehensive annotation scheme covering 21 entities, 11 attributes and 37 relations. All annotators trained on a small, common portion of the corpus before proceeding independently. An automatic tool was used to produce entity and attribute pre-annotations. About a tenth of the corpus was doubly annotated and annotation differences were resolved in consensus meetings. To ensure annotation consistency throughout the corpus, we devised harmonization tools to automatically identify annotation differences to be addressed to improve the overall corpus quality. The annotation project spanned over 24 months and resulted in a corpus comprising 500 documents (148,476 tokens) annotated with 44,740 entities and 26,478 relations. The average inter-annotator agreement is 0.793 F-measure for entities and 0.789 for relations. The performance of the pre-annotation tool for entities reached 0.814 F-measure when sufficient training data was available. The performance of our entity pre-annotation tool shows the value of the corpus to build and evaluate information extraction methods. In addition, we introduced harmonization methods that further improved the quality of annotations in the corpus.     

Processing time estimations by variable structure TSK rules learned through genetic programming

Accuracy in processing time estimation of different manufacturing operations is fundamental to get more competitive prices and higher profits in an industry. The manufacturing times of a machine depend on several input variables and, for each class or type of product, a regression function for that machine can be defined. Time estimations are used for implementing production plans. These plans are usually supervised and modified by an expert, so information about the dependencies of processing time with the input variables is also very important. Taking into account both premises (accuracy and simplicity in information extraction), a model based on TSK (Takagi–Sugeno–Kang) fuzzy rules has been used. TSK rules fulfill both requisites: the system has a high accuracy, and the knowledge structure makes explicit the dependencies between time estimations and the input variables. We propose a TSK fuzzy rule model in which the rules have a variable structure in the consequent, as the regression functions can be completely distinct for different machines or, even, for different classes of inputs to the same machine. The methodology to learn the TSK knowledge base is based on genetic programming together with a context-free grammar to restrict the valid structures of the regression functions. The system has been tested with real data coming from five different machines of a wood furniture industry.

Do graphical overviews facilitate or hinder comprehension in hypertext?

Educational hypertexts usually include graphical overviews, conveying the structure of the text schematically with the aim of fostering comprehension. Despite the claims about their relevance, there is currently no consensus on the impact that hypertext overviews have on the reader’s comprehension. In the present paper we have explored how hypertext overviews might affect comprehension with regard to (a) the time at which students read the overview and (b) the hypertext difficulty. The results from two eye-tracking studies revealed that reading a graphical overview at the beginning of the hypertext is related to an improvement in the participant’s comprehension of quite difficult hypertexts, whereas reading an overview at the end of the hypertext is linked to a decrease in the student’s comprehension of easier hypertexts. These findings are interpreted in light of the Assimilation Theory and the Active Processing model. Finally, the key educational and hypertext design implications of the results are discussed.     

Multiframe Motion Segmentation with Missing Data Using PowerFactorization and GPCA

We consider the problem of segmenting multiple rigid-body motions from point correspondences in multiple affine views. We cast this problem as a subspace clustering problem in which point trajectories associated with each motion live in a linear subspace of dimension two, three or four. Our algorithm involves projecting all point trajectories onto a 5-dimensional subspace using the SVD, the PowerFactorization method, or RANSAC, and fitting multiple linear subspaces representing different rigid-body motions to the points in ℝ⁵ using GPCA. Unlike previous work, our approach does not restrict the motion subspaces to be four-dimensional and independent. Instead, it deals gracefully with all the spectrum of possible affine motions: from two-dimensional and partially dependent to four-dimensional and fully independent. Our algorithm can handle the case of missing data, meaning that point tracks do not have to be visible in all images, by using the PowerFactorization method to project the data. In addition, our method can handle outlying trajectories by using RANSAC to perform the projection. We compare our approach to other methods on a database of 167 motion sequences with full motions, independent motions, degenerate motions, partially dependent motions, missing data, outliers, etc. On motion sequences with complete data our method achieves a misclassification error of less that 5% for two motions and 29% for three motions.     

Robust H∞ static output‐feedback control for discrete‐time fuzzy systems with actuator saturation via fuzzy Lyapunov functions

In this paper, we present a new scheme for designing a H_∞ stabilizing controller for discrete‐time Takagi‐Sugeno fuzzy systems with actuator saturation and external disturbances. The weighting‐dependent Lyapunov functions approach is used to design a robust static output‐feedback controller. To address the input saturation problem, both constrained and saturated control input cases are considered. In both cases, stabilization conditions of the fuzzy system are formulated as a convex optimization problem in terms of linear matrix inequalities. Two simulation examples are included to illustrate the effectiveness of the proposed design methods. A comparison with the results given in recent literature on the subject is also presented.     

Study of metamaterial surface wave antenna based on split ring resonator

Microsystem Technologies - In this paper, a new metamaterial-inspired high frequency surface wave antenna is designed. An artificial magnetic conductor surface is introduced into the near field...