Abstract: Methods and apparatus for simulating risk tolerance and associated adversary costs in a distributed business process are disclosed. The methods and apparatus simulate an interdependent business process, such as a financial transaction system, in a secure distributed manner. Each business entity that is part of the interdependent business process models itself on a local client device at any chosen level of detail. A simulation server connects the separate client based simulations into one large simulation. Details of each local simulation may be hidden from other simulation participants. However, interruptions in business flow caused by simulated disruptions introduced at the simulation server and/or a client device are propagated to all of the effected simulation participants via the simulation server. In addition, the simulation server receives inputs from users indicative of risk tolerance levels and associated response actions.

Abstract: Methods and apparatus for simulating risk tolerance and associated adversary costs in a distributed business process are disclosed. The methods and apparatus simulate an interdependent business process, such as a financial transaction system, in a secure distributed manner. Each business entity that is part of the interdependent business process models itself on a local client device at any chosen level of detail. A simulation server connects the separate client based simulations into one large simulation. Details of each local simulation may be hidden from other simulation participants. However, interruptions in business flow caused by simulated disruptions introduced at the simulation server and/or a client device are propagated to all of the effected simulation participants via the simulation server. In addition, the simulation server receives inputs from users indicative of risk tolerance levels and associated response actions.

Abstract: Methods and apparatus for simulating risk tolerance and associated adversary costs in a distributed business process are disclosed. The methods and apparatus simulate an interdependent business process, such as a financial transaction system, in a secure distributed manner. Each business entity that is part of the interdependent business process models itself on a local client device at any chosen level of detail. A simulation server connects the separate client based simulations into one large simulation. Details of each local simulation may be hidden from other simulation participants. However, interruptions in business flow caused by simulated disruptions introduced at the simulation server and/or a client device are propagated to all of the effected simulation participants via the simulation server. In addition, the simulation server receives inputs from users indicative of risk tolerance levels and associated response actions.

Abstract: A method, database, memory computer readable medium and navigation device are disclosed. In at least one embodiment, the method includes projecting a plurality of known address points onto an address segment vector of a source map database, to create projection points; interpolating locations for addresses of the address points, to create corresponding interpolation points; and segmenting the address segment vector into a plurality of address sub-segment vectors, upon a distance between a projection point and a corresponding interpolation point exceeding a threshold distance.

Abstract: A method, database, memory computer readable medium and navigation device are disclosed. In at least one embodiment, the method includes projecting a plurality of known address points onto an address segment vector of a source map database, to create projection points; interpolating locations for addresses of the address points, to create corresponding interpolation points; and segmenting the address segment vector into a plurality of address sub-segment vectors, upon a distance between a projection point and a corresponding interpolation point exceeding a threshold distance.

Abstract: A method and system for differentiating duplicate yet disjoint localities, such as cities, within a state or other principal geographic unit of interest is for use with electronic maps and databases. Duplicate locality name entries are stored in a database, locality name database entries are condensed for localities having two or more similar names, and adornments for duplicate locality names are stored in the database. In the adornment selection process, for a first duplicate locality, a second duplicate locality is selected that is closest to the first. Selected adornments are first and second significant localities, such as large cities, and are closer to the first and second duplicate localities, respectively, than the first and second duplicate localities are to each other, and are more significant than the first and second duplicate localities. Adornments to duplicate localities are displayed to the user. The process is repeated for remaining duplicate localities.

Abstract: A method and system are presented for differentiating duplicate addresses within a locality. A relational database of geographical features is constructed where each geographical feature has related attributes which can be used to differentiate among multiple same-named features. Precedence hierarchies of such attributes can be created within the database where each precedence hierarchy is constructed based on a combination of user type and situational scenario information. Upon receiving a mapping destination from a user, the system may identify the input as being ambiguous. The user and situation can be analyzed in order to select the precedence hierarchy best fit to resolve the ambiguity in this particular situation. The selected hierarchy can then be traversed until an attribute is found that exists for both features and serves to distinguish between them. The attributes can be presented to the end user along with information regarding the ambiguity.

Abstract: Locality indexes are presented for use with electronic maps and databases. Each geographic feature in a geographic database is associated with locality names from various locality name sources. Context-sensitive tokenizing, normalizing, optimizing and matching of locality names eliminate duplicate and variant locality names, while preserving meaningfully different names. A locality names table includes the parsed representation of each locality name and other associated information, and a primary token for indexing is identified. A main source mask is created by allocating a bit for each locality name source used in the method. A separate source mask is stored for each geographic feature associated with a locality, a bit set for each source in which the locality can be found. Locality names associated with each geographic feature are indexed in a table of geographic features in order of prevalence for use in a given application.

Abstract: A method and system for differentiating duplicate yet disjoint localities, such as cities, within a state or other principal geographic unit of interest is for use with electronic maps and databases. Duplicate locality name entries are stored in a database, locality name database entries are condensed for localities having two or more similar names, and adornments for duplicate locality names are stored in the database. In the adornment selection process, for a first duplicate locality, a second duplicate locality is selected that is closest to the first. Selected adornments are first and second significant localities, such as large cities, and are closer to the first and second duplicate localities, respectively, than the first and second duplicate localities are to each other, and are more significant than the first and second duplicate localities. Adornments to duplicate localities are displayed to the user. The process is repeated for remaining duplicate localities.

Abstract: A user is given location information of a desired place, by providing a map database having an index of street segments, each having one or more street names, zero or more shape points and zero or more address points, the points representing specific positions along a street segment, the address points associated with a house number or address range. A user enters a street address of the desired place into device application software, which returns the location to the user if the desired place is an address point. Otherwise, interpolate the location by finding low and high addresses such as the two closest bracketing addresses from address points, or from one address point and from a street segment end point. The interpolated location will be between the low and high addresses by piece-wise linear interpolation, following the street segment's shape points and is then returned to the user.