Abstract: Transferring content between one or more input streams and one or more output streams via an application running on a host system. A kernel-level service is provided which is adapted to perform application-specific processing and which attends to transfer of content from at least one input stream to at least one output stream. With the kernel-level service, an operation is performed for the collection of at least one input stream and at least one output stream via: performing application-specific processing; and attending to the transfer of content from at least one input stream to at least one output stream.

Abstract: Methods and apparatus are provided for copying data from a primary storage facility to a secondary storage facility which reduce the workload on the storage controller in the primary facility and minimize bandwidth usage. The primary storage facility includes a primary data replication appliance which transfers data to a secondary replication appliance. Updated data from a host is both stored through a storage controller in the primary facility and also received by the primary replication appliance. Logic in the primary replication appliance determines whether the immediately previous version of the data is in a buffer from a previous storage operation. If so, the current (updated) version of the data is compared with the previous version and the difference, such as calculated through a bit-wise exclusive-OR operation, is transferred to the secondary replication appliance.

Abstract: Policy based data shredding is provided to be executed in a storage controller. A logical volume stored on media, such as magnetic disk drives, may be assigned one or more possible shredding policies. Storing and executing the policies in the controller is more efficient than performing host-based shredding and requires the use of less valuable bandwidth between the host and the controller. In addition, the controller is aware of failures, degradation and offline status of each drive in an array, and is able to thereby terminate or modify a shredding operation if necessary. Each policy includes the number of write passes to be performed on the media location in which the volume is stored and the pattern to write on the media location. The policy may also indicate whether to update a parity area during each of a plurality of write passes or only on the first.

Abstract: A networked system includes multiple information handling systems (IHSs) that store personal user information such as name and contact information. The networked system automatically updates personal user information when one IHS communicates with another IHS. A first IHS stores personal user information associated with a first IHS user. A second IHS also stores the first user's personal information. The first IHS sends a first user information update to the second IHS if the first IHS determines that the first user information on the second IHS is not current. A digital certificate accompanies the update to indicate the authenticity of the information update to the second IHS.

Abstract: An instant messaging (IM) client-server network system includes a calendar server and an IM server in one embodiment. The calendar server stores calendars including events and lists of attendees for respective events. The calendar server also stores IM restriction information that specifies limitation of the IM capabilities of attendees of a particular event. In one embodiment, an event organizer inputs the IM restriction information. In another embodiment, an event attendee inputs IM restriction information that limits the IM capability of that particular attendee. When the time of a calendared event arrives, the calendar server sends the IM restriction information associated with that event to the IM server. The IM server enforces the IM restrictions associated with the IM restriction information during the particular event. When the event is over, the IM server restores full IM capability to the attendees of the event.

Abstract: A networked system includes multiple information handling systems (IHSs) that store personal user information such as electronic business cards (EBCs). A first IHS stores the EBC of the EBC owner, namely the user of the first IHS. A second user operates a second IHS. When the second user attempts to forward the EBC to a third IHS operated by a third user, the second IHS instead sends an EBC request to the third IHS. The third user then forwards the EBC request back to the EBC owner's IHS if the third user desires to obtain the EBC. This provides the original owner of the EBC with the opportunity to reject or approve the request for the EBC. In this manner, the owner of the EBC effectively controls the downstream distribution of the owner's EBC when IHS users other than the owner attempt to forward the owner's EBC.

Abstract: Load shedding schemes for mining data streams. A scoring function is used to rank the importance of stream elements, and those elements with high importance are investigated. In the context of not knowing the exact feature values of a data stream, the use of a Markov model is proposed herein for predicting the feature distribution of a data stream. Based on the predicted feature distribution, one can make classification decisions to maximize the expected benefits. In addition, there is proposed herein the employment of a quality of decision (QoD) metric to measure the level of uncertainty in decisions and to guide load shedding. A load shedding scheme such as presented herein assigns available resources to multiple data streams to maximize the quality of classification decisions. Furthermore, such a load shedding scheme is able to learn and adapt to changing data characteristics in the data streams.

Abstract: Towards mining closed frequent itemsets over a sliding window using limited memory space, a synopsis data structure to monitor transactions in the sliding window so that one can output the current closed frequent itemsets at any time. Due to time and memory constraints, the synopsis data structure cannot monitor all possible itemsets, but monitoring only frequent itemsets makes it difficult to detect new itemsets when they become frequent. Herein, there is introduced a compact data structure, the closed enumeration tree (CET), to maintain a dynamically selected set of itemsets over a sliding-window. The selected itemsets include a boundary between closed frequent itemsets and the rest of the itemsets Because the boundary is relatively stable, the cost of mining closed frequent itemsets over a sliding window is dramatically reduced to that of mining transactions that can possibly cause boundary movements in the CET.

Abstract: A method for processing a point-in-time copy of data associated with a logical storage volume where the data to be copied is stored in a striped or parallelized fashion across more than one physical source volume. The method includes receiving a point-in-time copy command concerning a logical volume and distributing the point-in-time copy command in-band to each of the physical source volumes containing a portion of the striped data. The method also includes establishing a point-in-time copy relationship between each physical source volume and one of a corresponding set of multiple physical target volumes. The method further includes copying the data stored on each physical source volume to the corresponding physical target volume. The in-band copy command and the striped data may be distributed over I/O channels between a server and the physical storage and processed sequentially.

