Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Based on dynamic research perspectives of time slicing, this paper shows an endeavor on mining dynamic features of the scientific teams. Traditionally the static method of network structure analysis can successfully be used to analyze the distribution of network resource structure. But it cannot be used to explore the dynamic features of research groups, because of its lacks on the influence of some...
XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees is one of the important methods to obtain the excellent management of XML data. Previous labeling schemes such as region and prefix often sacrifice updating performance and suffer increasing...
Revocable hierarchical identity-based encryption (RHIBE) is a good candidate encryption for secure wireless communications. Its dynamic user management through the hierarchical key generation and revocation is efficient. Most existing RHIBEs are bounded which have to fix the maximum hierarchical depth of users at setup. In this paper, we propose the first unbounded and adaptively-ID secure RHIBE called...
With the social network being widely used, people would like to use the friends recommendation provided by a social websites. There are lots of methods to make the recommendation results more accurately and efficiently. By considering the feature selection strategy in the stage of data preprocessing, we propose a novel friend recommendation system using a classification model, which formulates the...
Online social networks (OSN) have become more and more popular and have accumulated a great many users. Friend recommendation can help users discover their interested friends and alleviate the problem of information overload. However, most of existing recommendation methods only consider user link or content information and hence are not effective enough to provide high quality recommendations. In...
The paper studies a method for recommendation based on community partition applying for user in social network. Firstly, the largest connected component in friend-relationship complex network are taken as the logic unit, and divide up the largest connected component into non-intersect kernel sub-network, the kernel sub-network based on The maximum complete sub-graph which has the mathematics foundation...
According to the algorithms based on Gaussian assumption are not accurate due to the presence of non-Gaussian signals and noise in the real environment. In this paper, a non-Gaussian noise model based on alpha stable distribution is set, and a time-delay estimation algorithm based on fractional lower order statistics is studied, where fractional lower order covariance matrix makes the time-delay estimation...
For the data sparsity and malicious behavior problems of traditional collaborative filtering algorithm, the paper introduces a new kind of social network-based collaborative filtering algorithm. In order to improve the accuracy of the personalized recommendation technology, we first define empty state in the state space of multi-dimensional semi-Markov processes and obtain extended multi-dimensional...
Social networks are very dynamic objects, since new edges and vertices are added to the graph over the time. Link prediction is an important task in social network analysis and is useful in many application domains. In the recent years, there is significant interest in methods that represent the social network in the form of a graph and leverage topological and semantic measures of similarity between...
It has attracted extensive interests to discover knowledge from data streams generated in real-time. At present, there are some data streams mining frameworks, providing mining solutions for data streams. This paper proposes an on-demand framework (SRAStream) based on the concept drifting detection. SRAStream allows quick clustering with certain accuracy using only limited resource, enabling the real-time...
When using the standard particle swarm optimization to optimize the complex problems with high dimension, low convergence efficiency and falling into local optimization usually occur because of its inherent disadvantages. To avoid these disadvantages, a novel hybrid particle swarm optimization improved by mutative scale chaos method is proposed in this paper. This hybrid algorithm combines global...
Broadcast is very important for delivering messages in wireless sensor networks. In order to improve the efficiency of broadcast and reduce energy consumption, it is necessary to construct a virtual backbone within the entire network. Constructing a virtual backbone is identical with calculating connected dominating set. 1-hop neighbor node transmission coverage information is used to calculate the...
Ice coating in power networks could result in power-tower collapse and power interruption. This paper introduces a preliminary design of deicing robot, which travels on transmission lines and automatically remove ices. Inevitably, the deicing robot will encounter some obstacles. To cross an obstacle, the deicing robot needs to control its arms to grasp transmission line over the obstacle. In this...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.