Patent application number | Description | Published |
20100243676 | TAPPING DEVICE, BEVERAGE CONTAINER, COUPLING DEVICE AND METHOD WITH CLEANING ELEMENT - Tapping device for beverage, comprising at least one beverage container, a tapping line and a tapping cock, wherein the tapping line extends at least to adjacent the tapping cock and connecting means for connection of the tapping line to the at least one beverage container, wherein a cleaning element is provided in the beverage container or the connecting means, which cleaning element upon broaching of a beverage container is situated near an end of the tapping line proximal to the beverage container and is movable through the tapping line under pressure of beverage from the beverage container, while abutting against an inner side of the tapping line, such that beverage will propel the cleaning element in the tapping line, at least to near the tapping cock. | 09-30-2010 |
20110309109 | TAPPING HEAD, TAPPING DEVICE AND METHOD FOR USE OF A TAPPING DEVICE - A tapping head, provided with a connecting head near an end of a housing, wherein the tapping head is provided with at least one of a beverage channel which extends from a beverage line connection into the connecting head and a gas channel which extends from a gas line connection, wherein the tapping head is provided with at least one cooling chamber with an entrance and an exit, separate from the beverage channel and/or the gas channel, which cooling chamber is in thermal contact with the housing. | 12-22-2011 |
Patent application number | Description | Published |
20130060526 | Computer System and Method for Comparing Output Signals - A computer system includes at least two COTS processor cores and an evaluating device connected to the at least two COTS processor cores for evaluating output signals output by means of the at least two COTS processor cores. The evaluating device includes a comparator for pair-wise comparison of the respective generated output signals with each other. The comparator also outputs a comparison signal corresponding to the respective comparison of the output signals. | 03-07-2013 |
20140207989 | ACCESS CONTROL TO A JOINTLY EXCLUSIVELY USABLE TRANSMISSION MEDIUM - A computing system and a method are specified. The computing system has a plurality of components which are configured to use a resource exclusively jointly, an activity monitoring unit which records a number of activities of a component on the resource and an interrupting unit which is configured to interrupt access of the components for use of the resource when the number of activities of the component reaches an activity threshold, so that an assignment strategy can assign the exclusively jointly used resource to another component. | 07-24-2014 |
20150254461 | TESTING INTEGRATED INDEPENDENT LEVELS OF SECURITY COMPONENTS HOSTED ON A VIRTUALIZATION PLATFORM - A virtualization platform that provides a systematic, transparent and local testing of components hosted by the virtualization platform in their integrated context. The virtualization platform comprises integrated interceptor modules connected to the components via communication channels, each interceptor module being interposed in the communication channel connecting two components, and an integrated analyzing device connected to the interceptor modules and comprising a control device and a testing device. The control device is configured to put each interceptor module in an operational mode selected out of a set of predetermined operational modes including a testing mode. The testing device is configured to locally test the components connected to the interceptor modules being put in the testing mode. | 09-10-2015 |
20150256512 | HIGH ASSURANCE SECURITY GATEWAY INTERCONNECTING DIFFERENT DOMAINS - A gateway having an architecture authorizing a bidirectional communication between applications located in different domains and presenting a high assurance level of protection. The gateway uses a virtualization platform and comprises a set of functional blocs configured to authorize secure bidirectional flow of data along two different paths between first and second domains, said set of functional blocs being decomposed into a plurality of elementarily evaluable components each one of which having a specified function and being adapted to communicate with other predefined elementarily evaluable components. | 09-10-2015 |
20150268296 | VERIFICATION AND CERTIFICATION OF AN ELECTRONIC COMPONENT - A circuit is designed to be executed in a predeterminable operating mode of a plurality of operating modes. The circuit includes a first functional unit and a second functional unit. The first functional unit is designed as a static functional unit that in each of the plurality of operating modes of the circuit carries out a consistent function. The second functional unit is designed as an adaptable functional unit that is designed to be configured, prior to the circuit being put into service, according to a first configuration of a plurality of different configurations and during the operating time of the circuit to maintain the first configuration so that the first configuration of the second functional unit defines the predeterminable operating mode of the circuit. This makes it possible to reduce the verification expenditure for the circuit because verification can be limited to the adaptable functional unit. | 09-24-2015 |
Patent application number | Description | Published |
20090086653 | HIGH-INTEGRITY SELF-TEST IN A NETWORK HAVING A BRAIDED-RING TOPOLOGY - In one embodiment, a node comprises an interface to communicatively couple the node to a plurality of independent communication links. The node changes the mode in which the node operates when the node receives an indicator on a plurality of the independent communication links. | 04-02-2009 |
20090116502 | EFFICIENT TRIPLE MODULAR REDUNDANCY ON A BRAIDED RING - One embodiment comprises a network that includes a plurality of bi-directional links and a plurality of nodes. Each node is communicatively coupled to two neighbor nodes and to two skip nodes using the plurality of bi-directional links. Three neighboring nodes of the plurality of nodes form a triple modular redundant (TMR) set having a first end node, a second end node, and a center node, the first end node configured to transmit output data in a first direction and the second end node configured to transmit output data in a second direction. At least one of the plurality of nodes that is not in the redundant set determines the integrity of data received from the redundant set based on at least: (i) a comparison of data received on a first logical communication channel from a respective first neighbor node with data received on the first logical communication channel from a respective first skip node; (ii) a comparison of data received on a second logical communication channel from a respective second neighbor node with data received on the second logical communication channel from a respective second skip node; and (iii) a comparison of data received on the first logical communication channel from one of the respective first neighbor node and the respective first skip node with data received on the second logical communication channel from one of the respective second neighbor node and the respective second skip node. | 05-07-2009 |
20090141744 | AUTOCRATIC LOW COMPLEXITY GATEWAY/ GUARDIAN STRATEGY AND/OR SIMPLE LOCAL GUARDIAN STRATEGY FOR FlexRay OR OTHER DISTRIBUTED TIME-TRIGGERED PROTOCOL - A special node is used in a distributed time-triggered cluster. The special node comprises protocol functionality to establish a time base to use in communicating with a plurality of end nodes and to source timing-related frames to the plurality of end nodes in accordance with the distributed time-triggered communication protocol. The protocol functionality establishes the time base without regard to any timing-related frame sourced from any of the plurality of end nodes. In one embodiment, the protocol functionality of the special node is implemented in a low complexity manner. In one embodiment, the cluster comprises a star topology and the special node performs at least one of semantic filtering and rate enforcement. In another embodiment, the cluster comprises a bus or peer-to-peer topology and each end node is coupled to the communication channel using a low-complexity special local bus guardian. | 06-04-2009 |
20100281130 | COMMUNICATION METHOD AND APPARATUS FOR THE EFFICIENT AND RELIABLE TRANSMISSION OF TT ETHERNET MESSAGES - The goal of the present invention is to improve the useful data efficiency and reliability in the use of commercially available ETHERNET controllers, in a distributed real time computer system, by a number of node computers communicating via one or more communication channels by means of TT ETHERNET messages. To achieve this goal, a distinction is made between the node computer send time (KNSZPKT) and the network send time (NWSZPKT) of a message. The KNSZPKT must wait for the NWSZPKT, so that under all circumstances, the start of the message has arrived in the TT star coupler at the NWSZPKT, interpreted by the clock in the TT star coupler. The TT star coupler is modified, so that a message arriving from a node computer is delayed in an intelligent port of the TT star coupler until the NWSZPKT can send it precisely at the NWSZPKT into the TT network. | 11-04-2010 |
20100284301 | DYNAMIC FAULT-TOLERANT CONFIGURATION SUPPORT AND RE-CONFIGURATION OF A BRAIDED RING NETWORK - A method of configuring a node comprises receiving a first message having a count field value from a first direct link; receiving a second message having a count field value from a first skip link; adjusting the count field value in the first message by a first adjustment amount; adjusting the count field value in the second message by a second adjustment amount; comparing the adjusted count field value in the first message with the adjusted count field value in the second message; if the adjusted count field value in the first message matches the adjusted count field value in the second message, using the adjusted count field value in the first message to determine a node identity for the node; and processing subsequent messages based on the node identity. | 11-11-2010 |
20110138080 | METHOD FOR SYNCHRONIZING LOCAL CLOCKS IN A DISTRIBUTED COMPUTER NETWORK - The invention relates to a method for synchronizing local clocks in a distributed computer network, where said computer network consists of a number of components that are connected to each other via bi-directional communication links, characterized in that an a priori configured set of components of the network generates synchronization messages and sends these synchronization messages to the network. An a priori configured set of components consumes the generated synchronization messages. One or more message-relaying components in between a component that generates a synchronization message and the component that consumes the synchronization message will add a delay value to the synchronization message reflecting the delay imposed by the message-relaying component. A component that is configured to consume a synchronization message will delay a received synchronization message upon reception for a duration that is calculated by an a priori configured value for the maximum transmission delay minus the value of the sum of all delay values added to the received message before further usage of the message in the synchronization process of said component. | 06-09-2011 |
20110173347 | METHOD FOR SYNCHRONIZING LOCAL CLOCKS IN A DISTRIBUTED COMPUTER NETWORK - The invention relates to a method for synchronizing local clocks in a distributed computer network, where said computer network consists of a number of end systems and at least two switches. Each end system is connected to at least two switches via bi-directional communication links. A configured subset of end systems and switches executes the method in form of a synchronization state machine. The state machine uses at least three different frame types. The states in the state machine are either said to belong to an unsynchronized set of states or belong to a synchronized set of states. All end systems that are configured as Synchronization Master periodically send coldstart frames in one of the unsynchronized states and react to the reception of a coldstart frame by sending a coldstart acknowledgment frame a configurable first timeout after the reception of the coldstart frame on all replicated communication channels, provided that the end system is in a state in which the synchronization state machine defines a transition for coldstart frames, and where said first timeout is reset when a consecutive coldstart frame is received before the coldstart acknowledge is sent. All end systems that are configured as Synchronization Master react to the reception of a coldstart acknowledgment frame by starting a configurable second timeout, provided that they are not already executing said first timeout, and entering a synchronized state when said second timeout expires. | 07-14-2011 |
20130142204 | COMMUNICATION METHOD AND APPARATUS FOR THE EFFICIENT AND RELIABLE TRANSMISSION OF TT ETHERNET MESSAGES - The goal of the present invention is to improve the useful data efficiency and reliability in the use of commercially available ETHERNET controllers, in a distributed real time computer system, by a number of node computers communicating via one or more communication channels by means of TT ETHERNET messages. To achieve this goal, a distinction is made between the node computer send time (KNSZPKT) and the network send time (NWSZPKT) of a message. The KNSZPKT must wait for the NWSZPKT, so that under all circumstances, the start of the message has arrived in the TT star coupler at the NWSZPKT, interpreted by the clock in the TT star coupler. The TT star coupler is modified, so that a message arriving from a node computer is delayed in an intelligent port of the TT star coupler until the NWSZPKT can send it precisely at the NWSZPKT into the TT network. | 06-06-2013 |