Abstract: A method is provided for providing parking information regarding free parking spaces within at least one city block. The method provides for detecting information regarding available, free parking spaces, wherein a knowledge database with historical data is generated from the detected information. The historical data for specified city blocks and/or specified times or periods of time respectively comprise statistical data regarding free parking spaces. From the historical data and current information that are detected by vehicles in traffic for a first given point in time for a single or a plurality of selected city blocks, a probability distribution of free parking spaces to be expected for the single or the plurality of city blocks is determined. A visualization of the probability distribution is generated that represents the parking information regarding free parking spaces within the single or the plurality of city blocks.

Abstract: In a method for controlling provision of traffic informational data for updating traffic information, traffic information that was previously valid on a route section, and that was provided by a traffic service provider, for example, is allocated a first added value. A second time value is determined for traffic information on the route section updated virtually by traffic informational data generated from a vehicle. From a comparison of the first and second time values, a priority ratio may be obtained as a measured value for the benefit of transferring the traffic informational data generated in the vehicle to a traffic service provider for updating traffic information that was previously valid at the traffic service provider.

Abstract: In a method for controlling provision of traffic informational data for updating traffic information, traffic information that was previously valid on a route section, and that was provided by a traffic service provider, for example, is allocated a first added value. A second time value is determined for traffic information on the route section updated virtually by traffic informational data generated from a vehicle. From a comparison of the first and second time values, a priority ratio may be obtained as a measured value for the benefit of transferring the traffic informational data generated in the vehicle to a traffic service provider for updating traffic information that was previously valid at the traffic service provider.

Abstract: According to a method for creating a model for a travel time database, a leg network comprising leg sections between a starting point and a destination point are analyzed. Multiple routes are ascertained between the starting and destination points. Each leg section of a route is associated with a relative travel time loss and is weighted. The ascertained travel time losses and the associated weightings are used as input data for a learning method by way of which an existing knowledge base is iteratively expanded.

Abstract: According to a method for creating a model for a travel time database, a leg network comprising leg sections between a starting point and a destination point are analyzed. Multiple routes are ascertained between the starting and destination points. Each leg section of a route is associated with a relative travel time loss and is weighted. The ascertained travel time losses and the associated weightings are used as input data for a learning method by way of which an existing knowledge base is iteratively expanded.

Abstract: A method is provided for providing parking information regarding free parking spaces within at least one city block. The method provides for detecting information regarding available, free parking spaces, wherein a knowledge database with historical data is generated from the detected information. The historical data for specified city blocks and/or specified times or periods of time respectively comprise statistical data regarding free parking spaces. From the historical data and current information that are detected by vehicles in traffic for a first given point in time for a single or a plurality of selected city blocks, a probability distribution of free parking spaces to be expected for the single or the plurality of city blocks is determined. A visualization of the probability distribution is generated that represents the parking information regarding free parking spaces within the single or the plurality of city blocks.

Abstract: A method of checking the quality of traffic disturbance reporting processes records a total number of traffic disturbance reports generated by a traffic disturbance reporting process, which traffic disturbance reports each relate to at least one defined reporting time period and at least one defined reporting route segment, over a predefined analyzing time period and a predefined analyzing range. A number of reported conditions is formed from the total number of traffic disturbance reports, and a first statistical frequency distribution of the reported conditions is determined. A total number of reference observations are recorded, which each relate to at least one defined observation time period and at least one defined observation route segment, within the analyzing time period and within the analyzing range. A number of actual conditions is formed from the total number of reference observations and a second statistical frequency distribution of the actual conditions is determined.

Abstract: A method of checking the quality of traffic disturbance reporting processes records a total number of traffic disturbance reports generated by a traffic disturbance reporting process, which traffic disturbance reports each relate to at least one defined reporting time period and at least one defined reporting route segment, over a predefined analyzing time period and a predefined analyzing range. A number of reported conditions is formed from the total number of traffic disturbance reports, and a first statistical frequency distribution of the reported conditions is determined. A total number of reference observations are recorded, which each relate to at least one defined observation time period and at least one defined observation route segment, within the analyzing time period and within the analyzing range. A number of actual conditions is formed from the total number of reference observations and a second statistical frequency distribution of the actual conditions is determined.

Abstract: The invention is directed to a method for training at least one learning-capable system comprising the steps of providing a predetermined training data set corresponding to a predetermined number of subjects comprising a predetermined input data set and a predetermined outcome data set, augmenting the input data set and/or the outcome data set, and training each learning-capable system using the augmented input data set and/or the augmented outcome data set.

Abstract: The present invention relates to methods for determining a treatment regimen beyond surgical removal of tumor tissue for node negative or node positive breast cancer patient. The method comprises measuring the levels of urokinase-type plasminogen activator (uPA) and plasminogen activator inhibitor-1 (PAI-1) in a subject, preferably a tumor; and, based upon the values, predicting the expected benefit including disease-free survival and/or overall survival for the patient without treatment (beyond the surgical removal of tumor tissue) or with a particular treatment and using that information to select a treatment regimen for the subject. High risk subject is identified by high levels of both uPA and PAI-1, high level of uPA and low level of PAI-1 or, low level of uPA and high level of PAI-1.

Abstract: A method for training a neural network in order to optimize the structure of the neural network includes identifying and eliminating synapses that have no significant influence on the curve of the risk function. First and second sending neurons are selected that are connected to the same receiving neuron by respective first and second synapses. It is assumed that there is a correlation of response signals from the first and second sending neurons to the same receiving neuron. The first synapse is interrupted and a weight of the second synapse is adapted in its place. The output signals of the changed neural network are compared with the output signals of the unchanged neural network. If the comparison result does not exceed a predetermined level, the first synapse is eliminated, thereby simplifying the structure of the neural network.