doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 12
21.5k
|
|---|---|---|---|
5500808 | 08409627 | 1 | 1. A computer implemented process for generating a time delay simulator that uses a characteristic of a logic node in an unmapped logic network to a delay time in mapped and optimized logic network in a specified target technology, said mapped and optimized logic network corresponding to said logic node in said unapped logic network, wherein the characteristic is represented by a value, said process comprising the steps of: (a) selecting a target technology having a library of standard gates; (b) selecting a mapping and optimization method; (c) selecting a representative logic function; (d) generating a multiplicity of sample unmapped logic having a selected range of values of said characteristic using said representative logic function; (e) mapping and optimizing each of said sample logic nodes for speed using said library of standard gates with said mapping and optimization method thereby producing a multiplicity of mapped and optimized sample logic networks; (f) determining delay time for each of said multiplicity of mapped and optimized sample logic networks thereby generating data including the delay time in said mapped and optimized sample logic network for each value of said characteristic chosen in step (d); and (g) using said data to generate a means for simulating a delay time associated with the mapped logic network corresponding to said logic node in said unmapped logic network, given the value of said characteristic of said logic node, wherein said means for simulating is the time delay simulator and does not require generation of a mapped and optimized logic network to simulate said delay time. |
20040010796 | 10256613 | 0 | 1. An adaptive content platform comprising: one or more content-enabled, dependent applications, each of which includes a user interface and business logic; and a services layer, interfaced with the one or more content-enabled dependent applications and a software infrastructure, for providing one or more services that are usable by the content-enabled, dependent applications. |
20130151650 | 13762129 | 0 | 1. A system for generating cookie signatures in a device comprising a plurality of cores, the system comprising: a device intermediary to a plurality of clients and one or more servers, the device comprising a plurality of cores; a shared memory, accessible by each of the plurality of cores, for storing and accessing a random seed; a timer to signal regeneration of cookie signatures based on the random seed, the time expiring responsive to a predetermined time period; wherein the device is configured to store a new random seed generated responsive to each expiration of the cookie timer; and wherein each core of the plurality of cores is configured to generate one or more cookie signatures based on the random seed obtained from the shared memory. |
9984127 | 14151462 | 1 | 1. An automated method for improving search results in consideration of emphasized content comprising: prior to delivery to a user, intercepting natural language results from a search performed using a natural language query; detecting, by one or more processors, a natural language in which the results are expressed; retrieving according to the detected natural language, by the one or more processors, from a database, a cultural rule indicating how emphasis of words and sub-phrases is made using a shift from a default text typestyle to an emphasized text typestyle, wherein the shift occurs for one or more words in a phrase and the phrase is otherwise encoded in the default text typestyle, and wherein the emphasized text typestyle is selected from the group consisting of bolding, underlining, strikethrough, color and italicization; finding, by the one or more processors, using the cultural rule, one or more emphasized words in the results; assigning, the one or more processors, confidence scores to each result according to occurrences of found emphasized words relevant to the query; re-ranking, by the one or more processors, the results according to an initial relevance and according to the confidence scores; and producing, by the one or more processors, to the user, the re-ranked results. |
20120136647 | 13310879 | 0 | 1. A machine translation apparatus comprising: a technical term dictionary configured to store terms of a first language and a translated term of a second language corresponding to each term; a translation memory configured to store source sentences of the first language and a target sentence of the second language corresponding to each source sentence; a translation unit configured to translate an input text of the first language into an output text of the second language by comparing each sentence of the input text with the technical term dictionary and the translation memory; a corresponding translation pair extraction unit configured to extract, from a source sentence matched with a sentence of the input text and a target sentence corresponding to the source sentence stored in the translation memory, a corresponding translation pair comprising a word in the source sentence and a translated word corresponding to the word in the target sentence; and an unmatch check unit configured to check whether the translated word does not match with a translated term corresponding to a term matched with the word in the output text. |
9355382 | 12412943 | 1 | 1. A non-transitory computer-readable medium having a computer-executable component, implemented by executing instructions on a processor associated with a telecommunication device, the computer-executable component comprising: a group information management component operative to: cause generation of a first group-based information display, the first group-based information display including a first subset of contacts formed in accordance with first identified organizational criteria, the first identified organizational criteria defined by a user of the telecommunication device, wherein the first subset of user contacts includes a portion of the user's contacts accessible by the telecommunication device; determine a first subset of applications or other executable components accessible by the telecommunication device to be included in the first group-based information display based, at least in part, on the first organizational criteria, wherein the first subset of applications and other executable components are configured to incorporate the first subset of contacts and to enable the user to communicate with the first subset of contacts via the telecommunication device in a context corresponding to the first organizational criteria; cause generation of a second group-based information display, the second group-based information display including a second subset of contacts formed in accordance with second identified organizational criteria, the second identified organizational criteria defined by the user of the telecommunication device, wherein the second subset of user contacts includes a portion of the user's contacts accessible by the telecommunication device; and determine a second subset of applications or other executable components accessible by the telecommunication device to be included in the second group-based information display based, at least in part, on the second organizational criteria, wherein the second subset of applications and other executable components are configured to incorporate the second subset of contacts and to enable the user to communicate with the second subset of contacts via the telecommunication device in a context corresponding to the second organization criteria; wherein at least one application or other executable component included in the first group-based information display is included in the second group-based information display and wherein the at least one application or other executable component is configured differently between the at least one application or other executable component's respective inclusion in the first group-based information display and the at least one application or other executable component's respective inclusion in the second group-based information display. |
20040260910 | 10714483 | 0 | 1. A method of controlling a monitoring function of a processor, said processor being operable in at least two domains, comprising a first domain and a second domain, said first and second domains each comprising at least one mode, said method comprising the steps of: setting at least one control value, said at least one control value relating to a condition and being indicative of whether said monitoring function is allowable in said first domain; and only allowing initiation of said monitoring function in said first domain when said condition is present if its related control value indicates that said monitoring function is allowable. |
20170140546 | 15420570 | 0 | 1. A method for determining flows, comprising steps: acquiring a video of the flows with a camera, wherein the flows are pedestrians in a scene, wherein the video includes a set of frames; extracting motion vectors from each frame in the set; constructing a data matrix from the motion vectors in the set of frames; determining a low rank Koopman operator from the data matrix; analyzing a spectrum of the low rank Koopman operator to determine a set of Koopman modes; segmenting the frames into the flows according to a clustering of the Koopman modes, wherein the flows are independent pedestrian flows, and wherein the steps are performed in a processor. |
9589000 | 14014296 | 1 | 1. An apparatus, comprising: a processor adapted to execute executable instructions; a data entity establisher instantiated on said processor, said data entity establisher comprising executable instructions adapted for establishing a plurality of distinct data entities, each said distinct data entity comprising at least one of a group consisting of an augmented reality entity and a virtual reality entity; a state establisher instantiated on said processor, said state establisher comprising executable instructions adapted for establishing a plurality of distinct states for each said data entity, each said state comprising: a state time; a plurality of state properties at least substantially corresponding to properties of one said data entity substantially at said state time, said plurality of state properties comprising a state spatial arrangement of said data entity; a data store in communication with said processor; a storer instantiated on said processor, said storer comprising executable instructions adapted for storing in said data store said plurality of distinct data entities and said distinct states therefor, so as to enable output of said distinct data entities to at least one of an augmented reality environment and a virtual reality environment with each said data entity exhibiting at least a portion of one of said distinct states therefor; a user output in communication with said processor; wherein: said data entity establisher and said state establisher are adapted to cooperate to establish: a first data entity with a first state and a second state, a first state time of said first state being substantially different from a second state time of said second state; and said first data entity with said first state, and a second data entity with a third state, said first state time of said first state being substantially different from a third state time of said third state; said storer is adapted to store for substantially concurrent output at a same output time: a first iteration of said first data entity exhibiting said first state and a second iteration of said first data entity exhibiting said second state, said output time being substantially different from said first and second state times; and said first iteration of said first data entity exhibiting said first state and a first iteration of said second data entity exhibiting said third state, said output time being substantially different from said first and third state times; said user output is adapted to output at said same output time so as to be sensed by a user: said first iteration of said first data entity exhibiting said first state and said second iteration of said first data entity exhibiting said second state; and said first iteration of said first data entity exhibiting said first state and said first iteration of said second data entity exhibiting said third state. |
20180046377 | 15792740 | 0 | 1. A computer program product for a flash memory controller to manage old physical addresses in a solid state memory device, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable by flash memory controller to cause the flash memory controller to: track in a read status table pending reads from the solid state memory device and track in the read status table physical addresses within the solid state memory device associated with the pending reads; assign a first logical address to a particular physical address within the solid state memory device; delay a release of the particular physical address for reassignment to a second logical address when the read status table indicates that there is a pending read from the particular physical address; and release the particular physical address for reassignment to the second logical address when the read status table indicates that there is no pending read from the particular physical address. |
8718360 | 12916460 | 1 | 1. A colour image enhancement method, for enhancing a colour of a colour image comprising a plurality of pixels, the method comprising: (a) mapping a colour saturation value of each pixel to a normalised saturation value, wherein a range of values of normalised saturation is the same independent of the luminance value of the each pixel, wherein the colour saturation value of the each pixel is represented relative to a maximum saturation value dependent on at least one of the luminance and the hue of the each pixel; (b) estimating a probability distribution of the normalised saturation values; (c) defining a transfer function for modifying the normalised saturation values, based on the estimated probability distribution; (d) limiting local gain of the transfer function to a predetermined value; and (e) applying the transfer function to the normalised saturation values to generate modified saturation values, wherein the colour image includes a plurality of luminance regions and method steps (a) to (e) are performed on the colour image irrespective of different luminance values in each of the plurality of luminance regions thereby computing only one histogram for the plurality of luminance regions. |
20050262077 | 11130687 | 0 | 1. A transaction system for transactions including two or more resources comprising: a transaction manager for transactions; a two-phase-commit resource manager interacting with the transaction manager, the two-phase-commit resource manager using a two-phase commit; and a Logging Last Resource (LLR) resource manager interacting with the transaction manager, the LLR resource manager using a single-phase or local commit, the LLR resource manager storing a transaction log for the transaction manager. |
20110068956 | 12607987 | 0 | 1. An input system of an electronic device based on Chinese phonetic notations, the input system comprising: a plurality of keys respectively arranged on a first side and a second side of a screen of the electronic device, wherein each of the keys corresponds to two phonetic notation sets, and each of the phonetic notation sets comprises a plurality of Chinese phonetic notations including one to two Chinese consonant notations and either one to two Chinese vowel notations or a Chinese medial notation; a detecting unit coupled to the keys, wherein every time the detecting unit detects an operation on one of the keys, one of the phonetic notation sets corresponding to the operated key is chosen according to a direction of the operation; a filtering unit coupled to the detecting unit for permuting all of the Chinese phonetic notations in the chosen phonetic notation sets to obtain at least one candidate meaningful pronunciation; and a candidate character output unit coupled to the filtering unit for outputting at least one candidate character onto the screen according to a Chinese character database and the at least one candidate meaningful pronunciation. |
20030167266 | 09757075 | 0 | 1. A method for creating structured data representation from a plain text description for an application domain, the method comprising: constructing a model which defines objects of the application domain and relationships between the objects, and identifies the objects with a vocabulary; parsing the plain text description using a grammar and the vocabulary to generate a plurality of parse trees; mapping the plurality of parse trees onto a plurality of instance trees created using the model; and generating structured data based on the mapping. |
20140289720 | 14298902 | 0 | 1. A computer-implemented method of updating a virtual machine, the method comprising: executing a hypervisor on a host computer, the hypervisor managing execution of the virtual machine on the host computer, wherein a guest operating system is configured to execute on the virtual machine, the hypervisor providing the virtual machine with block-based access to a virtual machine image, the virtual machine image comprised of blocks; receiving a substitution block at the host computer; and replacing, by the hypervisor, a target block in the virtual machine image with the substitution block, the target block comprising one of the blocks of the virtual machine image, the hypervisor managing the blocks of the virtual machine image and presenting the blocks of the virtual machine image, including the substitution block, to the virtual machine as a virtualized disk. |
20100046626 | 12197124 | 0 | 1. A method of decoding data encoded as a set that has a hierarchy of subsets with set symbols, the method comprising: receiving encoded data; and using the encoded data, reconstructing data values encoded as a set, including: evaluating a set symbol of the set; selectively decoding a symbol combination code that indicates respective set symbols of plural subsets of the set; assigning the respective set symbols to the plural subsets of the set; and for each of the plural subsets considered as a new set, selectively repeating the reconstructing for the new set. |
20060259479 | 11127131 | 0 | 1. A system for automatically generating a set of suggested search terms, comprising: an input interface to receive search input; and arbitration logic, the arbitration logic communicating with the input interface to parse the search input to generate a set of suggested search terms before search results are returned. |
7925975 | 11372545 | 1 | 1. A computer implemented method of identifying commands in an application, comprising: receiving a search request indicative of a desired task to be performed with the application; searching, with a processor, a command store, that stores commands for the application, using the search request; identifying, with a processor, as possible commands to perform the desired task, a subset of the commands in the command store based on the search request, the subset including a plurality of different commands for performing a plurality of different tasks in the application; returning, with a processor, representations of the possible commands in a user actuable form such that one of the possible commands that corresponds to the desired task can be actuated by a user to execute the desired task in the application, wherein returning representations of the possible commands comprises returning representations of the possible commands in ranked order based on a score calculated for each possible command in the subset, the score being indicative of how likely it is that the possible command can be used to perform the desired task: receiving a user selection of a given one of the representations of possible commands, the given one of the representations of possible commands representing at least two specific possible commands, each specific possible command representing a command bundle of a plurality of subcommands; conducting additional dialog, prior to performing the plurality of subcommands in the command bundle, to obtain information necessary to disambiguate between, and identify one of, the at least two specific possible commands, and to perform all of the subcommands in the command bundle, in response to receiving the user selection of the given one of the representations of the possible commands, the additional dialog being conducted utilizing a guided help screen that includes an indication of the given one of the representations of possible commands and tutorial content associated with the given one of the representations of possible commands, the tutorial content including at least three sections, a first section of the tutorial content providing textual information about the given one of the representations of possible commands, a second section of the tutorial content providing a list of user selectable options corresponding to the at least two specific possible commands, and a third section of the tutorial content providing a combination of textual and graphical information about the given one of the representations of possible commands, the user selection of the given one of the representations of the possible commands including receiving a user selection of one of the options from the list of user selectable options in the second section of the tutorial content; and automatically performing all of the subcommands in the command bundle without requiring additional information from the user. |
20160275228 | 15076372 | 0 | 1. A non-transitory computer-readable storage medium storing instructions for a circuit design tool that, when executed by a computer, cause the computer to perform a method for editing objects in a circuit design, the method comprising: creating a second object based on a first object in the circuit design, wherein said creating comprises applying a sequence of one or more geometric transformations to the first object; applying one or more edits to the second object, thereby obtaining an edited second object; applying the sequence of one or more geometric transformations in reverse order to the edited second object, thereby obtaining an edited first object; and saving the edited first object in the circuit design. |
20130304658 | 13945615 | 0 | 1. A computer-implemented method comprising: maintaining a user profile for each of a plurality of users of a social networking system, each user profile comprising a set of attributes; selecting a user from the plurality of users; receiving user profile information for at least one user of a set of users in the social networking system who are connected to the selected user in the social networking system; inferring a value of one or more attributes of the user profile for the selected user based on information describing the set of users who are connected to the selected user in the social networking system; comparing a confidence score value for an inferred user profile attribute to a threshold value; determining relevant information for the selected user based on the inferred user profile attribute; and sending the relevant information to the selected user. |
9454649 | 14322772 | 1 | 1. A method for making multi-system constraint of a specific permission in a digital right, comprising: obtaining, by an executing device, a rights object related to a content object by an executing device, wherein descriptions of a specific permission of the rights object include system constraint descriptions of a plurality of systems, a plurality of pairs of grammar elements for separating information of the plurality of systems are used for the specific permission in the rights object, each pair of grammar elements identifies information of one system, wherein the specific permission of the rights object is a play permission, or a display permission, and wherein the system constraint descriptions of a plurality of systems are target systems to which the content object is rendered; obtaining, by the executing device, corresponding system information in the executing device by the executing device according to said system constraint descriptions; comparing, by the executing device, the system information in the executing device with the system information in said system constraint descriptions; judging, by the executing device, whether the system in the system information for the executing device is a permitted system in said system constraint descriptions in the executing device; and based on the judging, determining to permit executing said specific permission for the content object when the system in the system information for the executing device is a permitted system in said system constraint descriptions in the executing device, otherwise, determining not to permit executing said specific permission for the content object. |
20070192039 | 11738411 | 0 | 1. A system for predicting binding information relating to a binding of a protein and a ligand, the system stored on computer-readable media, the system comprising: a trained binding model comprising a hidden variable representing an unknown alignment of the ligand with the protein at a binding site of the protein; and a prediction component configured to predict the binding information by employing information about the protein's sequence, the ligand's sequence and the trained binding model. |
20130227637 | 13768353 | 0 | 1. A method for managing grouped resources on a computing device comprising: receiving, at the computing device, a policy for a set of grouped resources; applying the policy; locking at least one of the computing device or the set or grouped resources associated with the policy; waiting for receipt of an authentication parameter at the computing device; verifying the authentication parameter; associating the set of grouped resources with the authentication parameter; and unlocking the least one of the computing device or the set of grouped resources. |
10006011 | 15019630 | 1 | 1. A vector comprising a polynucleotide coding for a polypeptide comprising a DNA-binding domain and a functional domain, wherein in the polypeptide, a linker domain between the DNA-binding domain and the functional domain consists of an amino acid sequence having at least 85% sequence identity with the amino acid sequence from position 754 to position 801 of SEQ ID NO: 34, the DNA-binding domain comprises consecutive 16 to 20 DNA-binding modules, each of which consists of 34 amino acid residues, in which module set 1 consists of 1st, 5th, 9th, 13th and 17th DNA-binding modules from the N-terminus of the DNA-binding domain, and each module of the module set 1 comprises amino acid combination 1 for an amino acid residue at position 4 and an amino acid residue at position 32; module set 2 consists of 2nd, 6th, 10th, 14th and 18th DNA-binding modules from the N-terminus of the DNA-binding domain, and each module of the module set 2 comprises amino acid combination 2 for an amino acid residue at position 4 and an amino acid residue at position 32; module set 3 consists of 3rd, 7th, 11th, 15th and 19th DNA-binding modules from the N-terminus of the DNA-binding domain, and each module of the module set 3 comprises amino acid combination 3 for an amino acid residue at position 4 and an amino acid residue at position 32; module set 4 consists of 4th, 8th, 12th, 16th and 20th DNA-binding modules from the N-terminus of the DNA-binding domain, and each module of the module set 4 comprises amino acid combination 4 for an amino acid residue at position 4 and an amino acid residue at position 32; and each of the amino acid combinations 1 to 4 is different from the other combinations; the DNA-binding domain has no more than 20 amino acids at the C-terminus of said consecutive 16 to 20 DNA-binding modules, and the DNA-binding domain is from a Transcription Activator-Like Effector (TALE). |
7873716 | 10856588 | 1 | 1. A system for enforcing execution policies for target functions, comprising: a processor; and a memory device including instructions that, when executed by the processor, cause the processor to: receive a request from a requestor for a target function; determine a list of providers being configured to provide the requested first target function; determine an execution policy for the request, the execution policy specifying at least one supporting function for the request, and logic for combining each supporting function, such that the specified supporting functions and respective other functions are discoverable by the requestor; dynamically composing, by a composing enabler, a plurality of function requests for each of the specified supporting functions and respective other functions; selecting one of the providers from the list of providers to provide the requested first function; binding, by the composing enable, the first function with the specified plurality of supporting functions and the plurality of respective other functions; generate at least one composed request corresponding to a logic of at least one request for the specified at least one supporting function and sending the composed request to the at least one corresponding supporting function; enable each supporting function to execute and return responses that are composed as a composed response; and if all supporting functions are satisfied according to the logic of the composed request, pass an intended service request to the target function and pass a response from the target function back to the requestor, wherein the execution policy is able to specify that a composition of at least one of the supporting functions is executed after the response from the target function is generated. |
20040111127 | 10317002 | 0 | 1. A method for treating a set of symptoms corresponding to a neurological disorder exhibited by a patient, comprising: determining a first set of neural stimulation parameters capable of treating a first subset of symptoms; determining a second set of neural stimulation parameters capable of treating a second subset of symptoms; and applying a neural stimulation therapy based upon the first set of neural stimulation parameters and the second set of neural stimulation parameters to the patient. |
9908464 | 15095121 | 1 | 1. A vehicle subject to autonomous operation, comprising: one or more autonomous support systems configured to support autonomous operation; a speaker system configured to disburse sound in an interior portion of the vehicle; and a confidence appraisal system in communication with the one or more autonomous support systems and the speaker system, the confidence appraisal system including a processor for initiating instructions stored on memory, the instructions including, while the vehicle is subject to autonomous operation supported by the one or more autonomous support systems: monitoring confidence in the autonomous operation, the confidence being determined based on operational statues of the one or more autonomous support systems supporting the autonomous operation, and corresponding to whether the vehicle can continue the autonomous operation; and operating the speaker system to disburse sound in the interior portion of the vehicle, the sound corresponding to the confidence in the autonomous operation, and varying with changes to the confidence in the autonomous operation, to continuously apprise a driver of the confidence in the autonomous operation. |
9569598 | 14944353 | 1 | 1. A computer-implemented method for managing licenses for software installations on virtual machine instances in a networked computing environment, comprising: collecting, on a computer storage device, data pertaining to usage of a set of software installations on a set of virtual machine (VM) instances running on cloud resources in the networked computing environment; receiving a request for a license for a particular software installation of the set of software installations from a requester; determining whether the license is available from a license service; evaluating, responsive to the license being unavailable, whether the license is obtainable from a source other than the license service based on the data and a current configuration of the networked computing environment, wherein the evaluating comprises: determining that changes have been made to terms of the license in a particular geographic location, and determining that changes have been made to terms of the license based on a datacenter where the cloud resources are located; and responsive to the license being obtainable, allocating the license from the source other than the license service, with adjustments made based on the changes, to the requester. |
7848617 | 11087808 | 1 | 1. A non-transitory recording medium for storing a data structure, the data structure comprising: at least one text subtitle stream, the text subtitle stream including a style segment and one or more presentation segments, the style segment defining at least one region style and the presentation segment containing at least one region of text linked to one of the at least one region style defined in the style segment by an identifier, wherein the presentation segment recorded or reproduced by a recording/reproducing device contains a continuous presentation flag to indicate that whether continuous presentation is required or not between a current presentation segment and a previous presentation segment, and a presentation time information indicating a start time of the presentation segment and an end time of the presentation segment, wherein the at least one region of text included in the presentation segment is linked to the at least one region style specifying a same text flow, wherein if the continuous presentation flag indicates that continuation presentation is required between the current presentation segment and the previous presentation segment, presentation of the at least one region of text in the previous presentation segment is preserved by the recording/reproducing device for presentation of the current presentation segment, wherein the at least one region of text including text data in which one of the at least one region style applied. |
20160188880 | 14583632 | 0 | 1. A computing apparatus comprising: a network interface; and one or more logic elements comprising an outbreak pathology inference engine, operable for: receiving network telemetry data from a client device via the network interface; receiving out-of-network telemetry data from the client device via the network interface; and inferring, based at least in part on the network telemetry data and out-of-network data, a malware outbreak hypothesis. |
8549101 | 12618654 | 1 | 1. A computer-implemented process, comprising: intercepting, at an intermediary on a first computing device, from an application running on the first computing device, a first request; wherein the first request is a request directed to a server, and identifies: a particular resource identifier, wherein a resource identifier identifies a resource that is remote to the first computing device; and one or more particular methods, wherein the one or more particular methods represent actions that may be performed on a resource; determining that the first request and an interception key of a plurality of interception keys match based on the particular resource identifier and the one or more particular methods; wherein each interception key of the plurality of interception keys is associated with a respective embedded server on the first computing device; in response to determining that the first request and the interception key match, relaying the first request to an embedded server associated with the interception key; wherein the process is performed by one or more computing devices. |
20110153103 | 12646764 | 0 | 1. A computer readable medium, comprising executable instructions to: receive historical building energy load values and corresponding historical predictor variable data comprising values for one or more predictor variables; define a scaling factor for each said predictor variable by cross-validation error minimization for said historical building energy load values using said corresponding historical predictor variable values scaled by said scaling factor values; receive measured building energy load values measured by at least one building energy meter; receive measured predictor variable values corresponding to the measured building energy load values from a predictor variable datasource; determine a predicted building energy load value by kernel smoothing of one or more nearest neighbor historical building energy load values using said predictor variables values each scaled by said defined scaling factors; compare said predicted building energy load value with said measured building energy load value to determine if an alert threshold level is exceeded; and transmit an alert signal to a user when said alert threshold level is exceeded. |
8122398 | 11811685 | 1 | 1. A method for converting a description of a circuit into an abstract model, comprising: using a computer to read a model description of the circuit, protocol information relating to the circuit, and simulation data associated with the circuit; and based on the model description, the protocol information, and the simulation data, generating an abstract model of the circuit that approximates the circuit behavior, wherein generating an abstract model comprises: generating a system of weighted equations representing the behavior of the circuit; applying input patterns to the system of equations to generate actual output values; calculating an error by using a difference between the actual values and desired values; and modifying the weighted system of equations based on the calculated error; and wherein generating an abstract model further comprises performing causality analysis, wherein performing causality analysis comprises defining a set of causality characters; and reducing the set of causality characters through statistical analysis. |
8873638 | 13025611 | 1 | 1. An apparatus comprising: at least one processor; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least perform: assigning decoding of a respective video frame to a corresponding thread for each core processor of a multi-core processor, each respective video frame being divided into macroblock rows; resolving dependencies for the each respective video frame at a macroblock row level; and providing synchronization for video decoding of each corresponding thread at the macroblock row level; where resolving dependencies comprises during decoding limiting a predicted motion vector in advance based on a maximum motion vector of a prior row; and where synchronization is provided by limiting a maximum lag between decoding successive frames based on frame resolution and cache size of a cache having shared access among each core processor of the multi-core processor. |
8051223 | 12331348 | 1 | 1. A computer-implemented method to manage memory, wherein the method comprises: creating a buffer construct that represents a region of memory, the buffer construct being associated with any one of multiple mutually exclusive states, the multiple exclusive states including an open state and a closed state; making the region of memory represented by the buffer construct accessible to one or more DMA operations in response to the buffer construct being in the closed state; enabling the buffer construct to transition from the closed state to the open state in response to completion of the one or more DMA operations; making the region of memory represented by the buffer construct accessible for use with one or more cache operations in response to the buffer construct being in the open state, so that the one or more cache operations are not in conflict with the one or more DMA operations; generating a notification or execution error in response to an occurrence of a DMA operation initiated to the region of memory while the buffer construct is in the open state. |
20120173015 | 13259443 | 0 | 1. A postal sorting method in which mailpieces are subjected to at least two sorting passes in a machine so as to be sequenced in sorting outlets of the machine, and user processing information is available in the machine during a first sorting pass in relation to at least a certain mailpiece, said postal sorting method comprising, in a memory of a data processing unit associating said user processing information with a graphical signature of the mailpiece that is representative of an image of the mailpiece, and recovering, during the second machine sorting pass of said certain mailpiece, said user processing information that is associated with said certain mailpiece on the basis of matching of graphical signatures using a resemblance criterion. |
20090076995 | 12190150 | 0 | 1. A user state presumption system comprising: a category storage which stores state data indicating to which states defined in advance a plurality of users who accessed a server providing a service via a network belong; a transition model recorder which records, for a transition between the states defined in advance, transition condition data indicating a user behavior pattern serving as a condition for changing of a user from a certain state to another state; a log receiver which reads an access log containing data identifying the plurality of users who accessed the server, data indicating information to which the plurality of users referred and reference times at which the plurality of users referred to the information; a log abstracting part which detects, for each of the plurality of users, beginning and ending of a series of accesses made by the user on the basis of the access log read by the log receiver and abstracts, for a series of accesses made by the user, access history data containing data identifying information referred to by the user in the series of accesses; a behavior categorizing part which categorizes, on the basis of the information referred to by the user in the series of accesses indicated by the access history data abstracted by the log abstracting part, a behavior of the user in the series of accesses into one of a plurality of behavior patterns defined in advance; a category presuming part which presumes how a state of each of the plurality of users indicated by the state data stored in the category storage changes by comparing the behavior pattern of the user determined by the behavior categorizing part with the user behavior pattern serving as the condition for the transition between the states indicated by the transition condition data recorded in the transition model recorder and updates the state data on the basis of a result of the presumption; a transition probability storage which stores a transition probability of a user transition between the states defined in advance; a transition probability calculator which calculates, every predetermined period, the transition probability of the user transition between the states defined in advance by referring to the state data and stores the obtained transition probability in the transition probability storage; an intended behavior judging part which judges, on the basis of the access history data abstracted by the log abstracting part, whether the user has exhibited a specific intended behavior that is an aim of the service provided by the server in the series of accesses; an intended behavior probability recorder which records the proportion of users who have exhibited the intended behavior among users in individual states; and an intended behavior probability calculator which calculates, every predetermined period, the proportion of users who have exhibited the intended behavior among the plurality of users in the individual states on the basis of a result of the judgment obtained by the intended behavior judging part and the state data and records the obtained proportion in the intended behavior probability recorder. |
9870206 | 14937732 | 1 | 1. A non-transitory computer accessible memory medium that stores program instructions executable by a functional unit to implement: including a replication structure in a graphical program, wherein the including comprises displaying a replication structure icon in the graphical program displayed on a display, wherein the replication structure icon comprises an interior portion, wherein the replication structure specifies replication of any graphical program code inside the interior portion of the replication structure icon: including graphical program code inside the interior portion of the replication structure icon: automatically generating an implementation of the graphical program, including: generating multiple instances of an implementation of the graphical program code within the implementation of the graphical program, wherein said generating is performed in response to including the graphical program code inside the interior portion of the replication structure icon: wherein the multiple instances of an implementation of the graphical program code are executed during execution of the implementation of the graphical program. |
20070023744 | 11193425 | 0 | 1. A memory device, comprising: a first electrode and a second electrode; a chalcogenide glass region between said first electrode and said second electrode; and a plurality of alternating tin chalcogenide layers and silver layers between said chalcogenide glass region and one of said first electrode and said second electrode. |
20150070703 | 14020515 | 0 | 1. A method of classifying the material type of an unknown material into a probability distribution of multiple predetermined material types by using a collection of plural predetermined material classifiers, wherein each material type of the multiple predetermined material types is associated with a corresponding best performing classifier from the collection of plural predetermined material classifiers by a predesignated stored association, the method comprising the steps of: applying the plural material classifiers to the unknown material to obtain a list of candidate material types; looking up a list of potential best performing classifiers using the list of candidate material types as a reference into the predesignated stored association; and assigning a respective probability that the unknown material belongs to a material type based on the list of potential best performing classifiers. |
20080086488 | 11539040 | 0 | 1. A text searching method comprising: receiving a search query containing a token, the token having a token number of characters in a token sequence; and generating, from the token, a first split-token and a second split-token, the first split-token having a first number of characters in a first sequence and the second split-token having a second number of characters in a second sequence, wherein the first number and second number are determined based on the token number of characters. |
20100246912 | 12415664 | 0 | 1. In a computer system comprising at least one processor, at least one storage means and at least one input device, a method of identifying suspicious anomalies in an anatomical colon under study, comprising: a. by means of at least one input device, acquiring a plurality of images of the anatomical colon; b. by means of at least one processor, registering at least a portion of a first acquired anatomical colon image with respect to at least a portion of a second acquired anatomical colon image; c. by means of at least one processor, for said first and second acquired anatomical colon images, identifying at least one candidate suspicious anomaly in said acquired anatomical colon image; d. by means of at least one processor, for at least one said candidate suspicious anomaly in the registered first acquired anatomical colon image, determining that at least one candidate suspicious anomaly in the registered second acquired anatomical colon image corresponds to said candidate suspicious anomaly in the registered first acquired anatomical colon image, whereby the corresponding suspicious anomalies constitute a matched set; e. by means of at least one processor, classifying at least one candidate suspicious anomaly in a matched set of candidate suspicious anomalies as belonging to a true positive class; and f. by means of at least one storage means, storing information with respect to at least one candidate suspicious anomaly in a matched set of candidate suspicious anomalies classified as belonging to a true positive class. |
20070214272 | 11370516 | 0 | 1. An apparatus, comprising: a computer; a web browser stored on the computer; a browser user account for the web browser; a browser user name for the browser user account; a password associated with the browser user name. |
10013504 | 15166832 | 1 | 1. A system for search with autosuggest, comprising: a processor configured to: determine a plurality of potential query suggestions for a partially entered query string; merge a plurality of categories associated with a merchant web site into a merged category, comprising to: determine a first weight for a first category based on a first query count associated with the first category; determine a second weight for a second category based on a second query count associated with the second category, the plurality of categories including the first category and the second category; and merge the first category and the second category into a single merged category, the single merged category being associated with the merged category, wherein the merging of the first category and the second category comprises to: aggregate the first weight and the second weight to obtain a merged weight, the merged weight being associated with the merged category; and automatically suggest a plurality of queries based on a query count for each of the queries, wherein at least one of the automatically suggested plurality of queries corresponds to the merged category; and a memory coupled to the processor and configured to provide the processor with instructions. |
20060053164 | 10934887 | 0 | 1. A system for application-layer monitoring of communication between one or more database clients and one or more database servers, the system comprising: one or more decoders residing at a decoding layer above a network layer, the decoders residing at a first network location between one or more database clients residing at one or more second network locations and one or more database servers residing at one or more third network locations, the decoders being operable to: receive database messages communicated from the database clients and intended for the database servers and database messages communicated from the database servers and intended for the database clients; decode the database messages; and extract query-language statements from the database messages; and a monitoring application residing at an application layer above the decoding layer, the monitoring application residing at the first network location, the monitoring application being operable to receive query-language statements extracted at the decoders and record observations on the database messages based at least in part on the query-language statements extracted at the decoders. |
9122547 | 14292757 | 1 | 1. A method, comprising: executing an embedder module at a computer; receiving, via the embedder module, a request to access a guest module, wherein the request comprises a tag in a programming language, and wherein the tag identifies the guest module; providing, using information associated with the tag, an event to an executing instance of the guest module responsive to the request to access the guest module; signaling for processing of the event at the executing instance of the guest module; providing the request to access the guest module from the embedder module to a broker module; and identifying, using the broker module, the guest module, wherein the broker module comprises a web browser, an operating system controller, a web browser application store, or an operating system application store. |
8738607 | 12777706 | 1 | 1. A computer-implemented method to reduce storage and transmission costs associated with remote error recreation for abstract database applications, the method comprising: upon detecting an error condition when an application executes an abstract query against an abstract database having an underlying physical database in a first computing environment, generating, by operation of one or more computer processors and not in response to any user request, an abstract database application extraction sufficient to recreate the error condition and comprising at least a portion of each of the application, the abstract database, and the physical database, respectively, wherein the portion of the abstract database includes a definition of at least one logical field used by the abstract query and excludes a definition of at least one logical field not used by the abstract query; sending the abstract database application extraction for execution in a second computing environment different from the first computing environment; and recreating the error condition from the abstract database application extraction in order to facilitate resolving the error condition, whereby storage and transmission costs associated with recreating the error condition in the second computing environment are reduced relative to providing the entirety of each of the application, the abstract database, and the physical database, respectively, for execution in the second computing environment. |
8566921 | 13527476 | 1 | 1. A computer network, comprising: one or more computers arranged in the computer network; a system for protecting at least one computer of said one or more computers during boot operation of an operating system of the at least one computer, the system comprising: a persistent computer storage medium, storing a compiled security profile thereon for execution by a processor of the at least one computer, for inspecting packets transmitted to or from the at least one computer; the persistent computer storage medium being accessible to the operating system during an early stage of the boot operation of the operating system when kernel mode services are available but before user mode services become available; and a memory of the at least one computer, having computer readable instructions stored thereon for execution by the processor, forming a network driver of the operating system configured to load the compiled security profile from the persistent computer storage medium into the memory during the early stage of the boot operation of the operating system for inspecting packets, transmitted to or from the at least one computer, according to the compiled security profile. |
20120290564 | 13562191 | 0 | 1. A method comprising: receiving a plurality of medical documents, the plurality of medical documents including first medical documents in a paper-based format and second medical documents in a structured data-based format; converting the first medical documents in the first format into an image-based unstructured data-based format; converting the second medical documents in the second format into the image-based unstructured format; determining a schema, the schema including a plurality of categories determined based on an expected structural content in the first medical documents or second medical documents; indexing the first medical documents and the second medical documents in the image-based unstructured format by associating indices based on the schema with the first and second medical documents; storing the first medical documents and the second medical documents in the image-based unstructured format with the indices to allow searching of both the first medical documents and the second medical documents; and storing the second medical documents with an active link to view specific data in the structured data-based format provided by the second document for enabling access to the structured data. |
7660773 | 11299804 | 1 | 1. In a computing device, a computer-implemented method of solving an optimization problem for a modeled system using an adaptive mutation operator in a genetic algorithm, comprising: providing, to the computing device, a first population of a plurality of individuals for an optimization problem for a modeled system, the individuals being individual solutions to the optimization problem, the optimization problem including linear and bound constraints; selecting an individual for mutation using the computing device; generating programmatically, using the computing device, an initial step size; generating programmatically, using the computing device, a plurality of random mutation direction vectors extending from a plotted location representing the individual selected for mutation, the plurality of random mutation direction vectors based on the linear and bound constraints; generating programmatically, using the computing device, a mutated individual and moving a distance equal to the initial step size from the plotted location representing the individual selected for mutation along a randomly chosen one of the plurality of mutation direction vectors; and assessing programmatically, using the computing device, whether the mutated individual is in a feasible region, the feasible region representing a region encompassing acceptable solutions to the optimization problem considering the linear and bound constraints, the assessing further comprising: storing the mutated individual as part of second population in a computer-readable medium based on an assessment that the mutated individual is in the feasible region, or based on an assessment that the mutated individual is not in the feasible region, iteratively mutating a different mutated individual along the chosen mutation direction vector using a step size programmatically reduced from the initial step size and assessing whether the different mutated individual is in the feasible region until the different mutated individual is assessed to be in the feasible region, the reduced step size based on the linear and bound constraints, and storing the different mutated individual as part of a second population in a computer-readable medium based on an assessment that the different mutated individual is in the feasible region; and using the second population to solve the optimization problem. |
20030152906 | 10134681 | 0 | 1. A method for navigating a course, the method comprising: receiving one or more graphs corresponding to the course; applying a learning strategy to the one or more graphs; and generating a navigation tree for the course based on the applied learning strategy. |
20110066887 | 12557816 | 0 | 1. A method implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions operable to: compare actual data associated with a phase of a project to expected results used to develop a strategic development plan for the project; and calibrate efforts in the strategic development plan for future activities of the project based on the actual data. |
9430342 | 12628877 | 1 | 1. A method comprising: obtaining, by one server of a plurality of servers, hierarchy configuration parameters comprising a total number of the plurality of servers and a number of storage transaction servers, storage virtual machines (VMs), storage access servers, and storage access VMs to be produced; dividing, by the one server of the plurality of servers, the plurality of servers into a first pool of the plurality of servers and a second pool of the plurality of servers based on the total number of the plurality of servers; assigning, by the one server of the plurality of servers, the first pool of the plurality of servers to a first hierarchical level and the second pool of the plurality of servers to a second hierarchical level based on the number of storage transaction servers and the number of storage access servers to be produced, wherein the first hierarchical level is assigned to provide storage transaction functions comprising receiving storage access requests from client devices, generating storage operations based on the storage access requests, and sending the storage operations to the second hierarchical level and the second hierarchical level is assigned to provide storage access functions comprising receiving the storage operations from the first hierarchical level and interfacing with one or more storage devices in order to execute the storage operations; and requesting, by the one server of the plurality of servers, a hypervisor executing on each of the first pool of the plurality of servers to produce and deploy one or more of the number of storage transaction VMs that execute on the first pool of the plurality of servers and implement a storage operating system to perform one or more storage functions based on the storage transaction functions assigned to the first hierarchy level and another hypervisor executing on each of the second pool of the plurality of servers to produce one or more of the number of storage access VMs that execute on the second pool of the plurality of servers and implement the storage operating system to perform another one or more storage functions based on the storage access functions assigned to the second hierarchy level. |
8234325 | 12050023 | 1 | 1. A method of transmitting a signal for a random access procedure, the method comprising: receiving, by a radio frequency (RF) unit of a user equipment (UE), a first logical index from a base station, wherein the first logical index is one of consecutive logical indexes which are mapped to physical root indexes of a root Zadoff-Chu (ZC) sequence, the physical root indexes of the root ZC sequence are divided into subgroups according to cyclic shift parameters, and each of the subgroups includes at least one physical root index; receiving, by the RF unit of the UE, information regarding a cyclic shift parameter from the base station; and transmitting, by the RF unit of the UE, a random access preamble of a predetermined number of random access preambles, wherein the predetermined number of random access preambles are obtained, at a processor of the UE, by generating random access preambles in the order of increasing cyclic shift from a first root ZC sequence with a first physical root index mapped to the first logical index in a memory of the UE and by generating additional random access preambles in an order of increasing cyclic shift from a second root ZC sequence with a second physical root index mapped to a second logical index in the memory of the UE when the predetermined number of random access preambles cannot be generated from the first root ZC sequence, wherein the second logical index is consecutive to the first logical index, and wherein a sum of the first physical root index and the second physical root index is equal to a length of the root ZC sequence, and wherein a value of the cyclic shift is obtained from the cyclic shift parameter. |
20070038658 | 11204409 | 0 | 1. A computer-implemented method for managing compilation of a database statement that includes a user-defined table function that requires partitioning of data input to the function, the method comprising: while generating an execution plan for the database statement, determining whether the partitioning of output data from an operation that feeds the function is compatible with the partitioning required by the function; and if partitioning of the output data from the operation that feeds the function is compatible with the partitioning required by the function, then specifying, in the execution plan, execution of both the operation that feeds the function and the function by a same set of processes. |
7756252 | 11396875 | 1 | 1. A method for network denial case generation, the method comprising: receiving a plurality of third-party carrier call records associated with a plurality of subscriber telematics units at a call center wherein each call record includes a call status; determining at least one call record having a failure condition based on the call status; determining a subscriber telematics unit associated with the call record having the failure condition; and determining a network denial case action for the subscriber telematics unit based on the failure condition. |
5379289 | 08093458 | 1 | 1. A media access controller for transferring digital data between a digital system and a digital network, said media access controller comprising: digital data reception means for receiving incoming digital data including corresponding data destination addresses from a digital network, and for transferring a first portion of said received incoming digital data to at least one of a plurality of data destination units within a digital system, and further for selectively transferring a second portion of said received incoming digital data to said at least one of said plurality of data destination units within said digital system; digital data transmission means for receiving outgoing digital data from said digital system and for transmitting said received outgoing digital data into said digital network; and off-line address filtering means for capturing said received data destination addresses, wherein said off-line address filtering means selectively inhibits said transferring of said second portion of said received incoming digital data to said at least one of said plurality of data destination units within said digital system in accordance with said captured data destination addresses after said first portion of said received incoming digital data has been transferred. |
20130331089 | 13492189 | 0 | 1. A method for optimizing mobile user data storage, said method comprising: receiving, at a storage system, data from mobile users according to a first data receiving scheme; and establishing, at said storage system, a second data receiving scheme where data received from said mobile users according to said second data receiving scheme is less than data received from said mobile users according to said first data receiving scheme. |
20060093227 | 10536846 | 0 | 1. A method of measuring blocking artefacts on the basis of video data encoded in accordance with a block-based encoding technique, the method comprising the steps of: computing a monodimensional inverse discrete transform ( 31 ) of a first row of a first block of encoded video data, suitable for supplying a value of a first virtual border pixel (vep 1 ), computing a monodimensional inverse discrete transform ( 32 ) of a first row of a second block of encoded video data, the second block being adjacent to the first block, suitable for supplying a value of a second virtual border pixel (vep 2 ), computing ( 33 ) a blocking artefact level (VEP_L) on the basis of an absolute value of a difference between the values of the first and second virtual pixels. |
20110225144 | 13113657 | 0 | 1. A method for processing a query, comprising: receiving, with a computer including a processor, the query, wherein the query is formed by one or more paths, and wherein each path includes one or more steps; receiving a hierarchical document including one or more document nodes; and while processing the query and traversing the hierarchical document, constructing one or more extraction entries, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node; and constructing one or more tuples using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries. |
10103931 | 14861097 | 1 | 1. A method for session-based matching of mutable browser identifiers, the method comprising: storing information in memory regarding: a plurality of mutable browser identifiers, each mutable browser identifier having been generated to be unique to a different associated website, wherein a corresponding mutable browser identifier has been provided to a local cache, and wherein a new mutable browser identifier unique to the associated website is generated upon request and provided to the local cache, and one or more maps, wherein each map associates a different immutable browser identifier with one or more of the mutable browser identifiers, the immutable browser identifier unique to a different browser in use at an associated computing device; receiving information from a computing device that has used a browser during a session to download a website, wherein the downloaded website includes a reference to a mutable browser identifier specific to the downloaded website; identifying that the referenced mutable browser identifier corresponds to one of the stored mutable browser identifiers based on a comparison of session information for the session in the received information to session information associated with the corresponding stored mutable browser identifier; and mapping the referenced mutable browser identifier to the corresponding stored mutable browser identifier based on a match between the session information for the session and the session information associated with the corresponding stored mutable browser identifier. |
20150288564 | 14629493 | 0 | 1. A system for adaptive cloud-based work routing, comprising: a network-connected computing machine comprising a work router, a network-connected computing machine comprising a configuration server, a network-connected computing machine comprising a database, and a plurality of external resources; wherein the configuration server provides interactive software for management of system behavior and operation, wherein the database stores configuration information for future use, wherein the work router receives communication from the external resources, and wherein the work router sends data to the external resources. |
20150213030 | 14682252 | 0 | 1. A method implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable hardware storage device having programming instructions configured to: analyze a user's electronic calendar; generate a list of most frequently used words within the user's electronic calendar; generate character saving abbreviations based on the most frequently used words within the user's electronic calendar; and recommend the generated character saving abbreviations to a user of the user's electronic calendar. |
8310480 | 12320068 | 1 | 1. A system for compressing and decoding mesh data in a three-dimensional mesh model, comprising: a mesh data acquisition unit to acquire mesh data from a three-dimensional mesh model; a cluster mesh generation unit to generate a plurality of cluster meshes by using the mesh data; and a local quantization unit, using at least one processor, to quantize geometry information of respective vertexes through application of respective local coordinate systems to the respective cluster meshes and to generate quantized data of the respective vertexes included in the respective cluster meshes, wherein the quantization of geometric information causes gaps in some of the cluster meshes, and wherein the local quantization unit performs a scaling of a grid of the local coordinate system to suit the cluster mesh having the largest size among the generated cluster meshes, and applies the local coordinate system adopting the same scaling to other cluster meshes to reduce the gaps caused by quantization of the geometric information. |
8364725 | 13071371 | 1 | 1. A method for navigating model objects, comprising: displaying the model objects in models in a models stack; in response to a model object in a model of the models stack being selected as an initial context, displaying one or more navigation paths associated with the selected model object, wherein each of the navigation paths has nodes represented as graphical components that are built in real time and that represent the selected model object and other model objects from the models in the models stack; and in response to a user selecting a node in one of the one or more navigation paths, navigating to a new model object represented by the selected node in the models stack in one of a forward direction and a backward direction to provide bidirectional navigation between the model objects in the models without loosing the initial context; and displaying one or more navigation paths associated with the new model object and at least one appended node that represents a previously traversed model object. |
7725266 | 11756384 | 1 | 1. A method of geophysical exploration within a predetermined volume of the earth containing subsurface structural and stratigraphic features conducive to the generation, migration, accumulation, or presence of hydrocarbons, comprising the steps of: a. selecting a 3D seismic data set, wherein at least a portion of said 3D seismic data set images said at least a portion of said predetermined volume of the earth, and wherein said 3D seismic data set comprises a plurality of seismic traces; b. computing a partial Fourier transform of at least a portion of said seismic traces in said 3D seismic data set, thereby producing a transformed 3D seismic data set; c. choosing an initial subsurface model; d. using at least said initial subsurface model to calculate a 3D frequency domain forward propagated wave field by time domain forward modeling; e. calculating a residual volume between said 3D frequency domain wave field and said transformed 3D seismic data set; f. calculating a 3D frequency domain back propagated wave field by 3D time domain forward modeling using at least said back propagated wave field; g. using at least said 3D frequency domain back propagated wave field and said 3D frequency domain forward propagated wave field to update said initial subsurface model, thereby producing an updated subsurface model; and, h. using said at least a portion of said updated subsurface model to explore for said subsurface structural and stratigraphic features conducive to the generation, migration, accumulation or presence of hydrocarbons within said predetermined volume of the earth. |
20140215513 | 14231700 | 0 | 1. A system for presenting targeted search results to a mobile communication facility operated by a user, the system comprising one or more computers having computer readable media having stored thereon instructions which, when executed by one or more processors of the one or more computers, causes the system to perform the steps of: (a) receiving information relating to one or more user characteristics of the user, wherein the one or more user characteristics are derived from information obtained through a carrier and include a viewing history of television content corresponding to the user as recorded through use of a television operated by the user, wherein the viewing history of television content includes a plurality of episodes from a series viewed by the user via the television; (b) receiving from the mobile communication facility a search request containing a word; (c) determining that the word is more contextually relevant to the series than search results unrelated to the series, wherein the determination is based on the received viewing history of television content; and (d) transmitting to the mobile communication facility information corresponding to a viewing source for one or more episodes of the series not yet viewed by the user, wherein display of the information corresponding to the viewing source is prioritized over display of the search results unrelated to the series. |
8504581 | 13072916 | 1 | 1. A method for selecting a preferred data set, comprising: generating, by one or more processors, a candidate data set based on a first data set having a first join attribute, a first aggregate attribute and a first local attribute, and a second data set having a second join attribute compatible with the first join attribute and a second aggregate attribute, wherein the candidate data set includes a total attribute having a value that is based on aggregating a value associated with the first aggregate attribute and a value associated with the second aggregate attribute, and the candidate data set further includes the first local attribute selected from the first data set; and selecting, by one or more processors, the preferred data set from the candidate data set based on the total attribute and the first local attribute, wherein no tuple in the preferred data set is fully dominated by any other tuples in the preferred data set. |
8135636 | 10721432 | 1 | 1. A computer implemented method, comprising: gathering, by a processor of a computer, a plurality of usage data from a plurality of users consuming a plurality of computer resources in an on demand service environment, the on demand service environment providing a plurality of computer services available through a web service interface, wherein the processor is connected to the plurality of users and the web services interface by a network, and wherein each of the plurality of usage data measures a consumption of a computer resource in one of the plurality of computer services; sending, by the processor, the plurality of usage data to a database through the web services interface; processing, by the processor, the plurality of usage data into a plurality of records, each of the plurality of records having a required information section and an attributes section; saving, by the processor, the plurality of records into a record table, an attribute table, and a unit of work table, wherein the record table is linked to the attribute table, and the record table is linked to the unit of work table; responsive to a flag in a required field of a record, changing a status of the unit of work to a closed status in the unit of work table, and responsive to changing the status of the unit of work to the closed status in the unit of work table, identifying a plurality of associated records, wherein an associated record is a record associated with the unit of work; aggregating, normalizing, and algebraically composing, by the processor, the plurality of associated records to produce a metric that summarizes consumption of the computer resource for the unit of work; and storing, by the processor, the metric with the records in a database, wherein the metric and the records are configured to be stored and retrieved using a schema, and wherein the metric is configured to be used in an accounting, an auditing, a billing, or an optimization process. |
9177612 | 14246680 | 1 | 1. An apparatus comprising: a semiconductor die device including a multi-ported three-dimensional (3D) memory that includes multiple memory cells arranged in multiple physical levels that are monolithically formed above a substrate of the semiconductor die, wherein the semiconductor die that includes the multi-ported 3D memory includes circuitry associated with operation of the multiple memory cells; and a second semiconductor die that includes a multi-ported memory interface that is connected to the multi-ported 3D memory, the second semiconductor die including a multi-ported static random access memory (SRAM), wherein the second semiconductor die includes a state machine configured to store data at the multi-ported SRAM and to initiate a data store operation at the multi-ported 3D memory by sending the data and an instruction to the multi-ported 3D memory via the multi-ported memory interface. |
7889101 | 12082711 | 1 | 1. A method of generating a location based reminder by a navigation system, comprising the following steps of: creating reminder message data which include a reminder message, a primary location, a secondary location defines a Point Of Interest (POI) type, and a validation rule where the primary location is a location associated with the reminder message, a secondary location is a location where a user conducts an activity defined by the reminder message, and the validation rule defines condition for generating the reminder message; comparing a reference location with the primary location where the reference location is a destination that is specified by the user for a route guidance operation of the navigation system; applying the validation rule in the reminder message data to determine whether a relationship between the primary location and the reference location satisfies the condition in the validation rule for generating the reminder message; displaying the reminder message associated with the primary location when the condition defined in the validation rule is satisfied where the display includes one or more candidate secondary locations determined by the navigation system based on the POI type and within a predetermined distance from the reference location; and conducting a route guidance operation to reach a location selected from the one or more candidate secondary locations by the user. |
20080184212 | 11698634 | 0 | 1. A computer-implemented method of persisting machine instructions, the method comprising: storing into a database, software expressed in an intermediate level language (ILL); interpreting the ILL software in a virtual machine in a database management system; operating a compiler in the database management system, to receive the ILL software as input and to emit native code comprising said machine instructions; storing the native code emitted by the compiler in the database; storing in the database an indicator of a plurality of properties required to execute the native code; checking if said indicator stored in the database matches a new indicator of said plurality of properties; executing said machine instructions in the native code emitted by the compiler, via the virtual machine in the database management system, if a result of said checking is true; and marking the native code as invalid if said result of said checking is false. |
9245248 | 14014707 | 1 | 1. A method comprising: receiving, by a computer system comprising computer hardware, an identity of a metric of interest and a future time point; retrieving, by the computer system, a prediction configuration previously associated with the metric of interest, the prediction configuration comprising a period combination; wherein the period combination comprises a plurality of time periods, each time period comprises one or more segments, and each segment of the one or more segments comprises adapted historical values of the metric of interest incrementally inserted therein; for each time period of the plurality of time periods: the computer system identifying, for the future time point, a corresponding segment of the one or more segments; accessing, by the computer system, a set of adapted historical values from the corresponding segment; and computing, by the computer system, an intermediate predicted value from the set of adapted historical values, the computing comprising: testing for a trend in the set of adapted historical values; based on a result of the testing, determining whether the set of adapted historical values satisfies criteria for performing linear regression; responsive to a determination that the set of adapted historical values satisfies the criteria for performing linear regression, computing the intermediate predicated value using linear regression; and responsive to a determination that the set of adapted historical values does not satisfy the criteria for performing linear regression, computing the intermediate predicted value based on an average of the set of adapted historical values; and calculating, by the computer system, a predicted value for the metric of interest based on the computed intermediate predicted value. |
20130304456 | 13940375 | 0 | 1. A method, comprising: receiving, using one or more processors, a first plurality of offensive words; receiving, using one or more processors, a second plurality of offensive words; receiving a string of words, wherein one or more detected offensive words is selected from the string of words that matches words from the first plurality of offensive words or the second plurality of offensive words; and processing the string of words based upon the detection of offensive words in the string of words. |
20080052072 | 11930970 | 0 | 1. A method of providing speaker recognition, said method comprising the steps of: providing a model corresponding to a target speaker, the model being resolved hierarchically into at least one frame comprising a plurality of levels of phonetic detail of varying resolution; receiving an identity claim; ascertaining whether the identity claim corresponds to the target speaker model; said ascertaining step comprising the steps of: determining, for each frame and each level of phonetic detail of the target speaker model, a likelihood value; and resolving the at least one likelihood value to obtain a likelihood scores. wherein the likelihood values are determined utilizing grain-specific weights. |
20160155443 | 14676647 | 0 | 1. A method of controlling which electronic device out of topology of interconnected electronic devices responds to a wake phrase, the method comprising: in an electronic device of the topology of interconnected electronic devices configured to listen for voice commands, receiving a wake phrase from a microphone of the electronic device; recognizing the wake phrase; and responsive to recognizing the wake phrase, waking the electronic device and controlling which one electronic device out of the topology of interconnected electronic devices plays an audio prompt that indicates an active listening state in response to the wake phrase, wherein the controlling invokes response arbitration rules selecting a single electronic device out of the topology of interconnected electronic devices according to a user preference indicating a primary device designation for the interconnected electronic devices or recorded activity detected by one or more hardware sensors of the electronic device. |
8832087 | 13516937 | 1 | 1. An information estimation device that estimates the time of issue of a document to be estimated, comprising: a processor; a candidate generation unit that extracts time representations described in the document to be estimated, and generates a plurality of issue time candidates potentially corresponding to the time of issue of the document to be estimated based on the extracted time representations; and an issue time estimation unit that obtains temporal proximities between a given issue time candidate and other issue time candidates for each of the plurality of issue time candidates, and estimates the time of issue of the document to be estimated based on the obtained temporal proximities. |
6167084 | 09141265 | 1 | 1. A bit allocation method for digital video, comprising the steps of: providing a plurality L of video programs at an encoder, each program having successive groups of pictures (GOPs); each GOP having an associated number of pictures; providing a super GOP comprising at least one GOP from each of said L video programs, and having a length of N pictures; calculating a first target number of bits, T, for encoding said super GOP according to the number of pictures in said super GOP, L.times.N, and an available capacity of a channel over which the video programs are transmitted; wherein each super GOP comprises a plurality N of super frames, each super frame having L pictures at a common temporal reference point; defining a respective complexity measure for each picture type in each l.sup.th program; calculating a second target number of bits for encoding each n.sup.th super frame of pictures, where n=1,. .. , N, according to said first target number of bits, T, and the complexity measure of each l.sup.th picture in the associated n.sup.th super frame, where l=1,. .. , L; calculating a third target number of bits for encoding each l.sup.th picture in the associated n.sup.th super frame according to said second target number of bits and the associated complexity measure, and a sum of the complexity measures for each picture in the associated n.sup.th super frame; and providing respective weighting factors, w, for the different video programs according to a relative priority thereof; wherein: said third target number of bits for encoding each l.sup.th picture in the associated n.sup.th super frame is calculated according to the respective weighting factor of the associated l.sup.th video program. |
20120260031 | 13245211 | 0 | 1. A data processing system comprising: a central processing unit executing program instructions to manipulate data; an external interface; at least one level one cache connected to said central processing unit temporarily storing at least one of program instructions for execution by said central processing unit and data for manipulation by said central processing unit; a level two memory connected to said at least one level one cache, said level two memory including a level two unified cache temporarily storing instructions and data for supply of instructions and data to said at least one level one cache, and a directly addressable memory; and a level two memory controller connected to said at least one level one cache, said level two memory and said external interface, said level two memory including a directly addressable memory read pipeline connected to said at least one level one cache receiving read requests for data stored in said directly addressable memory, a central processing unit write pipeline receiving central processing write requests to addressed stored in said directly addressable memory, an external cacheable pipeline receiving read accesses and write accesses to external memory at cacheable addresses, and an external non-cacheable pipeline receiving read accesses and write accesses to external memory at non-cacheable addresses. |
8869121 | 13177820 | 1 | 1. A computer-implemented method for compiling high-level software programs into instruction level parallel code, comprising: generating a code graph, line by line, wherein a line, p, comprises one or more of nodes that are executed within one clock unit, a node comprising one or more operations; in a first analysis, analyzing a line, by a computer processor, for nodes that may be executed simultaneously, the analysis determining a; content PAR{ }, each term in PAR{ } is process simultaneously; in a second analysis, analyzing, by the processor, a line for nodes that may be sequentially executable from a previous line to yield a content VEC{ }, each term in VEC{ } is processed in succession; and determining the configuration of a next line depending on the first and second analyses, wherein a value of PAR(p), PAR(p) comprising the number of nodes that may be executed simultaneously at a certain stage (p), being less than (p) in a given line determines that the number of nodes in the next line is (p); wherein if (p)is no less than PAR(p), determining that the number of nodes to be executed in the next line the number of node defined by PAR{ }; and wherein a value of VEC being less than 1 determines that a node in the next line not be successive. |
20140195498 | 13738300 | 0 | 1. A method for real-time reduction of CPU overhead for data compression by a processor device in a computing environment, the method comprising: applying non-compressing heuristics on a randomly selected data sample from data sequences for determining whether to compress the data sequences by calculating a compression potential based on the non-compressing heuristics, wherein the compression potential is compared to a threshold value; and performing one of: compressing the data sequences if the compress threshold is matched, compressing the data sequences using Huffman coding if Huffman coding threshold is matched, and storing the data sequences without compression. |
8701014 | 10715213 | 1 | 1. A method comprising: receiving, from a user, login information to a communications service for a first account of the user; in response to receiving the login information to the communications service for the first account of the user, and using at least one processor, logging the user in to the first account and a second account of the user using only the received login information for the first account, wherein the second account differs from the first account; using a graphical user interface to enable selection, by the user from among the first account and the second account, of a particular source account from which to initiate an electronic communication; sending, the electronic communication to a second user; and identifying the electronic communication sent to the second user as having been sent from the particular source account selected by the user. |
9558257 | 14256982 | 1 | 1. A system for synchronizing data between a first-database and a second-database comprising: a memory; and a client configured for determining whether a retrieval request requires a synchronization of the second-database before processing the received retrieval request, wherein the system partially synchronizes the second-database from the first-database with only that portion of the first-database associated with the retrieval request in response to determining whether synchronization is required and for processing the retrieval request from the second-database, wherein the system, in response to issuing the retrieval request to the second-database, extracts from the first-database, differential data corresponding with the retrieval request between a first data set in the first-database and a second data set in the second-database as a retrieval target of the retrieval request, wherein the retrieval request includes a current retrieval request and a future retrieval request, wherein the future retrieval request is configured for issuance after the current retrieval request, and wherein the system, updates the second data set by applying only the differential data corresponding with the retrieval request to the second-database and by recording a time of updating the second data set, wherein the updated second data set is the retrieval target of the retrieval request, and wherein the differential data corresponding with the retrieval request represents only a portion of data out of all possible data sets that differ between the first-database and the second-database, and wherein the differential data indicates a difference between the second data set at a time of issue of a past retrieval request wherein the time of issue of the past retrieval issued before the retrieval request, and the second data set at the time of issue of the retrieval request. |
8963651 | 13783086 | 1 | 1. An electronically-implemented method of compensating for a temperature offset in a crystal reference signal, the method comprising: obtaining an indication of a temperature; computing a temperature compensation value based on the indication of temperature and three values of a piecewise linear temperature compensation approximation, the piecewise linear temperature compensation approximation representing an approximation of frequency error of a crystal reference signal originating from a crystal over temperature as at least three linear segments, wherein said computing comprises using an algorithm for computing temperature compensation values on each of the three linear segments based on the same three values; and compensating for a temperature offset in the crystal reference signal by adjusting a division ratio of a fractional divider in a phase-locked loop based on the temperature compensation value, the phase-locked loop configured to lock a phase of a frequency divided version of an output signal of the phase-locked loop to the crystal reference signal. |
8789192 | 13442636 | 1 | 1. A method for generating a vulnerability score associated with en-information technology assets of an enterprise, said method comprising: collecting results of at least one vulnerability assessment conducted on the information technology assets by at least one vendor tool; analyzing each result for base score metrics, wherein steps of said analyzing each result for base score metrics comprising: retrieving National Vulnerability Database (NVD) information; when Common Vulnerabilities and Exposures (CVE) is present, retrieving base score metrics from an NVD repository; when Common Weakness Enumeration (CWE) is present and CWE is mapped to one or more CVEs, retrieving Common Vulnerability Scoring System (CVSS) base score metrics for associated one or more CVEs from the NVD repository; when CWE is present and CWE is mapped to one or more CVEs and a plurality of CVEs are retrieved, using CVSS base score metrics to generate a pseudo-CVE from retrieved CVEs when CWE is present and CWE is not mapped to one or more CVEs, using CVSS base score metrics to generate a pseudo-CVE based on result details; and when CVE is not present and CWE is not present, using CVSS base score metrics to generate a pseudo-CVE based on result details; analyzing each result for temporal score metrics; analyzing each result for environment score metrics; and generating a CVSS score for each result based on the base score metrics, temporal score metrics and environment score metrics for each result, wherein one or more of said steps of collecting results of at least one vulnerability assessment, analyzing each result for base score metrics, analyzing each result for temporal score metrics, analyzing each result for environment score metrics, and generating a CVSS score for each result are performed on a computer hardware platform having a processing module executing computer program code stored on a memory module of the computer hardware platform. |
20110264950 | 13080446 | 0 | 1. A method for a check request operation, the method comprises: generating a payload section of a dispersed storage network (DSN) frame regarding the check request operation by: generating one or more slice name fields of the payload section to include one or more slice names corresponding to one or more encoded data slices; and generating a transaction number field of the payload section to include a transaction number corresponding to the check request operation; and generating a protocol header of the DSN frame by: generating a payload length field of the protocol header to include a payload length that represents a length of the payload section; and generating remaining fields of the protocol header. |
20110225163 | 12951247 | 0 | 1. An apparatus for assigning a tag content item stored within a digital content environment, said apparatus comprising: memory; one or more programs stored in the memory; and one or more processors configured to execute the one or more programs, the one or more programs comprising instructions to: receive an activity log for the content item, said activity log including data indicating search queries resulting in the location of the content item by a search engine; determine at least one keyword in a search query based on the activity log that resulted in location of the content item; and assign a tag to the content item, wherein the tag is associated with the at least one keyword; and a data store configured to store the data indicating search queries. |
20070176947 | 11687232 | 0 | 1. A system for linking together digital information objects of a digital information space comprising: at least one overlay maintained outside of the digital information space, at least a portion of the at least one overlay passed to an agent for information processing; at least one concept node within each overlay, each concept node expressing one concept, each concept defined by at least one keyword; and at least one information node within each overlay, each information node representing one of the digital information objects; wherein a link between an accessed digital information object in the digital information space and each of the at least one concept node is established by the user if the accessed digital information object and the overlay include at least one common concept, the link being omitted absent at least one common concept. |
9167015 | 14317302 | 1 | 1. A method for servicing a client request for a streaming media (SM) object in a network having a content server which hosts SM objects for distribution over the network through a plurality of helper servers (HSs) to a plurality of clients, the SM object being comprised of a plurality of successive time-ordered chunks, the method comprising: receiving a request for at least a portion of an SM object at a local HS, the request including a playback starting time; determining whether or not the request can be satisfied by the local HS, the request being satisfied when a chunk having a starting time equal to the requested playback starting time resides on a disk associated with the local HS; determining whether there are any additional chunks on the local HS that follow the chunk that satisfies the request in consecutive time order; when it is determined that the request can be initially satisfied by the local HS, delivering to one of the plurality of clients the one or more chunks having an associated starting time equal to the requested playback starting time from the local HS and updating the playback starting time when the end of the SM object has not been reached after delivery; when it is determined that the request cannot be satisfied or continue to be satisfied by the local HS, identifying a server in the network that is not the content server storing at least a predetermined M chunks having a starting time equal to one of the requested playback starting time, when the request cannot be initially satisfied by the local HS, or the updated playback starting time, when the request cannot continue to be satisfied by the local HS, according to a minimum normalized cost function; delivering to the one of the plurality of clients the identified M chunks and updating the playback starting time when the end of the SM object has not been reached; when it is determined that the request cannot be satisfied or continue to be satisfied by the local HS or remote HS in the network that is not the content server, delivering to one of the plurality of clients the one or more chunks from the content server the one or more chunks having an associated starting time equal to the requested playback starting time or the updated playback starting time until it is determined that the local HS or remote HS can satisfy the request or until the end of the SM object has been reached, whichever comes first, and updating the playback starting time when the end of the SM object has not been reached; and when requests are not satisfied by the local HS, receiving the chunks from the identified server at the local HS until it is determined that a next chunk to be retrieved is stored at the local HS. |
20160026444 | 14807308 | 0 | 1. A system for an agnostic runtime architecture, comprising: a system emulation/virtualization converter; an application code converter; and a converter wherein a system emulation/virtualization converter and a application code converter implement a system emulation process, and wherein the system converter implements a system and application conversion process for executing code from a guest image, wherein the system converter or the system emulator: a reordering process through JIT (just in time) optimization that ensures loads do not dispatch ahead of other loads that are to the same address, wherein a load will check for a same address of subsequent loads from a same thread; a thread checking process that enable other thread store checks against the entire load queue and a monitor extension. |
20150278268 | 14224308 | 0 | 1. A non-transitory computer-readable storage device storing data for access by an application executed on a data processing system, the storage device comprising: a data structure stored on the storage device and usable by the application, the data structure including: an encoding dictionary that stores entries, each entry having a value and a respective value identifier; a decoding dictionary that stores the entries, including the values and the value identifiers; and an attribute vector that stores the value identifiers and a cross-referencing index for each value identifier; wherein: the entries in the encoding dictionary are ordered according to the values; the entries in the decoding dictionary are ordered according to the value identifiers; and the cross-referencing index identifies corresponding characteristics across attribute vectors. |
8490068 | 11698524 | 1 | 1. A method for feature migration comprising: defining a first specification of a first application by: defining a first service specification describing a plurality of operations supported by the first application, wherein the first service specification comprises a first feature element describing a first operation of the plurality of operations, and wherein the first service specification fails to describe a second operation of the plurality of operations; defining a first presentation specification describing a user interaction with the first application, wherein the first presentation specification comprises a second feature element defining a first user interface component having a set of controls, resources, and layouts for accessing functionality of the first operation based on user input of a user, wherein the set of controls, resources, and layouts are independent of the user input, and wherein the second feature element fails to define any user interface component associated with the second operation; defining a first binding specification describing a mapping between the first presentation specification and the first service specification, wherein the first binding specification comprises a third feature element, wherein the third feature element groups the first feature element and the second feature element; and defining a feature specification of a feature in the first application, wherein the feature specification comprises references to the first feature element, the second feature element, and the third feature element; generating, using a computer processor, first code for the first application based on the first specification; defining a profile specification of a second application; importing, using the computer processor, the feature specification of the feature into the profile specification, wherein importing the feature specification imports, into the profile specification, the first feature element describing the first operation, the second feature element defining the first user interface component, and the third feature element grouping the first feature element and the second feature element; and generating second code for the second application using the profile specification to implement a second user interface component based on the first user interface component, wherein the feature is incorporated in the second application to support the first operation, wherein the user accesses, within the second application, functionality of the first operation using the second user interface component, and wherein the feature fails to support the second operation in the second application. |
8850528 | 13299004 | 1 | 1. A method of authorizing a subject to perform an action on an object in a cloud computing environment having a plurality of computing nodes, the method comprising: receiving a request by a user for performing an action in the cloud computing system the request comprising a first key-value pair identifying the action and a second key-value pair identifying the object upon which the action is to be performed; determining, from a plurality of permissions, whether an object permission exists having an identifier that matches the value of the key-value pair in the request identifying the object upon which the action is to be performed, each of the plurality of permissions comprising at least one object permission key-value pair defining a delegation path of permission for the object; determining, from the plurality of permissions, whether a user permission exists for the user making the request to act upon the object, each of the plurality of permissions comprising at least one user permission key-value pair defining a delegation path of permission for the user; authorizing the request based on the object permission and user permission for the action on the object in response to determining that both the object permission and the user permission exist; and denying the request in response to determining that at least one of the object permission or the user permission does not exist. |
8291173 | 12840007 | 1 | 1. A logic device, comprising: first and second data bus interfaces configured to be coupled to a bidirectional data bus, the bidirectional data bus configured to transfer read data in a first direction between the first and second bus interfaces and to transfer write data in a second direction opposite of the first direction between the first and second bus interfaces; and a bypass circuit coupled to the first and second data bus interfaces and configured to store write data from the bidirectional data bus to transfer the write data from the first data bus interface to the second data bus interface in the second direction instead of over the bidirectional data bus to allow read data to be transferred on the bidirectional data bus from the second data bus interface to the first data bus interface in the first direction, the bypass circuit further configured to restore stored write data to the bidirectional data bus to complete the transfer of the write data, wherein the bypass circuit is configured to be controlled responsive to a bypass signal. |
8010503 | 11650768 | 1 | 1. A method for restoring a file which has been deleted from a data storage system, comprising: determining if the file was deleted from an active file system of the data storage system; creating, in response to the deleted file having been deleted from the active file system, a set of twin pointers by copying from latest pointers in the active file system before the file was deleted; creating a new set of pointers; comparing a pointer from the twin pointers with a pointer from a snapshot of the active file system, the snapshot being a consistency point of the active file system at a time earlier than the deletion of the file; writing, in response to the pointer from the twin pointers pointing to a same data block as the pointer from the snapshot, the twin pointer into the new set of pointers; determining, in response to the pointer from the twin pointer not pointing to the same data block as the pointer from the snapshot, if the block pointed to by the twin pointer is allocated in the active file system; copying, if the block is allocated in the active file system, a data of the block to a new block in the active file system, to restore the file to data changed since the snapshot was taken; copying, if the block is not allocated in the active file system, pointers of the snapshot to the set of new pointers, to restore the file to data of the snapshot; and writing the new set of pointers into the active file system to restore the file to the active file system. |
20090094422 | 12199264 | 0 | 1. A network storage system for archiving data, the network storage system comprising: one or more modular drive bays, each modular drive bay comprising: one or more drive ports, each drive port separately addressable; one or more data cartridge connectors, each data cartridge connector electrically connected to a drive port; one or more removable disk drives, the one or more removable disk drives operable to store archival data, each removable disk drive further operable to be inserted into one of the drive ports, each removable disk drive comprising: a data cartridge case; a connector electrically connected to one of the one or more data cartridge connectors, the connector physically attached to the data cartridge case; and an embedded memory, the embedded memory physically attached to the data cartridge case, the embedded memory electrically connected to the connector, the embedded memory operable to store archival data; and wherein the network storage system is partitioned to include one or more application layer partitions, each application layer partition associated with one or more drive ports such that the one or more removable disk drives inserted into the one or more drive ports provide storage for the application layer partition. |
20130124703 | 13562444 | 0 | 1. An apparatus for setting up a gateway for an AUTomotive Open System ARchitecture (AUTOSAR)-based vehicle network, comprising: a candidate selection unit for selecting an Electronic Control Unit (ECU) connected to at least two communication clusters, from among a plurality of ECUs, as a gateway candidate; and a gateway generation unit for generating a gateway instance with reference to the ECU selected by the candidate selection unit, and generating a gateway meta-model including the gateway instance based on instance generation input values entered by a user. |
20100157686 | 12715996 | 0 | 1. An integrated circuit memory device, comprising: a plurality of memory cells including a memory cell selected for programming; a plurality of word lines coupled to the memory cells, the plurality of word lines including a first word line and a second word line; and a circuit coupled to the word lines, the circuit adapted to program the memory cell selected for programming, by performing: during a first programming period, provide a first voltage to the first word line and a second voltage to the second word line, and during a second programming period, provide a third voltage to the first word line and a fourth voltage to the second word line, wherein an absolute value of the third voltage is larger than an absolute value of the first voltage, and an absolute value of the fourth voltage is larger than an absolute value of the second voltage. |
9836646 | 14884361 | 1 | 1. A method for selecting character candidates in a method for identifying characters in a digital image, the method comprising the steps of: a) applying a first character identification process to determine first character candidates and a list of segmentation points of the first character candidates, b) generating a list of character widths corresponding to a segmentation point from the list of segmentation points, c) determining a portion of the digital image corresponding to the segmentation point and a character width from the list of character widths, d) applying a character classification method on the portion of the digital image to obtain an ID hypothesis of a character possibly present in the portion of the digital image and a likelihood parameter that relates to a likelihood that the ID hypothesis is correct, and e) selecting the ID hypothesis as a second character candidate in the digital image if the likelihood parameter fulfils a first predetermined criterion. |
9866864 | 15581275 | 1 | 1. A moving picture decoding device that decodes a bitstream obtained by coding a moving picture using a motion vector in units of blocks obtained by partitioning each picture, comprising: a decoding unit that decodes information representing a motion vector predictor index to be selected in a motion vector predictor candidate list; a motion vector predictor candidate constructing unit that derives first and second motion vector predictor candidates from a motion vector of one of decoded blocks neighboring a decoding target block in a same picture as the decoding target block, and derives a third motion vector predictor candidate from a motion vector of one of blocks of a decoded picture different from the decoding target block; a motion vector predictor candidate adding unit that adds the first to third motion vector predictor candidates satisfying a certain condition to a motion vector predictor candidate list; a redundant motion vector predictor candidate determining unit that deletes the second motion vector predictor candidate from the motion vector predictor candidate list when the first and second motion vector predictor candidates added to the motion vector predictor candidate list by the motion vector predictor candidate adding unit have the same values; a motion vector predictor candidate limiting unit that repeatedly adds a motion vector predictor candidate having a same value to the motion vector predictor candidate list until the number of motion vector predictor candidates reaches a certain number when the number of the motion vector predictor candidates added to the motion vector predictor candidate list is smaller than the certain number (a natural number larger than or equal to 2); and a motion vector predictor selecting unit that selects a motion vector predictor of the decoding target block from the motion vector predictor candidate list based on the decoded information representing the motion vector predictor index to be selected, wherein: the redundant motion vector predictor candidate determining unit does not compare the value of the first motion vector predictor candidate and the value of the second motion vector predictor candidate with the third motion vector predictor candidate; and the motion vector predictor candidate limiting unit deletes the motion vector predictor candidates exceeding the certain number from the motion vector predictor candidate list generated by the motion vector predictor candidate adding unit. |