Abstract: A method of task management in a data processing system having a first hardware entity and a second hardware entity, the first and second hardware entities having dissimilar functional capabilities. The method includes providing a task for processing, queuing the task in a priority task queue associated with both the first hardware entity and the second hardware entity, and associating a context designation with the task. In addition, the method includes specifying the minimum hardware entity functional capability necessary to process the task, selecting which one of the hardware entities shall process the task, and submitting the task to the selected hardware entity for processing.

Abstract: Methods and systems for analyzing XML documents. The system scans an XML document, identifies different dimensions that span the XML document and detects scoping relationships amongst them. The system uses the dimensional information to create a logical hierarchical scoped dimension analysis model, maps the logical XML tree to this model, and then implements the analytical method over the logical model. The logical model allows both structural features and numeric/non-numeric data to be used for analysis. The analytical method allows users to query irregular structural properties of the XML documents using the XPath navigational API.

Abstract: Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. Herein, there is addresed the problem of query equivalence with respect to this transformation, and thereis introduced a performance-oriented principle for sequencing tree structures. With query equivalence, XML queries can be performed through subsequence matching without join operations, post-processing, or other special handling for problems such as false alarms. There is identified a class of sequencing methods for this purpose, and there is presented a novel subsequence matching algorithm that observe query equivalence. Also introduced is a performance-oriented principle to guide the sequencing of tree structures.

Abstract: The provision of methods and apparatus to determine package identity for an application build. The idea is based on providing a mapping of package with affiliated attributes such as paths used for include or linking, along with reverse mappings. This mapping could be provided through any number of conventional environments such as program development environments or operating system registries: Tools would access this information through a programmatic interface, and use that information to identify packages affiliated with some information. For example, a symbol in a program would be defined in some file. That file would be in a path, which maps to the package identity. Thus, the symbol definition can be conceptually affiliated with a package.

Abstract: The introduction of extensions to query processing systems for XML documents that allow the analysis of such documents via grouping and aggregation operations. Assumed is the existence of an analysis module for extracting information on how parts of an XML document interrelate with other parts. This information is then used together with a user query in order (1) to partition the nodes of the document in various ways and (2) to compute and output the aggregation value of each such partition. To these ends, there are provided new query operators and extensions to query processing systems comprising a hierarchical node list generator and a hierarchical node list processor. The former takes the grouping information from the query as input and generates document node partitionings. The latter takes the node partitionings as input and computes aggregation values for each partition and generates a query result that is returned to the user.

Abstract: Methods and arrangements for managing error messages from a set of programming tools within a program development environment, such as compilers, linkers, library builders, etc. The error messages are arranged as a directed acyclic graph, with the nodes as error messages, and edges as dependency relationships. In accordance with at least one presently preferred embodiment of the present invention, there are broadly contemplated the following: allowing one or more programming tool to report errors to an error manager component; deducing dependencies amongst error messages, based on error dependency definition provided to the error manager; and delivering messages and dependencies to client components. Although framed within the context of program development tools, this solution could be applied to many other tools outside this domain, under suitable and specified requirements.

Abstract: To conserve energy, components in mobile devices normally have to transition less frequently between “active” and “sleep” modes, and to sleep for longer intervals. In accordance with at least one presently preferred embodiment of the present invention, there is broadly contemplated herein an approach to reduce energy consumption by using HTTP proxies to shape incoming WLAN traffic. Proxies contemplated herein use techniques specific to the HTTP payload to compensate for any negative impact that shaping may have. Thus, there is described herein the architecture of a “PowerAware Streaming Proxy” (PASP), built on a PowerAware x-Proxy (PAxP) framework. PASP preferably uses RTSP/RTP semantics to effectively schedule media streams across the WLAN. Herein, PASP is compared with PAWP, which is a PAxP extension for web traffic, and problem areas are identified.

Abstract: A client server network system is disclosed that protects memory data objects from being viewed by those other than a verified user. Original application code in a server is modified to intercept calls to an original class object via a secure proxy that is injected or weaved into the original application code. The secure proxy verifies that the user generating the request for the original class object is authorized to access that object. If the user is so verified, the secured proxy encrypts the requested class object. Should an unverified user somehow access the encrypted class object, such a user would be provided with scrambled information. However, if the user making the request for the class object is a verified user, the class object is decrypted and information from the decrypted class object is transmitted to the verified user.

Abstract: A novel trace cache design and organization to efficiently store and retrieve multi-path traces. A goal is to design a trace cache, which is capable of storing multi-path traces without significant duplication in the traces. Furthermore, the effective access latency of these traces is reduced.

Abstract: Methods and apparatus are provided for managing data in a hierarchal storage subsystem. A plurality of volumes is designated as a storage group for Level 0 storage; a high threshold is established for the storage group; space is allocated for a data set to a volume of the storage group, storing the data set to the volume; the high threshold is compared with a total amount of space consumed by all data sets stored to volumes in the storage group; and data sets are migrated from the storage group to a Level 1 storage if the high threshold is less than or equal to the total amount of space used by all of the data sets stored to volumes in the storage group. Optionally, high threshold are assigned to each storage group and, when the space used in a storage group reaches or exceeds the high threshold, migration of data will begin from volumes in the storage group, beginning with the volume having the least free space. Thus, contention between migration and space allocation is reduced.

Abstract: Compressive or tensile materials are selectively introduced beneath and in alignment with spacer areas and adjacent to channel areas of a semiconductor substrate to enhance or degrade electron and hole mobility in CMOS circuits. A process entails steps of creating dummy spacers, forming a dielectric mandrel (i.e., mask), removing the dummy spacers, etching recesses into the underlying semiconductor substrate, introducing a compressive or tensile material into a portion of each recess, and filling the remainder of each recess with substrate material.