载入中。。。 'S bLog
 
载入中。。。
  
载入中。。。
载入中。。。
载入中。。。
载入中。。。
载入中。。。
 
填写您的邮件地址，订阅我们的精彩内容：


 
ICDE 2013 Accepted Papers
[ 2013/4/14 22:17:00 | By: 梦翔儿 ]
 

ICDE 2013: 29TH IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING 

SPONSORED BY THE IEEE COMPUTER SOCIETY


SOFITEL BRISBANE CENTRAL HOTEL, BRISBANE, AUSTRALIA, APRIL 8-11, 2013



RESEARCH TRACK PAPERS


9. Finding Connected Components on Map-reduce in Logarithmic Rounds
  • Vibhor Rastogi (Google)
  • Ashwin Machanavajjhala (Duke University)
  • Laukik Chitnis (Google)
  • Anish Das Sarma (Google)

22. Similarity Query Processing for Probabilistic Sets
  • Ming Gao (ECNU)
  • Cheqing Jin
  • Wei Wang
  • Xuemin Lin (University of New South Wales)
  • Aoying Zhou

26. Scalable and Parallelizable Processing of Influence Maximization for Large-Scale Social Networks
  • Jinha Kim (POSTECH)
  • Seung-Keol Kim
  • Hwanjo Yu (Pohang University of Sciece and Technology)

28. A Unified Model for Stable and Temporal Topic Detection from Social Media Data
  • Hongzhi Yin (Peking University)
  • Bin Cui (Peking University)
  • Hua Lu (Aalborg University)
  • Yuxin Huang
  • Junjie Yao

46. Voronoi-based Nearest Neighbor Search for Multi-Dimensional Uncertain Databases
  • Peiwu Zhang (The University of Hong Kong)
  • Reynold Cheng (The University of Hong Kong)
  • Nikos Mamoulis (The University of Hong Kong)
  • Matthias Renz (Ludwig-Maximilians-Universit?t München)
  • Andreas Z黤le (Ludwig-Maximilians-Universit?t München)
  • Yu Tang (The University of Hong Kong)
  • Tobias Emrich (Ludwig-Maximilians-Universit?t München)

49. SociaLite: Datalog Extensions for Efficient Social Network Analysis
  • Jiwon Seo (Stanford)
  • Stephen Guo (Stanford)
  • Monica Lam (Stanford)

56. AFFINITY: Efficiently Querying Statistical Measures on Time-Series Data
  • Saket Sathe (EPFL)
  • Karl Aberer (EPFL)

58. The Bw-Tree: A B-tree for New Hardware Platforms
  • Justin Levandoski (Microsoft Research)
  • David Lomet (Microsoft Research)
  • Sudipta Sengupta (Microsoft Research)

62. SubZero: a Fine-Grained Lineage System for Scientific Databases
  • Eugene Wu (MIT)
  • Samuel Madden (MIT)
  • Michael Stonebraker

63. LinkProbe: Probabilistic Inference on Large-Scale Social Networks
  • Haiquan Chen (Valdosta State University)
  • Wei-Shinn Ku (Auburn University)
  • Haixun Wang (Microsoft)
  • Liang Tang (Auburn University)
  • Min-Te Sun (National Central University)

