A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A prototype system has been deployed to many voluntary mobile clients and extensive tests on real-scenario queries have shown the superiority of B Kai Zheng our system in comparison with the results given ...doi:10.1007/s41019-016-0013-1 fatcat:hep2xrffrvc2hj77kct35khbfy
Bolong Zheng. He received his bachelor degree in Geographic Information Science (GIS) from Wuhan University in 2019. ... Bolong Zheng. He received his bachelor degree in Energy and Power Engineering from Huazhong University of Science and Technology in 2019. ...arXiv:2009.12157v2 fatcat:rzo7c3xczzayldentads4yrlvq
We found this column-wise storage to be surprisingly well suited for in-memory Kai Zheng ...doi:10.1007/s11280-017-0466-9 fatcat:jbj6u6a56vdwxkzbxsddggkx3m
The turn-by-turn directions provided in existing navigation applications are exclusively derived from underlying road network topology information, i.e., the connectivity of edges to each other. Therefore, the turn-by-turn directions are simplified as metric translation of physical world (e.g. distance/time to turn) to spoken language. Such translation -that ignores human cognition of the geographic space -is often verbose and redundant for the drivers who have knowledge about the geographicaldoi:10.1145/3038912.3052717 dblp:conf/www/LiSDZHS17 fatcat:5oxsfqq67ffu5picygqhkjjjge
more »... t the geographical areas. In this paper, we study a Personalized RoutE Guidance System dubbed PaRE -with which the goal is to generate more customized and intuitive directions based on user generated content. PaRE utilizes a wealth of user generated historical trajectory data to extract namely "landmarks" (e.g., point of interests or intersections) and frequently visited routes between them from the road network. The extracted information is used to obtain cognitive customized directions for each user. We formalize this task as a problem of finding the optimal partition for a given route that maximizes the familiarity while minimizing the number of segments in the partition, and propose two efficient algorithms to solve it. For empirical study, we apply our solution to both real and synthetic trajectory datasets to evaluate the performance and effectiveness of PaRE .
Machine learning has provided a huge wave of innovation in multiple fields, including computer vision, medical diagnosis, life sciences, molecular design, and instrumental development. This perspective focuses on the implementation of machine learning in dealing with light-matter interaction, which governs those fields involving materials discovery, optical characterizations, and photonics technologies. We highlight the role of machine learning in accelerating technology development anddoi:10.1038/s41377-019-0192-4 pmid:31645928 pmcid:PMC6804848 fatcat:zbnw3tt2ozhive3tcvtc5sfe5e
more »... lopment and boosting scientific innovation in the aforementioned aspects. We provide future directions for advanced computing techniques via multidisciplinary efforts that can help to transform optical materials into imaging probes, information carriers and photonics devices.
Author contributions Bolong Zheng was responsible for patient selection and recruitment and drafting of the manuscript, Dingjun Hao was responsible for carrying out the surgical procedures, Hua Guo was ...doi:10.1177/0300060518764933 pmid:29584540 fatcat:mue3ibhxovb7pkyejsixrmu6de
A common approach to what-if analysis is interactive and iterative, driven by a visualisation of the relation between Corresponding author is Kai Zheng input parameters and outcomes. ...doi:10.1109/icde.2018.00018 dblp:conf/icde/Nguyen0WZYTS18 fatcat:cn5ksnn26bbvbp74xsqsicye3y
In Pickup-and-Delivery problems (PDP), mobile workers are employed to pick up and deliver items with the goal of reducing travel and fuel consumption. Unlike most existing efforts that focus on finding a schedule that enables the delivery of as many items as possible at the lowest cost, we consider trichromatic (worker-item-task) utility that encompasses worker reliability, item quality, and task profitability. Moreover, we allow customers to specify keywords for desired items when they submitdoi:10.1109/icde48307.2020.00089 dblp:conf/icde/ZhengHJCHLLZ20 fatcat:vozpc4sk4bg4jminho7ulh7raa
more »... s when they submit tasks, which may result in multiple pickup options, thus further increasing the difficulty of the problem. Specifically, we formulate the problem of Online Trichromatic Pickup and Delivery Scheduling (OTPD) that aims to find optimal delivery schedules with highest overall utility. In order to quickly respond to submitted tasks, we propose a greedy solution that finds the schedule with the highest utility-cost ratio. Next, we introduce a skyline kinetic tree-based solution that materializes intermediate results to improve the result quality. Finally, we propose a density-based grouping solution that partitions streaming tasks and efficiently assigns them to the workers with high overall utility. Extensive experiments with real and synthetic data offer evidence that the proposed solutions excel over baselines with respect to both effectiveness and efficiency.
The Web constitutes a valuable source of information. In recent years, it fostered the construction of large-scale knowledge bases, such as Freebase, YAGO, and DBpedia. The open nature of the Web, with content potentially being generated by everyone, however, leads to inaccuracies and misinformation. Construction and maintenance of a knowledge base thus has to rely on fact checking, an assessment of the credibility of facts. Due to an inherent lack of ground truth information, such factdoi:10.14778/3324301.3324303 fatcat:eiiwneqehbhqvi5jjphfwnncnu
more »... , such fact checking cannot be done in a purely automated manner, but requires human involvement. In this paper, we propose a comprehensive framework to guide users in the validation of facts, striving for a minimisation of the invested effort. Our framework is grounded in a novel probabilistic model that combines user input with automated credibility inference. Based thereon, we show how to guide users in fact checking by identifying the facts for which validation is most beneficial. Moreover, our framework includes techniques to reduce the manual effort invested in fact checking by determining when to stop the validation and by supporting efficient batching strategies. We further show how to handle fact checking in a streaming setting. Our experiments with three real-world datasets demonstrate the efficiency and effectiveness of our framework: A knowledge base of high quality, with a precision of above 90%, is constructed with only a half of the validation effort required by baseline techniques. PVLDB Reference Format:
Single-source and top-k SimRank queries are two important types of similarity search in graphs with numerous applications in web mining, social network analysis, spam detection, etc. A plethora of techniques have been proposed for these two types of queries, but very few can efficiently support similarity search over large dynamic graphs, due to either significant preprocessing time or large space overheads. This paper presents ProbeSim, an index-free algorithm for single-source and top-kdoi:10.14778/3151113.3151115 fatcat:vj47sjztozfvxgyq2p3tocozi4
more »... rce and top-k SimRank queries that provides a non-trivial theoretical guarantee in the absolute error of query results. ProbeSim estimates SimRank similarities without precomputing any indexing structures, and thus can naturally support real-time SimRank queries on dynamic graphs. Besides the theoretical guarantee, ProbeSim also offers satisfying practical efficiency and effectiveness due to several non-trivial optimizations. We conduct extensive experiments on a number of benchmark datasets, which demonstrate that our solutions significantly outperform the existing methods in terms of efficiency and effectiveness. Notably, our experiments include the first empirical study that evaluates the effectiveness of SimRank algorithms on graphs with billion edges, using the idea of pooling.
ACDF has been considered as the gold standard in the treatment of single level cervical disk protrusion. However, it may cause adjacent level degeneration due to regional biomechanical changes. TDR has been applied with satisfactory results for over a decade, but there is no consensus if TDR is safer and more efficient than ACDF. The current study was carried out to compare the efficiency and safety of TDR and ACDF in the treatment of patients with single level cervical disk protrusion.doi:10.1186/s12893-017-0316-9 pmid:29183306 pmcid:PMC5706295 fatcat:p7ifyjz6a5empmi2f36olbona4
more »... protrusion. Methods: One hundred forty-five consecutive patients who underwent either TDR or ACDF in our center were included in the current study. Time of surgery, intraoperative blood loss, VAS arm and neck pain scores, ROM, ODI, SF36 and Patient satisfaction were compared before the surgery, after the surgery, and during follow up 1, 3, 5, 8 years after the surgery. Results: The time of surgery was 64.6 ± 20.7 min in the ACDF group and 69.4 ± 19.3 min in the TDR group; intraoperative hemorrhage was 67.2 ± 14.3 ml in ACDF group and 70.7 ± 18.6 ml in TDR group. There were no significant differences between two groups concerning time of surgery and intraoperative blood loss. No differences were found concerning patient satisfaction between the two groups during the follow up (P > 0.05). Significant differences were found between the groups concerning VAS arm and neck pain scores, ROM, ODI and SF36 after the surgery and during the 8 year follow up. Conclusion: TDR may be a more effective approach than ACDF for treating patients with single level cervical disk protrusion.
The previous studies have shown that melatonin is beneficial for nervous system after spinal cord injury (SCI). After SCI, the endogenous neural stem/progenitor cells (eNSPCs) proliferate and differentiate into neurons and glial cells. In the present study, we examined the effect of melatonin on eNSPCs proliferation and differentiation in SCI rat model. SCI rat model was established by dropping a 10 g rod from the height of 25 mm. Then, the rats were randomly divided into the control group, thedoi:10.1016/j.jsps.2017.04.025 pmid:28579893 pmcid:PMC5447434 fatcat:qgypw4zbrrevhaadlw5ldbwnc4
more »... control group, the melatonin treated group, and the G3335 treated group. The Basso-Beattie-Bresnahan locomotor rating scale (BBB scale) was used to evaluate the recovery of locomotor function after SCI. Flow cytometry was used to evaluate eNSPCs proliferation and differentiation. The rats in the melatonin treated group demonstrated significantly faster locomotor function recovery and more eNSPCs proliferation and differentiation. However, these effects were abolished in the G3335 treated group. Melatonin can effectively promote locomotor function recovery via improving eNSPCs proliferation and differentiation after SCI. Ó 2017 Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Nearest neighbor (NN) search in high-dimensional spaces is inherently computationally expensive due to the curse of dimensionality. As a well-known solution to approximate NN search, locality-sensitive hashing (LSH) is able to answer c-approximate NN (c-ANN) queries in sublinear time with constant probability. Existing LSH methods focus mainly on building hash bucket based indexing such that the candidate points can be retrieved quickly. However, existing coarse-grained structures fail to offerdoi:10.14778/3377369.3377374 fatcat:aas6ap7v5bfgfebinps3xkps3m
more »... tures fail to offer accurate distance estimation for candidate points, which translates into additional computational overhead when having to examine unnecessary points. This in turn reduces the performance of query processing. In contrast, we propose a fast and accurate LSH framework, called PM-LSH, that aims to compute the c-ANN query on large-scale, high-dimensional datasets. First, we adopt a simple yet effective PM-tree to index the data points. Second, we develop a tunable confidence interval to achieve accurate distance estimation and guarantee high result quality. Third, we propose an efficient algorithm on top of the PM-tree to improve the performance of computing c-ANN queries. Extensive experiments with real-world data offer evidence that PM-LSH is capable of outperforming existing proposals with respect to both efficiency and accuracy. PVLDB Reference Format:
As an education base, colleges and universities provide a large number of excellent talents for the country and the society. Campus security is bound to be highly valued by all sectors of society. However, current campus security incidents occur frequently and often appear in the media at the first time, which is easy to arouse wide attention of the society and the government. Because of its particularity, universities will face greater challenges when security incidents occur. Taking Tsinghuadoi:10.12783/dtmse/ameme2020/35560 fatcat:je3suymrgnbptgffs32ttgn2xu
more »... r. Taking Tsinghua University as an example, this paper discusses the construction of an information platform for comprehensive security on campus, so as to make up for the deficiencies of traditional civil air defense and physical defense, better guarantee the safety of all kinds of school personnel, and provide reference for other colleges and universities to build a comprehensive security information platform.
Figure 2 . 2 Some examples of diseases on the murals (We are grateful to Bolong Chai for taking these photographs). Figure 3 . 3 Diferent levels of laking on the murals of Mogao Grotto No. 126. ... To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ Figure 1 . 1 Examples of murals at the Mogao Grottoes (We are grateful to Bolong Chai for taking these photographs). ...doi:10.1038/srep14371 pmid:26394926 pmcid:PMC4585823 fatcat:53yzmvkol5d6xaa7m2v6laagem
« Previous Showing results 1 — 15 out of 64 results