The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider three kinds of minimum single source shortest path tree expansion problems. Given an undirected connected graph G = (V, E; w, c, b; s) with n vertexes, m edges and a positive constant H, w(e) is the length of edge e, c(e) is the capacity of edge e, b(e) is the unit cost to increase the capacity of edge e, H is a given capacity restriction value and s is a fixed vertex of G. For every edge...
Frequency-domain-independent component analysis (F-ICA) algorithm is proposed as demultiplexing method for mode-division multiplexing (MDM) system. We simulate an MDM system and testify the feasibility of F-ICA as demultiplexing algorithm. In addition, the symbol error rate (SER) performance of F-ICA and frequency-domain least mean square algorithm is compared. Simulation results show that the proposed...
PTS(Partial transmit sequence) is a valid and distortionless technique used to reduce the PAPR(peak-to-average power ratio) in OFDM(orthogonal frequency division multiplexing)system. However, this algorithm has a high computational complexity. In this paper, to balance the performance and the computation complexity, we describe a simplified scheme for finding the best scrambling sequences based on...
The job shop scheduling problem (JSSP) is a well known NP-hard problem, and many algorithms have been presented to solve it, but the results are still unsatisfactory. In this paper, a hybrid discrete particle swarm optimization algorithm based on a two layer population structure is proposed to solve the JSSP, meanwhile add an improved simulated annealing algorithm to increase the ability of finding...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.