Abstract: An assistive reading device for visually impaired users comprises a sheet-like member containing a photo-active material. The sheet-like member responds to light patterns representing data from a patterned light source to form tactile shapes on its surface. The visually impaired user obtains information by touching the tactile shapes. Preferably, the photo-active material is a layer of cross linked azobenzene liquid-crystalline polymers. The assistive reading device preferably is an output device for a computer.

Abstract: Disclosed are an apparatus, method, and program product which each provide an enhanced database engine. Access to precise values is provided while permitting unfettered access to those who are not interested in precise values. This is accomplished via an enhanced database index and indexing method. The entries of the database index are normalized to exclude precision. Individuals interested in precision can then specify precision as part of their query through use of a PRECISE keyword. Results are then filtered to account for the specified precision.

Abstract: Methods, systems, and computer program products for dynamically adjusting computer resources, as appropriate, in response to predictions of query runtimes as well as for rendering costs of the computer resources actually utilized, which costs are consistent with consumer demands.

Abstract: A dispatcher for a non-uniform memory access computer system dispatches threads from a common ready queue not associated with any CPU, but favors the dispatching of a thread to a CPU having a shorter memory access time. Preferably, the system comprises multiple discrete nodes, each having a local memory and one or more CPUs. System main memory is a distributed memory comprising the union of the local memories. A respective preferred CPU and preferred node may be associated with each thread. When a CPU becomes available, the dispatcher gives at least some relative priority to a thread having a preferred CPU in the same node as the available CPU over a thread having a preferred CPU in a different node. This preference is relative, and does not prevent the dispatch from overriding the preference to avoid starvation or other problems.

Abstract: A redundancy manager manages commands to peripheral devices in a computer system. These peripheral devices have multiple pathways connecting it to the computer system. The redundancy manager determines the number of independent pathways connected to the peripheral device, presents only one logical device to the operating system and any device driver and any other command or device processing logic in the command path before the redundancy manager. For each incoming command, the redundancy manager determines which pathways are properly functioning and selects the best pathway for the command based at least partly upon a penalty model where a path may be temporarily penalized by not including the pathway in the path selection process for a predetermined time. The redundancy manager further reroutes the command to an alternate path and resets the device for an alternate path that is not penalized or has otherwise failed.

Abstract: Disclosed is an apparatus, method, service product, and program product which each provide an enhanced, registration-based event handler mechanism. Listener programs are located and compiled before notification is needed. When notification is ultimately required, the pre-located listeners can be called directly without incurring the performance expense associated with first locating and then calling each listener.

Abstract: A computer program is traced by associating a trigger with at least one code location, and upon encountering the trigger during execution, selectively enabling trace data collection data at subsequent traceable events. Preferably, collection of trace data is enabled only for procedure instances active (i.e., currently executing or on the call stack) at the time that the trigger is encountered. Preferably, a special environmental flag is set on encountering the trigger, saved in each current stack frame, reset on calling any new procedure, and restored from the stack on return from a procedure. Collection of trace data on a traceable event (such as an explicit trace statement in the code) is conditioned on the state of the special environmental flag.

Abstract: A communications architecture utilizes modules arranged in a daisy-chain, each module supporting multiple input and output ports. Point-to-point links are arranged so that a first output link of each of multiple modules connects to the next module in the chain, and a second output link connects to a module after it, and inputs arranged similarly, so that any single module can be by-passed in the event of malfunction. Multiple chains may be cross-linked and/or serviced by hubs or chains of hubs. Preferably, the redundant links are used in a non-degraded operating mode to provide higher bandwidth and/or reduced latency of communication. The exemplary embodiment is a memory subsystem in which the modules are buffered memory chips.

Abstract: A compiler has the capability to selectively compile individual portions of a compilable code module for optimum execution performance or for serviceability. In one aspect, individual portions, such as procedures (being less than the entire module) are selectively optimized. In another aspect, debug activity data is used for determining whether or not to optimize compiled code. It is optionally possible to support one or more levels of partial selective optimization.

Abstract: A query engine (or optimizer) which supports database queries having user-defined functions maintains historical execution data with respect to each of multiple user-defined functions. The historical execution data is dynamically updated based on query execution performance. When executing a query having user-defined functions, the query engine uses the historical execution data to predict an optimal evaluation ordering for the query conditions and, preferably, to dynamically adjust the evaluation order when appropriate. Preferably, the historical execution data includes historical execution time of the user-defined function and proportion of evaluated records which satisfied the query parameters.

Abstract: A conditional breakpoint for debugging computer programming code includes a condition identifying of one or more expected code paths used to reach the breakpoint. The breakpoint is triggered if it is reached during execution using an unexpected code path. Preferably, an expected code path is identified by specifying the expected preceding breakpoint, by specifying basic code blocks which should or should not be encountered before the breakpoint, or some combination thereof. The expected code path condition may be used alone or in conjunction with any conventional breakpoint condition.

