检索结果-内蒙古大学图书馆

Large scale report generation in data consolidation environments of banks

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) 2012年第SUPPL.1期40卷 5-8页

作者： Qin, Xiongpai Zhou, Xiaoyun Wu, Zhongxin Yang, Hongzhi Wang, Wei Ministry of Education Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China Information School Renmin University of China Beijing 100872 China Computer Science Department Jiangsu Normal University Xuzhou 221116 Jiangsu China Beijing Nantian Software Co. Ltd. Beijing 100085 China

To generate large number of reports in a limited time window, four techniques were proposed, including ROLAP&SQL, Shared Scanning, Hadoop based Solution, and MOLAP&Cube Sharding, an algorithm that performs in memory aggregation was designed for the second solution. The experiment results show that all techniques except ROLAP&SQL can meet the time window constraint, the Hadoop based solution is a promising technique owe to its highly scalability. Considering maturity of the techniques and their performance, we put MOLAP&Cube Sharding into practice while keeping an eye on Hadoop for future adoption.

关键词： Custom report data consolidation Hadoop Large bank MOLAP ROLAP

来源：评论

学校读者我要写书评

暂无评论

keynote lectures

Keynote lectures

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Metin Akay Yuan-Ting Zhang Konstantina S. Nikita Miguel Andrade Christos Ouzounis University of Houston Houston TX US EE-CUHK Hong Kong China and Director of the Key Lab for Health Informatics of Chinese Academy of Sciences (HICAS) at SIAT Shenzhen China Electrical Engineering at the N.T.U.A. Athens Greece Computational Biology and Data Mining group Max Delbrück Center for Molecular Medicine Berlin Germany Centre for Research & Technology Hellas (CERTH) Thessalonica Greece

These tutorials/keynote speeches discuss the following: the effects of nicotine exposure on the complexity and the genetic patterns of dopamine neurons in VTA; from 6-Ps medicine to cardiovascular health informatics; computer-aided interpretation of vascular images towards valid diagnosis and risk stratification of atherosclerosis; turning data into predictions of gene and protein function; from reading to writing (and rewriting) the code of life: the future of biology - scientific, ethical, legal, civil and social issues.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Probabilistic range queries for Uncertain Trajectories on road networks 11

Probabilistic range queries for Uncertain Trajectories on ro...

引用

14th International Conference on Extending database Technology: Advances in database Technology, EDBT 2011

作者： Zheng, Kai Trajcevski, Goce Zhou, Xiaofang Scheuermann, Peter School of ITEE University of Queensland Australia Department of EECS Northwestern University United States School of Information Renmin University of China Key Lab. of Data Engineering and Knowledge Engineering Ministry of Education China

ISBN: (纸本)9781450305280

Trajectories representing the motion of moving objects are typically obtained via location sampling, e.g. using GPS or road-side sensors, at discrete time-instants. In-between consecutive samples, nothing is known about the whereabouts of a given moving object. Various models have been proposed (e.g., sheared cylinders;spacetime prisms) to represent the uncertainty of the moving objects both in unconstrained Euclidian space, as well as road networks. In this paper, we focus on representing the uncertainty of the objects moving along road networks as time-dependent probability distribution functions, assuming availability of a maximal speed on each road segment. For these settings, we introduce a novel indexing mechanism - UTH (Uncertain Trajectories Hierarchy), based upon which efficient algorithms for processing spatio-temporal range queries are proposed. We also present experimental results that demonstrate the benefits of our proposed methodologies.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Identifying shopping center attractiveness using taxi trajectory data

Identifying shopping center attractiveness using taxi trajec...

引用

2011 International Workshop on Trajectory data Mining and Analysis, TDMA'11, Co-located with UbiComp 2011

作者： Yue, Yang Wang, Han Dong Hu, Bo Li, Qing Quan Transportation Research Center Wuhan University China State Key Lab. of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University China School of Geodesy and Geomatics Wuhan University China Engineering Research Center for Smart Acquisition and Applications of Spatiotemporal Data Ministry of Education Wuhan University China

ISBN: (纸本)9781450309332

Intensive research has demonstrated that shopping center attractiveness analysis, such as identifying catchment area, attracted trips, and attractiveness factors, can benefit not only market analysis, but also traffic management and urban planning. Conventionally, socioeconomic and survey data are needed to conduct the analysis, which is both labor-intensive and time-consuming. This study takes advantage of increasingly available taxi trajectory data to identify shopping center attractiveness using the case of Wuhan, a large city in China. The empirical results are consistent with previous studies. This demonstrates the feasibility of using trajectory data to generate choice-based sample and benefit market and related studies. Copyright 2011 ACM.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

XRCJ: Supporting keyword search in XML and relation co-occurrence

XRCJ: Supporting keyword search in XML and relation co-occur...

引用

1st International Workshop on Graph database, IWGD 2010, 1st International Workshop on Advanced Techniques on XML data Management, XMLDM 2010, 2nd International Workshop on WCMT 2010, Held in Conj. with WAIM 2010

作者： Zhang, Song Du, Xiaoyong Key Lab. of Data Engineering and Knowledge Engineering School of Information Renmin University of China China

ISBN: (纸本)3642167195

