{"id":"https://openalex.org/W6945067794","doi":"https://doi.org/10.21227/h1h2-1486","title":"Newton-like search algorithm for the reconstruction of admissible joint-references from a prescribed output-reference for the non-Standard and Generalized N-Trailers","display_name":"Newton-like search algorithm for the reconstruction of admissible joint-references from a prescribed output-reference for the non-Standard and Generalized N-Trailers","publication_year":2020,"publication_date":"2020-01-29","ids":{"openalex":"https://openalex.org/W6945067794","doi":"https://doi.org/10.21227/h1h2-1486"},"language":"en","primary_location":{"id":"doi:10.21227/h1h2-1486","is_oa":true,"landing_page_url":"https://doi.org/10.21227/h1h2-1486","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"type":"dataset","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.21227/h1h2-1486","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pazderski, Dariusz","orcid":"https://orcid.org/0000-0002-8732-7350"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Pazderski, Dariusz","raw_affiliation_strings":["Institute of Automation and Robotics, Poznan University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Automation and Robotics, Poznan University of Technology","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":null,"display_name":"Micha\u0142ek, Maciej","orcid":"https://orcid.org/0000-0002-9953-703X"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142ek, Maciej","raw_affiliation_strings":["Institute of Automation and Robotics, Poznan University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Automation and Robotics, Poznan University of Technology","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5720000267028809},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5665000081062317},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5608999729156494},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5289999842643738},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.47929999232292175},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4325000047683716},{"id":"https://openalex.org/keywords/matlab","display_name":"MATLAB","score":0.3626999855041504},{"id":"https://openalex.org/keywords/fourier-series","display_name":"Fourier series","score":0.3562999963760376}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6481000185012817},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5720000267028809},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5665000081062317},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5608999729156494},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5289999842643738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.525600016117096},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.47929999232292175},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4325000047683716},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39469999074935913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36340001225471497},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C207864730","wikidata":"https://www.wikidata.org/wiki/Q179467","display_name":"Fourier series","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C184389593","wikidata":"https://www.wikidata.org/wiki/Q603159","display_name":"Curve fitting","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3075000047683716},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C188414643","wikidata":"https://www.wikidata.org/wiki/Q3001183","display_name":"Harmonics","level":3,"score":0.2856999933719635},{"id":"https://openalex.org/C5917680","wikidata":"https://www.wikidata.org/wiki/Q2621825","display_name":"Basis function","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21227/h1h2-1486","is_oa":true,"landing_page_url":"https://doi.org/10.21227/h1h2-1486","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"dataset"}],"best_oa_location":{"id":"doi:10.21227/h1h2-1486","is_oa":true,"landing_page_url":"https://doi.org/10.21227/h1h2-1486","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"dataset":[1],"consists":[2],"of":[3,23,34,46,52,61,88,97,115,139],"the":[4,12,17,21,24,35,42,47,53,69,74,84,89,116,125,131,137],"source":[5],"Matlab":[6],"files":[7],"(the":[8,99],"m-files)":[9],"which":[10],"implement":[11],"computational":[13],"Newton-like":[14],"algorithm":[15,48],"solving":[16],"reconstruction":[18],"problem":[19],"for":[20,68,101],"joint-references":[22],"non-Standard":[25],"and":[26,44,130],"Generalized":[27],"N-Trailers":[28],"upon":[29],"a":[30,77,95,102],"prescribed":[31,67],"reference":[32,65,117],"path":[33,66],"last":[36,70],"trailer.":[37],"A":[38],"user":[39],"can":[40],"examine":[41],"effectiveness":[43],"properties":[45],"by":[49,136],"selecting":[50],"one":[51],"seven":[54],"possible":[55],"3-trailer":[56],"structures":[57],"with":[58,105],"various":[59],"types":[60],"hitching.":[62],"The":[63,92,120],"default":[64],"trailer":[71],"implemented":[72],"in":[73],"code":[75],"is":[76,134],"parametrized":[78],"Lissajous-like":[79],"closed":[80],"curve":[81],"defined":[82],"on":[83],"normalized":[85],"interval":[86],"[0,1]":[87],"parametrizing":[90],"variable.":[91],"program":[93],"computes":[94],"set":[96],"parameters":[98],"weights)":[100],"Fourier":[103],"basis":[104],"up":[106],"to":[107,111],"2000":[108],"harmonics":[109],"chosen":[110],"approximate":[112],"an":[113],"evolution":[114],"joint":[118],"angles.":[119],"results":[121],"being":[122],"obtained":[123],"during":[124],"computations":[126],"are":[127],"plotted":[128],"on-the-fly,":[129],"approximation":[132],"accuracy":[133],"provided":[135],"values":[138],"quality":[140],"factors.":[141]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}