Abstract: A system and method for performing multi-user random access procedures in a mobile telecommunications network between a base station and a user equipment (UE) having a plurality of antennas includes transmitting a random access signal set (RASS) message using one or more antennas of the plurality of UE antennas. In response to receiving the RASS message, the base station transmitting a random access response physical downlink control channel (RAR-PDCCH) message. In response to receiving the RAR-PDCCH message, transmitting a reciprocity reference signal set (RRSS) signal using the plurality of UE antennas.

Abstract: Nyquist filters for pulse shaping and related matched filters in wireless communications are disclosed that provide improved performance. The disclosed embodiments recognize that the second derivative of the raised cosine function is discontinuous in the frequency domain and that the first derivative of the square root raised cosine is discontinuous in the frequency domain. As such, a generalization for the raised cosine filter is applied, and improvements can be made to the raised cosine function time-frequency localization and ultimately to tradeoffs between inter-symbol interference and adjacent channel interference by introducing smoothness to the higher order derivatives of the frequency response.

Abstract: A system and method for performing multi-user random access procedures in a mobile telecommunications network between a base station and a user equipment (UE) having a plurality of antennas includes transmitting a random access signal set (RASS) message using one or more antennas of the plurality of UE antennas. In response to receiving the RASS message, the base station transmitting a random access response physical downlink control channel (RAR-PDCCH) message. In response to receiving the RAR-PDCCH message, transmitting a reciprocity reference signal set (RRSS) signal using the plurality of UE antennas.

Abstract: Nyquist filters for pulse shaping and related matched filters in wireless communications are disclosed that provide improved performance. The disclosed embodiments recognize that the second derivative of the raised cosine function is discontinuous in the frequency domain and that the first derivative of the square root raised cosine is discontinuous in the frequency domain. As such, a generalization for the raised cosine filter is applied, and improvements can be made to the raised cosine function time-frequency localization and ultimately to tradeoffs between inter-symbol interference and adjacent channel interference by introducing smoothness to the higher order derivatives of the frequency response.

Abstract: Performing sequencing of a polynucleotide. A first image of microparticles that are distributed in a random fashion on a substrate may be received. Each of the microparticles may include a plurality of similar oligonucleotides of the polynucleotide. A second image of the microparticles may be received. A plurality of first subportions of the first image may be determined. Each subportion may include a respective plurality of microparticles distributed in a random fashion. The second image may be analyzed to identify a plurality of second subportions in the second image. Each of the plurality of second subportions may correspond to a respective one of the plurality of first subportions. A plurality of the microparticles may be matched from the first and second images based on said analyzing. At least a portion of the sequence of nucleotides of the polynucleotide may be determined based on said matching.

Abstract: A computerized assessment grading method comprises creating a syntax tree for a received equation-based response to at least one assessment question and a syntax tree for at least one solution to the at least one question, comparing the syntax trees, and grading the response based on the results of the comparison.

Abstract: Performing sequencing of a polynucleotide. A first image of microparticles that are distributed in a random fashion on a substrate may be received. Each of the microparticles may include a plurality of similar oligonucleotides of the polynucleotide. A second image of the microparticles may be received. A plurality of first subportions of the first image may be determined. Each subportion may include a respective plurality of microparticles distributed in a random fashion. The second image may be analyzed to identify a plurality of second subportions in the second image. Each of the plurality of second subportions may correspond to a respective one of the plurality of first subportions. A plurality of the microparticles may be matched from the first and second images based on said analyzing. At least a portion of the sequence of nucleotides of the polynucleotide may be determined based on said matching.

Abstract: System and method for approximating a system. A multi-parameter representation of a family of systems is stored. An embedding of the family into an abstract geometrical continuous space with a metric and defined by the parameters is determined. Coordinates of the space specify values for the parameters of systems of the family. The space includes a grid of points representing respective discrete approximations of the systems. A first point corresponding to a desired instance of a system is determined. The first point's coordinates specify values for the parameters of the instance. The space is sampled using a mapping of a well-distributed point set from a Euclidean space of the parameters to the abstract space. A nearest discrete point to the first point is determined which specifies values for parameters for an optimal discrete approximation of the desired instance, which are useable to implement the discrete approximation of the desired instance.

Abstract: System and method for controlling/analyzing a process by solving a system of linear equations in real-time. Linear equations that model the process are stored. In an off-line stage a partitioning strategy is determined based on the linear equations, including determining groups of values for recursively partitioning a set of values measured and/or computed from the process. In an on-line stage: current process data are received from the process, including measurements from the process, and composing a set of values; the linear equations are recursively solved for a first group of the set, where the first group partitions the set into respective subsets of values, and where the recursively solving produces solved values for respective first groups of the set/subset of values; the linear equations are solved for remaining unsolved values in the set, thereby producing solved values for the set, which are stored and are useable to control/analyze the process.

Abstract: System and method for programmatically generating a second graphical program associated with a second programming development environment based on a first graphical program associated with a first programming development environment. The second graphical program may be generated programmatically, without relying on user input, or may prompt for user input to determine various options to use in generating the second graphical program. The second graphical program may implement the functionality of, or a portion of the functionality of, the first graphical program. The method preferably generates the second graphical program such that the second programming development environment is operable to treat the second graphical program identically to a graphical program interactively developed by a user using the second programming development environment.

