Josko
Josko Kurbasa, Waldsolms DE
Patent application number | Description | Published |
---|---|---|
20130218407 | Method for Monitoring a Brake System and Brake System - A method for monitoring a brake system for motor vehicles. The system can be actuated both by a vehicle driver and independently of the vehicle driver in what is known as a brake-by-wire mode. The hydraulic actuation device can be actuated by means of a brake pedal and has a main brake cylinder to which wheel brakes are connected, at least two brake circuits, a simulation device, which comprises at least one elastic element and gives the vehicle driver a comfortable pedal feeling, an electrically controllable pressure-providing device, which is formed by a cylinder/piston assembly, the piston of which can be actuated by an electromagnetic actuator, wherein the first measurement variable (P | 08-22-2013 |
20140139333 | SENSOR ARRANGEMENT AND METHOD FOR TRANSMITTING AN ITEM OF BRAKING OPERATION INFORMATION - The invention specifies a sensor arrangement for a brake system for braking a wheel in a vehicle, which brake system includes a travel sensor for detecting a position of a brake pedal of the brake system, wherein the travel sensor is provided for detecting operation of the brake pedal based on the position of the brake pedal and for outputting a signal which indicates operation of the brake pedal. | 05-22-2014 |
Josko Silobrcic, Swampscott, MA US
Patent application number | Description | Published |
---|---|---|
20090299766 | SYSTEM AND METHOD FOR OPTIMIZING MEDICAL TREATMENT PLANNING AND SUPPORT IN DIFFICULT SITUATIONS SUBJECT TO MULTIPLE CONSTRAINTS AND UNCERTAINTIES - A computer implemented method for managing a condition of a patient during a chaotic event. A datum regarding a first patient is received. A first set of relationships is established. The first set of relationships comprises at least one relationship of the datum to at least one additional datum existing in a database. Based on the first set of relationships, cohorts to which the first patient belongs are established. Ones of the plurality of cohorts contain first data regarding the first patient and second data regarding a set of additional information. The set of additional information is related to the first data. The second data further regards a constraint imposed by a chaotic event. The plurality of cohorts is clustered according to at least one parameter. A cluster of cohorts is formed. Which of at least two cohorts in the cluster are closest to each other is determined. | 12-03-2009 |
20140006390 | CONTEXT-BASED ELECTRONIC DOCUMENT SEARCH USING A SYNTHETIC EVENT | 01-02-2014 |
20140006391 | ACTIVITY RECOMMENDATION BASED ON A CONTEXT-BASED ELECTRONIC FILES SEARCH | 01-02-2014 |
20140006419 | IDENTIFICATION OF NULL SETS IN A CONTEXT-BASED ELECTRONIC DOCUMENT SEARCH | 01-02-2014 |
Josko Silobrcic, Boston, MA US
Patent application number | Description | Published |
---|---|---|
20140236977 | MAPPING EPIGENETIC SURPRISAL DATA THROUGTH HADOOP TYPE DISTRIBUTED FILE SYSTEMS - A method, system and computer program product for reducing an amount of epigenetic data representing epigenetic modifications of a genetic sequence of an organism using a Hadoop type distributed file system. The method including the steps of breaking epigenetic data and a reference epigenetic map into blocks of data of a fixed size; distributing the blocks of data to the plurality of worker nodes within the clusters and replicating the blocks of data within each of the worker nodes; tasking the plurality of worker nodes to perform a map job comprising mapping the reference epigenetic map relative to the epigenetic data; and when a worker node has reported a completion of the map job, tasking the worker node with a reduce job based on a specific key to an output of epigenetic surprisal data and associated metadata. | 08-21-2014 |
20140236990 | MAPPING SURPRISAL DATA THROUGTH HADOOP TYPE DISTRIBUTED FILE SYSTEMS - A method, system and computer program product for reducing an amount of data representing a genetic sequence of an organism using a Hadoop type distributed file system. The method including the steps of breaking a surprisal data filter and an uncompressed genetic sequence into blocks of data of a fixed size; distributing the blocks of data to the plurality of worker nodes within the clusters and replicating the blocks of data within each of the worker nodes; tasking the plurality of worker nodes to perform a map job comprising mapping the surprisal data filter relative to the uncompressed genetic sequence; and when a worker node has reported a completion of the map job, tasking the worker node with a reduce job based on a specific key to an output of surprisal data and associated metadata. | 08-21-2014 |
20140310214 | OPTIMIZED AND HIGH THROUGHPUT COMPARISON AND ANALYTICS OF LARGE SETS OF GENOME DATA - A method, computer program product and system for reconciling a plurality of surprisal data sets of a genetic sequence of an organism being generated from a surprisal data reference genome using a base reference genome. If the base reference genome is not the surprisal data reference genome indicated in the surprisal data set, the surprisal data reference genome is retrieved and compared to the base reference genome to obtain reference genome differences. If a starting location of an instance of the surprisal data set is present in the reference genome differences, the nucleotides of the instance of the surprisal data are compared to the nucleotides of the reference genome difference. If the nucleotides of the instance of the surprisal data are the same as the nucleotides of the reference genome difference, the instance of surprisal data is removed from the surprisal data set. | 10-16-2014 |