Abstract: In accordance with aspects of the present principles, an over-approximation of reachable states of a hybrid system may be determined by utilizing template polyhedra. Policy iteration may be utilized to obtain an over-approximation of reachable states in the form of a relaxed invariant based upon template polyhedra expressions. The relaxed invariant may be used to construct a flowpipe to refine the over-approximation and thereby determine the reachable states of the hybrid system.

Abstract: A system and method for determining a similarity between a document and a query includes building a weight vector for each of a plurality of documents in a corpus of documents stored in memory and building a weight vector for a query input into a document retrieval system. A weight matrix is generated which distinguishes between relevant documents and lower ranked documents by comparing document/query tuples using a gradient step approach. A similarity score is determined between weight vectors of the query and documents in a corpus by determining a product of a document weight vector, a query weight vector and the weight matrix.

Abstract: In accordance with exemplary embodiments of the present invention, a content addressable data structure system may include directed acyclic graphs (DAGs) of data content that are addressed using both a user-defined search key and content of data blocks. Internal keys of retention roots of the DAGs may be derived from the user-defined search key while the remaining blocks may be content addressed. As opposed to using a content address, the user may provide the search key when retrieving and deleting DAGs retaining the data content. In addition, the internal keys may be implemented using internal content addressable storage operations, such as applying a hash function and employing a distributed hash table.

Abstract: An optical network component, architecture and method for a wavelength division multiplexed passive optical network includes a band coupler configured to demultiplex first and second wavelength division multiplexed content transmitted from an optical line terminal into a first band signal and a second band signal. An arrayed wavelength grating is configured to receive the first band signal and to further demultiplex the first band signal into different wavelengths to provide a plurality of wavelength signals. An optical splitter is configured to split the second band signal into sub-signals and multiplex the sub-signals with each of the wavelength signals such that the first and second wavelength division multiplexed content is provided on a single wavelength to a user.

Abstract: Methods and systems for indexing subband selections are disclosed. The selected subbands can be represented as a binary sequence and the index can be determined by employing a choose function, where a choose function value for a particular selected bit position is defined by a selection occurrence count of the selected bit position that is chosen from a bit position count of the selected bit position. In particular, the index can be the summation of choose function values for each selected bit position.

Abstract: Methods and systems for processing communication signals in an Orthogonal Frequency Division Multiple Access (OFDMA)-Passive Optical Network (PON) are disclosed. An optical carrier at a wavelength generated at an optical line terminal (OLT) may be reused by optical network units (ONUs) in the network for upstream transmission of data signals to the OLT. In addition, each ONU may perform carrier suppression to avoid broadband beating noise resulting from the simultaneous transmission of upstream data signals on the same wavelength. Further, the optical source at the OLT used to generate the optical carrier may be reused as a local oscillator for coherent detection of received upstream signals to minimize any frequency offsets.

Abstract: In accordance with exemplary implementations, application computation operations and communications between operations on a host processing platform may be adapted to conform to the memory capacity of a parallel accelerator. Computation operations may be split and scheduled such that the computation operations fit within the memory capacity of the accelerator. Further, the operations may be automatically adapted without any modification to the code of an application. In addition, data transfers between a host processing platform and the parallel accelerator may be minimized in accordance with exemplary aspects of the present principles to improve processing performance.

Abstract: A system and method for dynamical decoupling of a quantum system includes forming a graph including elements to account for decoupling sequence effects represented as nodes in the graph and soft pulses applied being represented as edges in the graph. Sequences which visit edges and nodes in the graph are provided. Binary strings corresponding to the nodes in a coordinate system are mapped using a fixed linear error correcting code. A decoupling method is provided based upon a matrix formed using the error correcting code to determine features of the soft pulses to decouple environmental effects from the quantum system.

Abstract: Arbitrarily high data transmission rates may be achieved by the use of N-dimensional, LDPC-coded modulation. N orthonormal basis functions are employed using coherent reception, resulting in a proportional increase in transmission rate with only a modest increase in bit-error ratio.

