Abstract: A method, system, and program for adjusting the size of a file system and an inline file system log housed in a static logical volume. A computer system includes a logical volume allocated between an file system and its inline file system log. A request is received to adjust the inline log from a current size to a new size while maintaining the size of the logical volume. Storage space is then allocated from within the logical volume to the inline log according to the storage requirement for the new size. Allocating storage space may require decreasing or increasing the amount of storage formerly allocated to the inline log. Then, the inline log is reformatted to the allocated storage space, such that the storage allocated to the inline log for a file system is adjusted while the size of the logical volume housing the inline log and file system remains static.

Abstract: Intelligent computer implemented agents are associated with computer user interface tasks by dividing the tasks into statistically distinct clusters based on sampled user assessments. The assessments collect data on multiple user variables. Multivariate statistical analysis is used to divide the tasks into distinct clusters. The clusters are validated using univariate analysis on each of the measured variables. Intelligent agents are associated based on the measured variables to ensure that agents are effective. The objective assessment and association avoids costly creation and overhead of agents applied where not effective.

Abstract: A method and computer system is provided for storing a data file in a peer-to-peer network of computer systems according to a selectable service level. Each computer system offers storage services at one of a set of service levels, the method comprising assigning to each of the computer systems respective peer identifiers from a metric space in such a way that the distance between peer identifiers of computer systems offering storage at the same service level is smaller than between peer identifiers of computer systems offering storage at different service levels.

Abstract: In one embodiment, at least one information control device manages the content displayed on multiple separate portable, content adjustable personal identification devices. The information control device automatically selects at least one content specification for transmission to any portable, content adjustable personal identification devices moving either into or out of a particular area delimited by a boundary secured by the information control device. The information control device then transmits the selected content specification for detection by portable, content adjustable personal identification devices, wherein the content specification directs display of identification content on each of the portable, content adjustable personal identification devices.

Abstract: Latches in a net of a simulated integrated circuit design are initialized to known logical states prior to application of a reset signal at the beginning of the simulation. The logical states may be set by generating a list of the latches, sorting them in random order, and then dividing them into two groups based on the random order with high and low logical states respectively assigned to the two groups. In a specific implementation the latch states are set using an HDL force command prior to applying the reset signal, and the force command is removed after applying the reset signal using an HDL release command. If the circuit description is a gate-level netlist, then logical states of gates within the storage elements are also set.

Abstract: An interface alignment pattern for de-skewing data bits received on an elastic interface is disclosed. The interface alignment pattern is “busy” in that it has a high number of logic state transitions. The busy interface alignment pattern can be used for scrambling and unscrambling operational data. The interface alignment pattern has a unique timing sequence for determining the location of a data bit's first data beat.

Abstract: A computer implemented method, apparatus, and computer usable program code for managing tab indexes. A Web page is displayed, wherein the Web page includes a plurality of tab indexes for a plurality of components in the Web page. User input is received for setting a position for a tab index within the plurality of tab indexes for a component within the plurality of components in the Web page relative to positions of tab indexes for other components within the plurality of tab indexes in the Web page to form a desired position for the tab index. The desired position is stored for the tab index for the component to form stored tab index information. Subsequent visits to the Web page result in the tab index for the component being in the desired position using the stored tab index information.

Abstract: A data processing system employing identify indicators associated with various components of the system. The indicator may be activated whenever a corresponding component requires maintenance, field testing, installation, replacement, and the like. The user may specify global and local conditions under which an activated identify indicator is reset. After the indicator is activated, the system monitors for the satisfaction of one of the conditions. When one of the conditions is satisfied, the system deactivates the indicator automatically. The global conditions apply across logical partitions in a logically partitioned system thereby reducing the occurrence of stale identify indicators on all partitions.

Abstract: A second independent computer system is docked into a first computer system. Then, the first computer system uses at least one of an input interface and an output interface of the second independent computer system as a peripheral device for interfacing with the first computer system. While the second independent computer system is undocked from the first computer system at least one of the input interface and the output interface of the second independent computer system are peripheral devices for interfacing solely with the second independent computer system.

Abstract: A method, system and program for notifying users when messaging sessions are recorded are provided. In response to receiving a request to record a messaging session, a requested selection of multiple message entries associated with the messaging session are recorded. Then, multiple users participating in the messaging session are notified of the recording of the requested selection of the multiple message entries from the messaging session. In particular, the output of the messaging session is adjusted for each of the multiple users to distinguish a selection from among the multiple message entries being recorded.

Abstract: A method, system and apparatus for delivering an alternate Web page to a browser are provided. The method, system and apparatus include the implementation of indicating Web pages that are not authorized to be displayed by the browser using content filter settings, comparing the content filter settings to content labels incorporated in a requested Web page and delivering an alternate Web page, if there is a match. The filter settings are generated by the browser and sent to a server in a request message. The browser also incorporates a semaphore in the request message. The semaphore is used to indicate whether the comparison should be undertaken. Thus, if the semaphore is absent in the request message, the requested Web page is delivered to the browser as customary.

