Abstract: The present invention provides an ?-type titanium alloy, the fracture toughness and thermal creep resistance of the prepared ?-type titanium alloy are improved by controlling the content of Al, Zr, and Sn. The room temperature strength is improved by adding a certain amount of Si, and the thermal creep resistance is further improved. The addition of a certain amount of C and Cr improves the high-temperature tensile properties of the prepared ?-type titanium alloy. The method provided by the invention has a simple process and low cost and can achieve good matching of low cost, high performance, and less processing capacity. The prepared ?-type titanium alloy in example 1˜4 of the invention has an elastic modulus of 124˜132 GPa, a tensile strength of 867˜881 MPa, a yield strength of 743˜762 MPa, an elongation of 22%˜24.0%, and a section shrinkage of 47%˜51% at 600° C.

Abstract: Disclosed are a cutter assembly and a fruit and vegetable cutter using the cutter assembly. The cutter assembly includes a rotating shaft assembly, a forward-rotating blade and a counter-rotating blade. The rotating shaft assembly has a first mandrel and a first outer shaft. The end of the first mandrel and the end of the first outer shaft are each provided with a first transmission part coupled to a drive device; the blades are respectively arranged in the shaft assembly and perpendicular to the rotating shaft assembly; one blade is coupled to the first mandrel, and the other is coupled with the first outer shaft, so that the blades can be driven by the rotating shaft assembly to rotate in two opposite directions at the same time. The fruit and vegetable cutter includes a fruit and vegetable cavity, the cutter assembly and a driving device for driving the cutter assembly.

Abstract: Disclosed are a cutter assembly and a fruit and vegetable cutter using the cutter assembly. The cutter assembly includes a rotating shaft assembly, a forward-rotating blade and a counter-rotating blade. The rotating shaft assembly has a first mandrel and a first outer shaft. The end of the first mandrel and the end of the first outer shaft are each provided with a first transmission part coupled to a drive device; the blades are respectively arranged in the shaft assembly and perpendicular to the rotating shaft assembly; one blade is coupled to the first mandrel, and the other is coupled with the first outer shaft, so that the blades can be driven by the rotating shaft assembly to rotate in two opposite directions at the same time. The fruit and vegetable cutter includes a fruit and vegetable cavity, the cutter assembly and a driving device for driving the cutter assembly.

Abstract: System and methods are disclosed for configuring the sharing of resource pools and individual resources in the resource groups among enterprise communication systems. In certain embodiments, the resource pools are trunk groups and the individual resources that comprise the trunk groups are communication resources. Digital PBXs components associated with different enterprise communication systems are registered and assigned shared use of a trunk group. Communication services are provided to the digital PBXs using the channels of the shared trunk group. Each enterprise may reserve channels within the trunk group for exclusive use by the enterprise, while sharing use of other channels in the trunk group. Each enterprise can be guaranteed a minimum calling capacity while providing improved resource utilization due to fewer idle communication channels.

Abstract: System and methods are disclosed for configuring the sharing of resource pools and individual resources in the resource groups among enterprise communication systems. In certain embodiments, the resource pools are trunk groups and the individual resources that comprise the trunk groups are communication resources. Digital PBXs components associated with different enterprise communication systems are registered and assigned shared use of a trunk group. Communication services are provided to the digital PBXs using the channels of the shared trunk group. Each enterprise may reserve channels within the trunk group for exclusive use by the enterprise, while sharing use of other channels in the trunk group. Each enterprise can be guaranteed a minimum calling capacity while providing improved resource utilization due to fewer idle communication channels.

Abstract: A method includes establishing a first call from a first party to a second party; during a ringing status of the first call, cancelling the first call in response to an indication that the first party wishes to transfer the first call; and establishing a second call from a third party to the second party, where a message to establish the second call includes information identifying the third party.

Abstract: A method includes establishing a first call from a first party to a second party; during a ringing status of the first call, cancelling the first call in response to an indication that the first party wishes to transfer the first call; and establishing a second call from a third party to the second party, where a message to establish the second call includes information identifying the third party.

