Abstract: Methods, systems and software are described for analyzing micro-blog messages to detect abnormal activity of interest. The system includes a clusterer for clustering micro-blog messages received over a first period of time, a classifier for scoring the clustered messages; a knowledge base, a rule generator for generating classification rules from the knowledge base; and a matcher for matching the scored messages to information requests. Methods for operating the system and its components are described.

Abstract: A system and method for representing, storing and retrieving real-world knowledge on a computer or network of computers is disclosed. Knowledge is broken down into permanent atomic “facts” which can be stored in a standard relational database and processed very efficiently. It also provides for the efficient querying of a knowledge base, efficient inference of new knowledge and translation into and out of natural language. Queries can also be processed with full natural language explanations of where the answers came from. The method can also be used in a distributed fashion enabling the system to be a large network of computers and the technology can be integrated into a web browser adding to the browser's functionality.

Abstract: A system and method allows users to provide portions of scripts or scripts for retrieval of information from one or more web sites of one or more businesses by demonstrating operation of the one or more web sites and identifying locations of one or more fields on each web page of the one or more web sites, and the system and method stores the scripts and uses the scripts to retrieve information from such web site or web sites for any number of users. Different portions of different scripts may be used as a single script to retrieve information from a single web site. Scripts or portions of scripts may be repaired using information from previously working scripts or portions, the web site when the script or portion worked, and the web site when the script or portion did not work.

Abstract: Based on a requested allocation of a managed object, a native memory required with the managed object is determined. A portion of native memory is allocated and a portion of managed memory is allocated based on requirements of the managed object. A memory management strategy is implemented based on the allocation of native memory and unmanaged memory. For example, the memory management strategy can comprise garbage collection of first managed objects that have only managed heap associated therewith is performed before garbage collection of second managed objects that have both managed heap and native memory associated therewith.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for conditionally performing garbage collection. These mechanisms and methods for conditionally performing garbage collection can enable reduced application delay, improved data management efficiency, enhanced customer response, etc.

Abstract: At least one region of a heap that includes memory allocations is analyzed, using age and occupancy criteria, across a number of local garbage collection cycles using a processor executing a region-based garbage collector. Based upon the analyzed age and occupancy criteria of the at least one region, at least one stable region in age and occupancy is identified among the at least one region of the heap across the number of local garbage collection cycles. Maintenance of a remembered set (RS) of external references into the at least one stable region is temporarily stopped for each identified stable region during at least one additional local garbage collection cycle.

Abstract: The invention relates to a method and an apparatus for automatic system cleaning, and a storage medium. The method includes obtaining a triggering occasion and a triggering condition which are selected by a user; determining whether the triggering occasion and the triggering condition are satisfied; and if yes, cleaning a system according to a preset running manner and a preset running policy. Through combination of system cleaning functions and scheduled task functions, and expansion of existing triggering conditions of a tasks scheduler, a user can self-define a triggering occasion, a triggering condition, a running manner and a running policy of system cleaning. When the triggering occasion and the triggering condition designated by the user are satisfied, system cleaning is automatically performed according to the selected running manner and policy, thereby improving the system performance and the system cleaning efficiency, and protecting the computer security and the individual privacy.

Abstract: A technique is disclosed that avoids index page splits when inserting large numbers of rows into a table of a relational database. Keys in index pages are moved to successive index pages to make room to insert keys on the original index page. Where no room is available on successive pages, a new index page is created to hold moved keys. The result is typically a smaller chain of index pages with better locality than using the conventional insertion technique of splitting index pages.

Abstract: At least one region of a heap that includes memory allocations is analyzed, using age and occupancy criteria, across a number of local garbage collection cycles using a processor executing a region-based garbage collector. Based upon the analyzed age and occupancy criteria of the at least one region, at least one stable region in age and occupancy is identified among the at least one region of the heap across the number of local garbage collection cycles. Maintenance of a remembered set (RS) of external references into the at least one stable region is temporarily stopped for each identified stable region during at least one additional local garbage collection cycle.

