38results about How to "Efficiently deleting" patented technology

A system and method efficiently deletes a file from secure storage, i.e., a cryptainer, served by a storage system. The cryptainer is configured to store a plurality of files, each of which stores an associated file key within a special metadata portion of the file. Notably, special metadata is created by a security appliance coupled to the storage system and attached to each file to thereby create two portions of the file: the special metadata portion and the main, “file data” portion. The security appliance then stores the file key within the specially-created metadata portion of the file. A cryptainer key is associated with the cryptainer. Each file key is used to encrypt the file data portion within its associated file and the cryptainer key is used to encrypt the part of the special metadata portion of each file. To delete the file from the cryptainer, the file key of the file is deleted and the special metadata portions of all other files stored in the cryptainer are re-keyed using a new cryptainer key. Thereafter, the “old” cryptainer key is deleted.

A system and method for optimizing a storage system to support short data object lifetimes and highly utilized storage space are provided. With the system and method, data objects are clustered based on when they are anticipated to be deleted. When an application stores data, the application provides an indicator of the expected lifetime of the data, which may be a retention value, a relative priority of the data object, or the like. Data objects having similar expected lifetimes are clustered together in common data structures so that clusters of objects may be deleted efficiently in a single operation. Expected lifetimes may be changed by applications automatically. The system automatically determines how to handle these changes in expected lifetime using one or more of copying the data object, reclassifying the container in which the data object is held, and ignoring the change in expected lifetime for a time to investigate further changes in expected lifetime of other data objects.

An MFP can transmit image data read by a scanner by attaching it to E-mail. At the time of transmission, the image data input by the scanner and stored in a work memory is converted into mail data so as to be transmitted by E-mail, and the mail data is stored again into the work memory. The mail data is divided every predetermined reference data size into divided files which are sequentially transmitted as divided mails. When completion of transmission of divided mails corresponding to a unit image is confirmed, the image data and mail data of the unit image are eliminated from the work memory. By sequentially performing such a process, the memory use efficiency can be improved while holding image data of a unit image which has not been transmitted yet.

A mail filter device allowing processing time to be reduce is provided. The SMTP processor relays commands and responses exchanged between SMTP client and SMTP server and performs content check during message relaying. TCP / IP terminations share header information through a connection manager, keeping TCP / IP header information identical both between the SMTP client and the mail filter device and between the mail filter device and the SMTP server. When the content check determines that the electronic mail is relayed without discarding its message, the SMTP processor transfers a response to the SMTP client when the SMTP server has completed relay processing.

An image processing apparatus deals with a plurality of objects each having a pair of image data representative of an image and image attribute information representative of an attribute of the image, wherein the plurality of objects are linked in form of a hierarchy structure including a parentage. The image processing apparatus comprises object producing means for producing new objects upon succession of image attribute information of a parent object, object deleting means for deleting an object and the associated descendant objects as well, and attribute information altering means for altering an attribute of an object and an attribute of the associated descendant objects as well.

In an information delivery system including a plurality of node devices mutually communicable through a network,transfer destination node information is respectively memorized in the node devices, and at least one piece of delivery information is distributed and stored therein, anda registration message including storage source node information indicative of one node device storing the delivery information is sent out and transferred to a node device for managing delivery information location through relay node devices in accordance with the transfer destination node information, and the storage source node information is memorized in the relay node devices and the node device for managing delivery information location,wherein the relay node device includes:a memory means;a node information change detection means;a storage source node information extraction means;a reregistration message generation means for generating a reregistration message including the storage source node information; anda reregistration message sending means.

An image processing apparatus deals with a plurality of objects each having a pair of image data representative of an image and image attribute information representative of an attribute of the image, wherein the plurality of objects are linked in form of a hierarchy structure including a parentage. The image processing apparatus comprises object producing means for producing new objects upon succession of image attribute information of a parent object, object deleting means for deleting an object and the associated descendant objects as well, and attribute information altering means for altering an attribute of an object and an attribute of the associated descendant objects as well.

In a data storage apparatus for storing data by making the data to be a file, a file is deleted, in a normal deletion processing, after contents of the file are destructed by overwriting the file to be deleted with data for elimination such as “all-zeros”. On the other hand, with respect to storage processing, when storing new data, files waiting for deletion are investigated whether they are existent or not, excluding files being deleted currently in the normal deletion processing, and when files waiting for deletion are existent, either one of the files waiting for deletion is overwritten with new data to be stored.

In a data storage apparatus for storing data by making the data to be a file, a file is deleted, in a normal deletion processing, after contents of the file are destructed by overwriting the file to be deleted with data for elimination such as “all-zeros”. On the other hand, with respect to storage processing, when storing new data, files waiting for deletion are investigated whether they are existent or not, excluding files being deleted currently in the normal deletion processing, and when files waiting for deletion are existent, either one of the files waiting for deletion is overwritten with new data to be stored.

Creation of integrated color conversion data for color processing requires a large computation volume and much time in case of a device and GMA used for the first time. Hence, first color conversion data is stored in a memory, second color conversion data different from the first color conversion data is retrieved, and integrated color conversion data is generated from the first color conversion data and the second color conversion data. The generated integrated color conversion data is stored in the memory, so that the integrated color conversion data is read out from the memory and is used upon application of color processing according to the first color conversion data and the second color conversion data to color data.

