Abstract: A patient interface for delivery of a supply of pressurised air or breathable gas to an entrance of a patient's airways comprising: a cushion member that includes a retaining structure and a seal-forming structure permanently connected to the retaining structure; a frame member attachable to the retaining structure; and a positioning and stabilising structure attachable to the frame member.

Abstract: Examples of the present disclosure relate to metadata-assisted inventory management. Image data relating to a device is captured and further enriched with metadata, such as customer information, current event data, and/or log data associated with the device. The enriched image data may be processed by a decision engine to generate determinations based on the image data in combination with the metadata. For example, an equipment classification decision engine generates an equipment classification for telecommunications equipment therein. As another example, a cost modeling decision engine processes the enriched image data to evaluate a cost associated with the telecommunications equipment or a service evaluation decision engine may process the enriched image data to determine whether telecommunications equipment and/or an associated service are performing as expected.

Abstract: A stamp replication device for producing stamps for the production of at least one of microstructured and nanostructured components has a platform, a cover that is positionable on the platform and a holding device for a stamp carrier, wherein the holding device is provided on the cover or on the platform and includes a carrier as well as a microstructured vacuum surface on the carrier for holding the stamp carrier. In addition, a method for producing a holding device for a stamp replication device as well as a method for producing a stamp are specified.

Abstract: Replication device for producing at least one of nanostructured and microstructured components with two assemblies that are moveable in relation to each other, wherein the first assembly has a chuck for receiving a substrate and a second assembly a holder for an imprint structure, wherein the assemblies are moveable relative to each other between an imprint position and a loading position, and wherein at least a sealing lip is located on one of the two assemblies, the sealing lip facing the other one of the two assemblies and contacting the other one of the two assemblies in the imprint position and radially surrounding at least one of the chuck and the holder, wherein a sealed overpressure chamber between the two assemblies is limited by the sealing lip in the imprint position. Further, also a method for reproducing a structure on a substrate is shown.

Abstract: A foot cradle apparatus of a muscle training device is provided, having a foot cradle with a tread and a side wall at least partially limiting the tread, and a fixation unit for fixing a human foot in the foot cradle. A foot fixation unit that is simple to handle and has small dimensions and a low weight is created in that the fixation unit is formed as a lockable, pivotable bracket, whose pivot bearing has a pivot axis oriented substantially parallel to the longitudinal axis of the foot cradle and is provided in a compact bearing unit which is connected fixedly at least indirectly to the foot cradle and which is attached to an inner side wall, close to the inner side of a patient's foot, of the foot cradle and is connected fixedly to the tread via the inner side wall.

Abstract: A foot cradle apparatus of a muscle training device is provided, having a foot cradle with a tread and a side wall at least partially limiting the tread, and a fixation unit for fixing a human foot in the foot cradle. A foot fixation unit that is simple to handle and has small dimensions and a low weight is created in that the fixation unit is formed as a lockable, pivotable bracket, whose pivot bearing has a pivot axis oriented substantially parallel to the longitudinal axis of the foot cradle and is provided in a compact bearing unit which is connected fixedly at least indirectly to the foot cradle and which is attached to an inner side wall, close to the inner side of a patient's foot, of the foot cradle and is connected fixedly to the tread via the inner side wall.

Abstract: A secure data processing unit has a data/program instruction memory for storing data/program instructions, an instruction line with a large number of function stages for processing the data/program instructions, and a control unit for controlling the function stages. A blank function generator in this case randomly produces blank functions in the data processing unit, thus making an eavesdropping attack by analysis of leakage information considerably more difficult or preventing it.

Abstract: A microprocessor circuit for organizing access to data or programs stored in a memory has a microprocessor, a memory for storing an operating system, and a memory for storing individual external programs. A plurality of memory areas with respective address spaces is provided in the memory for storing the external programs. Each address space is assigned an identifier. The identifier assigned to a memory area is loaded into a first auxiliary register prior to the addressing of the memory area and the identifier of the addressed memory area is loaded into a second auxiliary register. A comparison of the contents of the first and second auxiliary registers is performed. Furthermore, each address space of a memory area is assigned at least one bit sequence defining access rights, whereby code instructions and sensitive data can be protected against write accesses from other external programs.

Abstract: A microprocessor circuit includes a control unit, a memory for free programming with at least one program having functions, a stack for buffer-storing data, a register bank having at least one register, and an auxiliary register that stores a number of bits, each of the bits being assigned to one of the registers of the register bank and indicating whether or not a respective register of the register bank contains information items.