Abstract: A method, system, and program product for identifying cloud resources are provided, and further a method, system, and program product for configuring cloud resources are provided. The method for identifying cloud resources may include receiving a request with respect to at least one resource in a cloud and determining a set of resources among the at least one resource in the cloud in accordance with the received request. Determining the set of resources may include consulting an ontology including metadata associated with the at least one resource in the cloud and computing the set of resources based on the metadata and the received request. Additionally, the method may include computing a cost factor with respect to the determined set of resources. Furthermore, the method may include rendering, in response to the received request, the determined set of resources and the cost factor with respect to the determined set of resources.

Abstract: Embodiments of the present invention provide a mechanism for weighting search results based on active and passive sharing activity among users in the context of a social network. In particular, information being shared among users is monitored. When a search is requested by a user, information recently shared among a user's social network is consulted and is used to weight the search results in the relevance calculation. For example, sharing activity that occurred recently or ongoing is used to weight the search results.

Abstract: An intelligent system for database retrieval includes a computing device, an input device, a display device, and a storage device. A user initiates a free-form or structured inquiry of the storage device and the system executes a search for the free-form or structured inquiry and additionally for related knowledge if a free-form inquiry was initiated. The related knowledge search is system initiated and based upon the sensory information of the user and the user's behaviors. The free-form or structured inquiry and related knowledge results are returned to the computing device for formatting in a manner compatible with the user, the user's behavior, and the operating environment. The free-form or structured inquiry and related knowledge results are then displayed on the display device.

Abstract: A system includes creation of a first resource queue indicating an order of resources stored in a memory, the order based on respective timestamps associated with the stored resources, association of the first resource queue with a first queue timestamp, reception of a first command to deallocate a first amount of stored resources from the memory, determination that a first stored resource indicated by the first resource queue is associated with a timestamp earlier than the first queue timestamp, deallocation of the first stored resource from the memory, reception of a second command to deallocate a second amount of stored resources from the memory, determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, and, in response to the determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, creation of a second resource queue in

Abstract: The present invention is directed toward methods and systems for data de-duplication. More particularly, in various embodiments, the present invention provides systems and methods for data de-duplication that may utilize storage reclamation. In various embodiments, data de-duplication may be performed using data storage reclamation by reconciling a list of all active tags against a list of all tags present within the object store itself. Any tags found to be in the object store that have no corresponding active usage may then be deleted. In some embodiments additional steps may be taken to avoid race conditions in deleting tags that are needed by incoming data. In some embodiments the object store may request the lists. In other embodiments, a runtime list, in which each new tag is entered as they are returned from the object store. In another embodiment the object store may maintain this list directly.

Abstract: One or more embodiments are directed to creating a structure comprising a weak reference to an object, a strong reference to the object, a count of remote references to the object, and an identifier for the object, incrementing the count when a remote reference is created to the object and decrementing the count when a remote reference is removed, setting the strong reference in response to the count being greater than a first threshold in order to avoid a garbage collection of the object, clearing the strong reference in response to the count being less than a second threshold to enable a garbage collection of the object, and removing the structure and related resources based on a recognition of the object's collection through the weak reference.

Abstract: A method of managing memory, and a system implementing the method, are disclosed herein. In one embodiment according to the invention, the method comprises the step of allocating a first space, a first semi-space and a second semi-space of a memory unit. The first space has a first space size, and the first and second semi-spaces have a semi-space size. The first object is transformed into a plurality of elements and a spine containing pointers to the plurality of elements. The plurality of elements are stored in the first space and the spine in one of the first semi-space and the second semi-space. First memory portions of the first space are reclaimed using a mark-sweep policy and second memory portions of one of the first semi-space and the second semi-space are reclaimed using a moving policy.

Abstract: A storage apparatus includes: an input/output section configured to input and output data related to an external access; a memory for storing input data input by the input/output section by distributing the input data to a plurality of areas while making use of a cache area for temporarily storing the input data; and a control section configured to make an access to the memory on the basis of the external access and carry out a garbage collection operation on the areas including the cache area in order to release the cache area in the access made to the memory on the basis of the external access.

Abstract: A method begins by a processing module identifying a memory device having an expired useable memory life with respect to a legacy storage protocol. The method continues with the processing module extracting data from the memory device. The method continues with the processing module reprovisioning the memory device from the legacy storage protocol to a dispersed storage error coding storage protocol.

