Abstract: Techniques are provided for automatically creating style sheet animations including keyframe information. In some embodiments, a style sheet animation creation tool with a timeline-based interface is provided. By interacting with the user-interface, the user can select a point on a timeline for an animation object to add a keyframe to an animation of the animation object. In response to the user's selection of the keyframe time point, the style sheet animation creation tool displays an interactive keyframe indicator on the timeline to indicate the selected time point. With the style sheet animation creation tool, a user can generate a style sheet animation without having to author style sheet language text statements by hand.

Abstract: A print driver is configured to store, retrieve and re-print processed print data that has been generated by the print driver. Processed print data may be stored locally or remotely and may be stored in a secure manner. The print driver may also be configured to save user settings data that indicates one or more user settings used by the print driver to process the print data and generate the processed print data. The print driver also allows processed print data to be retrieved and re-transmitted to printing devices. The print driver generates a graphical user interface that allows users to store, retrieve and print processed print data.

Abstract: A system includes a control source that is provided on a server and control logic that executes on a terminal. The control logic executes on a terminal to (i) identify a plurality of attributes on the terminal, the attributes including an identifier for each of a plurality of terminal assets that include one or more of a hardware fixture, firmware, or operating system; and (ii) generate signature data from the plurality of attributes. The control source is configured to make a determination from the signature data as to whether the terminal is known or unknown.

Abstract: Constraints that restrict how corresponding identifiable groups of files are stored in a database, are enforced on corresponding file data. In response to a query on any data from an identifiable group of files, the effect of the constraint on how the corresponding data is stored is determined. The original query is rewritten, based on the effect of the constraint, so that the rewritten query is directed to a particular subset of the data stored in the database. Consequently, the search space is restricted to an identifiable subset of the database and execution of the rewritten query is more efficient than execution of the original query.

Abstract: Approaches described herein may be used for provisioning of databases that requires a bulk transfer of data within a distributed computing environment, such as a grid. The approaches do not require the manual intervention of a DBA to, for example, transfer a tablespace between the file systems of operating systems. Instead, the tablespaces may be provisioned automatically and dynamically by a grid computing system whenever it determines the need to dynamically provision a database. In addition, as copies of tablespaces are provisioned, synchronization mechanisms can also be automatically provisioned to keep the tablespaces and their copies in sync.

Abstract: A modular repository is described, where operational features may be implemented without the need to scan every resource included in the modular repository. A modular repository includes a dedicated set of database objects containing all information needed to access the resources in the repository. For example, the database objects of a modular repository may include those user identifier mappings and ACL mappings, etc., to which metadata in the modular repository refers. A database system may also include a mechanism through which a modular repository may be mounted under a subdirectory of a common directory in the database system. The resources of a modular repository that are mounted under the common directory may be accessed through the common directory. Further, a client may query the resources of any modular repository mounted under the common directory by making the federated repository, represented by the common directory, the context of the query.

Abstract: An apparatus for offloading network, block and file functions from an operating system comprises a network interface coupled to a network for receiving packet flows; one or more processors each having one or more processor cores; a computer-readable medium carrying one or more operating systems and an input/output networking stack which are hosted in one or more of the processor cores. The networking stack is shared among the operating systems. The networking stack comprises instructions which when executed cause receiving a request for data transfer from one of the operating systems at internal network, block and file system interfaces, and permitting data to be transferred between the internal interfaces and a plurality of external interfaces by preventing the operating systems from performing the data transfer and performing the data transfer on behalf of the operating systems.

Abstract: Techniques for statistically estimating a rating or other “figure of merit” for a user are disclosed. According to one such technique, a first quantity of submissions that were submitted by a user is determined. A second quantity of submissions that (a) were submitted by the user and (b) obtained a particular rating from a rating mechanism also is determined. A user rating for the user is determined based at least in part on the first quantity, the second quantity, and a factor that is independent of both the first quantity and the second quantity—such as the probability that an answer submitted by any answerer in a population will obtain the particular rating from the rating mechanism. The influence that the second quantity has on the user rating relative to the influence that the factor has on the user rating may depend at least in part on the first quantity.

Abstract: An image enhancement circuit (26, 60, 190, 260) includes an input interface (64, 262), which is operative to accept a stream of input pixel values belonging to pixels (32) of an input image. The input image includes a plurality of different input sub-images including respective subsets of the pixels, such that the input pixel values of the pixels in the different input sub-images are interleaved in the stream. A plurality of filter cells (92, 144, 206, 222, 238, 364) are connected in a two-dimensional array configuration and are arranged to separately filter the input pixel values of each of the input sub-images with respective two-dimensional deconvolution kernels so as produce respective output sub-images that include output pixel values. A multiplexer (88, 332) is coupled to multiplex together the output pixel values of the output sub-images so as to produce a filtered output image.

