Brueckner
Andrea Brueckner, Zurich CH
Patent application number | Description | Published |
---|---|---|
20100272298 | METHOD OF OPERATING A HEARING DEVICE AND A HEARING DEVICE - A method of operating a hearing device is disclosed, the method comprising the steps of: | 10-28-2010 |
Eric Brueckner, Champaign, IL US
Patent application number | Description | Published |
---|---|---|
20100317132 | Printed Assemblies of Ultrathin, Microscale Inorganic Light Emitting Diodes for Deformable and Semitransparent Displays - Described herein are printable structures and methods for making, assembling and arranging electronic devices. A number of the methods described herein are useful for assembling electronic devices where one or more device components are embedded in a polymer which is patterned during the embedding process with trenches for electrical interconnects between device components. Some methods described herein are useful for assembling electronic devices by printing methods, such as by dry transfer contact printing methods. Also described herein are GaN light emitting diodes and methods for making and arranging GaN light emitting diodes, for example for display or lighting systems. | 12-16-2010 |
20150132873 | Printed Assemblies of Ultrathin, Microscale Inorganic Light Emitting Diodes for Deformable and Semitransparent Displays - Described herein are printable structures and methods for making, assembling and arranging electronic devices. A number of the methods described herein are useful for assembling electronic devices where one or more device components are embedded in a polymer which is patterned during the embedding process with trenches for electrical interconnects between device components. Some methods described herein are useful for assembling electronic devices by printing methods, such as by dry transfer contact printing methods. Also described herein are GaN light emitting diodes and methods for making and arranging GaN light emitting diodes, for example for display or lighting systems. | 05-14-2015 |
Karl Brueckner, Allen, TX US
Patent application number | Description | Published |
---|---|---|
20120107520 | Removing Residues from Substrate Processing Components - Residues are removed from a surface of a substrate processing component which has a polymer coating below the residues. In one version, the component surfaces are contacted with an organic solvent to remove the residues without damaging or removing the polymer coating. The residues can be process residues or adhesive residues. The cleaning process can be conducted as part of a refurbishment process. In another version, the residues are ablated by scanning a laser across the component surface. In yet another version, the residues are vaporized by scanning a plasma cutter across the surface of the component. | 05-03-2012 |
Karl Brueckner, Santa Clara, CA US
Patent application number | Description | Published |
---|---|---|
20100059366 | TEXTURED CHAMBER SURFACE - A method of fabricating a process chamber component having a textured surface with raised features. The method comprises providing a process chamber component having a surface, and forming a patterned resist layer on the process chamber component, the patterned resist layer having apertures that expose portions of the surface of the process chamber component therethrough. A textured surface having raised features is formed on the process chamber component by propelling grit particles with a gas that is pressurized to a pressure sufficiently high to cause the grit particles to erode and remove material from the surface. | 03-11-2010 |
20140076354 | REMOVING RESIDUES FROM SUBSTRATE PROCESSING COMPONENTS - Residues are removed from a surface of a substrate processing component which has a polymer coating below the residues. In one version, the component surfaces are contacted with an organic solvent to remove the residues without damaging or removing the polymer coating. The residues can be process residues or adhesive residues. The cleaning process can be conducted as part of a refurbishment process. In another version, the residues are ablated by scanning a laser across the component surface. In yet another version, the residues are vaporized by scanning a plasma cutter across the surface of the component. | 03-20-2014 |
Peter Brueckner US
Patent application number | Description | Published |
---|---|---|
20140050364 | Method And Arrangement For The Optical Evaluation Of Harvested Crop In A Harvesting Machine - An arrangement for the optical evaluation of harvested crop in a harvesting machine includes a camera located for taking images of threshed out crop elements (grain and material other than grain) being conveyed within a channel of the machine. An electronic image processing system receives the images and identifies individual objects in the images, these objects being classified into predetermined object classes by way of comparing at least one of color, contour or texture features of the individual objects and corresponding characteristics of reference objects filed in a data bank. The processing system then determines the absolute or relative numbers or areas of the individual objects assigned to the respective object classes. | 02-20-2014 |
Peter Gregory Brueckner, Santa Cruz, CA US
Patent application number | Description | Published |
---|---|---|
20130242086 | Method and System for Identifying Depth Data Associated with an Object - Methods and systems for identifying depth data associated with an object are disclosed. The method includes capturing, with an image capturing device, a plurality of source images of the object. The image capturing device has a sensor that is tilted at a known angle with respect to an object plane of the object such that the image capturing device has a depth of field associated with each source image, the depth of field defining a plane that is angled with respect to the object plane. An image processor analyzes the plurality of source images to identify segments of the source images that satisfy an image quality metric. Position data is assigned to the identified segments of the source images, the position data including depth positions based on the plane defined by the depth of field. | 09-19-2013 |
Ralph Brueckner, Hallstadt AT
Patent application number | Description | Published |
---|---|---|
20110281838 | 5-ALKYNYL-PYRIMIDINES - The present invention encompasses compounds of general Formula (1) wherein R | 11-17-2011 |
Ralph Brueckner, Vienna AT
Patent application number | Description | Published |
---|---|---|
20090203673 | 4-HETEROCYCLOALKYLPYRI(MI)DINES, PROCESS FOR THE PREPARATION THEREOF AND THEIR USE AS MEDICAMENTS - The present invention encompasses compounds of general Formula (I) wherein X and R | 08-13-2009 |
20100113414 | THIAZOLYL-DIHYDRO-INDAZOLES - The present invention encompasses compounds of the general formula (1) | 05-06-2010 |
Stephen Brueckner, Ithaca, NY US
Patent application number | Description | Published |
---|---|---|
20090208910 | AUTOMATED EXECUTION AND EVALUATION OF NETWORK-BASED TRAINING EXERCISES - This disclosure generally relates to automated execution and evaluation of computer network training exercises, such as in a virtual machine environment. An example environment includes a control and monitoring system, an attack system, and a target system. The control and monitoring system initiates a training scenario to cause the attack system to engage in an attack against the target system. The target system then performs an action in response to the attack. Monitor information associated with the attack against the target system is collected by continuously monitoring the training scenario. The attack system is then capable of sending dynamic response data to the target system, wherein the dynamic response data is generated according to the collected monitor information to adapt the training scenario to the action performed by the target system. The control and monitoring system then generates an automated evaluation based upon the collected monitor information. | 08-20-2009 |
Stephen K. Brueckner, Ithaca, NY US
Patent application number | Description | Published |
---|---|---|
20120311207 | MEDIATING COMMUNCIATION OF A UNIVERAL SERIAL BUS DEVICE - An apparatus for mediating communication between a universal serial bus (USB) device and a host computing device is described. In an example, the apparatus includes a USB host interface configured to be connected to a downstream USB device, and a USB device interface configured to be connected to an upstream host computing device. The apparatus also includes a mediation module positioned between the USB host interface and the USB device interface and configured to determine whether the USB device is authorized to communicate with the host computing device. | 12-06-2012 |
20130067574 | FIGHT-THROUGH NODES FOR SURVIVABLE COMPUTER NETWORK - A survivable network is described in which one or more network device includes enhanced functionality to fight through cyber attacks. A Fight-Through Node (FTN) is described, which may be a combined hardware/software system that enhances existing networks with survivability properties. A network node comprises a hardware-based processing system having a set of one or more processing units, and a hypervisor executing on each one of the processing units; and a plurality of virtual machines executing on each of the hypervisor. The network node includes an application-level dispatcher to receive a plurality of transaction requests from a plurality of network communication session with a plurality of clients and distribute a copy of each of the transaction requests to the plurality of virtual machines executing on the network node over a plurality of time steps to form a processing pipeline of the virtual machines. | 03-14-2013 |
20140310810 | FIGHT-THROUGH NODES FOR SURVIVABLE COMPUTER NETWORK - A survivable network is described in which one or more network device includes enhanced functionality to fight through cyber attacks. A Fight-Through Node (FTN) is described, which may be a combined hardware/software system that enhances existing networks with survivability properties. A network node comprises a hardware-based processing system having a set of one or more processing units, a hypervisor executing on each one of the processing units, and a plurality of virtual machines executing on each of the hypervisor. The network node includes an application-level dispatcher to receive a plurality of transaction requests from a plurality of network communication session with a plurality of clients and distribute a copy of each of the transaction requests to the plurality of virtual machines executing on the network node over a plurality of time steps to form a processing pipeline of the virtual machines. | 10-16-2014 |
20150046405 | FIGHT-THROUGH NODES WITH DISPOSABLE VIRTUAL MACHINES AND ROLLBACK OF PERSISTENT STATE - A server system receives messages from client computing devices. Each of the messages corresponds to a transaction. The server system assigns each respective transaction to a respective fresh virtual machine. Furthermore, the server system performs, as part of a respective virtual machine processing a respective transaction, a modification associated with the respective transaction to a shared database. The shared database is persisted independently of the plurality of virtual machines. In response to determining that processing of the respective transaction is complete, the server system discards the respective virtual machine. In response to determining that the respective transaction is associated with a cyber-attack, the server system uses checkpoint data associated with the respective transaction to roll back the modifications associated with the respective transaction to the shared database. | 02-12-2015 |
20150143355 | SERVICE ORIENTED ARCHITECTURE VERSION AND DEPENDENCY CONTROL - This disclosure is directed to techniques for providing version control functionality for web services of one or more service oriented architecture (SOA) systems. According to these techniques, a version control service (VCS) may receive an indication of a version update for a first web service. In response to the received request, the VCS determines whether the version update, if executed within the SOA system, will cause a change in operation of a second web service. If the version update will cause a change, VCS provides an indication of the determined change to a user. | 05-21-2015 |
20150213730 | AUTOMATED EXECUTION AND EVALUATION OF NETWORK-BASED TRAINING EXERCISES - This disclosure generally relates to automated execution and evaluation of computer network training exercises, such as in a virtual machine environment. An example environment includes a control and monitoring system, an attack system, and a target system. The control and monitoring system initiates a training scenario to cause the attack system to engage in an attack against the target system. The target system then performs an action in response to the attack. Monitor information associated with the attack against the target system is collected by continuously monitoring the training scenario. The attack system is then capable of sending dynamic response data to the target system, wherein the dynamic response data is generated according to the collected monitor information to adapt the training scenario to the action performed by the target system. The control and monitoring system then generates an automated evaluation based upon the collected monitor information. | 07-30-2015 |
20150309831 | FIGHT-THROUGH NODES WITH DISPOSABLE VIRTUAL MACHINES AND ROLLBACK OF PERSISTENT STATE - A server system receives messages from client computing devices. Each of the messages corresponds to a transaction. The server system assigns each respective transaction to a respective fresh virtual machine. Furthermore, the server system performs, as part of a respective virtual machine processing a respective transaction, a modification associated with the respective transaction to a shared database. The shared database is persisted independently of the plurality of virtual machines. In response to determining that processing of the respective transaction is complete, the server system discards the respective virtual machine. In response to a trigger, such as determining that the respective transaction is associated with a cyber-attack, the server system uses checkpoint data associated with the respective transaction to roll back the modifications associated with the respective transaction to the shared database. | 10-29-2015 |
20150334130 | FIGHT-THROUGH NODES FOR SURVIVABLE COMPUTER NETWORK - A survivable network is described in which one or more network device includes enhanced functionality to fight through cyber attacks. A Fight-Through Node (FTN) is described, which may be a combined hardware/software system that enhances existing networks with survivability properties. A network node comprises a hardware-based processing system having a set of one or more processing units, a hypervisor executing on each one of the processing units, and a plurality of virtual machines executing on each of the hypervisor. The network node includes an application-level dispatcher to receive a plurality of transaction requests from a plurality of network communication session with a plurality of clients and distribute a copy of each of the transaction requests to the plurality of virtual machines executing on the network node over a plurality of time steps to form a processing pipeline of the virtual machines. | 11-19-2015 |
Stephen Kurt Brueckner, Ithaca, NY US
Patent application number | Description | Published |
---|---|---|
20120109905 | IDENTIFYING AND REPRESENTING CHANGES BETWEEN EXTENSIBLE MARKUP LANGUAGE (XML) FILES - This disclosure is directed to techniques for providing comparing first and second XML files to one another. According to these techniques, a computing device (e.g., a version control service executing on the computing device), may be configured generate at least two edit transcripts that each include one or more operational changes that may be applied to data elements of the first XML file to arrive at data elements of the second XML file (or vice versa). The computing device may select at least one optimal edit transcript based on which of the number of operational changes of the at least two edit transcripts. | 05-03-2012 |
20120110093 | SERVICE ORIENTED ARCHITECTURE VERSION AND DEPENDENCY CONTROL - This disclosure is directed to techniques for providing version control functionality for web services of one or more service oriented architecture (SOA) systems. According to these techniques, a version control service (VCS) may receive an indication of a version update for a first web service. In response to the received request, the VCS determines whether the version update, if executed within the SOA system, will cause a change in operation of a second web service. If the version update will cause a change, VCS provides an indication of the determined change to a user. | 05-03-2012 |
Sven Brueckner, Dexter, MI US
Patent application number | Description | Published |
---|---|---|
20110178978 | CHARACTERIZING AND PREDICTING AGENTS VIA MULTI-AGENT EVOLUTION - A method of predicting the behavior of software agents in a simulated environment involving modeling a plurality of software agents representing entities to be analyzed, which may be human beings. Using a set of parameters that governs the behavior of the agents, the internal state of at least one of the agents is estimated by its behavior in the simulation, including its movement within the environment. This facilitates a prediction of the likely future behavior of the agent based solely upon its internal state; that is, without recourse to any intentional agent communications. In one embodiment, the simulated environment is based upon a digital pheromone infrastructure. The simulation integrates knowledge of threat regions, a cognitive analysis of the agent's beliefs, desires, and intentions, a model of the agent's emotional disposition and state, and the dynamics of interactions with the environment. | 07-21-2011 |
20110208741 | AGENT-BASED CLUSTERING OF ABSTRACT SIMILAR DOCUMENTS - A continuous, emergent, anytime process clusters input documents according to a similarity function within a node-based, distributed computing environment, for example, within a client/server environment. An agent (DAg) assigned to each document determines whether its document should remain at a node or be moved to another node to increase similarity clustering. An agent (SAg) assigned to each node may be operative to manage storage requirements within its node, and/or manage communications between the nodes of the environment as the DAgs operate. Typically a move request is issued to another node if it is determined that clustering would increase by moving a document to that node. In such an instance, the SAg assigned to that other node would probabilistically consider the move request in view of other such requests in sequence to avoid overloading. To enhance performance, documents may be preprocessed and given values representative of similarity. The similarity between two arbitrary documents may then assessed as the average difference between the values assigned to the same attribute in the two documents. | 08-25-2011 |
20120284269 | HIERARCHICAL ANT CLUSTERING AND FORAGING - A clustering method yields a searchable hierarchy to speed retrieval, and can function dynamically with a changing document population. Nodes of the hierarchy climb up and down the emerging hierarchy based on locally sensed information. Like previous ant clustering algorithms, the inventive process is dynamic, decentralized, and anytime. Unlike them, it yields a hierarchical structure. For simplicity, and reflecting our initial application in the domain of textual information, the items being clustered are documents, but the principles may be applied to any collection of data items. | 11-08-2012 |
Sven Brueckner, Harrisonburg, VA US
Patent application number | Description | Published |
---|---|---|
20150341423 | DISTRIBUTED DYNAMIC ARRANGEMENT OF APPLICATION AGENTS - Autonomous computational processes (“agents”) representing application-specific data items (e.g., representations of real-world entities or events, any-media documents, models, etc.) are provided with application-independent methods and data structures to arrange themselves (according to application specific relationship measures) relative to other such agents even when the agents' ability to sense or communicate with other agents is limited relative to the extent of the overall collection. A continuously executing arrangement decision process executed by each agent modifies the agent's position in the chosen topology (e.g., metric space, graph structure) such that the chosen distance measure between agent positions approximates the relationship structure among the currently available data-items. A separate information exchange process executed by the agents ensures that knowledge about the position and data-item of other agents is made available to the arrangement decision process without requiring high-volume communication. | 11-26-2015 |
Sven A. Brueckner, Harrisonburg, VA US
Patent application number | Description | Published |
---|---|---|
20150347627 | GOSSIPING FOR DECENTRALIZED INFORMATION SPREADING - Autonomous computational processes (“agents”) representing application-specific data items (e.g., representations of real-world entities or events, any-media documents, models, etc.) are provided with application-independent methods and data structures to spread information in a global topology even when the agents' ability to sense or communicate with other agents is limited relative to the extent of the overall collection. The invention specifies three agent roles (Gossip Producer, Gossip Sharer, Gossip Consumer) that define three unique agent processes from which the information sharing emerges. Any agent in a given application may execute one or more of these roles at any given time and additional agent movement in the chosen topology aids the information spreading. | 12-03-2015 |
20150347909 | MULTI-OBJECTIVE AND CONSTRAINED AGENT WALK - Individual autonomous computational processes (“agents”) representing application-specific data items (e.g., representations of real-world entities or events, any-media documents, models, etc.) are provided with an application-independent method and data structures to combine arbitrary objectives and constraints into a goal-oriented sequence of movement steps in a global topology based on virtual or physical sensor information. The invention specifies a cyclical two-step agent movement process where the first step determines the proposed movement step relative to the agent's current position and the second step attempts to attain the new position implied by the movement step. The first step in the process first combines movement proposals from each of the objectives defined by the application and then enforces any of the application-defined constraints. The invention includes a number of prescriptions on how standard agent movement objectives are to be realized in this agent process. | 12-03-2015 |