Abstract: Systems and methods for returning results to a query based upon topic are disclosed herein. Aspects disclosed can be particularly useful when searching for videos or other media content for which associated textual information are generally relatively sparse compared to other types of content. Text associated with the query can be semantically associated with various domain topics by mapping one or more words included in the query to one or more domain topics based upon a conditional probability of the domain topic given the query. A set of results can be identified based upon a conditional probability of the result given the domain topic.

Abstract: An illustrative embodiment of a computer-implemented process for compaction planning selects a source region from a set of regions to form a selected source region, initializes process data using information from the selected source region and responsive to a determination that a current destination is not NULL and not full, determines whether to atomically consume from a destination. Responsive to a determination to atomically consume from a destination, the computer-implemented process plans to evacuate into a consumed extent and updates the process data and responsive to a determination that the source region is empty, determines whether more work remains. Responsive to a determination that more work does not remain, the computer-implemented process generates a relocation table.

Abstract: Tracking newly created objects during a garbage collection cycle includes marking newly allocated objects in the GC cycle during the allocation cache population phase. The goal is to take a high performance system for tracing live objects, such as the mark map, and combine the SATB with a cached allocation system for heap memory such that SATB representation is preserved. Embodiments combine both efficient support for an SATB model during a collection cycle and a highly optimized allocation path for heap objects in an allocation scheme (which may optionally be a size segregated class allocation scheme) that allows both mechanisms to co-exist effectively. Specifically, embodiments track newly created objects during a GC cycle such that they are kept alive during the trace phase while continuing to support a highly efficient allocating caching strategy.

Abstract: Methods, systems, and articles for receiving, by a computing device, execution results of a plurality of query language expressions are described herein. In various embodiments, the plurality of query language expressions may be concurrently executed, and the receiving may be contemporaneous with production of the execution results. Also, in various embodiments, the computing device may store a result item of the execution results for at least a first of the query language expressions in a memory block allocated exclusively for the first of the query language expressions while the first of the query language expressions is being executed, or in a result handle associated with the first of the query language expressions.

Abstract: A mechanism is provided for managing balloon objects of a memory balloon for a runtime environment executing in a virtual machine. The mechanism includes a balloon agent that evaluates a relative value of each balloon object. The balloon agent may set an allocation rate of rebuilding balloon objects based on life spans of previously garbage-collected balloon objects. The balloon agent may also modify a percentage of balloon objects to be weak-referenced based on an amount of application data freed in a previous garbage collection.

Abstract: A method, system and computer program product for reducing garbage collection pause time. According to example embodiments, a garbage collection cycle is initiated on a set of objects that have been dynamically allocated in a memory. An identification is made of new persistent objects and reachable non-persistent objects while ignoring old persistent objects that have been identified as persistent in previous garbage collection cycles. The new persistent objects are associated as members of a set of persistent objects that includes the old persistent objects. The persistence information for the set of persistent objects is preserved for use during subsequent garbage collection cycles. All reachable non-persistent objects and all persistent objects in the set of persistent objects are marked for memory reclamation phase processing.

Abstract: A process of determining explicitly free data space in computer data storage systems with implicitly allocated data space through the use of information provided by a hosting computer system with knowledge of what space allocated is currently being used at the time of a query, is provided. In one embodiment, a File System (“FS”) is asked to identify clusters no longer in use which is then mapped to physical disks as visible to an Operating System (“OS”). The physical disks are mapped to simulated/virtualized volumes presented by a storage subsystem. By using server information regarding the FS, for those pages that are no longer in use, point in time copy (“PITC”) pages are marked for future PITC and will not be coalesced forward, thereby saving significant storage.

Abstract: A system and method are provided to customize allocation statistics. In one embodiment, a tag is associated to one or more threads to receive allocation statistic information relating to the one or more tagged threads, the one or more threads are tagged prior to performing an allocation statistic session. The allocation statistic session is performed via a plurality of threads at a first virtual machine at a server. A plurality of threads performing the allocation statistic session includes the one or more tagged threads is determined. The allocation statistic information relating to the one or more tagged threads is extracted, if the plurality of threads includes the one or more tagged threads.

