Abstract: A computer-implemented method of providing matching information to prospective first and second users is performed at a server, the method including: receiving first audio data and first user information; receiving second audio data, and second user information; storing a first timestamp of the first audio data and first user information and a second timestamp of the second audio data and second user information; performing analysis processing on the first audio data to obtain first feature information, and performing analysis processing on the second audio data to obtain second feature information; judging whether the first timestamp and the second timestamp and the first feature information and the second feature information match; and if the first and second times of receipt and the first and second feature information match, sending the first user information to the second user and sending, by the server, the second user information to the first user.

Abstract: This invention relates to an artificial salt tolerant protein NLEA with the amino acid sequence shown in SEQ ID No.1 and a synthetic method of salt tolerant protein NLEA comprising the steps of retrieving different types of LEA proteins from LEA database; making multiple sequence alignment on different types of LEA proteins to obtain conserved short peptides; selecting hydrophilic short peptides with a hydrophilicity index higher than 3.5 from conserved short peptides; arranging and splicing hydrophilic short peptides in the order of isoelectric point size from large to small, to obtain salt tolerant protein NLEA. This invention involves bioinformatics analysis by retrieving different LEA conserved amino acid sequences of LEA protein data. Physical properties are analyzed to find short peptides of high hydrophilicity, and such short peptides are arranged in the order of isoelectric point size and spliced to get a new hydrophilic amino acid sequence.

Abstract: A method of providing information to a prospective user is performed at a server having one or more processors and memory storing programs to be executed by the processors, the method including receiving audio feature information and location information from a client device, wherein the audio feature information is extracted from an audio signal received by the client device and the location information identifies a current location of the client device; comparing predefined audio feature information with the received audio feature information and comparing predefined location information with the received location information; and pushing predefined information to the client device from the server if there is a match of both comparisons made at the server.

Abstract: A computer-implemented method of providing matching information to prospective first and second users is performed at a server, the method including: receiving first audio data and first user information; receiving second audio data, and second user information; storing a first timestamp of the first audio data and first user information and a second timestamp of the second audio data and second user information; performing analysis processing on the first audio data to obtain first feature information, and performing analysis processing on the second audio data to obtain second feature information; judging whether the first timestamp and the second timestamp and the first feature information and the second feature information match; and if the first and second times of receipt and the first and second feature information match, sending the first user information to the second user and sending, by the server, the second user information to the first user.

Abstract: A computer-implemented method of providing matching information to prospective first and second users is performed at a server, the method including: receiving first audio data and first user information; receiving second audio data, and second user information; storing a first timestamp of the first audio data and first user information and a second timestamp of the second audio data and second user information; performing analysis processing on the first audio data to obtain first feature information, and performing analysis processing on the second audio data to obtain second feature information; judging whether the first timestamp and the second timestamp and the first feature information and the second feature information match; and if the first and second times of receipt and the first and second feature information match, sending the first user information to the second user and sending, by the server, the second user information to the first user.

Abstract: The disclosure discloses a method and device for storing data. In the method, a request message is initiated to a network side device, and network data to be cached are acquired; and one or more cache entity objects are selected for the network data from a cache entity object set, and acquired first-type network data are directly stored into the one or more cache entity objects, or, serialized second-type network data are stored into the one or more cache entity objects. According to the technical solutions provided by the disclosure, dependence on a network can be further reduced, and traffic of a network and electric quantity of mobile terminals can be saved.

Abstract: An application packaging device and method are provided. The method includes: an installation package of an application is unzipped; each piece of channel information is respectively extracted from multiple pieces of acquired channel information; and packaging is performed according to each piece of extracted channel information and the unzipped installation package respectively to generate multiple installation packages respectively corresponding to each piece of channel information. The present invention solves the problem that the process of multi-channel packaging of the installation package of the application is tedious, increases the efficiency of the multi-channel packaging, and improves the user experience.

Abstract: Methods and systems are disclosed for anonymizing a dataset that correlates a set of entities with respective attributes. The method comprises determine clusters of similar entities. Determining the clusters comprises (1) partitioning the entities into a first group with similar attributes to one another and a complement group of entities with similar attributes to one another and (2) recursively repeating the partitioning on the groups until every group meets one or more criteria. The partitioning a group comprises choosing a reference entity from the group, determining a symmetric set of attributes based on the reference entity attributes and on an average of the group's attributes, and assigning each entity to the first or second group depending on whether its attributes are more similar to those of the reference user or to those of the symmetric set.

Abstract: A method of providing information to a prospective user is performed at a server having one or more processors and memory storing programs to be executed by the processors, the method including receiving audio feature information and location information from a client device, wherein the audio feature information is extracted from an audio signal received by the client device and the location information identifies a current location of the client device; comparing predefined audio feature information with the received audio feature information and comparing predefined location information with the received location information; and pushing predefined information to the client device from the server if there is a match of both comparisons made at the server.

Abstract: A computer-implemented method of providing matching information to prospective first and second users is performed at a server, the method including: receiving first audio data and first user information; receiving second audio data, and second user information; storing a first timestamp of the first audio data and first user information and a second timestamp of the second audio data and second user information; performing analysis processing on the first audio data to obtain first feature information, and performing analysis processing on the second audio data to obtain second feature information; judging whether the first timestamp and the second timestamp and the first feature information and the second feature information match; and if the first and second times of receipt and the first and second feature information match, sending the first user information to the second user and sending, by the server, the second user information to the first user.

Abstract: Methods and systems are disclosed for anonymizing a dataset that correlates a set of entities with respective attributes. The method comprises determine clusters of similar entities. Determining the clusters comprises (1) partitioning the entities into a first group with similar attributes to one another and a complement group of entities with similar attributes to one another and (2) recursively repeating the partitioning on the groups until every group meets one or more criteria. The partitioning a group comprises choosing a reference entity from the group, determining a symmetric set of attributes based on the reference entity attributes and on an average of the group's attributes, and assigning each entity to the first or second group depending on whether it's attributes are more similar to those of the reference user or to those of the symmetric set.