Abstract: System and method for programmatically generating a second graphical program associated with a second programming development environment based on a first graphical program associated with a first programming development environment. The second graphical program may be generated programmatically, without relying on user input, or may prompt for user input to determine various options to use in generating the second graphical program. The second graphical program may implement the functionality of, or a portion of the functionality of, the first graphical program. The method preferably generates the second graphical program such that the second programming development environment is operable to treat the second graphical program identically to a graphical program interactively developed by a user using the second programming development environment.

Abstract: A computerized assessment grading method comprises creating a syntax tree for a received equation-based response to at least one assessment question and a syntax tree for at least one solution to the at least one question, comparing the syntax trees, and grading the response based on the results of the comparison.

Abstract: Automatic conversion of textual program code to graphical program code is performed. The method automatically translates the given functionality of a textual program code into executable graphical program code, corresponding to the same functionality. The method includes a parsing routine that generates a syntax tree and code generation routines, which create graphical program code from the syntax tree.

Abstract: Automatic conversion of textual program code to graphical program code is performed. The method automatically translates the given functionality of a textual program code into executable graphical program code, corresponding to the same functionality. The method includes a parsing routine that generates a syntax tree and code generation routines, which create graphical program code from the syntax tree.

Abstract: System and method for detecting symmetries of configurations of discrete curves. Configuration characterization information for a configuration of a plurality of discrete curves is received, where the configuration characterization information comprises rotational symmetry groups for each of the plurality of discrete curves. A greatest common divisor of the rotational symmetry groups of the discrete curves is determined, where the greatest common divisor is a maximum possible object-based mutual rotational symmetry group for the configuration. The determined value is stored, and is usable to perform pattern matching between configurations. This value may be compared to that of a target configuration to determine if the two configurations can match.

Abstract: System and method for approximating a system. A multi-parameter representation of a family of systems is stored. An embedding of the family into an abstract geometrical continuous space with a metric and defined by the parameters is determined. Coordinates of the space specify values for the parameters of systems of the family. The space includes a grid of points representing respective discrete approximations of the systems. A first point corresponding to a desired instance of a system is determined. The first point's coordinates specify values for the parameters of the instance. The space is sampled using a mapping of a well-distributed point set from a Euclidean space of the parameters to the abstract space. A nearest discrete point to the first point is determined which specifies values for parameters for an optimal discrete approximation of the desired instance, which are useable to implement the discrete approximation of the desired instance.

Abstract: System and method for estimating a rotational shift between a first discrete curve and a second discrete curve, where the second discrete curve is a rotationally shifted version of the first discrete curve. First and second discrete curves are received. A rotational shift between the first discrete curve and the second discrete curve is estimated based on the first discrete curve and the second discrete curve. A cumulative rotational shift is updated based on the estimated rotational shift. A rotationally shifted version of the second discrete curve is generated based on the cumulative rotational shift. The estimating, updating, and generating are performed in an iterative manner using the respective rotationally shifted discrete curve for each iteration until a stopping condition occurs, thereby determining a final estimate of the rotational shift between the first discrete curve and the second discrete curve. The final estimate may be used to perform curve matching.

Abstract: System and method for controlling/analyzing a process by solving a system of linear equations in real-time. Linear equations that model the process are stored. In an off-line stage a partitioning strategy is determined based on the linear equations, including determining groups of values for recursively partitioning a set of values measured and/or computed from the process. In an on-line stage: current process data are received from the process, including measurements from the process, and composing a set of values; the linear equations are recursively solved for a first group of the set, where the first group partitions the set into respective subsets of values, and where the recursively solving produces solved values for respective first groups of the set/subset of values; the linear equations are solved for remaining unsolved values in the set, thereby producing solved values for the set, which are stored and are useable to control/analyze the process.

Abstract: System and method for programmatically generating a second graphical program associated with a second programming development environment based on a first graphical program associated with a first programming development environment. The second graphical program may be generated programmatically, without relying on user input, or may prompt for user input to determine various options to use in generating the second graphical program. The second graphical program may implement the functionality of, or a portion of the functionality of, the first graphical program. The method preferably generates the second graphical program such that the second programming development environment is operable to treat the second graphical program identically to a graphical program interactively developed by a user using the second programming development environment.

Abstract: A device for removing harmful constituents from exhaust gases of internal combustion engines comprises a first housing for conducting exhaust gases, the first housing containing a front, middle, and rear area with at least one intake in the front area and at least one outlet in the rear area. A first structure containing a plurality of contiguous cavities covers the cross-section of the first housing at least partially. The following are disposed in the housing in any sequence: a second structure which contains and/or is coated with a first metal oxide; a third structure which contains and/or is coated with a catalyst for converting or degrading contaminants; and a fourth structure which contains and/or is coated with a second metal oxide. The first housing contains or is at least partially made of or coated with porous aluminum oxide, mullite, cordierite, silicon nitride, tialite, steatite, zircon, zircon dioxide and/or silicon carbide.