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.
The separate development between the storage system and scientific application has hidden most of internal implementation strategies of the storage system from the scientific application designers. This would worsen the existing I/O bottleneck problem of most scientific applications to some extent. To address this problem, this study chooses the matrix and its parallel out-of-core product algorithm...
In this paper, a class of two-level difference schemes including a parameter are discussed for the numerical solution of one-dimensional telegraphic equations with source terms, where ? ? [0,4]. The truncation errors of these schemes are O (k2 + h4) if ? ? 1/3. For ? ? 1/3, the accuracy of the present scheme is improved to O(k3 + h4). Numerical results demonstrate the superiority of these present...
Forecasting the volume of foreign trade is important to policy formulation for local governments. This study proposes a machine-learning algorithm as a forecasting tool that is based on Rough sets and Shannon entropy. This study uses historical data from a large municipal to examine the proposed forecasting tool. The results suggest that this tool can be useful in specific trade decisions with unique...
In this paper, by constructing a new high-order parallel alternating group iterative algorithm, we solve the two point boundary value problem. The main method is to dividing the system of different equations into a set of subsystem which can be solved individually in parallel and four order accurate. We have obtained the main results and given some examples to validate our results in addition. It...
In this paper, the linear mapping from the constrained solution sets to their independent parameter spaces is constructed, and its properties are studied. Based on these properties and the classical algorithm LSQR for solving the (unconstrained) LS problem, a matrix iterative method that can find the special Centro symmetric solution is proposed. Numerical results are reported that show the efficiency...
In order to tackle the problems of current recommendation system, such as lack of domain knowledge and limited applications in e-commerce field, a domain-driven recommendation method based on binary data is proposed in this paper. By introducing the importance of domain knowledge and its application in recommendation, we discuss how to combine domain knowledge with collaborative filtering and apply...
For two given matrices A and B, the extremum of the Frobenius norm of matrix B-XA is established when X is running all over the unitary matrices. By using the technique of singular value decomposition, the extremum of the Frobenius norm matrix is studied. The result shows that the matrix B-XA has extremum when X is running all over the unitary matrices and in this paper, the bounded of maximum and...
This paper brings option trading into perishable products supply chain, with high demand uncertainties, long production lead-times and short selling period, and explores the application of independent option in flexible contract. Based on these, it develops a two-stage contract with independent option for a single manufacturer and two retailers, analyzes the decision process of retailer and obtains...
Ren-chang Li has obtained more bounds on eigenvalue variation in [1]. Theorem 2.3 in [1] gives some bounds on eigenvalue variation of two matrices. The bounds are available for the diagonalizable matrices with nonnegative eigenvalues. We obtain that the same bounds are valid for some diagonalizable matrices with complex eigenvalues, and extend Theorem 2.3 in [1].
Two classes of new nonlinear conjugate gradient methods are proposed in order to avoid the drawbacks of FR and CD. By induction and contradiction, we prove the sufficient descent properties without any line search and the global convergence with the Wolfe line search. The numerical results for 10 classical unconstrained optimization problems respectively indicate that the proposed methods outperform...
The use of optimization in a simulation-based design of automotive, aerospace and consumer products has become a common trend today. Designers are faced with the continuous challenge of reducing manufacturing costs and design cycle times while improving the systems performance and reliability. In practical design, sequential linear programming (SLP) is very popular because of its inherent simplicity...
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.