261 results about "Hide node" patented technology

A distributed network method for self-organizing a group of nodes into a bi-directional communication network where initially there is no central coordinator in the prospective network environment. The method involves engaging in the process of determining internodal communication capabilities en route to creating a network topology table, and then using that table as a guide (a) selecting, by nodal election, an appropriate central coordinator, and (b) establishing proxy nodes which enable full network bi-directional communication between all nodes, including otherwise communicatively-compromised hidden nodes.

Systems and methodologies are described that facilitate mitigating a hidden node condition in a wireless mesh network wherein nodes utilize a request-to-send/clear-to-send (RTS/CTS) protocol in conjunction with an asynchronous hybrid automatic repeat request protocol. For instance, a node may contend for a set of subcarriers by sending an RTS signal over the desired subcarriers, and may receive a CTS signal over the contended subcarriers, wherein the CTS signal indicates which subcarriers the node may transmit data over. If another node has won the contention for a particular subcarrier, requesting node may adjust a power level at which it transmits an RTS or a data packet in order to permit the requesting node to utilize the subcarrier without interfering with the winning node.

The system has a collection of a plurality of objects. Each object defines a node in a k-partite graph, such that, the nodes can e divided into a number of mutually exclusive sets such that all of the nodes are in exactly one of the sets; further edges occur only between nodes in different sets; The system also has a simplification process that aggregates one or more of the nodes into one or more categories and identifies a category node corresponding to each category. The category node inherits the mode and the edges of all the nodes in the respective category. Further, the system contains Directed Acyclic Graphs Indices (DAGIs) whose nodes may have a 1-1 mapping with the nodes in the k-partite graph. These indices can be used to aggregate and hide nodes in the k-partite graph. Aggregation occurs by selecting one or more non-leaf nodes in the DAGI and aggregating all descendent nodes. Hiding occurs by selecting some set of DAGI nodes, thus selecting some corresponding set of nodes in the k-partite graph, and requesting this set of nodes be hidden which effectively removes them from further consideration until they are restored by explicit request.

Receiver-initiated collision avoidance methods for use in ad-hoc wireless networks in which carrier sensing is available. A number of protocol variants are described including RIMA-SP (simple polling), RIMA-DP (dual-purpose polling), and RIMA-BP (broadcast polling). These handshake methods according to the invention are capable of correctly avoiding collisions within a network that contains hidden nodes, and the RIMA-DP protocol provides higher performance levels than attainable with existing handshaking protocols within the ad-hoc wireless networks. The use of dual-purpose polling allows a control packet to be sent which has alternative functions, such as requesting data from the polled node, if available, and if not available then providing a transmission request from the polling node to send data to the polled node.

A system and method for generating a neural network ensemble. Conventional algorithms are used to train a number of neural networks having error diversity, for example by having a different number of hidden nodes in each network. A genetic algorithm having a multi-objective fitness function is used to select one or more ensembles. The fitness function includes a negative error correlation objective to insure diversity among the ensemble members. A genetic algorithm may be used to select weighting factors for the multi-objective function. In one application, a trained model may be used to produce synthetic open hole logs in response to inputs of cased hole log data.

Methods for selectively displaying portions of a hierarchical data set on an electronic display comprise the steps of displaying at least a portion of the hierarchical data set on an electronic display in a tree diagram format. Input may then be obtained from a user to identify one or more displayed nodes in the tree diagram that are to be hidden and/or one or more hidden nodes in the tree diagram that are to be displayed. Based on this input, at least one node in the tree diagram is partially collapsed and/or at least one node in the tree diagram may be partially expanded so as to display the hidden nodes identified by the user and so as to hide the displayed nodes identified by the user.

The invention discloses a pH (potential of hydrogen) value predicting method of a BP (back propagation) neutral network based on a simulated annealing (SA) algorithm optimization. The pH value predicting method comprises the following steps: step one, selecting a sample according to a sample selecting strategy and inputting; step two, according to the BP theorem, determining the structure of the BP neutral network; step three, according to a network training strategy, applying the simulated annealing algorithm to optimize the BP network weight parameter; training the BP network by using the input sample, and determining the optimal weight and optimal hidden node number of the BP network; step four, according to the well trained BP neutral network, structuring a predicting model of the pH value. The pH value predicting method overcomes the randomness of the BP network in terms of weight selection, improves the rate of convergence and study ability of the BP neutral network. Besides, the method optimizes the selection of the training sample and the network hidden neutral element number, and improves the generalization ability of the BP neutral network. Moreover, the pH value predicting method is high in predicting accuracy of pH value and good in nonlinear fitting ability.

Devices, softwares and methods reschedule multi-party sessions upon premature termination of a wireless communication session. Upon sensing a premature termination, an access point transmits a rescheduling frame. All sessions are advanced in time, which saves time in the end, without leaving quiet times. In addition, the invention avoids a hidden node problem.

A system and method for identifying potential hidden node problems in a multi-hop wireless ad-hoc communication network, such as an 802.11 network. The system and method evaluates the relationship between the neighbors of each respective node to identify nodes of a wireless ad-hoc communication network whose capabilities of receiving data packets can be adversely affected by hidden node problems in order to avoid selecting paths containing those potentially problem nodes for routing data packets. Specifically, for each node, the system and method generates a node metric identifying the relationship between the neighbors of a node. Each node can then transmit its respective metric with its routing advertisement data, so that other nodes can assess the degree of potential hidden node problem that may be experienced by that node, and can choose to avoid using that potentially problem node for routing data packets to other nodes.

