Should anticoagulants be administered for portal vein thrombosis associated with acute pancreatitis?

Venous complications in patients with acute pancreatitis typically occur as a form of splenic,portal,or superior mesenteric vein thrombosis and have been detected more frequently in recent reports.Although a well-organized protocol for the treatment of venous thrombosis has not been established,anticoagulation therapy is commonly recommended.A 73-year-old man was diagnosed with acute progressive portal vein thrombosis associated with acute pancreatitis.After one month of anticoagulation therapy,the patient developed severe hematemesis.With endoscopy and an abdominal computed tomography scan,hemorrhages in the pancreatic pseudocyst,which was ruptured into the duodenal bulb,were confirmed.After conservative treatment,the patient was stabilized.While the rupture of a pseudocyst into the surrounding viscera is a well-known phenomenon,spontaneous rupture into the duodenum is rare.Moreover,no reports of upper gastrointestinal bleeding caused by pseudocyst rupture in patients under anticoagulation therapy for venous thrombosis associated with acute pancreatitis have been published.Herein,we report a unique case of massive upper gastrointestinal bleeding due to pancreatic pseudocyst rupture into the duodenum,which developed during anticoagulation therapy for portal vein thrombosis associated with acute pancreatitis.

k-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks

Recent development of wireless communication technologies and the popularity of smart phones .are making location-based services （LBS） popular. However, requesting queries to LBS servers with users＇ exact locations may threat the privacy of users. Therefore, there have been many researches on generating a cloaked query region for user privacy protection. Consequently, an efficient query processing algorithm for a query region is required. So, in this paper, we propose k-nearest neighbor query （k-NN） processing algorithms for a query region in road networks. To efficiently retrieve k-NN points of interest （POIs）, we make use of the Island index. We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage. Finally, we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor （kRNN） algorithm in terms of network expansion cost and query processing time.