Abstract: The present invention relates to the field of systems management on IT-resources using web services. An improved method proposes a single web service implementation which dynamically and automatically generates multiple WSDLs for respective multiple resource type classes. This implementation is model-agnostic, as it doesn't require any knowledge about the underlying model, be that a resource model, or any other model in question, and uses introspection of the applied model at the time of invocation for the dynamic WSDL generation. The state of the resource is maintained within the instrumentation of the resource. No additional persistence on top needs to be implemented. A single implementation of a low number of generic web services, basically only two, reduces implementation and maintenance efforts significantly.

Abstract: A redundancy manager manages commands to peripheral devices in a computer system. These peripheral devices have multiple pathways connecting it to the computer system. The redundancy manager determines the number of independent pathways connected to the peripheral device, presents only one logical device to the operating system and any device driver and any other command or device processing logic in the command path before the redundancy manager. For each incoming command, the redundancy manager determines which pathways are properly functioning and selects the best pathway for the command based at least partly upon a penalty model where a path may be temporarily penalized by not including the pathway in the path selection process for a predetermined time. The redundancy manager further reroutes the command to an alternate path and resets the device for an alternate path that is not penalized or has otherwise failed.

Abstract: A compiler (or interpreter) detects source language instructions performing arithmetic operations using a fixed point format (preferably packed decimal). Where the operation can be performed without loss of precision or violation of other constraints of the source language, the compiler automatically converts the operands to a floating point format (preferably Decimal Floating Point (DFP)) having hardware support, and re-converts results to the original fixed point format. Preferably, the compiler may combine multiple operations and instructions in an expression tree, analyze the tree, and selectively convert where possible. The compiler preferably performs a heuristic cost judgment in determining whether to use a particular conversion.

Abstract: A mirrored storage system for applications is provided, which enables and supports the variation and dynamic adaptation of the Recovery Point Objectives (RPO) based on policies. Furthermore, methods are provided for running such a mirrored storage system. Said mirrored storage system comprises a first storage system and at least one further storage system, wherein said first and said further storage system are connected via at least one mirror link. An application accesses said mirrored storage system via a network. Therewith, the data to be stored as response to a write command of said application can be mirrored according to a configurable time-varying RPO requirement of the application transmitting the corresponding write command.

Abstract: A query facility for database queries saves and re-uses query execution strategies, and automatically detects that a strategy should be re-optimized as a result of changes to an indexed variable value. Preferably, the number of records evaluated and selected by the index value condition is dynamically monitored during execution, and an alternative query strategy is initiated when this number appears to be out of proportion to expectations. In an exemplary embodiment, an indexed search strategy is changed to a table scan strategy (or vice versa) as a result of a change to the number of records eliminated by the indexed value, although other examples are possible. Preferably, the query engine initiates an alternative search strategy and concurrently continues to execute the original search strategy as separate threads. Search results are obtained from whichever thread completes first.

Abstract: A development environment tracks code sections which have been copied and pasted into a code module from a source code section which has not been subjected to certain verifications. In one aspect, if an error in a copied section is later found during a verification process, the programmer is allowed to perform a multi-edit operation, whereby an edited change to a single copy is automatically propagated to multiple copies. In another aspect, the programmer is warned when copying and pasting a code section which has not been verified. Preferably, verification is performed in the process of compiling source into executable object code.

Abstract: A query engine (or optimizer) which supports database queries having user-defined functions maintains historical execution data with respect to each of multiple user-defined functions. The historical execution data is dynamically updated based on query execution performance. When executing a query having user-defined functions, the query engine uses the historical execution data to predict an optimal evaluation ordering for the query conditions and, preferably, to dynamically adjust the evaluation order when appropriate. Preferably, the historical execution data includes historical execution time of the user-defined function and proportion of evaluated records which satisfied the query parameters.

Abstract: Provided is a method of remotely maintaining a computer system connected to a first private network of a first organization from a maintenance computer connected to a second private network of a second organization. The first and second private networks are connected to a public network and protected from the public network by respective first and second external firewalls. The first private network is separated from the computer system using a separation firewall configured to block network traffic that initiates at the computer system and is directed to the first private network. An isolation pipe is established that extends from the separation firewall over the first private network to the first external firewall, using virtual-private-network technology. A request to log into the computer system is transmitted from the maintenance computer through the isolation pipe to the computer system.

Abstract: A design structure is provided for a dual-mode memory chip supporting a first operation mode in which received data access commands contain chip select data to identify the chip addressed by the command, and control logic in the memory chip determines whether the command is addressed to the chip, and a second operation mode in which the received data access command addresses a set of multiple chips. Preferably, the first mode supports a daisy-chained configuration of memory chips. Preferably the second mode supports a hierarchical interleaved memory subsystem, in which each addressable set of chips is configured as a tree, command and write data being propagated down the tree, the number of chips increasing at each succeeding level of the tree.