{"id":"W2034561078","doi":"10.1007/s11063-012-9255-8","title":"Using Laplacian Eigenmap as Heuristic Information to Solve Nonlinear Constraints Defined on a Graph and Its Application in Distributed Range-Free Localization of Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"Neural Processing Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Wireless sensor network; Heuristic; Computer science; Artificial neural network; Nonlinear system; Computational intelligence; Graph; Graph theory; Mathematical optimization; Convergence (economics); Mathematics; Algorithm; Artificial intelligence; Theoretical computer science; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007559101,0.0006793238,0.0006407364,0.0007666109,0.0003596677,0.000646931,0.0007457404,0.001140586,0.001315111],"category_scores_gemma":[0.003585804,0.0004655972,0.0005496534,0.0008927253,0.0006828731,0.00136549,0.0008852615,0.0007389181,0.0001852851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004304266,"about_ca_system_score_gemma":0.0008788619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005093491,"about_ca_topic_score_gemma":0.005410274,"domain_scores_codex":[0.999738,0.0001173503,0.00001211736,0.00003984978,0.00006734614,0.00002527135],"domain_scores_gemma":[0.9988616,0.0008010886,0.00006054727,0.00006010972,0.000185603,0.00003119043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000467484,0.0000521457,0.00018015,0.00004351031,0.00002989682,0.00003621505,0.00005601645,0.9287683,0.002798657,0.01062031,0.0009340849,0.05643401],"study_design_scores_gemma":[0.000002468126,0.000006321271,0.00001973026,0.000001114685,0.000001420722,0.00000314225,0.000002902685,0.9978707,0.0001973832,0.001825602,0.00006641052,0.000002760598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009123319,0.00006257509,0.9899852,0.00009975859,0.00001599259,0.00001416914,0.00001221256,0.0001024594,0.0005843639],"genre_scores_gemma":[0.445504,0.0002340964,0.550797,0.000139736,0.00004665725,0.0001720001,0.0001267492,0.0001367405,0.002842979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005093491,"threshold_uncertainty_score":0.01012766,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0118955793974617,"score_gpt":0.2282511541850169,"score_spread":0.2163555747875552,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}