Abstract: A system for managing storage space on an electronic storage medium is provided in which a file format for stored data allows for progressive deletion of low-significance data, for example in a video or audio file, while allowing the remaining portions of the file to be subsequently retrieved. The file format allows for the ready deletion of low-significance data without having to open, edit and subsequently rewrite the data. Furthermore, rules-based algorithms for the deletion of low-significance data allow a user to store and progressively delete such low-significance data in accordance with time parameters, available storage space and the like, without having to delete the full file.

Abstract: A system and method for use with garbage collected systems and languages, for enabling an allocated heap memory to be updated (e.g., increased or decreased) at runtime, subject to sufficient availability of physical memory. In accordance with an embodiment, a Java Virtual Machine (JVM) is associated with a management console, which allows a systems administrator to monitor current heap utilization at runtime. The heap is visualized as a contiguous chunk of memory with one or more extension points, e.g., by use of a trailing pointer to a null list. If later, at runtime, the heap size needs to be incremented then the trailing pointer can be set to a new chunk of memory with a size of (new value?old value), so that the cumulative new size is made equal to a new value specified on the console.

Abstract: A user may select a profile to serve as an active profile on a device, and content objects associated with the active profile may be stored on the device responsive to the selection. Content objects that are not associated with the active profile may be transferred to one or more additional devices based on a prioritization scheme. Content object download operations may take advantage of the prioritization scheme to determine a storage device for a downloaded content object.

Abstract: A method is provided for garbage collection in a heap of an application server that uses automated garbage collection. The method comprises gathering information about a plurality of garbage collection events. The method further comprises identifying a correlation between garbage collection activity and a volume of applications transactions in the application server. The method further comprises, based on the correlation, forecasting at least one of a future utilization of heap memory and a future garbage collection activity based on a projected future transaction volume. The method further comprises tuning the heap based on the forecast.

Abstract: Changes to a hierarchical organizational structure may be stored in different versions of a data structure depicting the hierarchical organizational structure. Each of these versions may include a validity period field representing a time period that the hierarchical organizational structure depicted in the version accurately reflects the organizational structure of the organization. Each of the versions may also be designated as active or inactive. In some instances, each of the versions may be designated as inactive except for a version that reflects the organizational structure of the organization at a particular time, which may change over time. Historical copies of versions may be stored and subsequently recalled to identify an organizational structure that was in effect at a particular time in the past. The recalled version may then be used to limit the results of a query to a selected node of the historical organizational structure.

Abstract: A data mapping acceleration system may include a syntactic profile module to generate a syntactic profile of a data source to be mapped. A semantic classification module may generate a semantic classification of the data source. A similarity module may evaluate the syntactic profile and semantic classification to determine an overall similarity between attributes of data from the data source for mapping the data source.

Abstract: An operating system or virtual machine of an information handling system (IHS) initializes a garbage collector to provide object memory compaction during application execution. The operating system or virtual machine performs move and fixup management within heap or object memory stores. The garbage collector identifies holes or unused portions of heap memory and moves one or more objects during compaction operations. After the garbage collector moves the object, a fixup cache tool fixes up the object pointers within the object. The fixup cache tool maintains a fixup cache that includes pointer information corresponding to the objects that the garbage collector moves. The fixup cache tool employs the pointer information within the fixup cache to update or otherwise fixup the objects within the heap that the garbage collector moves during compaction operations. The fixup cache may provide predictive pointer update information during fixup operations for each object move within the heap.

Abstract: The invention relates to memory overload management for Java virtual machines (JVMs) in Web application sever systems. Disclosed is a method and system of memory overload management for a Web application sever system, wherein the Web application sever system comprises multiple JVMs, the method comprising: determining one or more replica shards for which replacement shall be performed; determining one or more target JVMs for storing a corresponding replica shard set including at least one replica shard from the one or more replica shards; and for each target JVM, performing the following: judging whether the free memory of the target JVM is adequate for storing the corresponding replica shard set; if the judging result is negative, performing the following: causing the target JVM to suspend the creation of session until the free memory of the target JVM becomes adequate for storing the corresponding replica shard set.

