Abstract: A robotic garden tool includes at least one sensor configured to generate signals associated with an object within an operating area. A first electronic processor of the robotic garden tool receives, from the at least one sensor, an obstacle signal associated with an obstacle located within the operating area. The first electronic processor determines a first location of the robotic garden tool at a time corresponding to when the first electronic processor received the obstacle signal. The first electronic processor determines a second location of the obstacle based on the obstacle signal and the first location of the garden tool. The first electronic processor generates mapping information of the operating area that includes a virtual boundary based on the second location of the obstacle. The first electronic processor controls the robotic garden tool in the operating area to remain outside of the virtual boundary based on the mapping information.

Abstract: When picking a die from an adhesive tape, a collet of a pick arm is positioned at a distance over the die, the die being mounted on a first surface of the adhesive tape. A flow of air is then generated onto a second surface of the adhesive surface opposite to the first surface for blowing the adhesive tape to displace the die towards a die-holding surface of the collet. Thereafter, the die is retained on the die-holding surface of the collet while the adhesive tape separates from the die.

Abstract: When picking a die from an adhesive tape, a collet of a pick arm is positioned at a distance over the die, the die being mounted on a first surface of the adhesive tape. A flow of air is then generated onto a second surface of the adhesive surface opposite to the first surface for blowing the adhesive tape to displace the die towards a die-holding surface of the collet. Thereafter, the die is retained on the die-holding surface of the collet while the adhesive tape separates from the die.

Abstract: A method and system for facilitating an undo operation. In one embodiment, the method includes generating a plurality of control files, where each of the control files is associated with a batch of data that is received from a sending partition during a redistribution process, and where each control file includes a list of pages and corresponding ranges of rows of data that have been appended to the pages. The method also includes writing the control files to a persistent memory for each control file where all of the associated rows of the respective consistency point have been appended to pages and written to a persistent memory. The method also includes, in response to an interruption in the redistribution process, identifying pages and rows to be deleted during an undo operation based on the plurality of control files.

Abstract: Consumer devices for providing feedback based upon the presence of a liquid in a detection zone, wherein the detection zone is the area in which a change in capacitance is can be detected by a non-contact capacitance sensor and the forms of feedback include the generation of sound, activation/deactivation of alight, a motion or other physical interaction, or display by way of an LCD or LED display panel.

Abstract: Consumer devices for providing feedback based upon the presence of a liquid in a detection zone, wherein the detection zone is the area in which a change in capacitance is can be detected by a non-contact capacitance sensor and the forms of feedback include the generation of sound, activation/deactivation of alight, a motion or other physical interaction, or display by way of an LCD or LED display panel.

Abstract: A method and system for facilitating an undo operation. In one embodiment, the method includes generating a plurality of control files, where each of the control files is associated with a batch of data that is received from a sending partition during a redistribution process, and where each control file includes a list of pages and corresponding ranges of rows of data that have been appended to the pages. The method also includes writing the control files to a persistent memory for each control file where all of the associated rows of the respective consistency point have been appended to pages and written to a persistent memory. The method also includes, in response to an interruption in the redistribution process, identifying pages and rows to be deleted during an undo operation based on the plurality of control files.

Abstract: A roofing element such as a concrete tile is provided that includes a body portion extending between a head end and a nose end. The body portion includes a lower surface, an upper surface, and a protrusion that is disposed substantially adjacent the nose end and extends downwardly from the lower surface. The protrusion is disposed on the lower surface such that when a nose end of a second roofing element is installed vertically above a head end of a first roofing element and overlapping by at least 3 inches, the protrusion of the second roofing element is positioned substantially above an aperture defined in the head end of the first roofing element. The protrusion reduces a distance between the aperture of the first roofing element and the nose end of the second roofing element, which increases the likelihood that the adhesive will securely join the first roofing element with the second roofing element.

Abstract: A system and method for synchronously building a Ziv-Lempel dictionary during online insert processing. In one embodiment the invention includes a method for processing information that includes the steps of initiating a process for adding data to a data object including a table and determining if a predetermined condition exists for triggering the creation of a compression dictionary. The compression dictionary is then created if the predetermined condition exists. Once created, the dictionary may then be inserted into the data object.

