Anderson, Redmond
Chris L. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20100088283 | SYSTEM AND METHOD FOR MANAGING DATABASE APPLICATIONS - The subject disclosure relates to a method and system for managing a database application. The method and system include receiving a deployment package, which includes deployed objects of a declarative execution model and defining a plurality of data structures extracted from the deployment package such that at least one data structure populates an extended catalog. The deployed objects are then stored in a manner consistent with the plurality of data structures. | 04-08-2010 |
20140331213 | PACKAGING SYSTEM TO FACILITATE DECLARATIVE MODEL-DRIVEN DEVELOPMENT - The subject disclosure relates to a method and system for packaging a post-processed definition of a programming module. Contents of a constraint-based and/or order-independent execution model are received, in which the contents include a declarative source code. The contents are stored into an extensible storage abstraction such that the source code is stored in a declarative format. Metadata describing attributes of the contents stored in the extensible storage abstraction is also defined. A file is then created, which includes the extensible storage abstraction and the metadata. | 11-06-2014 |
Christopher L. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090187886 | DECLARTIVE COMMANDS USING WORKFLOWS - Declaratively implementing a command. A method includes declaring an input gesture in a declarative programming language. Declaring an input gesture includes declaring one or more user performed actions. A command name is declared in a declarative programming language. A workflow is declared in a declarative programming language. Declaring a workflow includes declaring schedulable activities that are to be performed without specific specifications of the low level algorithms that are used to accomplish the activities. In an alternative example, workflows may be declared by declaring a wrapper to wrap imperative programming commands. The declared input gestures are bound with the declared workflow through the declared command name. | 07-23-2009 |
20090204912 | GENEERAL PURPOSE INFINITE DISPLAY CANVAS - Expanding and contracting a display screen container. Data is stored in a computer readable medium. The data represents a screen container such as a graphical desktop user interface displayable to a user on a computer display of a computing device. Data is stored representing artifacts, including one or more application graphical user interface artifacts for applications that are instantiated on the computing device. Information is stored specifying locations where each of the artifacts should be graphically located in the screen container. The graphical size of screen container is determined by the locations of the artifacts. Based on user input, a portion of the screen container is displayed to the user on the computer display of the computing device. The screen container may be expanded or contracted based on opening or closing graphical user interface artifacts, adding or removing artifacts, or repositioning artifacts. | 08-13-2009 |
20090204941 | IMPLICIT COMPOSITION OF COMPONENT BINDINGS - Component domains used to define a binding between various components associated with the component domain. The component domain tracks the various services to be imported by each component, and tracks the various services exported by each component. At runtime, rather than at compile time, the various interrelations between the components are bound using the service import and export data. Accordingly, depending on the components available and their characteristics, the bindings may differ. This permits applications to be much more flexible. | 08-13-2009 |
20090204942 | ITERATIVE COMPONENT BINDING - Component domains used to define a binding between various components associated with the component domain. The component domain tracks the various services to be imported by each component, and tracks the various services exported by each component. At runtime, rather than at compile time, the various interrelations between the components are bound using the service import and export data. Accordingly, depending on the components available and their characteristics, the bindings may differ. This permits applications to be much more flexible. In one implementation, the binding is performed iteratively. For example, if after one iteration of binding service imports to service exports, some components may expand the services that they export, or the services that they desire to import. | 08-13-2009 |
20090216778 | ACCESSING DIFFERENT APPLICATION DATA VIA A COMMON DATA STRUCTURE - A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures. | 08-27-2009 |
20090216791 | EFFICIENTLY CORRELATING NOMINALLY INCOMPATIBLE TYPES - A nominal type framework can be configured to efficiently correlate different nominal types together based on a minimum set of common type shapes or structures. In one implementation, a developer identifies a number of different nominal types of interest (source types), and identifies the minimum set of common type shapes to be accessed by an application program. The minimum set of common type shapes can then be used to create an intermediate type (target type) to which each of the other different source types can be mapped. For example, one or more proxies can be created that map shapes of the one or more source types to corresponding shapes of the created target type. The application program created by the developer, in turn, can access, operate on, or otherwise use the mapped data of each different source type through a single target type. | 08-27-2009 |
20110252282 | PRAGMATIC MAPPING SPECIFICATION, COMPILATION AND VALIDATION - Facilitating translation of data between object oriented programs and database storage tables. A method includes receiving user input from a user. The user input includes a plurality of parts. Each part includes a specification of a source (such as a type source), optionally a filter, and a projection. Each projection assigns values to table columns. Based on the plurality of parts received, the method includes generating one or more views. The one or more views describe relationships between model extents and database tables. | 10-13-2011 |
20110307519 | Cogeneration of Database Applications and Their Databases - User experience in a designer tool manages cogeneration of a database application and a database accessible through the application. A user places a visual representation of an application element designed to control a relational or hierarchical dataset. Code is automatically called to add the application element to the application, and automatically invoked to create database schema elements designed to implement the dataset in the database under application element control. Users verify that an application element has been automatically added, and confirm that database schema elements implementing the dataset(s) under control of the application element have been automatically created. A tutorial illustrates a workflow utilizing a designer tool to cogenerate a database application and a database without a data design step. A wizard utilizes the designer tool to cogenerate a database application and a database that collectively implement a calendar, a diagram, a tree, a wiki, and/or a list. | 12-15-2011 |
20130066925 | ACCESSING DIFFERENT APPLICATION DATA VIA A COMMON DATA STRUCTURE - A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures. | 03-14-2013 |
20130191811 | DECLARTIVE COMMANDS USING WORKFLOWS - Declaratively implementing a command. A method includes declaring an input gesture in a declarative programming language. Declaring an input gesture includes declaring one or more user performed actions. A command name is declared in a declarative programming language. A workflow is declared in a declarative programming language. Declaring a workflow includes declaring schedulable activities that are to be performed without specific specifications of the low level algorithms that are used to accomplish the activities. In an alternative example, workflows may be declared by declaring a wrapper to wrap imperative programming commands. The declared input gestures are bound with the declared workflow through the declared command name. | 07-25-2013 |
Christopher Lee Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090193136 | STREAMING OBJECT INSTANTIATION USING BOOKMARKS - Bookmarking of tokens in a set of streaming tokens, each representing an instantiation instruction or instantiation context. A navigator receives a set of streaming tokens, and provides the tokens to the instantiation manager. However, if the navigator receives an instruction to bookmark a particular token, the navigator buffers the set of streaming instructions at least beginning at the bookmarked token (and possible even earlier if there were prior bookmarks). The navigator replays the set of streaming tokens beginning at a bookmark in response to an instruction from an instantiation manager. The instantiation manager receives the set of streaming tokens. If the instantiation manager is not presently capable of handling the instruction of a particular token, the instantiation manager instructs the navigator to bookmark the particular token. When the instantiation manager later receives a token that permits the instantiation manager to return to the bookmark, the instantiation manager returns to the bookmark to replay the instantiation instructions beginning at the bookmark. | 07-30-2009 |
20100141658 | TWO-DIMENSIONAL SHADOWS SHOWING THREE-DIMENSIONAL DEPTH - Digital shadowing when rendering visual items (e.g., windows) at different virtual display levels (such as z-order levels). The rendering is based on the determination of a position and virtual display level for each of the visual items to be displayed. For those visual items that cast a shadow on lower-level in-shadow visual items, the determined position of the shadow-casting visual item is used to render the shadow on each of the in-shadow visual items differently depending on the corresponding virtual display level of the in-shadow visual items. In particular, the in-shadow visual item that has a lower virtual display level has a longer shadow cast by the shadow-casting visual item than those in-shadow visual items that have a higher virtual display level. This allows the shadows to have a more natural look. | 06-10-2010 |
20100146431 | OBJECT PICKER WITH WINDOW SPLITTER - An application work area that includes a splitting mechanism that permits the work area to be divided into multiple windows. Each window is capable of displaying a selected object of the available objects that are open in the application. Each window might include a corresponding distinct object selection mechanism that allows a user to select one of the open objects to display in the corresponding window. In one embodiment, this is permitted regardless of whether that open object is already displayed in another of the windows. As examples, the object selection mechanism may be a selectively viewable open object list such as, for example, a drop down list. Thus, each window that has an object selection mechanism may be used to independently control the object that is viewed in that window. | 06-10-2010 |
Christopher W. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090319495 | PRESENTING INSTANT ANSWERS TO INTERNET QUERIES - Methods are described for utilizing user-submitted data to provide a response to a query request. User-submitted data are received and referenced upon receiving a query request from an unregistered requester, a potential response is automatically identified from the user-submitted data, the potential response is extracted, and presented in response to the query request. | 12-24-2009 |
20120130984 | DYNAMIC QUERY MASTER AGENT FOR QUERY EXECUTION - A preliminary segment root and a final segment root are selected for each segment. Each time a search query is received, a set of nodes in each segment that will be used to resolve the search query is identified. A preliminary segment root is selected from the set of nodes. Based on statistical data from each node in the set of nodes indicating each node's capability to act as a final segment root that assembles query-execution data, the preliminary segment root algorithmically selects the final segment root. The other nodes in the set of nodes are notified regarding the identity of the final segment root. | 05-24-2012 |
Christopher Walter Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090327256 | GRAMMAR COMPRESSION - Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes. | 12-31-2009 |
20090327269 | PATTERN GENERATION - Generation of patterns used to facilitate search queries is provided herein. A pattern includes a sequence of token classes and new token classes. A sample query is parsed to identify tokens within the sample query that match a token associated with a referenced set of token classes. New token classes are generated for unidentified tokens within the sample query. A pattern is generated by substituting the identified tokens of the sample query with corresponding token classes and substituting the unidentified tokens of the sample query with corresponding new token classes. | 12-31-2009 |
20110313993 | GRAMMAR COMPRESSION - Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars include a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes. | 12-22-2011 |
Chritopher L. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20100088495 | MODE-SPECIFIC CONTAINER RUNTIME ATTACHMENT - The operation of a multi-mode application. The multi-mode application has a number of mode-specific logical containers of components. Each mode-specific container contains components that assist the multi-mode application in operating in a corresponding mode. If the application transitions to another mode, the component(s) of the other corresponding mode-specific logical container is used to assist in operating in the other mode. The logical containers may be activated and deactivated during execution time as the application transitions from mode to mode. | 04-08-2010 |
Corby Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20100324910 | TECHNIQUES TO PROVIDE A STANDARD INTERFACE TO A SPEECH RECOGNITION PLATFORM - Techniques and systems to provide speech recognition services over a network using a standard interface are described. In an embodiment, a technique includes accepting a speech recognition request that includes at least audio input, via an application program interface (API). The speech recognition request may also include additional parameters. The technique further includes performing speech recognition on the audio according to the request and any specified parameters; and returning a speech recognition result as a hypertext protocol (HTTP) response. Other embodiments are described and claimed. | 12-23-2010 |
James R. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090105633 | ULTRASOUND ASSEMBLY FOR USE WITH LIGHT ACTIVATED DRUGS - A kit and method for causing tissue death within a tissue site is disclosed. The kit includes a media with a light activated drug activatable upon exposure to a particular level of ultrasound energy. The kit also includes an ultrasound transducer that is configured to transmit the level of ultrasound energy which activates the light activated drug with sufficient power that the ultrasound energy can penetrate the tissue site. The method includes providing the media comprising a light activated drug, delivering the media systematically into a patient's body, providing sufficient time for the light activated drug to localize within the tissue site, and directing ultrasound energy to the light activated drug within the tissue site to thereby activate the light activated drug. | 04-23-2009 |
Joseph W. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20140199504 | SYSTEM AND METHODS FOR CREATING WRAPPED FILAMENT REINFORCED VESSELS, AND VESSELS CREATED THEREBY - A manufacturing apparatus for producing filament-wound products such as pressure vessels and pipes includes a mandrel for supporting a pre-form vessel, a mandrel driver structured to rotate the pre-form vessel, and an array of individual filament supports for guiding individual filaments used in producing the vessel. Using the unique aspects of the apparatus which avoids the customary high-angle fiber crossings significantly speeds up manufacturing and thus lowers product cost, increases product lifetime, reduces fatigue stress, and reduces weight of the finished product. Methods of production are also disclosed. | 07-17-2014 |
Noel Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20160073352 | Wireless Radios Managed Based On Proximity - In embodiments of wireless radios managed based on proximity, a mobile device, such as a mobile phone, tablet computer, or other portable device can be implemented for multiple, different wireless communications. A mobile device can include a first radio system for a first wireless communications technology, and a second radio system for a second wireless communications technology. A connection manager determines, based on the first wireless communications technology, whether the mobile device is in an area that is proximate an endpoint implemented for the second wireless communications technology. The connection manager can turn-on the second radio system to enable wireless communication with the endpoint when the mobile device is in the area proximate the endpoint. Alternatively, the connection manager can turn-off the second radio system and conserve power that would otherwise be utilized to scan for the endpoint when the mobile device is not in the area proximate the endpoint. | 03-10-2016 |
Rebecca L. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20110093597 | Method and System for Supporting Off-Line Mode of Operation and Synchronization - Systems and methods for synchronizing multiple copies of data in a network environment that includes servers and clients so that incremental changes made to one copy of the data can be identified, transferred, and incorporated into all other copies of the data. The synchronization can be accomplished regardless of whether modifications to the data have been made by a client while the client is in an on-line or off-line mode of operation. The clients cache data locally as data are modified and downloaded. The caching enables the clients to access the data and allows the synchronization to be performed without transmitting a particular version more than once between a client and a server. Such elimination of redundant data transmission results in an efficient use of time and network bandwidth. | 04-21-2011 |
20140250064 | METHOD AND SYSTEM FOR SUPPORTING OFF-LINE MODE OF OPERATION AND SYNCHRONIZATION - Systems and methods for synchronizing multiple copies of data in a network environment that includes servers and clients so that incremental changes made to one copy of the data can be identified, transferred, and incorporated into all other copies of the data. The synchronization can be accomplished regardless of whether modifications to the data have been made by a client while the client is in an on-line or off-line mode of operation. The clients cache data locally as data are modified and downloaded. The caching enables the clients to access the data and allows the synchronization to be performed without transmitting a particular version more than once between a client and a server. Such elimination of redundant data transmission results in an efficient use of time and network bandwidth. | 09-04-2014 |
William L. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20080291023 | RFID Discovery, Tracking, and Provisioning of Information Technology Assets - Techniques for discovery, tracking, and provisioning of information technology (IT) assets are described. In one implementation, a detection region for radio frequency identifier (RFID) signals is monitored, and any RFID signals associated with IT assets within the detection region are sensed. A detected RFID signal is analyzed to obtain identifying information regarding the IT asset. The identifying information is formatted into an event record, and the event record is stored in a memory. In alternate embodiments, the event record may be further analyzed to determine whether the IT asset complies with a policy specification associated with the IT asset, and a notification of noncompliance may be issued if the IT asset does not comply with the policy specification. | 11-27-2008 |
Zachary L. Anderson, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090300646 | ADAPTING BETWEEN COUPLED AND DECOUPLED PROVIDER INTERFACES - Adapters are provided to convert a decoupled provider interface to a coupled provider interface and/or to convert a coupled provider interface to a decoupled provider interface. A decoupled provider may indirectly expose a data model by providing one or more of a sequence of unchanging views of data via snapshots and snapshot update events. A coupled provider may directly expose a dynamic data model or view and model update events. A decoupled consumer of data may consume data that is provided in snapshots and snapshot update events while a coupled consumer may consume data in the form of a dynamic data model and model update events. | 12-03-2009 |