36 results about "Direct neighbor" patented technology

A method for correcting image data, in particular for color correction and cross-talk reduction of image data obtained by an image sensor comprising image pixels (R, G, B) and non-image pixels (F), the image pixels (R,G,B) being overlaid with a color filter array (CFA) and having a different spectral sensitivity than the non-image pixels, comprises determining a set of color components (rold, gold, bold) for the image pixels (R,G,B) based on raw image data (rraw, graw, braw) read only from the image pixels (R,G,B) of the image sensor (10); correcting the set of color components of non-direct neighbors of the non-image pixels (F) by means of a first color correction matrix (CCM1); and correcting the set of color components of direct neighbors of the non-image pixels by means of a second color correction matrix (CCM2) different from the first color correction matrix. An image sensor (10) and an auto-focus camera using same are also disclosed.

A dynamic binding protocol has three tasks that run in parallel: discovery, association, and operation. During discovery, control elements (CEs) and forwarding elements (FEs) learn about immediate neighbors and CEs in a SoftRouter network that has separate control and data planes. During association, FEs associate with CEs and are configured with basic parameters, such as IP interface addresses, hostnames, and the like. During operation, failover and packet tunneling between CEs and FEs is handled.

The present invention that partitions a memory array in N segments by switchably partitioning the bit lines in the array. In the exemplary embodiment, a top set of sense amps control the even bit lines and a bottom set of sense amps control the odd bit lines. The segmentation transistors turn on or off depending on the selected word line location in the array. Since bit line capacitance is mainly from the metal bit line to bit line coupling to their immediate neighbors, the bit line neighbors in the partitioned array are floating in some segments of the bit lines. The overall bit line capacitance is significantly reduced with a negligible increase in die size, resulting in reduced sensing times and enhanced read and write performance.

Methods and apparatus for concealing corrupted blocks of streaming data are disclosed. It is determined whether a subdivision of the streaming data is a corrupt subdivision. The corrupt subdivision is concealed using a previously reconstructed or concealed subdivision in a manner that does not require information from pairs of direct neighbor subdivisions that have not been previously reconstructed or concealed.

A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.

In a method of managing a content-based network including a plurality of content routers, such as XML routers, dynamic links are established between the content routers which are not direct neighbors.

A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbor node of the first node and any nodes of the network subtending the neighbor node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.

The invention provides a community discovery method based on artificial intelligence. The method comprises the following steps: building a social network graph through employing a user node as a vertex and a social relation as an edge; forming a time evolution network by the social network graph changing along with the time; dividing the time evolution network, and determining a key time point; accumulating the coding costs of the sub-networks in different time periods to obtain the coding cost of the time evolution network; and decomposing the social network into homogeneous partitions by minimizing the coding cost. The invention provides a community discovery method based on artificial intelligence. When the method is applied to a network with link loss or noise data, the influence of network mutation and accumulation errors on community discovery precision is effectively reduced, the influence of node direct neighbors and the influence of indirect neighbors are considered, the sensitivity of an algorithm to neighborhood threshold parameters is reduced, and the accuracy of a community attribution result is effectively improved.

A device validates reachability of nodes of a communication network of an industrial automation and control system. The device includes a collector module configured to update a data set including discovered dataflow information by detecting direct neighbor nodes having a physical connection to a selected node, and updating the data set by adding the selected node and those direct neighbor nodes which have configured logical network constraints matching logical network constraints of the selected node. The device includes a repeater module configured to repeat the selecting of a direct neighbor node in the data set and directing the collector module to update the data set using the selected direct neighbor node. The device includes a validation module configured to validate reachability of nodes of the network by comparing the data set with a data set including designed dataflow information which defines reachability requirements for nodes of the communication network.

The invention relates to a distributed peer-to-peer network based on concentration service and a construction method thereof, wherein, the method includes the following steps: (1) establishing a concentration server for the peer-to-peer network, which is used for adding the peer-to-peer network for a new node and providing service for the exit of the peer-to-peer network and defining a data structure of a B plus tree for the server so as to save the information on a dynamic and variable node; (2) adopting a new node to search a direct neighbor through a concentration server or search the direct neighbor in a virtual link from a peer node and add the direct neighbor into a peer-to-peer network ; (3) applying a boundary node (a peer node with a precursor or a successor exiting from the direct neighbor) to search a direct precursor or a successor neighbor through the concentration server or search the direct precursor or the successor neighbor in the virtual link from the node, so as to maintain ring-shaped topology among the peer nodes. The invention integrates the concentration service in the distributed peer-to-peer network, thus obviously decreasing network fluctuationdue to frequent entering or exiting of the node and greatly increasing the work efficiency of the peer-to-peer network.

The invention discloses an optimal unidirectional communication path selection method between wireless sensor network nodes. The method comprises the following four steps: a node broadcasts a relative hop test packet, and the node and a direct neighbor node thereof calculate a relative hop; the node broadcasts an optimal unidirectional communication path detection packet, and other nodes determine a minimum hop from a packet sending node to itself, an optimal unidirectional communication path and the relative hop; other nodes send an optimal unidirectional communication path notification packet to the packet sending node; and the node requests a specific node to send the optimal unidirectional communication path detection packet by a path detection packet request sending message to obtain the optimal unidirectional communication path information from the specific node to itself. According to the optimal unidirectional communication path selection method disclosed by the invention, the irregularity of the communication radiation range of the nodes and the inconsistency of node distribution are fully considered, the unidirectional communication path between the nodes is selected in combination with the minimum communication hop and the relative hop, the optimal unidirectional communication path is selected, the performance is stable, and the cost is reduced.

The invention relates to a cell PCI allocation method of a mobile communication system, comprising the following steps of: acquiring a PCI set A of a third-stage neighbor cell of a current node, a PCI set B available for the current node and a PCI set C available in a network, wherein the third-stage neighbor cell is a neighbor cell of the neighbor cell of a direct neighbor cell of a current cell; acquiring a PCI set D with PCI interference in a first-stage neighbor cell PCI in an Intra-eNB and an Inter-eNB, wherein the first-stage neighbor cell is the direct neighbor cell of the current cell; respectively acquiring a node PCI different from the PCI set D from the PCI set A, the PCI set B and the PCI set C, thereby forming a PCI set Cx, a PCI set Bx and a PCI set Ax; and respectively selecting an element from the PCI set Cx, the PCI set Bx and the PCI set Ax , and allocating the selected element as the PCI of the current node. With the technology of the cell PCI allocation method of the mobile communication system, interference suppression of uplink and downlink pilot signals under the condition of same-frequency networking is avoided, and operating performances, such as terminal wireless transmission, cell reselection and switching, are improved.

A method, system and program product for balanced workload distribution in a plurality of networked computing nodes. The networked computing nodes may be arranged as a connected graph defining at least one direct neighbor to each networked computing node. The method comprises determining a first workload indicator of the i-th computing node, at a first stage before a new task may be started by the i-th computing node, determining an estimated workload indicator of the i-th computing node, assuming that the new task is performed at a second stage on the i-th computing node, determining estimated workload indicators of each direct neighbor assuming that the new task is performed at the second stage, deciding whether to move the new task to another computing node, and moving the new task to one of the direct neighboring computing nodes of the i-th computing node such that workloads are balanced.