Burghard
Berndt Burghard, Guntramsdorf AT
Patent application number | Description | Published |
---|---|---|
20130190068 | Gaming Machine Including Moving Wild Symbols - A gaming machine having standard and bonus game play features. During standard game play mode, the interface displays a matrix of symbols representing an arrangement of reels, and the computer calculates payouts based on the symbols, within the matrix. When a predetermined number of scatter symbols appear in the matrix of symbols in standard game play mode, bonus game play commences and at least some of the scatter symbols are transformed into wild symbols during bonus game play. Bonus game play mode includes multiple reel spins. The wild symbols presented during bonus game play mode occupy more than one location in the matrix of symbols and move during each reel spin to a random location in the matrix of symbols. The random location in the matrix of symbols excludes matrix locations previously occupied by a wild symbol during an immediately previous reel spin during bonus game play. | 07-25-2013 |
20150057068 | Gaming Machine Including Moving Wild Symbols - A gaming machine having standard and bonus game play features includes a housing, an interface attached to a housing, and a computer in operative communication with the interface. The computer has a memory and a processor. The memory stores game play instructions and a set of symbols including game symbols, scatter symbols and wild symbols. The game play instructions include instructions for a standard game play mode and bonus game play mode. During standard game play mode, the interface displays a matrix of symbols representing an arrangement of reels, and the computer calculates payouts based on the symbols, within the matrix. When a predetermined number of scatter symbols appear in the matrix of symbols in standard game play mode, bonus game play commences and at least some of the scatter symbols are transformed into wild symbols during bonus game play. Bonus game play mode includes multiple reel spins. The wild symbols presented during bonus game play mode occupy more than one location in the matrix of symbols and move during each reel spin to a random location in the matrix of symbols. The random location in the matrix of symbols excludes matrix locations previously occupied by a wild symbol during an immediately previous reel spin during bonus game play. | 02-26-2015 |
John Burghard, Vernonia, OR US
Patent application number | Description | Published |
---|---|---|
20090130293 | BIOCOMPATIBLE COATINGS FOR MEDICAL DEVICES - Biocompatible coatings for implantable medical devices are disclosed. Embodiments of the invention provide plasma etch processes, surface silanization processes, and protein coating processes. Embodiments of the invention provide tropoelastin coatings and methods of creating tropoelastin coatings for implantable medical devices. Optionally, the biocompatible coating can be a drug eluting coating. | 05-21-2009 |
20090169714 | BIOCOMPATIBLE COATINGS FOR MEDICAL DEVICES - Biocompatible coatings for implantable medical devices are disclosed. Embodiments of the invention provide methods for coating an object with a biocompatible coating wherein the device is suspended using a flowing gas during the coating process. Embodiments of the invention provide tropoelastin coatings and methods of creating tropoelastin coatings for implantable medical devices. Optionally, the biocompatible coating can be a drug eluting coating. | 07-02-2009 |
Marko Burghard, Magstadt DE
Patent application number | Description | Published |
---|---|---|
20090084162 | CHEMICAL SENSOR - The application relates to a chemical sensor device comprising a substrate ( | 04-02-2009 |
Stephen J. Burghard, Winchester GB
Patent application number | Description | Published |
---|---|---|
20120102454 | SOFTWARE DEVELOPMENT - A method, system and computer program product for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program. | 04-26-2012 |
20120159440 | SOFTWARE DEVELOPMENT - A method for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program. | 06-21-2012 |
Stephen J. Burghard, Hursley GB
Patent application number | Description | Published |
---|---|---|
20140122940 | RECORDING THE CORE DATA OF A COMPUTER PROCESS WHICH PROVIDES TRACE DATA - A method, apparatus and computer program for recording the core data of a computer process, the computer process comprising trace points and core data is provided for each such trace point. A first set of core data comprising an image of a memory for the computer process is stored in response to a first set of trace data being produced for the computer process for a first trace point. A second set of core data is stored in response to a second set of trace data being produced for the computer process for a second trace, where the second set of core data comprises a record of any change in current memory contents for the computer process with respect to the first set of core data. | 05-01-2014 |
Stephen J. Burghard, Portsmouth GB
Patent application number | Description | Published |
---|---|---|
20130152049 | WARNING OF REGISTER AND STORAGE AREA ASSIGNMENT ERRORS - A system for tracking register and/or storage area assignments and warning a programmer of potential assignment errors. More specifically, the system tracks programmer assignments to registers and storage areas and determines if a register or storage area has been modified prior to a call to a program or process external to the source code being examined. The system notes whether a modified register or storage area is restored to its original value subsequent to the external call. If the register or storage area has not been restored, the system displays a warning of a possible assignment error. | 06-13-2013 |
20130346806 | TRACE VALUE CORRELATION WITH DATA FIELD DECLARATIONS - Data fields within a trace data set are interpreted by a processor using a data field declaration of each data field that identifies a data type of the respective data field. An actual data value of the interpreted data field is compared with the data field declaration for each interpreted data field. Based upon each comparison, a determination is made as to whether the actual data value of the interpreted data field contains an erroneous data value based upon the data field declaration. | 12-26-2013 |
20140258785 | IDENTIFYING A STORAGE LOCATION FOR A STORAGE ADDRESS REQUESTED DURING DEBUGGING - A method for identifying a storage location for a requested storage address. The method includes receiving a request to view data at a storage address and determining the requested storage address corresponding to a plurality of storage locations. The method includes determining whether the requested storage address identifies memory related to a dump file being analyzed by a dump formatter. Then, in response to determining the requested storage address identifies memory related to the dump file being analyzed by the dump formatter, the method includes identifying one of the plurality of storage locations. The method includes directing the request to the identified storage location. | 09-11-2014 |
Stephen J. Burghard, Hants GB
Patent application number | Description | Published |
---|---|---|
20090100113 | TRANSACTION LOG MANAGEMENT - A transaction processing system comprising a transaction log, a log management policy, a profile and a log manager, and method for managing the transaction log are provided. The method comprises maintaining a transaction log of recoverable changes made by transaction processing tasks; storing a log management policy including at least one log threshold and a plurality of possible actions associated therewith; and generating a historical profile comprising a set of acceptable values for characteristics of the log resource usage of tasks. Such log resource usage characteristics may include time taken for a task to complete, CPU resource consumed, number of log records made, etc. From a comparison of the profile behaviour to the actual behaviour of a task which has been identified as holding up trimming of the log, the likelihood that the identified task has entered an invalid loop and represents a ‘bad’ transaction instance, rather than simply just taking a long time to complete, can be inferred. Thus the most appropriate action can be selected and taken. | 04-16-2009 |
20090100434 | TRANSACTION MANAGEMENT - A method and transaction processing system for managing transaction processing tasks are provided. The transaction processing system comprises a transaction log, a log management policy, a log manager and a dispatcher. The method comprises maintaining a transaction log of recoverable changes made by transaction processing tasks and storing a log management policy including at least one log threshold. Usage of the log by transaction processing tasks is then monitored to determine when a log threshold is reached. When a log threshold is reached the active task having the oldest log entry of all active tasks is identified and its dispatching priority is increased. This increases the likelihood that the identified task will be dispatched, and should mean that the task will more quickly reach normal completion. | 04-16-2009 |
Stephen J. Burghard US
Patent application number | Description | Published |
---|---|---|
20110153817 | TRACE MONITORING - A method of operating a transaction server for use with trace components, providing an execution cost for each trace component, receiving input selecting one or more trace components, running the transaction server with each selected trace component active, monitoring the execution cost of each selected trace component, and providing an updated execution cost for each trace component. The method can also be extended to provide an execution cost for one or more combinations of trace components monitoring the execution cost of any selected trace component combination, and also to provide an updated execution cost for each trace component combination. The method can further comprise maintaining a record of the execution cost of each selected trace component and transmitting the record to a different transaction server, thereby sharing knowledge between connected systems. | 06-23-2011 |
Stephen John Burghard, Portsmouth GB
Patent application number | Description | Published |
---|---|---|
20140173356 | PERFORMING DIAGNOSTIC TRACING OF AN EXECUTING APPLICATION TO IDENTIFY SUSPICIOUS POINTER VALUES - Arrangements described herein relate to performing diagnostic tracing of an executing application. A trace entry in trace data can be identified, the trace entry comprising a pointer that refers to a memory address. Whether a value that is, or has been, stored at the memory address is an erroneous value can be determined. Responsive to determining that the value that is, or has been, stored at the memory address is an erroneous value, the pointer can be indicated as being a suspicious value. | 06-19-2014 |
20140173358 | PERFORMING DIAGNOSTIC TRACING OF AN EXECUTING APPLICATION TO IDENTIFY SUSPICIOUS POINTER VALUES - Arrangements described herein relate to performing diagnostic tracing of an executing application. A trace entry in trace data can be identified, the trace entry comprising a pointer that refers to a memory address. Whether a value that is, or has been, stored at the memory address is an erroneous value can be determined. Responsive to determining that the value that is, or has been, stored at the memory address is an erroneous value, the pointer can be indicated as being a suspicious value. | 06-19-2014 |
Stephen John Burghard, Fareham GB
Patent application number | Description | Published |
---|---|---|
20090240742 | Transaction Log Management - A transaction processing system comprising a transaction log, a log management policy, a profile and a log manager, and method for managing the transaction log are provided. The method comprises maintaining a transaction log of recoverable changes made by transaction processing tasks, each task having an associated transaction type; storing a log management policy including at least one log threshold and a plurality of possible actions associated therewith; and storing a profile of log resource usage characteristics of tasks for different types of transactions. Usage of the log by transaction processing tasks is monitored to determine when a log threshold is reached. The profile indicates the normal logging behaviour of particular types of transaction by identifying ranges of acceptable values for a plurality of log resource usage characteristics. Such characteristics may include time taken for a task to complete, CPU resource consumed, number of log records made, etc. From a comparison of the profile behaviour with the current log resource usage of a task which has been identified as holding up trimming of the log, likelihood that the identified task having entered an invalid loop and represents a ‘bad’ program, rather than simply validly taking a long time to complete can be inferred. Thus the most appropriate action can be selected and taken. | 09-24-2009 |
Zaklina Burghard, Magstadt DE
Patent application number | Description | Published |
---|---|---|
20120202068 | PROCESS FOR DEPOSITION OF THIN LAYERS OF METAL OXIDES - The invention relates to a process for the deposition of a metal oxide, such as titanium dioxide, as a thin layer on a substrate, by using particular biopolymers, in particular, a hydrophobin. The process for the deposition of a metal oxide on a substrate (S) comprises the steps of depositing a protein layer (H) comprising at least one hydrophobin on the substrate and the deposition of a metal oxide layer (M) on the protein layer (H) by precipitation from an aqueous solution of a metal salt. | 08-09-2012 |