| Patent application number | Description | Published |
|---|
| 20080256512 | OUT OF BAND DATA AUGMENTATION - Systems and methods facilitate data augmentation in a computer environment. Data collections of various forms are altered out of band with at least one augmentor specifying alterations thereto. The alterations are applied to an associated collection of data such as programmatic code. In this manner, data can be modified, extended and/or removed from the collection to enable specialization and/or personalization, among other things. | 10-16-2008 |
| 20090024683 | N-Dimensional Coordinates Conversion - Aspects of the subject matter described herein relate to converting between polar and rectangular coordinates. In aspects, the Nth polar angle is measured upward from the sine-projection of the Nth component in the (N−1)th dimension. The last polar coordinate is zero if and only if the corresponding last rectangular coordinate is zero. The conversion may be applied in any number of dimensions without re-writing the conversion logic. | 01-22-2009 |
| 20090024986 | RUNTIME CODE MODIFICATION - Source languages are translated to target dynamic programming languages. Runtime functionality including reflection and/or dynamic code modification exposed by a source language is mapped to a dynamic language implementation such as that of a script language. Target language dynamism is leveraged to efficiently support runtime functionality in a source language that is more static, for example. | 01-22-2009 |
| 20090030659 | SEPARABLE INTEGRATION VIA HIGHER-ORDER PROGRAMMING - Separable integration is provided for simulation contexts where modeling and integration can be considered separately when programmatically implementing the simulations, for example. Thus, modeling concepts can be defined relating to the simulation, and integration of the modeling concept can happen separately to provide more variety to meet modeling specifications. In one embodiment, a state-space form equation can be computed for a modeling concept equation (an equation of motion, for example) and an integration scheme can be applied to the state-space form equation regardless of the modeling equation from which it was computed. In this regard, integration can be focused on to provide a plurality of schemes for different contexts, for example. | 01-29-2009 |
| 20090049421 | AUTOMATIC AND TRANSPARENT MEMOIZATION - Functions are memoized automatically and transparently. Memoized code can be injected automatically within a program to facilitate efficient and/or expeditious execution thereof, among other things. The memoized code can intercept calls to an original function and return values in accordance with the code. Accordingly, callers of the function need not do anything special and can invoke the function without knowledge of it being memoized. | 02-19-2009 |
| 20090112975 | PRE-FETCHING IN DISTRIBUTED COMPUTING ENVIRONMENTS - Client-side performance is optimized through server-side pushing of content. Portions of content are requested and retrieved as required by a client-side application. Moreover, content likely to be needed in the near future is pre-fetched and pushed to the client. This is beneficial from an overhead standpoint since all content need not be provided to the client at once. Rather, content provisioning is throttled based on need, and wait time is mitigated by pre-fetching. | 04-30-2009 |
| 20090132998 | DEBUGGING MULTI-EXECUTION ENVIRONMENT APPLICATIONS - A framework is provided that allows for debugging of applications/systems that execute in multiple execution environments. Instead of using the native application programming interface to interact with an execution environment, an alternative implementation of at least some of the application programming interface of the native execution environment is employed to facilitate debugging in a disparate execution environment. | 05-21-2009 |
| 20090249282 | CROSS PLATFORM COMPOSITIONAL WIDGETS - Mechanisms are afforded for supporting cross platform widgets. A generic widget can be converted into a specialized widget of a corresponding platform. Dually, a specialized widget can be generalized to a generic widget for subsequent deployment on the same or different host. Furthermore, support is provided for compositional widgets across platforms. | 10-01-2009 |
| 20090276795 | VIRTUAL AUTOMATA - Computer-based machines can be modeled after a virtual automaton. The virtual automaton defines processes that are not bound statically to particular behavior but rather perform a lookup at runtime to bind behavior to a specific process mechanism. In accordance with one aspect, binding can be dependent upon runtime context information such as object type. Instances of virtual automaton are provided in the context of graph processing including serialization of object graphs and scanning/parsing, among others. | 11-05-2009 |
| 20090325694 | MACROSCOPIC QUANTUM EFFECTS FOR COMPUTER GAMES - The claimed subject matter provides a system and/or a method that facilitates providing a realistic simulation within a gaming environment. A gaming environment can enable at least one user to interact with a computer game in order to produce visual feedback in which the computer game includes a simulation that mimics an event in a physical real world. A macroscopic quantum effects (MQE) engine can utilize quantum physics as a basis for at least one simulation within the gaming environment, wherein the MQE engine leverages an equation related to quantum physics which enables the simulation to replicate a property associated with realistic quantum mechanics. An interface can allow data communication between the gaming environment and the MQE engine. | 12-31-2009 |
| 20090327183 | Analytical model solver framework - A solver framework for use with an analytical model. The analytical model includes multiple model parameters and includes definitions for analytical relationships between the model parameters. The solver framework coordinates the processing of multiple specialized solvers. In particular, the solver framework identifies which model parameters are input model variables and which are output model variables. The solver framework then analyzes dependencies to determine a solve order to solve for the output model variables. The solver framework then charged the specialized solvers with performing portions of the solve operation such that the specialized solvers solve for the output model variables in an order which considers the dependencies. In one embodiment, additional or replacement solvers may register with the solver framework to thereby make the specialized solver available for solving for output model variables in the future. | 12-31-2009 |
| 20100086208 | ALMOST RECTANGULAR TRIANGULATIONS - Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result of determining that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral, each of the irregular quadrilaterals in the irregular grid is triangulated to create a triangular mesh by defining diagonals from at least one vertex point of each of the irregular quadrilaterals in the irregular grid to the diagonally opposed vertex point of the same irregular quadrilateral. The triangular mesh is stored in a computer readable storage medium that can be accessed by an application for performing tasks related to data visualization, computer graphics, computational geometry, etc. | 04-08-2010 |
| 20100156900 | IMPLIED ANALYTICAL REASONING AND COMPUTATION - Solving for output variable(s) of a model that includes multiple analytically related model variables. The identity of the output model variables and the analytical relationships between the model variables are separately designated. Regardless of the identity of the output variable(s), a solver framework interprets the analytical relationships and solves for the designated output variable(s). The output model variable(s) may be designated separately than the analytical relationships themselves. By simply changing the designation of the output model variable(s), the analytical relationships are reevaluated, and the output variable(s) are solved for. The solver framework itself stays the same regardless of the identity of the output model variable(s). | 06-24-2010 |
| 20100158245 | IMPLICIT ITERATION OF KEYED ARRAY SYMBOL - The use of a data structure that is a symbolic representation of a keyed array that has an array variable and an associated key variable. There is a correlation maintained between the variable type of the array variable and the corresponding keying set that is to be bound to the associated key variable. The keyed array may remain unbound thereby being simply symbolically represented, or the keying set may be bound to the key variable more immediately. In one embodiment, once the keying set is bound to the key variable, data may be bound to the array variable itself. This may be repeated for multiple keyed arrays. The data from multiple keyed arrays may be operated upon to about another array of values, which may then be aggregated in some way. | 06-24-2010 |
| 20100162218 | RELAXED AND EXTENDED DELEGATES - Systems and methods that enhance expressibility in a programming language (e.g., Visual Basic) via relaxation of artificial restrictions and extension of delegates associated therewith, without changing the runtime infrastructure. A stub is employed that can replace an impermissible expression in the programming language, to leverage the existing permissible expressions. | 06-24-2010 |
| 20100321391 | COMPOSING SHAPES AND DATA SERIES IN GEOMETRIES - A renderable geometry the may be populated with shapes and data series. The geometry defines a set of dimensions to be applied to the shapes. The geometry further defines and enforces a construction of the shapes around the set of dimensions, and applies the data series to the plurality of shapes against at least one of the set of dimensions. The formulate of the geometry may be recursively performed. For instance, the geometry may be provided as a shape in a set of shapes provided to yet another geometry with another data series. The data series might be reversibly applied to one of the dimensions, allowing for complex geometries to be created with data represented in very flexibly ways. | 12-23-2010 |
| 20100324870 | SOLVER-BASED VISUALIZATION FRAMEWORK - Visualization frameworks may include solvers. The solvers may be used to determine the properties of view components of view compositions. In some instances, the solvers may be explicitly composed using a relational structure, such as a dependency tree. In some instances, the solvers may be implicitly composed based on property-setters having solvers invoking other property-setters having solvers. | 12-23-2010 |
| 20100325196 | DATA-DRIVEN VISUALIZATION OF PSEUDO-INFINITE SCENES - The use of a data stream object to enumerate elements of a data stream to thereby drive rendering of a data-driven model. The data driven model includes multiple view components that may use their own construction logic to render visual items based on data provided to their input parameter(s). The data stream may be quite large, in which case, only a portion of the data stream is enumerated by the data stream object. The enumerated elements of the data stream may be used to populate the input parameters of the view components, and or may be provided to analytics, from which input parameters of the view components may be derived. Thus, a data stream, regardless of its size, may be dealt with in the consistent manner to thereby drive the data-driven model. | 12-23-2010 |
| 20100325564 | CHARTS IN VIRTUAL ENVIRONMENTS - The application of chart data to a virtual space. The chart data is accessed and a virtual space is formulated. The virtual space is a computerized representation of a plurality of spatially interrelated visual items. The chart data is merged with the virtual space. As an example, the chart data might represent spatially significant information. For instance, one data item in the chart data might represent information about a first point or region in the virtual space, another data item in the chart data might represent information about a second point or region in the virtual space, and so forth. Merging of the chart data might involve changing property(s) of corresponding regions of space depending on value(s) of the associated chart data. | 12-23-2010 |
| 20110060704 | DEPENDENCY GRAPH IN DATA-DRIVEN MODEL - The inference of a dependency graph that represents a graph of solves that leads from input model parameter(s) to output model parameters using analytics. In one embodiment, the dependency graph is part of visually driven analytics in which the output model parameter(s) are used to formulate data-drive scenes. As the identity of the input and/or output model parameter(s) change, or as the analytics themselves change, the dependency graph may also change. This might trigger a resolve of the analytics. In one embodiment, the intermediate parameters involved in the dependency graph may be viewed and evaluated by the user. | 03-10-2011 |
| 20110072413 | EMBEDDING EXPRESSIONS IN XML LITERALS - An architecture that that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment. Additionally, the architecture supports escaping XML identifiers, a reification mechanism, and a conversion mechanism to convert between collections and singletons. | 03-24-2011 |
