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.
Longest Prefix Match (LPM) is a basic and important function for current network devices. Hash-based approaches appear to be excellent candidate solutions for LPM with the capability of fast lookup speed and low latency. The number of hash table probes, i.e. the search path of a hash-based LPM algorithm, directly determines the lookup performance. In this paper, we propose Ω-LPM to improve the lookup...
The built-in caching capability of future Named Data Networking (NDN) promises to enable effective content distribution at a global scale without requiring special infrastructure. The aim of this work is to design efficient caching schemes in NDN to achieve better performance at both the network layer and application layer. With the specific objective of minimizing the inter-ISP (Internet Service...
Land cover change detection is a comprehensive procedure involved with several interlinked steps. As a large number of change detection algorithms have been developed depending on different requirements, it becomes difficult for common end-users to select an appropriate change detection workflow. To address the challenge, this paper presents an online land cover change detection system with web service...
In this paper, we address the resource and virtual machine instance hour minimization problem for directed-acyclic-graph-based deadline constrained applications deployed on computer clouds. The allocated resources and instance hours on computer clouds must: (1) guarantee the satisfaction of a deadline constrained application’s end-to-end deadline; (2) ensure that the number of virtual machine (VM)...
Cache technology has emerged as a promising approach for distributed web systems to mitigate the web server's data access performance bottleneck. In this paper, we propose a decentralized load balancing architecture. The cache system takes advantage of the decentralized architecture for providing scalability and high availability. It can provide content requested by a user if it is cached in any of...
In mobile cloud computing environments, it's regarded as a good solution to augment the capability of the resource-constrained devices by offloading some of their computation-intensive applications to other more powerful surrogate devices to execute. However, because the nodes are usually connected via certain wireless technology and the nodes may change their locations from time to time, the connections...
In this paper, we address the resource minimization problem for DAG-based real-time applications using computer clouds to: (1) guarantee the satisfaction of a real-time application's end-to-end deadline, (2) ensure the number of computers allocated to the application is minimized, and (3) under allocated resources, minimize the application's make span. We first give lower and upper bounds for resources...
The secondary structure prediction of RNAs is an important classical problem in bioinformatics. The standard solution is to predict the secondary structure possessing the minimum free energy. In this paper, we propose a fuzzy adaptive particle swarm optimization (FPSO) combining particle swarm optimization (PSO) and fuzzy logic control (FLC) to predict RNA secondary structure with the minimum energy...
Due to the fact that existing 3.5G network cards usually select networks with the highest data rate as their priority choices, the radio resources may not be efficiently and equally utilized in a multiple network environment, even when the network with the highest rate is already congested. In this paper, we propose two dynamic resource allocation algorithms to resolve such issues assuming an HSPA...
Wireless sensor networks have not only recently emerged as a premier research topic, but also brought a number of new conceptual and optimization problems, which are location, deployment, and tracking. One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. This paper address one of the fundamental coverage schemes,...
Resource co-allocation is one of the crucial technologies affecting the utility and quality of services of large-scale distributed environments by simultaneously allocating multiple resources to one application. This paper concentrated on the problem to guarantee the QoS of co-allocation jobs via advance reservation and investigated the performances of two typical scheduling algorithms with and without...
Knowledge reduction is NP-hard problem. And many approaches are proposed to get the minimal reduction, which is mainly based on the significance of the attributes. There are some disadvantages of the reduction algorithms at present. In this paper, we propose a novel heuristic function based on the distribution of granularity and treat it as important metric information of attributes. In the view of...
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.