Abstract: A transactional database server is accessible by applications. Applications indicate whether access is made using an online protocol. Where the database server determines that a request received from an application is made using the online protocol, the server will return one of a set of defined error codes upon identified system resources being determined to be scarce. Applications monitor responses from the database server for the defined error codes. On receipt of one of the defined error codes an application will issue a commit to the database server to attempt to release system resources for use by applications.

Abstract: An apparatus, system, and method are disclosed for efficient adaptive parallel data clustering for loading data into a table by generating a hint-key for each of one or more records in the input data stream, ordering the one or more records in a first-level clustering agent to generate one or more record lists ordered by hint-key. The apparatus, system, and method simultaneously processes one or more record lists in a second-level clustering agent, outputs the one or more records of the one or more record lists clustered by the hint-key of the one or more records, stores, in a partial block cache, a plurality of partial blocks that are output by the second-level clustering agent, and stores, in a partial page cache, a plurality of last partial pages of the partial blocks that have been victimized from the partial block cache.

Abstract: An apparatus, system, and method are disclosed for efficient adaptive parallel data clustering for loading data into a table by generating a hint-key for each of one or more records in the input data stream, ordering the one or more records in a first-level clustering agent to generate one or more record lists ordered by hint-key. The apparatus, system, and method simultaneously processes one or more record lists in a second-level clustering agent, outputs the one or more records of the one or more record lists clustered by the hint-key of the one or more records, stores, in a partial block cache, a plurality of partial blocks that are output by the second-level clustering agent, and stores, in a partial page cache, a plurality of last partial pages of the partial blocks that have been victimized from the partial block cache.

Abstract: The use of a centralized version table allows for efficient object switching. Rather than synchronizing all database agents to recognize a newly created file as containing the most recent version of a given object, database agents requiring access to the given object need only consult the centralized version table to learn file identity information. That is, the database agents consult the centralized version table to determine which of the files associated with a given object contain the most recent version of the given object. Mechanisms associated with the use of the centralized version table also provide for efficient recovery from a failure that has occurred during an object switching transaction.

Abstract: A system and associated method load an input data stream into a multi-dimensional clustering (MDC) table or other structure containing data clustered along one or more dimensions, by assembling blocks of data in a partial block cache in which each partial block is associated with a distinct logical cell. A minimum threshold number of partial blocks may be maintained. Partial blocks may be spilled from the partial block cache to make room for new logical cells. Last partial pages of spilled partial blocks may be stored in a partial page cache to limit I/O if the cell associated with a spilled block is encountered later in the input data stream. Buffers may be reassigned from the partial block cache to the partial page cache if the latter is filled. Parallelism may be employed for efficiency during sorting of input data subsets and during storage of blocks to secondary storage.

Abstract: A method and a system for storing and/or retrieving data which can be implemented using a storage area network. The system includes a client computer having data to store or desiring data to retrieve, a storage server in communication with the client computer and able to read storage-related requests from the client computer, a high-speed network running at least one data communication protocol for communicating between the client computer and the storage server, a storage device, which has data to retrieve and is used to store data, in communication with the storage server, and a storage manager for allocating and authorizing the storage device. Preferably, the data communication protocol includes at least one of the Internet protocols, including Internet Protocol (“IP”), Transmission Control Protocol (“TCP”), and User Datagram Protocol (“UDP”). Preferably, the system also includes a high-speed switch for communicating between the client computer and the storage server.

Abstract: The use of a centralized version table allows for efficient object switching. Rather than synchronizing all database agents to recognize a newly created file as containing the most recent version of a given object, database agents requiring access to the given object need only consult the centralized version table to learn file identity information. That is, the database agents consult the centralized version table to determine which of the files associated with a given object contain the most recent version of the given object. Mechanisms associated with the use of the centralized version table also provide for efficient recovery from a failure that has occurred during an object switching transaction.

Abstract: A system and associated method load an input data stream into a multi-dimensional clustering (MDC) table or other structure containing data clustered along one or more dimensions, by assembling blocks of data in a partial block cache in which each partial block is associated with a distinct logical cell. A minimum threshold number of partial blocks may be maintained. Partial blocks may be spilled from the partial block cache to make room for new logical cells. Last partial pages of spilled partial blocks may be stored in a partial page cache to limit I/O if the cell associated with a spilled block is encountered later in the input data stream. Buffers may be reassigned from the partial block cache to the partial page cache if the latter is filled. Parallelism may be employed for efficiency during sorting of input data subsets and during storage of blocks to secondary storage.