75. Sampling Node Pairs Over Graphs
  • Pinghui Wang (CUHK)
  • Junzhou Zhao (Xi'an Jiaotong University)
  • John Chi Shing Lui (CUHK)
  • Don Towsley (University of Massachusetts Amherst)
  • Xiaohong Guan (Xi'an Jiaotong University)

79. C-Cube: Elastic Continuous Clustering in the Cloud
  • Zhenjie Zhang ("ADSC, SG")
  • Hu Shu (Huawei Inc.)
  • Zhihong Chong (Southeast University, China)
  • Hua Lu (Aalborg University)
  • Yin Yang (Advanced Digital Sciences Center)

89. FERRARI: Flexible and Efficient Reachability Range Assignment for Graph Indexing
  • Stephan Seufert (Max Planck Institute for Infor)
  • Avishek Anand (Max Planck Institute for Informatics)
  • Srikanta Bedathur (IIIT Delhi)
  • Gerhard Weikum (Max Planck Institute for Informatics)

95. Logical Provenance in Data-Oriented Workflows
  • Robert Ikeda (Stanford University)
  • Akash Das Sarma
  • Jennifer Widom

99. Secure and Efficient Range Queries on Outsourced Databases Using $\widehat{R}$-trees
  • Peng Wang (UC Riverside)
  • Chinya Ravishankar (UC Riverside)

105. gIceberg: Towards Iceberg Analysis in Large Graphs
  • Nan Li (UCSB)
  • Ziyu Guan (UC Santa Barbara)
  • Lijie Ren
  • Jian Wu
  • Jiawei Han (University of Illinois at Urbana-Champaign)
  • Xifeng Yan (UC Santa Barbara)

113. Link Prediction across Networks by Biased Cross-Network Sampling
  • Guo-Jun Qi (UIUC)
  • Charu Aggarwal (IBM)
  • Thomas Huang (ECE UIUC)

118. Forecasting the Data Cube: A Model Configuration Advisor for Multi-Dimensional Data Sets
  • Ulrike Fischer (TU Dresden)
  • Christopher Schildt
  • Claudio Hartmann
  • Wolfgang Lehner (Dresden University of Technology)

127. Efficient Search Algorithm for SimRank
  • Yasuhiro Fujiwara (NTT)
  • Makoto Nakatsuji (NTT)
  • Hiroaki Shiokawa (NTT)
  • Makoto Onizuka

132. Top-k Query Processing in Probabilistic Databases with Non-Materialized Views
  • Aximilian Dylla
  • Iris Miliaraki (Max-Planck-Institut)
  • Martin Theobald

135. Recycling in Pipelined Query Evaluation
  • Fabian Nagel (The University of Edinburgh)
  • Peter Boncz (CWI)
  • Stratis Viglas (The University of Edinburgh)

154. SELECT Triggers for Data Auditing
  • Daniel Fabbri (University of Michigan)
  • Ravi Ramamurthy
  • Raghav Kaushik (Microsoft)

155. Predicting Query Execution Time: Are Optimizer Cost Models Really Unusable?
  • Wentao Wu (University of Wisconsin)
  • Yun Chi (NEC Laboratories America)
  • Shenghuo Zhu
  • Junichi Tatemura
  • Hakan Hacigumus (NEC Labs)
  • Jeffrey Naughton (University of Wisconsin Madison)

164. Cleaning Uncertain Data for Top-k Queries
  • Luyi Mo (University of Hong Kong)
  • Reynold Cheng (University of Hong Kong)
  • David Cheung
  • Xiang Li
  • Xuan Yang (The University of Hong Kong)

167. Catch the Wind: Graph Workload Balancing on Cloud
  • Zechao Shang (The Chinese University of Hong Kong)
  • Jeffrey Xu Yu (Chinese University of Hong Kong)

175. Interval Reverse Nearest Neighbor Queries on Uncertain Data with Markov Correlations
  • Chuanfei Xu (Northeastern Uinversity)
  • Yu Gu
  • Lei Chen (Hong Kong University of Science and Technology)
  • Jianzhong Qiao
  • Ge Yu (Northeastern University)

182. Ficklebase: Looking into the Future to Erase the Past
  • Sumeet Bajaj (Stony Brook University)
  • Radu Sion

184. On Answering Why-not Questions in Reverse Skyline Queries
  • Md. Saiful Islam (Swinburne Univ. of Technogy)
  • Rui Zhou (Swinburne Univ. Technology)
  • Chengfei Liu (Swinburne Univ. Technology)

188. HANDS: A Heuristically Arranged Non-Backup In-line Deduplication System
  • Avani Gadani (UC Santa Cruz)
  • Ethan Miller
  • Ohad Rodeh

189. Engineering Generalized Shortest Path Queries
  • Michael Rice (UCR)

192. Finding Distance-Preserving Subgraphs in Large Road Networks
  • Da Yan (HKUST)
  • James Cheng (CUHK)
  • Wilfred Ng (HKUST)
  • Kin Sum Liu (HKUST)

195. Fast Peak-to-Peak Restart for SSD Buffer Pool Extension
  • Jaeyoung Do (UW-Madison)
  • Donghui Zhang (Paradigm4)
  • Jignesh Patel (University of Wisconsin)
  • David DeWitt (Microsoft Jim Gray Systems Lab)

199. CPU and Cache Efficient Management of Memory-Resident Databases
  • Holger Pirk (CWI)
  • Florian Funke (TU M黱chen)
  • Martin Grund (HPI)
  • Thomas Neumann (Technische Universitat Munchen)
  • Ulf Leser (HU Berlin)
  • Stefan Manegold (CWI)
  • Alfons Kemper (Technische Universit鋞 M黱chen)
  • Martin Kersten (CWI)

219. On Discovery of Gathering Patterns from Trajectories
  • Kai Zheng (The University of Queensland)
  • Yu Zheng (Microsoft Research Asia)
  • Jing Yuan (Microsoft Research Asia)
  • Shuo Shang (Aalborg University)

220. Towards Efficient Search for Activity Trajectories
  • Kai Zheng (The University of Queensland)
  • Shuo Shang (Aalborg University)
  • Jing Yuan (Microsoft Research Asia)
  • Yi Yang (Carnegie Mellon University)

225. Stratification Driven Placement of Structured Data: A Framework for Distributed Data Analytics
  • Ye Wang (Ohio State)
  • Srinivasan Parthasarathy (The Ohio State University)
  • P Sadayappan (Ohio State)

237. Automatic Extraction of Top-k Lists from the Web
  • Zhixian Zhang (Shanghai Jiao Tong University)
  • Kenny Zhu (Shanghai Jiao Tong University)
  • Haixun Wang (Microsoft)
  • Hongsong Li (Microsoft Research Asia)

247. Optimizing Approximations of Query Lineage in Probabilistic XML
  • Asma Souihli (Institut Mines-Telecom)
  • Pierre Senellart (Institut Mines-Telecom)

253. On the Relative Trust between Inconsistent Data and Inaccurate Constraints
  • George Beskales (QCRI)
  • Ihab Ilyas ("Qatar Computing Research Institute, Qatar")
  • Lukasz Golab (University of Waterloo)
  • Artur Galiullin (University of Waterloo)

254. Holistic Data Cleaning: Put Violations Into Context
  • Xu Chu (University of Waterloo)
  • Ihab Ilyas ("Qatar Computing Research Institute, Qatar")
  • Paolo Papotti (QCRI)

266. Faster Random Walks By Rewiring Online Social Networks On-The-Fly
  • Zhuojie Zhou (George Washington University)
  • Nan Zhang (George Washington University)
  • Zhiguo Gong (University of Macau)
  • Gautam Das (UT Arlington and QCRI)

279. Identifying Hot and Cold Data in Main-Memory Databases
  • Justin Levandoski (Microsoft Research)
  • Paul Larson (Microsoft Research)
  • Radu Stoica

283. Towards Efficient SimRank Computation on Large Graphs
  • Weiren Yu (UNSW)
  • Xuemin Lin (University of New South Wales)
  • Wenjie Zhang (UNSW)

287. Inferring Data Currency and Consistency for Conflict Resolution
  • Wenfei Fan
  • Floris Geerts
  • Nan Tang (Qatar Computing Research Institute)
  • Wenyuan Yu (University of Edinburgh)

291. Ontology-based subgraph querying
  • YINGHUI WU (UCSB)
  • Shengqi Yang (University of California, Santa Barbara)
  • Xifeng Yan (UC Santa Barbara)

294. Learning from Distant Supervision: Exploiting Web Redundancy for Entity Search
  • Mianwei Zhou (UIUC)
  • Hongning Wang (UIUC)
  • Kevin Chang (UIUC)

297. RoundTripRank: Graph-based Proximity with Importance and Specificity
  • Yuan Fang (University of Illinois at Urba)
  • Kevin Chang (UIUC)
  • Hady Lauw (Singapore Management University)

300. Finding Interesting Correlations with Conditional Heavy Hitters
  • Katsiaryna Mirylenka
  • Graham Cormode (AT&T Labs Research)
  • Themis Palpanas (University of Trento, Italy)
  • Divesh Srivastava (AT&T Labs)

302. Accurate and Efficient Private Release of Datacubes and Contingency Tables
  • Graham Cormode (AT&T Labs Research)
  • Cecilia Procopiuc (AT&T Labs-Research)
  • Divesh Srivastava (AT&T Labs)
  • Grigory Yaroslavtsev

329. Graph Stream Classification using Labeled and Unlabeled Graphs
  • Shirui Pan (Univ. Technology Sydney)
  • Xingquan Zhu
  • Chengqi Zhang (QCIS, FEIT, UTS)
  • Philip Yu (UIC)

330. Presenting Diverse Location Views with Real-time Near-duplicate Photo Elimination
  • Jiajun Liu (The University of Queensland)
  • Zi Huang (The University of Queensland)
  • Heng Tao Shen (The University of Queensland)
  • Hong Cheng (The Chinese Univerity of Hong Kong)
  • Yueguo Chen (Renmin University of China)
  • Yanchun Zhang (Victoria University)

351. An Efficient and Compact Indexing Scheme for Large-scale Data Store
  • Peng Lu (National University of Singapo)
  • Sai Wu (Zhejiang University)
  • Lidan Shou (Zhejiang University)
  • Kian-Lee Tan (National University of Singapore)

363. Attribute Extraction and Scoring: A Probabilistic Approach
  • Taesung Lee (POSTECH)
  • Zhongyuan Wang (Microsoft)
  • Haixun Wang (Microsoft)
  • Seung-won Hwang (POSTECH)

368. Enumerating Subgraph Instances Using Map-Reduce
  • Foto Afrati (National Technical Uni Athens)
  • Dimitris Fotakis
  • Jeffrey Ullman

379. Top-K Oracle: A New Way to Present Top-K Tuples for Uncertain Data
  • Chunyao Song (University of Massachusetts, Lowell)
  • Zheng Li (University of Massachusetts, Lowell)
  • Tingjian Ge (University of Massachusetts, Lowell)

395. Inverted Linear Quadtree : Efficient Top K Spatial Keyword Search
  • chengyuan Zhang (UNSW)
  • Ying Zhang (University of New South Wales)
  • Wenjie Zhang (University of New South Wales)
  • Xuemin Lin (University of New South Wales)

398. Destination Prediction by Sub-Trajectory Synthesis and Privacy Protection Against Such Prediction
  • Andy Yuan Xue (The University of Melbourne)
  • Rui Zhang (University of Melbourne)
  • Yu Zheng (Microsoft Research Asia)
  • Xing Xie (Microsoft Research Asia)
  • Jin Huang (The University of Melbourne)
  • Zhenghua Xu (The University of Melbourne)

399. Breaking the Top-k Barrier of Hidden Web Databases
  • Saravanan Thirumuruganathan (University of Texas At Arlingt)
  • Nan Zhang (George Washington University)
  • Gautam Das (UT Arlington and QCRI)

401. T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
  • Shuo Ma (Univ. of Illinois at Chicago)
  • Yu Zheng (Microsoft Research Asia)
  • Ouri Wolfson (University of Illinois at Chicago)

410. On Incentive-based Tagging
  • Xuan Yang (The University of Hong Kong)
  • Reynold Cheng (University of Hong Kong)
  • Luyi Mo (University of Hong Kong)
  • Benjamin Kao (The University of Hong Kong)
  • David Cheung

411. Efficient Notification of Meeting Points for Moving Groups via Independent Safe Regions
  • Jing LI (The University of Hong Kong)
  • Man Lung Yiu (Hong Kong Polytechnic University)
  • Nikos Mamoulis (University of Hong Kong)

412. Efficient Distance-Aware Query Evaluation on Indoor Moving Objects
  • Xike Xie (AAU)
  • Hua Lu (Aalborg University)
  • Torben Pedersen (AAU)

415. The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases
  • Viktor Leis (Technische Universit鋞 M黱chen)
  • Alfons Kemper (TUM)
  • Thomas Neumann (TUM)

420. Interval Indexing and Querying on Key-Value Cloud Stores
  • George Sfakianakis (University of Patras)
  • Ioannis Patlakas (University of Patras)
  • Nikos Ntarmos (University of Patras)
  • Peter Triantafillou (University of Patras)

422. Time Travel in a Scientific Array Database
  • Emad Soroush (University of Washington)
  • Magdalena Balazinska (Univ of Washington)

426. Top-k Graph Pattern Matching over Large Graphs
  • Jiefeng Cheng (SIAT, China)
  • xianggang Zeng (SIAT, China)
  • Jeffrey Xu Yu (Chinese University of Hong Kong)

436. Top Down Plan Generation: From Theory to Practice
  • Pit Fender (University of Mannheim)
  • Guido Moerkotte (University of Mannheim)

438. EAGRE: Towards Scalable I/O Efficient SPARQL Query Evaluation on the Cloud
  • Xiaofei Zhang (HKUST)
  • Lei Chen (Hong Kong University of Science and Technology)
  • Yongxin Tong (HKUST)
  • Min Wang (HP Labs)

439. Coupled Clustering Ensemble: Incorporating Coupling Relationships Both between Base Clusterings and Objects
  • Can Wang (AAI, UTS)
  • Zhong She (AAI, UTS)
  • Longbing Cao (UTS)

463. Time Travel in Column Stores
  • Martin Kaufmann (ETH Z黵ich)
  • Amin Amiri Manjili (ETH Z黵ich)
  • Stefan Hildenbrand
  • Donald Kossmann (ETH Zurich)
  • Andreas Tonder (SAP AG)

476. Maximum Visibility Queries in Spatial Databases
  • Sarah Masud (BUET)
  • Farhana Murtaza Choudhury (BUET)
  • Mohammed Eunus Ali (BUET)
  • Sarana Nutanong (University of Maryland)

490. Query Optimization for Differentially Private Data Management Systems
  • Shangfu Peng (Shanghai Jiao Tong University)
  • Yin Yang (Advanced Digital Sciences Center)
  • Zhenjie Zhang ("ADSC, SG")
  • Marianne Winslett (University of Illinois at Urbana-Champaign)
  • Yong Yu (Shanghai Jiao Tong University)

517. Utilizing Social Pressure in Recommender Systems
  • Hu Kailun (NUS)
  • Wynne Hsu (NUS)
  • Mong Li Lee (NUS)

521. Trustworthy Data from Untrusted Databases
  • Rohit Jain (Purdue University)
  • Sunil Prabhakar (Purdue University)

528. Secure Nearest Neighbor Revisited
  • Feifei Li (University of Utah)
  • Bin Yao (Shanghai Jiao Tong University)
  • Xiaokui Xiao (Nanyang Technological University)

555. Memory-Efficient Algorithms for Spatial Network Queries
  • Sarana Nutanong (University of Maryland)
  • Hanan Samet (University of Maryland)

562. LSII: An Indexing Structure for Exact Real-Time Search on Microblogs
  • Lingkun Wu (Nanyang Technological University)
  • Xiaokui Xiao (Nanyang Technological University)
  • Yabo Xu (Sun Yet-Sen University)
  • Wenqing Lin (NTU, Singapore)

564. Layered Processing of Skyline-Window-Join (SWJ) Queries using Iteration-Fabric
  • Mithila Nagendra (Arizona State University)
  • K. Selcuk Candan (Arizona State University)

576. Efficient Snapshot Retrieval over Historical Graph Data
  • Udayan Khurana (University of Maryland)
  • Amol Deshpande (University of Maryland)

583. Scalable Maximum Clique Computation Using MapReduce
  • Jingen Xiang (University of Waterloo)
  • Cong Guo (University of Waterloo)
  • Ashraf Aboulnaga (University of Waterloo)

589. Top-k String Similarity Search with Edit-Distance Constraints
  • Dong Deng (Tsinghua University)
  • Guoliang Li (Tsinghua University)
  • Jianhua Feng (Tsinghua University)

595. Focused Matrix Factorization For Audience Selection in Display Advertising
  • Bhargav Kanagal (Google)
  • Amr Ahmed (Yahoo! Research)
  • Sandeep Pandey (Twitter)
  • Vanja Josifovski (Google)
  • Lluis Garcia-Pueyo (Yahoo! Research)
  • Jeff Yuan (Yahoo! Research)

597. Efficient Many-Core Query Execution in Main Memory Column-Stores
  • Jonathan Dees (SAP)
  • Peter Sanders (KIT - Karlsruher Institut fuer Technology)

612. Main-Memory Hash Joins on Multi-Core CPUs: Tuning to the Underlying Hardware
  • Cagri Balkesen (ETH Zurich)
  • Jens Teubner (ETH Zurich)
  • Gustavo Alonso (ETH Zurich)
  • M. Tamer 謟su (University of Waterloo)

613. Publicly Verifiable Grouped Aggregation Queries on Outsourced Data Streams
  • Suman Nath (Microsoft Research)
  • Ramarathnam Venkatesan (Microsoft Research)

615. Efficient Pattern Search in Compressed Genomic Sequences
  • Xiaochun Yang (Northeastern University)
  • Bin Wang (Northeastern University)
  • Chen Li (UC Irvine)
  • Xiaohui Xie (UCI)
  • Jiaying Wang (Northeastern University)

648. Differentially Private Grids for Geospatial Data
  • Wahbeh Qardaji (Purdue)
  • Weining Yang (Purdue University)
  • Ninghui Li (Purdue University)

650. On Shortest Unique Substring Queries
  • Jian Pei (Simon Fraser University)
  • Wush Chi-Hsuan Wu (Academia Sinica)
  • Mi-Yen Yeh (Academia Sinica)

654. Efficient Tracking and Querying for Coordinated Uncertain Mobile Objects
  • Nicholas Larusso (UCSB)
  • Ambuj Singh (UCSB)

668. TYPifier: Inferring the Type Semantics of Structured Data
  • Thanh Tran (AIFB)

678. Revision Provenance in Text Documents of Asynchronous Collaboration
  • Jing Zhang (University of Michigan)
  • H.V. Jagadish

684. Robust Distributed Stream Processing
  • Chuan Lei (WPI)
  • Elke Rundensteiner (WPI)
  • Joshua Guttman (WPI)

685. TBF: A Memory-Efficient Replacement Policy for Flash-based Caches
  • Cristian Ungureanu (NEC Labs)
  • Biplob Debnath (NEC Labs)
  • Steve Rago (sar@nec-labs.com)
  • Akshat Aranya (NEC Labs)

690. Crowdsourced Enumeration Queries
  • Katherine Trushkowsky (UC Berkeley)
  • Tim Kraska (University of California Berkeley)
  • Michael Franklin
  • Purnamrita Sarkar

746. SUSIE: Search Using Services and Information Extraction
  • Nicoleta Preda (University of Versailles)
  • Fabian Suchanek (Max Planck Institute for Informatics)
  • Wenjun Yuan (Universit? de Versailles)
  • Gerhard Weikum (Max Planck Institute for Informatics)

INDUSTRY TRACK PAPERS


35. Materialization Strategies in the Vertica Analytic Database: Lessons Learned
  • Lakshmikant Shrinivas, Vertica
  • Sreenath Bodagala, Vertica
  • Ramakrishna Varadarajan, Vertica
  • Ariel Cary, Vertica
  • Vivek Bharathan, Vertica
  • Chuck Bear, Vertica

130. Pipe Break Prediction: A Data Mining Method
  • Rui Wang, Univ of Sci & Tech of China
  • Weishan Dong, IBM Research - China
  • Yu Wang, IBM Research - China
  • Ke Tang, Univ. of Sci. & Tech. of China
  • Xin Yao, The University of Birmingham

479. SASH: Enabling Continuous Incremental Analytic Workflows on Hadoop
  • Manish Sethi, IBM
  • Narendran Sachindran, IBM
  • Sriram Raghavan, IBM

647. Automating Pattern Discovery for Rule Based Data Standarization Systems
  • Hima Prasad K, IBM Research -India
  • Snigdha Chaturvedi, IBM Research-India
  • Tanveer Faruqie
  • L Venkata Subramaniam, IBM Reasearch Lab. Delhi, India
  • Raghuram Krishnapuram, IBM Research-India

837. KuaFu: Closing the Parallelism Gap in Database Replication
  • Chuntao Hong, Microsoft

838. Data Services for E-tailers Leveraging Search Engine Assets
  • Tao Cheng, Microsoft Research

839. HFMS: Managing the Lifecycle and Complexity of Hybrid Analytic Data Flows
  • Alkis Simitsis, HP
  • Kevin Wilkinson, HP
  • Umeshwar Dayal, HP
  • Meichun Hsu, HP

From: http://www.icde2013.org/papers.html
 
 
  • 标签：ICDE 
    • 发表评论：
    载入中。。。

    		  
    		  
     

    梦翔儿网站 梦飞翔的地方 http://www.dreamflier.net
    中华人民共和国信息产业部TCP/IP系统 备案序号：辽ICP备09000550号

    Powered by Oblog.