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

23rd ACM International Conference on Information and knowledge Management, CIKM 2014

作者： Li, Rui Zhang, Xiao Zhou, Xin Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781450325981

It is insufficient to search temporal text by only focusing on either time attribute or keywords today as we pay close attention to the evolution of event with time. Both temporal and textual constraints need to be considered in one single query, called Top-k Interval keyword Query (TIKQ). In this paper, we presents a cloud-based system named INK that supports efficient execution of TIKQs with appropriate effectiveness on Hadoop and HBase. In INK, an Adaptive Index Selector (AIS) is devised to choose the better execution plan for various TIKQs adaptively based on the proposed cost model, and leverage two novel hybrid index modules (TriI and IS-Tree) to combine keyword and interval filtration seamlessly.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

HDROP: Detecting ROP attacks using performance monitoring counters

HDROP: Detecting ROP attacks using performance monitoring co...

引用

10th International Conference on Information Security Practice and Experience, ISPEC 2014

作者： Zhou, Hongwei Wu, Xin Shi, Wenchang Yuan, Jinhui Liang, Bin Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China School of Information Renmin University of China Beijing China Information Engineering University Zhengzhou China

ISBN: (纸本)9783319063195

Combining short instruction sequences originated only from existing code pieces, Return Oriented Programming (ROP) attacks can bypass the code-integrity effort model. To defeat this kind of attacks, current approaches check every instruction executed on a processor, which results in heavy performance overheads. In this paper, we propose an innovative approach, called HDROP, to detecting the attacks. It utilizes the observation that ROP attacks often make branch predictor in modern processors fail to determine the accurate branch destination. With the support of PMC (Performance Monitoring Counters) that is capable of counting performance events, we catch the abnormal increase in branch mis-prediction and detect the existence of ROP attacks. In HDROP, each basic unit being checked consists of hundreds of instructions rather than a single one, which effectively avoids significant performance overheads. The prototype system we developed on commodity hardware shows that HDROP succeeds in detecting ROP attacks, and the performance tests demonstrate that our approach has acceptably lower overheads. © 2014 Springer International Publishing.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Selecting a representative set of diverse quality reviews automatically 14

Selecting a representative set of diverse quality reviews au...

引用

14th SIAM International Conference on data Mining, SDM 2014

作者： Xu, Nana Liu, Hongyan Chen, Jiawei He, Jun Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China School of Economics and Management Tsinghua University China

ISBN: (纸本)9781510811515

Online user reviews are important information for both consumers and vendors. More and more people make their purchase decisions based on online reviews. Vendors also pay more and more attention to online reviews. However, as the number of reviews increases rapidly, the information overload problem prevents us making full use of online reviews. In this paper, we study how to find a representative set of high quality reviews to cover diversified aspects of user opinions. Existing work cannot solve this problem well. To overcome the drawbacks of existing methods, we define a new problem of finding the minimum set of reviews to cover all of features with different sentiment polarity and high quality without user-defined parameters. To solve the problem efficiently, we define potential objective function and develop greedy algorithm to find the solution in polynomial-time with approximation guarantee. We also propose two strategies to further rcducc the number of reviews and to prune the search space respectively. Comprehensive experiments conducted on real review sets show that the proposed methods are effective and outperform existing methods. Copyright © SIAM.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

A hardware sandbox using processor virtualization for untrusted native code

A hardware sandbox using processor virtualization for untrus...

引用

2013 International Forum on Computer and Information Technology, IFCIT 2013

作者： Wu, Xin Shi, Wen Chang Liang, Bin Key Laboratory of Data Engineering and Knowledge Engineering Renmin University Ministry Of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9783038350194

Native code which is in the form of browser plugins and native binaries in browser extensions brings significant security threats and has attracted considerable attention in recent years. Many researches focus on dangerous behaviors in browser extensions for new security countermeasures but there is no fundamental improvement. Constructing an individual isolation domain and providing sandboxed execution of the code is a key idea to address this problem. However current approach relies heavily on the trust of a module executing within the context of the whole untrusted browser code base accompanied with inevitable vulnerabilities. In this paper, we propose an innovative sandbox utilizing the hardware virtualization support available in modern Intel and AMD processors to construct an individual isolation domain for each benign-but-buggy native code. Our approach push the responsibilities for security down to the hardware level and minimize the difficulties encountered with software based approaches. By utilizing the processor instruction VMENTER or VMEXIT to cause the context switch, we can obtain a better system performance. © (2014) Trans Tech Publications, Switzerland.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