Briefly, a method and apparatus that may detect hidden nodes in BSS based on a hidden node report that may be generated in an access point based on nodes reports received from stations of the BSS. The access point may enable and/or disable a hidden node protection mechanism and/or may control the transmit power of the stations.

The invention discloses a crowd abnormity detection and positioning system and a crowd abnormity detection and positioning method based on a time recurrent neural network. The method comprises the steps of carrying out gridding division on a scene on the basis of preprocessing acquired sample data, and dividing a video fragment consisting of n frames into a plurality of time-space blocks; then constructing a multi-scale optical flow histogram and Gabor wavelet texture features in each time-space block; vectoring and combining the features in the multiple time-space blocks, finding out a relation between a space dimension and a time dimension by taking the video fragment as a time sequence through respectively using hidden nodes and feedback nodes of the time recurrent neural network, and training a time recurrent neural network model capable of detecting a long dependency relation; finally detecting and positioning a crowd abnormity by the model. The method is higher in instantaneity and accuracy, and can detect abnormities activated by a small quantity of individuals or a large quantity of individuals.

The invention discloses a graph convolutional network gradient-based node information hiding method. The method comprises the steps of (1) constructing a network graph, constructing an adjacent matrixaccording to a connected edge set corresponding to the network graph, and preprocessing the adjacent matrix; (2) constructing and training a graph convolutional network model, and determining final weight information of the graph convolutional network model; (3) according to the final weight information, building an objective function based on a goal of ensuring non-target node classification tobe accurate as far as possible and enabling target node classification to be wrong, and calculating a connected edge gradient matrix corresponding to the adjacent matrix by utilizing the objective function; (4) according to a set gradient threshold, symbolizing the connected edge gradient matrix to obtain a connected edge gradient symbol matrix; and (5) updating the adjacent matrix by utilizing the connected edge gradient symbol matrix to hide node information. According to the method, the target node information of a network can be hidden under the condition of slightly changing the structureof the network as far as possible.

Disclosed are a method and a system for setting a routing path in consideration of hidden nodes and carrier sense interference.

The method of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network consisting of plural nodes and plural links for connecting two nodes with each other, comprises: calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node; calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path; and calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path.

Accordingly, in the multi-channel multi-radio wireless mesh network, the path with minimized hidden node problem and carrier sense interference can be selected to improve network performance

The invention relates to a construction method of a fuzzy neural network expert system for the water quality assessment in turbot culture, which comprises neural network modeling and network model testing. The method is characterized in that the neural network modeling comprises the following steps of: setting network training parameters, wherein sensitive indexes of the growth of turbots after three-tiered classification, which include four expert data of temperature, salinity, pH and dissolved oxygen, are used as input parameters; determining the network topology: constructing a three-layer neural network by using the input layers of four input nodes, the hidden layers of two hidden nodes and the output layer of one output node; and determining training samples. The network model testing comprises the steps of: leading in tested samples and assessing the network model. The invention combines the neural network, the fuzzy system and the on-line monitoring system for the water quality assessment in industrial turbot culture for the first time, avoids the operations such as manual setting and the like in the traditional assessment method, and overcomes the influence of human factors and the like on the assessment in the traditional turbot water quality assessment.

A method and apparatus for cross-domain medical image synthesis is disclosed. A source domain medical image is received. A synthesized target domain medical image is generated using a trained contextual deep network (CtDN) to predict intensities of voxels of the target domain medical image based on intensities and contextual information of voxels in the source domain medical image. The contextual deep network is a multi-layer network in which hidden nodes of at least one layer of the contextual deep network are modeled as products of intensity responses and contextual response.

The present invention discloses a solution for storing and depicting complex non-contiguous organizations that are subject to situation-based restructuring. Different views for organization charts of the organization can be generated, where the generated organization charts are collapsed to a minimal view which automatically hides at least a portion of the organization positions in accordance with a desired view. For example, a view showing only filled positions will hide unfilled positions, collapsing intermediate nodes of a shown hierarchy so that child nodes of a hidden node are directly connected to the parent node of the hidden node. A set of indexed database tables can be used to efficiently store details of the organization. The indexed tables can store positions, assignment, and position reporting details in separate 3NF tables. The solution can be integrated to a commercial off-the-shelf command management system and/or to a commercial off-the-shelf front-end charting application.

The invention provides a hidden node detection method and equipment. The method comprises the steps of monitoring a signal of a station (STA) in a medium according to a received monitoring instruction, wherein the signal contains the node identification of the station which transmits the signal; if the node identification represents an isolation node of the node, judging whether the station is located in the overlapped coverage area of the node and the isolation node; and if yes, determining the isolation node to be a hidden node of the node. The node comprises a monitoring module, a judging module and a determining module. A node controller comprises a transceiving module, a judging module and a determining module. The scheme provided by the invention realizes accurate positioning of an access point (AP) belonging to the hidden node without changing the STA station.