| 09th week of 2011 patent applcation highlights part 79 |
| Patent application number | Title | Published |
|---|
| 20110055484 | Detecting Task Complete Dependencies Using Underlying Speculative Multi-Threading Hardware - Mechanisms are provided for tracking dependencies of threads in a multi-threaded computer program execution. The mechanisms detect a dependency of a first thread's execution on results of a second thread's execution in an execution flow of the multi-threaded computer program. The mechanisms further store, in a hardware thread dependency vector storage associated with the first thread's execution, an identifier of the dependency by setting at least one bit in the hardware thread dependency vector storage corresponding to the second thread. Moreover, the mechanisms schedule tasks performed by the multi-threaded computer program based on the hardware thread dependency vector storage to minimize squashing of threads. | 2011-03-03 |
| 20110055485 | EFFICIENT PSEUDO-LRU FOR COLLIDING ACCESSES - An apparatus for allocating entries in a set associative cache memory includes an array that provides a first pseudo-least-recently-used (PLRU) vector in response to a first allocation request from a first functional unit. The first PLRU vector specifies a first entry from a set of the cache memory specified by the first allocation request. The first vector is a tree of bits comprising a plurality of levels. Toggling logic receives the first vector and toggles predetermined bits thereof to generate a second PLRU vector in response to a second allocation request from a second functional unit generated concurrently with the first allocation request and specifying the same set of the cache memory specified by the first allocation request. The second vector specifies a second entry different from the first entry from the same set. The predetermined bits comprise bits of a predetermined one of the levels of the tree. | 2011-03-03 |
| 20110055486 | RESISTIVE MEMORY DEVICES AND RELATED METHODS OF OPERATION - A method of processing data in a resistive memory device comprises performing a write operation to store data into a resistive memory of the resistive memory device and to store program information of the data into a cache memory. The method further comprises performing a first read operation to read the program information from the cache memory during a program-to-active time, and a second read operation to read the data from the resistive memory after the program-to-active time if the program information is not read from the cache memory during the program-to-active time. | 2011-03-03 |
| 20110055487 | OPTIMIZING MEMORY COPY ROUTINE SELECTION FOR MESSAGE PASSING IN A MULTICORE ARCHITECTURE - In one embodiment, the present invention includes a method to obtain topology information regarding a system including at least one multicore processor, provide the topology information to a plurality of parallel processes, generate a topological map based on the topology information, access the topological map to determine a topological relationship between a sender process and a receiver process, and select a given memory copy routine to pass a message from the sender process to the receiver process based at least in part on the topological relationship. Other embodiments are described and claimed. | 2011-03-03 |
| 20110055488 | HORIZONTALLY-SHARED CACHE VICTIMS IN MULTIPLE CORE PROCESSORS - A processor includes multiple processor core units, each including a processor core and a cache memory. Victim lines evicted from a first processor core unit's cache may be stored in another processor core unit's cache, rather than written back to system memory. If the victim line is later requested by the first processor core unit, the victim line is retrieved from the other processor core unit's cache. The processor has low latency data transfers between processor core units. The processor transfers victim lines directly between processor core units' caches or utilizes a victim cache to temporarily store victim lines while searching for their destinations. The processor evaluates cache priority rules to determine whether victim lines are discarded, written back to system memory, or stored in other processor core units' caches. Cache priority rules can be based on cache coherency data, load balancing schemes, and architectural characteristics of the processor. | 2011-03-03 |
| 20110055489 | Managing Counter Saturation In A Filter - Filters and methods for managing presence counter saturation are disclosed. The filters can be coupled to a collection of items and maintain information for determining a potential presence of an identified item in the collection of items. The filter includes a filter controller and one or more mapping functions. Each mapping function has a plurality of counters associated with the respective mapping function. When a membership status of an item in the collection of items changes, the filter receives a membership change notification including an identifier identifying the item. Each mapping function processes the identifier to identify a particular counter associated with the respective mapping function. If a particular counter has reached a predetermined value, a request including a reference to the particular counter is sent to the collection of items. The filter receives a response to the request and modifies the particular counter as a result of the response. | 2011-03-03 |
| 20110055490 | Memory Sharing Arrangement - A digital system is provided with a memory interposer module configured to be coupled between a processor module and a memory module. The memory interposer module has a memory controller configured to couple to the memory module. It also includes a first memory emulator configured to couple to the processor module via a connector, wherein the first memory emulator is configured to emulate the memory module. There is an arbiter coupled between the memory controller and the memory emulator. A second memory emulator is connected to the arbiter, wherein the second memory emulator is also configured to emulate the memory module. Each memory emulator is operable to stall a memory request when a conflict occurs. | 2011-03-03 |
| 20110055491 | SIMULTANEOUS SWITCHING OF MULTIPLE TIME SLOTS IN AN OPTICAL NETWORK NODE - A switching frame buffer is described in which data units within a sequence of time slots, of a frame, may be simultaneously input and output at ports of the switching frame buffer. In one implementation, a write port may receive data units within a single cycle of the switch. A number of memories may be provided, where first selected ones of the memories constitute memory groups and second selected ones of the memories constitute a memory subsets, each of the memory groups including a corresponding one of the memory subsets. The write port may supply each of a number of copies of the data units to a corresponding one of the memory subsets. Multiplexers may be associated with the groups of the memories and a read port may receive one of the copies of a number of the data units from different ones of the multiplexers. | 2011-03-03 |
| 20110055492 | MULTIPLE PROCESSING CORE DATA SORTING - Sorting data using a multi-core processing system is disclosed. An unsorted data set is copied from a global memory device to a shared memory device. The global memory device can store data sets for the multi-core processing system. The shared memory device can store unsorted data sets for sorting. The unsorted data set can include a plurality of data elements. The unsorted data set can be sorted into sorted data in parallel on the shared memory device using a cluster of processors of the multi-core processing system. The cluster of processors may include at least as many processors as a number of the data elements in the unsorted data set. The sorted data can be copied from the shared memory device to the global memory device. | 2011-03-03 |
| 20110055493 | TRANSACTION BASED SHARED DATA OPERATIONS IN A MULTIPROCESSOR ENVIRONMENT - The apparatus and method described herein are for handling shared memory accesses between multiple processors utilizing lock-free synchronization through transactional-execution. A transaction demarcated in software is speculatively executed. During execution invalidating remote accesses/requests to addresses loaded from and to be written to shared memory are tracked by a transaction buffer. If an invalidating access is encountered, the transaction is re-executed. After a pre-determined number of times re-executing the transaction, the transaction may be re-executed non-speculatively with locks/semaphores. | 2011-03-03 |
| 20110055494 | METHOD FOR DISTRIBUTED DIRECT OBJECT ACCESS STORAGE - Methods and apparatus are described for a horizontally scalable high performance object storage architecture. Metadata are completely decoupled from object storage. Instead of file names, users are given a locator when the object is uploaded and committed. Users can store the locator along with their own metadata or embed it directly in the static content. Clients can choose which storage nodes to store data on based on dynamic measures of node performance. Since there is no coupling among storage servers, performance can scale horizontally by adding more nodes. The decoupling also allows the front end services and storage to scale independently. High service availability is achieved by object-level synchronous replication and having no single point of failure. Failed nodes are rebuilt using copies of data in other nodes without taking the cluster offline. In addition to the replication, the ability to add or remove nodes on-line reduces maintenance-related service downtime. | 2011-03-03 |
| 20110055495 | Memory Controller Page Management Devices, Systems, and Methods - Memory controller page management devices, systems, and methods are disclosed. In one embodiment, a memory controller is configured to access memory in response to a memory access request. The memory controller is configured to apply a page management policy to either leave open or close a memory page based on at least identification information of a requestor. In this manner, a memory page management policy can be applied by the memory controller to optimize memory access times and reduce latency based on the identification of the requestor. For example, the requestor may be associated with sequential or series of memory access requests to the same memory such that a leave open page management policy would be optimal for reduced memory access times. As another example, the requestor may be associated with memory access requests to random memory pages such that a close page management policy would be optimal for reduced memory access times. | 2011-03-03 |
| 20110055496 | SIGNAL PROCESSOR, TRANSMISSION APPARATUS, AND METHOD FOR PROCESSING SIGNAL - A signal processor includes a processor that counts the number of input data pieces or a size of each of the input data pieces; a first memory that stores a result of the counting by the processor; and a second memory that records whether the result of the counting exceeds a capacity of the first memory. | 2011-03-03 |
| 20110055497 | Alignment and Ordering of Vector Elements for Single Instruction Multiple Data Processing - The present invention provides alignment and ordering of vector elements for SIMD processing. In the alignment of vector elements for SIMD processing, one vector is loaded from a memory unit into a first register and another vector is loaded from the memory unit into a second register. The first vector contains a first byte of an aligned vector to be generated. Then, a starting byte specifying the first byte of an aligned vector is determined. Next, a vector is extracted from the first register and the second register beginning from the first bit in the first byte of the first register continuing through the bits in the second register. Finally, the extracted vector is replicated into a third register such that the third register contains a plurality of elements aligned for SIMD processing. In the ordering of vector elements for SIMD processing, a first vector is loaded from a memory unit into a first register and a second vector is loaded from the memory unit into a second register. Then, a subset of elements are selected from the first register and the second register. The elements from the subset are then replicated into the elements in the third register in a particular order suitable for subsequent SIMD vector processing. | 2011-03-03 |
| 20110055498 | METHOD AND APPARATUS FOR DE-DUPLICATION AFTER MIRROR OPERATION - An amount of storage capacity used during mirroring operations is reduced by applying de-duplication operations to the mirror volumes. Data stored to a first volume is mirrored to a second volume. The second volume is a virtual volume having a plurality of logical addresses, such that segments of physical storage capacity are allocated for a specified logical address as needed when data is stored to the specified logical address. A de-duplication operation is carried out on the second volume following a split from the first volume. A particular segment of the second volume is identified as having data that is the same as another segment in the second volume or in the same consistency group. A link is created from the particular segment to the other segment and the particular segment is released from the second volume so that physical storage capacity required for the second volume is reduced. | 2011-03-03 |
| 20110055499 | Managing Backup Relationships in a Data Storage System - A method for re-establishing a backup relationship between first and second volumes associated with one or more storage media in a data storage system is provided. The method comprises storing first information for preserving the backup relationship, in response to or in advance of receiving a request to terminate the backup relationship; recording changes to the first or second volumes that occur subsequent to terminating the backup relationship; and re-establishing the backup relationship between the first and second volumes according to the first information such that the first and second volumes are synchronized by merging the recorded changes with the first or second volumes. | 2011-03-03 |
| 20110055500 | Data Storage Snapshot With Reduced Copy-On-Write - Producing snapshots of data stored on a data storage device, the method including producing a first snapshot of data stored in a set of data storage units on a data storage device, where the first snapshot is allowed to include data written to the set of data storage units during the production of the first snapshot, and producing a second snapshot of the data stored in the set of data storage units on the data storage device, where the production of the second snapshot is begun after the completion of the first snapshot, and where the second snapshot includes only data present in the set of data storage units before the production of the second snapshot is begun. | 2011-03-03 |
| 20110055501 | DATA BACKUP MANAGEMENT SYSTEM, COMPUTER SYSTEM, AND PROGRAM RECORDING MEDIUM - In a backup management system, data is copied remotely from a backup source volume to an intermediate volume. When access by a host ends and a backup time arrives, data is copied locally from the intermediate volume to a backup target volume. During a data restore, a user is able to select not only backup target volumes but also the intermediate volume as restore source candidates. | 2011-03-03 |
| 20110055502 | DATA LOGGER, DATA SAVING METHOD AND PROGRAM - It is an object to provide a data logger which solves a problem in which data required to analyze a cause of occurrence of abnormality cannot be acquired. Temporary memory | 2011-03-03 |
| 20110055503 | REMOTE ONLINE BACKUP SYSTEM AND METHOD BASED ON STAGER FRAGMENTED TRANSMISSION - The present invention provides a remote online backup method based on stager fragmented transmission, comprising: defining a journal storage system as a journal relay system, i.e., a Journal Stager; dividing the Journal Stager into a Local Journal Stager and a Remote Journal Stager to optimize backup transmission performance of the whole online backup system; setting between the Local Journal Stager and the Remote Journal Stager a transmitter, by which a journal is transmitted from one stager to another stager; applying the journal to a backup storage device through a Journal Replayer at a backup destination site. | 2011-03-03 |
| 20110055504 | STORAGE SYSTEM - When a computer | 2011-03-03 |
| 20110055505 | DATA COPYING - A method, computer management apparatus, and computer program product are provided for copying data in a data processing system. The data processing system includes a host and a plurality of locations. A difference recording operation between a first location of the plurality of locations and a second location of the plurality of locations is started. A first operational relationship between a third location of the plurality of locations and the first location is started. A signal is sent is response to the first operational relationship starting after the difference recording operation. A first dataset is updated in response to the host writing data to at least one of the first location or the second location. The first dataset is updated with changes to the first location in response to the signal. | 2011-03-03 |
| 20110055506 | Storage System and Method of Producing Recovery Volume - A storage system for writing data sent from a computer to storage regions is described. The storage system includes storage regions configured to store data, and a controller coupled with the storage regions. The controller is configured to control writing of the data from the computer. The controller is further configured to set a first storage region for writing data sent from the computer to a second storage region. The controller then acquires a snapshot of the first storage region at a predetermined time, writes a snapshot journal for the snapshot to the second storage region, and manages a snapshot management table. The controller also acquires a recovery point journal when a recovery volume designated by the computer is made, and writes the recovery point journal to the second storage region. | 2011-03-03 |
| 20110055507 | SYSTEM AND METHOD FOR RESTRICTING THE FUNCTION OF A STORAGE DEVICE BASED ON GEOGRAPHICAL LOCATION - A storage device capable of restricting its functions based on its geographical location is disclosed. In one embodiment, the storage device comprises a storage module for storing data; a positioning module, the positioning module determines the current location of the storage device; and a control module, the control module determines if the storage device is located within an area for function-restriction; and if so, one or more storage functions of the storage module is restricted; if not, the storage module assumes normal operation. | 2011-03-03 |
| 20110055508 | Information processing apparatus, data transfer method, and computer-readable recording medium - An information processing apparatus includes a first storage for storing pre-existing data including a program for operating the information processing apparatus; an input unit for inputting data into the information processing apparatus from outside via a recording medium; a detecting unit for detecting that a second storage is additionally installed in the information processing apparatus; a display unit for prompting input of the recording medium recording a data transfer program, when it is detected that the second storage is additionally installed; and a transfer unit for transferring the pre-existing data from the first storage to the second storage in accordance with the data transfer program, when the data transfer program recorded in the recording medium is input by the input unit. The transfer unit temporarily saves the pre-existing data in a save area in the recording medium before transferring the pre-existing data to the second storage unit. | 2011-03-03 |
| 20110055509 | CONTROL COMPONENT FOR CONTROLLING A DELAY INTERVAL WITHIN A MEMORY COMPONENT - Disclosed herein are embodiments of an asynchronous memory device that use internal delay elements to enable memory access pipelining. In one embodiment, the delay elements are responsive to an input load control signal, and are calibrated with reference to periodically received timing pulses. Different numbers of the delay elements are configured to produce different asynchronous delays and to strobe sequential pipeline elements of the memory device. | 2011-03-03 |
| 20110055510 | EFFICIENTLY IMPLEMENTING A PLURALITY OF FINITE STATE MACHINES - A method and program product for processing data by a pipeline of a single hardware-implemented virtual multiple instance finite state machine (VMI FSM). An input token of multiple input tokens is selected to enter a pipeline of the VMI FSM. The input token includes a reference to an FSM instance. In one embodiment, the reference is an InfiniBand QP number. After being received at the pipeline, a current state and context of the FSM instance are fetched from an array based on the reference and inserted into a field of the input token. A new state of the FSM instance is determined and an output token is generated. The new state and the output token are based on the current state, context, a first input value, and an availability of a resource. The new state of the first FSM instance is written to the array. | 2011-03-03 |
| 20110055511 | Interlocked Increment Memory Allocation and Access - A method of allocating a memory to a plurality of concurrent threads is presented. The method includes dynamically determining writer threads each having at least one pending write to the memory; and dynamically allocating respective contiguous blocks in the memory for each of the writer threads. Another method of allocating a memory to a plurality of concurrent threads includes launching the plurality of threads as a plurality of wavefronts, dynamically determining a group of wavefronts each having at least one thread requiring a write to the memory, and dynamically allocating respective contiguous blocks in the memory for each wavefront from the group of wavefronts. A corresponding method of assigning a memory to a plurality of reader threads includes determining a first number corresponding to a number of writer threads having a block allocated in said memory, launching a first number of reader threads, entering a first wavefront of said reader threads from said group of wavefronts to an atomic operation, and assigning a first block in the memory to the first wavefront during the corresponding atomic operation, where the first block is contiguous to a previously allocated block dynamically allocated to another wavefront from said group of wavefronts. Corresponding system embodiments and computer program product embodiments are also presented. | 2011-03-03 |
| 20110055512 | TAPE FEEDER, REMOVABLE UNIT FOR ELECTRONIC COMPONENT MOUNTING, AND ELECTRONIC COMPONENT MOUNTING APPARATUS - To provide a tape feeder and an electronic component mounting apparatus that enables easy, reliable recognition of a model of an individual subjected to a specification change after factory shipment. | 2011-03-03 |
| 20110055513 | METHOD AND SYSTEM FOR EXECUTING APPLICATONS, STORAGE MEDIUM CONTROLLER AND STORAGE DEVICE - An application executing method for automatically executing an application stored in a storage unit of an external storage device in an operating system (OS) of a computer host is provided. The method includes dividing the storage unit into a first partition and a second partition; emulating the first partition as compact disc-read only memory (CR-ROM); storing a switch program in the first partition; and storing the application in the second partition. The method also includes providing only the first partition to be accessed by the OS and automatically executing the switch program by the OS to decouple and re-couple the external storage device to the computer host. Additionally, the method further includes providing only the second partition to be accessed by the OS and executing the application when the external storage device is re-coupled to the computer host. | 2011-03-03 |
| 20110055514 | METHOD AND SYSTEM FOR PREFERRED CPU BINDING ON VIRTUAL PARTITIONS - A method and system for binding a preferred CPU to a virtual partition of a computer is disclosed. In one embodiment, a preferred CPU for a virtual partition of a computer is determined upon a receipt of a request to assign a CPU to the virtual partition. Then, the preferred CPU is assigned to the virtual partition when the preferred CPU is available for assignment. Further, the preferred CPU is retained in the virtual partition when the virtual partition is rebooted. | 2011-03-03 |
| 20110055515 | REDUCING BROADCASTS IN MULTIPROCESSORS - Disclosed is an apparatus to reduce broadcasts in multiprocessors including a plurality of processors; a plurality of memory caches associated with the processors; a plurality of translation lookaside buffers (TLBs) associated with the processors; and a physical memory shared with the processors memory caches and TLBs; wherein each TLB includes a plurality of entries for translation of a page of addresses from virtual memory to physical memory, each TLB entry having page characterization information indicating whether the page is private to one processor or shared with more than one processor. Also disclosed is a computer program product and method to reduce broadcasts in multiprocessors. | 2011-03-03 |
| 20110055516 | Multiprocessor Computer System and Method Having at Least One Processor with a Dynamically Reconfigurable Instruction Set - An innovative realization of computer hardware, software and firmware comprising a multiprocessor system wherein at least one processor can be configured to have a fixed instruction set and one or more processors can be statically or dynamically configured to implement a plurality of processor states in a plurality of technologies. The processor states may be instructions sets for the processors. The technologies may include programmable logic arrays. | 2011-03-03 |
| 20110055517 | METHOD AND STRUCTURE OF USING SIMD VECTOR ARCHITECTURES TO IMPLEMENT MATRIX MULTIPLICATION - A structure (and method) including a plurality of coprocessing units and a controller that selectively loads data for processing on the plurality of coprocessing units, using a compound loading instruction. The compound loading instruction includes a plurality of low-level software instructions that preliminarily processes input data in a manner predetermined to simulate an effect of a single hardware loading instruction that would provide optimal loading of complex matrix data by loading input data in accordance with the effect of multiplying i·i=−1. | 2011-03-03 |
| 20110055518 | SAFE AND SECURE MULTICORE SYSTEM - The different advantageous embodiments provide a system for partitioning a data processing system comprising a number of cores and a partitioning process. The partitioning process is configured to assign a number of partitions to the number of cores. Each partition in the number of partitions is assigned to a separate number of cores from the number of cores. | 2011-03-03 |
| 20110055519 | METHOD AND SYSTEM FOR IMPLEMENTING A STREAM PROCESSING COMPUTER ARCHITECTURE - A stream processing computer architecture includes creating a stream computer processing (SCP) system by forming a super node cluster of processors representing physical computation nodes (“nodes”), communicatively coupling the processors via a local interconnection means (“interconnect”), and communicatively coupling the cluster to an optical circuit switch (OCS), via optical external links (“links”). The OCS is communicatively coupled to another cluster of processors via the links. The method also includes generating a stream computation graph including kernels and data streams, and mapping the graph to the SCP system, which includes assigning the kernels to the clusters and respective nodes, assigning data stream traffic between the kernels to the interconnection when the data stream is between nodes in the same cluster, and assigning traffic between the kernels to the links when the data stream is between nodes in different clusters. | 2011-03-03 |
| 20110055520 | SYSTEMS, METHODS AND APPARATUS FOR LOCAL PROGRAMMING OF QUANTUM PROCESSOR ELEMENTS - Systems, methods and apparatus for a scalable quantum processor architecture. A quantum processor is locally programmable by providing a memory register with a signal embodying device control parameter(s), converting the signal to an analog signal; and administering the analog signal to one or more programmable devices. | 2011-03-03 |
| 20110055521 | MICROPROCESSOR HAVING AT LEAST ONE APPLICATION SPECIFIC FUNCTIONAL UNIT AND METHOD TO DESIGN SAME - Customisable embedded processors that are available on the market make it possible for designers to speed up execution of applications by using Application-specific Functional Units (AFUs), implementing Instruction-Set Extensions (ISEs). Furthermore, techniques for automatic ISE identification have been improving; many algorithms have been proposed for choosing, given the application's source code, the best ISEs under various constraints. Read and write ports between the AFUs and the processor register file are an expensive asset, fixed in the micro-architecture—some processors indeed only allow two read ports and one write port—and yet, on the other hand, a large availability of inputs and outputs to and from the AFUs exposes high speedup. Here we present a solution to the limitation of actual register file ports by serialising register file access and therefore addressing multi-cycle read and write. It does so in an innovative way for two reasons: (1) it exploits and brings forward the progress in ISE identification under constraint, and (2) it combines register file access serialisation with pipelining in order to obtain the best global solution. Our method consists of scheduling graphs—corresponding to ISEs—under input/output constraint | 2011-03-03 |
| 20110055522 | REQUEST CONTROL DEVICE, REQUEST CONTROL METHOD AND ASSOCIATED PROCESSORS - A request control device, request control method, and a multiprocessor cooperation architecture. The request control device is connected to a request storage module and includes a comparing means and an identifier means. The comparing means is configured to determine if an incoming first queue unit corresponds to the same message with a queue unit that has existed in the request storage module. The identifier setting means is configured to set a save identifier of the queue unit that has existed in the request storage module to indicate not to save a state associated with the message if the first queue unit corresponds to the same message with the queue unit that has existed in the request storage module. According to the technical solution of the invention, the access to the memory caused by saving/loading the states is reduced and thereby increases the processing speed of the processor. | 2011-03-03 |
| 20110055523 | EARLY BRANCH DETERMINATION - A method and apparatus for branch determination. The method includes a first command issuing within a computer processor, wherein execution of the first command by the computer processor includes evaluating one or more conditions to set one or more flags. The method further includes a second command issuing, subsequent to the first command issuing, within the computer processor, wherein execution of the second command by the computer processor includes causing the computer processor to wait until the one or more flags are set. Subsequent to the first and second commands issuing, the method includes a third command issuing within the computer processor, wherein execution of the third command by the computer processor includes performing a jump operation based on a value of at least one of the one or more flags set by the first command. | 2011-03-03 |
| 20110055524 | PROVIDING THREAD FAIRNESS IN A HYPER-THREADED MICROPROCESSOR - A method and apparatus for providing fairness in a multi-processing element environment is herein described. Mask elements are utilized to associated portions of a reservation station with each processing element, while still allowing common access to another portion of reservation station entries. Additionally, bias logic biases selection of processing elements in a pipeline away from a processing element associated with a blocking stall to provide fair utilization of the pipeline. | 2011-03-03 |
| 20110055525 | PROVIDING THREAD FAIRNESS IN A HYPER-THREADED MICROPROCESSOR - A method and apparatus for providing fairness in a multi-processing element environment is herein described. Mask elements are utilized to associated portions of a reservation station with each processing element, while still allowing common access to another portion of reservation station entries. Additionally, bias logic biases selection of processing elements in a pipeline away from a processing element associated with a blocking stall to provide fair utilization of the pipeline. | 2011-03-03 |
| 20110055526 | METHOD AND APPARATUS FOR ACCESSING MEMORY ACCORDING TO PROCESSOR INSTRUCTION - There is provided a method and apparatus for accessing a memory according to a processor instruction. The apparatus includes: a stack offset extractor extracting an offset value from a stack pointer offset indicating a local variable in the processor instruction; a local stack storage including a plurality of items, each of which is formed of an activation bit indicating whether each item is activated, an offset storing an offset value of a stack pointer, and an element storing a local variable value of the stack pointer; an offset comparator comparing the extracted offset value with an offset value of each item and determining whether an item corresponding to the extracted offset value is present in the local stack storage; and a stack access controller controlling a processor to access the local stack storage or a cache memory according to a determining result of the offset comparator. | 2011-03-03 |
| 20110055527 | METHOD AND SYSTEM FOR GENERATING OBJECT CODE TO FACILITATE PREDICTIVE MEMORY RETRIEVAL - A method and system are described for generating reference tables in object code which specify the addresses of branches, routines called, and data references used by routines in the code. In a suitably equipped processing system, the reference tables can be passed to a memory management processor which can open the appropriate memory pages to expedite the retrieval of data referenced in the execution pipeline. The disclosed method and system create such reference tables at the beginning of each routine so that the table can be passed to the memory management processor in a suitably equipped processor. Resulting object code also allows processors lacking a suitable memory management processor to skip the reference table, preserving upward compatibility. | 2011-03-03 |
| 20110055528 | DATA PROCESSOR - The data processor can form a system including a combination of two or more operating systems running in parallel, which achieves a higher data transfer rate between operating systems and the increase in system performance without impairing the system reliability. In the system, data transfer between domains is performed in an enhanced access mode as well as an access mode in which an access from a domain manager having control of domains is handled as one from the domain manager. The enhanced access mode is arranged by enhancing, to a CPU scale, an access mode in which an access from the domain manager is treated as an access from a software program working on a domain, and the software program of domain manager transfers data between the domains. For example, in case that the domain manager performs data transfer between domains in the enhanced access mode, a read access from the domain manager is disguised as a read access from a first domain, and a write access from the domain manager is disguised as a write access from a second domain. | 2011-03-03 |
| 20110055529 | EFFICIENT BRANCH TARGET ADDRESS CACHE ENTRY REPLACEMENT - A microprocessor includes a branch target address cache (BTAC), each entry thereof configured to store branch prediction information for at most N branch instructions. An execution unit executes a branch instruction previously fetched in a fetch quantum. Update logic determines whether the BTAC is already storing information for N branch instructions within the fetch quantum (N is at least two), updates the BTAC for the branch instruction if the BTAC is not already storing information for N branch instructions, determines whether a type of the branch instruction has a higher replacement priority than a type of the N branch instructions if the BTAC is already storing information for N branch instructions, and updates the BTAC for the branch instruction if the type of the branch instruction has a higher replacement priority than the type of the N branch instructions already stored in the BTAC. | 2011-03-03 |
| 20110055530 | FAST REP STOS USING GRABLINE OPERATIONS - A microprocessor includes a cache memory and a grabline instruction. The grabline instruction specifies a memory address that implicates a cache line of the memory. The grabline instruction instructs the microprocessor to initiate a zero-beat read-invalidate transaction on the bus to obtain ownership of the cache line. The microprocessor foregoes initiating the transaction on the bus when executing the grabline instruction if the microprocessor determines that a store to the cache line would cause an exception. | 2011-03-03 |
| 20110055531 | Synchronizing Commands and Dependencies in an Asynchronous Command Queue - Provided are techniques for the managing of command queue dependencies and command queue synchronization. Incoming commands are actively tracked through their dependency relationships. Command dependencies may be tracked across multiple lists, including a submission list and a completion list. Each command on the submission list is prepared for processing and ultimately submitted to command processing logic. Command completion processing is performed on each command on the completion list, including by not limited to removing dependencies from pending commands and possibly queuing pending commands for submission to the command processing logic. Also provided as features of a command queue are a standby barrier, an active barrier and a marker. Standby and active barriers are employed to synchronize and track commands through the command queue. Markers are employed to track commands through the command queue. | 2011-03-03 |
| 20110055532 | METHOD FOR CONFIGURING AN ELECTRONIC ORGANIZER - This method for configuring an electronic organizer installed in an item of electronic equipment comprises: a step of obtaining, based on digital data resulting from a digitization of a representation of a code, data encoded in this code and comprising at least one item of date information associated with a content; and a step of configuring said electronic organizer in order to program, on at least one date or at at least one time defined by this item of date information, an execution of a function relating to said content. | 2011-03-03 |
| 20110055533 | SYSTEM MANAGEMENT INTERRUPT INTERFACE WRAPPER - In a personal computing system function calls, formatted in 16-bit format for a 16-bit interface to the firmware, are communicated through an operating system providing a System Management Interrupt (SMI) interface to the firmware. An SMI function call in SMI format is generated and sent to an SMI Interface Wrapper module between the operating system and the firmware. The SMI function call is received over the SMI interface at the SMI Interface Wrapper. In the SMI Interface Wrapper, function data from the SMI function call is extracted to provide function call data. A 16-bit function call with the function call data is generated by the SMI Interface Wrapper and passed to the firmware. | 2011-03-03 |
| 20110055534 | Management Method for Security of Computer Device - A management method is adapted for a computer device. The management method comprises: firstly turning on a power source of the computer device; then performing a power-on verification procedure by a BIOS of the computer device; determining whether passing through a power-on verification according to a result of performing the power-on verification procedure; starting an OS of the computer device if passing through the power-on verification; and crashing the computer device if not passing through the power-on verification. | 2011-03-03 |
| 20110055535 | Method of Converting Personal Computers Into Thin Client Computers - A system repurposes a personal computer operating with a conventional personal computer operating system, such as Windows® operating system, into a thin client computer system without requiring that the hard drive of the personal computer be re-formatted to remove the previous operating system. The personal computer has its boot loader configuration file edited to include a call to a thin client boot loader file to execute the thin client operating system stored on the personal computer hard drive instead of the previous operating system of the personal computer. The repurposed personal computer can be returned to the previous operating system by electing to bypass the thin client operating system. As a thin client computer, the repurposed personal computer is managed from a central server and can access applications and data on remote servers instead of using the application programs on the hard drive or the capability of storing data on the personal computer hard drive. | 2011-03-03 |
| 20110055536 | FILE SYSTEM FOR DUAL OPERATING SYSTEMS - Methods, systems, apparatuses and program products are disclosed for managing, activating and controlling file systems sharing among two or more O/S (Operating Systems) and/or the like within a computing apparatus or within a single computer operational session or context. | 2011-03-03 |
| 20110055537 | ELECTRONIC DEVICE AND BOOTING METHOD THEREFOR - An electronic device of multiple operating systems includes a mode selecting module, an operating system selecting module, and a boot loader module. The mode selecting module is capable of selecting a desired booting mode. The operating system selecting module is capable of selecting one of the operating systems according to the selected booting mode. The boot loader module is capable of loading the selected operating system. A booting method for the electronic device is also disclosed. | 2011-03-03 |
| 20110055538 | METHOD AND APPARATUS FOR CONTROLLING OPERATION OF BOOTING VIDEO IMAGE REPRODUCING APPARATUS - A method of controlling an operation of booting an image reproducing apparatus is provided. The method includes: receiving an input signal for powering off the image reproducing apparatus; receiving from a main processor a memory address where an operation status of the image reproducing apparatus is stored, according to the received input signal; storing the received memory address; and converting a system of the image reproducing apparatus into a sleep by the sub-processor. | 2011-03-03 |
| 20110055539 | INFORMATION PROCESSING APPARATUS, AND COMPUTER-READABLE STORAGE MEDIUM HAVING STARTUP/SHUTDOWN CONTROL PROGRAM STORED THEREIN - An information processing apparatus includes a nonvolatile memory, a volatile memory, and a process control section. A startup program to be required when starting up the information processing apparatus has previously been stored in the nonvolatile memory. When a command to start up the apparatus is received, it is determined whether or not the startup program is present in the volatile memory. When the startup program is absent, the startup program is loaded from the nonvolatile memory into the volatile memory. Thereafter, when a command to turn off the power of the information processing apparatus is received, supply of power to other components of the information processing apparatus than the volatile memory is stopped while maintaining supply of power to the volatile memory, thereby to shutdown the power of the information processing apparatus. | 2011-03-03 |
| 20110055540 | Pre-Boot Loader for Reducing System Boot Time - A pre-boot loader reduces the boot time of an operating system (OS). An OS is typically loaded by its own OS loader. A pre-boot loader is typically a software module in the system firmware or the pre-boot environment that loads the OS loader, which in turn loads the OS. In one embodiment, the pre-boot loader bypasses part or all of the steps performed by the OS loader, which shortens the loading time of the OS loader and the OS. In another embodiment, bypassing the steps of the OS loader reduces dependency on the system firmware functions. The system firmware takes advantage of this to further reduce boot time, by executing the pre-boot loader earlier instead of waiting until the full completion of system initialization by the system firmware. | 2011-03-03 |
| 20110055541 | METHOD AND APPARATUS FOR BOOTING HIBERNATION IN A PORTABLE TERMINAL - A method and apparatus for hibernation booting in a mobile terminal supporting two processors are provided. In the hibernation booting method, when power is turned on, a master processor performs hibernation booting. A slave processor performs normal booting under control of the master processor. The master processor and the slave processor determine data needing synchronizing, and perform synchronization depending on whether the data needing synchronizing have been changed. | 2011-03-03 |
| 20110055542 | METHOD FOR ACTIVATING OS, AND PROTOCOL CONVERTER - A protocol converter includes a MBR emulation unit connectable to a connector for an internal hard disk drive and configured to provide MBR in response to a request from a system BIOS, a first interface configured to acquire an OS from a remote hard disk drive through a network in response to an OS acquisition request from a secondary boot loader, a second interface configured to provide the secondary boot loader with the OS acquired by the first interface, and a conversion unit configured to perform conversion between a first protocol to be used by the first interface and a second protocol to be used by the second interface. | 2011-03-03 |
| 20110055543 | WIMAX TERMINAL AND A STARTING METHOD THEREOF - The present invention discloses a starting method of a WiMAX terminal and a terminal thereof, wherein, the starting method comprises: step S202, calculating a load command and a firmware required to be loaded for starting the terminal in advance to obtain a first firmware Hash and a first load command Hash, and storing the first firmware Hash and the first load command Hash in a predefined memory of the terminal; step S204, in response to a starting operation of the terminal, performing starting process and starting a boot loader; step S206, the boot loader executing the load command transmitted by a driver of the terminal to download the firmware to the terminal; step S208, the boot loader calculating a second firmware Hash of the downloaded firmware and a second load command Hash of the load command transmitted by the driver; step 210, the boot loader judging whether the first firmware Hash matches with the second firmware Hash, and judging whether the first load command Hash matches with the second load command Hash, and permitting to start the terminal under the circumstances that the first firmware Hash matches with the second firmware Hash and the first load command Hash matches with the second load command Hash. | 2011-03-03 |
| 20110055544 | SYSTEMS AND METHODS FOR TRACKING A HISTORY OF CHANGES ASSOCIATED WITH SOFTWARE PACKAGES AND CONFIGURATION MANAGEMENT IN A COMPUTING SYSTEM - In order to track actions performed by a package manager or a configuration management system, a computing system can be configured to include a tagging tool. The tagging tool can be configured to cooperate with the package manager and the configuration management system in order to determine and generate a history of the actions performed by the package manager and the configuration management system. The history can include a description of the actions, the reasons why the actions were performed, and a list and description of the software programs, files, and software libraries that are affected by the actions. | 2011-03-03 |
| 20110055545 | METHOD AND APPARATUS FOR ENCODING DECISION DIAGRAMS - An approach is provided for reducing decision diagram related communication traffic and cost by encoding decision diagrams. A hash identifier application constructs a reduced ordered binary decision diagram from a resource description framework graph, computes a hash identifier corresponding to the decision diagram, and stores the hash identifier with the decision diagram. | 2011-03-03 |
| 20110055546 | MOBILE DEVICE MANAGEMENT - A device management method, is disclosed in which available features on a slave mobile device are managed (monitored or controlled) by a slave manager module commanded by a master device through secure messages exchanged between the two devices using respective electronic messaging capabilities on the two devices. Selection of the features of the slave mobile device to be controlled or monitored is facilitated on the master device through a master manager module resident thereon. The features that are controlled or monitored may comprise any user-accessible feature incorporated or installed on the slave mobile device and user access to the feature may be prevented according to at least one criterion, such as: date of use, time of day of use, number of times of use, originator and recipient. User access to the feature may be prevented access to the user-accessible feature when usage limitations for the feature have been reached. | 2011-03-03 |
| 20110055547 | PERSONAL INFORMATION MANAGEMENT AND DELIVERY MECHANISM - Some general aspects relate to secured means for managing and delivering personal information, for example, in the context of electronic commerce. A request from a first entity to encrypt personal information includes a first specification of the personal information to be encrypted. An encrypted specification of the personal information is then generated according to an encoding strategy. The encrypted specification of the personal information is provided to the first entity for subsequent use by a personal information user. A second entity sends a request to decrypt the encrypting specification of the personal information. Upon determining that the second entity is an authorized personal information receiver, a decrypted specification of the personal information is formed according to a decoding strategy determined based on an analysis of the encrypted specification. This decrypted specification of the personal information is then provided to the second entity. | 2011-03-03 |
| 20110055548 | ONLINE DATA ENCRYPTION AND DECRYPTION - Systems and methods for providing encryption and decryption of data transmitted on a computer implemented network, preferably user authentication identifier data, such as a password, at the point of entry into the user's computer. The systems and methods enable an end user to mentally select a marker from one of the randomly arranged elements on a first portion of a graphical image. A second portion of the graphical image includes an arrangement of possible elements of any individual authentication identifier sequence, and is positioned adjacent to the first portion. The systems and methods prompt a user to enter each element of the identifier by moving the selected marker and the first portion as necessary to substantially align the selected marker with a chosen element of the authentication identifier appearing on the outer portion. According to one embodiment, the image portions are concentric wheels. According to another embodiment, the image portions are arranged in adjacent rows. | 2011-03-03 |
| 20110055549 | Method and System for Providing Trustworthiness of Communication - A method and system of providing trustworthiness of communication among a plurality of communication nodes is described. This comprises arranging each of said communication nodes to perform a trustworthiness judging operation on received data elements for judging a received packet to be trustworthy or not, grouping said plurality of communication nodes into a plurality of distinguishable clusters, each cluster comprising at least two of said communication nodes, implementing in each respective cluster an intro-cluster trust mechanism such that trustworthiness of data elements sent by any member node of said respective cluster is judgable within said respective cluster, arranging said clusters such that each of said clusters comprises one or more multi-cluster-member nodes that belong to at least two different of said clusters, and muting inter-cluster traffic through said multi-cluster-member nodes. | 2011-03-03 |
| 20110055550 | METHOD AND APPARATUS FOR PRESERVING SECURITY IN VIDEO MULTICASTING SERVICE - A method and an apparatus for maintaining information security in a video multicasting service are provided. The method includes: generating a network abstraction layer unit using received video information; encrypting the network abstraction layer unit of the video information; realtime transport protocol (RTP) packetizing the encrypted network abstraction layer unit of the video information; recording unit format information and field information, included in the network abstraction layer of the video information being stored in a memory, in a header extension field of the RTP header; and transmitting the RTP packet including the encrypted video information to a routing device. | 2011-03-03 |
| 20110055551 | METHOD AND NETWORK NODES FOR GENERATING CRYPTOGRAPHICALLY GENERATED ADDRESSES IN MOBILE IP NETWORKS - A method for generating a cryptographically generated address (CGA) comprises steps of: generating, in a network node located on a communication path between a first node and a second node, the network node having unique information of the first node, a cryptographically generated address (CGA) for the first node using the unique information of the first node; and assigning the CGA to the first node. The network node further comprises a generator of CGA for the first node using the unique information of the first node, and an output for assigning the CGA to the first node. | 2011-03-03 |
| 20110055552 | PRIVATE, ACCOUNTABLE, AND PERSONALIZED INFORMATION DELIVERY IN A NETWORKED SYSTEM - A client receives a notification of a user interaction with an information item and creates a record describing this interaction. The client encrypts the record using an encryption key associated with a server. The encrypted record is then communicated to at least one proxy, which in turn forwards the encrypted record to a server. Upon receiving the encrypted record from the proxy, a server decrypts the record using a decryption key and analyzes the decrypted record to identify the information item and the type of user interaction. This information may be used individually or in aggregate for tracking user interests, billing advertisers or information item providers, and/or collecting anonymous information from users. | 2011-03-03 |
| 20110055553 | Method for controlling user access in sensor networks - A method for implement an energy-efficient user access control to wireless sensor networks is disclosed. A user creates a secret key and sending it to a sensor. The sensor builds a first MAC value by the secret key and sends it to the Key Distribution Center which builds a second MAC value and sending it to the sensor. The sensor decrypts the second MAC value to get a random number, and builds a third MAC value by the random number. The third MAC value is used by the user to authenticate the sensor. | 2011-03-03 |
| 20110055554 | WIRELESS PERSONAL AREA NETWORK ACCESSING METHOD - A wireless personal area network accessing method is provided, the method includes that: a coordinator broadcasts a beacon frame, the beacon frame includes the information about whether the coordinator sends an authentication requirement, the beacon frame also includes the authentication supported by the coordinator and key management package when a device receipts the authentication requirement, the device receives the beacon frame, the authentication between the coordinator and the device is made by using a authentication method corresponding to the authentication supported by the coordinator and key management package, when the device determines that the coordinator and the device is directly made according to the authentication result, or the association between the coordinator and the device is made after making session key negotiation. | 2011-03-03 |
| 20110055555 | LICENSING AND CERTIFICATE DISTRIBUTION VIA SECONDARY OR DIVIDED SIGNALING COMMUNICATION PATHWAY - In one embodiment, the present invention is directed to the use of separate communication pathways over different types of networks to handle bearer and control signaling in connection with a license transaction. | 2011-03-03 |
| 20110055556 | METHOD FOR PROVIDING ANONYMOUS PUBLIC KEY INFRASTRUCTURE AND METHOD FOR PROVIDING SERVICE USING THE SAME - Provided is a method for providing an anonymous public key infrastructure (PKI) in a user terminal. The method includes receiving a real-name certificate from a real-name PKI service domain, requesting an anonymous certificate to an anonymous PKI service domain, and receiving the anonymous certificate from the anonymous PKI service domain. Accordingly, the method can ensure anonymity when a user uses a service by providing the anonymous certificate in association with the PKI-based real-name certificate. | 2011-03-03 |
| 20110055557 | COMMUNICATION APPARATUS MEDIATING COMMUNICATION BETWEEN INSTRUMENTS - A communication apparatus makes a request to issue an electronic certificate of a first instrument to a certificate authority and acquires the electronic certificate from the certificate authority. The communication apparatus communicates with a second instrument using the electronic certificate of the first instrument in response to reception of a request for communication with the second instrument from the first instrument. Therefore, the communication apparatus mediates information communication between the second instrument and the first instrument. | 2011-03-03 |
| 20110055558 | GALOIS/COUNTER MODE ENCRYPTION IN A WIRELESS NETWORK - A system includes a temporal key module, a nonce module, and a security module. The temporal key module is configured to generate a first temporal key. The first temporal key is to be used to encrypt a plurality of packets. The nonce module is configured to generate a nonce for each packet encrypted based on the first temporal key. Each nonce includes a packet number that is different than packet numbers associated with other nonces generated by the nonce module. The security module is configured to determine when the packet number included in the nonce generated by the nonce module is greater than or equal to a predetermined threshold. | 2011-03-03 |
| 20110055559 | DATA RETENTION MANAGEMENT - A file-based data retention management system is provided. A data source can store data files. An online backup file system can make a backup copy of the data files from the data source and store the backup copy of the data files on a backup server. A policy database can be maintained by the system, the policy database including data retention policies for the data files for retention management of the data files. A key management system can assign and manage encryption keys for the data files. The key management system can store the encryption keys on a separate system from the data files stored on the backup server. | 2011-03-03 |
| 20110055560 | CONVERSION OF CRYPTOGRAPHIC KEY PROTECTION - Protection of cryptographic keys is converted between one level of security and another level of security. The one level of security is different from the another level of security, and the another level of security includes the components of the one level of security. | 2011-03-03 |
| 20110055561 | ACCESS AUTHENTICATION METHOD SUITABLE FOR THE WIRE-LINE AND WIRELESS NETWORK - An access authentication method includes pre-establishing a security channel between the authentication server of the access point and the authentication server of the user terminal and performing the authentication process at user terminal and access point. The authentication process includes 1) the access point sending the authentication_activating message; 2) the user terminal sending the authentication server of user terminal request message; 3) the authentication server of the user terminal sending to the user terminal response message; and 4) completing the authentication. | 2011-03-03 |
| 20110055562 | PUBLIC KEY CERTIFICATE BASED SOCIAL WEBSITE ACCOUNT AUTHENTICATION - Methods of the present inventions allow for verifying the authenticity of social website accounts. An example embodiment of a public key certificate based social website account authentication method may comprise the steps of receiving a request (that may include a business name and a business email address) to verify the authenticity of a social website account and determining whether a public key certificate has been issued for the domain name used by the business email address. If a public key certificate has been issued, the method may further comprise determining whether the public key certificate identifies the business name and/or domain name provided in the original request. If so, the method may further comprise determining whether the business email address is under the control of the business and, if so, certifying the authenticity of the social website account. | 2011-03-03 |
| 20110055563 | ENCRYPTION OF SECURITY-SENSITIVE DATA BY RE-USING A CONNECTION - Techniques are provided for processing data. Connections having different security properties are stored, wherein each of the connections allows applications at the client computer to access data sources at a server computer. A request is received from an application to access a data source, wherein the request has associated security properties. In response to the client computer requesting establishment of a connection on behalf of the application, it is determined whether there is a stored connection that used a same set of security properties as are associated with the request from the application and that connected to the data source that the application requests access to. In response to determining that there is a stored connection that used the same set of security properties and that connected to the data source, the connection and an associated client encryption seed, client encryption token, server encryption seed, and server encryption token are re-used. In response to determining that there is not a connection that used the same set of security properties and that connected to the data source, a new client connection key, client encryption seed, client encryption token, sever connection key, server encryption seed, and server encryption token are generated. | 2011-03-03 |
| 20110055564 | METHOD AND DEVICE FOR TRANSMITTING MESSAGES IN REAL TIME - A method and system for transmitting a message in real time between users in a closed network of a vehicle ( | 2011-03-03 |
| 20110055565 | IMS USER EQUIPMENT, CONTROL METHOD THEREOF, HOST DEVICE, AND CONTROL METHOD THEREOF. - An IMS User Equipment (UE) is provided. The IMS UE comprises: searching means for searching, based on UPnP technology, a UPnP network for a host device that has IMS subscription information, establishing means for establishing a session with the host device discovered by the searching means, subscription retrieving means for retrieving, from the host device via the session, the IMS subscription information, registering means for registering with the IMS network using the IMS subscription information, key retrieving means for retrieving, from the host device via the session, a first encryption key shared with an IMS application server (AS) in an IMS network by sending identity of the IMS AS to the host device via the session, and communicating means for performing encrypted communication with the IMS AS using the first encryption key. | 2011-03-03 |
| 20110055566 | Verifying a Message in a Communication Network - A method and apparatus for verifying a request for service in a communication network. An authentication node generates a secret and transmits the secret to a node providing a service. The authentication node then receives a request for authentication from a requesting node, and once the requesting node is authenticated, the authorisation node sends an identifier for the requesting node and a first token, which is derived using the secret and the identifier. A service providing node subsequently receives a request for service from the requesting node, the request including the identifier for the requesting node and the first token. The service providing node derives a second token using the identifier and the secret. If the first token and the second token match, then the service providing node allows the request, and if the first token and the second token do not match, then the request is refused. | 2011-03-03 |
| 20110055567 | Secure Key Management in Multimedia Communication System - Principles of the invention provide one or more secure key management protocols for use in communication environments such as a media plane of a multimedia communication system. For example, a method for performing an authenticated key agreement protocol, in accordance with a multimedia communication system, between a first party and a second party comprises, at the first party, the following steps. Note that encryption/decryption is performed in accordance with an identity based encryption operation. At least one private key for the first party is obtained from a key service. A first message comprising an encrypted first random key component is sent from the first party to the second party, the first random key component having been computed at the first party, and the first message having been encrypted using a public key of the second party. A second message comprising an encrypted random key component pair is received at the first party from the second party, the random key component pair having been formed from the first random key component and a second random key component computed at the second party, and the second message having been encrypted at the second party using a public key of the first party. The second message is decrypted by the first party using the private key obtained by the first party from the key service to obtain the second random key component. A third message comprising the second random key component is sent from the first party to the second party, the third message having been encrypted using the public key of the second party. The first party computes a secure key based on the second random key component, the secure key being used for conducting at least one call session with the second party via a media plane of the multimedia communication system. | 2011-03-03 |
| 20110055568 | ZERO-KNOWLEDGE BASED AUTHENTICATION METHOD, SYSTEM, AND APPARATUS - In the fields of data security and system reliability and qualification, this disclosure is of a method, system and apparatus for verifying or authenticating a device to a host using a zero-knowledge based authentication technique which includes a keyed message authentication code such as an HMAC or keyed cipher function and which operates on secret information shared between the host and the device. This is useful both for security purposes and also to make sure that a device such as a computer peripheral or accessory or component is qualified to be interoperable with the host. | 2011-03-03 |
| 20110055569 | ROAMING AUTHENTICATION METHOD BASED ON WAPI - A roaming authentication method based on WAPI. The present invention includes the steps of adopting a terminal and a wireless access point to initiate a WAPI security mechanism, relating the terminal to the wireless access point, and initiating a WAPI authentication process and so on. And a highly safe and convenient roaming authentication method based on WAPI is provided, so as to solve the technical problem that how the specific method of certificate roaming authentication is realized, the certificate of external network authentication server can not be obtained to establish a trustful relationship, and the terminal perhaps can not realize roaming authentication. | 2011-03-03 |
| 20110055570 | LOCATION UPDATE OF A MOBILE NODE - A method of facilitating location update signalling within a communication network between a mobile node and an end host includes establishing a trust relationship between one or more end hosts ( | 2011-03-03 |
| 20110055571 | METHOD AND SYSTEM FOR PREVENTING LOWER-LAYER LEVEL ATTACKS IN A NETWORK - A method for preventing lower-layer level attacks committed against entities in a network. The method comprises forming a secure peer group (SPG) of member entities in the network, wherein each of the member entities is configured with a media access control (MAC) address locked to its own identity and a Internet protocol (IP) address linked to its MAC address; establishing a secure handshake between at least a source member entity and a target member entity of the SPG by mutually authenticating of the source member entity and the target member entity; and securely transferring data from the source member entity to the target member entity. | 2011-03-03 |
| 20110055572 | ROUTE OPTIMIZATION IN MOBILE IP NETWORKS - The present invention the present invention concerns a method for optimizing a route between a mobile node and a correspondent node in mobile Internet protocol networks. The mobile node is served by an anchor point being a node, e.g. a mobile IP home agent. According to the method the anchor point generates a Multi-key Cryptographically Generated Address (MCGA) for the mobile node. The MCGA is generated using at least the public keys of the mobile node and the anchor point. The anchor point assigns and registers the generated MCGA as a home address for the mobile node and sends a binding update message to the correspondent node on behalf of the mobile node. The binding update message includes at least a signature of the MCGA signed by the anchor point. Thereby route optimization can be performed such that data packets can be exchanged between the mobile node and the correspondent node without routing the packets via the anchor point. | 2011-03-03 |
| 20110055573 | SUPPORTING FLEXIBLE USE OF SMART CARDS WITH WEB APPLICATIONS - A web browser for communicating with an application at an application server, a smart card driver for accessing a smart card reader, a client agent monitoring events at the browser as a result of interaction between the browser and the application and a set of access profiles. The client agent is controlled by an access profile that defines a trigger event and an action to be performed by the client agent in response to an occurrence of the event. | 2011-03-03 |
| 20110055574 | LOCALIZED NETWORK AUTHENTICATION AND SECURITY USING TAMPER-RESISTANT KEYS - The invention provides a secure Wi-Fi communications method and system. In an embodiment of the invention, unique physical keys, or tokens, are installed at an access point and each client device of the network. Each key comprises a unique serial number and a common network send cryptographic key and a common network receive cryptographic key used only during the authentication phase by all components on the LAN. Each client key further includes a secret cryptographic key unique to each client device. During authentication, two random numbers are generated per communications session and are known by both sides of the wireless channel. Only the random numbers are sent across the wireless channel and in each case these numbers are encrypted. A transposed cryptographic key is derived from the unique secret cryptographic key using the random numbers generated during authentication. Thus, both sides of the wireless channel know the transposed cryptographic key without it ever being transmitted between the two. | 2011-03-03 |
| 20110055575 | Enhancement to Volume License Keys - A method includes issuing a digital certificate to a licensee, the digital certificate identifying a licensed product and the licensee to enable the licensee to enable the licensed product. The method involves receiving a request to enable the licensed product from an entity, the request including the digital certificate and determining whether the entity is the licensee of the licensed product based on the digital certificate. A system includes a relational structure having associations among authorized entities and digital certificates within an organization. Each to digital certificate identifies a licensed product licensed to the organization. A certificate distribution module distributes the digital certificates to associated authorized entities. | 2011-03-03 |
| 20110055576 | HASH FUNCTION USING A HEAP MODELING PROCESS - This discloses, in the computer data security field, a cryptographic hash function process embodied in a computer system and which may be keyless, but is highly secure. The process is based on the type of randomness exhibited by a heap or stack of physical objects such as a heap of pieces of fruit and involves modeling the behavior of such a heap when pieces are removed from the heap. Computation of the hash value (digest) is thereby the result of executing a heap model algorithm using the message as an input to initialize the heap, then executing the heap model algorithm which logically models the process of serially removing objects (pieces of fruit) from the heap at various locations in the modeled heap. | 2011-03-03 |
| 20110055577 | Location authentication - In one implementation a method of authenticating the installation of a television receiver involves generating a fingerprint value as function of the television network characteristics at an authorized installation location, where the fingerprint is a function of at least one of a gain value of a variable gain amplifier and an equalizer coefficient of an adaptive equalizer of the television appliance; receiving a code that is a function of both a decryption key and the fingerprint value from a broadcast source; ascertaining a value of the decryption key by applying an inverse function to the code that produces the decryption key as an output; and carrying out a decryption process at the television receiver appliance using the decryption key. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 2011-03-03 |
| 20110055578 | VERIFICATION OF DISPERSED STORAGE NETWORK ACCESS CONTROL INFORMATION - In a dispersed storage network access control list information must be occasionally written out to system units across the network. A dispersed storage (DS) managing unit ( | 2011-03-03 |
| 20110055579 | ELECTRONIC NAME REGISTRY TYPE - Digital signatures may be verified by maintaining a database of information of digital signatures and documents to which they were applied. Verification of electronically signed documents may be requested, with verification performed by comparing information of the electronically signed document with information in the database. The digital signatures may include graphic images, and may be transferred from one party to another. | 2011-03-03 |
| 20110055580 | NONCE GENERATION - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a nonce. In one aspect, a method includes generating, by a data processing apparatus, a source value, and hashing, by the data processing apparatus, the source value to generate the nonce. | 2011-03-03 |
| 20110055581 | HASH FUNCTION BASED ON PAINTING TECHNIQUES - In the computer data security field, this disclosure is of cryptographic hash function processes embodied in a computer system and which may be keyless, but are highly secure. The processes are based on the type of randomness exhibited by painting or drawing a picture. Computation of the hash value (digest) is the result of executing in computer code or logic circuitry an algorithm which models such a picture painting process using the message as an input to the picture painting algorithm, then executing the algorithm. A state of the resulting picture gives the hash digest value of the message. Message expansion or a derivation function (e.g., a pseudo random number generation process) may be applied to the message prior to execution of the picture painting process, for enhanced security. | 2011-03-03 |
| 20110055582 | HASH FUNCTION USING A DOMINO GAME PROCESS - In the computer data security field, cryptographic hash function processes are embodied in a computer system and may be keyless, but are highly secure. The processes are based on the type of randomness exhibited by the well known game of dominos using a set of tiles arranged by players on a surface. Computation of the hash value (digest) is the result of executing in computer code or logic circuitry an algorithm which models such a domino game using the message as an input to the domino game algorithm, then executing the domino game algorithm. A state of the game algorithm which models the final layout of the pieces (tiles) gives the hash digest value of the message. | 2011-03-03 |
| 20110055583 | METHOD FOR EXCHANGING A 3D VIEW BETWEEN A FIRST AND A SECOND USER - The invention relates to a method for exchanging a 3D view between a first and a second user having both a piece of software for creating 3D views. A view is created by the first user. This view comprises an encrypted object, the first user being licensed for the encrypted object. This view is stored in a file by the first user. The encrypted object is encrypted and the result of this encryption is stored as encrypted data in the file. According to the invention, non-encrypted data defining the encrypted object is stored in the file in parallel to the encrypted data relating to the encrypted object. This non-encrypted data can be read by the second user, so that the second user can see the encrypted object if he has acquired a license for this object, or a basic representation of the encrypted object if he has not acquired a license. | 2011-03-03 |
