in the present study, a comprehensive and systematic strategy was described to evaluate the performance of several three-way calibration methods on a bio-analytical problem. parallel factor analysis (parafac), alternating trilinear decomposition (atld), self-weighted alternating trilinear decomposition (swatld), alternating penalty trilinear decomposition (aptld) and unfolded partial least squa...

optimization is an important methodology for activities in planning and design. the transportation designers are able to introduce better projects when they can save time and cost of travel for project by optimization methods. most of the optimization problems in engineering are more complicated than they can be solved by custom optimization methods. the most common and available methods are he...

In the present study, a comprehensive and systematic strategy was described to evaluate the performance of several three-way calibration methods on a bio-analytical problem. Parallel factor analysis (PARAFAC), alternating trilinear decomposition (ATLD), self-weighted alternating trilinear decomposition (SWATLD), alternating penalty trilinear decomposition (APTLD) and unfolded partial least squa...

In the present study, a comprehensive and systematic strategy was described to evaluate the performance of several three-way calibration methods on a bio-analytical problem. Parallel factor analysis (PARAFAC), alternating trilinear decomposition (ATLD), self-weighted alternating trilinear decomposition (SWATLD), alternating penalty trilinear decomposition (APTLD) and unfolded partial least squa...

Image mining is now a thriving and expanding field of computer science research. linked to the advancement data in image preparation. used extract hidden information other situations where photos do not clearly describe situation. combines machine learning, handling, application autonomy, preparation concepts. Semantic maps are visualize stored databases. We recommend using Multi-Child Maps bui...

Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, balanced two-way number partitioning variant, whereas the most effective approximate algorithm, BLDM,...

In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed out in [3], the problem can be approximately transformed into the vector partitioning problem by mapping each circuit component to a multi-dimensional vector. The common key idea of our two algorithms for solving the v...