Abstract: A system and method that optimizes reduce operations by consolidating the operation into a limited number of participating processes and then distributing the results back to all processes to optimize large message global reduce operations on non power-of-two processes. The method divides a group of processes into subgroups, performs paired exchange and local reduce operations at some of the processes to obtain half vectors of partial reduce results, consolidates partial reduce results into a set of regaining processes, performs successive recursive halving and recursive doubling at a set of remaining processes until each process in the set of remaining process has a half vector of the complete result, and provides a full complete result at every process.

Abstract: Secure password entry is facilitated by displaying a password prompt comprising a changing stream of random characters, where a particular character within the stream of random characters is displayed at a visibly detectable higher frequency. A user selects a password character by entering input to increment or decrement the particular high frequency character to reach the password character, such that any unauthorized keystroke logging to detect said password is ineffective. Once the user reaches the password character, the user provides another input indicating a selection of the current high frequency character as the password character. Once the user has selected all the characters of the password, the user enters an input indicating the password is complete and the password entry controller then passes the password to the calling layer.

Abstract: A method, system, and program for telephony based remote location monitoring are provided. A telephone network receives the caller request to listen only to a remote location telephony device. The telephone network allocates a listen only channel between the caller telephony device and the remote location telephony device. The telephone network activates a microphone at the remote location telephony device via the listen only channel. Then, audio detected at the microphone is streamed via the listen only channel to the caller telephony device, such that the telephone network enables a caller to monitor a remote location through the remote location telephony device with minimized allocation of telephone network resources.

Abstract: A pulsewidth modulation circuit uses a plurality of programmable paths to connect its output line to ground connections. The paths have different numbers of serially-connected NFETs to provide different pulldown rates. A desired programmable paths is selected based on encoded control signals, with decode logic integrated into the programmable paths. The decode logic includes, for each path, at least two transistors controlled by one of the encoded signals or their complements. A default path to ground may also be provided for use when none of the programmable paths is selected. For example, two encoded signals may be used to select 1-in-4 among the default path and three programmable paths. Integration of the decode logic into the programmable paths results in smaller overall circuit area, leading to reduced power usage, while still retaining the orthogonal benefit of encoded control signals.

Abstract: A user alias for concealing a user's user identification is provided. When signing-on, the user inputs a user alias to a log-in shell. The log-in shell verifies the validity of the user alias. The log-in shell then obtains a user identification associated with the valid user alias.

Abstract: A computer implemented method, apparatus, and computer program product for obtaining an absolute path name for an open file system object. A file descriptor for the open file system object is identified in response to a process in a first software partition opening a file system object to form the open file system object. The absolute path name for the open file system object is cached in a path name field in a file structure associated with the file descriptor for the open file system object. The absolute path name for the open file system object in the path name field is used during migration of the first software partition to restore the open file system object in a second software partition.

Abstract: A method and system for decompressing a compressed file is disclosed in this invention, the method comprising: reading a compressed data block from the compressed file; decompressing the compressed data block; outputting the decompressed data for storage into a decompressed file; deleting the compressed data block that was decompressed from the compressed file. The proposed method and system in this invention can reduce the unnecessary repeated data between compressed data and decompressed data. The storage space requirement will be reduced during decompression, and the existing compression/decompression algorithms need not be changed by using this invention. Thus, this invention is easy to be integrated into existing compression/decompression tools.

Abstract: A computer implemented method, data processing system, and computer program product for enabling network statistics to be collected per software partition. When an incoming data packet is received at the Internet Protocol (IP) layer of an operating system, the IP address in the incoming data packet is identified. The IP address in the incoming data packet is then compared against IP addresses stored in a hash table, wherein the hash table maps each IP address in the hash table to a software partition of the operating system. If an IP address in the hash table matches the IP address in the data packet, the software partition mapped to the located IP address in the hash table is identified. Network statistics collected for the incoming data packet are then associated with the software partition.

Abstract: A method is provided for prioritizing jobs in a computing environment having a plurality of nodes sharing one or more resources. Such method includes, given a job A to be scheduled having certain resource requirements, generating a list P of already scheduled jobs which utilize resources required by job A and which can be preempted by job A. For each resource requirement of job A, an ordered list of jobs which can be preempted by job A is created which is ranked by the applicability of each job in the list relative to resource requirements of job A, so as to provide a plurality of ordered lists, one for each resource requirement. An ordered list L is generated by selecting one of the ordered lists, adding the top-ranked job from that ordered list to list L, then adding the top-ranked job from another one of the ordered lists to list L and so on, by repetitively selecting the top-ranked job from individual ones of all the ordered lists.