Abstract: A method for determining a physical address from a virtual address, wherein a mapping regulation between the virtual address and the physical address is implemented as hierarchical tree structure with compressed nodes. First, a compression indicator included in the mapping regulation is read, and a portion of the virtual address associated with the considered node level is read. Using the compression indicator and the portion of the virtual address, an entry in the node list of the considered node is determined. The determined entry is read, whereupon the physical address can be determined directly, if the considered node level has been the hierarchically lowest node level. If higher node levels to be processed are present, the previous steps in determining the physical address for compressed nodes of lower hierarchy level are repeated until the hierarchically lowest node level is reached.

Abstract: A carrier device for a biological preparation cuttable by laser microdissection includes a frame-like holder having the substantial form of a petri dish with an open bottom, and a laser light-absorbing film located on the frame-like holder so as to cover the opening.

Abstract: An efficient method for protecting entry addresses in computer programs allows direct jumps to permissible entry addresses. The permissible entry addresses are identified with a correlation of data which are not provided within the same individual instruction. By organizing the program code, the compiler or linker ensures that only legal entry addresses satisfy this correlation.

Abstract: A method for determining a physical address from a virtual address, wherein a mapping regulation between the virtual address and the physical address is implemented as hierarchical tree structure with compressed nodes. First, a compression indicator included in the mapping regulation is read, and a portion of the virtual address associated with the considered node level is read. Using the compression indicator and the portion of the virtual address, an entry in the node list of the considered node is determined. The determined entry is read, whereupon the physical address can be determined directly, if the considered node level has been the hierarchically lowest node level. If higher node levels to be processed are present, the previous steps in determining the physical address for compressed nodes of lower hierarchy level are repeated until the hierarchically lowest node level is reached.

Abstract: In a method of storing a quantity of data in a target memory location, the data quantity is stored first in a non-volatile buffer memory location. It is then examined whether the data are successfully stored in the non-volatile buffer memory location. If the step of examining produces a positive result, the target memory location to which the predetermined quantity of data is to be written is cleared. After the step of clearing of the target memory location, the data are transferred from the non-volatile buffer memory location to the target memory location. To conclude the storage cycle, the non-volatile buffer memory location is then cleared so as to be available for a new storage operation. The effect achieved thereby is a secure and uncomplicated transfer of information from a source memory to the target memory.

Abstract: A microprocessor circuit for organizing access to data or programs stored in a memory has a microprocessor, a memory for storing an operating system, and a memory for storing individual external programs. A plurality of memory areas with respective address spaces is provided in the memory for storing the external programs. Each address space is assigned an identifier. The identifier assigned to a memory area is loaded into a first auxiliary register prior to the addressing of the memory area and the identifier of the addressed memory area is loaded into a second auxiliary register. A comparison of the contents of the first and second auxiliary registers is performed. Furthermore, each address space of a memory area is assigned at least one bit sequence defining access rights, whereby code instructions and sensitive data can be protected against write accesses from other external programs.

Abstract: In a method of storing a quantity of data in a target memory location, the data quantity is stored first in a non-volatile buffer memory location. It is then examined whether the data are successfully stored in the non-volatile buffer memory location. If the step of examining produces a positive result, the target memory location to which the predetermined quantity of data is to be written is cleared. After the step of clearing of the target memory location, the data are transferred from the non-volatile buffer memory location to the target memory location. To conclude the storage cycle, the non-volatile buffer memory location is then cleared so as to be available for a new storage operation. The effect achieved thereby is a secure and uncomplicated transfer of information from a source memory to the target memory.

Abstract: A microprocessor circuit includes a control unit, a memory for free programming with at least one program having functions, a stack for buffer-storing data, a register bank having at least one register, and an auxiliary register that stores a number of bits, each of the bits being assigned to one of the registers of the register bank and indicating whether or not a respective register of the register bank contains information items.

Abstract: A secure data processing unit has a data/program instruction memory for storing data/program instructions, an instruction line with a large number of function stages for processing the data/program instructions, and a control unit for controlling the function stages. A blank function generator in this case randomly produces blank functions in the data processing unit, thus making an eavesdropping attack by analysis of leakage information considerably more difficult or preventing it.

Abstract: A hardware-supported method of preventing stack manipulation attacks during function calls. In the event of a call of an unsafe function, stack access is restricted by hardware to the stack area of this function.

Abstract: An efficient method for protecting entry addresses in computer programs allows direct jumps to permissible entry addresses. The permissible entry addresses are identified with a correlation of data which are not provided within the same individual instruction. By organizing the program code, the compiler or linker ensures that only legal entry addresses satisfy this correlation.