Abstract: A system and method for detecting a failure of a first process is disclosed. According to one aspect, a first connection is established between a first process and a second process. A monitoring mechanism monitors the status of the first process to detect whether the first process has failed. In response to determining that the first process has failed, the monitoring mechanism causes an out-of-band message to be sent to the second process.

Abstract: A method and apparatus for converting a single instance computer application to a multiple instance application includes disabling the single instance application and linking the executable files associated with the single instance application to routines in a library that includes routines for use by a multiple instance application. Multiple instance metadata that represents the structure of the multiple instance application is automatically created based on metadata that represents the structure of the single instance application. The data from the single instance application is imported to complete the conversion to a multiple instance application.

Abstract: An approach for implementing policy controls in application programs provides for the execution of code to implement policy constraints in a manner that is generally transparent to application programmers. According to the call redirection approach, routine calls are redirected to a policy broker mechanism. The policy broker mechanism causes one or more policy constraints to be applied and if appropriate, causes the routine targeted by the routine call to be executed. According to the code substitution approach, the code for software application routines for which policy constraints are to be applied is substituted with code that provides for the application of policy controls. The code that performs the original functions may also be maintained, but augmented with additional code to apply policy constraints. Thus, routines normally invoked by application programs, for example, code libraries, do not have to be modified by application programmers to include code to apply policy controls.

Abstract: An extremely compact low cost magnetic induction switch which may be activated by an extremely small operation force (approximately 1 g) has a movable member (2) and a coil spring (3) arranged inside a switch case (1), the spring coil (3) supporting the movable member (2), and the movable member protruding from an opening (1D) of an upper surface portion of the switch case (1). A Hall IC (4) is arranged in a switch case (1). When the upper portion is pushed, a magnet (6) fixed to the movable member (2) moves downward so that an output signal of the Hall IC (4) is changed from OFF to ON.

Abstract: A method and apparatus is disclosed for policy-enabled, contract-based management of network operational support systems. A policy kernel utilizes multiple policy access points for interfacing to dedicated policy management systems. The policy kernel uses policy views, containing a set of required policies, to request the policy view from the policy management system. The policy view initiates a contract for regulating the selection and import of executable policies to the policy kernel. The contract applies running components to the executable policies to enable them to run on the policy kernel and resolves any potential conflicts by applying a set of policy dependency rules to any executable policies that are in variance with one another. The executable policies are imported into the policy kernel through the policy access point. The policy kernel may then implement the requested policy view by executing the executable policies thus imported.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: A method and apparatus for configuring a computer. One embodiment of the invention combines all of the prior art control panels related to networking into a consolidated Network Setup Control Panel. In addition, the invention provides for computer configuration by scripting. The configuration may be for a type of system setting or for network configurations and protocols. Through scripting, a computer may be configured locally or remotely on a network. One embodiment of the invention provides for a centralized database or Configuration Library consisting of collected data relating to available configuration settings. This database is not limited to configuration information and can be used as a general database containing information the user desires to store. To modify a configuration by scripting, the invention provides for a Scripting Interface consisting of a Scripting Server and Scripting Plug-In.

Abstract: Techniques for forming electronic documents include storing a plurality of information types for describing how information is used. Also, a plurality of document types is stored. Each document type includes a unique set of information types. A plurality of units of information is also stored. Each unit of information is associated with an information type. A document is produced based on a particular document type having a particular set of information types, and based on a first set of units of information. Each unit of information of the first set is associated with a corresponding information type in the particular set of information types. This invention allows content to be associated with a particular use, through the information type, so that the content can be incorporated in all documents where such usage is desired. This invention also allows the enterprise to control the method of generating and presenting a particular content or information object based on its use and its temporal data, e.g.

Abstract: Bits are assigned to channels of a discrete modulation communications system. A first set of channels and a second set of channels are selected from a plurality of channels in the communications system. The first and second set of channels are selected in order to re-assign one or more bits from the first set of channels to the second set of channels so as to cause a performance characteristic of one or more channels in the communications system to improve.

Abstract: A method and apparatus for dynamically configuring a unit conversion mechanism is provided. A non-executable data structure defines information, which is accessed to facilitate unit conversion. The information in the non-executable data structure is in the form of elements, which include among other things at least one measurable quantity, such as length or mass, along with a plurality of units, such as feet, meters, millimeters, pounds, and kilograms. Each of the units is associated with a measurable quantity. For example, feet, meters, and millimeters are used in measuring length. Conversion information, which includes an offset and a gain, is associated with each of the units. The plurality of units, along with the conversion information, is used to dynamically configure the unit conversion mechanism at runtime. In so doing, the unit conversion mechanism can convert from one unit to another unit for a measurable quantity.

Abstract: Techniques are provided for implementing and using a hierarchy-based secured document repository. The invention, the repository allows each user access to documents based on the position(s) held by the user in the hierarchy of a company. In one embodiment, the repository includes data that reflects the hierarchy of a company (“hierarchy data”), where the hierarchy includes nodes and relationships between nodes. The repository also includes user-to-node mapping data that maps users to one or more nodes, and document-to-node mapping data that maps documents to nodes. An access mechanism is provided that determines which document a user is able to access based on the hierarchy data, the user-to-node mapping data, and the document-to-node mapping data. In one embodiment, a user is allowed to access only those documents that are (1) mapped to the same node as the user, or (2) mapped to nodes that are below (relative to the hierarchy) any of the nodes to which the user is mapped.