DCFl-Checker： Checking Kernel Dynamic Control Flow Integrity with Performance Monitoring Counter

引用

China Communications 2014年第9期11卷 31-46页

作者： SHI Wenchang ZHOU Hongwei YUAN Jinhui LIANG Bin School of Information Renmin University of China Beijing 100872 China Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education (Renmin University of China) Beijing 100872 China Information Engineering University Zhengzhou 450004 China

It is a challenge to verify integrity of dynamic control flows due to their dynamic and volatile nature. To meet the challenge, existing solutions usually implant an ＂attachment＂ in each control transfer. However, the attachment introduces additional cost except performance penalty. For example, the attachment must be unique or restrictedly modified. In this paper, we propose a novel approach to detect integrity of dynamic control flows by counting executed branch instructions without involving any attachment. Our solution is based on the following observation. If a control flow is compromised, the number of executed branch instructions will be abnormally increased. The cause is that intruders usually hijack control flows for malicious execution which absolutely introduces additional branch instructions. Inspired by the above observation, in this paper, we devise a novel system named DCFI- Checker, which detect integrity corruption of dynamic control flows with the support of Performance Monitoring Counter （PMC）. We have developed a proof-of-concept prototype system of DCFI-Checker on Linux fedora 5. Our experiments with existing kemel rootkits and buffer overflow attack show that DCFI- Checker is effective to detect compromised dynamic control transfer, and performance evaluations indicate that performance penaltyinduced by DCFI-Checker is acceptable.

关键词： integrity dynamic control flow kernel branch performance monitoringcounter

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

Achieving efficient and secure range query in two-tiered wireless sensor networks

Achieving efficient and secure range query in two-tiered wir...

引用

International Workshop on Quality of Service

作者： Xiaoying Zhang Lei Dong Hui Peng Hong Chen Deying Li Cuiping Li Ministry of Education Key Laboratory of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781479950058

Wireless sensor network is an important part of the Internet of Things. Preservation of privacy and integrity in wireless sensor networks is extremely urgent and challenging. To address this problem, we propose in this paper an efficient and secure range query protocol in two-tiered wireless sensor networks introducing master nodes. Our proposal not only prevents adversaries from gaining sensitive information of both queries issued by users and data collected by sensor nodes but also allows the sink to verify whether results are valid. It offers confidentiality of queries and data by constructing a special code, provides integrity verification by the correlation among data and also enables efficient query processing. Finally, theoretical analysis and simulation results confirm the security and efficiency of our proposal.

关键词： Protocols Wireless sensor networks Equations Privacy data privacy Security Quality of service

来源：评论

学校读者我要写书评

暂无评论

Predicting user influence based on improved linear threshold model in social networks

引用

Journal of Computational Information Systems 2014年第14期10卷 6151-6160页

作者： Tian, Zhongsheng Wang, Ying Zhao, Qiuyue Zuo, Wanli College of Software Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Key Lab. of Symbolic Computation and Knowledge Engineering Attached to the Ministry of Education Changchun China

With the scale of social networks growing rapidly, the amount of user participating in it increases at astonishing speed. Predicting user influence in social networks is an interesting and useful research direction. There are lots of works on this area, mainly covering the following aspects: Maximize Influence, Influence Diffusion, Predicting Influential Users and Predicting social influence. The common issue of above aspects is that they can't calculate the precise user influence. In this work, we propose a novel method to give each user influence a precise value in social networks. The proposed method is based on Improved Linear Threshold Model (ILTM). To build ILTM, we take a series of measures to overcome the deficiencies brought by Linear Threshold Model, such as assigning random threshold to node, cold start. So we adopt user similarity instead of random threshold and utilize cluster algorithm and link analysis algorithm to surmount cold start. © 2014 by Binary Information Press

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A new, faint population of X-ray transients

arXiv

引用

arXiv 2017年

