Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 2 of 2
Full-Text Articles in Other Mathematics
Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong
Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong
Doctoral Dissertations
Quadratic programming (QP) has received significant consideration due to an extensive list of applications. Although polynomial time algorithms for the convex case have been developed, the solution of large scale QPs is challenging due to the computer memory and speed limitations. Moreover, if the QP is nonconvex or includes integer variables, the problem is NP-hard. Therefore, no known algorithm can solve such QPs efficiently. Alternatively, row-aggregation and diagonalization techniques have been developed to solve QP by a sub-problem, knapsack separable QP (KSQP), which has a separable objective function and is constrained by a single knapsack linear constraint and box constraints. …
Optimizing The Analysis Of Electroencephalographic Data By Dynamic Graphs, Mehrsasadat Golestaneh
Optimizing The Analysis Of Electroencephalographic Data By Dynamic Graphs, Mehrsasadat Golestaneh
Electronic Thesis and Dissertation Repository
The brain’s underlying functional connectivity has been recently studied using tools offered by graph theory and network theory. Although the primary research focus in this area has so far been mostly on static graphs, the complex and dynamic nature of the brain’s underlying mechanism has initiated the usage of dynamic graphs, providing groundwork for time sensi- tive and finer investigations. Studying the topological reconfiguration of these dynamic graphs is done by exploiting a pool of graph metrics, which describe the network’s characteristics at different scales. However, considering the vast amount of data generated by neuroimaging tools, heavy computation load and …