Abstract: A software product and methods determine a field coverage method for a nonholonomic robot to process a field using parallel lanes. A cellular decomposition algorithm divides the field into a plurality of cells, each having a plurality of parallel lanes. Permutations of lane processing orders are determined for each cell, based upon a minimum turning radius of the robot. A cell graph is generated to determine a shortest path for single-time processing each lane in each cell without violating the minimum turning radius of the robot. A step list defining movement of the nonholonomic robot along each lane in each cell of the shortest path through the cell graph is generated, and transits between the lanes, and laps around the field and any obstacles are added. A path program to control the nonholonomic robot to process the field is generated based upon the step list.

Abstract: A software product and methods determine a field coverage method for a nonholonomic robot to process a field using parallel lanes. A cellular decomposition algorithm divides the field into a plurality of cells, each having a plurality of parallel lanes. Permutations of lane processing orders are determined for each cell, based upon a minimum turning radius of the robot. A cell graph is generated to determine a shortest path for single-time processing each lane in each cell without violating the minimum turning radius of the robot. A step list defining movement of the nonholonomic robot along each lane in each cell of the shortest path through the cell graph is generated, and transits between the lanes, and laps around the field and any obstacles are added. A path program to control the nonholonomic robot to process the field is generated based upon the step list.

Abstract: A software product and methods determine a field coverage method for a nonholonomic robot to process a field using parallel lanes. A cellular decomposition algorithm divides the field into a plurality of cells, each having a plurality of parallel lanes. Permutations of lane processing orders are determined for each cell, based upon a minimum turning radius of the robot. A cell graph is generated to determine a shortest path for single-time processing each lane in each cell without violating the minimum turning radius of the robot. A step list defining movement of the nonholonomic robot along each lane in each cell of the shortest path through the cell graph is generated, and transits between the lanes, and laps around the field and any obstacles are added. A path program to control the nonholonomic robot to process the field is generated based upon the step list.

Abstract: Techniques and systems are provided for capturing relationships between items in “bonds”, and using the bonds to facilitate searches against the items. It is described how bonds that reflect relationships between searchable items are stored. The degree of separation between any two given searchable items is based on the minimum number of bonds that have to be traversed to arrive at one of the two searchable items when starting at the other of the two searchable items. The bonds are used to respond to a search request, performing a search relative to a designated searchable item. For example, the search mechanism may search only those searchable items that are within a particular degree of separation of the designated searchable item. As another example, the search mechanism may determine the order in which searchable items are compared against search criteria of the search request based on the degree of separation of the searchable items from the designated searchable item.

Abstract: A federated authentication service technology (10) for authenticating a subject (20) residing in a subject domain (12) on a network to a server application (38) residing in a server domain (18), wherein an authentication mechanism (32) residing in an authentication domain (16) affects the service provided by the server application (38). A client (22), which may be integrated non-human instances of the subject (20), authenticates the subject (20) and a protocol proxy (34) mediates with the authentication mechanism (32) to obtain a name assertion which the client can use to access the server application (38). When multiple authentication mechanisms (32) are available, an optional agent (24), mechanism resolution process (26) and mechanism repository (28), all residing in an agent domain (14), may be used to resolve to one suitable authentication mechanism (32).

Abstract: A system (50, 150) for assisting a user (14) to determine whether an email (18) comes from a purported originator (16). A computerized system having a display unit is provided. Logic (54) in the computerized system determines whether the email (18) includes an authenticity mark (52) including an originator identifier (102) and encrypted data (104). Logic (54) in the computerized system then decrypts the encrypted data (104) into decrypted data (108-14), based on the originator identifier (102). Logic (54) in the computerized system then presents to the user (14), on the display, whether the email (18) includes the authenticity mark (52), whether the encrypted data (104) decrypts successfully, and information based on the authenticity mark (52) and the decrypted data (108-14).

Abstract: A system (50, 150) for assisting a user (14) to determine whether a hyperlink (152) to a target uniform resource locator (URL) is spoofed. A computerized system having a display unit is provided and logic (158) therein listens for activation of the hyperlink (152) in a message (154). The logic (158) extracts an originator identifier (102) and encrypted data from the hyperlink (152), and decrypts the encrypted data into decrypted data based on the originator identifier (102). The logic (158) determines whether the hyperlink (152) includes the originator identifier (102) and the encrypted data decrypts successfully. Responsive to this it then presents a confirmation of authentication conveying the name of the owner and the domain name of the target URL on the display unit, and it redirects the user (14) to the target URL. Otherwise, it presents a warning dialog to the user (14) on the display unit.