Patent application number | Description | Published |
20130034176 | ROBUST LINEAR PRECODER DESIGNS FOR MULTI-CELL DOWNLINK TRANSMISSION - Methods and systems for optimizing the utilities of receiver devices in a wireless communication network are disclosed. Precoder design formulations that maximize a minimum worst-case rate or a worst-case sum rate are described for both full base station cooperation and limited base station cooperation scenarios. In addition, optimal equalizers are also selected to optimize the worst-case sum rate. | 02-07-2013 |
20130039335 | METHODS AND SYSTEMS FOR ALLOCATION OF MACRO CELL RESOURCES IN A DISTRIBUTED FEMTO CELL NETWORK AND A DISTRIBUTED RELAY STATION NETWORK - Methods and systems for reusing macro cell resources in femto cell base stations or relay stations in a non-collaborative manner are disclosed. In addition, orthogonal resource allocation between a macro cell base station and femto cell base stations/relay stations may be dynamically adjusted by considering user-population variance. Moreover, an additional level of spatial reuse by femto cell base stations or relay stations can be provided by employing macro cell user location information. | 02-14-2013 |
20130064218 | METHODS AND SYSTEMS FOR ALLOCATION OF MACRO CELL RESOURCES IN A DISTRIBUTED FEMTO CELL NETWORK AND A DISTRIBUTED RELAY STATION NETWORK - A method implemented in a wireless network including a first base station and a second base station is disclosed. The method includes, upon a change in a load condition, transmitting from the second base station to the first base station load information through backhaul in order to coordinate the first base station and the second base station, allocating, to the second base station, one or more tiles corresponding to one or more time-frequency resource blocks of orthogonal frequency division multiple access (OFDMA), and allocating remaining tiles to the first base station. Other methods and apparatuses are also disclosed. | 03-14-2013 |
20130077963 | Method for the Compensation of Nonlinear Impairments in Dispersion-Managed Optical Fiber Links Using Phase Conjugation and Equivalent Optical Link - A method for nonlinearity compensation for an optical transmission link includes determining a dispersion effect of a transmission link; applying a phase conjugation to the transmission link, the phase conjugation responsive to an input wave over the transmission link and providing a conjugated version of the input wave; and configuring an optimum equivalent link responsive to the phase conjugation after the transmission link to compensate for a non-linear dispersion effect from said transmission link | 03-28-2013 |
20130077972 | Sleep Control for Energy Efficiency in Ethernet Passive Optical Networks - A method sets certain downstream traffic scheduling rules at an optical line terminal OLT and certain sleep control rules at optical network units ONUs. Both downstream traffic scheduling rules and sleep control rules are common information owned by both the OLT and ONUs. The method sets the traffic scheduling rules that each ONU is allocated with some time slots every cycle if the ONU has downstream traffic. Rather than using a control message to notify ONUs with their queue status, the method lets ONUs infer whether its downstream queue is empty or not based on downstream traffic scheduling and lets the OLT infer the status of an ONU based on sleep control rules. | 03-28-2013 |
20130085742 | SERVICE LEVEL AGREEMENT-AWARE MIGRATION FOR MULTITENANT DATABASE PLATFORMS - A method for migration from a multitenant database is shown that includes building an analytical model for each of a set of migration methods based on database characteristics; predicting performance of the set of migration methods using the respective analytical model with respect to tenant service level agreements (SLAs) and current and predicted tenant workloads, where the prediction includes a migration speed and an SLA violation severity; and selecting a best migration method from the set of migration methods according to the respective predicted migration speeds and SLA violation severities. | 04-04-2013 |
20130085998 | LATENCY-AWARE LIVE MIGRATION FOR MULTITENANT DATABASE PLATFORMS - Methods and systems for database migration from a multitenant database include taking a snapshot of an original database to be migrated with a hot backup process, such that the database is still capable of answering queries during the hot backup process; maintaining a query log of all queries to the tenant database after the hot backup process begins; initializing a new database at a target server using the snapshot; replaying the query log synchronize the new database with the original database; and answering new queries with the new database and not the original database. | 04-04-2013 |
20130089323 | Optimal Combined 2R/3R Regenerators Placement Method for Line Network Topologies in Optical WDM Networks - A method for optimal combined 2R/3R regenerators placement for optical transmission includes determining an optimal placement of multiple 2R and 3R regenerators that minimizes bit error rate BER at a destination node, determining an optimal number of the 2R and 3R regenerators that minimizes a total cost while satisfying the BER at the destination node, and determining an optimal placement of the 2R and 3R regenerators along a route in the optical transmission. | 04-11-2013 |
20130089326 | NONBINARY LDPC CODED MODULATION WITHOUT BANDWIDTH EXPANSION FOR HIGH-SPEED OPTICAL TRANSMISSION - Systems and methods for data transport, comprising encoding one or more streams of input data using nonbinary low density parity check (NB-LDPC) encoders, corresponding to orthogonal polarization states. Receiving one or more streams of input data using a buffer coupled to the encoders, the data written to the buffer bR bits at a time, where R is the code rate. Generating one or more signals using a 2 | 04-11-2013 |
20130089327 | Polarization Switching for Optical Fiber Communications - A method implemented in a transmission apparatus used in an optical fiber communications system for a polarization switched differential quaternary phase-shift keying (DQPSK) signal is disclosed. The method comprises splitting data into two or more data streams, inputting said two or more data streams to 1-bit DQPSK precoders to perform 1-bit DQPSK precoding, and multiplexing inphase outputs of the 1-bit DQPSK precoders to generate a first output; and multiplexing quadrature outputs of the 1-bit DQPSK precoders to generate a second output. Other methods, apparatuses, and systems also are disclosed. | 04-11-2013 |
20130089340 | HIGH-SPEED OPTICAL 8-QAM MODULATION BY CASCADING DUAL-DRIVE MACH-ZEHNDER MODULATOR WITH I/Q MODULATOR - Structures and methods of generating 8-QAM signals through the effect of a cascaded I/Q modulator and Mach-Zhender modulator. The 8-QAM signals are generated by applying one binary sequence to the dual-drive Mach-Zehnder modulator (MZM) and two binary sequences to the I/Q modulator. Operationally, the I/Q modulator generates QPSK constellation(s), while the dual drive MZM either maintains the QPSK constellation at an out ring, or attenuates its amplitude to the inner ring and rotates its phase by π/4 phase depending on the binary data it was driven by. | 04-11-2013 |
20130091081 | LATENT FACTOR DEENDENCY STRUCTURE DETERMINATION - Disclosed is a general learning framework for computer implementation that induces sparsity on the undirected graphical model imposed on the vector of latent factors. A latent factor model SLFA is disclosed as a matrix factorization problem with a special regularization term that encourages collaborative reconstruction. Advantageously, the model may simultaneously learn the lower-dimensional representation for data and model the pairwise relationships between latent factors explicitly. An on-line learning algorithm is disclosed to make the model amenable to large-scale learning problems. Experimental results on two synthetic data and two real-world data sets demonstrate that pairwise relationships and latent factors learned by the model provide a more structured way of exploring high-dimensional data, and the learned representations achieve the state-of-the-art classification performance | 04-11-2013 |
20130091398 | OPTIMUM SIGNAL CONSTELLATION DESIGN FOR HIGH-SPEED OPTICAL TRANSMISSION - Systems and methods for data transport, comprising encoding one or more streams of input data with one or more low density parity check (LDPC) encoders, corresponding to one or more polarization/spatial mode branches. One or more encoded data streams are mapped to symbols, wherein the mapper is configured to assign bits of the symbols to a signal constellation and to associate the bits of the symbols with signal constellation points. A signal constellation is formulated which minimizes a mean-square error of the signal constellation representing the source. The optimum signal constellation size is adjusted to improve transmission quality by adjusting the signal constellation an optical signal to noise ratio (OSNR), wherein the signal constellation is selected using a look-up table (LUT); and the symbols are modulated in accordance with the output of the mapper onto a transmission medium. | 04-11-2013 |
20130091399 | HIGH-SPEED LONG CODEWORD QC-LDPC SOFT DECISION DECODER - A Quasi-Cyclic, LDPC, large girth, soft-decision decoder and accompanying methods. | 04-11-2013 |
20130091495 | FEEDBACK-DIRECTED RANDOM CLASS UNIT TEST GENERATION USING SYMBOLIC EXECUTION - Methods and systems for generating software analysis test inputs include generating a path query to cover a target branch of a program by executing a symbolic test driver concretely and partially symbolically, where at least one symbolic expression is partially concretized with concrete values; determining whether it is feasible to execute the target branch based on whether the generated path query is satisfiable or unsatisfiable using a constraint solver; if the target branch is feasible, generating a new test driver by replacing symbolic values in the symbolic test driver with generated solution values; and if the target branch is not feasible, analyzing an unsatisfiable core to determine whether unsatisfiability is due to a concretization performed during generation of the path query. | 04-11-2013 |
20130094851 | Optical Spectral Shaping for Nonlinearity Enhancement in High Speed Digital Coherent Optical Transmissions - A method includes evaluating an optical signal spectrum for estimated filtering parameters of an optical spectral filtering device for shaping optical signal spectrum, determining a feedback for fine tuning the optical spectral filtering device for nonlinearity tolerance enhancement in the optical transmission system, responsive to received optical signal quality in the optical signal spectrum; and using the feedback to adjust said optical spectral filtering device for predetermined shaping and predetermined fiber nonlinearity tolerance in the optical transmission system. | 04-18-2013 |
20130097108 | Two-Stage Multiple Kernel Learning Method - Disclosed are methods and structures of Multiple Kernel learning framed as a standard binary classification problem with additional constraints that ensure the positive definiteness of the learned kernel. Advantageously, the disclosed methods and structures permit the use of binary classification technologies to develop better performing, and more scalable Multiple Kernel Learning methods that are conceptually simpler. | 04-18-2013 |
20130101063 | DFT-BASED CHANNEL ESTIMATION SYSTEMS AND METHODS - DFT-based channel estimation methods and systems are disclosed. One system includes an inverse discrete Fourier transform module, a noise power estimator, a noise filter and a discrete Fourier transform module. The inverse discrete Fourier transform module is configured to determine time domain estimates by applying an inverse discrete Fourier transform to initial channel estimates computed from pilot signals. Additionally, the noise power estimator is configured to estimate noise power by determining and utilizing time domain samples that are within a vicinity of sinc nulls of the time domain estimates. The noise filter is configured to filter noise from the time domain estimates based on the estimated noise power to obtain noise filtered time domain estimates. Further, the discrete Fourier transform module is configured to perform a discrete Fourier transform on the noise filtered time domain estimates to obtain frequency domain channel estimates for channels on which pilot signals are transmitted. | 04-25-2013 |
20130121195 | METHODS AND SYSTEMS FOR INTEGRATING BATCH SCHEDULING WITH EXTERNAL BEAMFORMING - 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). | 05-16-2013 |
20130129199 | OBJECT-CENTRIC SPATIAL POOLING FOR IMAGE CLASSIFICATION - 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. | 05-23-2013 |
20130129202 | LARGE-SCALE STRONGLY SUPERVISED ENSEMBLE METRIC LEARNING - 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. | 05-23-2013 |
20130132402 | QUERY SPECIFIC FUSION FOR IMAGE RETRIEVAL - 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. | 05-23-2013 |
20130132403 | TENANT PLACEMENT IN MULTITENANT CLOUD DATABASES WITH DATA SHARING - 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. | 05-23-2013 |
20130132404 | TENANT PLACEMENT IN MULTITENANT CLOUD DATABASES WITH ONE-TO-MANY DATA SHARING - 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. | 05-23-2013 |
20130148963 | Dynamic Multidimensional Optical Networking Based on Spatial and Spectral Processing - 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. | 06-13-2013 |
20130155935 | Method for Multicast Video Delivery for 4G Cellular Networks - 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 | 06-20-2013 |
20130156327 | Shape from Differential Motion with Unknown Reflectance - 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. | 06-20-2013 |
20130170533 | Coordinated Multi-Point Transmission - 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. | 07-04-2013 |
20130170825 | Solution for Hitless Protection in High-Speed OTN Framer and Front-End - 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. | 07-04-2013 |
20130170826 | 802.3av Compliant Method Using Small Timescale Bandwidth Assignment for Increased ONU Downstream Energy Efficiency - 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. | 07-04-2013 |
20130173853 | MEMORY-EFFICIENT CACHING METHODS AND SYSTEMS - 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. | 07-04-2013 |
20130176852 | Network Self-Protection - 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. | 07-11-2013 |
20130185438 | Policy-Aware Based Method for Deployment of Enterprise Virtual Tenant Networks - 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. | 07-18-2013 |
20130205303 | Efficient Checking of Pairwise Reachability in Multi-Threaded Programs - 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. Such an approach improves the accuracy of the race prediction for general locking style that includes recursive, nesting/non-nesting, and thereby improving the overall runtime verification | 08-08-2013 |