Abstract: A lid for a container includes a base and a slidable cover. The base includes a lid track and a drinking aperture. The slidable cover is attached to a top surface of the base. The slidable cover includes a lid guide that engages the lid track, a straw aperture, and a straw cover that removably covers the straw aperture. The slidable cover is movable along the top surface of the base from a closed position, in which the straw aperture overlaps at least a portion of the drinking aperture, to a retracted position, in which at least a portion of the drinking aperture is not covered by the slidable cover.

Abstract: The present invention provides a method, system and computer program product for routing multiple paths through polygonal obstacles. In a preferred embodiment, the method begins by offsetting the initial paths through the obstacles from the obstacles to form adjusted paths. If it is determined that any adjusted path encounters a new intersection, the adjusted path or paths are modified to form revised paths. The vertices of each obstacle are labeled. All the revised and all the adjusted paths are sorted. Then, according to their sorted order, the revised and the adjusted paths are reconstructed to form offset paths.

Abstract: An imaging apparatus is provided comprising a frame having a portion upon which a printhead is adapted to be mounted. The printhead may comprise a housing including a main body, at least one flexible mounting beam extending from the main body, and at least one structural member coupled to the at least one flexible mounting beam. The printhead may also comprise a skew correction mechanism mounted to the printhead housing. The skew correction mechanism may include an adjustment member capable of engaging at least one surface on the printhead housing so as to adjust the position of the printhead housing relative to the frame portion.

Abstract: A method, apparatus, and computer instructions for managing traffic information in a data processing system in a vehicle using peer to peer connections. A traffic situation is identified. A traffic data packet is generated in response to identifying the traffic situation. The traffic data packet includes traffic information and an area of influence. A traffic data packet is transmitted to another vehicle using a peer to peer connection based on a location of the vehicle with respect to the area of influence.

Abstract: The present invention provides a method, system and computer program product for routing multiple paths through polygonal obstacles. In a preferred embodiment, the method begins by offsetting the initial paths through the obstacles from the obstacles to form adjusted paths. If it is determined that any adjusted path encounters a new intersection, the adjusted path or paths are modified to form revised paths. The vertices of each obstacle are labeled. All the revised and all the adjusted paths are sorted. Then, according to their sorted order, the revised and the adjusted paths are reconstructed to form offset paths.

Abstract: A laser scanning unit is provided comprising: a housing; a scanning device; a first pre-scan assembly generating a first light beam and directing the first light beam toward the scanning device; a second pre-scan assembly generating a second light beam and directing the second light beam toward the scanning device; a first post-scan assembly receiving the first light beam reflected from the scanning device and causing a first portion of the first light beam to scan along a first scan path; and a second post-scan assembly receiving the second light beam reflected from the scanning device and causing a first portion of the second light beam to scan along a second scan path. The first post-scan assembly further reflects a second portion of the first light beam in a direction away from the first scan path.

Abstract: A method, computer program product, and a data processing system for determining an edge for inversion in a cyclic compound directed graph. A plurality of graph nodes of a graph are evaluated for generation of a first node order subset pair. A determination that the graph requires a recursive evaluation for completing node ordering of the plurality of graph nodes is made. The graph is divided into a plurality of graph partitions, and respective node order subset pairs are generated for the graph partitions.