Filters








42,427 Hits in 4.6 sec

MDH volume 17 issue 4 Cover and Front matter

1973 Medical history  
K. CRELLIN and D. A.  ...  Historical Library at the University of Minnesota 208 XIVth International Congress of the History of Science 208 Queries 208 Book Reviews 209 JULY Osler's English School SIR RIcHARD DOLL  ... 
doi:10.1017/s0025727300018925 fatcat:4pryu7ad4bddfi7rm3sg6so2m4

Time Traveling in Graphs using a Graph Database

Konstantinos Semertzidis, Evaggelia Pitoura
2016 International Conference on Extending Database Technology  
We define three general types of historical queries, namely, historical graph queries, historical time queries and historical top-k queries.  ...  Our goal is to define the different types of queries that one can ask regarding the graph history and present an initial approach to storing graph snapshots and processing historical queries in a native  ...  We ran all queries on a system with a quad-core Intel Core i7-4770 3.4 GHz processor and 32 GB memory. We only use one core for all experiments. Storage.  ... 
dblp:conf/edbt/SemertzidisP16 fatcat:5rxmxo2uiva35dduiwiunhqvga

Group based Personalized Search by Integrating Search Behaviour and Friend Network [article]

Yujia Zhou, Zhicheng Dou, Bingzheng Wei, Ruobing Xievand Ji-Rong Wen
2021 arXiv   pre-print
The key to personalized search is to build the user profile based on historical behaviour.  ...  Furthermore, we argue that the behaviour-based similar users are still insufficient to understand a new query when user's historical activities are limited.  ...  Finally, we obtain 𝑘 r diverse relation-based friend circles 𝐶 r = {𝑐 r 1 , ...𝑐 r 𝑘 r } and corresponding core friends 𝐹 r = {𝑓 r 1 , ...𝑓 r 𝑘 r }.  ... 
arXiv:2111.12618v1 fatcat:thelkkh4fjg2nldrdtcbuckrk4

Historical Traversals in Native Graph Databases [chapter]

Konstantinos Semertzidis, Evaggelia Pitoura
2017 Lecture Notes in Computer Science  
We introduce models for storing such snapshots in the graph database and we propose algorithms for supporting various types of historical reachability and shortest path queries.  ...  In this paper, we focus on supporting traversals of such graphs using a native graph database.  ...  We ran our experiments on a system with a quad-core Intel Core i7-3820 3.6 GHz processor, with 64GB memory. We only used one core in all experiments.  ... 
doi:10.1007/978-3-319-66917-5_12 fatcat:pu7wk7oblncd3a4t2s3pjmc5ym

MDH volume 10 issue 4 Cover and Front matter

1966 Medical history  
Historical Symposium on Nicolaus Steno. New Exhibits in the Weilcome Historical Medical Museum and Library. Pharmacy in History, by G. E. Trease.  ...  IP address: 207.241.231.82, on 25 Jul 2018 at 02:20:28, subject to the Cambridge Core terms of use, available at  ... 
doi:10.1017/s0025727300011431 fatcat:umhahgcjwvb3bjc67ucbbagbjy

A Scalable Distributed Private Stream Search System

Peng Zhang, Yan Li, Qingyun Liu, Hailun Lin
2015 2015 IEEE 35th International Conference on Distributed Computing Systems Workshops  
Once the segment on the historical compute node can be queried, then the real-time compute node will delete all the information of this segment and publish it will never serve this segment.  ...  Overall, the cluster contains 96 cores, 96GB of RAM, as well as enough fast Ethernet and enough disk space. Result2: the first query achieves scanning rate of 330 thousands lines per second per core.  ... 
doi:10.1109/icdcsw.2015.31 dblp:conf/icdcsw/ZhangLLL15 fatcat:7jwf4bh7ezeqrc6ddbmbr6wpjq

MDH volume 10 issue 1 Cover and Front matter

1966 Medical history  
K. D. KEELE, M.D., F.R.C.P. SIR ARTHUR MACNALTY, K.C.B., M.A., M.D., F.R.C.P., F.R.C.S. of the History of Medicine. Historical Symposium on Nicolaus Steno.  ...  IP address: 207.241.231.81, on 01 May 2019 at 01:56:50, subject to the Cambridge Core terms of use,  ... 
doi:10.1017/s0025727300010589 fatcat:wkklt43tsra6zml25t3k62quyu

RUCIR at TREC 2019: Conversational Assistance Track