作者： Bauer, Franz E. Treister, Ezequiel Schawinski, Kevin Schulze, Steve Luo, Bin Alexander, David M. Brandt, William N. Comastri, Andrea Forster, Francisco Gilli, Roberto Kann, David Alexander Maeda, Keiichi Nomoto, Kenichi Paolillo, Maurizio Ranalli, Piero Schneider, Donald P. Shemmer, Ohad Tanaka, Masaomi Tolstov, Alexey Tominaga, Nozomu Tozzi, Paolo Vignali, Cristian Wang, Junxian Xue, Yongquan Yang, Guang Instituto de Astrofísica Facultad de Física Pontificia Universidad Católica de Chile 306 Santiago 22 Chile Nuncio Monseñor Sótero Sanz 100 Providencia Santiago Chile Space Science Institute 4750 Walnut Street Suite 205 BoulderCO80301 United States EMBIGGEN Anillo Concepción Chile Departamento de Astronomía Universidad de Concepción Casilla 160-C Concepción Chile Institute for Astronomy Department of Physics ETH Zurich Wolfgang-Pauli-Strasse 27 ZurichCH-8093 Switzerland School of Astronomy and Space Science Nanjing University Nanjing210093 China Ministry of Education Nanjing210093 China Department of Physics Durham University DurhamDH1 3LE United Kingdom Department of Astronomy and Astrophysics Pennsylvania State University 525 Davey Lab University ParkPA16802 United States Institute for Gravitation and the Cosmos Pennsylvania State University University ParkPA16802 United States Department of Physics 104 Davey Laboratory Pennsylvania State University University ParkPA16802 United States INAF-Osservatorio Astronomico di Bologna via Ranzani 1 Bologna40127 Italy Centro de Modelamiento Matemático Universidad de Chile Av. Blanco Encalada 2120 Piso 7 Santiago Chile Thüringer Landessternwarte Tautenburg Sternwarte 5 Tautenburg07778 Germany Department of Astronomy Kyoto University Kitashirakawa-Oiwake-cho Sakyo-ku Kyoto606-8502 Japan University of Tokyo KashiwaChiba277-8583 Japan Hamamatsu Department of Physics University Federico II via Cintia 9 Naples80126 Italy INFN - Sezione di Napoli via Cinthia 9 Naples80126 Italy Agenzia Spaziale Italiana Science Data Center via del Politecnico snc Roma00133 Italy Lund Observatory Department of Astronomy and Theoretical Physics Lund University Box 43 Lund22100 Sweden Department of Physics University of North Texas DentonTX76203 National Astronomical Observatory of Japan Mitaka Tokyo181-8588 Japan Department of Physics Faculty of Science and Engineering Konan University 8-

We report on the detection of a remarkable new fast high-energy transient found in the Chandra Deep Field-South, robustly associated with a faint (mR = 27.5 mag, zph∼2.2) host in the CANDELS survey. The X-ray event is comprised of 115+−1211 net 0.3–7.0 keV counts, with a light curve characterised by a ≈100 s rise time, a peak 0.3–10 keV flux of ≈5×10−12 erg s−1 cm−2, and a power-law decay time slope of −1.53 ± 0.27. The average spectral slope is Γ = 1.43+−00..2313, with no clear spectral variations. The X-ray and multi-wavelength properties effectively rule out the vast majority of previously observed high-energy transients. A few theoretical possibilities remain: an "orphan" X-ray afterglow from an off-axis short-duration Gamma-ray Burst (GRB) with weak optical emission;a low-luminosity GRB at high redshift with no prompt emission below ∼20 keV rest-frame;or a highly beamed Tidal Disruption Event (TDE) involving an intermediate-mass black hole and a white dwarf with little variability. However, none of the above scenarios can completely explain all observed properties. Although large uncertainties exist, the implied rate of such events is comparable to those of orphan and low-luminosity GRBs as well as rare TDEs, implying the discovery of an untapped regime for a known transient class, or a new type of variable phenomena whose nature remains to be determined. Copyright © 2017, The Authors. All rights reserved.

关键词： Luminance

来源：评论

学校读者我要写书评

暂无评论

Integrity constraint validation for ontology using modularization

引用

Journal of Information and Computational Science 2014年第8期11卷 2705-2713页

作者： Cui, Xianji Ouyang, Dantong Ye, Yuxin Su, Jing College of Computer Science and Technology Jilin University Changchun 130012 China Key Lab. of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China National Engineering Research Center of Geophysics Exploration Instruments Jilin University Changchun 130026 China

In the last years, integrity constraint validation over the ontology with expressive description logics is a prominent reasoning service in ontology engineering, as integrity constraints are added into the ontology to guarantee the legal states of ontology data. The integrity constraint validation can be converted into the conjunctive query answering, we thus check the satisfaction of integrity constraints in ontology knowledge base based on the tableau algorithm and further use the existing reasoning systems. With the increase of the ontology data set, however, these reasoning systems reveal the bad performance in real-life ontologies. In order to reduce the amount of information that must be taken into account, we apply the idea of modularization to break down the terminologies and assertions with respect to integrity constraints, and get smaller chunks for them. The empirical results are presented to demonstrate the high efficiency and an improvement of integrity constraint validation. Copyright © 2014 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：