Abstract: A connection oriented switch, for example, an ATM switch, achieves scalable performance and enhanced reliability through a call processing architecture in which call processing functions are distributed to each network interface module rather than centralized in a call control module. Each network interface module has its own dedicated processor module that performs certain call processing tasks to off-load the processing burden from the call control module. Depending on the degree of processing power distribution, three embodiments include a distributed signaling architecture, a distributed call control architecture, and a distributed routing architecture.

Abstract: An improved packet delay estimation method results from an indirect measurement method that employs an estimation method based on sampled lengths of queues and measured traffic. A complex system of queues sharing the same constant rate server and driven by a non-trivial scheduling scheme is split into logical clusters of queues. The method estimates packet delay based on a two-level approximation. On the first level of approximation, effects of the fact that the server is shared by other clusters is approximated by an equivalent reduction of the service rate. On the second level of approximation, individual queue lengths within a cluster are sampled and, based on the knowledge of the scheduling discipline, used to obtain the upper and lower bounds on the occupancy of the equivalent FIFO buffer. Estimate of the delay is found based on the effective buffer occupancy, and the effective service capacity.

Abstract: A simple and efficient method for packet loss measurement in high-speed switches is achieved by identifying traffic flows in the ingress side of switches, and measuring packets losses for the identifies flows on the egress side of the switches. Specifically, on the ingress side of the switch, the last packet of each fixed size incoming packet block is marked to make it distinct from other packets in the block. On the egress side, the packet flow is monitored and the packets are counted using the block size as a counting modulo. The value of this counter at the receipt of a marked packets is used to update the number of packets that do not make their way across the switch. The method is applicable to multicast as well as to unicast packets. This method is simple in that it only requires two marking counters per distinct flow, one at ingress and one at egress, and two other counters at the egress per each measured flow.

Abstract: In an asynchronous transfer mode (ATM) communications system, all ATM switches in a multicast connection perform virtual path (VP) switching except those merge points which perform virtual channel (VC) switching to avoid VCI collisions. The merge points are ATM switches which can merge ATM traffic from at least two incoming links into an outgoing link. In a second approach, each merge point in a multicast connection performs VP switching, and dynamically dispenses VC switching when a VCI collision is detected. Specifically, to prevent further VCI collision, incoming ATM cells indicated by an odd VPI value are VC switched by the merge point while those indicated by an even VPI value are VP switched thereby.

Abstract: A method for allocating a fair bit rate for an ABR service. Forward and backward RM cells traversing a link 1 are received at an ATM switch. Both the forward and backward RM cells are associated with a session, with the forward RM cells being transmitted from a source to a destination and the backward RM cells being transmitted from the destination to the source. An advertised rate .gamma..sub.l for link 1 is updated when a backward RM cell associated the session is received based on a change in a bottleneck bandwidth .DELTA..lambda. of the session and a change in a bottleneck status .DELTA..beta. of the session. The explicit rate .lambda..sup.ER contained in the backward RM cell is rewritten as a minimum of the advertised rate .gamma..sub.l and the explicit rate .lambda..sup.ER. The backward RM cell is then transmitted to the source of the RM cell.

Abstract: The distribution of multicast information in a communications network formed from a plurality of communications nodes, e.g., ATM switches, is enhanced by providing an efficient mechanism for routing a request to join a multicast connection to an originator of the multicast and an efficient mechanism for then connecting the requester to the multicast connection.

Abstract: The present invention extends the PNNI protocols to support hierarchical multicast routing and signaling for ATM networks. The invention utilizes an extension to a core-based tree algorithm. Instead of a single core node, core nodes are maintained in each peer-group and at each level of the hierarchy. The advantage of this is that one single core node is not overloaded. Additionally, this increases fault-tolerance because there are no single points of failure. As would be understood, the present invention is highly scaleable because of the hierarchical nature of PNNI. In addition, the scheme supports multiple senders and dynamic membership changes to the multicast group. Quality of service requirements can be negotiated during connection setup and are guaranteed during the course of the connection. Though some additional topological information has to be flooded in the peer-groups to compute efficient multicast routes, the overheads to the connection management are minimal.

Abstract: An apparatus and method is described for multicasting an inlet data cell, received as part of a multicast request, through a self-routing multistage routing network by decomposing the multicast request into one or more intermediate multicast requests, each intermediate multicast request being a unique subset of the original multicast request which enables a non-blocking, self-routing distribution to a subset of the desired outlets of the original multicast request in one or two passes through the network, and by generating a non-blocking multicast tree based on the intermediate multicast requests and routing the received inlet data cell to the desired outlets. The invention decomposes the original multicast request and generates a non-blocking multicast tree using a cube routing algorithm, a copy routing algorithm, or a combined routing algorithm, which is a combination of the copy and cube routing algorithms.

Abstract: An apparatus and method is described for multicasting an inlet data cell, received as part of a multicast request, through a self-routing multistage routing network. Two algorithms are disclosed which use at most three passes to perform any arbitrary multicast. In the first pass, data is usually routed from the source to a set of consecutive outputs. These outputs are used as inputs in the second pass for routing to the destination cubes, and in some cases, a third pass can be used to route the remaining cubes. Since these cubes constitute a partition of the original multicast set, the multicast is completed when each of the cubes has been successfully routed. The routing algorithms guarantee that those cubes used in each pass through the network do not have internal blocking. The criterion to select a multicast routing algorithm for a particular application is to keep a appropriate balance between the control simplicity, the number of passes and the number of internal links used by the algorithm.