The RDF language (Resource Description Framework) allows nodes in an RDF graph to be unlabeled – “blank nodes”. While blank nodes and certain other features are convenient for RDF authors, their unrestricted use causes complications to RDF consumers, such as when attempting to compare RDF graphs, which in the general case is as difficult as the graph isomorphism problem. This paper proposes a s...

We present a formal description of a propositional semantic-network-based knowledge representation system. Variables in this representation are not atomic and have potentially complex structure. We start from the individual components of a semantic network system, atomics nodes and relations that connect nodes, and provide a complete speci cation for the structure of nodes and a subsumption pro...

In this paper we present an all-optical network architecture and a systolic routing protocol for it. An -dimensional optical fat tree network ( ) consists of routing nodes and processing nodes deployed at the leaf nodes of the network. In our construction packets injected into the carry no routing information. Routing is based on the use of a cyclic control bit sequence and scheduling. The syst...

This fMRI study investigated the functional heterogeneity of the core nodes of the default mode network (DMN) during language processing. The core nodes of the DMN were defined as task-induced deactivations over multiple tasks in 94 healthy subjects. We used a factorial design that manipulated different tasks (semantic matching or speech production) and stimuli (familiar words and objects or un...

In recent years, the use of wireless sensor networks for vibration monitoring is emphasized, because of its capability to continuously monitor at hard-to-reach locations of complex machines. Low power consumption is one of the main requirements for the sensor nodes in continuous and long-term vibration monitoring. However, the power consumption of state-of-the-art wireless sensor nodes is signi...

A continuous k nearest neighbor (CKNN) query retrieves the set of k mobile nodes that are nearest to a query point, and provides real-time updates whenever this set of nodes changes. A CKNN query can be either stationary or mobile, depending on the mobility of its query point. Efficient processing of CKNN queries is essential to many applications, yet most existing techniques assume a centraliz...

Problem statement: Target tracking is a challenging application in Wireless Sensor Networks (WSNs) because it is computation-intensive and requires real-time location processing. This study proposes a practical target tracking system based on the Hidden Markov Model in a distributed signal processing framework. In this framework, wireless sensor nodes perform target detection and tracking, wher...

In Wireless Sensor Networks (WSNs), energy of the sensor nodes are the most concerning factor because each sensor is equipped with limited amount of energy which is used to perform lots of work. Sensors have capabilities of sensing, analyzing, processing and communication of the data. In WSNs, the most responsible factor behind energy consumption of the sensor nodes is Data Processing which mai...

In this paper we present a new approach to multi-result supercompilation based on joining together process graphs into a single graph and welding nodes corresponding to equal configurations. We show that this leads to a considerable reduction of nodes being built during supercompilation and enables more efficient configuration graph processing algorithms on the example of an enhanced residualiz...