Patent application number | Description | Published |
20090150874 | BINARY PROGRAMMABLE METHOD FOR APPLICATION PERFORMANCE DATA COLLECTION - A method for application performance data collection includes steps or acts of: customizing a performance tool for collecting application performance data of an application; modifying the application by inserting the performance tool while the application does not need to be rebuilt from the source; executing the application; and collecting the application execution performance data such that only interesting data is collected. Customizing the performance tool proceeds by implementing at least one configurable tracing function that can be programmed by the user; compiling the function(s) into an object file; and inserting the object file into the performance tool using binary instrumentation. | 06-11-2009 |
20090177642 | METHOD AND SYSTEM FOR AUTOMATED DETECTION OF APPLICATION PERFORMANCE BOTTLENECKS - A system for detecting performance bottlenecks in a target application. In response to receiving hotspot selections from a user interface, bottleneck rules are extracted from a database. A hotspot is a region of source code that exceeds a time threshold to execute in the target application. Metrics needed to evaluate the bottleneck rules extracted from the database are identified. The identified metrics are computed. It is determined whether each bottleneck rule extracted from the database is evaluated to true using the computed metrics for hotspots in the target application. In response to determining that a bottleneck rule is evaluated to true using an appropriate computed metric corresponding to the bottleneck rule, a bottleneck description is created for the bottleneck rule. Then, the bottleneck description is sent to the user interface. | 07-09-2009 |
20100180255 | PROGRAMMABLE FRAMEWORK FOR AUTOMATIC TUNING OF SOFTWARE APPLICATIONS - A target application is automatically tuned. A list of solutions for identified performance bottlenecks in a target application is retrieved from a storage device. A plurality of modules is executed to compute specific parameters for solutions contained in the list of solutions. A list of modification commands associated with specific parameters computed by the plurality of modules is generated. The list of modification commands associated with the specific parameters is appended to a command sequence list. The list of modification commands is implemented in the target application. Specific source code regions corresponding to the identified performance bottlenecks in the target application are automatically tuned using the implemented list of modification commands. Then, the tuned target application is stored in the storage device. | 07-15-2010 |
20100287536 | PROFILING APPLICATION PERFORMANCE ACCORDING TO DATA STRUCTURE - During runtime of a binary program file, streams of instructions are executed and memory references, generated by instrumentation applied to given ones of the instructions that refer to memory locations, are collected. A transformation is performed, based on the executed streams of instructions and the collected memory references, to obtain a table. The table lists memory events of interest for active data structures for each function in the program file. The transformation is performed to translate memory addresses for given ones of the instructions and given ones of the data structures into locations and variable names in a source file corresponding to the binary file. At least the memory events of interest are displayed, and the display is organized so as to correlate the memory events of interest with corresponding ones of the data structures. | 11-11-2010 |
Patent application number | Description | Published |
20120254879 | HIERARCHICAL TASK MAPPING - Mapping tasks to physical processors in parallel computing system may include partitioning tasks in the parallel computing system into groups of tasks, the tasks being grouped according to their communication characteristics (e.g., pattern and frequency); mapping, by a processor, the groups of tasks to groups of physical processors, respectively; and fine tuning, by the processor, the mapping within each of the groups. | 10-04-2012 |
20130014115 | HIERARCHICAL TASK MAPPING - Mapping tasks to physical processors in parallel computing system may include partitioning tasks in the parallel computing system into groups of tasks, the tasks being grouped according to their communication characteristics (e.g., pattern and frequency); mapping, by a processor, the groups of tasks to groups of physical processors, respectively; and fine tuning, by the processor, the mapping within each of the groups. | 01-10-2013 |
20130238862 | FAST PREDICTION OF SHARED MEMORY ACCESS PATTERN - A computer implemented method analyzes shared memory accesses during execution of an application program. The method includes instrumenting events of shared memory accesses in the application program, where the application program is to be executed on a target configuration having p nodes; executing the application program using p | 09-12-2013 |
20140156939 | METHODOLOGY FOR FAST DETECTION OF FALSE SHARING IN THREADED SCIENTIFIC CODES - A profiling tool identifies a code region with a false sharing potential. A static analysis tool classifies variables and arrays in the identified code region. A mapping detection library correlates memory access instructions in the identified code region with variables and arrays in the identified code region while a processor is running the identified code region. The mapping detection library identifies one or more instructions at risk, in the identified code region, which are subject to an analysis by a false sharing detection library. A false sharing detection library performs a run-time analysis of the one or more instructions at risk while the processor is re-running the identified code region. The false sharing detection library determines, based on the performed run-time analysis, whether two different portions of the cache memory line are accessed by the generated binary code. | 06-05-2014 |
Patent application number | Description | Published |
20080221846 | Context-Aware, Adaptive Approach to Information Selection for Interactive Information Analysis - Improved information analysis techniques are disclosed. For example, a computer-implemented method of automatically assisting an analyst in a current information analysis task includes the following steps. An analytic context is modeled in a user-system cooperative manner, wherein the analytic context is a structure representative of user analytic actions and relationships associated therewith. At least a portion of the user-system cooperatively-modeled analytic context structure is utilized to adaptively gather information relevant to a current information analysis task. | 09-11-2008 |
20080306988 | Optimization-Based Visual Context Management - Improved visual context management techniques are disclosed. By way of example, a technique for updating an existing visual display to incorporate new information comprises obtaining new information requested by a subsequent user query, and dynamically deriving one or more visual transformations for updating at least a portion of the existing display to incorporate the new information, wherein the transformation derivation is modeled as an optimization operation which attempts to balance visual context management constraints and to achieve a desired presentation of intended information. | 12-11-2008 |
20090105984 | Methods and Apparatus for Dynamic Data Transformation for Visualization - Data transformation techniques are disclosed for use in such data visualization systems. For example, a method for dynamically deriving data transformations for optimized visualization based on data characteristics and given visualization type comprises the steps of obtaining raw data to be visualized and a visualization type to be used, and dynamically generating a list of data transformation operations that transform the raw input data to produce an optimized visualization for the given visualization type. | 04-23-2009 |
20100049686 | METHODS AND APPARATUS FOR VISUAL RECOMMENDATION BASED ON USER BEHAVIOR - Methods and apparatus are disclosed for dynamically recommending one or more visualizations for a given task based on user behavior, such as a user's interaction pattern with a current visualization. An alternate visualization type is provided to a user by observing actions of the user with a current visualization type; determining if one or more predefined action patterns is detected in the observed actions, wherein at least one of the predefined action patterns has a predefined associated alternate visualization type; and providing the alternate visualization type to the user when the associated predefined action pattern is detected. The one or more predefined action patterns may be defined by one or more rules or an example-based method. | 02-25-2010 |
20100205238 | METHODS AND APPARATUS FOR INTELLIGENT EXPLORATORY VISUALIZATION AND ANALYSIS - Methods and apparatus are provided for intelligent exploratory visualization and analysis. A semantics-based client-server application architecture is provided that enables interactive visualization and analysis applications over the web. From the client perspective, user activities are observed and the client determines if a sequence of user activities comprises one or more predefined semantics-based user actions. Semantics-based action descriptor are then sent to the server, optionally with any related parameters, and a response is then received from the server. From the server perspective, one or more semantics-based action descriptors are received from the client with an action type selected from a predefined set of types, wherein the semantics-based action descriptors are based on a sequence of activities of a user. The server processes the semantics-based action descriptors and sends a response to the client in response to the one or more semantics-based action descriptors. | 08-12-2010 |
20110270845 | Ranking Information Content Based on Performance Data of Prior Users of the Information Content - Methods and apparatus are provided for ranking information content based on performance data of prior users of the information content. Information content is ranked by receiving a search request specifying search criteria; identifying a preliminary document list by searching a corpus using the search criteria; identifying content elements in documents in the preliminary document list; assigning a value to at least one document in the preliminary document list based on a score for each content element in the at least one document, wherein the score is based on a performance measure of one or more related users that accessed one or more documents having a given content element; and providing search results based on the assigned values. The score can be assigned, for example, based on a regression model between the performance measure and one or more of the content elements and/or one or more social network metrics. The social network metrics can comprise, for example, graph entropy; outdegree; betweenness; network constraint and/or number of managers. The performance measure can comprise, for example, one or more of revenue generated by the related users and/or a performance rating of the related users. | 11-03-2011 |
20110271174 | Automatic Visual Preview of Non-Visual Data - Methods and systems are provided for automatic visual preview of non-visual data. A visual preview of non-visual data is generated by obtaining the non-visual data; obtaining metadata describing one or more semantic data types in the obtained non-visual data; selecting one or more visual metaphors for the obtained non-visual data based on the metadata; and generating the visual preview of the non-visual data using the one or more selected visual metaphors. As used herein, non-visual data does not have an established automatic method for generating a preview of the non-visual data. A user can optionally interact with the visual preview. | 11-03-2011 |
20120209871 | Automated Contextual Information Retrieval Based on Multi-Tiered User Modeling and Dynamic Retrieval Strategy - Automated contextual information retrieval techniques are provided based on multi-tiered user modeling and a dynamic retrieval strategy. Content relevant to a current message is presented by initially obtaining a multi-tiered user model containing a multi-tiered representation of interactions of a first user with each contact, wherein the multi-tiered representation includes a plurality of topic models each corresponding to interactions between the first user and one contact. The topic models contain a set of topics, each containing topic keywords. Context information is extracted based on content of the current message, a sender and/or a recipient of the current message, and the multi-tiered user model. A retrieval strategy is determined based on the extracted context information. Contextual queries are generated to search the information repositories selected based on the determined retrieval strategy. Content relevant to the current message is presented based on search results from the selected information repositories. | 08-16-2012 |
20120311030 | Inferring User Interests Using Social Network Correlation and Attribute Correlation - Methods and apparatus are provided for inferring user interests from both direct and indirect social neighbors. User interests are inferred from social neighbors by exploiting the correlation among multiple attributes of a user, in addition to the social correlation of an attribute among a group of users. Attributes of a user are inferred by obtaining an inferred set of attributes comprised of one or more attributes of social neighbors of the user. Thereafter, the inferred set is modified using a user attribute correlation model describing a probability that the attributes in the inferred set co-occur on the user and one or more of the social neighbors. An inference quality of the obtained attributes can optionally be obtained based on social network properties of the social neighbors. Interactions with the user and/or the social neighbors can be employed to solicit feedback to improve the one or more inferred attributes. | 12-06-2012 |
20140074524 | Method and System for Business Outcome-Based Personalized Ranking of Information Objects - Business outcome-based personalized ranking of information objects is provided. Information objects in outcome-based business processes are ranked by recording information objects generated during a creation of the outcome-based business processes. At least one business process comprises an outcome attribute, and at least one business process comprises in-process information objects. A composite graph is generated of the information objects and business processes. Each node in the graph corresponds to an information object or a business process. Links between two information object nodes have a strength based on a content similarity and a social network distance. The in-process information object node connects to a corresponding business process node, and two business process nodes have a link if they are indicated as related in the business process information system. The information objects are ranked based on the link strengths. | 03-13-2014 |
20140074525 | Method and System for Business Outcome-Based Personalized Ranking of Information Objects - Methods and apparatus are provided for business outcome-based personalized ranking of information objects. Information objects in outcome-based business processes are ranked by recording information objects generated during a creation of the outcome-based business processes. At least one business process comprises an outcome attribute, and at least one business process comprises in-process information objects. A composite graph is generated of the information objects and business processes. Each node in the graph corresponds to an information object or a business process. Links between two of the information object nodes have a strength based on a content similarity and a social network distance. The in-process information object node connects to a corresponding business process node, and two business process nodes have a link if they are indicated as related in the business process information system. The information objects are ranked based on the link strengths (for example, in response to a query for a given user and a given business process). | 03-13-2014 |
Patent application number | Description | Published |
20090009778 | Converting black to composite black in digital printing - A method of converting black to composite/process black in a digital color print engine. A lightness adjustment is employed for converting input image (O, O, O, K | 01-08-2009 |
20100195158 | Method of processing neutral gray color print jobs as monochrome black during billing detection and printing as a neutral gray composite black - A method of converting a RIPped K-only page or pixels to composite black in a digital print engine is included which executes the conversion process during current job workflow, while detecting the K-only page or pixels for billing purposes as K-only, and printed out as composite black. | 08-05-2010 |
20100214341 | COLOR PRINTING - A method of printing comprising setting a pixel black value of K for an ink limit and identifying each of black dots of a first subset of black dots having pixel black value K greater than the ink limit, and pixel color value of cyan, magenta, and yellow equal to zero. The method further comprises rendering only K for a pixel value for the first subset of black dots and replacing each of black dots of a second subset of black dots of a halftoned bit map for a predetermined area with a process black dot. The method still further comprises adding a non-black dot to each of black dots of a third subset of black dots of the bit-mapped data, wherein the halftoned bit map is generated by halftoning continuous tone data; wherein the black dots of the third subset comprises a percentage of all the black dots that tends to generally increase as a ratio of black coverage to total coverage in the predetermined area increases; wherein the first, second, and third subset comprises black dots that are mutually exclusive; and, printing the bit map. | 08-26-2010 |
20100271665 | ADJUSTING THE NEUTRAL BEHAVIOR OF A COLOR MARKING DEVICE - What is disclosed is a novel system and method for adjusting the gray balance of a multifunction color marking device in order to change the device's neutral behavior to a desired level of acceptability. The gray balance aim curve is specified by: L*, L*(aim), a*(aim) and b*(aim), where L*(aim)=f | 10-28-2010 |
20120293815 | METHOD OF PROCESSING NEUTRAL GRAY COLOR PRINT JOBS AS MONOCHROME BLACK DURING BILLING DETECTION AND PRINTING AS A NEUTRAL GRAY COMPOSITE BLACK - A method of converting a RIPped K-only page or pixels to composite black in a digital print engine is included which executes the conversion process during current job workflow, while detecting the K-only page or pixels for billing purposes as K-only, and printed out as composite black. | 11-22-2012 |
20140016140 | DOT GROWTH SYSTEM AND METHOD - The present disclosure relates to a method and system for processing isolated dots of an image to be printed by a printer. The method includes detecting whether pixels corresponding to an isolated dot in the image are in an on state. A first sum of pixels that are in an on state in a first pixel ring surrounding the pixels corresponding to the isolated dot when the pixels in the isolated dot are detected to be in the on state is determined. The first sum of pixels in the first pixel ring that are in the on state is compared with a first threshold sum. A first number of pixels in at least a second pixel ring either comprising of or surrounding the pixels corresponding to the isolated dot are turned on when the first sum of pixels in the on state is less than the first threshold sum. | 01-16-2014 |
20140016144 | METHOD AND SYSTEM FOR ISOLATED DOT DETECTION AND GROWTH IN A DOCUMENT IMAGE - A method for detecting and growing isolated dots in a document image having a plurality of pixels is provided. The method includes isolating the pixels of the image to form a plurality of windows, each window having a target pixel; detecting an isolated dot in the received image; identifying a dot growth factor to grow the detected isolated dot in the received image; using the dot growth factor to identify tiered pixel patterns from a plurality of predefined, tiered pixel patterns, wherein each of the tiered pixel patterns having a predetermined dot growth factor; comparing the pixels within each window to the pixel patterns within the identified tier to identify a match between the pixels within the window and at least one of the pixel patterns; and changing a pixel value of the target pixel, when a match is identified, to grow the isolated dot by the dot growth factor. | 01-16-2014 |
20140016145 | DOT GROWTH SYSTEM AND METHOD - The present disclosure relates to a method and system for processing isolated dots of an image to be printed by a printer. The method includes generating a random number, determining whether a target pixel is to be turned on and enabled for printing, determining a sum of pixels surrounding the target pixel in a plurality of pixels in a scanline of the image, the target pixel corresponding to an isolated dot in an input image, that are in an on state, the on state defined by a higher binary logic level relative to a binary logic level corresponding to a turned off pixel, determining a numerical value stored in a lookup table using the determined sum of pixels that are in the turned on state surrounding the target pixel as an index to the lookup table, and comparing the generated random number to the determined numerical value. | 01-16-2014 |
20140016146 | ISOLATED HOLE DETECTION AND GROWTH - The present disclosure relates to a method and system for processing isolated holes in an image to be printed or displayed. The method includes generating a random number lying in a finite range of numbers, determining whether a target pixel is to be turned off and enabled for printing as a hole, determining a sum of pixels surrounding a target pixel in a plurality of pixels in a scanline of the image, the target pixel corresponding to an isolated hole in an input image, that are in an on state, the on state defined by a higher binary logic level relative to a binary logic level corresponding to a turned off pixel, determining a numerical value stored in a lookup table in a memory unit coupled to the processor using the determined number of pixels that are in the turned on state surrounding the target pixel. | 01-16-2014 |
20140016157 | ISOLATED HOLE DETECTION AND GROWTH - The present disclosure relates to a method and system for processing isolated holes in an image to be printed or displayed. The method includes detecting whether pixels corresponding to an isolated hole in the image are in an off state, determining a sum of pixels that are in an on state in a first pixel ring surrounding the pixels corresponding to the isolated hole when the one or more pixels in the isolated hole are detected to be in the off state, comparing the sum of pixels in the pixel ring that are in the on state with a threshold sum, turning off a number of pixels in at least another pixel ring either comprising of or surrounding the pixels when the first sum of pixels in the on state is greater than the threshold sum, and outputting the isolated hole including the turned off first number of pixels. | 01-16-2014 |
20140016819 | METHOD AND SYSTEM FOR ISOLATED HOLE DETECTION AND GROWTH IN A DOCUMENT IMAGE - A method for detecting and growing isolated holes in a document image having a plurality of pixels is provided. The method includes isolating the pixels of the image to form a plurality of windows, each window having a target pixel; identifying a hole growth factor to grow an isolated hole in the received image; using the hole growth factor to identify tiered pixel patterns from a plurality of predefined, tiered pixel patterns, wherein each of the tiered pixel patterns having a predetermined hole growth factor; comparing the pixels within each window to the pixel patterns within the identified tier to identify a match between the pixels within the window and at least one of the pixel patterns; and changing a pixel value of the target pixel, when a match is identified, to grow the isolated hole by the hole growth factor. | 01-16-2014 |
20140049799 | SYSTEMS AND METHODS FOR DYNAMIC SHARPNESS CONTROL IN SYSTEM USING BINARY TO CONTINUOUS TONE CONVERSION - Embodiments relate to systems and methods for dynamic sharpness control in system using binary to continuous tone conversion. Image data can be processed in the image path of a copier, printer, or other device to enhance sharpness based on user settings. The image can originate in a high-resolution and/or high-color format. The user can select sharpness values to provide better rendered detail. A front-end high-pass 2D filter can be adjusted in response to the settings. A binarized version of the image data is produced in the downstream path. At the back of the image path, the image would conventionally be sent through a binary data to extended contone (BDEC) low-pass filter, set to a fixed level, to produce contone output, counteracting the user's sharpness settings. Instead of applying a fixed back-end filter, that stage can be dynamically adjusted to correspond to the user's sharpness settings, reducing the low-pass effect proportionately. | 02-20-2014 |
20140285856 | SYSTEM AND METHOD FOR COLOR CALIBRATION OF A COLOR PRINTING SYSTEM WITH RECORDING MEDIA BRIGHTNESS COMPENSATION - A method allows an end user to calibrate a color reproduction device with recording media brightness compensation. A color reproduction device includes a device for converting the native color values of the scanner into a device independent color space, a test target, the desired values of each patch of the test target and a printing device. The method includes printing the test target and scanning it with a scanner that forms a part of the color reproduction device. The device compares the desired values with the values obtained from scanning the printed test target to obtain a set of adjustment values to compensate for drift in the output of the color reproduction device. The compensation includes compensation for utilizing a recording media that does not have the same white characteristics as the recording media that was used to generate the scanner profile used in converting the scanner dependent color space values to a device independent color space values. | 09-25-2014 |
20140368886 | BLACK TRAPPING METHODS, APPARATUS AND SYSTEMS FOR BINARY IMAGES - Provided are black trapping methods, apparatus and systems for binary images. According to one exemplary method, black trapping color image data is performed by incorporating a set of trapping condition logical operations. Specifically, edge checking is based on estimated contone color values and density checking based on a binary bitmap. | 12-18-2014 |