Abstract: System(s) and method(s) are provided for data management and data processing. For example, various embodiments may include systems and methods relating to relatively larger groups of data being selected with comparable or better performing selection results (e.g., high data redundancy elimination and/or average chunk size). In various embodiments, the system(s) and method(s) may include, for example a data group, block, or chunk combining technique or/and a data group, block, or chunk splitting technique. Various embodiments may include a first standard or typical data grouping, blocking, or chunking technique and/or data group, block, or chunk combining technique or/and a data group, block, or chunk splitting technique. Exemplary system(s) and method(s) may relate to data hashing and/or data elimination. Embodiments may include a look-ahead buffer and determine whether to emit small chunks or large chunks based on characteristics of underlying data and/or particular application of the invention (e.g.

Abstract: According to exemplary methods and systems of the present principles, the location of defective field repairable units (FRUS) of a circuit that have varying sizes or varying numbers of scan cells may be identified by employing tiles including scan cells from different FRUS. A set of test patterns may be scanned through the scan cells such that cells belonging to FRUs within a tile may be concealed while analyzing the response of scan cells in the tile contributed by a different FRU. Further, defective tiles are discoverable at any tile location and in any quantity within a maximal capacity using a compressed signature. In addition, signature registers that process data at a rate that is faster than the scan shift rate of the circuit may be employed during compression to multiply a circuit response by a plurality of components of a compression matrix during one scan shift cycle.

Abstract: A storage area network extension, network and method include a storage terminal coupled to a remote node. The remote node is connected to a passive optical network (PON) for transferring data signals in the PON and storage signals to/from the storage terminal by employing subcarrier channels in the PON to enable concurrent bidirectional transfer of the data and the storage signals. A storage area network is coupled to the storage terminal and configured to store and retrieve the storage signals for transfer over the PON.

Abstract: A system and method for mining program specifications includes generating unit tests to exercise functions of a library through an application program interface (API), based upon an (API) signature. A response to the unit tests is determined to generate a transaction in accordance with a target behavior. The transaction is converted into a relational form, and specifications of the library are learned using an inductive logic programming tool from the relational form of the transaction.

Abstract: A system and method for dynamically allocating sub-carriers between the nodes of an optical OFDMA ring network or an OFDMA passive optical network. A carrier allocation system assigns sub-carriers according to a utility function based on real-time measurements of arrival data rates and queue length variance.

Abstract: A system and method for race warning generation for computer program verification includes determining shared variables and determining context-sensitive points-to sets for lock pointers by focusing on pointers that may affect aliases of lock pointers, and by leveraging function summarization. Locksets are determined at locations where shared variables are accessed using the points-to sets for lock pointers. Warnings are based on disjointness of locksets.

Abstract: A receiver and method are provided for mitigation of finer non-linearities in multilevel coded-modulation schemes. The receiver includes a multilevel Bahl-Cocke-Jelinek-Raviv (BCJR) equalizer configured to receive channel samples of an input signal, partially mitigate fiber non-linearities, and provide symbol reliabilities. The receiver further includes a bit probabilities module coupled to the BCJR equalizer configured to calculate soft bit reliabilities from the symbol reliabilities. The receiver also includes one or more low-density parity-check (LDPC) decoders coupled to the bit probabilities module and the BCJR equalizer, configured to receive the soft bit reliabilities and output code words. The one or more LDPC decoders iteratively provide extrinsic soft information feedback to the BCJR equalizer to compensate for the fiber non-linearities.

Abstract: A receiver and method are provided. The receiver includes a detector configured to receive polarization multiplexed coded orthogonal frequency division multiplexing input sequences and generate estimates of unknown transmitted symbols in the input sequences for x- and y-polarization channels with respect to laser phase noise and PMD. A demapper coupled to the detector is configured to partially cancel polarization mode dispersion (PMD) in the input sequences by computing symbol probabilities for the estimates with respect to the laser phase noise, and averaging the symbol probabilities with respect to the laser phase noise. One or more low-density parity-check (LDPC) decoders coupled to the demapper are configured to receive bit probabilities derived from the averaged symbol probabilities and output code words based at least on the bit probabilities. The one or more LDPC decoders iteratively provide extrinsic soft information feedback to the demapper to compensate for the PMD.

Abstract: A system and method to adjust the symbol constellation used to de-map a signal in an optical coherent communications system. A feedback de-mapper adjustment module is configured to compare average Error Vector Magnitude and Bit Error Ratio to a pre-defined table to determine when a constellation de-mapper mismatch occurs. The feedback de-mapper adjustment module then rotates the de-mapper constellation in order to compensate for phase drift.

Abstract: A system and method for semantic extraction using a neural network architecture includes indexing each word in an input sentence into a dictionary and using these indices to map each word to a d-dimensional vector (the features of which are learned). Together with this, position information for a word of interest (the word to labeled) and a verb of interest (the verb that the semantic role is being predicted for) with respect to a given word are also used. These positions are integrated by employing a linear layer that is adapted to the input sentence. Several linear transformations and squashing functions are then applied to output class probabilities for semantic role labels. All the weights for the whole architecture are trained by backpropagation.

Abstract: A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost.