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...
Due to the complex species, the changing dimensions and 2D nesting structure of mathematical formula symbols, the accuracy of symbol segmentation still cannot meet the actual needs. Projection is only suitable for simple mathematical formula without subscript and hierarchy. This paper presents a kind of improved algorithm based on the connected domain for symbol segmentation of mathematical formula...
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...
Recently, cloud computing has emerged as a new computing paradigm on the Internet. With the development of cloud computing, enterprise data centers shift towards a utility computing model where many critical business applications share a common pool of infrastructure resources offering capacity on demand. The virtual machine with the features of strong isolation and flexible is usually assigned as...
Process mining has been widely applied in lots of fields, which can discover workflow models from event logs, helps to design or re-design process models, and brings convenience to workflow management system. The main function of process mining algorithms is to provide us with valuable objective information hidden in event logs, which plays a crucial important role on the implementation of new operation...
In the paper, a novel hybrid algorithm based on Baldwinian learning and PSO (BLPSO) is proposed to increase the diversity of the particles and to prevent premature convergence of PSO. Firstly, BLPSO adopts the Baldwinian operator to simulate the learning mechanism among the particles and employs the information of the swarm to alter the search space adaptively. Secondly, a mutation operation is introduced...
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.