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.
K-means algorithm is a classical algorithm and has been widely used in many applications. However, the traditional K-means algorithm is easily influenced by outliers and it usually obtains an unstable clustering result and poor clustering accuracy. In this paper, aiming at K-means algorithm resistant to outliers, we proposed a Capped Robust K-means Algorithm (CRK-means) by adding a capped norm and...
Recently, great efforts have been devoted to the research of routing algorithms in delay tolerant networks, but existing works mainly focus on the positive social properties to design routing algorithms, in which nodes are supposed to be willing to help others carry and forward messages, few involve the negative social properties, such as selfishness. However, in reality, the resources of mobile nodes...
An improved Rapidly-exploring Random Tree∗ (RRT∗) algorithm was given, which focused on the problem of UAV path planning in 3-D dynamic environment. By considering the constraint of the UAV, the frequency of collision checking in the searching stage was reduced. And this could save searching time. D∗ Lite algorithm was introduced to RRT∗ to solve the dynamic path planning problem. The information...
Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based flexible optical networks, Routing and Spectrum Assignment (RSA) has become a key problem. However, widely used dynamic RSA schemes, such as Fixed Routing (FR) and K-shortest Paths (KSP)...
By analyzing the characteristics of urban public transport network, according to the topological graph theory, it can be reasonably abstracted representation, and constructed a model of urban bus transport network. A∗ algorithm is used in the design of the bus transfer module. Based on .NET technology framework and MapXtreme map service platform, the design and development of Transport route inquiring...
Domain specific design of reconfigurable architecture is a hard and time-consuming job. In this paper, a fast and effective domain-specific design method is proposed which mainly concludes a top-down subgraph enumeration algorithm and a heuristic identification process based on topological searching. A clustering and splitting algorithm is used to enumerate all the maximal valid subgraphs (MVSs) of...
Dynamic voltage scaling (DVS) is an effective technique to reduce the energy consumption of CMOS powered embedded systems through software control. However, applying fixed priority DVS algorithms introduces increased number of preemptions, which, in turn results in extra time delay and energy cost. Effectively reducing the number of preemptions is therefore required. In this paper, we propose to integrate...
Along with the prevailing of mobile devices, the demand for efficient power consumption has become one of the major issues in designing embedded system. Dynamic voltage scaling (DVS) is a technique that can reduce energy consumption by changing the processor voltage levels dynamically. Fixed priority with preemption threshold (FPPT) scheduling is a scheduling policy that includes preemptive and non-preemptive...
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.