Abstract: Provided herein are trispecific and/or trivalent binding proteins comprising four polypeptide chains that form three antigen binding sites that specifically bind one or more target proteins, wherein a first pair of polypeptides forming the binding protein possess dual variable domains having a cross-over orientation, and wherein and a second pair of polypeptides possess a single variable domain forming a single antigen binding site. In some embodiments, the binding proteins comprise a binding site that binds a CD28 polypeptide, a binding site that binds a CD3 polypeptide, and a binding site that binds a third polypeptide, such as a tumor target protein. In some embodiments, the binding proteins comprise four polypeptide chains that form three antigen binding sites that specifically bind one or more HIV target proteins. The disclosure also relates to methods for making trispecific and/or trivalent binding proteins and uses of such binding proteins.

Abstract: An SFC-based communications method and system, and an apparatus are provided. The SFC includes a CF node, an SFF node, and an SF node, and the SFF node is connected to the SF node. The method includes: receiving, by the CF node, a first message from the SFF node; obtaining, by the CF node, network topology information of the SFC based on the first message; obtaining, by the CF node, an SFC forwarding table, where the SFC forwarding table is determined based on the network topology information of the SFC; and sending, by the CF node to the SFF node, a second message used to indicate the SFC forwarding table. In this way, a network topology of the SFC can be flexibly and efficiently discovered.

Abstract: This application discloses a method for computing a forwarding path. The method includes: receiving, by a network device, notification packets separately sent by a plurality of forwarding nodes, where each notification packet includes interface forwarding delay information of the forwarding node that sends the notification packet, device forwarding delay information of the forwarding node, and a transmission delay of a link connected to the forwarding node; obtaining the interface forwarding delay information and the device forwarding delay information of each of the plurality of forwarding nodes, and obtaining a transmission delay of a link between the plurality of forwarding nodes; and computing a forwarding path between a first forwarding node and a second forwarding node, where a forwarding delay of the forwarding path meets a delay requirement of a service.

Abstract: An SFC-based communications method and system, and an apparatus are provided. The SFC includes a CF node, an SFF node, and an SF node, and the SFF node is connected to the SF node. The method includes: receiving, by the CF node, a first message from the SFF node; obtaining, by the CF node, network topology information of the SFC based on the first message; obtaining, by the CF node, an SFC forwarding table, where the SFC forwarding table is determined based on the network topology information of the SFC; and sending, by the CF node to the SFF node, a second message used to indicate the SFC forwarding table. In this way, a network topology of the SFC can be flexibly and efficiently discovered.

Abstract: The disclosure provides methods of treating viral infection using trispecific binding proteins comprising four polypeptide chains that form three antigen binding sites that specifically bind a CD38 polypeptide (e.g., human and/or cynomolgus monkey CD38 polypeptides), a CD28 polypeptide, and a CD3 polypeptide.

Abstract: The present disclosure relates to methods for selectively hydrogenating acetylene, to methods for starting up a selective hydrogenation reactor, and to hydrogenation catalysts useful in such methods. In one aspect, the disclosure provides a method for selectively hydrogenating acetylene, the method comprising contacting a catalyst composition with a process gas. The catalyst composition comprises a porous support, palladium, and one or more ionic liquids. The process gas includes ethylene, present in the process gas in an amount of at least 20 mol. %; and acetylene, present in the process gas in an amount of at least 1 ppm. At least 90% of the acetylene present in the process gas is hydrogenated, and the selective hydrogenation is conducted without thermal runaway. Notably, the process gas is contacted with the catalyst at a gas hourly space velocity (GHSV) based on total catalyst volume in one bed or multiple beds of at least 7,100 h?1.

Abstract: The present disclosure relates to methods for selectively hydrogenating acetylene, to methods for starting up a selective hydrogenation reactor, and to hydrogenation catalysts useful in such methods. In one aspect, the disclosure provides a variety of methods for starting up reactors for use in methods for selectively hydrogenating acetylene using a catalyst composition comprises a porous support, palladium, and one or more ionic liquids.

Abstract: The present disclosure relates to methods for selectively hydrogenating acetylene, to methods for starting up a selective hydrogenation reactor, and to hydrogenation catalysts useful in such methods. In one aspect, the disclosure provides a method for selectively hydrogenating acetylene, the method comprising contacting a catalyst composition with a process gas. The catalyst composition comprises a porous support, palladium, and one or more ionic liquids. The process gas includes ethylene, present in the process gas in an amount of at least 20 mol. %; acetylene, present in the process gas in an amount of at least 1 ppm; and 0 to 190 ppm or at least 600 ppm carbon monoxide. At least 90% of the acetylene present in the process gas is hydrogenated, and the selective hydrogenation is conducted without thermal runaway.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for generating and manipulating an index for a table in a database. A query statement is received, the table of lines are searched, a result list is generated, and an index for the query statement is generated, wherein the index comprises information associated with the result list and the query condition. The query condition and the identifier of the table is extracted from the query statement, where the index is generated based on the query condition, the identifier of the table, and the result list. A hash value of the identifier of the table and the query condition is obtained, an association between the hash value and the result list to build the index is generated, and in response to a line of the plurality of lines in the table being modified, the index identified as invalid.

Abstract: Provided herein are compositions comprising trispecific and/or trivalent binding proteins comprising four polypeptide chains that form three antigen binding sites that specifically bind one or more HIV target proteins or one or more T-cell receptors, wherein a first pair of polypeptides forming the binding protein possess dual variable domains having a cross-over orientation and wherein a second pair of polypeptides forming the binding protein possess a single variable domain. Also provided herein are methods for making trispecific and/or trivalent binding proteins and uses of such binding proteins for the treatment and/or prevention of HIV/AIDS.

