Abstract: Disclosed is a simple but yet effective strategy to check pairwise reachability in an online analysis under a general locking scheme where locks may be acquired in recursive, non-nested, or nested manner. Under data abstraction, such an approach guarantees true positives and negatives for two-threaded system. For more than two threaded, it guarantees either true positive or true negative (but not both). It uses time stamped lock/unlock events to identify and avoid redundant and inconsistent sequence. Importantly, the approach is incremental and reduce amortized cost of checking multiple pairwise reachability problems. The worst case complexity is quadratic in the length of the history; in practice, however, the running cost is linear in the length of the history.

Abstract: A method for policy-aware mapping of an enterprise virtual tenant network includes receiving inputs from a hosting network and tenants, translating resource demand and policies of the tenants into a network topology and bandwidth demand on each link in the network; pre-arranging a physical resource of a physical topology for clustering servers on the network to form an allocation unit before a VTN allocation; allocating resources of the hosting network to satisfy demand of the tenants in response to a VTN demand request; and conducting a policy aware VTN mapping for enumerating all feasibly resource mappings, bounded by a predetermined counter for outputting optimal mapping with policy-compliant routing paths in the hosting network.

Abstract: A device used in a network is disclosed. The device includes a network monitor to monitor a network state and to collect statistics for flows going through the network, a flow aggregation unit to aggregate flows into clusters and identify flows that can cause a network problem, and an adaptive control unit to adaptively regulate the identified flow according to network feedback. Other methods and systems also are disclosed.

Abstract: Caching systems and methods for managing a cache are disclosed. One method includes determining whether a cache eviction condition is satisfied. In response to determining that the cache eviction condition is satisfied, at least one Bloom filter registering keys denoting objects in the cache is referenced to identify a particular object in the cache to evict. Further, the identified object is evicted from the cache. In accordance with an alternative scheme, a bit array is employed to store recency information in a memory element that is configured to store metadata for data objects stored in a separate cache memory element. This separate cache memory element stores keys denoting the data objects in the cache and further includes bit offset information for each of the keys denoting different slots in the bit array to enable access to the recency information.

Abstract: A method for small scale time increased bandwidth assignment to increase optical network unit ONU downstream energy efficiency includes splitting of downstream scheduling cycles into multiple rounds, using selective ones of the multiple rounds as probing rounds and other than said selective ones of the multiple rounds as fixed rounds, the probing rounds and fixed rounds being cooperatively selected for energy efficiency without limitations in length of the downstream scheduling cycles.

Abstract: In a multiple-input multiple-output (MIMO) wireless system supporting Coordinated Multi-Point (CoMP) transmission and having a first base station, a second base station, and a user equipment, a communications method implemented in the first base station is disclosed. In an aspect, the communications method includes exchanging, with the second base station through local information exchange, first information about a first channel between the first base station and the user equipment and second information about a second channel between the second base station and the user equipment, and computing at least one of a precoding matrix, a receiver filter, and a projection matrix, wherein the user equipment estimates the first information and the second information, and shares the first information and the second information with the first base station. Other apparatuses and some methods for wireless communications also are disclosed.

Abstract: In an optical communication system containing a primary line and backup line card, a method includes providing interfaces for the primary and backup line card, each line card including a transmitter and receiver; and selecting output from the transmitter from either the primary or back up line card including selecting the backup line card when the primary line card encounters a failure.

Abstract: A method for video multicast delivery for 4g wireless networks includes collecting client feedback and obtaining supportable modulation and coding scheme MCS for each client over a base station of wireless network, prioritizing video packets for said clients and setting a utility for each of the video packets; performing a radio resource allocation for determining a utility optimization for transmitted frames of the video packets; and assigning an MCS to each transmitted frame of the video packets, responsive to step performing a radio resource allocation

Abstract: A computer implemented method for determining shape from differential motion with unknown reflectance includes deriving a general relation that relates spatial and temporal image derivatives to bidirectional reflectance distribution function BRDF derivatives, responsive to 3D points and relative camera poses from images and feature tracks of an object in motion under colocated and unknown directional light conditions, employing a rank deficiency in image sequences from the deriving for shape determinations, under predetermined multiple camera and lighting conditions, to eliminate BDRF terms; and recovering a surface depth for determining a shape of the object.

Abstract: An optical network includes a multidimensional coder and modulator for handling multiple-in-multiple-out MIMO spatial lightpath properties and content of any specific supercarrier, a spatial mode multiplexer responsive to orthogonal frequency division multiplexing OFDM transmissions and the multidimensional coder, a spatial-spectral routing node coupled over a fiber link to the spatial mode multiplexer for performing switching granularity by a spatial mode reconnection, a multidimensional decoder and demodulator; and a spatial mode demultiplexer coupled over a fiber link to the spatial-spectral routing node and responsive to the multidimensional decoder and demodulator.

