Abstract: An internal combustion engine (1), preferably for a motor vehicle, having at least one cylinder (2) which encloses a combustion chamber (3) and in which a piston (4) is situated in such a way that it may perform a stroke movement, and having at least one injector (5) per cylinder for injecting fuel into the combustion chamber (3). The respective injector (5) has multiple injection openings (9, 10) through which the fuel exits from the injector (5) and enters into the combustion chamber (3). To be able to react more fuel, first injection openings (9) and second injection openings (10) are situated relative to one another in such a way that first injection jets (15) from the first injection openings (9) reach the piston (4) essentially without contacting second injection jets (18) from the second injection openings (10).

Abstract: An internal combustion engine (1), preferably for a motor vehicle, having at least one cylinder (2) which encloses a combustion chamber (3) and in which a piston (4) is situated in such a way that it may perform a stroke movement, and having at least one injector (5) per cylinder for injecting fuel into the combustion chamber (3). The respective injector (5) has multiple injection openings (9, 10) through which the fuel exits from the injector (5) and enters into the combustion chamber (3). To be able to react more fuel, first injection openings (9) and second injection openings (10) are situated relative to one another in such a way that first injection jets (15) from the first injection openings (9) reach the piston (4) essentially without contacting second injection jets (18) from the second injection openings (10).

Abstract: Method for supporting network based mobility for a mobile terminal in an IMS (IP Multimedia Subsystem) architecture, wherein the mobile terminal is connected to a femto cell or to a macro cell—source cell—and wherein handover of an actual session of the mobile terminal is performed to another femto cell or macro cell—target cell—, wherein the femto cells and the macro cells are provided with an eMSC-server (Mobile Switching Center Server enhanced for IMS Centralized Services) function, and wherein the source cell's eMSC-server function hosts a source user agent and the target cell's eMSC-server function hosts a target user agent, is characterized in that the source user agent contacts the target user agent directly or indirectly prior to executing the actual handover, and wherein the source user agent prepares the target user agent together with the corresponding access network by exchanging handover related information.

Abstract: A technique to transmit data from a sender to a receiver via a network, preferably a LAN and/or the Internet etc., where the sender transmits the data to a base station, and where the sender is verified by a server, in particular a AAA-server etc. In order to prevent the transmission of data from an illegitimate sender at the expense of a legitimate sender to the greatest extent possible, the server transmits verification data from the server to the sender and/or base station.

Abstract: A method of performing charging and rewarding processes in ad hoc networks with the ad hoc network showing a multitude of active nodes and with one node, which sends or receives packets, is charged costs and a node, which forwards packets within the ad hoc network, is rewarded, is characterized in that charging and rewarding data generated within the ad hoc network is transmitted via an access router to a component of the AAA (authentification, authorization, accounting) architecture for subsequent transmission and/or processing purposes.

Abstract: Decisions to remove objects from a cache memory are made on an object-by-object basis. When a cache replacement decision is called for, a single object is selected from the cache. A weight value is assigned to the selected object in accordance with a predetermined methodology. The assigned object weight is compared to a current threshold weight. If the assigned object weight is the lesser of the two weights, the selected object is marked for removal from the cache and the threshold weight is reduced. If the assigned object weight is the greater of the two, the threshold weight is raised. In a preferred embodiment, the threshold weight is lowered more quickly than it is raised. The technique can be used in standalone workstations and in proxy servers, among other environments.

Abstract: A self-adapting method and apparatus for determining an efficient cache line replacement algorithm for selecting which objects (or lines) are to be evicted from the cache. Objects are prioritized based upon weights which are determined dynamically for each object. The object weights depend on a first attribute L1 for each cache object and a first control parameter P1 which determines the influence of the first attribute L1 on the weights. The hit rate of the cache memory is observed during a first interval of time while the control parameter is set to a first value. The control parameter is adjusted and the hit rate is observed during a second interval of time. The control parameter is then adjusted an incremental amount having a magnitude and direction determined based on whether the hit rate improved or was reduced.

Abstract: A technique to transmit data from a sender to a receiver via a network, preferably a LAN and/or the Internet etc., where the sender transmits the data to a base station, and where the sender is verified by a server, in particular a AAA-server etc. In order to prevent the transmission of data from an illegitimate sender at the expense of a legitimate sender to the greatest extent possible, the server transmits verification data from the server to the sender and/or base station.

Abstract: Documents down-loaded for the first time from the Internet onto an interlocked computer system are stored on an allocated computer in an interlocked computer system. By using a HASH function, a computer in the system is determined, using the document address. On this computer there are stored the document address and the address of the computer on which the document is stored. The HASH function can ensure that either all computers are used equally to store the address information for the documents stored in the interlocked computer system, or it can take into consideration differing capacities of the individual computers in storage of the address information items. When future requests are made for a document stored in the interlocked computer system, the HASH function determines from the document address the appropriate computer. The relevant computer passes the document request to the computer on which the document is stored. Consequently, it is a simple technical step to transfer the document to the user.