Drew, CA
Adam Drew, Oceanside, CA US
Patent application number | Description | Published |
---|---|---|
20090001975 | APPARATUS AND METHOD FOR NON-SYMMETRIC MAGNETIC FIELD BALANCING IN AN INSPECTION SCANNER - An inspection system positions a balancing shim to asymmetrically balance a magnetic field generated by an inductive sensor, which forms part of the inspection system. Additionally, relays and capacitors used to tune the inductive sensor to a desired resonance frequency are geometrically arranged to minimize electrical interference generated by operation of the relays and capacitors. A shielding device, which may be formed on a printed circuit board, protects a magnetic field generated by the inductive sensor from external electromagnetic interference. A slot positioned in the inductive sensor may be used to tune a resonant mode of the inductive sensor to accurately and particularly detect metallic shanks and/or other metallic objects in shoes, socks, and/or clothing. | 01-01-2009 |
Adam J. Drew, Oceanside, CA US
Patent application number | Description | Published |
---|---|---|
20150058928 | APPLYING CIRCUIT DELAY-BASED PHYSICALLY UNCLONABLE FUNCTIONS (PUFS) FOR MASKING OPERATION OF MEMORY-BASED PUFS TO RESIST INVASIVE AND CLONE ATTACKS - One feature pertains to generating a unique identifier for an electronic device by combining static random access memory (SRAM) PUFs and circuit delay based PUFs (e.g., ring oscillator (RO) PUFs, arbiter PUFs, etc.). The circuit delay based PUFs may be used to conceal either a challenge to, and/or response from, the SRAM PUFs, thereby inhibiting an attacker from being able to clone a memory device's response. | 02-26-2015 |
Adam J. Drew, San Diego, CA US
Patent application number | Description | Published |
---|---|---|
20110238998 | METHOD AND APPARATUS FOR PORTABLE SELF-CONTAINED NODE COMPUTER - A portable self-contained node computer is provided. The portable self-contained node computer connects to a host computer. The host computer allows the portable node computer to access its peripheral input/output devices. | 09-29-2011 |
Adam John Drew, San Diego, CA US
Patent application number | Description | Published |
---|---|---|
20150101037 | PHYSICALLY UNCLONABLE FUNCTION PATTERN MATCHING FOR DEVICE IDENTIFICATION - A method is provided for using obtaining a reproducible device identifier from a physically unclonable function. An authentication device may receive a first physically unclonable function (PUF) dataset from the electronic device, the first PUF dataset including characteristic information generated from a physically unclonable function in the electronic device. The authentication device may then identify a pre-stored PUF dataset corresponding to the electronic device. Authentication of the electronic device may be performed by correlating the pre-stored PUF dataset and the first PUF dataset for the electronic device, wherein such correlation is based on a pattern or distribution correlation the pre-stored PUF dataset and the first PUF dataset. Because such correlation is performed on datasets, and not individual points, systematic variations can be recognized by the correlation operation leading to higher correlation than point-by-point comparisons. | 04-09-2015 |
Daniel Drew, Aliso Viejo, CA US
Patent application number | Description | Published |
---|---|---|
20090198769 | Virtual Application Server With Version Control - A management system for virtual applications may deploy sets of virtual applications to many client devices, dynamically allocate virtual application servers to individual clients, manage updates to the virtual applications, and provide other high level management to deployments of virtual applications. A client device may include a virtual application management client that may communicate with a management server. The management client may add or remove virtual applications to the client device based on a policy received from the management server, and may query the management server to determine a currently available virtual application distribution server when a virtual application is requested. The management server may distribute and manage versions of applications across one or more virtual application distribution servers. | 08-06-2009 |
20090199175 | Dynamic Allocation of Virtual Application Server - A management system for virtual applications may deploy sets of virtual applications to many client devices, dynamically allocate virtual application servers to individual clients, manage updates to the virtual applications, and provide other high level management to deployments of virtual applications. A client device may include a virtual application management client that may communicate with a management server. The management client may add or remove virtual applications to the client device based on a policy received from the management server, and may query the management server to determine a currently available virtual application distribution server when a virtual application is requested. The management server may distribute and manage versions of applications across one or more virtual application distribution servers. | 08-06-2009 |
20090199178 | Virtual Application Management - A management system for virtual applications may deploy sets of virtual applications to many client devices by defining and distributing policies. The polices may define which client devices and/or users may permitted to access a virtual application from a server and how the virtual application may be used. A client device may include a virtual application management client that may communicate with a management server to retrieve and implement the policies. The management client may add or remove virtual applications to the client device based on a policy received from the management server. In some embodiments, policies may also be distributed and implemented on a virtual application server. | 08-06-2009 |
Daniel N. Drew, Valencia, CA US
Patent application number | Description | Published |
---|---|---|
20110138375 | AUTOMATED STATE MIGRATION WHILE DEPLOYING AN OPERATING SYSTEM - Migration of a user state from a source computing device to a destination computing device using a state migration point (SMP) is disclosed. The destination computing device may be the same as the source computing device but with a different operating system. The user state is securely stored by the SMP until the user state is restored on the destination computing device or a predetermined period of time has elapsed. Additional SMPs can be added without an architectural change. SMPs can be used to simultaneously migrate the states of multiple users of the source computing device to multiple destination computing devices. The SMPs can be restricted to migrate only the user states of computing devices with particular IP subnets. The SMPs can retain user states for a period of time after restoration in order to provide a backup, if necessary. | 06-09-2011 |
James Drew, Redwood City, CA US
Patent application number | Description | Published |
---|---|---|
20080221949 | System and Method for Updating Forecast Model - A method for updating a forecast model is disclosed. The forecast model includes parameters that receives collected data representing historical dependent and causal data. The collected data are in different units of measure from one another. Based on the collected data, the forecast model is applied to determine a total error value from a calculation performed on the parameters in the forecast model. To update the forecast model, additional parameters are added, existing parameters are modified, or parameters are removed from the forecast model to determine a modified total error value. The modified total error value is then compared to the original total error value. The parameters are also converted to normalized values to be in a common unit of measure to facilitate the application of the forecast model to determine a total error value. | 09-11-2008 |
James Frederic Drew, Redwood City, CA US
Patent application number | Description | Published |
---|---|---|
20100114625 | METHOD AND APPARATUS FOR CREATING A CONSISTENT HIERARCHY OF DECOMPOSITION OF A BUSINESS METRIC - Methods and apparatuses for computing a variance between two business metrics is described. In one embodiment, the method computes a variance for each of a first set of activities based on the corresponding reference state of that activity, wherein the variance for an activity is the change in contribution for that activity between the first and second business metrics and with each of the first set of activities having a reference value. Furthermore, the method computes a variance for each of a second set of activities based on the corresponding start and end values of that activity with each of the second set of activities having a start and end value. | 05-06-2010 |
20100114637 | METHOD AND APPARATUS FOR CREATING DUE-TO REPORTS FOR ACTIVITIES THAT MAY NOT HAVE REFERENCE VALUE - Methods and apparatuses for computing a variance for the difference between two business metrics. In one embodiment, the method accesses a response model and a plurality of activities with start and end values for each of the plurality of activities. Furthermore, the method computes a variance for the difference between the first and second business metrics for each of the plurality of activities using the response model by setting that activity to one of the corresponding starting and ending values and setting others of the plurality of activities to the value state opposite of that activity, wherein the variance for an activity is the change in contribution for that activity between the start and end sales volumes. | 05-06-2010 |
20100114657 | METHOD AND APPARATUS FOR CONFIGURABLE MODEL-INDEPENDENT DECOMPOSITION OF A BUSINESS METRIC - Methods and apparatuses for decomposing a business metric based on a plurality of activities and a response model are described. In one embodiment, the method accesses the response model and the plurality of activities, the plurality of activities each having a reference and executed value. The method computes a contribution to the business metric based on setting one of the plurality of activities to one of the corresponding reference and executed value and setting the other activities to the value state opposite of that activity. Furthermore, the method computes each of the contributions independent of the response model type. | 05-06-2010 |
20100114658 | METHOD AND APPARATUS FOR CREATING A CONSISTENT HIERARCHY OF DECOMPOSITION OF A BUSINESS METRIC - Methods and apparatuses for computing an atomic decomposition level and a set of different decomposition levels based on the atomic decomposition level for a business metric are described. In one embodiment, the method accesses a response model and a first plurality of activities that are used to compute an atomic decomposition level. The atomic decomposition level is a base level of the set of different decomposition levels using different pluralities of activities. Furthermore, the set of different decompositions is consistent with the atomic decomposition level. | 05-06-2010 |
Julie W. Drew, Palo Alto, CA US
Patent application number | Description | Published |
---|---|---|
20090024624 | Determining top combinations of items to present to a user - Embodiments of the present invention pertain to determining top combinations of items to present to a user. According to one embodiment, data that includes information describing a plurality of combinations of records is accessed. Each record describes a plurality of items. The data is analyzed using a branch and bound search procedure to determine top combinations of items based on a specified metric and a specified number. According to one embodiment, the metric is value enabled and the specified number determines how many combinations of items are associated with the top combinations of items. | 01-22-2009 |
Julie W. Drew, Redwood City, CA US
Patent application number | Description | Published |
---|---|---|
20090024407 | Indicating which of forecasting models at different aggregation levels has a better forecast quality - To perform forecasting, a first data collection having data values at first intervals is received, and a first forecasting model is built based on the first data collection. A second forecasting model is built based on a second data collection having intervals aggregated from intervals of the first data collection, wherein the second forecasting model is at a different aggregation level than the first forecasting model. At least one metric is computed by performing at least one test based on at least one of the first and second data collections to indicate which of the first and second forecasting models has a better forecast quality. | 01-22-2009 |
Stanley Ian Drew, Encino, CA US
Patent application number | Description | Published |
---|---|---|
20130179250 | Digital coupon redemption - A method for the simultaneous redemption and crediting of a product or service discount coupon, wherein a coupon's digital bar code is provided at the point of redemption, the digital bar code information bundled with purchase/redemption information generated at the point-of-sale, and the bundled information electronically transmitted to the coupon sponsor for instant validation and merchant compensation. | 07-11-2013 |