Severity: Warning
Message: file_get_contents(https://...@gmail.com&api_key=61f08fa0b96a73de8c900d749fcb997acc09&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 197
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 197
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 271
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 1075
Function: getPubMedXML
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3195
Function: GetPubMedArticleOutput_2016
File: /var/www/html/application/controllers/Detail.php
Line: 597
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 511
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 317
Function: require_once
98%
921
2 minutes
20
Multivariate curve resolution methods suffer from the non-uniqueness of the solutions. The set of possible nonnegative solutions can be represented by the so-called Area of Feasible Solutions (AFS). The AFS for an s-component system is a bounded (s-1)-dimensional set. The numerical computation and the geometric construction of the AFS is well understood for two- and three-component systems but gets much more complicated for systems with four or even more components. This work introduces a new and robust ray casting method for the computation of the AFS for general s-component systems. The algorithm shoots rays from the origin and records the intersections of these rays with the AFS. The ray casting method is computationally fast, stable with respect to noise and is able to detect the various possible shapes of the AFS sets. The easily implementable algorithm is tested for various three- and four-component data sets.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1016/j.aca.2016.11.069 | DOI Listing |