Abstract: A computer includes a storage region in which an object generated by executing a program is disposed, and a control unit that performs execution of the program and releasing of the storage region. The control unit updates time information using garbage collection, a capacity of objects in a memory, or similar as a trigger, acquires information of a program generating an object and time information at the time of generation of the object which are recorded in a recording device so as to be correlated with each other when the object is generated. The control unit further detects an object which is unnecessary to execute a subsequent program and acquires the time information, and records a difference between the time information at the time of the generation and at the time of the detection in the recording device so as to be correlated with the information of the program.

Abstract: Systems and methods for extracting information from structured documents are provided. The systems and methods relate to selecting a centroid document from a group of structured documents, selecting a subset of the group of structured documents in order to form a cluster of the subset of documents about the centroid document. The selecting the subset is preferably based on the relative similarity between each of the selected subset and the centroid document. Then, systems and methods according to the invention include marking a data element on the centroid document. The systems and elements also include identifying a data element on each of the subset of documents, the data element that corresponds to the marked data element on the centroid document. Finally, data may be extracted from the subset of documents based on the identifying step.

Abstract: A system includes creation of a first resource queue indicating an order of resources stored in a memory, the order based on respective timestamps associated with the stored resources, association of the first resource queue with a first queue timestamp, reception of a first command to deallocate a first amount of stored resources from the memory, determination that a first stored resource indicated by the first resource queue is associated with a timestamp earlier than the first queue timestamp, deallocation of the first stored resource from the memory, reception of a second command to deallocate a second amount of stored resources from the memory, determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, and, in response to the determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, creation of a second resource queue in

Abstract: A method is implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions. The programming instructions are operable to optimize data remanence over hybrid disk clusters using various storage technologies, determine one or more data storage technologies accessible by a file system, and determine secure delete rules for each of the one or more storage technologies accessible by the file system. The secure delete rules include a number of overwrites required for data to be securely deleted from each of the one or more storage technologies. The programming instructions are further operable to provide the secure delete rules to the file system upon a request for deletion of data for each of the one or more storage technologies a specific amount of times germane to secure delete data from the one or more storage technologies.

Abstract: During compilation, a table mapping relative virtual address of a memory-allocating instruction of a native language program to a user type of the instance is created. During execution of the program, a module injected into the process intercepts calls to memory allocating functions and records the virtual address of the instruction calling the memory allocating function and the virtual address of the instance created. When a snapshot of the process heap is requested, the user type of the corresponding compile time instruction is assigned to the created instance. User type and heap information can be used to compute sizes of memory allocations and to aggregate user type instance counts and sizes. Using the static debugging information, a reference graph that displays the nesting of objects in live instances can be computed and displayed.

Abstract: A device receives, from a user device, a search query for media content within a content delivery network. The device identifies a group of relevant media content in the content delivery network, where the identifying is based on the search query, access restrictions of particular media content within the content delivery network, and/or a capability of the user device to present particular types of media content. The device associates sub-scores with each piece of media content in the group of relevant media content, and calculates a total score, for each piece of media content in the group of relevant media content, based on the sub-scores. The device ranks each piece of media content in the group of relevant media content, based on the total scores for each piece of media content, and sends, based on the search query, a list of the ranked, relevant media content to the user device.

Abstract: A technique for incrementally unloading classes using a region-based garbage collector is described. One aspect of such a technique includes maintaining a remembered set for a class set. The remembered set indicates whether instances of the class set are contained in one or more regions in memory, and in which regions the instances are contained. Upon performing an incremental garbage collection process for a subset of the regions in memory, the technique examines the remembered set to determine whether the class set includes instances in regions outside of the subset. If the remembered set indicates that the class set includes instances outside of the subset of regions, the technique identifies the class set as “live.” This will preclude unloading the class set from the subset of regions.

Abstract: When an output request is received, a tree generating unit of a search apparatus generates, based on an output item included in an output request tree-structure data from hierarchical-structure data (described as search target data with reference to FIG. 1) to be searched. A tree scanning unit searches for data corresponding to the output item by scanning the tree-structure data generated by the tree generating unit. An output unit outputs the data searched by the tree scanning unit.

