53rd week of 2009 patent applcation highlights part 79 |
Patent application number | Title | Published |
20090327981 | Semiconductor device or printed wiring board design method and design support system that implements settings by using a semiconductor device model that expresses parasitic elements that occur when packaged - Correction circuit models are acquired for correcting electrical characteristic parameters that change upon mounting on a board. The correction circuit models are added to a separate model that represents a separate semiconductor device in isolation to create a semiconductor device model that represents the semiconductor device in a board-mounted state. An equivalent circuit model that represents an adjustment-object system is connected to the semiconductor device model that was created, and based on the semiconductor device model to which the equivalent circuit model is connected, adjustment-object values relating to the adjustment-object system are calculated. These adjustment-object values are compared with limit values that were determined in advance, and based on the results of comparison, a design guide is determined for adjusting the adjustment-object system. | 2009-12-31 |
20090327982 | Method of verifying layout data for semiconductor device - A data verification method executed by a data verification device that verifies hierarchical structure layout data for a semiconductor device. The method includes retrieving a verification condition that is set in accordance with a data processing system which processes the layout data generated by and provided from a designing device, extracting shaped item existing range information and possessive layout information from the layout data to generate a hierarchical expansion table, cumulating the possessive layout information associated with each cell from an uppermost layer cell of a layout path to a target cell, calculating a cumulative value of the possessive layout information for the layout path, determining whether or not the possessive layout information satisfies the verification condition based on the cumulative value, the verification condition, and the possessive layout information, and determining whether or not the shaped item existing range information satisfies the verification condition. | 2009-12-31 |
20090327983 | Predictive Modeling of Interconnect Modules for Advanced On-Chip Interconnect Technology - A computer program product estimates performance of an interconnect structure of a semiconductor integrated circuit (IC). The program product includes code executing on a computer to calculate at least one electrical characteristic of the interconnect structure based on input data accounting for multiple layers of the interconnect structure. The electrical characteristics can be capacitance, resistance, and/or inductance. The capacitance may be based upon multiple components, including a fringe capacitance component, a terminal capacitance component, and a coupling capacitance component. | 2009-12-31 |
20090327984 | Method For Determining The Quality Of A Quantity Of Properties, To Be Employed For Verifying And Specifying Circuits - A method is specified for determining the quality of a quantity of properties describing a machine, including a step for determining the existence of at least one sub-quantity of interrelated properties (P | 2009-12-31 |
20090327985 | HIGHLY THREADED STATIC TIMER - Various methods and apparatus for executing a multithreaded algorithm that performs a static timing analysis of an integrated circuit chip (chip) include logic for traversing the chip to identify a plurality of components (cells or nodes) within a chip circuit of the chip. A waveform graph is defined for the identified nodes. One or more virtual graphs are generated from the waveform graph. The plurality of nodes in the one or more virtual graphs are processed using multiple threads to obtain quadruplet of time domain dataset values representing the different modes of propagation for each node. A timing check is performed at an end node of the virtual graphs using the quadruplet of time domain dataset values to determine any timing violation within the chip design. | 2009-12-31 |
20090327986 | GENERATING RESPONSES TO PATTERNS STIMULATING AN ELECTRONIC CIRCUIT WITH TIMING EXCEPTION PATHS - Improved responses can be generated to scan patterns (e.g., test patterns) for an electronic circuit designs having timing exception paths by more accurately determining the unknown values that propagate to observation points in the circuit, where the response is captured. For instance, the responses are determined more accurately by analyzing the effect of sensitizing a timing exception path during each time frame associated with a scan pattern. Path sensitization can be determined based on observing whether values injected at starting points of the timing exception paths due to signal transitions and glitches propagate to their end points. The response can be updated by masking the affected end points and propagating unknown values further in the circuit to determine whether they are captured at observation points of the circuit. For instance, the methods and systems described herein may result in reduced unknowns, improved test coverage and test compression. | 2009-12-31 |
20090327987 | Timing operations in an IC with configurable circuits - Some embodiments provide a method that identifies a first physical design solution for positioning several configurable operations on several reconfigurable circuits of an integrated circuit (IC). The method identifies a second physical design solution for positioning the configurable operations on the configurable circuits. One of the identified physical design solutions has one reconfigurable circuit perform a particular configurable operation in at least two reconfiguration cycles while the other identified solution does not have one reconfigurable circuit perform the particular configurable operation in two reconfiguration cycles. The method costs the first and second physical design solutions. The method selects one of the two physical design solutions based on the costs. | 2009-12-31 |
20090327988 | METHODS, SYSTEMS AND COMPUTER PROGRAM PRODUCTS FOR LAYOUT DEVICE MATCHING DRIVEN BY A SCHEMATIC EDITOR - Systems and computer program products for layout device matching driven by a schematic editor. Exemplary embodiments include identifying a master device in a circuit layout having at least transistors, the master device having property values including at least one of topology, name and device-type, identifying a cloned device linked to the master device, automatically propagating the property values to the cloned device, making changes to a design layout of the master device, including a change to the properties, and automatically propagating the changes to the design layout and the change to the properties of the master device to the cloned device. | 2009-12-31 |
20090327989 | Statistical Interconnect Corner Extraction - Various implementations of the invention provide methods and apparatuses that consider various inter/intra-die variations. In various implementations, a statistical parameter dimension reduction using linear reduced rank regression (RRR) is applied to dramatically reduce the high-dimensional variation sources while accurately capturing their impact on the resultant performance corners. With various implementations of the invention, an application specific corner finding algorithm is employed, the algorithm comprising timing metrics and an iterative output clustering operation. | 2009-12-31 |
20090327990 | Integrated Circuit Routing and Compaction - An iterative technique is used to automatically route nets and alter spacing of an integrated circuit design to achieve a fully routed and compact result. After identifying cells rows and channel, which are gaps between the rows, the technique determines which nets should be routed in which areas. Spine routing is used for nets than span more than one row or channel. Alter the space between rows, larger or smaller, which will allow routing of the nets. | 2009-12-31 |
20090327991 | INDUSTRY TEMPLATE CUSTOMIZATION AND TRANSCLUSION FOR USE IN INDUSTRIAL AUTOMATION AND INFORMATION SOLUTIONS - The invention relates to a system and/or methodology for the customization and transclusion of design templates/patterns for use in industrial automation. The system provides for the de-abstraction of one or more design templates, and generating engineering specifications via customization of the de-abstracted design templates. Additionally, the invention provides a user interface for modification of the template de-abstraction and/or customization process. | 2009-12-31 |
20090327992 | INDUSTRY TEMPLATE ABSTRACTING AND CREATION FOR USE IN INDUSTRIAL AUTOMATION AND INFORMATION SOLUTIONS - The invention relates to a system and/or methodology for the abstraction and creation of templates for use in industrial automation. The system providing for the abstraction of one or more engineering specifications, and creation of design templates based at least in part on the abstracted design templates. Additionally, the invention provides a user interface for modification of the template creation process and/or templates. | 2009-12-31 |
20090327993 | Extension Model for Improved Parsing and Describing Protocols - Described is a technology by which an engine parses data based upon modules arranged in a tree-like model structure. Only those modules that meet a condition with respect to the data are invoked for processing the data. Each child module specifies a parent module and specifies a condition for when the parent is to invoke the child module. As a module processes the data, if a child module's specified condition is met, it invokes the corresponding child module, (which in turn may invoke a lower child if its condition is met, and so on). When the data corresponds to protocols, the model facilitates protocol layering. A top level parent may represent one protocol (e.g., TCP), a child beneath may represent a lower-layer protocol (e.g., HTTP), whose children may handle certain types of HTTP commands, or correspond to a signature that the child module is programmed to detect. | 2009-12-31 |
20090327994 | METADATA DRIVEN API DEVELOPMENT - The described method and system synchronizes source code with byproducts or artifacts of an application creation process. In one embodiment, a generation tool may be used to produce source code header files based on a design specification, where the source code header files are compiled with a current version of source code. Compilation errors may direct a developer to modify either the specification or the source code to eliminate the errors. The described method and system may be integrated into a development platform that is adapted to direct the user to perform particular revisions or updates to bring the source code in line with the artifacts. | 2009-12-31 |
20090327995 | ANNOTATION-AIDED CODE GENERATION IN LIBRARY-BASED REPLAY - Techniques for automatically generating replay-enabling code in a library based replay system. The technique requires a code template programmed by an operating system developer. Then, utilizing an application programming interface (API) annotation, either standard or user-defined, customized replay-enabled code is automatically generated for every specific API. | 2009-12-31 |
20090327996 | Framework for Programming Embedded System Applications - The disclosure describes a method for programming applications for embedded systems such as sensor nodes. In an embodiment, this comprises writing embedded system applications in a high-level language such as C# or Java using a software development framework which includes a set of tools and class libraries. The class libraries contain pre-written code to carry out tasks which may be required of an embedded system. The class libraries may be extended following identification of a need for a particular function in an embedded system. Developed applications may be subsequently stored on the embedded system but executed on a gateway computing device which interacts with the embedded system. This means that the application(s) can be executed without requiring the presence of a virtual execution system located on the embedded system while allowing a high-level programming model for application programmers. | 2009-12-31 |
20090327997 | Timing Analysis of Concurrent Programs - Described are various techniques by which a concurrent program is analyzed with respect to timing. In one aspect, code fragments in a concurrent program are modified and/or instrumented by inserting iteration counters inside loops. Examples of modified fragments include those corresponding to concurrently executing code fragments, non-blocking concurrent code fragments, blocking concurrent code fragments, fragments having a loop that may not terminate, fragments having interlocked operation, or fragments having a timeout. Such fragments are modified and/or flagged so as to provide the summary data. When statically analyzed, the instrumented code provides complexity information regarding each fragment, or combinations of fragments, such as concurrent fragments. Summary data regarding the concurrent program is provided by processing the complexity information into at least one computation graph. | 2009-12-31 |
20090327998 | CONSTRAINED APPLIANCE DEVELOPMENT TOOLKIT - An appliance development toolkit is provided to enable creation of content to affect operation of a component in an appliance or to affect user interaction with an appliance. The toolkit includes an editor to create effective data related to the functioning of one or more components of an appliance. The editor is informed by no more than a portion of information related to the component or components. The toolkit also has an interactive user interface on which the editor is displayed for use by a developer, and a converter to generate content using the effective data. The portion of information is less than all information related to the component or components, and no more than the portion is available to the editor, so that the developer's capacity to create content using the toolkit is constrained by the available portion of information. | 2009-12-31 |
20090327999 | IMMUTABLE TYPES IN IMPERITIVE LANGUAGE - An imperative framework having a more than one type is defined. At least one of the types is an immutable type, and the immutable type has at least one immutable field. | 2009-12-31 |
20090328000 | SYSTEM, APPARATUS AND METHOD FOR PROGRAMMING A COMPUTING DEVICE - Methods and apparatus for developing software for a computing device are provided. One method includes accessing input received from an input peripheral, accessing a definition file defining a plurality of tools for code development, providing a development assistance tool on an output peripheral based on conditions and instructions in the definition file that match the input. Another method includes receiving an engine definition file corresponding to a development assistance engine incorporated into the IDE, editing the engine definition file to include programming tools that correspond with the a computer language that is native to the computing device, and saving the edited engine define file for subsequent use by the IDE. | 2009-12-31 |
20090328001 | UNLOADABLE MANAGED CODE - The claimed subject matter provides a system and/or a method that facilitates generating unloadable managed code. A set of static subroutines included in a library or an assembly can be converted into dynamic subroutines created at runtime of an application. A reflection component can extract information regarding a static subroutine to produce a full description of structure and data of the subroutine. A dynamic method component can create a dynamic subroutine based upon the full description such that the dynamic subroutine provides substantially equivalent functionality to the static subroutine. In addition, resources allocated to the dynamic subroutine can be reclaimed to prevent waste and/or application bloat. | 2009-12-31 |
20090328002 | Analysis and Detection of Responsiveness Bugs - Described techniques increase runtime performance of software running in user space by analyzing and detecting soft hang program errors and giving suggestions for cures. This disclosure pertains to techniques for the analysis, detection, and cure of soft hang program errors. | 2009-12-31 |
20090328003 | Systems And Methods For Regulating Execution Of Computer Software - A method for regulating execution of an application program includes a process for preparing the application and a process for executing the application. The preparation process divides the application program into related segments and encrypts instructions of at least one segment. The preparation process positions encrypted instructions in at least two discontiguous regions within an executable file and associates header information with at least one discontiguous region. The header identifies a decryption key and the location of the other discontiguous region. The resulting execution file thus has portions that would not execute and would cause an operating system to call a responsive process. The execution process initiates execution of the protected application when at least a portion of the application instructions are available to the computer only in encrypted form. The user is authenticated, after which the encrypted portions can be decrypted and execution resumed. The processes may also include capability to detect and respond to tampering, or the ability to block execution snooping via a debugger. Also provided are systems and methods to allow debugging of code extensions to protected applications without sacrificing protection of the application. A Secure Debugger allows extension developers to examine memory and set breakpoints in their own extensions, without permitting them to view information in the rest of the protected application. | 2009-12-31 |
20090328004 | METHOD TO COLLABORATIVELY RESOLVE JAVA PROGRAM ERRORS WITHIN AN INTEGRATED DEVELOPMENT ENVIRONMENT - The present disclosure is directed to a method to collaboratively resolve a Java program error. The context of the access is uniquely identified based on two parameters—the error and the specific library where the error occurred. The developer uses the same interface to contribute to discussions irrespective of the error or the library. The method automatically determines the forum for the discussion. Finally, the method is able to notify the developer when the error is resolved so that the developer can contribute resolution information back to the discussion. | 2009-12-31 |
20090328005 | DEBUGGER CALL STACK CACHING - A debugger backend computes and stores a previous call stack of multiple threads of a debuggee process based on previous call stack information provided from a debugging agent. The debugger backend stores a first hash of threads of the debuggee process and stack memory of the previous call stack. The debugger backend sends the first hash to the debugging agent in response to a request of the current call stack from a debugger user interface (UI), and provides the previous call stack to the debugger UI in response to the debugging agent indicating that that first hash matches a second hash of thread registers of the debuggee process and stack memory of the current call stack. | 2009-12-31 |
20090328006 | INSTRUCTION-TRACE GENERATION PROGRAM, INSTRUCTION-TRACE GENERATING DEVICE, AND INSTRUCTION-TRACE GENERATING METHOD - An instruction-trace generating device generates an instruction trace of a first instruction string from a second instruction string obtained by sampling, at predetermined intervals, the first instruction string executed a plurality of times. The device includes a dividing unit dividing the second instruction string into partial instruction strings and causes the divided partial instruction strings to be stored in a storage unit; a similarity calculating unit calculating a similarity for each combination of all of the stored partial instruction strings; a selecting unit selecting one of the combinations of the partial instruction strings based on the similarity; a combination-pattern generating unit generating a plurality of combination patterns by combining instructions included in the selected partial instruction strings; a likelihood calculating unit calculating a likelihood for each of the combination patterns; and a partial-instruction-string replacing unit causing the combination patterns to be stored in the storage unit based on the likelihood. | 2009-12-31 |
20090328007 | MEMORY LEAK DIAGNOSIS - A method and an apparatus for diagnosing memory leak. The method includes: tracing the allocation of objects; recording allocation paths and allocation time of each object; giving to each object one unique identifier (ID) corresponding to an allocation path; determining the allocation path to which each object belongs; organizing the objects which are allocated but still not collected, and counting the age generations of the objects of the similar type according to the allocation time of each object; ranking the allocation paths according to the age generations of the surviving objects; and analyzing the ranking of the allocation paths, in which the allocation path with higher rank is more probable to introduce memory leaks. Thus, the suspicious allocation path possibly incurring memory leaks is selected and reported to the user for analysis. | 2009-12-31 |
20090328008 | DYNAMICALLY MONITORING APPLICATION BEHAVIOR - A dynamic verification system is described that enables application developers to safely include significant custom business logic in their applications. The dynamic verification system receives application behavior criteria that specify behavior of an application of interest to an application host. The system executes an application and instruments an application execution environment to detect application behavior that meets the application behavior criteria. The system determines when the application has performed an action that satisfies the application behavior criteria and provides a notification about the application behavior that occurred that a system administrator can use to take action against the application. | 2009-12-31 |
20090328009 | METHOD AND SYSTEM FOR FAST STATIC TAINT ANALYSIS - A method for detecting user input dependence in software code. The method including representing the software code with a reachability graph having: a plurality of nodes, where a root node of the plurality of nodes represents an input controlled by a user; a first directed edge connecting a first node of the plurality of nodes and a second node of the plurality of nodes, where the first directed edge represents a data dependency; and a second directed edge connecting a third node of the plurality of nodes and a fourth node of the plurality of nodes, wherein the second directed edge represents a data dependency. The method also includes identifying a fifth node of the plurality of nodes as a reachable node from the root node by traversing the reachability graph from the root node to the reachable node; and marking a portion of the software code represented by the reachable node as user input dependant. | 2009-12-31 |
20090328010 | SYSTEM AND METHOD FOR PLATFORM-INDEPENDENT, SCRIPT-BASED APPLICATION GENERATION FOR SPREADSHEET SOFTWARE - A script-based application generation for spreadsheet software reads from one or more spreadsheets rendered by a spreadsheet program, description written in said text-based language, the text-based language for describing user interfaces, data models and/or workflow models or combinations thereof The text-based language is independent of the spreadsheet program. The description is parsed and from the description one or more user interfaces, data model or workflow model or combinations thereof are generated in the spreadsheet program. | 2009-12-31 |
20090328011 | SAFE CODE FOR SIGNATURE UPDATES IN AN INTRUSION PREVENTION SYSTEM - Described is a technology by which a signature used by network traffic intrusion prevention/detection systems includes logic that helps a prevention/detection engine detect that signature. A signature to detect is compiled into executable logic that is executed to communicate with an engine that evaluates network traffic. The signature logic provides an expression set (such as group of regular expressions) for the engine to match against a token corresponding to the network traffic. When matched, the engine notifies the logic and receives a further expression set to match, or a communication indicative that that the signature was detected. The signature thus directs the analysis, facilitating a lightweight, generic engine. Safety of the signature logic is described as being accomplished through layers, including by publisher signing, and by compilation and execution (e.g., interpretation) in safe environments. | 2009-12-31 |
20090328012 | COMPILER IN A MANAGED APPLICATION CONTEXT - A batch compiler is employed to enable compilation of code provided at runtime. A managed application receives code during execution and invokes the compiler to transform the code to enable it to execute within the context of the receiving application. Among other things, employment of a batch compiler preserves investments made to such compilers while also opening up new scenarios in application scripting and/or hosting that are otherwise unavailable. | 2009-12-31 |
20090328013 | COMPONENTIZATION OF COMPILER FUNCTIONALITY - Compiler functionality is componentized to enable use across different contexts. Conventionally tightly coupled functionality is decoupled and an interface afforded to facilitate interaction with compiler components/subcomponents in various scenarios. In one instance, compiler components can be employed across compile time and runtime. Compile time functionality can be employed at runtime and runtime functionality utilized at compile time thereby blurring the line between time dimensions. | 2009-12-31 |
20090328014 | COMPILER BASED CODE MODIFICATION FOR USE IN DOCUMENT RANKING - The subject matter disclosed herein relates to alter an expression of executable instructions via a compiler component for use in ranking of electronic documents. | 2009-12-31 |
20090328015 | Matching Based Pattern Inference for SMT Solvers - A method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms. The method involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers. The method uses a database for fault detection in externally supplied pattern annotated formulas. The method also uses matching code trees to mixed second-order pattern matching. | 2009-12-31 |
20090328016 | GENERALIZED EXPRESSION TREES - Expression tree versatility and applicability are enhanced to facilitate programming across various program languages and execution contexts. An expression tree can represent programmatic code as data in a representation common to multiple process mechanisms. As a result, entire programs or portions thereof can be captured and processed by a numerous common language components. Further, language specific concepts can be reduced to the common representation to enable language independent employment. | 2009-12-31 |
20090328017 | RAPID APPLICATION DEVELOPMENT - A system to enables Rapid Application Development (“RAD”) is provided. The system provides an object model of an ERP application, which enables software developers to customize the ERP applications. The object model provides a base class that is inherited by each object class. The base class provides an invoke function that is implemented by each object class. During compilation, the RAD system compiles each invocation of a function of an object into a call to a dynamic component passing an identifier of the object, an identifier of the function to be invoked, and the parameters to be passed to the function. The RAD system dynamically compiles, assembles, and instantiates object classes as needed. Because objects are bound at runtime, rather than at compile time, when the source code of an object is modified, the entire ERP application does not need to be recompiled into monolithic IL code and the compilation of object classes is deferred until an object of that class is needed during runtime. The object model thus significantly decreases the time required to customize and extend an ERP application according to the needs of an individual customer. | 2009-12-31 |
20090328018 | OPTIMIZING PRIMITIVES IN SOFTWARE TRANSACTIONAL MEMORY - A compiler is provided that determines when the use of software transactional memory (STM) primitives may be optimized with respect to a set of collectively dominating STM primitives. The compiler analysis coordinates the use of variables containing possible shadow copy pointers to allow the analysis to be performed for both direct write and buffered write STM systems. The coordination of the variables containing the possible shadow copy pointers ensures that the results of STM primitives are properly reused. The compiler analysis identifies memory accesses where STM primitives may be eliminated, combined, or substituted for lower overhead STM primitives. | 2009-12-31 |
20090328019 | DETECTING RACE CONDITIONS WITH A SOFTWARE TRANSACTIONAL MEMORY SYSTEM - A dynamic race detection system is provided that detects race conditions in code that executes concurrently in a computer system. The dynamic race detection system uses a modified software transactional memory (STM) system to detect race conditions. A compiler converts portions of the code that are not configured to operate with the STM system into pseudo STM code that operates with the STM system. The dynamic race detection system detects race conditions in response to either a pseudo STM transaction in the pseudo STM code failing to validate when executed or an actual STM transaction failing to validate when executed because of conflict with a concurrent pseudo STM transaction. | 2009-12-31 |
20090328020 | INTERFACE OPTIMIZATION IN A CLOSED SYSTEM - Interface optimization is provided using a closed system in which all the individual software components in the system are known to the compiler at a single point in time. This knowledge enables significant opportunities to optimize the implementation of interfaces on a set of implemented objects. When code is compiled, because the compiler knows the full list of interfaces and the objects which implement the interfaces, it can improve execution and working set (i.e., recently referenced pages in a program's virtual address space) when implementing the interfaces on objects. This improvement may be realized by reducing the size of interface lookup tables which map each interface to the object types which implement that particular interface. | 2009-12-31 |
20090328021 | Multiversioning if statement merging and loop fusion - In one embodiment of the invention, a method for fusing a first loop nested in a first IF statement with a second loop nested in a second IF statement without the use of modified and referenced (mod-ref) information to determine if certain conditional statements in the IF statements retain variable values. | 2009-12-31 |
20090328022 | SYSTEMS AND METHODS FOR MAINTAINING CRTM CODE - Systems, methods and media for updating CRTM code in a computing machine are disclosed. In one embodiment, the CRTM code initially resides in ROM and updated CRTM is stored in a staging area of the ROM. A logical partition of L2 cache may be created to store a heap and a stack and a data store. The data store holds updated CRTM code copied to the L2 cache. When a computing system is started, it first executes CRTM code. The CRTM code checks the staging area of the ROM to determine if there is updated CRTM code. If so, then CRTM code is copied into the L2 cache to be executed from there. The CRTM code loads the updated code into the cache and verifies its signature. The CRTM code then copies the updated code into the cache where the current CRTM code is located. | 2009-12-31 |
20090328023 | IMPLEMENTING OPTIMIZED INSTALLS AROUND PRE-INSTALL AND POST-INSTALL ACTIONS - A method, apparatus and computer program product are provided for implementing enhanced install performance of a computer system. A user request for an update to be installed is identified. The update to be installed is described by metadata. An installer is provided for installing one or multiple updates. Predefined information for each update to be installed, including any pre-installation operation and post-installation operation required by each update, is processed to provide enhanced install performance. | 2009-12-31 |
20090328024 | INSTALL-UNIT UPGRADE USING DYNAMIC CONFIGURATION DATA MANIPULATION AND MERGING - A system and method for efficient upgrading of computing system software. A computing system includes clients and one or more servers coupled to a network. Cluster server software allows the clients and server(s) to work together as a cluster. This software is platform- and version-specific depending on the customer. Each customer has a customized configuration with customer-dependent edits performed on the original configuration. When a new-release configuration is made available, the three configurations are translated to abstract object trees. A series of predetermined abstract operations are preformed on the abstract object trees in order to generate a target abstract object tree. The target abstract object tree is translated to a target file, wherein the target file includes the common portions between the original and new-release configurations and the merged upgrades of the customized and new-release configurations. | 2009-12-31 |
20090328025 | AUTOMATICALLY MANAGING VERSIONING OF MASHUP WIDGETS - A request for a mashup widget having multiple versions from an identifiable source can be identified. A data store can be queried to determine if a previous request for the mashup widget was made by the identifiable source. When the previous request exists, a version of the mashup widget used to handle the previous request can be automatically determined. The determined version can be one of many versions of the mashup widget. The determined version of the mashup widget can be used to generate a response to the request. When the previous request is not found when querying the data store, one of the mashup versions that is to be used can be determined based upon a programmatic rule. Historical data regarding widget version use can be saved in the data store and used to determine which widget version is to be selected to handle future requests. | 2009-12-31 |
20090328026 | UPDATE SYSTEM, PROGRAM EXECUTION DEVICE, AND COMPUTER PROGRAM - A version table ( | 2009-12-31 |
20090328027 | CLUSTER SYSTEM, PROCESS FOR UPDATING SOFTWARE, SERVICE PROVISION NODE, AND COMPUTER-READABLE MEDIUM STORING SERVICE PROVISION PROGRAM - In a cluster system: a heartbeat transmission unit in a service provision node transmits to a monitoring node a heartbeat packet which contains interval information indicating an interval greater than normal intervals at which normal heartbeat packets are transmitted, when an execution unit in the service provision node receives a stop command. Thereafter, when software realizing the execution unit is updated and the execution unit is restarted, the heartbeat transmission unit periodically transmits the normal heartbeat packets to the monitoring node at the normal intervals, where the normal heartbeat packets contain interval information indicating the normal intervals. A heartbeat monitoring unit in the monitoring node determines that the execution unit is in operation, while the monitoring node receives heartbeat packets at intervals indicated by the interval information stored in the monitoring node and updated with received interval information. | 2009-12-31 |
20090328028 | Electronic documents and methods for updating resource files for an application - In one aspect, an electronic document for updating resource files for an application comprises logical names used by the application for referring to resource files and parameters for specifying constraints for the resource files. In another aspect, the electronic document comprises an application identifier identifying an application to which the electronic document corresponds, and a universal resource identifier identifying a resource file for use with the application. | 2009-12-31 |
20090328029 | SOFTWARE PORTAL SYSTEM FOR PROVIDING RELATION INFORMATION OF SOFTWARE AND DATA FORMAT AND METHOD OF OPERATING THE SAME - A software portal system for providing relation information of software and a data format, and a method of operating the same are provided. To provide software by downloading or service simultaneously with relation information between software and software, software and a data format, and data formats, the software portal system includes a relation information management unit and a web service providing unit. The relation information system defines a relation of software and a data format to constitute and manage relation information of the software and the data format. The web service providing unit acquires and provides the relation information of the software managed by the relation information management unit when the software is provided by downloading or service, and acquires and provides the relation information of the data format managed by the relation information management unit when the relation information of the data format is inquired. Accordingly, a user can be provided with high quality of service. | 2009-12-31 |
20090328030 | INSTALLING A MANAGEMENT AGENT WITH A VIRTUAL MACHINE - A management service can install one or more third-party agents and any number of customizations for an operating system/virtual machine at the same as the system/machine is installed. In one implementation, a management service places (e.g., from a remote location) an operating system/virtual machine image in a mounting location. Before installing the corresponding system (OS or virtual machine), the management service also inserts one or more third-party agents into the image, as well as any number or type of policies and customizations. The management service then directs installation of the combined image (including rules, policies, and customizations) so that the operating system, third-party agents, and provided customizations, are all installed together during the same installation process. Accordingly, the management service allows for agents to reliably and immediately begin executing with installation of the operating system/virtual machine. | 2009-12-31 |
20090328031 | DYNAMIC XPS FILTER - A system and method enhances a default workflow path of a workflow system. The system provides access to policy rules and associated triggering conditions not available to the default workflow path of the workflow system. The configured rules are stored in a repository, and may be dynamically reconfigurable. Selected ones of the rules and triggering conditions are bound to at least one resource, such as a printer. An orchestrator is installed as a default workflow path, e.g., as an XPS filter, and is thus executed during default workflow path processing for a job submitted to the default workflow path. The orchestrator may then perform additional processing functions including accessing the configured policy rules and associated triggering conditions. A processing unit may be executed if the associated triggering condition is satisfied. | 2009-12-31 |
20090328032 | PROJECTING SOFTWARE AND DATA ONTO CLIENT - A software application written for a server environment is transformed into one which runs in a rich client environment. An entity model defines data sources as they are accessed from the server and as they are accessed from the clients. An application programming interface defines stereotyped interfaces which provide the same functionality on the server and the clients. A metadata model describes the components which make up the application and defines the differences in structure between the server and clients. The metadata model also defines mappings between components used on the server and clients. Settings and context information which tailor the activation and functionality of the components is also captured in the metadata model. Automated transformation is performed by using the mappings to identify the component set to use for the clients, selecting the client version of the application programming interfaces, and selecting the appropriate settings and context information. | 2009-12-31 |
20090328033 | SEAMLESS INTEGRATION OF MULTIPLE COMPUTING ENVIRONMENTS - A unification system for integrating multiple computing environments, which are available for simultaneous use by a single user, into a base environment includes a unification supervisor and a plurality of agents, where each agent is associated with a respective computing environment. The unification supervisor monitors information received from the agents regarding the multiple computing environments, and performs centralized direction of the computing environments in accordance with the received information. The centralized direction serves to incorporate the other computing environments into the base environment, and may be guided by policies designed to provide the user with a unified environment. The unification supervisor also issues instructions to the various agents. Each of the agents provides information regarding a respective computing environment to the unification supervisor, and may also manage the respective computing environment as directed by the unification supervisor. The base environment is typically the user's endpoint work environment. | 2009-12-31 |
20090328034 | ESTABLISHING A BI-DIRECTIONAL GRID COMPUTING NETWORK - A method of establishing a bi-directional grid computing network includes submitting a processing job from a job requester to a central repository, querying nodes associated with the job requester to process the processing job, identifying suitable nodes associated with the job requester to process the processing job, transmitting the processing job from the job requester to at least one of the suitable nodes associated with the job requester, processing the processing job on the at least one suitable node associated with the job requester, and returning results from processing the processing job to the job requester. | 2009-12-31 |
20090328035 | Lazy Handling of End of Interrupt Messages in a Virtualized Environment - Techniques enable reducing a number of intercepts performed by a hypervisor by reducing a number of End Of Interrupt (EOI) messages sent from a virtual central processing unit (CPU) to a virtual advanced programmable interrupt controller (APIC). The EOI path of the guest operating system running on the virtual CPU is altered to leave a marker indicating that the EOI has occurred. At some later time the hypervisor inspects the marker and lazily updates the virtual APIC state. | 2009-12-31 |
20090328036 | SELECTION OF VIRTUAL COMPUTING RESOURCES USING HARDWARE MODEL PRESENTATIONS - A user can configure and purchase virtual computing resources in much the same way buyers now configure and purchase physical computers. One embodiment allows a user to select various performance parameters that are commonly known and used by the average user of a personal computer. For example, a baseline computer system can be selected and then customized by choosing performance parameter such as a processor brand name, processor clock speed, random-access memory (RAM) capacity, hard disk drive capacity, etc. The performance parameters can then be used to configure virtual computing resources to achieve a virtual computer that substantially meets the performance parameters. | 2009-12-31 |
20090328037 | 3D GRAPHICS ACCELERATION IN REMOTE MULTI-USER ENVIRONMENT - Systems and methods for providing graphics acceleration to one or more terminal systems are disclosed. In one embodiment, a virtual machine session is created and one or more cores of a graphics accelerator with a plurality of cores is assigned to a virtual machine session in order to render a virtual desktop for display at a terminal system. | 2009-12-31 |
20090328038 | Computer System and Device Controlling Method for Computer System - According to one embodiment, a computer system configured such that a virtual machine including a guest operating system running on a source computer connected to a network migrates to a destination computer connected to the network, where the virtual machine then running on the destination computer wherein, the source computer comprises first hardware, a first backend driver running in a first hypervisor running on the first hardware, and configured to directly control the device in association with communication performed via a first interface, the virtual machine comprises a frontend driver configured to run in the guest operating system, and to control the device, the destination computer comprises second hardware, the second hypervisor running on the second hardware, and to manage the virtual machine, and a second backend driver configured to run in the second hypervisor and including a second interface which is the same as the first interface. | 2009-12-31 |
20090328039 | Deterministic Real Time Business Application Processing In A Service-Oriented Architecture - Methods, apparatus, and products for deterministic real time business application processing in a service-oriented architecture (‘SOA’), the SOA including SOA services, each SOA service carrying out a processing step of the business application where each SOA service is a real time process executable on a real time operating system of a generally programmable computer and deterministic real time business application processing according to embodiments of the present invention includes configuring the business application with real time processing information and executing the business application in the SOA in accordance with the real time processing information. | 2009-12-31 |
20090328040 | Determining Real Time Stateful Business Application Processing In An Otherwise Stateless Service-Oriented Architecture - Methods, apparatus, and products for deterministic real time stateful business application processing in an otherwise stateless service-oriented architecture (‘SOA’), the SOA including SOA services with each SOA service carrying out a processing step of the business application, each SOA service is a real time process executable on a real time operating system of a generally programmable computer and business application processing according to embodiments of the present invention includes: configuring each service of the SOA to record state information describing the state of the service upon completion of a processing step in the business application and provide the state information to a subsequent service, the state information including real time processing information; and executing the business application in the SOA in real time, including sending requests for data processing among the services, each such request comprising a specification of the state of the executing business application. | 2009-12-31 |
20090328041 | Shared User-Mode Locks - Technologies are described herein for implementing shared locks for controlling synchronized access to a shared resource. In one method, in a user mode of an operating system, a notification is received indicating that a first process begins execution. The first process is adapted to acquire the shared lock during execution of the first process. Upon receiving the notification, it is determined whether the first process terminates execution without releasing the shared lock. Upon determining that the first process terminates execution without releasing the shared lock, the shared lock is released for access by a second process. | 2009-12-31 |
20090328042 | DETECTION AND REPORTING OF VIRTUALIZATION MALWARE IN COMPUTER PROCESSOR ENVIRONMENTS - Methods and systems to detect virtualization of computer system resources, such as by malware, include methods and systems to evaluate information corresponding to a computer processor operating environment, outside of or secure from the operating environment, which may include one or more of a system management mode of operation and a management controller system. Information may include processor register values. Information may be obtained from within the operating environment, such as with a host application running within the operating environment. Information may be obtained outside of the operating environment, such as from a system state map. Information obtained from within the operating environment may be compared to corresponding information obtained outside of the operating environment. Direct memory address (DMA) translation information may be used to determine whether an operating environment is remapping DMA accesses. Page tables, interrupt tables, and segmentation tables may be used to reconstruct a view of linear memory corresponding to the operating environment, which may be scanned for malware or authorized code and data. | 2009-12-31 |
20090328043 | INFRASTRUCTURE OF DATA SUMMARIZATION INCLUDING LIGHT PROGRAMS AND HELPER STEPS - A method of summarizing data includes providing a multi-method summarization program including instructions for summarizing data for a transaction processing system. At least one functional aspect of the transaction processing system for which a summarization of a subset of the data is desired is determined. The functional subset to a user as a light summarization program is exposed. The dependencies of the functional subset can be enforced at runtime allowing packaging flexibility. A method for efficient parallel processing involving not necessarily filled requests for help. | 2009-12-31 |
20090328044 | Transfer of Event Logs for Replication of Executing Programs - A mechanism for replicating programs executing on a computer system having a first storage means is provided. The mechanism identifies the events corresponding to requests from one executing program, which may be different from the executing program to be replicated, which are non-deterministic and identifies the ‘Non Abortable Events’ (NAE's), which change irremediably the state of the external world that need to be reproduced in the replay of the programs. These events are immediately transferred for replay and the executing program is blocked until the transfer is acknowledged. For the other non-deterministic events, they are logged and sent to the executing program, the executing programs remaining blocked only if the log is full and/or if a timer between two NAEs expires, in this case a log transfer to the standby machine is performed to prepare replication before unblocking of the executing program. | 2009-12-31 |
20090328045 | TECHNIQUE FOR FINDING RELAXED MEMORY MODEL VULNERABILITIES - A system and method capable of finding relaxed memory-model vulnerabilities in a computer program caused by running on a machine having a relaxed memory model. A relaxed memory model vulnerability in a computer program includes the presence of program executions that are not sequentially consistent. In one embodiment, non-sequentially consistent executions are detected by exploring sequentially consistent executions. | 2009-12-31 |
20090328046 | METHOD FOR STAGE-BASED COST ANALYSIS FOR TASK SCHEDULING - One embodiment may estimate the processing time of tasks requested by an application by maintaining a state-model for the application. The state model may include states that represent the tasks requested by the application, with each state including the average run-time of each task. In another embodiment, a state model may estimate which task is likely to be requested for processing after the current task is completed by providing edges in the state model connecting the states. Each edge in the state model may track the number of times the application transitions from one task to the next. Over time, data may be gathered representing the percentage of time that each edge is from a state node. Given this information, the scheduler may estimate the CPU cost of the next task based on the current state, the most likely transition, and the cost of the predicted next task. The state model may also track multiple users of the application and modify or create the state model as the users traverse through the state model. | 2009-12-31 |
20090328047 | DEVICE, SYSTEM, AND METHOD OF EXECUTING MULTITHREADED APPLICATIONS - Device, system, and method of executing multithreaded applications. Some embodiments include a task scheduler to receive application information related to one or more parameters of at least one multithreaded application to be executed by a multi-core processor including a plurality of cores and, based on the application information and based on architecture information related to an arrangement of the plurality of cores, to assign one or more tasks of the multithreaded application to one or more cores of the plurality of cores. Other embodiments are described and claimed. | 2009-12-31 |
20090328048 | Distributed Processing Architecture With Scalable Processing Layers - The present invention is a system on chip architecture having scalable, distributed processing and memory capabilities through a plurality of processing layers. In a preferred embodiment, a distributed processing layer processor comprises a plurality of processing layers, a processing layer controller, and a central direct memory access controller. The processing layer controller manages the scheduling of tasks and distribution of processing tasks to each processing layer. Within each processing layer, a plurality of pipelined processing units (PUs), specially designed for conducting a defined set of processing tasks, are in communication with a plurality of program memories and data memories. One application of the present invention is in a media gateway that is designed to enable the communication of media across circuit switched and packet switched networks. The hardware system architecture of the said novel gateway is comprised of a plurality of DPLPs, referred to as Media Engines that are interconnected with a Host Processor or Packet Engine, which, in turn, is in communication with interfaces to networks. Each of the PUs within the processing layers of the Media Engines are specially designed to perform a class of media processing specific tasks, such as line echo cancellation, encoding or decoding data, or tone signaling. | 2009-12-31 |
20090328049 | INFORMATION PROCESSING APPARATUS, GRANULARITY ADJUSTMENT METHOD AND PROGRAM - According to one embodiment, an information processing apparatus includes a plurality of execution modules and a scheduler which controls assignment of a plurality of basic modules to the plurality of execution modules. The scheduler includes assigning, when an available execution module which is not assigned any basic modules exists, a basic module which stands by for completion of execution of other basic module to the available execution module, measuring an execution time of processing of the basic module itself, measuring execution time of processing for assigning the basic module to the execution module, and performing granularity adjustment by linking two or more basic modules to be successively executed according to the restriction of a execution sequence so as to be assigned as one set to the execution module and redividing the linked two or more basic modules, based on the two execution measured execution times. | 2009-12-31 |
20090328050 | AUTOMATIC LOAD BALANCING, SUCH AS FOR HOSTED APPLICATIONS - A dynamic load balancing system is described that determines the load of resources in a hosted environment dynamically by monitoring the usage of resources by each customer and determines the number of customers hosted by a server based on the actual resources used. The system receives a performance threshold that indicates when a server is too heavily loaded and monitors the resource usage by each customer. When the load of an overloaded server in the hosted environment exceeds the received performance threshold, the system selects a source customer currently hosted by the overloaded server to move to another server. | 2009-12-31 |
20090328051 | RESOURCE ABSTRACTION VIA ENABLER AND METADATA - Embodiments of the invention provide systems and methods for managing an enabler and dependencies of the enabler. According to one embodiment, a method of managing an enabler can comprise requesting a management function via a management interface of the enabler. The management interface can provide an abstraction of one or more management functions for managing the enabler and/or dependencies of the enabler. In some cases, prior to requesting the management function metadata associated with the management interface can be read and a determination can be made as to whether the management function is available or unavailable. Requesting the management function via the management interface of the enabler can be performed in response to determining the management function is available. In response to determining the management function is unavailable, one or more alternative functions can be identified based on the metadata and the one or more Falternative functions can be requested. | 2009-12-31 |
20090328052 | RESOURCE LOCATOR VERIFICATION METHOD AND APPARATUS - A method to be implemented using a computer system, the method comprising the steps of providing a resource database that specifies locations of resources for use by consumers, receiving a location communication originated by a mobile consumer device associated with a consumer at a time temporally proximate a time when the consumer accesses a resource where the location communication indicates the location of the consumer device and using the location of the consumer device indicated in the communication to update the resource database. | 2009-12-31 |
20090328053 | ADAPTIVE SPIN-THEN-BLOCK MUTUAL EXCLUSION IN MULTI-THREADED PROCESSING - Adaptive modifications of spinning and blocking behavior in spin-then-block mutual exclusion include limiting spinning time to no more than the duration of a context switch. Also, the frequency of spinning versus blocking is limited to a desired amount based on the success rate of recent spin attempts. As an alternative, spinning is bypassed if spinning is unlikely to be successful because the owner is not progressing toward releasing the shared resource, as might occur if the owner is blocked or spinning itself. In another aspect, the duration of spinning is generally limited, but longer spinning is permitted if no other threads are ready to utilize the processor. In another aspect, if the owner of a shared resource is ready to be executed, a thread attempting to acquire ownership performs a “directed yield” of the remainder of its processing quantum to the other thread, and execution of the acquiring thread is suspended. | 2009-12-31 |
20090328054 | ADAPTING MESSAGE DELIVERY ASSIGNMENTS WITH HASHING AND MAPPING TECHNIQUES - A system for efficiently distributing messages to a server farm uses a hashing function and a map-based function, or combinations thereof, to distribute messages associated with a processing request. In one implementation, for example, the hashing function has inputs of an identifier for each message in a processing request, and a list of available servers. Upon identifying that any of the servers is unavailable, or will soon be unavailable, the load balancing server uses an alternate map-based assignment function for new requests, and inputs each assignment into a server map. The load balancing server can then use the map or the hashing function, as appropriate, to direct messages to an operating server. Upon receiving an updated list of available servers, the load balancing server can switch back to the hashing function after the map is depleted, and use the updated server list as an argument. | 2009-12-31 |
20090328055 | SYSTEMS AND METHODS FOR THREAD ASSIGNMENT AND CORE TURN-OFF FOR INTEGRATED CIRCUIT ENERGY EFFICIENCY AND HIGH-PERFORMANCE - A system and method for improving efficiency of a multi-core architecture includes, in accordance with a workload, determining a number of cores to shut down based upon a metric that combines parameters to represent operational efficiency. Threads of the workload are reassigned to cores remaining active by assigning threads based on priority constraints and thread execution history to improve the operational efficiency of the multi-core architecture. | 2009-12-31 |
20090328056 | Entitlement model - Some embodiments of an entitlement model have been presented. In one embodiment, a centralized server distributes copies of an operating system from a software vendor to a set of virtual guests of a virtual host running on a physical computing machine. The centralized server and the physical computing machine are coupled to each other within an internal network of a customer of the software vendor, whereas the centralized server has access to the software vendor external to the internal network of the customer. The centralized server may interact with a hypervisor of the physical computing machine to determine what type of license of the operating system the virtual host has and a number of copies of the operating system requested by the virtual guests. | 2009-12-31 |
20090328057 | SYSTEM AND METHOD FOR RESERVATION STATION LOAD DEPENDENCY MATRIX - A device and method may fetch an instruction or micro-operation for execution. An indication may be made as to whether the instruction is dependent upon any source values corresponding to a set of previously fetched instructions. A value may be stored corresponding to each source value from which the first instruction depends. An indication may be made for each of the set of sources of the instruction, whether the source depends on a previously loaded value or source, where indicating may include storing a value corresponding to the indication. The instruction may be executed after the stored values associated with the instruction indicate the dependencies are satisfied. | 2009-12-31 |
20090328058 | PROTECTED MODE SCHEDULING OF OPERATIONS - The present invention extends to methods, systems, and computer program products for protected mode scheduling of operations. Protected mode (e.g., user mode) scheduling can facilitate the development of programming frameworks that better reflect the requirements of the workloads through the use of workload-specific execution abstractions. In addition, the ability to define scheduling policies tuned to the characteristics of the hardware resources available and the workload requirements has the potential of better system scaling characteristics. Further, protected mode scheduling decentralizes the scheduling responsibility by moving significant portions of scheduling functionality from supervisor mode (e.g., kernel mode) to an application. | 2009-12-31 |
20090328059 | Synchronizing Communication Over Shared Memory - Two threads may communicate via shared memory using two different modes. In a polling mode, a receiving thread may poll an indicator set by the sending thread to determine if a message is present. In a blocking mode, the receiving thread may wait until a synchronization object is set by the sending thread which may cause the receiving thread to return to the polling mode. The polling mode may have low latency buy may use processor activity of the receiving thread to repetitively check the indictor. The blocking mode may have a higher latency but may allow the receiving thread to enter a sleep mode or perform other activities. | 2009-12-31 |
20090328060 | HTTP BASED BOUNDING STORAGE SPACE PROTOCOL - In a response based messaging system in which the reliability of the message transmission is supplemented by storing at both the source and destination a copy of the message, storage space is bounded. By including in the response to a message acknowledgement from the destination that the message has been received, the copy of the message stored at the source can be deleted. Furthermore, by including in the message an identifier of what message acknowledgement the source is expecting, the destination can delete from its storage medium any previously stored messages. | 2009-12-31 |
20090328061 | METHOD FOR USING INFORMATION IN ANOTHER DOMAIN, PROGRAM FOR USING INFORMATION IN ANOTHER DOMAIN, AND INFORMATION TRANSFER PROGRAM - [PROBLEMS] To use data in another domain while executing a script language based on a security limit of an HTTP client. | 2009-12-31 |
20090328062 | SCALABLE AND EXTENSIBLE COMMUNICATION FRAMEWORK - An extensible communication framework is presented that provides a standard, reusable implementation of common code for adding new modes of communication to a unified communications application. The framework loosely couples the signaling and media plane of unified communications to enable the two planes to be separated onto different computer systems or processes and to allow application writers to extend only the portion where they want to add new functionality. Thus, the extensible communication framework provides flexibility without excessive complexity. | 2009-12-31 |
20090328063 | INTER-FRAME MESSAGING BETWEEN DIFFERENT DOMAINS - Cross-domain communication between a parent web page hosted in a parent domain and a child web page hosted in a different child domain is provided. Upon downloading the parent page and child page into a client's web browser, an IFM-channel connection can be established within the browser between the parent page and child page, which can be used to bidirectionally communicate text-based messages containing commands and HTML content directly between the parent page and child page. Additionally, an XML-channel connection can be established within the browser between the parent page and child page, which can be used to bidirectionally communicate text-based messages containing HTTP commands and XML content directly between the parent page and child page. This cross-domain communication of messages takes place completely within the browser. | 2009-12-31 |
20090328064 | COM OBJECT AND MANAGED CODE OBJECT INTEROPERABILITY - Communicating between managed add-ins and COM hosts. A computing environment includes host objects which may be one of a COM object or a managed code object. The computing environment further includes add-in objects implemented in managed code. Add-in object can provide additional functionality to the host objects. A method includes acts for communicating between add-in objects and host objects. The method includes determining that a first host object to be communicated with is a COM object of a COM host. As a result of determining that a host object to be communicated with is a COM object, incoming and outgoing communications from a managed code add-in are routed through an interop proxy. The interop proxy is implemented in managed code with a managed code add-in. The interop proxy is configured to translate managed code invocations to COM code invocation, and to translate COM code invocations to managed code invocations. | 2009-12-31 |
20090328065 | METHOD AND SYSTEM FOR DELEGATED JOB CONTROL ACROSS A NETWORK - A method for job delegation including receiving a job from a user by a first management object, identifying a target system for the job using a data model in the first management object and a job delegation policy, where the data model comprises an object representing the target system, and determining a first nexthop for the target system, where the first nexthop is a second management object. The method also includes placing the job on a queue corresponding to the second management object, where the queue is located in the first management object, receiving the job by the second management object, locating the target system and a driver corresponding to the target system using the second management object, and executing the job using the driver corresponding to the target system. | 2009-12-31 |
20090328066 | UNTRUSTED COMPONENT HOSTING - In a computing environment, one may wish to have interoperability between trusted and untrusted controls/plug-ins allowing for richer expression of content and control within a platform. This can be accomplished by allowing an untrusted plug-in to communicate with a trusted plug-in, while having the trusted plug-in exercise control over the platform. This allows for the creation of a layered secure approach of communication with a platform, thus allowing for increased application richness in untrusted third party applications. | 2009-12-31 |
20090328067 | UNIFIED, CONFIGURABLE SERVICES STACK FOR INTEGRATION OF ENTERPRISE APPLICATIONS - A system and method for generating application code and an external interface for a service class in an enterprise resource planning (ERP) system is provided. The system receives a definition of a service class from a user via a user interface tool. The definition of the service class specifies a query for the service class and operations that are to be enabled for the service class. The system automatically generates application code for the service class, which enables the service class to be used by an internal endpoint of the ERP system. The application code is customizable by the user; the user may add additional operations to the service class. In addition, the system automatically generates an external interface for the service class, which enables the service class to be used by an external endpoint of the ERP system without needing knowledge of the application code. | 2009-12-31 |
20090328068 | APPLICATION INTERACTION SYSTEM, APPLICATION INTERACTION METHOD, RECORDING MEDIUM, AND APPLICATION INTERACTION PROGRAM - An application interaction system includes: means ( | 2009-12-31 |
20090328069 | EXECUTING STATE MACHINE PROCESSING MODULES WITH AN EXECUTIVE PROCESSING MODULE - An application that uses a state machine for processing can be optimized to process objects efficiently through an alternate, executive processing module. In one implementation, for example, one of the plurality of processing modules in a given state machine can be reconfigured to subscribe to an executive processing module, which, in turn, is subscribed to all events that occur during processing of the given state machine. When the corresponding state machine is tasked with processing a client request, the executive processing module processes the client request for each subscribed processing module. The executive processing module can optimize processing of the client request for all subscribed processing modules, and can further provide human-readable output regarding processing details of the same. | 2009-12-31 |
20090328070 | Event Driven Disposition - This disclosure relates to systems, methods and apparatuses for managing the retention and disposition of data for an event consumer using an Enterprise Retention Management System wherein the management is driven by business events. | 2009-12-31 |
20090328071 | SOFT DENIAL OF APPLICATION ACTIONS OVER THE NETWORK COMMUNICATIONS - A soft-denial system for client-server networks is disclosed for translating server authorization denials into responses that are known to be innocuous to the client application. The soft-denial system includes a client-application which originates a service request across a network to a server-application which rejects the request due to lack of authorization and subsequently provides a denial response. A soft-denial application intercepts the denial response, translates the response into a response known to be innocuous to the client-application, and forwards the innocuous response to the client-application. The soft-denial system is particularly useful for overcoming client-application failures due to authorization expectation mismatches. | 2009-12-31 |
20090328072 | EVENT PROCESSOR - An event control section | 2009-12-31 |
20090328073 | METHOD AND SYSTEM FOR LOW-OVERHEAD DATA TRANSFER - A method for low-overhead data transfer. The method includes initiating, by a first application, TCP connection with a second application, establishing, in response to the initiation, the TCP connection between the first application and the second application, providing, by the first application, pre-post buffer information to the second application, where the pre-post buffer information corresponds to a location in a physical memory of the first computer and where the location in physical memory corresponds to a virtual memory address of the first application. The method further comprising transferring data, by the second application, to the first application using the pre-post buffer information, where transferring the data comprises writing the data directly into a location in the physical memory of the first computer. | 2009-12-31 |
20090328074 | Direct Memory Access Filter for Virtualized Operating Systems - Described techniques increase runtime performance of workloads executing on a hypervisor by executing virtualization-aware code in an otherwise non virtualization-aware guest operating system. In one implementation, the virtualization-aware code allows workloads direct access to physical hardware devices, while allowing the system memory allocated to the workloads to be overcommitted. In one implementation, a DMA filter driver is inserted into an I/O driver stack to ensure that the target virtual memory of a DMA transfer is resident before the transfer begins. The DMA filter driver may utilize a cache to track which pages of memory are resident. The cache may also indicate which pages of memory are in use by one or more transfers, enabling the hypervisor to avoid appropriating pages of memory during a transfer. | 2009-12-31 |
20090328075 | FILTER DRIVER TO ENUMERATE SMARTCARD NODES FOR PLUG AND PLAY - Described herein is a filter driver in a smartcardreader class that recognizes the presence of a smartcard in a smartcard reader and creates a device node (devnode). | 2009-12-31 |
20090328076 | SIMULATION OF SMARTCARD REMOVAL AND REINSERTION - A filter driver may be instantiated in a smartcardreader class, and used to modify the smartcard status in an operating system. | 2009-12-31 |
20090328077 | Software Appliances not Requiring Virtual Machines - Basing software appliances on a virtualization technique known as “Containers” enables the deployment of the software appliance on any host running a relevant containerized operating system. Basing virtual appliances on containers avoids incurring the additional overhead normally associated with virtual machines. For example, basing virtual appliances on containers avoids the installation, configuration and maintenance costs associated with running complex stacks of software, as well as the need for on-site support, while simultaneously avoiding the performance overhead and scaling limitations associated with running virtual machines. | 2009-12-31 |
20090328078 | Execution of Embedded System Applications - A method of executing embedded system applications is disclosed. In an embodiment, an embedded system stores a software application for processing data collected by the embedded system and/or for controlling the embedded system. The embedded system transmits the application to a nearby computing device. The computing device executes the application using its own processing capability. The application contains instructions which, when executed, cause the computing device to interact with the embedded system. This may result in the computing device controlling the embedded system or in data being downloaded from the embedded system and processed by the computing device. | 2009-12-31 |
20090328079 | SPACE SEPARATION FOR A LIBRARY BASED RECORD AND REPLAY TOOL - Techniques for separating application processes into a system space and a replay space are described in a record and replay tool. The technique permits applications to run in the replay space while a record and replay library runs and manages resources in system space ensuring accurate replay of saved data that are used by applications. | 2009-12-31 |
20090328080 | Window Redirection Using Interception of Drawing APIS - Various embodiments provide an API hooking mechanism to intercept drawing-related calls into a graphics interface, such as a Graphics Device Interface (GDI or GDI+), and redirect the calls to an alternate destination which is different from a destination intended by a calling application. By being aware of when a targeted window for redirection begins and ends drawing, and by being able to control which surfaces the targeted window is actually drawn to, various embodiments can present a compatible interface and control drawing of individual windows in a system on a specific window-by-window level. Redirection can take place at various levels of granularity including on a child window-by-child window basis. | 2009-12-31 |