A growing number of mobile nodes that require Internet access is observed. These nodes may be organized in a wireless mesh network in which some of the nodes may serve the access to the Internet and relay other users’ traffic. Such a vision, however, causes the need for carrier-grade reliable Internet sharing solution. This paper presents a CARMNET-XML protocol, which enables to provide Authentication, Authorisation and Accounting AAA functionalities in wireless mesh networks managed by the Delay-Aware Network Utility Maximization System (DANUMS). The presented solution is a part of a CARMNET system, which integrates the utility-oriented resource allocation provided by DANUMS with the IMS architecture. The system allows users to access Internet with a given quality without the need of extending the operator’s infrastructure. Moreover, we define the scenario of the system application involving the use of the proposed protocol that has been experimentally evaluated in a wireless testbed environment.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We propose a novel model of multilinear filtering based on a hierarchical structure of covariance matrices – each matrix being extracted from the input tensor in accordance to a specific set-theoretic model of data generalization, such as derivation of expectation values. The experimental analysis results presented in this paper confirm that the investigated approaches to tensor-based data representation and processing outperform the standard collaborative filtering approach in the ‘cold-start’ personalized recommendation scenario (of very sparse input data). Furthermore, it has been shown that the proposed method is superior to standard tensor-based frameworks such as N-way Random Indexing (NRI) and Higher-Order Singular Value Decomposition (HOSVD) in terms of both the AUROC measure and computation time.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Widely-referenced approaches to collaborative filtering (CF) are based on the use of an input matrix that represents each user profile as a vector in a space of items and each item as a vector in a space of users. When the behavioral input data have the form of (userX, likes, itemY) and (userX, dislikes, itemY) triples one has to propose a representation of the user feedback data that is more suitable for the use of propositional data than the ordinary user-item ratings matrix. We propose to use an element-fact matrix, in which columns represent RDF-like behavioral data triples and rows represent users, items, and relations. By following such a triple-based approach to the bi-relational behavioral data representation we are able to improve the quality of collaborative filtering. One of the key findings of the research presented in this paper is that the proposed bi-relational behavioral data representation, while combined with reflective matrix processing, significantly outperforms state-of-the-art collaborative filtering methods based on the use of a ‘standard’ user-item matrix.
Nowadays, due to emergence of cloud services, even the basic uses of personal computers may require the access to the Internet. In this paper modifications to Delay-Aware Network Utility Maximization System (DANUMS) are presented, which enable it to be deployed in an internetwork environment. The proposed solution consists of DANUMS and WiOptiMo systems, which cooperate by exchanging measurements of transmitted traffic in order to improve the network utility. Additionally, WiOptiMo enhances mobility by providing facilities for soft handover. Experiments presented in this paper illustrate the benefits gained from the integrated system application.
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We propose a collaborative filtering (CF) method that uses behavioral data provided as propositions having the RDF-compliant form of (user X, likes, item Y ) triples. The method involves the application of a novel self-configuration technique for the generation of vector-space representations optimized from the information-theoretic perspective. The method, referred to as Holistic Probabilistic Modus Ponendo Ponens (HPMPP), enables reasoning about the likelihood of unknown facts. The proposed vector-space graph representation model is based on the probabilistic apparatus of quantum Information Retrieval and on the compatibility of all operators representing subjects, predicates, objects and facts. The dual graph-vector representation of the available propositional data enables the entropy-reducing transformation and supports the compositionality of mutually compatible representations. As shown in the experiments presented in the paper, the compositionality of the vector-space representations allows an HPMPP-based recommendation system to identify which of the unknown facts having the triple form (user X, likes, item Y ) are the most likely to be true in a way that is both effective and, in contrast to methods proposed so far, fully automatic.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.