Parees
Benjamin M. Parees, Durham, NC US
Patent application number | Description | Published |
---|---|---|
20090313696 | CALCULATING A PASSWORD STRENGTH SCORE BASED UPON CHARACTER PROXIMITY AND RELATIVE POSITION UPON AN INPUT DEVICE - A solution for computing password strength based upon layout positions of input mechanisms of an input device that entered a password. A password including an ordered sequence of at least two characters can be identified. A position of each of the characters of the sequence can be determined relative to a layout of an input device used for password entry. Each position can correspond to an input region (key) of the input device (keyboard). A proximity algorithm can generate a proximately score for the determined positions based upon a pattern produced by the positions given the layout of the input device. A password strength score can be computed based at least in part upon the proximity score. | 12-17-2009 |
20100031362 | SYSTEM AND METHOD FOR IDENTIFICATION AND BLOCKING OF MALICIOUS USE OF SERVERS - A system and method to protect web applications from malicious attacks and, in particular, a system and method for identification and blocking of malicious DNS servers. The system includes a central processing unit and first program instructions. The first program instructions identify a rogue Domain Name Service (DNS) by identifying that a DNS metric is outside a historical limit. The first program instructions are stored on the computer system for execution by the central processing unit. | 02-04-2010 |
20130138891 | ALLOCATION ENFORCEMENT IN A MULTI-TENANT CACHE MECHANISM - Systems and methods for cache optimization are provided. The method comprises monitoring cache access rate for a plurality of cache tenants sharing same cache mechanism having an amount of data storage space, wherein a first cache tenant having a first cache size is allocated a first cache space within the data storage space, and wherein a second cache tenant having a second cache size is allocated a second cache space within the data storage space. The method further comprises determining cache profiles for at least the first cache tenant and the second cache tenant according to data collected during the monitoring; analyzing the cache profiles for the plurality of cache tenants to determine an expected cache usage model for the cache mechanism; and analyzing the cache usage model and factors related to cache efficiency or performance for the one or more cache tenants to dictate one or more occupancy constraints. | 05-30-2013 |
Benjamin Michael Parees, Raleigh, NC US
Patent application number | Description | Published |
---|---|---|
20090122652 | Apparatus and Method for Handling Calendar Dates in a Non-Calendar System Specific Manner - A method for displaying events in a plurality of calendar systems. The Custom Calendar System Program (CCSP) herein allows a user to create a custom calendar system by changing the length and names of the year, month, week, or day of any calendar system. The Event Conversion Program (ECP) herein translates the date for an event into a generic date and stores the event with the generic date. When the user changes the displayed time period or calendar system, the Display Program (DP) herein displays the new calendar system and/or time period and determines which events occur on the displayed time period. The DP translates only the events which occur in the displayed time period into the displayed calendar system dates and displays those events on the displayed calendar. A date caching file allows the invention to minimize the number of translation calculations. | 05-14-2009 |
Benjamin Michael Parees, Durham, NC US
Patent application number | Description | Published |
---|---|---|
20090083337 | PERFORMING SYNCHRONIZATION AMONG RELATIONAL DATABASE TABLES WITH MINIMAL CONTENTION - A method, system and computer program product for performing synchronization between source and target tables. An external data source inserts a new row in a first table as it modifies or creates a row in the source table where each new row in the first table includes a primary key value associated with the modified/created row in the source table. An application copies the distinct values for the primary keys listed in the first table and inserts them in a second table. The application performs uncommitted read operations on the source table for each row corresponding to the primary key values stored in the second table. The application inserts the data read into the corresponding rows of the target table. In this manner, a platform agnostic application may be able to synchronize the relational source and target tables in an efficient manner while minimizing the contention at the source table. | 03-26-2009 |
20090083341 | ENSURING THAT THE ARCHIVAL DATA DELETED IN RELATIONAL SOURCE TABLE IS ALREADY STORED IN RELATIONAL TARGET TABLE - A method, system and computer program product for ensuring that archival data deleted in a source table is already stored in a target table. An external data source sets a flag in the first table to identify the row in the source table to be deleted. An application sets a flag in a second table for each row of the source table that is marked to be deleted according to the first table. The application performs uncommitted read operations on the source table for each row corresponding to the distinct primary key values stored in the first table. The application inserts the data read into the corresponding rows of the target table. The application deletes the rows in the source table indicated to be deleted by the second table. In this manner, the archival data deleted from the source table is ensured to already be stored in the target table. | 03-26-2009 |
20120317339 | SYSTEM AND METHOD FOR CACHING DATA IN MEMORY AND ON DISK - A cache is configured as a hybrid disk-overflow system in which data sets generated by applications running in a distributed computing system are stored in a fast access memory portion of cache, e.g., in random access memory and are moved to a slower access memory portion of cache, e.g., persistent durable memory such as a solid state disk. Each data set includes application-defined key data and bulk data. The bulk data are moved to slab-allocated slower access memory while the key data are maintained in fast access memory. A pointer to the location within the slower access memory containing the bulk data is stored in the fast access memory in association with the key data. Applications call data sets within the cache using the key data, and the pointers facilitate access, management and manipulation of the associated bulk data. Access, management and manipulation occur asynchronously with the application calls. | 12-13-2012 |