Patent application number | Description | Published |
20090282289 | GENERATION AND EVALUATION OF TEST CASES FOR SOFTWARE VALIDATION AND PROOFS - A “property checker” uses light-weight symbolic execution to prove that software programs satisfy safety properties by simultaneously performing program testing and program abstraction. A simple example of safety properties includes conditions that must be satisfied for proper program execution, such as whether an application properly interfaces with API methods or functions. Program tests are an “under-approximation” of program behavior, and abstractions are an “over-approximation” of the program. This simultaneous testing either finds a test-case that reaches an error state, or finds an abstraction showing that no path in the state space of the program can reach any error state. If a test-case reaches an error state, the property checker has discovered a violation of the safety property. Conversely, if no path in the state space can reach any error state, the property checker has proved that the program satisfies the desired safety property. | 11-12-2009 |
20100088546 | STATISTICAL DEBUGGING USING PATHS AND ADAPTIVE PROFILING - The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with the labeled paths, reviewing the error report for data related to the labels and if an error is sufficiently related to application paths with labels, storing the path that created the errors in a report. If an error is not sufficient related to the application path with labels, the method is repeated by the creating the analysis again by substituting additional application paths for the application paths. | 04-08-2010 |
20100251221 | COMBINATION MAY-MUST CODE ANALYSIS - A method of analyzing a computer application is disclosed. The method may break an application into components and the method may determine if the components have already been analyzed for errors, either through static analysis or by a code analysis. If the component has already been analyzed, the previous analysis may be used and the method may move on to the next code section. If the component has not been analyzed, it may be determined if the component may be reached from a given starting point. If the component cannot be reached from a given starting point, the component may not be analyzed. Both static and code testing tools may be used to determine if errors exist. The fined-grained coupling and alternation of may (universal) and must (existential) summaries allow the method to easily navigate through these code fragments while traditional may-only, must-only or non-compositional may-must al-gorithms are stuck in their specific analyses. | 09-30-2010 |
20120197829 | QUANTIFIED BELIEF PROPAGATION - A quantified belief propagation (QBP) algorithm receives as input an existentially quantified boolean formula (QBF) of existentially quantified boolean variables, universally quantified variables, and boolean operators. A tripartite graph is constructed, and includes (i) there-exists nodes that correspond to and represent the existentially quantified variables, (ii) for-all nodes that correspond to and represent the universally quantified variables, and (iii) sub-formula nodes that correspond to and represent sub-formulas of the QBF. A set of boolean values of the existentially quantified variables is found by (i) passing a first message from an arbitrary sub-formula node to an arbitrary for-all node, and (ii) in response, passing a second message from the arbitrary for-all node to the arbitrary sub-formula node. | 08-02-2012 |
20130144812 | PROBABILISTIC MODEL APPROXIMATION FOR STATISTICAL RELATIONAL LEARNING - Various technologies described herein pertain to approximating an inputted probabilistic model for statistical relational learning. An initial approximation of formulae included in an inputted probabilistic model can be formed, where the initial approximation of the formulae omits axioms included in the inputted probabilistic model. Further, an approximated probabilistic model of the inputted probabilistic model can be constructed, where the approximated probabilistic model includes the initial approximation of the formulae. Moreover, the approximated probabilistic model and evidence can be fed to a relational learning engine, and a most probable explanation (MPE) world can be received from the relational learning engine. The evidence can comprise existing valuations of a subset of relations included in the inputted probabilistic model. The MPE world can include valuations for the relations included in the inputted probabilistic model. The MPE world can be outputted when the input probabilistic model lacks an axiom violated by the MPE world. | 06-06-2013 |
20130239093 | PARALLELIZING TOP-DOWN INTERPROCEDURAL ANALYSIS - Technologies pertaining to top-down interprocedural analysis of a computer program are described herein. A query is received for processing over a root procedure in the computer program. Responsive to the query being received, the root procedure is explored, and calls to sub-procedures are located. Sub-queries are generated upon encountering the calls to the sub-procedures, and execution of the sub-queries is performed in parallel across multiple computing nodes. | 09-12-2013 |
Patent application number | Description | Published |
20080232064 | COOLING SYSTEM FOR INFORMATION DEVICE - To cool a blade type server disposed in an air-conditioned room, the following arrangements are made. The first is at least one shell having a ventilation passage disposed in the air-conditioned room. The second is, the following are disposed in a ventilation passage: racks, in which blade type servers each composed of a case with slim boards housed therein are stacked; cooling coils each having a coolant passage and a cooling fin and cooling a passing air; and at least one fan unit having axial-flow fans placed therein and producing air currents in one direction. The third is the fan unit forces a cooling air to flow in one direction in the ventilation passage thereby to cool the servers in the racks. The cooling coils and racks are disposed alternately so that warmed cooling air after passing through the rack is cooled by the cooling coil and then cools the next rack. | 09-25-2008 |
20110317357 | COOLING SYSTEM FOR INFORMATION DEVICE - To cool a blade type server disposed in an air-conditioned room, the following arrangements are made. The first is at least one shell having a ventilation passage disposed in the air-conditioned room. The second is, the following are disposed in a ventilation passage: racks, in which blade type servers earch composed of a case with slim boards housed therein are stacked; cooling coils each having a coolant passage and a cooling fin and cooling a passing air; and at least one fan unit having axial-flow fans placed therein and producing air curents in one direction. The third is the fan unit forces a cooling air to flow in one direction in the ventilation passage thereby to cool the servers in the racks. The cooling coils and racks are dispossed alternately so that warmed cooling air after passing through the rack is cooled by the cooling coil and then cools the next rack. | 12-29-2011 |
20150250075 | COOLER AND ELECTRONIC DEVICE - A cooler includes: a casing arranged opposed to a heat releasing surface of a heater element; and a first flow channel which is provided in the casing and through which a refrigerant flows, wherein in a direction orthogonal to the heat releasing surface, a length of the first flow channel on a heat releasing surface side is shorter than a length of the first flow channel on the opposite side to the heat releasing surface. | 09-03-2015 |
Patent application number | Description | Published |
20100205475 | META-DATA DRIVEN, SERVICE-ORIENTED ARCHITECTURE (SOA)-ENABLED, APPLICATION INDEPENDENT INTERFACE GATEWAY - An interface gateway may receive a request including a first interface identifier. The interface gateway is associated with a group of interfaces, where each interface is associated with metadata that defines the interface. The metadata may include an interface identifier, information identifying services to be executed for the interface and an order in which the identified services are to be executed, and information identifying servers on which the identified services are implemented. The interface gateway may also identify, for the received request, one interface, of the group of interfaces, for processing the request based on the first interface identifier. The interface gateway may further process the received request using the one interface. When processing the received request, the interface gateway may execute the identified services on the identified servers according to the order, where the executing causes data, associated with the received request, to be converted from a source format to a target format. | 08-12-2010 |
20120158642 | ENTERPRISE RESOURCE PLANNING (ERP) SYSTEM CHANGE DATA CAPTURE - A device receives, from a data warehouse, a request for incremental data, creates one or more temporary tables based on the request, and extracts incremental data from tracking tables of an enterprise resource planning (ERP) system. The device also stores the extracted incremental data in the one or more temporary tables, and joins the one or more temporary tables with one or more regular tables, where the one or more regular tables include data associated with the incremental data stored in the one or more temporary tables. The device further retrieves data from the joined one or more temporary tables and the one or more regular tables, and stores the retrieved data in the data warehouse. | 06-21-2012 |
Patent application number | Description | Published |
20090245233 | UNIFIED SESSION SIGNALING SYSTEM FOR USE IN MULTIMEDIA COMMUNICATIONS - A design for a unified session signaling system for use in multimedia communications is disclosed. In one embodiment, a method includes interfacing, via an application interface, with an associated application and a session, tracking, via a call state/session manager, a call state and session properties across multiple calls associated with the session, managing, via a server interoperation module, registration and proxying services associated with the session, managing, via a basic SIP services module using a third party SIP stack, a basic set of SIP services associated with the application and the session, and determining and advertising, via a media negotiator module, media capabilities of devices associated with the session. The method may also include managing, via an additional SIP services module using the third party SIP stack, a set of additional services associated with the session. | 10-01-2009 |
Patent application number | Description | Published |
20120089606 | GROUPING IDENTITY RECORDS TO GENERATE CANDIDATE LISTS TO USE IN AN ENTITY AND RELATIONSHIP RESOLUTION PROCESS - Provided are a method, system, and computer program product for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. A plurality of identity records are received, wherein the identity records provide attributes of entities, wherein the identity records may provide different or same values for the attributes. The received identity records are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database matching the attribute values of the composite query. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records from the entity database for the identity record. For the identity records in the group, resolution rules are applied to determine entity records in the determined candidate list that are related one of the identity records in the group according to the resolution rules. Entity relationship information on the determined entity records that are related to the identity records is stored. | 04-12-2012 |
20120215772 | GROUPING IDENTITY RECORDS TO GENERATE CANDIDATE LISTS TO USE IN AN ENTITY AND RELATIONSHIP RESOLUTION PROCESS - Provided is a method for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. A plurality of identity records provide attributes of entities. The received identity records are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database matching the attribute values of the composite query. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records from the entity database for the identity record. | 08-23-2012 |
20130282726 | GROUPING IDENTITY RECORDS TO GENERATE CANDIDATE LISTS TO USE IN AN ENTITY AND RELATIONSHIP RESOLUTION PROCESS - Provided are a method, system, and computer program product for determining entity relationship information for identity records to add to an entity database. For each selected identity record of a plurality of identity records, an individual query on selected attribute values of the selected identity record is applied against at least one set of entity records to determine a candidate list of the entity records in the at least one set determined to be related to the selected identity record based on the selected attribute values of the selected identity record. Entity relationship information on entity records from the candidate list that are determined to be related to the selected identity record are stored in the entity database. | 10-24-2013 |
20150139617 | DETERMINING UPDATES FOR A VIDEO TUTORIAL - Embodiments of the present invention disclose a computer implemented method, computer program product, and system for updating a video tutorial. In accordance with an embodiment, the method includes the steps of determining a number of users of a video tutorial that have performed a set of actions that are different than a set of actions displayed in the video tutorial, determining that the number of users of the video tutorial that have performed the set of actions that are different meets a threshold condition, and identifying a segment of the video tutorial to remove, wherein the identified segment includes the set of actions displayed in the video tutorial that are different. The method may further include creating an updated video tutorial by replacing the identified segment of the video tutorial with a video of the set of actions that are different than the set of displayed actions. | 05-21-2015 |
20150139618 | DETERMINING UPDATES FOR A VIDEO TUTORIAL - Embodiments of the present invention disclose a computer implemented method, computer program product, and system for updating a video tutorial. In accordance with an embodiment, the method includes the steps of determining a number of users of a video tutorial that have performed a set of actions that are different than a set of actions displayed in the video tutorial, determining that the number of users of the video tutorial that have performed the set of actions that are different meets a threshold condition, and identifying a segment of the video tutorial to remove, wherein the identified segment includes the set of actions displayed in the video tutorial that are different. The method may further include creating an updated video tutorial by replacing the identified segment of the video tutorial with a video of the set of actions that are different than the set of displayed actions. | 05-21-2015 |
Patent application number | Description | Published |
20090196485 | Tag validation for efficiently assessing electronic check image quality - Efficiently assessing the quality of an electronic check image by determining whether the check image is suitable for image quality analysis prior to performing the image quality analysis. A check processing module of a check processor can determine whether the check image is suitable for image quality analysis by validating certain tags in the image. For example, such validation can include determining whether the check image includes certain mandatory tags and whether any optional tags present in the image are valid. The check processing module can determine that the check image is not suitable for image quality analysis if it does not include the mandatory tags or if it includes any invalid optional tags. The check processing module can assign a failure value to any check image that is not suitable for image quality analysis. The failure value can indicate a reason for the unsuitability of the check image. | 08-06-2009 |
20090236413 | Expanded Mass Data Sets For Electronic Check Processing - Accommodating the data needed to process checks for payment under the Check Clearing for the 21 | 09-24-2009 |
20100176192 | Cash Letter Print Streams - Producing print streams for efficiently generating properly formatted and ordered paper cash letters comprises print stream file that includes electronic form definitions for each cash letter document. The cash letter documents can include a cover page, one or more bundles of substitute checks, a bundle summary for each substitute check bundle, and/or a cash letter bundle summary. Information from an electronic image cash letter file can be input in data fields of the electronic form definitions. Printing the information in the print stream file results in a properly formatted and ordered paper cash letter including substitute checks and audit data. Each substitute check can include all of the MICR data provided on a corresponding, original paper check. The audit data includes the cover page, bundle summary(ies), and/or cash letter bundle summary, which can each detail the documents printed concurrently therewith. | 07-15-2010 |