Patent application number | Description | Published |
20090314307 | Oral Hygiene Device With Floss Storage Capability - An oral hygiene device is provided having a head and a handle. The handle is configured to accommodate a user's hand grip when the head is inserted into a user's mouth. The head is further configured to accommodate, at a distal end of the handle, a proximal end of the head. One of the head and the handle is provided with a cavity configured to receive a supply of floss. The cavity becomes accessible when the head and the handle are at least partially detached from one another. | 12-24-2009 |
20090320224 | Oral Care Implement - An oral care implement ( | 12-31-2009 |
20130263397 | ORAL CARE IMPLEMENT - An oral care implement ( | 10-10-2013 |
20130277254 | PACKAGE OF ORAL CARE IMPLEMENTS AND METHOD OF USING THE SAME - A package ( | 10-24-2013 |
20140208697 | PACKAGE OF ORAL CARE IMPLEMENTS AND METHOD OF USING THE SAME - A method of using an article such as an oral care implement. In one aspect, the invention can be a method of using an oral care implement comprising: a) obtaining a package of oral care implements, the package comprising a tubular body having a first cavity and a second cavity, the first cavity separated from the second cavity by at least one wall, the first cavity having an open top end and a closed bottom end, wherein the oral care implements are positioned within the first cavity and a cover encloses the open top end of the first cavity; and b) removing one of the oral care implements from the first cavity. | 07-31-2014 |
Patent application number | Description | Published |
20100284527 | Importance-Based Call Graph Construction - A system and method for importance-based call graph construction, including a) analyzing a computer software application to identify a plurality of calls within the computer software application, b) assigning an importance value to any of the calls in accordance with a predefined importance rule, c) selecting any of the calls for inclusion in a call graph in accordance with a predefined inclusion rule, d) representing the call in the call graph, e) adjusting the importance value of any call represented in the call graph in accordance with a predefined importance adjustment rule, and f) iteratively performing any of steps a)-e) until a predefined termination condition is met. | 11-11-2010 |
20110138369 | Feedback-Directed Call Graph Expansion - A technique for feedback-directed call graph expansion includes performing symbolic analysis on an interprocedural control flow graph representation of software code, skipping over a virtual method call in the control flow graph, using information obtained from the symbolic analysis as feedback to identify a target of the virtual method call, and iterating the symbolic analysis on a modified version of the control flow graph that associates the target with the virtual method. | 06-09-2011 |
20120110551 | SIMULATING BLACK BOX TEST RESULTS USING INFORMATION FROM WHITE BOX TESTING - Systems, methods are program products for simulating black box test results using information obtained from white box testing, including analyzing computer software (e.g., an application) to identify a potential vulnerability within the computer software application and a plurality of milestones associated with the potential vulnerability, where each of the milestones indicates a location within the computer software application, tracing a path from a first one of the milestones to an entry point into the computer software application, identifying an input to the entry point that would result in a control flow from the entry point and through each of the milestones, describing the potential vulnerability in a description indicating the entry point and the input, and presenting the description via a computer-controlled output medium. | 05-03-2012 |
20120216177 | Generating Sound and Minimal Security Reports Based on Static Analysis of a Program - A method is disclosed that includes, using a static analysis, analyzing a software program to determine a number of paths from sources accepting information to sinks using that information or a modified version of that information and to determine multiple paths from the number of paths. The determined multiple paths have a same transition from an application portion of the software program to a library portion of the software program and require a same downgrading action to address a vulnerability associated with source-sink pairs in the multiple paths. The analyzing includes determining the multiple paths using a path-sensitive analysis. The method includes, for the determined multiple paths, grouping the determined multiple paths into a single representative indication of the determined multiple paths. The method includes outputting the single representative indication. Computer program products and apparatus are also disclosed. | 08-23-2012 |
20120254839 | SIMULATING BLACK BOX TEST RESULTS USING INFORMATION FROM WHITE BOX TESTING - Systems, methods are program products for simulating black box test results using information obtained from white box testing, including analyzing computer software (e.g., an application) to identify a potential vulnerability within the computer software application and a plurality of milestones associated with the potential vulnerability, where each of the milestones indicates a location within the computer software application, tracing a path from a first one of the milestones to an entry point into the computer software application, identifying an input to the entry point that would result in a control flow from the entry point and through each of the milestones, describing the potential vulnerability in a description indicating the entry point and the input, and presenting the description via a computer-controlled output medium. | 10-04-2012 |
20130191691 | IMPORTANCE-BASED CALL GRAPH CONSTRUCTION - Call graph construction systems that utilize computer hardware are presented including: a processor a candidate pool configured for representing a number of calls originating from a root node of a computer software application; an importance value assigner configured for assigning an importance value for any of the number of calls represented in the candidate pool; a candidate selector configured for selecting from the number of calls represented in the candidate pool for inclusion in a call graph based on a sufficient importance value; and an importance value adjuster configured for adjusting the importance value of any call represented in the call graph. | 07-25-2013 |
20140380290 | EXTRACTING STREAM GRAPH STRUCTURE IN A COMPUTER LANGUAGE BY PRE-EXECUTING A DETERMINISTIC SUBSET - Compile-time recognition of graph structure where graph has arbitrary connectivity and is constructed using recursive computations is provided. In one aspect, the graph structure recognized at compile time may be duplicated at runtime and can then operate on runtime values not known at compile time. | 12-25-2014 |
20140380291 | EXTRACTING STREAM GRAPH STRUCTURE IN A COMPUTER LANGUAGE BY PRE-EXECUTING A DETERMINISTIC SUBSET - Compile-time recognition of graph structure where graph has arbitrary connectivity and is constructed using recursive computations is provided. In one aspect, the graph structure recognized at compile time may be duplicated at runtime and can then operate on runtime values not known at compile time. | 12-25-2014 |
Patent application number | Description | Published |
20080215649 | SYSTEM FOR DETECTING PROGRAM PHASES WITH PERIODIC CALL-STACK SAMPLING DURING GARBAGE COLLECTION - A system for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed. | 09-04-2008 |
20080222602 | DECLARATIVE OBJECT IDENTITY USING RELATION TYPES - The present invention provides a programming model based on a relational view of the heap which defines identity declaratively, obviating the need for equals( ) and hashcode( ) methods. Each element in the heap (called a tuple) belongs to a relation type and relates an immutable identity to mutable state. The model entails a stricter contract: identity never changes during an execution. Objects, values, and singletons arise as special cases of tuples. | 09-11-2008 |
20080271055 | PROTOCOL FOR COMMUNICATION OF DATA STRUCTURES - A system and method are provided for communicating information in a data structure between applications. According to the method, a description of a data structure is sent from a first application to a second application, and there is received from the second application an identification of at least one portion of the data structure that is requested by the second application. The first application marshals a subset of the data structure consisting of the at least one portion that was identified, and there is sent from the first application to the second application the marshalled subset of the data structure. | 10-30-2008 |
20100229156 | DETECTING PROGRAM PHASES WITH PERIODIC CALL-STACK SAMPLING DURING GARBAGE COLLECTION - A computer readable storage medium for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed. | 09-09-2010 |