Xiaochen Zuo, Xue Yang, Zhicheng Dou, Ji-Rong Wen
2019 Text Retrieval Conference  
For the Conversational Assistance Track, our runs try to solve conversational retrieval problems from two directions: One is to improve the search results by modifying the user's current query, including  ...  query reference resolution and incorporate the information from user's history queries in the same session.  ...  , v 2 , ..., v t −1 ] The corresponding key value matrix K is the representation of the historical query, it means K = R q = {r q 1 , r q 2 , ..., r q l −1 }.  ... 
dblp:conf/trec/ZuoYDW19 fatcat:irwuxoidunbm7n4ew6fgt3ak3y

A declarative query processing system for nowcasting

Dolan Antenucci, Michael R. Anderson, Michael Cafarella
2016 Proceedings of the VLDB Endowment  
allowing it to process queries 123x faster than a 300-core Spark cluster, using only 10% of the computational resources.  ...  Further, we propose a novel query quality alarm that helps users estimate phenomena even when historical ground truth data is not available.  ...  Our query optimizations and quality alarm aid the human-in-the-loop nature of nowcasting by allowing for fast query iteration on many phenomena-even those lacking historical ground truth data.  ... 
doi:10.14778/3021924.3021931 fatcat:3psxkkikc5b5rdm2rfuvzsz7yu

TSUBASA: Climate Network Construction on Historical and Real-Time Data [article]

Yunlong Xu, Jinshu Liu, Fatemeh Nargesian
2022 arXiv   pre-print
The core task and first step to enable interactive network science on climate data is the efficient construction and update of a climate network on user-defined time-windows.  ...  By pre-computing simple and low-overhead statistics, TSUBASA can efficiently compute the exact pairwise correlation of time-series on arbitrary time windows at query time.  ...  Note than we have 63 partitions/cores for sketch/matrix computation and we reserve one core for database writes.  ... 
arXiv:2203.16457v1 fatcat:tnhbzlozkrgbjbj2ygr4hgxh4a

Efficient Snapshot Retrieval over Historical Graph Data [article]

Udayan Khurana, Amol Deshpande
2012 arXiv   pre-print
We address the problem of managing historical data for large evolving information networks like social networks or citation networks, with the goal to enable temporal and evolutionary queries and analysis  ...  matching over historical data.  ...  Unless otherwise stated, the experiments were run on a single core on a single machine. XXX need details.  ... 
arXiv:1207.5777v1 fatcat:3g2nwuo6gnh4vjzug7qb43vwzu

News, Notes, and Queries

1983 Medical history  
The following Wellcome Symposia will take place at the Institute in 1983: Friday, 25 February -Historical perspectives on medicine and the law Friday, 25 March -The historical language of medicine Friday  ...  IP address: 207.241.231.82, on 24 Jul 2018 at 15:53:56, subject to the Cambridge Core terms of use, available  ... 
doi:10.1017/s0025727300042307 fatcat:zeu7cf5eavazdbtel7uyjcafou

Time-Weighted Community Search Based on Interest

Jing Liu, Yong Zhong
2022 Applied Sciences  
Therefore, we propose a time-weighted community search model (TWC) based on user interests which fully considers the impact of time on user interests.  ...  Community search aims to provide users with personalized community query services.  ...  , k-truss, and k-core.  ... 
doi:10.3390/app12147077 fatcat:tuxnfcxqjvfvvadsubplspxlqa

An Improved Privacy-Preserving Framework for Location-Based Services Based on Double Cloaking Regions with Supplementary Information Constraints

Li Kuang, Yin Wang, Pengju Ma, Long Yu, Chuanbin Li, Lan Huang, Mengyao Zhu
2017 Security and Communication Networks  
of the double cloaking regions; specifically speaking, k dummy points of fixed dummy positions in the double cloaking regions are generated and the LBSs query is then performed.  ...  disclosure of privacy on the other side.  ...  Figure 7 : 7 Number of historical queries in 4 × 4 region.  ... 
doi:10.1155/2017/7495974 fatcat:e4l7xsnrtbdynkq2jl76wms3ky

Mining Massive-Scale Spatiotemporal Trajectories in Parallel: A Survey [chapter]

Pengtao Huang, Bo Yuan
2015 Lecture Notes in Computer Science  
This survey covers essential topics including trajectory indexing and query, clustering, join, classification, pattern mining and applications.  ...  In this paper, we present a comprehensive survey of the state-of-the-art techniques for mining massive-scale spatiotemporal trajectory data based on parallel computing platforms such as Graphics Processing  ...  , k-NN queries, and spatial join.  ... 
doi:10.1007/978-3-319-25660-3_4 fatcat:qdkslwlgjzesdfnzvkbrpsgmti
« Previous Showing results 1 — 15 out of 42,427 results