Abstract: An aspect of the invention provides a method for managing information associated with a hierarchical key. A plurality of hash tables are created for a plurality of levels of a hierarchy associated with a hierarchical key, wherein each hash table is associated with a corresponding level of the hierarchy. Entries are stored within each of the plurality of hash tables, wherein the entries are associated with key names that have as many levels as the level associated with the respective hash table. Furthermore, a reference to a descendant entry that is in a respective hash table may be stored within each entry.

Abstract: A system and method for detecting termination of an application, such as a database instance, that uses locks is described. A holding child process is started from a parent process. The holding child process connects to a monitored application instance, acquires an exclusive lock on the monitored application instance and returns a ready signal upon successfully acquiring the exclusive lock. A waiting child process is started from the parent process subsequent to the holding child process. The holding child process connects to the monitored application instance, blocks on the exclusive lock on the monitored application instance and returns a result signal upon at least one of acquiring the exclusive lock and clearing the block on the exclusive lock. The return signal is processed at the parent process. Using locks provides immediate detection that the application has terminated. Methods for blocking against the application are also described.

Abstract: A method and apparatus for determining latency between multiple servers and a client receives requests for content server addresses from local domain names servers (LDNS). POPs that can serve the content are determined and sent latency metric requests. The content server receives the request for latency metrics and looks up the latency metric for the requesting client. Periodic latency probes are sent to the IP addresses in a Latency Management Table. The IP addresses of clients are masked so the latency probes are sent to higher level servers to reduce traffic across the network. The hop count and latency data in the packets sent in response to the latency probes are stored in the Latency Management Table and is used to determine the latency metric from the resident POP to the requesting client before sending the latency metric to the requesting server. The BGP hop count in the Latency Management Table is used for the latency metric upon the first request for an IP address.

Abstract: A method and system for implementing a transportable operating system boot environment on a computer system. The method includes the step of accessing a stored operating system environment coupled to the computer system. An identity object is then accessed, wherein the identity object includes hardware and software configuration information regarding the computer system. The hardware and software configuration information of the identity object is then impressed onto the stored operating system environment to update the stored operating system environment in accordance with the computer system. The computer system is then booted using the updated stored operating system environment. The stored operating system environment can be coupled to the computer system using a removable media. The identity object can be impressed onto the stored operating system environment by using an agent running on the computer system.

Abstract: A process for coupon generation, delivery, and validation over a personal TV service system is disclosed. A client issues electronic coupons to personal TV service customers via a personal TV service center which generates a coupon authentication number for each receiver. The coupon authentication number is known to the key server and the coupon authentication number database. It is also known to the receiver in encrypted form. The product serial number for each receiver acts as a public key, which is known to both the customer and the personal TV service center. A unique offer ID number is assigned to each coupon. When the receiver receives the coupon, it performs a hash operation on the offer ID number using the authentication ID number and takes first or last N digits of the hashed result as the coupon ID number. The customer may redeem the coupon by submitting the offer ID number, the receiver serial number, and the coupon ID number. Before the coupon is redeemed, it must be validated.

Abstract: An object oriented mechanism for dynamically constructing service implementations to enforce restrictions on services provided to an application is disclosed. When an application desires an implementation for a particular service, the application makes a request to a framework. The framework receives the request and, in response, determines what restrictions, if any, need to be imposed on the requested implementation. Once the restrictions are determined, the framework dynamically constructs the requested implementation. The requested implementation is constructed such that it incorporates a general implementation of the service, the restrictions, and enforcement logic for enforcing the restrictions on the general implementation. Once the requested implementation is constructed, it is provided to the application. Thereafter, the application invokes the requested implementation directly for services.

Abstract: A method of automatically establishing differentiated services quality of service treatment for a return packet flow that is associated with an originating packet flow in a network is disclosed. The originating packet flow is received, and it is determined that one or more packets in the originating packet flow are marked with a DSCP value that matches a policy rule that instruct setting of a specified DSCP value to the return packet flow. In response, information identifying the originating packet flow and a second DSCP value for marking the return packet flow is created and stored. When a corresponding return packet flow is received and determined to be associated with the originating packet flow, packets of the return packet flow are automatically marked with the second DSCP value. Once the packet flow terminates, all stored information is removed.

Abstract: Techniques for interacting with a client process on a mobile device connected to a network over a wireless link to navigate an application includes managing information at a mobile application server executing on a platform connected to the network. The information includes first data describing a graphical element for display on the mobile device. The first data also includes a first reference to the graphical element and a second reference to a page associated with requesting a service from a first application. Second data, based on the first data, is sent to the client process for rendering the graphical element on the mobile device. The second data includes the first reference. Third data is received indicating the first reference in response to a user of the mobile device selecting the graphical element. In response to receiving the third data, the page from the first application is requested based on the second reference.

Abstract: Execution of a restartable sub-tree of a query execution plan comprises determining whether use of parallel processes is a preferred or optimal mode of executing the sub-tree. The determination is based, at least in part, on how long it takes to restart the sub-tree using two or more parallel processes and/or how long it takes to probe the sub-tree, i.e., to fetch a row that meets one or more conditions or correlations associated with the sub-query, using the two or more parallel processes. Thus, a dynamic computational cost-based operation is described, which determines at query runtime whether to execute the restartable sub-tree using a single server process or multiple parallel server processes.