Network embedding in heterogeneous information networks (HINs) is a challenging task, due to complications of different node types and rich relationships between nodes. As a result, conventional network embedding techniques cannot work on such HINs. Recently, metapathbased approaches have been proposed to characterize relationships in HINs, but they are ineffective in capturing rich contexts an...

In the last decade, we witness a proliferation of potential application domains of wireless sensor networks (WSN). Therefore, a host of research works have been conducted by both academic and industrial communities. Nevertheless, given the sensitivity of the potential applications that are generally tightly related to the physical world and may be human beings, a large scale deployment of WSN d...

Wireless Sensor Networks (WSN) is vulnerable to node capture attacks in which an attacker can capture one or more sensor nodes and reveal all stored security information which enables him to compromise a part of the WSN communications. Due to large number of sensor nodes and lack of information about deployment and hardware capabilities of sensor node, key management in wireless sensor networks...

The routing protocol plays a key role in allowing packets to reach their intended destination. We are interested wireless nanonetworks (WNNs), which totally differ from traditional networks terms of node density and size, used, hardware limitations. This paper presents an enhanced retransmission algorithm used by the nodes destination zone, combination with our previously proposed nanosleeping ...

Node selection in trees is a fundamental operation to XML databases, programming languages, and information extraction. We propose a new class of querying languages to define n-ary node selection queries as compositions of monadic queries. The choice of the underlying monadic querying language is parametric. We show that compositions of monadic MSO-definable queries capture n-ary MSO-definable ...

We present the first algorithm for learning n-ary node selection queries in trees from completely annotated examples by methods of grammatical inference. We propose to represent n-ary queries by deterministic n-ary node selecting tree transducers (n-NSTTs). These are tree automata that capture the class of monadic second-order definable nary queries. We show that n-NSTT defined polynomially bou...

Capture search, an expensive part of any chess program, is conducted at every leaf node of the approximating game tree. Often an exhaustive capture search is not feasible, and yet limiting the search depth compromises the result. Our experiments confirm that for chess a deeper search results in less error, and show that a shallow search does not provide significant savings. It is therefore bett...

Using image stitching technology to find out overlap areas in the camera node capture image, inform the camera node, camera node will filter redundancy image data which is overlap with adjacent nodes, and then cluster nodes rebuild images which has been received, stitch together, form a panorama. Through this process, it can reduce image redundancy data affectivity in densely deployed wireless ...

Intrusion detection systems (IDS) are important security tools in computer networks. There exist many approaches to this problem in traditional computer networks and wireless adhoc networks [ZL00], but literature on this topic with regard to sensor networks is scarce. The goal of failure recovery is to extend the lifetime of a sensor network by restarting or reprogramming failed or misbehaving ...

In wireless sensor network (WSN), preditibution of cryptographic keys is possibly the most practical approach to perfect network communications. In this paper, we propose a new secret key predistribution scheme to achieve a higher connectivity in WSN. For this we combine a random key predistribution scheme and hash chain method based on the prior knowledge of sensor node deployment. The propose...