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.
This paper addresses the problem of accounting for confounding factors and expression quantitative trait loci (eQTL) mapping in the study of SNP-gene associations. The existing convex penalty based algorithm has limited capacity to keep main information of matrix in the process of reducing matrix rank. We present an algorithm, which use nonconvex penalty based low-rank representation to account for...
Due to the rapid growth of event-based social networks (EBSNs), event recommendation which helps users find their preferred events has become a popular topic. Different from movies or books in conventional recommendation problem, events usually have recommendation lifetimes and almost all the events to be recommended are upcoming, which brings a severe cold start problem. To achieve better event recommendation...
The smartphone applications have taken place of the web browser and became the user's primary internet entrance. One application's popularity can be measured by its downloading times, and it is valuable for commercial advertising. Identifying app installation packages from network traffic is one of the most feasible approaches to collect these data. But asymmetric routing, incomplete capture and so...
Various binary features have been recently proposed in literature, aiming at improving the computational efficiency and storage efficiency of image retrieval applications. However, the most common way of using binary features is voting strategy based on brute-force matching, since binary features are discrete data points distributed in Hamming space, so that models based on clustering such as BoW...
This paper investigates an energy-efficient transmission scheme in cognitive radio networks, where primary users (PUs) may reoccupy the spectrum when secondary users (SUs) is transmitting data. We aim to maximize the energy efficiency by jointly optimizing the transmission power, the fusion rule threshold and the sensing/transmission durations. Firstly, it is derived that for a given fusion rule threshold,...
While a cognitive radio network sharing the spectrum with a primary network, one of the major concerns is that harmful interference to the primary users should be avoided. In this paper, we propose three low-complexity algorithms for distributed beamforming in cognitive radio networks which opportunistically select a subset of cognitive source nodes whose phases may be compensated, so that the received...
Distributed beamforming (DBF) is a cooperative technology that several nodes transmit a common message to a receiver efficiently. The key to DBF is to ensure every node's signal adds coherently at the receiver by synchronizing node's carrier phase. In this paper, we present a closed-loop deterministic phase synchronization algorithm in order to pursue less synchronization time, less feedback information,...
This paper propose three novel approaches for clustering, called LPK-means algorithm, LPK-medoids and LPMK-medoids, based on label propagation algorithm. LPK-means algorithm runs like k-means algorithm, meanwhile LPK-medoids algorithm and LPMK-medoids run like k-medoids algorithm. The three proposed algorithms partition clusters by label propagation. To evaluate the proposed algorithms, we use six...
An interval reliability analysis based on combination of the minimal path method for load point reliability evaluation is presented, aiming at figuring out the uncertainty and ambiguity of reliability parameters and load changing. According to the complexity of distribution network, this new algorithm sort the elements, as the result, which can rapidly obtain the reliability indices of individual...
Resource provisioning based on virtual machine (VM) has been widely accepted and adopted in cloud computing environments. A key problem resulting from using static scheduling approaches for allocating VMs on different physical machines (PMs) is that resources tend to be not fully utilised. Although some existing cloud reconfiguration algorithms have been developed to address the problem, they normally...
Spatial data integration and fusion is an important research field in Geographical Information Science. The key of integration and fusion of spatial data lies in automated recognition and matching of homonymous features. This article concludes the spatial location matching relationships among the homonymous linear entities. Linear entity matching algorithm based on multi-steps buffer analysis is presented...
In linear space, the classical perceptron algorithm is simple and practical. But when concerning the nonlinear space it is severely confined mainly on its signal layer structure. This paper analyzes the geometry characteristic of solve region in the pattern set, and presents a new algorithm based on the solve region. The new algorithm could find the better solve vector in the solve region on condition...
Construction site layout is multi-objective optimization (MOO) problem. However, the previous researchers treated site layout as a single objective optimization problem, which is far away from the reality. In this study, site layout was treated as MOO problem. The two objective functions are minimizing the likelihood of accidents happened and total handling cost of interaction flows between the facilities...
Matching technique is a key to geospatial data integration and fusion. In this paper, spatial directional relationship was described through direction relational matrix, and calculating methods of the spatial directional similarity were discussed. Combining with the matching algorithms of vector area data, some tactics were introduced, which contribute to the accomplishing of many-to-one, many-to-many...
Using the multi-objective hybrid simulated annealing algorithm, this paper optimal design the three-phase induction motor. Typical examples of optimization show the efficiency and feasibility of this method.
Load balancing is critical to the performance of parallel processing systems. It is more difficult for network systems such as NIDS and Web Servers, because they must preserve flow order. But traditional flow-based load balancing schemes of network parallel processing systems, such as LLF, cost much resource and introduce lots of communication overhead. With the rapid popularization of multi-core...
Schema matching is a difficulty in many database application domains, e.g., data integration, E-business, data warehousing and semantic query processing. We can get correct schema mapping by mining the semantics of elements from the elementspsila own information (e.g., elementspsila names and elementspsila data types and domains), data instances and structure information. But in fact, most existing...
Differential power analysis is of great concern because it can be used to break implementations of almost any symmetric or asymmetric algorithm, and several countermeasures have been proposed to protect implementations of cryptographic algorithms except SMS4 cipher. In the present paper, we focus on the differential power analysis attack on SMS4 cipher, and suggest a secure masking scheme for SMS4...
This paper presents a high speed Radix-8 Log-MAP turbo decoder recursion architecture: algorithmic approximation and architectural optimization are incorporated in the proposed designs to reduce the critical path. The synthesis results show that the proposed design has a high throughput of 693 Mbps in 0.18 um CMOS technology, which is nearly 3 times higher than using conventional Radix-2 architecture...
To deal with the path planning of mobile robot in unknown environment, an improved rapidly-exploring random tree (RRT) is presented by analyzing basic RRT algorithm. We applied improved RRT algorithm to local navigation of a mobile robot in unknown environment. Detecting local unknown environments by robot sensor system, the method orients a biased direction from RRT algorithm is used to drive the...
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.