Abstract: The present invention provides a solution to maximize the chance of completion for an ISUP to SIP direction call by enabling a bigger factor for converting ISUP hop counter to SIP Max-Forwards value than the reverse direction thus enabling more hops in the SIP network. Enabling a bigger factor for ISUP to SIP direction can cause loops without special considerations. This invention provides an algorithm that prevents a “loop condition” that can arise at the interface boundary of two telephone networks, known by their standard names 1SUP and SIP networks. The present invention solves the “loop condition” problem by adjusting the Hop Counter and Max-Forward parameter values in a predetermined manner such that the adjusted parameter values break the cycle of providing the same parameter values between networks at the network boundary for an uncompleted connection, or break an endless “loop condition”.

Abstract: The present invention provides a solution to maximize the chance of completion for an ISUP to SIP direction call by enabling a bigger factor for converting ISUP hop counter to SIP Max-Forwards value than the reverse direction thus enabling more hops in the SIP network. Enabling a bigger factor for ISUP to SIP direction can cause loops without special considerations. This invention provides an algorithm that prevents a “loop condition” that can arise at the interface boundary of two telephone networks, known by their standard names 1SUP and SIP networks. The present invention solves the “loop condition” problem by adjusting the Hop Counter and Max-Forward parameter values in a predetermined manner such that the adjusted parameter values break the cycle of providing the same parameter values between networks at the network boundary for an uncompleted connection, or break an endless “loop condition”.

Abstract: The present invention provides a solution to maximize the chance of completion for an ISUP to SIP direction call by enabling a bigger factor for converting ISUP hop counter to SIP Max-Forwards value than the reverse direction thus enabling more hops in the SIP network. Enabling a bigger factor for ISUP to SIP direction can cause loops without special considerations. This invention provides an algorithm that prevents a “loop condition” that can arise at the interface boundary of two telephone networks, known by their standard names ISUP and SIP networks. The present invention solves the “loop condition” problem by adjusting the Hop Counter and Max-Forward parameter values in a predetermined manner such that the adjusted parameter values break the cycle of providing the same parameter values between networks at the network boundary for an uncompleted connection, or break an endless “loop condition”.

Abstract: The present invention provides a solution to maximize the chance of completion for an ISUP to SIP direction call by enabling a bigger factor for converting ISUP hop counter to SIP Max-Forwards value than the reverse direction thus enabling more hops in the SIP network. Enabling a bigger factor for ISUP to SIP direction can cause loops without special considerations. This invention provides an algorithm that prevents a “loop condition” that can arise at the interface boundary of two telephone networks, known by their standard names ISUP and SIP networks. The present invention solves the “loop condition” problem by adjusting the Hop Counter and Max-Forward parameter values in a predetermined manner such that the adjusted parameter values break the cycle of providing the same parameter values between networks at the network boundary for an uncompleted connection, or break an endless “loop condition”.

Abstract: Techniques for implementing logical trunk groups with session initiation protocol (SIP) are disclosed. In one particular exemplary embodiment, the techniques may be realized as an apparatus for implementing logical trunk groups with session initiation protocol (SIP). The apparatus may comprise a first network device and a second network device that are configured to exchange SIP signaling messages. Network traffic between the first network device and the second network device may be segregated into one or more logical groups. The SIP signaling messages associated with each logical group may include a Route header that uniquely identifies the logical group between the first network device and the second network device.

Abstract: A method for processing calls in a packet network using peer call servers includes receiving a setup message from a first gateway in the packet network. The setup message includes a first address for a called endpoint. The call server that receives the setup message translates the message into a call server ID and an endpoint ID specifying the remote call server corresponding to the called party. The call server sends the call server ID and the endpoint ID to the remote call server. The remote call server obtains a call signaling transport address to the called end user based in the endpoint ID.

Abstract: Techniques for implementing logical trunk groups with session initiation protocol (SIP) are disclosed. In one particular exemplary embodiment, the techniques may be realized as an apparatus for implementing logical trunk groups with session initiation protocol (SIP). The apparatus may comprise a first network device and a second network device that are configured to exchange SIP signaling messages. Network traffic between the first network device and the second network device may be segregated into one or more logical groups. The SIP signaling messages associated with each logical group may include a Route header that uniquely identifies the logical group between the first network device and the second network device.