Abstract: Systems and methods for metric learning include iteratively determining feature groups of images based on its derivative norm. Corresponding metrics of the feature groups are learned by gradient descent based on an expected loss. The corresponding metrics are combined to provide an intermediate metric matrix as a sparse representation of the images. A loss function of all metric parameters corresponding to features of the intermediate metric matrix are optimized, using a processor, to learn a final metric matrix. Eigenvalues of the final metric matrix are projected onto a simplex.

Abstract: Methods for generating a data fetching plan in a multi-tenant system include placing tenants in consecutively allocated databases according to a weighted graph of tenants and sharing relationships between tenants, where at least one sharing relationship includes multiple accessing tenants accessing a given set of data from a provider tenant. For each sharing relationship, if a current database has one or more accessing tenants and does not have the provider tenant, data is fetched from the latest-allocated database prior to the current database that has accessing tenants, if such a database exists; if a current database has the provider tenant, data is provided to the earliest-allocated database after the current database that has accessing tenants if such a database exists. The fetching and providing steps are repeated for each allocated database.

Abstract: Systems and methods for image retrieval include constructing a plurality of graphs including a first graph for candidate images retrieved based upon holistic features of a query image and a second graph for candidate images retrieved based upon local features of the query image, wherein constructing includes weighting connected images based upon a Jaccard similarity coefficient. The plurality of graphs are fused to provide a fused graph. Candidate images of the fused graph are ranked, using a processor, to provide retrieval results of the query image.

Abstract: A method is provided for classifying an image. The method includes inferring location information of an object of interest in an input representation of the image. The method further includes determining foreground object features and background object features from the input representation of the image. The method additionally includes pooling the foreground object features separately from the background object features using the location information to form a new representation of the image. The new representation is different than the input representation of the image. The method also includes classifying the image based on the new representation of the image.

Abstract: A method for tenant placement in a multi-tenant system is shown that includes creating a weighted graph of tenants and sharing relationships between tenants, where a weight for each tenant and each sharing relationship represents an associated degree of resource consumption; and adding one or more tenants to a database using a processor based on said weighted graph and a database capacity, such that the combined weight of the added tenants and the sharing relationships belonging to the added tenants are within the database capacity. If a tenant cannot be added to the database without exceeding the database capacity, a new database is created and the one or more tenants are added to the new database, subject to a new database capacity. The adding and creating steps are repeated until all tenants have been added to a database.

Abstract: Methods and systems for simultaneous determination of channel resource allocations and beam vectors for uplink frames are disclosed. One method includes receiving batch information from client devices indicating amounts of data to be transmitted on the uplink by the client devices. Further, signal quality can be measured on channel resources for each of the client devices and for each of a plurality of beam vectors. Additionally, rate information for the channel resources for each of the client devices is determined based on signal quality measurements. Moreover, the method includes computing, based on the batch information and the rate information, utilities for allocations of the channel resources to the client devices and for the beam vectors for at least one uplink frame and selecting, based on the utilities, at least one of the beam vectors and at least one of the allocations for transmission of the data on the uplink frame(s).

Abstract: Disclosed are universal QPSK transmitter structures and methods for generating different QPSK signals exhibiting different polarization schemes, namely PolMux, PolMod and PolSw. The bit rate of the generated signals is variable, thereby allowing the transmitter to adjust to varying network traffic conditions. Advantageously, the generated signals may be detected by analog receivers (PolSw-QPSK) and coherent receivers (PolMux-QPSK, PolMod-QPSK, and PolSw-QPSK).

Abstract: Systems and methods for data sharing include merging sharing plans of admissible sharing arrangements to provide a merged sharing plan. A set of all possible plumbings are determined for the merged sharing plan. A plumbing with a maximum profit is iteratively applied, using a processor, to the merged sharing plan for each plumbing of the set such that a staleness level is maintained to provide an optimized sharing plan.

Abstract: Systems and methods for data sharing include generating at least one sharing plan with a cheapest cost and/or a shortest execution time for one or more sharing arrangements. Admissibility of the one or more sharing arrangements is determined such that a critical time path of the at least one sharing plan does not exceed a staleness level and a cost of the at least one sharing plan does not exceed a capacity. Sharing plans of admissible sharing arrangements are executed while maintaining the staleness level.

Abstract: A method implemented in an online transaction processing system is disclosed. The method includes, upon a read request from a transaction process, reading a transaction log, reading data stored in a storage without accessing the transaction log, and constituting a current snapshot using the data in the storage and the transaction log. The method also includes, upon a write request from the transaction process, committing transaction by accessing the transaction log. The method also includes propagating update in the commit to the data in the storage asynchronously. The transaction commit is made successful upon applying the commit to the transaction log. Other methods and systems also are disclosed.