Abstract: A checkpointing approach enables BGP peers to reduce the number of UPDATE messages that are exchanged and processed after a router restarts and to pause and suspend BGP sessions when mobile nodes leave a BGP domain. In an embodiment, a router is configured for receiving a BGP pause message from a mobile node; suspending interaction with the mobile node using BGP, including suspension of expiration of BGP sessions for lack of keepalive messages; receiving a BGP resume message from the mobile node, wherein the resume message comprises a checkpoint marker that identifies a last route update that the mobile node received before the suspending; resuming interaction with the mobile node using BGP; and determining and sending to the mobile node all BGP routes that originated after the checkpoint marker.

Abstract: Techniques for implementing a scalable DOM and a pluggable DOM are provided. A scalable DOM implementation manages a DOM tree in memory to free unreferenced nodes, avoid generating nodes unnecessarily, and avoid storing multiple versions of the same data on disk. A pluggable DOM implementation includes an abstract interface that is defined between the API layer and the data layer of a DOM implementation. An implementation of the abstract interface is defined for each data source that is plugged in to the pluggable DOM implementation and that stores XML data in a different format.

Abstract: A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

Abstract: An envelope for conveying an item from a sender to a recipient and back with a window and unique identifying indicia. The envelope comprises a base panel with a window, a sender address panel, and a recipient address panel. The sender address panel is affixed to the base panel by an adhesive region, which defines a pocket sized to accept an item. The adhesive region extends laterally on the base panel to ensure that a postal cancellation is not applied to an area overlying the item. The recipient address panel is joined to the base panel by a detachable joint. A fragile item may be conveyed from the sender to the recipient and back without damage to the item. The base panel includes indicia that uniquely identify the envelope among a plurality of envelopes. Reading the indicia assists in resolving inventory problems, for example, when unknown items are returned.

Abstract: Techniques for secure communication in a tunnel-less VPN are provided. A key server generates and provides, to each VPN gateway, different, yet mathematically-related keying material. A VPN gateway receives distinct keying material for each designated address block (e.g., subnet) behind the VPN gateway. In response to receiving a packet from one a source host whose address falls within one of the designated address blocks, the VPN gateway identifies the appropriate keying material. The VPN gateway determines an identifier for the address block that includes the destination address. The identifier and the identified keying material are used to generate a key. The VPN gateway encrypts the packet with the key and forwards the encrypted packet to the destination host.

Abstract: A method of and device for enabling the requisitioning of items over a network. The network is coupled to a server, thereby allowing communication between the server and a generating-user, a requisitioning-user and an initiating-user. The server generates a requisition template in response to input received from the generating-user. The server sends an initial e-mail message to the requisitioning-user's e-mail address in response to direction received from the initiating-user. The initial e-mail message includes the requisition template. The initial e-mail message is configured to result in the creation of a reply e-mail message in response to the requisitioning-user selecting to reply to the initial e-mail message from the e-mail application that is accessing the initial e-mail message, the reply e-mail message including the requisition template.

Abstract: A method and apparatus for self-monitoring to identify an occurrence of a threshold and rebooting in response to the occurrence of the threshold is provided. In an embodiment, a data processing apparatus comprises one or more processors; logic coupled to the one or more processors and comprising one or more stored sequences of instructions which, when executed by one or more processors, cause the one or more processors to obtain a threshold associated with the apparatus; self-monitor the apparatus to identify an occurrence of the threshold; and self-reboot the apparatus responsive to the occurrence of the threshold.

Abstract: The present invention generally relates to computer software, and more specifically, to a computerized utility for analysis of optimized program files. A method and apparatus for optimized program analysis is disclosed.

Abstract: Generating a binding between a source address and one or more roles of a user accessing the network and distributing the binding to a filter node. The source address is currently assigned to the device. The binding may be generated by one or more nodes on an ingress path used during authentication of the user. The binding may be distributed to the filter node on demand or without any request from the filter node. Responsive to a determination that the user is associated with a new source address, a new binding is generated to associate a new source address with the one or more roles for the user. The new binding is distributed to the filter node. Another aspect is a method of enforcing a role based security policy at a filter node, using bindings of source addresses to roles.

Abstract: A network device is allowed to transmit only authentication protocol traffic and no other traffic on an interface that is coupled to a port using port-based authentication until after authentication succeeds. If the network device is using a switch port that does not have authentication enabled, or if an authentication protocol client in the network device is disabled, then the device bypasses a delay and test process, which is otherwise used to allow the authentication to succeed before other packets are sent from the device.

Abstract: A method and apparatus are provided for determining that problems have occurred within a complex multi-host system and for identifying for each problem, sequences of causes and effects called a fault cause path, starting with a root cause. A probabilistic model representing the cause/effect relationships among potential system problems identifies the probability that a problem occurred in the system. Such failure probabilities may be determined based on aggregating, over a recent time interval, probability of failure values determined by the probabilistic model. Each fault cause path may have an associated probability of accuracy value reflecting the expected accuracy of the fault cause path relative to other fault cause paths. When more than one fault cause path is identified, the number and order of the fault cause paths may be ranked and displayed based on their probability of accuracy value.