Abstract: One embodiment is a method that divides a cluster file system into multiple segments with each segment including one or more local counters. The method then checks for inconsistencies and corrects discovered inconsistencies in each of the local counters while the file system remains online and available for use.

Abstract: Computer-implemented systems and associated operating methods implement a fast join for databases which is adapted for usage with flash storage. A system comprises a processor that performs a join of two tables stored in a storage in pages processed in a column orientation wherein column values for all rows on a page are co-located in mini-pages within the page. The processor reduces input/output operations of the join by accessing only join columns and mini-pages containing join results.

Abstract: A method for power management may include collecting data related to resource utilization and process information from a server. The method may further include using the collected data to generate use and state models respectively based on use and state categories of the server. The method may also include determining a state condition of the server through use of the generated use and state models to manage power utilization of the server.

Abstract: A connection policy for a communications network has a local connection policy indicating which paths between a given one of the nodes (computer A, router A, host 898) and others of the nodes (computers B, C, filters B1, B2, C1, C2, hosts 890, 892) are allowable paths, by a symbolic expression of ranges endpoint addresses and other local connection policies in respect of other nodes. It is implemented in a distributed manner by determining, for the given node, which of the allowable paths, are dual authorized as allowable by the other local connection policy relating to the other node at the other end of that path, by Boolean operations on the symbolic expressions. For a given message for a given path between two of the nodes having their own local connection policies, both of these nodes determine whether the given path is currently dual authorized. This can provide reassurance that changes in versions of the connection policy won't transiently open a risk of undetected unwanted communication.

Abstract: In certain embodiments, a method includes accessing one or more parameters based on an IT service request received from an upper-layer IT interface, the parameters formatted according to an upper-layer IT interface construct. Appropriate IT domains are determined, according to at least a portion of the parameters, from a number of IT domains for implementing IT infrastructure for fulfilling the request, the domains each associated with one or more vendor-specific solutions for providing IT infrastructure of a type associated with the domain. Using a common semantic interrelational data model that includes mappings of constructs for upper-layer IT interfaces to constructs for IT domains, at least a portion of the parameters are translated from the upper-layer IT interface construct into constructs suitable for use by the determined appropriate domains.

Abstract: Techniques for operating a serial attached SCSI (SAS) expander that includes a latency table comprising entries of outbound PHYS with latency values associated with connections between inbound PHYs and outbound PHYs. A storage management module to, in response to receipt of a command from an initiator device associated with an inbound PHY to route data to a target device associated with an outbound PHY, select from the latency table a random outbound PHY from among a plurality of outbound PHYs, wherein the random selection is based on weighted average of latency values of the outbound PHY entries of the latency table.

Abstract: This disclosure is directed to optical-to-electrical receiver and transceiver integrated circuits that can be used to send and receive multiple optical signal data streams using at least one optical bus. In one aspect, a fan-in integrated circuit of a node includes an arbiter/multiplexer, and at least one receiver. Each receiver is electronically connected to the arbiter/multiplexer. Each receiver receives at least one optical signal over an optical broadcast bus and converts the optical signals into a data stream encoded in electronic signals. The arbiter/multiplexer selects one receiver at a time to send an electronic signal to the arbiter/multiplexer and outputs the electronic signal to the node for processing.

Abstract: Embodiments of the present invention disclose a method and system for environmental watermarking. According to one embodiment, a print request is received at a printing device coupled to a processing unit, which evaluates whether an environmental print criteria has been satisfied. The document along with an environmental watermark image is printed on the print media upon determination that at least one environmental print criterion has been satisfied.

Abstract: A press cage may include pairs of opposing wall plates, each of the pairs of wall plates being orthogonal with respect to the other pairs, with corresponding machined indentations located at predetermined locations on broad faces of the wall plates which are adjacent to each other. The press cage may also include coupler assemblies made of coupler parts, each of the parts fixed to machined indentation of the corresponding machined indentations at one of the predetermined locations, the coupler parts locked together.

Abstract: One example of a communication architecture for direct printing and scanning includes a computing device for generating an electronic image and a page description language for producing a deterministic print file of the electronic image, the deterministic print file being natively viewable in a Portable Document File (PDF) viewer. The architecture also includes a printer for receiving the deterministic print file and for beginning printing the electronic image before the complete deterministic print file is received by the printer. A method for printing a document is also provided.

Abstract: A method that includes configuring a queue into a plurality of segments, wherein each segment is associated with a depth factor which defines number of entries of task elements capable of being added in each segment, and wherein each segment is associated with a requirement factor; generating a plurality of task elements, each task element having an importance factor; and if a value of an importance factor of a task element is at least equal to a value of a requirement factor of a segment with an available entry to add the task element, then adding the task element in the entry of the segment.

Abstract: A method is disclosed for controlling distribution and use of a developer application in a network environment. A portal is provided for a developer to submit the developer application for use in the network environment. The developer application is operated for network devices that request use of the developer application. The developer application is operated to generate an output for individual network devices that request use of the developer application. The developer application is prevented from being operated on any of the individual network devices to access a service that is not part of a predetermined set of specified services that are allowed for that developer application.

Abstract: Data values of metrics for a plurality of functional entities are aggregated, the aggregating producing aggregated values for the respective metrics. A set of the aggregated values is produced for the respective metrics. Based on the set of aggregated values, an interactive visualization of the metrics is generated, the interactive visualization including visual indicators based on the aggregated values for the respective metrics across a plurality of time intervals. The interactive visualization is selectable to focus on a portion of the interactive visualization.

Abstract: A charging assembly controls a selectable non-contact distance between a charge roller and an imaging surface.

Abstract: A method of identifying gestural interaction comprises detecting a user with an imaging device, detecting with the imaging device the depth value at the centroid of the user with respect to the imaging device, detecting with the imaging device the closest distance of the user with respect to the imaging device, and, with a processor, identifying the initiation of a gestural interaction based on the ratio of the closest distance and the depth value at the centroid of the user is above a predetermined threshold. A computer program product for identifying initiation and termination of gestural interaction within a gestural interaction system comprises a computer readable storage medium having computer usable program code embodied therewith, the computer usable program code comprising computer usable program code that identifies the initiation of a gestural interaction by a user depending on whether a virtual bubble around the user has been broken.

Abstract: Various configurations of print head die are described. In an example, a first print head die has first print structures disposed along a major dimension thereof perpendicular to the media path, the first print structures including a leading print structure with respect to the media path. A second print head die independent of the first print head die has second print structures disposed along a major dimension thereof perpendicular to the media path, the second print head die being staggered with respect to the first print head die along the media path, the second print structures including a leading print structure with respect to the media path. An extent between respective leading print structures of the first and second print head dies is between a minimum value and a maximum value computed from a function of expected variation in position of the media and maximum allowable dot placement error for the first and second print structures.

Abstract: Techniques are provided for sending request messages to destination nodes. Destination nodes may be indicated as unresolved. Request messages are sent to destination nodes indicated as unresolved.

Abstract: Techniques for retrieving data blocks are provided. In one aspect, a storage fabric address of a controller associated with a data block is retrieved by a node. If the node is on the same storage fabric as the retrieved address, the data block may be retrieved over the storage fabric. In another aspect, a directory server maintains mappings of data blocks to storage fabric addresses of controllers associated with the data blocks. A request for the location of the data block includes the storage fabric address of the associated controller.

Abstract: Disclosed are devices and methods where a distance between nozzle arrays is equal to a substrate advance distance corresponding to at least one complete turn of a rotating drive body.