Abstract: There is provided a communication device capable of determining whether admission of new data traffic is allowed or rejected not by comparing throughputs only, but by considering other parameters when the data traffic is admitted. A communication device (10) according to the present invention includes a determination unit (11) that determines whether to admit a flow regarding a new radio terminal (30), the flow being to be transmitted between a radio terminal (30) and a base station (20) and having a transmission deadline, depending on a transmission state of a plurality of data packets included in the flow, and a communication unit (12) that transmits, to the base station (20), instruction information indicating whether to admit the flow regarding the new radio terminal (30).

Abstract: An object is to provide a communication apparatus which can perform efficient scheduling for finishing data transmission of a plurality of UEs within a permitted delay time. A communication apparatus (10) according to the present invention includes: a selecting unit (11) configured to select a wireless terminal (30) which is an allocation target of radio resources according to a time to a transmission deadline of a flow related to each of the wireless terminals (30); an allocating unit (12) configured to determine radio resources allocated to the selected wireless terminal (30) so as to maximize use efficiency of the radio resources included in a control cycle including a plurality of unit times; and a communication unit (13) configured to transmit information related to the determined radio resource to a base station (20) configured to perform wireless communication with the selected wireless terminal (30).

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for generating and manipulating an index for a table in a database. A query statement is received, the table of lines are searched, a result list is generated, and an index for the query statement is generated, wherein the index comprises information associated with the result list and the query condition. The query condition and the identifier of the table is extracted from the query statement, where the index is generated based on the query condition, the identifier of the table, and the result list. A hash value of the identifier of the table and the query condition is obtained, an association between the hash value and the result list to build the index is generated, and in response to a line of the plurality of lines in the table being modified, the index identified as invalid.

Abstract: A network entity (5) sends, to a mobility management entity (6) or a subscriber server (9), a request message in order to configure the mobility management entity (6) to report a second identifier to be used by a radio access network node (2) for identifying a radio terminal (1). Further, the network entity (5) receives the second identifier from the mobility management entity (6) directly or through the subscriber server (9) and communicates with the radio access network node (2) by using the second identifier. It is thus, for example, possible to allow an MEC server (or an MEC application hosted on the MEC server) and the radio access network (RAN) node to directly exchange therebetween control messages regarding a specific radio terminal.

Abstract: A method for synchronizing topology information in a service function chain (SFC) network, where the SFC network includes at least one classifier (CF) and at least one service function forwarder (SFF). The method includes that a first network element in the at least two routing network elements establishes a Border Gateway Protocol (BGP) connection to at least one second network element other than the first network element in the at least two routing network elements, where the first network element is any one of the at least two routing network elements, and the first network element sends a first BGP update message to the at least one second network element, where the first BGP update message includes topology information of the first network element such that the at least one second network element obtains the topology information of the first network element.

Abstract: This application discloses a method for computing a forwarding path. The method includes: receiving, by a network device, notification packets separately sent by a plurality of forwarding nodes, where each notification packet includes interface forwarding delay information of the forwarding node that sends the notification packet, device forwarding delay information of the forwarding node, and a transmission delay of a link connected to the forwarding node; obtaining the interface forwarding delay information and the device forwarding delay information of each of the plurality of forwarding nodes, and obtaining a transmission delay of a link between the plurality of forwarding nodes; and computing a forwarding path between a first forwarding node and a second forwarding node, where a forwarding delay of the forwarding path meets a delay requirement of a service.

Abstract: The disclosure provides binding proteins that bind CD38 polypeptides, e.g., human and cynomolgus monkey CD38 polypeptides. For example, the binding proteins can be monospecific, bispecific, or trispecific binding proteins with at least one antigen binding domain that binds a CD38 polypeptide. The disclosure also provides methods for making binding proteins that bind CD38 polypeptides and uses of such binding proteins.

Abstract: An external node (5) receives a transmission history (1301) regarding a first communication event of a first radio terminal (1) from a node (2) located in a radio access network (3). The external node (5) transmits to the node (2) a control request (1302) to control at least one of: a communication module (521) disposed in the node (2) for communicating with the external node (5); a scheduler (503, 903) disposed in the node (2); a data buffer (502, 11) disposed in the node (2) or the first radio terminal (1); and the first radio terminal (1). It is thus, for example, possible to contribute to an improvement for adapting packet scheduling to communication performed by an application of a radio terminal.

Abstract: An external node (5) determines a total size of a plurality of data packets to be transmitted in a first communication event of a first radio terminal (1) and a transmission deadline for the plurality of data packets. The external node (5) transmits the determined total size and transmission deadline to a node (2) in a radio access network (3) (201). It is thus, for example, possible to contribute to an improvement for adapting packet scheduling to communication performed by an application of a radio terminal.

Abstract: Provided herein are compositions comprising trispecific and/or trivalent binding proteins comprising four polypeptide chains that form three antigen binding sites that specifically bind one or more HIV target proteins or one or more T-cell receptors, where in a first pair of polypeptides forming the binding protein possess dual variable domains having a cross-over orientation and wherein a second pair of polypeptides forming the binding protein possess a single variable domain. Also provided herein are methods for making trispecific and/or trivalent binding proteins and uses of such binding proteins for the treatment and/or prevention of HIV/AIDS.