Abstract: A method of managing workflows related to storage services provided by a service provider to a customer (via a management system) is presented. The management system includes a Web server and a workflow process. The Web server presents to a customer a task screen (or set of task screens) for a customer-selected work order request type so that the customer can prepare and submit a work order request to the management system. After receiving the work order request, the Web server uses information contained in and associated with the request to create a database object that includes some or all of the following elements: customer identifier; work order identifier, date/time of request; request state (e.g., new, open or closed); type of request; parameters or arguments to the request; and any textual description provided by the customer. The Web server stores the object in a database.

Abstract: Exemplary method, system, and computer program product embodiments for efficient garbage collection in a compressed journal file system are provided. In one embodiment, by way of example only, a map corresponding to data blocks with overwritten compressed journal entries is configured. Weighted conditions for each of the overwritten compressed journal entries are calculated. The weighted conditions are arranged in the map from lowest to highest. One of the weighted conditions includes a biasing variable towards selecting data blocks having free space at an end of at least one associated record. Additional system and computer program product embodiments are disclosed and provide related advantages.

Abstract: The problem of the present invention is to be capable of efficiently using a system resource of a device. For solving the above problem, an application platform according to the present invention comprises determining unit for determining whether an application for installation or activation is installed or activated, wherein when the determining unit determines whether the application for installation or activation is installed or activated, the determining unit refers to a first resource use amount and a second resource use amount larger than the first resource use amount of each of a plurality of applications already installed or activated, a first resource use amount and a second resource use amount larger than the first resource use amount of the application for installation or activation.

Abstract: Aspects for conservative garbage collecting are disclosed. In one aspect, a heap of objects is generated during an execution of a script, and script objects in an unexecuted portion are traced to corresponding memory locations on the heap. The heap is then marked concurrently with executing the script such that a marked heap includes reachable and unreachable objects. Memory allocated to the unreachable objects is then freed concurrently with executing the script based on the marking. In another aspect, an object graph associated with a call stack is generated and traced such that script objects in an unexecuted portion of the stack are traced to corresponding memory locations on a heap. Heap objects are marked concurrently with executing the stack so that a marked heap includes reachable and unreachable objects. Memory allocated to the unreachable objects is then cleared concurrently with executing the stack based on the marked heap.

Abstract: Described are computer-based methods and apparatuses, including computer program products, for garbage collection. A garbage collection data structure is provided for deleting unused data objects. One or more object identifiers are stored in a first data structure in the garbage collection data structure. Each object identifier represents a data object about to be created but not yet assigned any references from other data objects. The first data structure prevents the data object from being deleted during creation of the data object but before one or more references are created to the data object. Data indicative of one or more objects is stored in a second data structure in the garbage collection data structure. The data includes one or more object identifiers, each object identifier representing a created data object. The data also includes one or more references to created data objects.

Abstract: In an object-relocating garbage collector, objects are copied and new copies taken into use concurrently with mutator execution without needing to use a read barrier, and importantly, without requiring verification (read-back) of each copied word and without requiring atomic instructions for the copying. Write barriers, thread-local write barrier buffers and processing them by the garbage collector, and write propagation are used for achieving this.

Abstract: Disclosed are apparatus and methods for managing image storage. An image source of a computing device can include one or more functions and a reference to image views for an image object, such as a bitmap object. The image object can include a reference to first storage that stores an image. The image source, the reference to the image views, and the image object are stored in a managed portion of memory. The first storage is stored in an unmanaged portion of memory differing from the managed portion. The computing device displays the image. Upon determining to discontinue displaying the image, an unbind function of the image source is called. The image source responsively discontinues display of the image. The image source receives an indication that the image views are solely weakly referenced. In response to the indication, the image source deallocates the first storage.

Abstract: A computer-implemented method, system, and article of manufacture for generating hash codes to identify objects. The method increases variation in object hash codes to reduce conflict between object hash codes and enables them to be added to pinned objects. The method includes: generating a seed value for each heap area and generating the hash code on the basis of address of the object and seed value of the heap area to which the object is allocated. The article of manufacture includes computer readable instructions which, when implemented, cause a computer to perform the steps of the above method. The computer-implemented system includes a processor; and a memory which includes a hash code, an object, a seed value, and a heap area, wherein the processor is configured to perform the steps of the above method.