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.
In this paper, the distributed optimization problem is investigated under a second-order multi-agent system. In the proposed algorithm, each agent solves the optimization via local computation and information exchange with its neighbors through the communication topology. However, in comparison with the existing second-order distributed optimization algorithms, the proposed algorithm is much simpler...
Computation of service function chains in multi-domain networks is critical for enabling the wide deployment of network function visualization for providing end-to-end network services. In this paper, we present a vertex-centric distributed orchestration framework for multi-domain networks, in which physical infrastructure information is maintained locally within each domain without infrastructure...
Studying on coverage problem is the premise and guarantee of implementing data collection, monitoring and a series of other functions for WSNs. Using the least amount of nodes to realize the regional coverage can effectively reduce the data redundancy and the collision among nodes. The greedy approximate algorithm (GAA) on minimum coverage set is put forward by this paper. In the process of constructing...
In this paper, we consider the problem of routing, modulation, and spectrum assignment (RMSA) for data- flow transfers in elastic optical networks. We design a two-dimensional resource model, in which each data transfer with known data size can be assigned a rectangular block of resources that spans both the spectrum and time dimensions. Furthermore, the dynamic spectral resource allocation problem...
Data center networks become increasingly important with the growth of cloud computing. For any integers k ≥ 0 and n ≥ 2, the k-dimensional DCell, Dk,n, has been proposed for one of the most important data center networks as a server-centric data center network structure. In this paper, we propose an efficient algorithm for finding disjoint paths in node-to-set routing...
Dynamic test generation approach is becoming increasingly popular to find security vulnerabilities in software, and is applied to detect bugs in binaries. However, the existing such systems adopt offline symbolic analysis and execution, based on program execution trace which includes the flow of execution instructions and the operand values, with all input-related memory access replaced by their execution...
We address the problem of finding the least cost disjoint path pair with delay constraints, where working and protection paths require different delay constraints. A heuristic algorithm is proposed and compared with optimal ILP results.
This paper analyses the deficiency of SVM-RFE feature selection algorithm and puts forward a new feature selection method combined with SVM-RFE and PCA. Firstly, we get the optimal feature subset through the method of cross validation based on SVM-RFE. Then, we use the PCA method to analyse the main component about optimal feature subset and get a lower-dimension and independent data sets which are...
Conventional methods for safety analysis have problems in terms of correctness and efficiency. Using formal methods and fault injection techniques can improve consistency and correctness for safety process throughout the system's safety lifecycle. Yet existed methods for fault injection and safety analysis mainly think about single faults injection for system, seldom do with fault injection for multiple...
Applied in tunnel microwave heating system, single input single output fuzzy-self-setting PID algorithm has many restrictions because such system has close coupled property. Thus fuzzy decoupling algorithm is raised. Such decoupling algorithm can decrease or even eliminate the coupling of the variables in this system. The stability of the system can also be improved. Discussion over the developing...
In this paper, we address the problem of survivable traffic grooming in optical WDM networks in which lightpaths are hop constrained. Survivability is provisioned at the wavelength granularity through either dedicated or shared path protection schemes. We propose an auxiliary-graph-based algorithm that addresses grooming, protection, and impairment constraints in a combined manner and that determines...
In insurance industry, frequent business variation brings new problems to Insurance database design: serious complexity, difficulties in database maintenance and updating, low efficiency in the inquiry and reconstruction of components. Formal Concept Analysis (FCA) is a technique that bases on the order theory, which can show concepts and their hierarchical structure and well solve problems faced...
A weight-based heuristic algorithm was developed to efficiently aggregate UPSR demands into SONET rings over DWDM networks in order to minimize the total number of optical line cards for a given set of demands.
Since a large number of clustering algorithms exist, aggregating different clustered partitions into a single consolidated one to obtain better results has become an important problem. We propose a new algorithm for clustering ensemble based on spectral clustering. We also propose a criteria along with this algorithm, for the detection of cluster numbers. Our algorithm can determine the number 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.