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.
The service composition composing the existing Web services to form new, satisfying different user requirements and value-added composition service has become new application requirement and popular research. The optimization of services composition is a nonlinear multi-objective optimization problem which has been proven to be NP-complete. It is preponderant to settle the multi-objective optimization...
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard...
The paper discusses the irregular parts packing problem based on an improved immune genetic algorithm, and a NIGA based on crowing mechanism is proposed. For improving the packing efficiency, the clustering idea and algorithm are introduced and the effective characteristics of matching packing-graphics are extracted and analyzed. GA, an improved immune genetic algorithm, and NIGA are applied to practical...
The Krylov proportionate normalized least mean square (KPNLMS) algorithm extended the use of proportional update idea of the PNLMS (proportionate normalized LMS) algorithm to the non-sparse (dispersive) systems. This paper deals with the mean fourth minimization of the error and proposes Krylov proportionate normalized least mean fourth algorithm (KPNLMF). First, the PNLMF (proportionate NLMF) algorithm...
In this paper we consider the problem of constructing a distributed feedback law to achieve synchronization for a group of k agents whose states evolve on SO(n) and which exchange only partial state information along communication links. The partial state information is given by the action of the state on reference vectors in ??n. We propose a gradient based control law which achieves exponential...
In this paper, we investigate dynamical complexity of general planar piecewise isometries. We reveal the relations between the complexity and the admissible finite words generated by a planar piecewise isometry, and present the necessary and sufficient conditions for the complexity to be zero. Furthermore, we give equivalent statements for the complexity to be not less than 1, and also discuss some...
A fast deterministic packet marking scheme (FDPM) for IP traceback against distributed denial of service attacks is presented, which applies a novel marking algorithm and significantly improves IP traceback in two aspects: (1) the victim doesn't need to accommodate fragments for recovery, so it needs several packets to identify an ingress router with lower false positives; (2) FDPM can scales to large...
Under the linear loss, we consider the test problem of the life parameter in the exponential distribution using empirical Bayes (EB) approach and present a monotone EB test possessing a rate of convergence which can be arbitrarily close to O(n-1) under the condition that the past samples are S\phiS-mixing.
We present a new method for solving large scale nonnegative least squares problems. Firstly, nonnegative least squares problem was transformed into monotone linear complementarity problem. Then we apply potential-reduction interior point algorithm to monotone linear complementarity problem which is based on the Newton direction and centering direction. We show that this algorithm have the polynomial...
The issue of the guarantee quality of service (QOS) for users can be provided by the advanced reservation. The advanced reservation is a kind of mechanism that can provide the ability to allocate resources for users based on the agreement upon the needs of quality service and increase of the number of accepted users' requests in Grid system. Scheduling and advanced reservation of the resources in...
Linguistic fuzzy modeling in high dimensional regression problems is a challenging topic since conventional linguistic fuzzy rule-based systems suffer from exponential rule explosion when the number of variables and/or data examples becomes high. A good way to face this problem is by searching for a good and simple global structure within the same process, in order to consider the relationships among...
Unit commitment is an important and difficulty aspect of optimal operation of power systems. Because it belongs to be mixed variables programming that is difficult to find the optimal solution in mathematics. This paper presents a new method combining of neighbor search and interior-point method (LS-IP) to solve UC NP-hard problem. The structure of neighborhood is defined and a new way to adjust neighborhood...
In this work, we propose a novel combined set-membership (SM) reduced-rank interference suppression scheme and consider its application to spread-spectrum multiuser direct sequence ultra-wideband (DS-UWB) systems. In the proposed scheme, the theory of set-membership filtering is applied to the training-based powers of R (PoR) multi-stage Wiener filter (MSWF) reduced-rank process and the reduced-rank...
A digraph is weight-balanced if, at each node, the sum of the weights of the incoming edges (in-degree) equals the sum of the weights of the outgoing edges (out-degree). Weight-balanced digraphs play an important role in a variety of cooperative control problems, including formation control, distributed averaging and optimization. We call a digraph weight-balanceable if it admits an edge weight assignment...
Flow shop scheduling problem (FSP) is a classical NP-hard problem., which has the wide application in many fields of manufacturing. This paper put forward a novel simulated annealing for solving FSP. The main characteristic of the algorithm is that the new solution in each iteration is generated by two random numbers, which improves the global convergence. By the algorithm solving the FSP, Numerical...
The aim of Non-negative Matrix Factorization (NMF) is to decompose a non-negative matrix into a product of two (or multiple) non-negative matrices with reduced ranks. Several iterative methods have been developed for this purpose, e.g. the Alternating Least Squares (ALS) or Lee-Seung (LS) multiplicative methods. Despite its fast convergence, the ALS algorithm suffers from its instability, and may...
For a network canceler, whose input is mainly speech, the proportionate affine projection algorithm (PAPA) is expected to present faster convergence speed than the existing proportionate NLMS algorithms. However, the performance criteria of fast convergence speed conflicts with low steady-state misalignment when a constant step-size parameter is applied. In this article we introduce a variable step-size...
The main contribution of this paper is an algorithm to solve the quantized consensus problem over networks represented by Hamiltonian graphs, i.e., graphs containing a Hamiltonian cycle. The algorithm is proved to converge almost surely to a finite set containing the optimal solution. A worst case study of the average convergence time is carried out, thus proving the efficiency of the algorithm with...
The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent consensus, networked control and data mining. The well known power method is a typical tool for its solution. However randomized methods could be competitors vs standard ones; they require much less calculations for one iteration and...
Multi-EOS (Earth Observing Satellites) tasks planning problem is a typical over-subscribed resource allocation problem with multi-objective, especially to make schedule for both LEO (Low Earth Orbit) and HEO (High Earth Orbit) satellites. The optimization work of scheduling is assigning appropriate time window to every request (including data transmission process between satellites and ground facilities)...
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.