Abstract: A method, computer program product, and system identifying a probability of a medical condition in a patient. The method includes a processor obtaining data set(s) related to a patient population diagnosed with a medical condition and based on a frequency of features in the data set(s), identifying common features and weighting the common features based on frequency of occurrence in the data set(s) to generate mutual information. The processor generates pattern(s) including a portion of the common features to generate a machine learning algorithm(s). The processor compiles a training set of data to use to tune the machine learning algorithm(s). The processor dynamically adjusts common features in the pattern(s) such that the machine learning algorithm(s) can distinguish patient data indicating the medical condition from patient data not indicating the medical condition. The processor applies the machine learning algorithm(s) to data related to the undiagnosed patient, to determine the probability.

Abstract: A method, computer program product, and system identifying a probability of a medical condition in a patient. The method includes a processor obtaining data set(s) related to a patient population diagnosed with a medical condition and based on a frequency of features in the data set(s), identifying common features. The processor generates pattern(s) including a portion of the common features to generate a machine learning algorithm(s). The processor compiles a training set of data to use to tune the machine learning algorithm(s). The processor dynamically adjusts common features in the pattern(s) such that the machine learning algorithm(s) can distinguish patient data indicating the medical condition from patient data not indicating the medical condition. The processor applies the machine learning algorithm(s) to data related to the undiagnosed patient, to determine the probability.

Abstract: A method, computer program product, and system identifying a probability of a medical condition in a patient. The method includes a processor obtaining data set(s) related to a patient population diagnosed with a medical condition and based on a frequency of features in the data set(s), identifying common features. The processor generates pattern(s) including a portion of the common features to generate a machine learning algorithm(s). The processor compiles a training set of data to use to tune the machine learning algorithm(s). The processor dynamically adjusts common features in the pattern(s) such that the machine learning algorithm(s) can distinguish patient data indicating the medical condition from patient data not indicating the medical condition. The processor applies the machine learning algorithm(s) to data related to the undiagnosed patient, to determine the probability.

Abstract: A method, computer program product, and system identifying a probability of a medical condition in a patient. The method includes a processor obtaining data set(s) related to a patient population diagnosed with a medical condition and based on a frequency of features in the data set(s), identifying common features and weighting the common features based on frequency of occurrence in the data set(s) to generate mutual information. The processor generates pattern(s) including a portion of the common features to generate a machine learning algorithm(s). The processor compiles a training set of data to use to tune the machine learning algorithm(s). The processor dynamically adjusts common features in the pattern(s) such that the machine learning algorithm(s) can distinguish patient data indicating the medical condition from patient data not indicating the medical condition. The processor applies the machine learning algorithm(s) to data related to the undiagnosed patient, to determine the probability.

Abstract: A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.

Abstract: A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.

Abstract: A system and method for support vector machine plus (SVM+) computations include selecting a set of indexes for a target function to create a quadratic function depending on a number of variables, and reducing the number of variables to two in the quadratic function using linear constraints. An extreme point is computed for the quadratic function in closed form. A two-dimensional set is defined where the indexes determine whether a data point is in the two-dimensional set or not. A determination is made of whether the extreme point belongs to the two-dimensional set. If the extreme point belongs to the two-dimensional set, the extreme point defines a maximum and defines a new set of parameters for a next iteration. Otherwise, the quadratic function is restricted on at least one boundary of the two-dimensional set to create a one-dimensional quadratic function. The steps are repeated until the maximum is determined.

Abstract: Traditional networked file systems like NFS do not extend to wide-area due to network latency and dynamics introduced in the WAN environment. To address that problem, a wide-area networked file system is based on a traditional networked file system (NFS/CIFS) and extends to the WAN environment by introducing a file redirector infrastructure residing between the central file server and clients. The file redirector infrastructure is invisible to both the central server and clients so that the change to NFS is minimal. That minimizes the interruption to the existing file service when deploying WireFS on top of NFS. The system includes an architecture for an enterprise-wide read/write wide area network file system, protocols and data structures for metadata and data management in this system, algorithms for history based prefetching for access latency minimization in metadata operations, and a distributed randomized algorithm for the implementation of global LRU cache replacement scheme.

Abstract: A multipath routing architecture for large data transfers is disclosed. The architecture employs an overlay network that provides diverse paths for packets from communicating end hosts to utilize as much capacity as available across multiple paths while ensuring network-wide fair allocation of resources across competing data transfers. A set of transit nodes are interposed between the end-hosts and for each end-to-end connection, a transit node can logically operate as an entry gateway, a relay or exit gateway. Packets from the sender enter the entry node and go to the exit node either directly or through one of a plurality of relay nodes. The exit node delivers the packets to the receiver. A multipath congestion control protocol is executed on the entry node to harness network capacity for large data transfers.

Abstract: A system and method for support vector machine plus (SVM+) computations include selecting a set of indexes for a target function to create a quadratic function depending on a number of variables, and reducing the number of variables to two in the quadratic function using linear constraints. An extreme point is computed for the quadratic function in closed form. A two-dimensional set is defined where the indexes determine whether a data point is in the two-dimensional set or not. A determination is made of whether the extreme point belongs to the two-dimensional set. If the extreme point belongs to the two-dimensional set, the extreme point defines a maximum and defines a new set of parameters for a next iteration. Otherwise, the quadratic function is restricted on at least one boundary of the two-dimensional set to create a one-dimensional quadratic function. The steps are repeated until the maximum is determined.

