摘要:
A method for learning latent representations of individual users in a personalization system uses a graph-based machine learning framework. A graph representation is generated based on input data in which the individual users are each represented by a node. The nodes are associated with labels. Node vector representations are learned by combining label latent representations from a vertex and neighboring nodes so as to reconstruct the label latent representation of the vertex and updating the label latent representations of the neighboring nodes using gradients resulting from application of a reconstruction loss. A classifier/regressor is trained using the node vector representations and the node vector representations are mapped to personalizations. Actions associated with the personalizations are then initiated.
摘要:
A search engine for finding objects that correspond to a search request, including an input module for receiving a keyword query from a user, and a search module being configured to map the keyword query to the identifiers of objects that semantically match the keyword or the plurality of keywords contained in the keyword query, and to generate a search result that contains a listing of matching object identifiers, is characterized in that the search module is further configured to generate the search result by considering network layer information about the user within the process of mapping the keyword query to identifiers of matching objects, wherein the network layer information include sophisticated information the search module receives from a dedicated entity.
摘要:
A method for byzantine fault tolerant data replication with a plurality of 2f+1 data servers and one or more clients includes storing data in at least f+1 different data servers out of the 2f+1 data servers, and storing metadata of the stored data under a metadata-identifier in a metadata-service (MDS). The stored metadata includes a unique identifier of the stored data, a fingerprint of the stored data, and a list of the at least f+1 different data servers which have stored the data.
摘要:
A method for performing distributed geographic event processing includes: defining a geographical state system for a universe of locations that includes a model specifying a state transition function and a global aggregation function; providing a local state system for a subset of the universe of locations being defined as a single-machine implementation of the geographical state system; providing a local aggregation function being defined as an implementation of the global aggregation function of the geographical state system; and creating, via a processor, distributed scalable deployments that implement the geographical state system by dividing the universe of locations geographically among different computational nodes and by instantiating on each of the computational nodes an instance of the local state system and the local aggregation function conforming to the subset of the universe of locations assigned to the respective computational node.
摘要:
Method for operating a wireless network, wherein at least one MIMO (Multiple Input Multiple Output) group of different stations will be constructed by a grouping algorithm based on a grouping metric for providing a MIMO group of different stations addressable simultaneously in space by a base station using MIMO techniques and meeting a definable level of performance quality, the grouping metric being based on an SINR (Signal-to-Interference and Noise Ratio) experienced by each station within the MIMO group. The method includes: computing an SNR (Signal-to-Noise Ratio) that a new station would experience without any interference when added to an existing MIMO group; computing an SINR estimate by correcting the SNR with the sum of spatial correlations between the new and each of the stations already present in the existing MIMO group; and using the SINR estimate for deciding whether the new station can be added to the existing MIMO group.
摘要:
For providing a simple monitoring mechanism with reduced resource and performance requirements a method for monitoring traffic in a network is claimed, wherein a monitoring activity of at least two monitoring probes of the network is coordinated by a coordinating element, wherein at least two nodes of the network are able to operate as coordinating elements and wherein the responsibility for coordinating the monitoring activity of the monitoring probes is split between the nodes according to a compressed representation of flow parameter keys. Further, an according network is described, preferably for carrying out the above mentioned method.
摘要:
A method for distributing user equipment context in an evolved packet system, including a plurality of user equipment, at least one eNodeB, a first mobility management entity and a second mobility management entity and one serving gateway connected to the first and second mobility management entity, the plurality of user equipment being connected via one of the eNodeBs to the second mobility management entity and to the serving gateway, wherein the user equipment context for the plurality of user equipment is each stored at the second mobility management entity, includes: a) transferring bulk user equipment context for the plurality of user equipment context, each having a mobility management entity code, to the first mobility management entity, b) reconfiguring the mobility management entity codes, c) storing the transferred user equipment context in the first mobility management entity, and d) transferring reconfigured mobility management entity codes to the at least one eNodeB.
摘要:
A method of assembling a frame in an Orthogonal Frequency Division Multiple Access (OFDMA)-based communication system, wherein data packets to be transmitted from a broadcast station to a receiver are given a rectangular shape in terms of the two dimensions—time and frequency—of the OFDMA frame, and wherein the data packets are successively fitted into the OFDMA frame by way of a frame assembly scheduler, is characterized in that the filling process of the OFDMA frame is based on an ordered list of data structures that represent the current empty space within the OFDMA frame. Furthermore, a corresponding communication system is disclosed.
摘要:
A method for probabilistic processing of data, wherein the data is provided in form of a data set S composed of multidimensional n-tuples of the form (x1, . . . , xn), is characterized in that an n-dimensional data structure is generated by way of providing a bit matrix, providing a number K of independent hash functions Hk that are employed in order to address the bits in the matrix, and inserting the n-tuples (x1, . . . , xn) into the bit matrix by computing the hash values Hk(x) for all values x of the n-tuple for each of the number K of independent hash functions Hk, and by setting the resulting bits [Hk(x1), . . . , Hk(xn)] of the matrix. Furthermore, a respective system is disclosed.
摘要:
For allowing a very flexible scheduling of data flows within an OpenFlow (OF) switch a method for operating an OpenFlow switch within a network includes using the OpenFlow switch to direct arriving data flows out of different ports of the OpenFlow switch. The method is characterized in that a scheduling mechanism for performing at least one scheduling task is assigned to the OpenFlow switch, wherein a metric will be used to assign weights to the arriving data flows and wherein the data flows will then be scheduled based on the assigned weights and based on a scheduling policy. Further, a corresponding OpenFlow switch and a corresponding network are described, preferably for carrying out the above mentioned method.