Patent application number | Description | Published |
20110107008 | MEMORY MANAGEMENT IN A NESTED VIRTUALIZATION ENVIROMENT - A method for managing memory in a nested virtualization environment is provided. The method comprises implementing a first virtual machine (VM) for a first software such that a first guest memory is allocated to the first software; maintaining a first data structure to translate one or more memory addresses in the first guest memory to corresponding memory addresses in a physical memory; maintaining a second data structure to translate one or more memory addresses in the second guest memory to corresponding memory addresses in the physical memory. The first software implements a second VM for a second software such that a second guest memory is allocated to the second software and maintains a third data structure to translate one or more memory addresses in the second guest memory to corresponding memory addresses in the first guest memory. | 05-05-2011 |
20110137870 | Optimizing Data Storage Among a Plurality of Data Storage Repositories - Machines and methods for optimizing data storage among a plurality of data storage repositories are provided. The method comprises processing a data request submitted for storing data on one or more data storage mediums; determining whether duplicate copies of the data are to be maintained on more than one storage medium so that established quality of service requirements are met; and managing duplicate copies of the data on said one or more data storage mediums to meet the established quality of service requirements while servicing the data request. | 06-09-2011 |
20110142055 | MANAGING DATA TRANSFER IN A NETWORK ENVIRONMENT - A method for managing data transfer in a network environment, the method is provided. The method comprises receiving a request to transfer first data from a first source in a source domain comprising a plurality of sources to a first target in a target domain comprising a plurality of targets. If the first source is configured to transfer data in a first mode or if the first source is configured to transfer data in a second mode and the first data has previously been transferred to the target domain, a signature of the first data is transferred to the first target instead of the first data. If the first source is configured to operate in the second mode and the first data has not previously been transferred to the target domain, the first data is transferred to the first target. | 06-16-2011 |
20110179253 | EFFICIENT MULTI-CORE PROCESSING OF EVENTS - A computer implemented method for handling events in a multi-core processing environment is provided. The method comprises handling an event by a second application running on a second core, in response to determining that the event is initiated by a first application running on a first core; and running a third application on the first core, while the first application is waiting for the event to be handled by the second application. | 07-21-2011 |
20120131571 | PERFORMANCE IN A NESTED VIRTUALIZED ENVIRONMENT - Methods and systems for improving performance in a virtualization environment. The method comprising: detecting, by a first software, a first set of features supported by a hardware device, wherein the first software runs on the hardware device; detecting a second set of features with which to run a second software, wherein the second software is launched by the first software with the second set of features; exposing one or more features in the second set of features to the second software, wherein the second software detects and enables the exposed features for a third software launched by the second software; and emulating a first feature without causing a trap such that control is transferred to the second software, in response to determining that the first feature is an exposed feature not included in the first set of features, wherein one or more sensitive events are associated with the first feature. | 05-24-2012 |
20120189015 | MANAGING DATA TRANSFER IN A NETWORK ENVIRONMENT - A method for managing data transfer in a network environment, the method is provided. The method comprises receiving a request to transfer first data from a first source in a source domain comprising a plurality of sources to a first target in a target domain comprising a plurality of targets. If the first source is configured to transfer data in a first mode or if the first source is configured to transfer data in a second mode and the first data has previously been transferred to the target domain, a signature of the first data is transferred to the first target instead of the first data. If the first source is configured to operate in the second mode and the first data has not previously been transferred to the target domain, the first data is transferred to the first target. | 07-26-2012 |
20120216187 | MULTILEVEL SUPPORT IN A NESTED VIRTUALIZATION ENVIRONMENT - A method of handling an event occurring in a nested virtualization computing environment is provided, wherein N hypervisors are executed nestedly, with a first hypervisor running at level zero (L0) directly over a host machine, and other hypervisors nestedly running at levels L1 to Ln, respectively. The method comprises trapping an event generated by software running at level Ln; determining a hypervisor x at level Lx designated for handling the trapped event; and wherein the hypervisor x emulates features needed for performing the trapped event for the software running at the level Ln. | 08-23-2012 |
20120233435 | DYNAMIC MEMORY MANAGEMENT IN A VIRTUALIZED COMPUTING ENVIRONMENT - A memory management method in a virtualized computing environment is provided, in which a hypervisor implements at least a virtual machine (VM) over a host machine, wherein a guest operating system (OS) is executed over the VM and an application supporting memory management capabilities is executed over the guest OS. The method comprises invoking a first memory manager (java balloon) implemented by the application to deallocate memory allocated to the application for use by the hypervisor, in response to a request submitted by the hypervisor; and invoking a second memory manager (guest balloon) implemented over the guest operating system to deallocate memory allocated to the guest OS, in response to a request submitted by the hypervisor. | 09-13-2012 |
20130174148 | ENHANCING INTERRUPT HANDLING IN A VIRTUAL ENVIRONMENT - Systems and methods for enhancing the handling of interrupts in a virtual computing environment are disclosed. A CPU is configured such that the CPU, when in a virtual machine (VM) mode, directs an interrupt to a VM. When in the VM context, a guest in the VM is run with a hypervisor interrupt descriptor table (hypervisor IDT) to determine how the interrupt should be handled. The hypervisor IDT directs an interrupt that is to be handled by the VM to an interrupt handler in a guest IDT without causing a transition to the hypervisor. If an interrupt is to be handled by the hypervisor, the hypervisor IDT causes a transition to the hypervisor. | 07-04-2013 |
20130185696 | MANIPULATING SOURCE CODE PATCHES - A computerized apparatus, a computer-implemented method and a computer program product for manipulating source code patches. The apparatus comprising a processor that is configured to: obtain a source code patch comprising plurality of source code modification instructions with respect to a source code and to automatically split the source code patch into plurality of sub-patches, wherein applying the plurality of sub-patches on the source code in an order is equivalent to applying the source code patch. | 07-18-2013 |
20130185697 | SOURCE CODE PATCHES - Apparatus, process and product useful for source code patches. The computerized apparatus having a processor, the apparatus comprising: a source code obtainer for obtaining a source code of a computer program; a patch instructions obtainer for obtaining a set of source code patches instructions, wherein a first patch instructions comprise a set of modification instructions to the source code associated with a first source code patch, wherein a second patch instructions comprise a set of modification instruction to the source code associated with a second source code patch; a source code editor configured to display to a user the source code and annotations associated with applying each source code patch simultaneously; and wherein said source code editor is further configured to edit the source code in accordance with user input, wherein based on user input the first and second source code patch instructions are modified. | 07-18-2013 |
20150032910 | INPUT/OUTPUT MONITORING MECHANISM - Machines, systems and methods for I/O monitoring in a plurality of compute nodes and a plurality of service nodes utilizing a Peripheral Component Interconnect express (PCIe) are provided. In one embodiment, the method comprises assigning at least one virtual function to a services node and a plurality of compute nodes by the PCIe interconnect and a multi-root I/O virtualization (MR-IOV) adapter. The MR-IOV adapter enables bridging of a plurality of compute node virtual functions with corresponding services node virtual functions. A front-end driver on the compute node requests the services node virtual function to send data and the data is transferred to the services node virtual function by the MR-IOV adapter. A back-end driver running in the services node receives and passes the data to a software service to modify/monitor the data. The back-end driver sends the data to another virtual function or an external entity. | 01-29-2015 |
20150286414 | SCANNING MEMORY FOR DE-DUPLICATION USING RDMA - A method for storage includes storing multiple memory pages in a memory of a first compute node. Using a second compute node that communicates with the first compute node over a communication network, duplicate memory pages are identified among the memory pages stored in the memory of the first compute node by directly accessing the memory of the first compute node. One or more of the identified duplicate memory pages are evicted from the first compute node. | 10-08-2015 |
20150286501 | REGISTER-TYPE-AWARE SCHEDULING OF VIRTUAL CENTRAL PROCESSING UNITS - A method includes running multiple processing tasks on multiple physical processing cores that support general-purpose registers and special-purpose registers. Respective usage levels, with which the processing tasks use the special-purpose registers, are estimated. The physical processing cores are assigned to the processing tasks based on the estimated usage levels of the special-purpose registers. | 10-08-2015 |
Patent application number | Description | Published |
20090249116 | MANAGING WRITES RECEIVED TO DATA UNITS THAT ARE BEING TRANSFERRED TO A SECONDARY STORAGE AS PART OF A MIRROR RELATIONSHIP - Provided are a method, system, and article of manufacture for managing writes received to data units that are being transferred to a secondary storage as part of a mirror relationship. Synchronization information indicates data units to transfer from a primary storage to a secondary storage, wherein the synchronization information data is updated to indicate the transfer of one of the data units from the primary storage to the secondary storage. A storage controller receives a write request having an update to a target data unit comprising one of the data units indicated in the synchronization information that has not been transferred from the primary storage to the secondary storage. The write request is allowed to apply the update to the target data unit in response to transferring the data in the target data unit to a network adapter of the storage controller and before the data in the target data unit is transferred to the secondary storage. | 10-01-2009 |
20090328229 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR PERFORMING A DATA PROTECTION OPERATION - A system, method and computer program product for performing a data protection operation is provided. The method includes receiving a write instruction that is associated with a writable entity, the write instruction includes a writable entity identifier, and data protection metadata indicative of a relevancy of at least one data protection operation to be applied in relation to the write instruction, and participating in an execution of a relevant data protection operation, if such a relevant data protection operation exists. | 12-31-2009 |
20100030992 | INITIALIZING OF A MEMORY AREA - A method for initializing a memory area, the method includes: receiving a request to access a first memory sub of a first memory area that comprises multiple memory sub areas; and initializing the first memory sub area if a first memory area initialization indicator differs from a first memory sub area initialization request indicator; wherein the first memory area initialization request indicator is a multiple bit variable indicative of a time of a last request to initialize the first memory area and the first memory sub area initialization indicator is a multiple bit variation indicative of a time of a request to initialize the first memory area that resulted in a last initialization of the first memory sub area. | 02-04-2010 |
20100235326 | METHOD FOR MIRRORING A LOG FILE BY THRESHOLD DRIVEN SYNCHRONIZATION - A method for of accelerating database log hardening using specific per block data protection and damage control is provided. A per write specification is implemented to determine when database log data is mirrored synchronously or asynchronously. Synchronous minoring is performed upon reaching a predetermined threshold, based on one or more parameters such as transaction value, both individual and cumulative, and the quantity of data written since the last synchronous minoring. As data is added to the database log, it is written specifying asynchronous minoring to the primary log file. Once a threshold is met, a write specifying synchronous minoring is performed to both the primary and secondary log files, thereby hardening the log file in both primary and secondary storage subsystem. | 09-16-2010 |
20110252201 | SMART FLUSHING OF DATA TO BACKUP STORAGE - A storage system, including: (a) a primary storage entity utilized for storing a data-set of the storage system; (b) a secondary storage entity utilized for backing-up the data within the primary storage entity; (c) a flushing management module adapted to identify within the primary storage entity two groups of dirty data blocks, each group is comprised of dirty data blocks which are arranged within the secondary storage entity in a successive sequence, and to further identify within the primary storage entity a further group of backed-up data blocks which are arranged within the secondary storage entity in a successive sequence intermediately in-between the two identified groups of dirty data blocks; and (d) said flushing management module is adapted to combine the group of backed-up data blocks together with the two identified groups of dirty data blocks to form a successive extended flush sequence and to destage it to the secondary storage entity. | 10-13-2011 |
20120102242 | CONTROLLING DATA DESTAGING WITHIN A MULTI-TIERED STORAGE SYSTEM - There is provided according to an example of the claimed subject matter, a system and a method for managing access to a shared storage entity. According to an example of the claimed subject matter, a system for managing access to a shared storage entity can include two or more initiator entities, two or more local sequencing agents and an arbitration module. Each of the two or more local sequencing agents can be associated with a respective one of two or more initiator entities which generate I/O requests for accessing the shared storage entity. Each local sequencing agent can be adapted to locally sequence its respective initiator entity's I/O requests. The arbitration module can be adapted to manage an access cycle to the shared storage entity by allocating to each one of the plurality of initiator entities a monolithic/continuous chunk of the access cycle to implement its own I/O access sequence, wherein chunk allocation is determined according to subframe allocation criteria related to the functional characteristics of each of the initiator entities. | 04-26-2012 |
20120117347 | INITIALIZING OF A MEMORY AREA - A method for initializing a memory area, the method includes: receiving a request to access a first memory sub area of a first memory area that comprises multiple memory sub areas; and initializing the first memory sub area if a first memory area initialization indicator differs from a first memory sub area initialization request indicator; wherein the first memory area initialization request indicator is a multiple bit variable indicative of a time of a last request to initialize the first memory area and the first memory sub area initialization indicator is a multiple bit variable indicative of a time of a request to initialize the first memory area that resulted in a last initialization of the first memory sub area. | 05-10-2012 |
20120330897 | METHOD FOR MIRRORING A LOG FILE BY THRESHOLD DRIVEN SYNCHRONIZATION - A method for of accelerating database log hardening using specific per block data protection and damage control is provided. A per write specification is implemented to determine when database log data is mirrored synchronously or asynchronously. Synchronous mirroring is performed upon reaching a predetermined threshold, based on one or more parameters such as transaction value, both individual and cumulative, and the quantity of data written since the last synchronous mirroring. As data is added to the database log, it is written specifying asynchronous mirroring to the primary log file. Once a threshold is met, a write specifying synchronous mirroring is performed to both the primary and secondary log files, thereby hardening the log file in both primary and secondary storage subsystem. | 12-27-2012 |
20130191565 | MODIFIED I/OS AMONG STORAGE SYSTEM LAYERS - A method of managing I/Os in a storage system between a first storage layer and a second layer which is a logical abstraction over the first storage layer, comprising of maintaining within the first storage layer of the storage system validity status data indicating a validity status of each one of a plurality of first layer storage segments, in response to a write command that includes payload data which relates to part of an invalid segment providing the second layer with an unaligned write to an invalid segment indication, and in response to receiving the indication at the second layer, providing a modified write command for the invalid segment including initial values combined with the payload data. | 07-25-2013 |
20130205108 | MANAGING RESERVATION-CONTROL IN A STORAGE SYSTEM - A method of managing reservation-control in a storage system that consists of a plurality of interfaces and a common storage resource, the method comprising responsive to receiving at an originator interface a reservation command related to the common storage resource, implementing a multi-phase reservation synchronization protocol including a lock phase consisting of locking the resource on a central controlling process, backing up respective lock phase data on a backup control process, and issuing a lock phase completion indication; an execution phase consisting of executing locally on each one of the plurality of interfaces a reservation operation, and issuing an execute phase completion indication; and an unlock phase consisting of unlocking the resource on the central controlling process; backing up respective unlock phase data on a backup control process, and issuing an unlock phase completion indication. | 08-08-2013 |
20130246660 | IMPLEMENTING A LOGICAL UNIT RESET COMMAND IN A DISTRIBUTED STORAGE SYSTEM - A method of implementing a logical unit reset across a plurality of interfaces in a distributed storage system, comprising: initiating a session for implementing the logical unit reset across the plurality of interfaces in response to receiving at a central controller a logical unit reset command from an originator interface, and writing session-data including an indication that the originator interface implemented the respective logical unit reset locally; communicating a logical unit reset command from the central controller to each interface other than the originator interface; updating the session data in response to receiving an indication from an interface that the logical unit was successfully reset locally and when each one of the plurality of interfaces implemented the logical unit reset locally, communicating a success response to each one of the plurality of interfaces. | 09-19-2013 |
20140143213 | DEDUPLICATION IN A STORAGE SYSTEM - A IO handler receives a write command including write data that is associated with a LBA. The IO handler reserves a deduplication ID according to the LBA with which the write data is associated, within the scope of each LBA, each deduplication ID is unique. The IO handler computes a hash value for the write data. In case a deduplication database does not include an entry which is associated with the hash value, the IO handler: provides a reference key which is a combination of the LBA and the deduplication ID; adds to the deduplication database an entry which is uniquely associated with the hash value and references the reference key; and adds to a virtual address database an entry, including: the reference key; a reference indicator indicating if there is an entry that is associated with the present entry; and a pointer to where the write data is stored. | 05-22-2014 |
20140208022 | RAID ERASURE CODE APPLIED TO PARTITIONED STRIPE - The disclosure presents examples of a RAID storage system, method and computer program product where a stripe is logically partitioned into two or more sub-stripes and at least one RAID erasure code is applied to each sub-stripe independently of any other of the sub-stripe(s). Consequently, in some of these examples, a larger packet size may be used than if the stripe had not been partitioned. A larger packet size may in some cases allow for accelerated encoding and/or decoding. | 07-24-2014 |
20140344539 | MANAGING DATA IN A STORAGE SYSTEM - According to an aspect of the presently disclosed subject matter, there is provided a system for managing data in a storage system, the system including a storage layer which provides storage resource, and a snapshot layer that includes: a volume-version data structure, a chunk-version data structure and a IO handler. | 11-20-2014 |
20150019620 | HIGH AVAILABILITY FOR COMMUNICATIONS BASED ON REMOTE PROCEDURE CALLS - Examples of disclosed subject matter relate to: a method, comprising: in an RPC client side: generating an RPC request which corresponds to an RPC call, the RPC request is addressed to an RPC server side and the RPC request includes an RPC call ID; logging the RPC request in an entry that includes an ID of the RPC call; in the RPC server side, responsive to receiving the RPC request: logging the RPC request in an entry including the ID of the RPC call; generating a respective RPC reply that is addressed to the RPC client side and the RPC reply includes the ID of the RPC call; logging the RPC reply in the entry that includes the ID of the RPC call; and in the RPC client side, responsive to receiving the RPC reply: logging the RPC reply in the entry that includes the ID of the RPC call. | 01-15-2015 |
20150055853 | METHOD AND SYSTEM FOR PROVIDING THREE-DIMENSIONAL AND RANGE INTER-PLANAR ESTIMATION - A system, apparatus and method of performing 3-D object profile inter-planar estimation and/or range inter-planar estimation of objects within a scene, including: providing a predefined finite set of distinct types of features, resulting in feature types, each feature type being distinguishable according to a unique bi-dimensional formation; providing a coded light pattern having multiple appearances of the feature types; projecting the coded light pattern, having axially varying intensity, on objects within a scene, the scene having at least two planes, resulting in a first plane and a second plane; capturing a 2-D image of the objects having the projected coded light pattern projected thereupon, resulting in a captured 2-D image, the captured 2-D image including reflected feature types; determining intensity values of the 2-D captured image; and performing 3-D object profile inter-planar estimation and/or range inter-planar estimation of objects within the scene based on determined intensity values. | 02-26-2015 |
20150254008 | RAID RANDOM DISTRIBUTION SCHEME - There is provided a computerized method, computerized system, a non-transitory program storage device and a computer program product for enabling allocation of segments in a RAID stripe to respective storage devices in a corresponding RAID group. A randomized distribution scheme is generated for randomly distributing the data segments and syndrome segments in a RAID stripe to respective storage devices in the RAID group. The randomized distribution scheme is used for distributing the segments in the at least one RAID stripe to the storage devices in the RAID group, such that any two failed storage devices in the RAID group would have the same first probability (P) for being protected by the same type-1 syndrome segment and the same second probability (1-P) for each one of the two failed storage devices being protected by a different type-1 syndrome segment, irrespective of the relative location of the two failed storage devices. | 09-10-2015 |
20150370348 | ACTIVE TRIANGULATION CALIBRATION - According to examples of the presently disclosed subject an active triangulation system includes an active triangulation setup and a calibration module. The active triangulation setup includes a projector and a sensor. The projector is configured to project a structured light pattern that includes a repeating structure of a plurality of unique feature types and a plurality of markers distributed in the projected structured light pattern, where an epipolar distance between any two epipolar lines which are associated with an appearance in the image of any two respective markers is greater than a distance between any two distinguishable epipolar lines. The sensor is configured to capture an image of a reflected portion of the projected structured light. The calibration module is configured to determine an epipolar field for the active triangulation setup according to locations of the markers in the image, and to calibrate the active triangulation setup. | 12-24-2015 |
Patent application number | Description | Published |
20100074532 | 3D GEOMETRIC MODELING AND 3D VIDEO CONTENT CREATION - A system, apparatus and method of obtaining data from a 2D image in order to determine the 3D shape of objects appearing in said 2D image, said 2D image having distinguishable epipolar lines, said method comprising: (a) providing a predefined set of types of features, giving rise to feature types, each feature type being distinguishable according to a unique bi-dimensional formation; (b) providing a coded light pattern comprising multiple appearances of said feature types; (c) projecting said coded light pattern on said objects such that the distance between epipolar lines associated with substantially identical features is less than the distance between corresponding locations of two neighboring features; (d) capturing a 2D image of said objects having said projected coded light pattern projected thereupon, said 2D image comprising reflected said feature types; and (e) extracting: (i) said reflected feature types according to the unique bi-dimensional formations; and (ii) locations of said reflected feature types on respective said epipolar lines in said 2D image. | 03-25-2010 |
20110181704 | METHOD AND SYSTEM FOR PROVIDING THREE-DIMENSIONAL AND RANGE INTER-PLANAR ESTIMATION - A system, apparatus and method of performing 3-D object profile inter-planar estimation and/or range inter-planar estimation of objects within a scene, including: providing a predefined finite set of distinct types of features, resulting in feature types, each feature type being distinguishable according to a unique bi-dimensional formation; providing a coded light pattern having multiple appearances of the feature types; projecting the coded light pattern, having axially varying intensity, on objects within a scene, the scene having at least two planes, resulting in a first plane and a second plane; capturing a 2-D image of the objects having the projected coded light pattern projected thereupon, resulting in a captured 2-D image, the captured 2-D image including reflected feature types; determining intensity values of the 2-D captured image; and performing 3-D object profile inter-planar estimation and/or range inter-planar estimation of objects within the scene based on determined intensity values. | 07-28-2011 |
20120063672 | 3D GEOMETRIC MODELING AND MOTION CAPTURE USING BOTH SINGLE AND DUAL IMAGING - A method and apparatus for obtaining an image to determine a three dimensional shape of a stationary or moving object using a bi dimensional coded light pattern having a plurality of distinct identifiable feature types. The coded light pattern is projected on the object such that each of the identifiable feature types appears at most once on predefined sections of distinguishable epipolar lines. An image of the object is captured and the reflected feature types are extracted along with their location on known epipolar lines in the captured image. Displacements of the reflected feature types along their epipolar lines from reference coordinates thereupon determine corresponding three dimensional coordinates in space and thus a 3D mapping or model of the shape of the object at any point in time. | 03-15-2012 |
20130329018 | 3D GEOMETRIC MODELING AND 3D VIDEO CONTENT CREATION - A system, apparatus and method of obtaining data from a 2D image in order to determine the 3D shape of objects appearing in said 2D image, said 2D image having distinguishable epipolar lines, said method comprising: (a) providing a predefined set of types of features, giving rise to feature types, each feature type being distinguishable according to a unique bi-dimensional formation; (b) providing a coded light pattern comprising multiple appearances of said feature types; (c) projecting said coded light pattern on said objects such that the distance between epipolar lines associated with substantially identical features is less than the distance between corresponding locations of two neighboring features; (d) capturing a 2D image of said objects having said projected coded light pattern projected thereupon, said 2D image comprising reflected said feature types; and (e) extracting: (i) said reflected feature types according to the unique bi-dimensional formations; and (ii) locations of said reflected feature types on respective said epipolar lines in said 2D image. | 12-12-2013 |
20150262411 | 3D GEOMETRIC MODELING AND 3D VIDEO CONTENT CREATION - A system, apparatus and method of obtaining data from a 2D image in order to determine the 3D shape of objects appearing in said 2D image, said 2D image having distinguishable epipolar lines, said method comprising: (a) providing a predefined set of types of features, giving rise to feature types, each feature type being distinguishable according to a unique bi-dimensional formation; (b) providing a coded light pattern comprising multiple appearances of said feature types; (c) projecting said coded light pattern on said objects such that the distance between epipolar lines associated with substantially identical features is less than the distance between corresponding locations of two neighboring features; (d) capturing a 2D image of said objects having said projected coded light pattern projected thereupon, said 2D image comprising reflected said feature types; and (e) extracting: (i) said reflected feature types according to the unique bi-dimensional formations; and (ii) locations of said reflected feature types on respective said epipolar lines in said 2D image. | 09-17-2015 |
Patent application number | Description | Published |
20150113465 | Accelerated Data Entry for Constrained Format Input Fields - A method enables a user to fill an input field on a single display. An input field is generated on a user interface, wherein the input field has a plurality of character entry subfields and at least one constraint for at least one of said plurality of character entry subfields. A set of characters selected for input from said input field according to said at least one constraint of at least one of said plurality of character entry subfields is received, and a virtual keyboard on a single display is generated and presented, wherein only said set of characters are presented on said virtual keyboard. | 04-23-2015 |
20150113466 | ACCELERATED DATA ENTRY FOR CONSTRAINED FORMAT INPUT FIELDS - A processor-implemented method generates a character input from an interface. A plurality of consecutive character rows are presented, simultaneously on a single display, to a user, wherein each one of said plurality of character rows comprises a set of characters. One or more processors receive a selection by a user of a single character in each one of said plurality of character rows to generate a set of user selected characters. The set of user selected characters are then converted into a single complete input. | 04-23-2015 |
20150161406 | DESKTOP REDACTION AND MASKING - Redacting material in a user interface is provided. A monitoring agent waits for a change in input or output of user content. A change comparator identifies the change for sensitive material. A type comparator identifies the type of sensitive material. A redaction engine redacts the change according to the identified type of sensitive material. | 06-11-2015 |
20150187103 | OBSCURED RELATIONSHIP DATA WITHIN A GRAPH - Techniques for generating a visual representation of a graph are described herein. The techniques may include determining a metamodel indicating relationships between objects, and determining rules for obscuring data about the objects of the metamodel. A visual representation of a graph is generated, which visual representation illustrates at least some of the data about the objects and their relationships without illustrating the obscured data. | 07-02-2015 |
20150187104 | OBSCURED RELATIONSHIP DATA WITHIN A GRAPH - Techniques for generating a visual representation of a graph are described herein. The techniques may include determining a metamodel indicating relationships between objects, and determining rules for obscuring data about the objects of the metamodel. A visual representation of a graph is generated, which visual representation illustrates at least some of the data about the objects and their relationships without illustrating the obscured data. | 07-02-2015 |
Patent application number | Description | Published |
20080279363 | Adaptive, self-learning optimization module for rule-based customer interaction systems - The invention relates to a call center system having automatic means for optimizing those rules that are enforced over interactions with customers, said system comprises: (a) an infrastructure which comprises a CRM module for at least handling the interactions with customers, and hardware means for at least maintaining the communication with said customers; (b) management rules, each rule comprising one or more rule parameters, said rules parameters enforcing interaction behavior during all interactions with customers; and (c) an adaptive, self learning module, for: (c.1) monitoring all interactions with customers; (c.2) upon completion of each interaction, recording a corresponding set of full interaction details, said set of full interaction details includes those rule parameters that were enforced during said interaction, and those additional interaction parameters that are specific to that interaction; and (c.3) using an adaptive engine, periodically analyzing one or more of said sets of recorded full interaction details, and producing one or more modified rules having modified rule parameters, and enforcing said modified rules over future interactions with customers. | 11-13-2008 |
20120263291 | ADAPTIVE, SELF-LEARNING OPTIMIZATION MODULE FOR RULE-BASED CUSTOMER INTERACTION SYSTEMS - A call center system optimizing rules enforced over interactions with customers, including: an infrastructure including a module for handling interactions with customers, and hardware for at least maintaining the communication with said customers; management rules comprising one or more rule parameters, enforcing interaction behavior during all interactions with customers; and an adaptive, self learning module, for: monitoring interactions with customers; upon completion of each interaction, recording a corresponding set of full interaction details, which includes rule parameters that were enforced during said interaction, and those additional interaction parameters that are specific to that interaction; and using an adaptive engine, periodically analyzing said sets of recorded full interaction details, and producing one or more modified rules having modified rule, parameters, and enforcing said modified rules over future interactions with customers. | 10-18-2012 |
Patent application number | Description | Published |
20110093771 | System and method for superimposing a document with date information - System and method for enhancing the display of a document by maintaining in a computer system information associated with a plurality of content elements, including a date. A document is parsed to identify content elements contained within the document, wherein at least one content element contained in the document is identical or similar to a corresponding content element maintained in the computer system. The at least one content element contained in the document is then superimposed with a date associated with the corresponding identical or similar content element maintained in the computer system. | 04-21-2011 |
20110106644 | System and method for dynamic online auctions - A commerce system and methods thereof, comprising a remote server accessible via a network by client computers utilizing client software such as browsers for interfacing with the remote server. The server provides a commerce system that enables a seller to list an item in an auction process implemented in the server. The server receives proxy bids for the item from respective bidders and generates automatically on behalf of at least one bidder an offer for the item during the pendency of the auction process. | 05-05-2011 |
20110106645 | System and method for a two phase online auction - A commerce system and methods thereof, comprising a remote server accessible via a network by client computers utilizing client software such as browsers for interfacing with the remote server. A server receives item information from a seller for listing of an item in an auction process associated with an end time, receives a first group of one or more proxy bids for the item during a first time period, receives a second group of one or more actual bids for the item during a second time period prior to the end time and determines at the end time a highest actual bid as a winning bid. | 05-05-2011 |
20110106646 | System and method for converting an offer proposed by a buyer to a proxy bid - A commerce system and methods thereof, comprising a remote server accessible via a network by client computers utilizing client software such as browsers for interfacing with the remote server. The server provides a commerce system that enables a seller to list an item in an auction process implemented in the server. The server receives proxy bids for the item from respective bidders and a buyer-proposed offer associated with a prospective buyer indicating a fixed price the prospective buyer is willing to pay for the item. If the server determines a lack of acceptance of the buyer-proposed offer by the seller prior to the end time, the server automatically converts the buyer-proposed offer to a proxy bid for consideration against the one or more proxy bids. | 05-05-2011 |
20130290399 | LARGE SCALE STORAGE SYSTEM - A distributed storage system comprising interconnected computer nodes; each one of the computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the computer nodes comprising one or more resources including at least one cache resource configured to cache objects and having corresponding cache-related parameters; at least one UDSP agent of a respective computer node having the at least one cache resource is configured to: monitor cache-related parameters of the at least one cache resource connected to the respective computer node, for determining whether the cache-related parameters meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to at least one other computer node, which after receiving the at least part of one or more cache object spaces, its cache-related parameters meet at least one second SLS criteria. | 10-31-2013 |
20130290529 | LARGE SCALE STORAGE SYSTEM - A distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising processing resources configured to execute a Unified Distributed Storage Platform (UDSP) agent configured to: receive a task having assignments, calculating grades for assignments such that each grade is indicative of a suitability to execute assignments while meeting at least one Service Level Specification (SLS) requirement. The grade is calculated based on storage related resources parameters data. The task is routed to a more suitable computer node based on the calculated grades. The updated infrastructure layer is created in response to adding interconnected computer nodes and executing assignments of following tasks or routing the following tasks to a more suitable computer node based on the calculated grades. | 10-31-2013 |
20140025909 | LARGE SCALE STORAGE SYSTEM - One or more tangible computer readable media storing computer executable instructions that, when executed by a processor, cause a computer node connected to an infrastructure layer of a distributed storage system, the infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, to perform administration of a distributed storage system by: generating at least one portion of a user interface for presentation to a user, each of the portions comprising a control for receiving a Service Level Specification (SLS) requirement; transforming a state of the distributed storage system from a first state to a second state based on the received SLS requirements. | 01-23-2014 |
20150254150 | SYSTEM AND METHOD FOR DATACENTERS DISASTER RECOVERY - A method for configuring an asynchronous Disaster Recovery (DR) process over a storage system comprising a plurality of storage sites, the method comprising: receiving data indicative of the storage sites; calculating information dispersal parameters that enable dispersing slices of DR enabling data based on original data written to a primary storage site out of the storage sites between at least two DR storage sites out of the storage sites, wherein at least one of the DR storage sites is a remote storage site, wherein each of the slices of DR enabling data is smaller than the original data and wherein the DR enabling data is larger than the original data; and configuring the asynchronous DR process in accordance with the calculated information dispersal parameters. | 09-10-2015 |
20150319051 | LARGE SCALE STORAGE SYSTEM - A distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising processing resources configured to execute a Unified Distributed Storage Platform (UDSP) agent configured to: receive a task having assignments, calculating grades for assignments such that each grade is indicative of a suitability to execute assignments while meeting at least one Service Level Specification (SLS) requirement. The grade is calculated based on storage related resources parameters data. The task is routed to a more suitable computer node based on the calculated grades. The updated infrastructure layer is created in response to adding interconnected computer nodes and executing assignments of following tasks or routing the following tasks to a more suitable computer node based on the calculated grades. | 11-05-2015 |