One embodiment of the present invention provides a system that solves a global optimization problem specified by a function ƒ and a set of equality constraints qi(x)=0 (i=1, . . . , r), wherein ƒ is a scalar function of a vector x=(x1, x2, x3, . . . xn). During operation, the system receives a representation of the function ƒ and the set of equality constraints and stores the representation in a memory. Next, the system performs an interval equality constrained global optimization process to compute guaranteed bounds on a globally minimum value of the function ƒ(x) subject to the set of equality constraints. During this process, the system applies term consistency to a set of relations associated with the interval equality constrained global optimization problem over a subbox X, and excludes any portion of the subbox X that violates the set of relations. It also applies box consistency to the set of relations, and excludes any portion of the subbox X that violates the set of relations. Finally, the system performs an interval Newton step for the interval equality constrained global optimization problem over the subbox X. The system integrates the sub-parts of the process with branch tests designed to increase the overall speed of the process.

A method is provided for processing data in a mobile communication terminal including a first data memory for storing first data indicating user-stored information and a second data memory for storing second data indicating user-stored information. The method includes creating a first data list corresponding to the first data and a second data list corresponding to the second data and displaying items of the first data list and items of the second data list on a screen of the mobile communication terminal in response to a user's data movement request, selecting at least one item from one that is selected from the first data list and the second data list that are separately displayed based on user's selection information, and storing data of the selected item in the first data memory or the second data memory into the other memory if a predetermined key is input.

Creation of integrated color conversion data for color processing requires a large computation volume and much time in case of a device and GMA used for the first time. Hence, first color conversion data is stored in a memory, second color conversion data different from the first color conversion data is retrieved, and integrated color conversion data is generated from the first color conversion data and the second color conversion data. The generated integrated color conversion data is stored in the memory, so that the integrated color conversion data is read out from the memory and is used upon application of color processing according to the first color conversion data and the second color conversion data to color data.

An optimizing apparatus includes a data item extraction unit, a layout unit, an unused data item extraction unit, a merge determination unit, and a data item merge unit. The data item extraction unit extracts data items from a program. The layout unit lays out the extracted data item in memory. The unused data item extraction unit extracts defined but unused data items from the extracted data items. The merge determination unit determines based on the layout result whether or not a plurality of unused data items forming a data item having a hierarchical structure can be merged into a new data item. The data item merge unit merges the plurality of data items into a data item based on the determination result.

An authentication server, on receipt of a request to delete a user account, determines whether the account exists in a user authentication table. If the account exists, the authentication server deletes the account, and retrieves, from a requesters list in which information of devices from which users have to date requested user authentication is saved, an address of a device from which the user targeted for deletion has previously issued an authentication request, and issues a deletion request to that device together with account information. Similar processing to change a user account is performed in response to a change request.

A system that solves a global inequality constrained optimization problem specified by a function ƒ and a set of inequality constraints pi(x)≦0(i=1, . . . , m), wherein ƒ and pi are scalar functions of a vector x=(x1, x2, x3, . . . xn). The system performs an interval inequality constrained global optimization process to compute guaranteed bounds on a globally minimum value of the function ƒ(x) subject to the set of inequality constraints. The system applies term consistency and box consistency to a set of relations associated with the global inequality constrained optimization problem over a subbox X, and excludes any portion of the subbox X that violates the set of relations. The system also performs an interval Newton step on the subbox X to produce a resulting subbox Y. The system integrates the sub-parts of the process with branch tests designed to increase the overall speed of the process.

A system for generating a reconstruction of an object of interest comprises a shape model generator (1) for generating a shape model representing a shape of the object in dependence on a plurality of projections of the object, and a reconstructor (2) for reconstructing the object, based on the projections, in dependence on the shape model to obtain the reconstruction of the object. The reconstructor (2) comprises a soft-tissue reconstructor (4) for generating a reconstruction favoring soft tissue, based on the plurality of projections, and a sparse reconstructor (5) for generating a reconstruction of sparse objects, based on the plurality of projections. The reconstructor (2) comprises a clipping subsystem (3) for clipping an outside of the object from the reconstruction, based on the shape model, or the reconstructor (2) is arranged for reconstructing only an inside and / or boundary of the object as defined by the shape model.

In an information delivery system including a plurality of node devices mutually communicable through a network,transfer destination node information is respectively memorized in the node devices, and at least one piece of delivery information is distributed and stored therein, anda registration message including storage source node information indicative of one node device storing the delivery information is sent out and transferred to a node device for managing delivery information location through relay node devices in accordance with the transfer destination node information, and the storage source node information is memorized in the relay node devices and the node device for managing delivery information location,wherein the relay node device includes:a memory means;a node information change detection means;a storage source node information extraction means;a reregistration message generation means for generating a reregistration message including the storage source node information; anda reregistration message sending means.

Methods of modifying a frataxin gene are disclosed, comprising removing some or all of endogenous GAA trinucleotide repeats within the frataxin gene, e.g., within an intron (e.g., intron 1) of the frataxin gene. The removal may be effected using a CRISPR / CAS nuclease system. Such modification may be used to increase frataxin expression in the cell, and also to treat a subject suffering from Friedreich ataxia. Reagents, kits and uses of the method are also disclosed, for example to modify a frataxin gene and to treat a subject suffering from Friedreich ataxia.