keyword search is a proven, user-friendly way to query html documents in the World Wide Web. With the trend of integrating IR technologies into DB community, state-of-the-art studies have introduced keyword search into XML and relation. In this paper we introduce keyword search into a new circumstance called XRC (XML and relation co-occurrence) where XML and relational data exist at the same storage. By exploring semantic relationships between data from relation and XML, we enable users who intend to visit data from XML and relation to access information in an easier manner. To achieve this target, we propose a novel operation called XRCJ which connects data from XML and relation together when answering search query. We also improve traditional inverted index and design a mixed inverted index. Through conducting extensive experiments on synthetic data from real data set DBLP, we find that our method can achieve a good performance in XML and relation co-occurrence circumstance. © 2010 Springer-Verlag.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Managing a large shared bank of unstructured data by using free-table

Managing a large shared bank of unstructured data by using f...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Zhang, Xiao Du, Xiaoyong Chen, Jinchuan Wang, Shan Renming University of China Key Lab. of Data Engineering and Knowledge Engineerging MOE China 59 Zhongguancun Street Beijing China

ISBN: (纸本)9780769540122

This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for endusers and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not columnoriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable. © 2010 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Parallel SimRank computation on large graphs with iterative aggregation

Parallel SimRank computation on large graphs with iterative ...

引用

16th ACM SIGKDD International Conference on Knowledge Discovery and data Mining, KDD-2010

作者： He, Guoming Feng, Haijun Li, Cuiping Chen, Hong Key Lab. of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science Renmin University of China China No. 59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781450300551

Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in practice;and 2) they can only be applied on static graphs. In this paper, we exploit the inherent parallelism and high memory bandwidth of graphics processing units (GPU) to accelerate the computation of SimRank on large graphs. Furthermore, based on the observation that SimRank is essentially a first-order Markov Chain, we propose to utilize the iterative aggregation techniques for uncoupling Markov chains to compute SimRank scores in parallel for large graphs. The iterative aggregation method can be applied on dynamic graphs. Moreover, it can handle not only the link-updating problem but also the node-updating problem. Extensive experiments on synthetic and real data sets verify that the proposed methods are efficient and effective. © 2010 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Hierarchical certificateless signatures

Hierarchical certificateless signatures

引用

International Workshop on Wireless Network Algorithm and Theory

作者： Zhang, Lei Wu, Qianhong Domingo-Ferrer, Josep Qin, Bo UNESCO in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Catalonia Spain Wuhan University School of Computer Key Lab. of Aerospace Information Security and Trusted Computing China Xi'an University of Technology School of Science Department of Maths China

ISBN: (纸本)9780769543222

Certificateless cryptography eliminates the key escrow problem in identity-based cryptography. Hierarchical cryptography exploits a practical security model to mirror the organizational hierarchy in the real world. In this paper, to incorporate the advantages of both types of cryptosystems, we instantiate hierarchical certificateless cryptography by formalizing the notion of hierarchical certificateless signatures. Furthermore, we propose an HCLS scheme which, under the hardness of the computational Diffie-Hellman (CDH) problem, is proven to be existentially unforgeable against adaptive chosen-message attacks in the random oracle model. As to efficiency, our scheme has constant complexity, regardless of the depth of the hierarchy. Hence, the proposal is secure and scalable for practical applications. © 2010 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Workflow-Based Spatial Modeling Environment and Its Application in Food Provisioning Services of Grassland Ecosystem

Workflow-Based Spatial Modeling Environment and Its Applicat...

引用

The 18th International Conference on Geoinformatics(第18届国际地理信息科学与技术大会 Geoinformatics 2010)

作者： Yimin Lu Tianxiang Yue Qinmin Wang Chenliang Wang State Key Lab.of Resources & Environmental Information System Institute of Geographic Sciences and N Key Laboratory of Data Mining & Information Sharing of Ministry of Education Spatial Information Res The College of Information Science and Engineering Shandong University of Science and Technology Qin

ISBN: (纸本)9781424473014

Nowadays, the key strategic issues about resource and environment, such as global warming, water resources shortage, food security etc. are more complex and multidisciplinary than ever before. In scientific research, the developmental tendency of modelling and integrating technique is all but irreversible. Focusing on the topic of model integration, we develop a Workflow-based Spatial Modeling Environment (WF-SME) which enables scientists and modeling users easy to design and create of complex systems models through a drag-drop operation or editing mathematical formula in model constructor. WF-SME, a visual integrated modeling environment is mainly used for the rapid realization of model dynamic integration, in which we can implement the composition and connection of the existing models, and generate new model through graphical operation. The papers firstly introduce the framework of model integration designed for WF-SME as well as its supporting theory, and then explain in detail how the modules of WF-SME have been realized. WF-SME is a platform for spatial modelling, which was designed in four parts, Spatial Workflow Designer, Model builder, Spatial Calculation engine and Visualization of Modelling Output. The spatial workflow designer built-in WFSME shipping with toolsets was adopted to create spatial workflow, reuse and aggregate models. Consisting of equation editor and data banding tool, the model builder enable modeller updates formulas on-demand. This editor parsed by MathML is powerful and flexible enough for the requirements of expressions of mathematical calculations. The spatial calculating engine developed based on component, through the map algebra language, executes mathematical calculations. The multi-form visualization module was developed to provide visual expression for a series of intermediate data and its result of the domain models. Finally, we illustrate how the typical practical application sample has been modeled in our modeling environment

关键词： Spatial workflow:Modeling environment:Model builder:MathML:Grassland ecosystem:Food provisioning model

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：