Smart Web Services (SmartWS)
The past few years have been marked by an increased use of sensor technologies, abundant availability of mobile devices, and growing popularity of wearables, which enable the direct integration of their data as part of rich client applications. Despite the potential and added value that such aggregate applications bring, the implementations are usually custom solutions for particular use cases and do not support easy integration of further devices. To this end, the vision of the Web of Things (WoT) is to leverage Web standards in order to interconnect all types of devices and real-world objects, and thus to make them a part of the World Wide Web (WWW) and provide overall interoperability. In this context we introduce Smart Web Services (SmartWS) that not only provide remote access to resources and functionalities, by relying on standard communication protocols, but also encapsulate `intelligence’. Smartness features can include, for instance, context-based adaptation, cognition, inference and rules that implement autonomous decision logic in order to realize services that automatically perform tasks on behalf of the users, without requiring their explicit involvement. In this paper, we present the key characteristics of SmartWS, and introduce a reference implementation framework. Furthermore, we describe a specific use case for implementing SmartWS in the medical domain and specify a maturity model for determining the quality and usability of SmartWS. …

Deep LDA Hashing
The conventional supervised hashing methods based on classification do not entirely meet the requirements of hashing technique, but Linear Discriminant Analysis (LDA) does. In this paper, we propose to perform a revised LDA objective over deep networks to learn efficient hashing codes in a truly end-to-end fashion. However, the complicated eigenvalue decomposition within each mini-batch in every epoch has to be faced with when simply optimizing the deep network w.r.t. the LDA objective. In this work, the revised LDA objective is transformed into a simple least square problem, which naturally overcomes the intractable problems and can be easily solved by the off-the-shelf optimizer. Such deep extension can also overcome the weakness of LDA Hashing in the limited linear projection and feature learning. Amounts of experiments are conducted on three benchmark datasets. The proposed Deep LDA Hashing shows nearly 70 points improvement over the conventional one on the CIFAR-10 dataset. It also beats several state-of-the-art methods on various metrics. …

Depth-first Search (DFS)
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking. A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Tremaux as a strategy for solving mazes. …

Network Embedding
Network embedding assigns nodes in a network to low-dimensional representations and effectively preserves the network structure.
A Tutorial on Network Embeddings …