Abstract: A system and method for path provisioning in a network calculates an optimal path using a greedy algorithm with backtracking to execute service level agreements (SLAs). More specifically, a sequential path shifting (SPS) algorithm compares a cost of a suboptimal path for a present quadruplet with the cost of switching a path for a previous quadruplet configured for alteration. If the present path is already an optimal path, then no further operations are performed. However, if the cost of a suboptimal path is greater than the switching cost, the previous path is altered so that an optimal path may be configured for the present quadruplet. Otherwise, the present quadruplet maintains its existing path. The capacity of the network is iteratively adjusted to compensate for path selection. The present system may be applied to a differentiated services network or an optical network.

Abstract: Hierarchical hybrid optical networking is based on balancing cost and performance of optical networks by providing transparent (optical) switching of subsets of wavelengths in addition to opaque (electrical) switching of individual light paths. Effective use of wavelength-subset switching requires aggregating and deaggregating wavelength subsets in a simple, cost-effective manner. Non-uniform wavebands are introduced and analyzed their performance advantage as compared with uniform wavebands. Also proposed are several architectural options for a hierarchical hybrid optical cross-connect system that combines non-uniform wavebands and improved utilization of OEO ports.

Abstract: A multipath routing architecture for large data transfers is disclosed. The architecture employs an overlay network that provides diverse paths for packets from communicating end hosts to utilize as much capacity as available across multiple paths while ensuring network-wide fair allocation of resources across competing data transfers. A set of transit nodes are interposed between the end-hosts and for each end-to-end connection, a transit node can logically operate as an entry gateway, a relay or exit gateway. Packets from the sender enter the entry node and go to the exit node either directly or through one of a plurality of relay nodes. The exit node delivers the packets to the receiver. A multipath congestion control protocol is executed on the entry node to harness network capacity for large data transfers.

Abstract: An improved aggregation scheme for wireless multi-hop mesh networks is disclosed. An aggregator at each node operates to merge VoIP packets at an ingress/source node with a forced delay, but at an intermediate node aggregated packets are either sent directly to their destination or to the next hop without deaggregation. A novel compression mechanism for compressing and decompressing the aggregated packets is also disclosed.

Abstract: A method of transporting Voice-Over-Internet-Protocol Packets in a wireless mesh network wherein VoIP packets from independent call flows are aggregated prior to transmission over multiple hops of the wireless network. Significant performance improvements are realized including the number of simultaneous VoIP calls supported and overall Quality-of-Service (QoS) for the individual calls.

Abstract: In an infrastructure solution for content-based forwarding, filter pipelining enables handling of the high-rate message streams. Documents are distributed in the network by forwarding from publisher proxy servers to attribute trees associated with particular attributes in the message. The trees filter the messages based on attribute values, and deliver the messages to subscriber proxy servers for predicate-based distribution to subscribers. To maximize throughput, the attribute trees utilize the concept of weak filtering, wherein a message may be delivered to a node in the attribute tree that is associated with a range of attribute values that does not include the attribute value of the message.

Abstract: Disclosed is a data replication technique for providing erasure encoded replication of large data sets over a geographically distributed replica set. The technique utilizes a multicast tree to store, forward, and erasure encode the data set. The erasure encoding of data may be performed at various locations within the multicast tree, including the source, intermediate nodes, and destination nodes. In one embodiment, the system comprises a source node for storing the original data set, a plurality of intermediate nodes, and a plurality of leaf nodes for storing the unique replica fragments. The nodes are configured as a multicast tree to convert the original data into the unique replica fragments by performing distributed erasure encoding at a plurality of levels of the multicast tree.

Abstract: Traditional networked file systems like NFS do not extend to wide-area due to network latency and dynamics introduced in the WAN environment. To address that problem, a wide-area networked file system is based on a traditional networked file system (NFS/CIFS) and extends to the WAN environment by introducing a file redirector infrastructure residing between the central file server and clients. The file redirector infrastructure is invisible to both the central server and clients so that the change to NFS is minimal. That minimizes the interruption to the existing file service when deploying WireFS on top of NFS. The system includes an architecture for an enterprise-wide read/write wide area network file system, protocols and data structures for metadata and data management in this system, algorithms for history based prefetching for access latency minimization in metadata operations, and a distributed randomized algorithm for the implementation of global LRU cache replacement scheme.

Abstract: A scalable broker publish/subscribe broker network using a suite of active load balancing schemes is disclosed. In a Distributed Hashing Table (DHT) network, a workload management mechanism, consisting of two load balancing schemes on events and subscriptions respectively and one load-balancing scheduling scheme, is implemented over an aggregation tree rooted on a data sink when the data has a uniform distribution over all nodes in the network. An active load balancing method and one of two alternative DHT node joining/leaving schemes are employed to achieve the uniform traffic distribution for any potential aggregation tree and any potential input traffic distribution in the network.

Abstract: Disclosed is a method and apparatus for delivering information of interests from content providers to clients via a data network. A network architecture includes two types of edge servers, referred to as forward proxy servers and reverse proxy servers. The forward proxy servers are assigned to serve particular clients with respect to particular information and the reverse proxy servers are assigned to serve particular forward proxy servers with respect to particular information. Each of the forward proxy servers stores information identifiers associated with information for which the forward proxy server is assigned to serve to at least one client. Each of the reverse proxy servers stores information identifiers and the associated forward proxy servers that the reverse proxy server is assigned to serve with respect to information associated with the information identifiers.