Patent application number | Description | Published |
20120323631 | SYSTEMS AND METHODS FOR TRACKING INDUSTRY SPEND - Various systems and methods for tracking industry spend are provided herein in various embodiments. A method if provided comprising summing consumer spend with a first company over a time period to yield a raw consumer spend, wherein the consumer spend is derived from internal data, extrapolating an estimated consumer spend with the first company using the raw consumer spend for the first company and the internal data, and estimating, by the processor, top line revenue for the first company using the estimated consumer spend. | 12-20-2012 |
20120323632 | SYSTEMS AND METHODS FOR TRACKING INDUSTRY SPEND - Various systems and methods for tracking industry spend are provided herein in various embodiments. A method if provided comprising summing consumer spend with a first company over a time period to yield a raw consumer spend, wherein the consumer spend is derived from internal data, extrapolating an estimated consumer spend with the first company using the raw consumer spend for the first company and the internal data, and estimating, by the processor, top line revenue for the first company using the estimated consumer spend. | 12-20-2012 |
20130036004 | SYSTEMS AND METHODS FOR DETERMINING AD IMPRESSION UTILITY - Various systems and methods for measuring ad impression effectiveness are provided. A method is provided comprising selecting, by an ad impression processor, a target consumer for an ad impression, delivering the ad impression to the target consumer, determining, by the processor, a behavior of the target consumer after a time period elapses, wherein the determining comprises analyzing internal data relating to the target consumer. | 02-07-2013 |
20130036014 | SYSTEMS AND METHODS FOR DETERMINING AD IMPRESSION UTILITY - Various systems and methods for measuring ad impression effectiveness are provided. A method is provided comprising selecting, by an ad impression processor, a target consumer for an ad impression, delivering the ad impression to the target consumer, determining, by the processor, a behavior of the target consumer after a time period elapses, wherein the determining comprises analyzing internal data relating to the target consumer. | 02-07-2013 |
20130036015 | SYSTEMS AND METHODS FOR DETERMINING AD IMPRESSION UTILITY - Various systems and methods for measuring ad impression effectiveness are provided. A method is provided comprising selecting, by an ad impression processor, a target consumer for an ad impression, delivering the ad impression to the target consumer, determining, by the processor, a behavior of the target consumer after a time period elapses, wherein the determining comprises analyzing internal data relating to the target consumer. | 02-07-2013 |
Patent application number | Description | Published |
20080256180 | USE OF HARDWARE TO MANAGE DEPENDENCIES BETWEEN GROUPS OF NETWORK DATA PACKETS - A task obtained by a communications processor is decomposed into one or more requests that form a request group. The requests of the request group are sent to main memory and responses to those requests are expected. There may be requests for a plurality of request groups being processed concurrently. However, responses to the request groups are to be returned to the communications processor in the order in which the request groups were sent from the communications processor. To ensure this ordering, dependencies between the request groups are tracked by hardware coupled to the communications processor. | 10-16-2008 |
20100008251 | EFFICIENT PROBABILISTIC DUPLICATE PACKET DETECTOR IN COMPUTER NETWORKS - In order to solve the problem of the detection of the arrival of duplicate data packets in an interconnected, multinode data processing system, each data packet is provided with a field of r bits that are randomly generated for each data packet. However, one of the packets is provided with a field that is computed from the other randomly generated field entries in a checksum computation which yields a selected nonzero checksum value. A running checksum at the receiver is used to determine whether or not, after the receipt of the specified number, k, of data packets, a duplicate packet has been received. | 01-14-2010 |
20100179989 | USE OF HARDWARE TO MANAGE DEPENDENCIES BETWEEN GROUPS OF NETWORK DATA PACKETS - A task obtained by a communications processor is decomposed into one or more requests that form a request group. The requests of the request group are sent to main memory and responses to those requests are expected. There may be requests for a plurality of request groups being processed concurrently. However, responses to the request groups are to be returned to the communications processor in the order in which the request groups were sent from the communications processor. To ensure this ordering, dependencies between the request groups are tracked by hardware coupled to the communications processor. | 07-15-2010 |
20120304040 | CHECKSUM CALCULATION, PREDICTION AND VALIDATION - A checksum calculation, prediction and validation system includes a host system, a network interface, a reception pipeline disposed between the host system and network interface and configured to calculate an expected full checksum related to packets received in the host system and a transmission pipeline disposed between the host system and network interface and configured calculate factors related to packets for transmission on the network interface. | 11-29-2012 |
20120311110 | RE-PROGRAMMING PROGRAMMABLE HARDWARE DEVICES WITHOUT SYSTEM DOWNTIME - Programmable hardware devices are re-programmed without system downtime. To re-program the device, the device is quiesced, state associated with the device is saved, updates are loaded, the state is restored and operations are resumed, all transparent to the system, except for a possible delay in the system. | 12-06-2012 |
20120311112 | RE-PROGRAMMING PROGRAMMABLE HARDWARE DEVICES WITHOUT SYSTEM DOWNTIME - Programmable hardware devices are re-programmed without system downtime. To re-program the device, the device is quiesced, state associated with the device is saved, updates are loaded, the state is restored and operations are resumed, all transparent to the system, except for a possible delay in the system. | 12-06-2012 |
20120311199 | FIBRE CHANNEL INPUT/OUTPUT DATA ROUTING INCLUDING DISCARDING OF DATA TRANSFER REQUESTS IN RESPONSE TO ERROR DETECTION - A computer program product is provided for performing input/output (I/O) processing. The computer program product is configured to perform: generating and storing in local channel memory at least one address control word (ACW) specifying one or more host memory locations for data transfer and including a data discard field; generating an address control structure specifying a local channel memory location of a corresponding ACW; receiving one or more data transfer requests from a network interface that each corresponding address control structure information; accessing an ACW and routing the data transfer request to a host memory location specified in the ACW; and responsive to encountering an error during at least one of the accessing and the routing, discarding the one or more data transfer requests and setting the data discard field to a value configured to instruct a channel to discard any subsequent data transfer requests associated with the ACW. | 12-06-2012 |
20120311212 | AVOIDING NON-POSTED REQUEST DEADLOCKS IN DEVICES - Processing within a device is controlled in order to avoid a deadlock situation. A local request engine of the device determines prior to making a request whether the port of the device that is to service the request is making forward progress in processing other requests. If forward progress is being made, then the request is forwarded to the port. Otherwise, the request is held. This avoids a deadlock situation and allows the device to remain operative even in partial recovery situations. | 12-06-2012 |
20120311213 | AVOIDING NON-POSTED REQUEST DEADLOCKS IN DEVICES - Processing within a device is controlled in order to avoid a deadlock situation. A local request engine of the device determines prior to making a request whether the port of the device that is to service the request is making forward progress in processing other requests. If forward progress is being made, then the request is forwarded to the port. Otherwise, the request is held. This avoids a deadlock situation and allows the device to remain operative even in partial recovery situations. | 12-06-2012 |
20130042168 | CHECKSUM CALCULATION, PREDICTION AND VALIDATION - A calculation, prediction and validation method can include receiving a portion of a data packet in a data buffer, computing, in a processor, information related to the checksum of the data packet based on the portion of the data packet and processing the data packet in the processor. | 02-14-2013 |
20140047307 | CHECKSUM CALCULATION, PREDICTION AND VALIDATION - A calculation, prediction and validation method can include receiving a portion of a data packet in a data buffer, computing, in a processor, information related to the checksum of the data packet based on the portion of the data packet and processing the data packet in the processor. | 02-13-2014 |
Patent application number | Description | Published |
20100027735 | RAM BASED IMPLEMENTATION FOR SCALABLE, RELIABLE HIGH SPEED EVENT COUNTERS - There is broadly contemplated herein an arrangement whereby each event source feeds a small dedicated “pre-counter” while an actual count is kept in a 64-bit wide RAM. Such an implementation preferably may involve a state machine that simply sweeps through the pre-counters, in a predetermined fixed order. Preferably, the state machine will access each pre-counter, add the value from the pre-counter to a corresponding RAM location, and then clear the pre-counter. Accordingly, the pre-counters merely have to be wide enough such that even at a maximal event rate, the pre-counter will not be able to wrap (i.e., reach capacity or overflow) before the “sweeper” state machine accesses the pre-counter. | 02-04-2010 |
20130170605 | RAM Based Implementation for Scalable, Reliable High Speed Event Counters - There is broadly contemplated herein an arrangement whereby each event source feeds a small dedicated “pre-counter” while an actual count is kept in a 64-bit wide RAM. Such an implementation preferably may involve a state machine that simply sweeps through the pre-counters, in a predetermined fixed order. Preferably, the state machine will access each pre-counter, add the value from the pre-counter to a corresponding RAM location, and then clear the pre-counter. Accordingly, the pre-counters merely have to be wide enough such that even at a maximal event rate, the pre-counter will not be able to wrap (i.e., reach capacity or overflow) before the “sweeper” state machine accesses the pre-counter. | 07-04-2013 |
Patent application number | Description | Published |
20090252902 | Multi-Layer Slip Film for Printing and Lamination Processes - A heat sealable, multi-layer film structure for multi-color printing or lamination processes and method for making the same are provided. The multi-layer film structure may include a core layer comprising a thermoplastic polymer and essentially no migratory slip agents; a functional layer on a first side of the core layer, wherein the functional layer is a printable layer or a laminatable layer; and a heat sealable skin layer on a second side of the core layer, the heat sealable skin layer comprising a thermoplastic polymer and a slip system. The multi-layer film structure is prepared without any migratory slip additives. Without migratory slip additives, the multi-layer film structure exhibits excellent machinability on typical packaging equipment. | 10-08-2009 |
20090291284 | Polypropylene-Based Shrink Films - In one aspect is provided a film, a shrink sleeve film in a particular embodiment, comprising at least one core layer, one skin layer, and optionally one tie layer between the two, wherein the core comprises from 0 to 30 wt % polypropylene by weight of the core layer, and from 70 to 100 wt % of a random propylene-α-olefin copolymer having within the range of from 1 to 10 wt % α-olefins, the α-olefin selected from the group consisting of ethylene and C | 11-26-2009 |
20130212983 | Multi-Layer Films Having Improved Sealing Properties - Multi-layer laminated structures are disclosed. Such structures include a multi-layer polymeric film having a Layer A that includes at least one polymer and a polymeric sealant layer adjacent to Layer A. The sealant layer has a surface roughness, Ra>5.0 and a Peak Count Value, Pc>50.0. The multi-layer laminated structures also include a substrate in surface contact with the multi-layer polymeric film, typically opposite the sealant layer. Such structures have a top seal and/or side seal of the polymeric sealant layer to itself has a seal strength of >5.00×10 | 08-22-2013 |
20130323513 | Metalizable Oriented Polypropylene Films With A Functionalized Tie Layer Material - Described is a multi-layered film comprising a core layer comprising polypropylene; a metalizable skin layer such as a treated HDPE or PETG; and a first tie layer comprising a functionalized polypropylene such as an acid-grafted isotactic polypropylene between the core layer and metalizable skin layer; wherein the metalizable skin layer comprises a polymer having a surface energy (ASTM D2578) of at least 30 dynes/cm, a Young's Modulus (ASTM D790) of at least 1500 MPa, and a melting point (ASTM D3418) of at least 130° C.; and wherein the film as measured on the metalizable skin side has a Haze of less than 1000 Haze Units, and a Gloss of greater than 300 Gloss Units. | 12-05-2013 |
20140037887 | Printable Polypropylene Slip Film and Laminate Packaging - A flexible, low haze multi-layer film comprising a print skin layer; a slip skin layer comprising from 0.5 wt % to 10 wt % of a surface cross-linked oil or gum polyalkylsiloxane; and a core layer comprising polypropylene between the skin layers; wherein the oily polyalkylsiloxane may have a viscosity within the range of from 10,000 to 100,000 cSt (25° C.) when not cross-linked; or wherein the gum polyalkylsiloxane may have a viscosity within the range of from 1,000,000 to 50,000,000 cSt (25° C.) when not cross-linked. Such multi-layered film can be adhered on the print skin layer side to an adhesive substrate, wherein the adhesive substrate comprises a cold seal adhesive opposite the multi-layer film to form a laminate packaging. | 02-06-2014 |
Patent application number | Description | Published |
20080288501 | Integrating Database Functionality with Workload Schedulers - A relational database trigger that accesses a distributed database table is initially created. This relational database trigger is defined prior to executing a first set of instructions, which are designed to be executed by a local first computer. The first set of instructions is executed until the relational database trigger is encountered, which causes a distributed database table to be accessed. Using information from the distributed database table, a dummy file is transmitted to a remote second computer. In response to the remote second computer receiving the dummy file, a scheduler searches the specific file location on the remote second computer for the dummy file. If the scheduler detects the dummy file at the specific file location, the remote second computer initiates execution of the second set of instructions. | 11-20-2008 |
20080319998 | SYSTEM AND METHOD FOR DYNAMIC AUTHORIZATION TO DATABASE OBJECTS - The present invention provides a system and method allows a user to add a parameter at the end of the GRANT statement that would not require multiple changes by the DBA. The parameter may indicate that the user only needs to have access for 2 days, or to have access when a flag is set in the database. This reduces the frequency that a DBA needs to be engaged and decreases the cycle time that is necessary to turn the request around. An additional benefit is that the authority is removed when it should be. This then also improves the business controls around the data. | 12-25-2008 |
20090049022 | Swapping Multiple Object Aliases in a Database System - A novel Structure Query Language (SQL) command globally swaps multiple alias names for multiple objects in a database management system. | 02-19-2009 |
20130110881 | SINGLE COMMAND DATA WAREHOUSE TABLE UPDATE | 05-02-2013 |
20130246340 | SINGLE COMMAND DATA WAREHOUSE TABLE UPDATE - Information warehouse table data is updated through a full outer join between warehouse tables and source tables in response to a single query language command statement of a relational database computer language. The single command statement comprises table mapping instructions for updating the warehouse tables that define matching conditions, delete instructions, archive instructions, and update instructions. The full outer join inserts rows in the warehouse tables for source table data rows that do not have corresponding matching rows in the warehouse table. Data rows in the warehouse tables without corresponding matching source table rows are deleted if a value of a parameter in the warehouse table system is set to delete; updated if the parameter is update; and updated with archive values and a new table row inserted with existing values if the parameter is archive. | 09-19-2013 |
20150227561 | MANAGING DATABASE CLUSTERING INDICES - A computer manages entries into a clustered index. The computer handles one or more commands, wherein each command loads a dataset into a database. The computer queries a database system catalog of the database for a target index, wherein the database system catalog contains a list of indices of the dataset in the form of metadata. The computer disables a parallel loading process for the dataset. The computer loads the dataset into the target index, wherein the dataset is sorted according to the target index. | 08-13-2015 |
20150242476 | UPDATING DATABASE STATISTICS WITH DYNAMIC PROFILES - Embodiments of the present invention disclose a method, computer program product, and system for updating database statistics using profiles. A computer determines whether an application credential has authority to update a database statistic of a target database, based, at least in part, on a profile. Responsive to determining that the application credential has authority to update the database statistic, the computer loads the transformed data into the target database. The computer determines whether an update to the statistic is to be performed. Responsive to a determination that the update to the statistic is to be performed, the computer generates a profile name. The computer determines whether the generated profile name exists within a system catalog of the target database. Responsive to a determination that the generated profile name exists, the computer transmits a command to update the database statistic of the target database using the generated profile name. | 08-27-2015 |
20150295878 | NOTIFICATION OF ELECTRONIC CONVERSATION - A computer system identifies an electronic conversation between a plurality of participants. The computer system identifies the plurality of participants. The computer system determines whether the plurality of participants match a specific list of participants that have been predetermined to be of interest to a user. In response to determining that the plurality of participants engaged in the electronic conversation matches the predetermined list of participants of interest to the user, the computer system notifies the user of the electronic conversation. | 10-15-2015 |
20150370871 | ETL TOOL INTERFACE FOR REMOTE MAINFRAMES - Embodiments of the present invention disclose a method for remote job submission. A computer receives a first job of a job stream. If the first job accesses a mainframe operating system, then the computer retrieves at least a return code threshold for the first job from a data store. If an option to build job control language is selected for the first job, then the computer generates job control language for the first job. The computer submits the first job to a job reader on the mainframe operating system using a file transfer protocol. The computer parses a retrieved output file to determine a return code for the first job. | 12-24-2015 |
20160070745 | INDEX SUSPENSION PRIOR TO DATABASE UPDATE - Embodiments of the present invention disclose a method, a computer program product, and a computer system for suspending and activating a database index. A computer determines a quantity of changes for a number of rows of a database that are to be made by an update of the database. The computer determines whether to suspend an index of the database based, at least in part, on a comparison between the quantity of changes and a pre-determined threshold value. The computer suspends the index of the database based on a result of the comparison that indicates the quantity of changes at least meet the pre-determined threshold value. A suspension of the index of the database initiates a rebuilding of the index. | 03-10-2016 |
20160070746 | AUTOMATED SUSPENSION AND REBUILDING OF DATABASE INDICES - Embodiments of the present invention disclose a method, computer program product, and a computer system for suspending a database index. A computer determines if an update to a database includes an update to an index of the database. If so, the computer suspending the index of the database, wherein the suspending the index of the database comprises: the computer deleting the index of the database; the computer retaining a definition for the index of the database, wherein the definition includes a command for rebuilding the index of the database; and the computer indicating in a system catalog of the database that a status of suspension has been applied to the index. | 03-10-2016 |
Patent application number | Description | Published |
20110246503 | High-Performance Streaming Dictionary - A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. | 10-06-2011 |
20150347477 | Streaming File System - An indexing system and method for a filesystem, such as a database using the POSIX application programming interface, uses two fractal tree indices, a metadata index mapping the full pathname of files to file metadata, preferably data such as returned with a struct stat call, and a data index mapping pathname and block number to a datablock of a predetermined size, optionally a fixed size. The data index has keys ordered lexicographically, and the system and method allows for modifying existing keys, and creating new keys if there is no existing key, for writes smaller than the predetermined block size and for unaligned writes. The invention provides at least about an order of magnitude improvement in microdata operations (such as creating and scanning files smaller than a predetermined size, such as 512-byte files), and has write times comparable with existing file systems. | 12-03-2015 |
20150370860 | High-Performance Streaming Dictionary - A method, apparatus and computer program product for storing data in a disk storage system is presented. A high-performance dictionary data structure is defined. The dictionary data structure is stored on a disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure. Updates run faster than one insertion per disk-head movement. The structure can also be stored on any system with two or more levels of memory. The dictionary is high performance and supports with full transactional semantics, concurrent access from multiple transactions, and logging and recovery. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. | 12-24-2015 |
Patent application number | Description | Published |
20080307181 | Disk-Resident Streaming Dictionary - A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging. | 12-11-2008 |
20120254253 | Disk-Resident Streaming Dictionary - A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging. | 10-04-2012 |
Patent application number | Description | Published |
20130018669 | System for Managing and Messaging Critical Student Information - A system for managing critical student information is disclosed generally comprising storing information associated with individual students, such as important medical information or contact information for the student's parent or guardian, and providing different authorized users, such as school administrators, teachers, or coaches, permission to access the information and/or send messages for particular students. The stored information for each student is associated with one or more group identifiers, which identify particular groups of which the student is a member, such as a school or team, and each authorized user is likewise associated with one or more group identifiers, which identify the particular groups for which the user has access and can send messages. | 01-17-2013 |
20150304300 | METHOD FOR AT LEAST ONE SUBMITTER TO COMMUNICATE SENSITIVE INCIDENT INFORMATION AND LOCATIONS TO RECEIVERS - The present invention relates to a method for sending, receiving, reporting and/or responding to mood related, time-sensitive, live situation, and/or secretive matter messages, through a one-step submission, and/or Smart Button activation anonymous submit process and/or targeted authorized receipt process, having the generating, assigning, and utilizing of unique identifiers and corresponding actionable and searchable administrative report generating process. More specifically, the invention relates to a method for permitting submitter(s) to choose the degree of anonymity and/or submit information/content and/or location and send that information/content and/or location, by means of a user interface, Smart Button, or other computer, mobile device, mobile phone, smart pad, electronic device, input device, communication device, touchscreen computing device, smart device, or tablet to provide an activated application and open a log-in screen to authorized receiver(s) who may access such information/content, which can be encrypted, in whole or in part, and act, report, forward or respond accordingly. | 10-22-2015 |
Patent application number | Description | Published |
20110093117 | METHODS AND SYSTEMS FOR MAIL FORWARDING AND SPECIAL HANDLING SERVICES - Improved methods and systems for mail forwarding and special handling services include processing mail in a single pass or in multiple passes (i.e., online or offline). The methods and systems can include one or more of a scannable symbol, an extra appended post code digit, a dedicated database field, separate table indexed by a control number, a logically separate database, or a database hosted on a separate server for use in identifying mail pieces needing special handling and retrieving special handling information, for example forwarding address text for such mail pieces. | 04-21-2011 |
20110213491 | SYSTEMS AND METHODS FOR MAIL FORWARDING AND SPECIAL HANDLING SERVICES - Methods and systems for mail forwarding and special handling services are disclosed. The methods and systems can include processing mail in a single pass or in multiple passes (i.e., online or offline). The methods and systems can include one or more of a scannable symbol, an extra appended post code digit, a dedicated database field, separate table indexed by a control number, a logically separate database, or a database hosted on a separate server for use in identifying mail pieces needing special handling and retrieving special handling information, for example forwarding address text for such mail pieces. | 09-01-2011 |