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. Additional symmetry-based matching techniques are used to perform staged pattern matching between the two configurations, where the process may terminate as soon as one of the techniques determines that the configurations cannot match, or a matching algorithm determines that they 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:
A system and method for automatically generating a second graphical program based on a first graphical program. The first graphical program may be associated with a first programming development environment. For example, a user may have interactively created the first graphical program from within the first programming development environment, e.g., by using an editor to place various nodes on a block diagram, such that the nodes visually indicate functionality of the first graphical program. The method may operate to automatically, i.e., automatically, generate a second graphical program based on the first graphical program, such that the second graphical program is associated with a second programming development environment. The method may generate the second graphical program automatically, 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. Thus, once the second graphical program has been generated, the user may use the second programming development environment to edit the second graphical program, execute the second graphical program, etc.
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:
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 discrete curves. A mapping operator is applied to a first discrete curve to amplify its features, generating a first mapped discrete curve. A correlation of the first mapped discrete curve with each of a plurality of rotationally shifted versions of a second mapped discrete curve is computed, generating a corresponding plurality of correlation values. A minimum period of the two curves is determined based on the correlation values, and, based on the minimum period, a symmetry group (SG) of the two curves is determined and output. If the two curves are the same curve, the SG is the rotational SG of the discrete curve. If the second curve is a reflection of the first, the SG is the mutual reflection SG of the first. If the first and second curves are different curves, the SG is the mutual SG of the two curves.
Abstract:
A system and method for estimating the shift between two signals. The shift estimation system method comprises: (a) receiving a first signal, where the first signal may be represented as a vector g having N components; (b) projecting the vector g to a space with dimension K less than N to obtain a projection vector X having K components; (c) computing measures of distance between the projection vector X and each vector in a set of stored vectors; (d) determining a stored vector p in the set of stored vectors with a minimum distance to the projection vector X. The stored vectors are generated from a template signal f, also represented as a vector with N components, by projecting shifted versions of the template signal f to the space of dimension K. The shifted versions of the template signal f may be referred to as shifted template vectors, or simply, shift vectors. The shift estimation method may provide a shift value corresponding to the shifted template vector which generates the stored vector p as an estimate for the shift between the received signal and the template signal f. The shift value defines the amount by which the template signal f must be shifted to obtain the shifted template vector.
Abstract:
A conveyor-type sludge filtering device for extracting the liquid component from the sludge, the device including a horizontally moving supported strand of a perforate endless conveyor belt onto which a continuous flow of sludge is deposited, while rows of flow breaker members extend downwardly into the moving sludge, thereby preventing the formation of sludge layers, especially of a belt-plugging bottom layer of solid matter. The flow breakers are preferably wedge-shaped and pivotably supported on transverse rods.
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.