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

201. IEEE/ACIS 1.th International Conference on Computer and Information Science, ICIS 201.

作者： Liu, Runnan Wang, Puwei Zheng, Shixian Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China

ISBN: (纸本)9780769546940

As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user. © 201. IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

ETD-cache: An expiration-time driven cache scheme to make SSD-based read cache endurable and cost-efficient 15

ETD-cache: An expiration-time driven cache scheme to make SS...

引用

1.th ACM International Conference on Computing Frontiers, CF 201.

作者： Dai, Ningwei Chai, Yunpeng Liang, Yushi Wang, Chunling Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing100872 China

ISBN: (纸本)9781450333580

Recently flash-based solid-state drives (SSDs) have been widely deployed as cache devices to boost system performance. However, classical SSD cache algorithms (e.g. LRU) replace the cached data frequently to maintain high hit rates. Such aggressive data updating strategies result in too many writing operations on SSDs and make them wear out quickly, which finally leads to high costs of SSDs for enterprise applications. In this paper, we propose a novel Expiration-Time Driven Cache (ETD-Cache) method to solve this problem. In ETD-Cache, an active data eviction mechanism is adopted. An already cached block leaves the SSD cache if and only if there is no access to it for a time longer than a specified expiration time. This mechanism gives more time for the cached contents to wait for their following accesses and limits the admission of newly arrived blocks to generate less SSD writes. In addition, a low-overhead candidate management module is designed to maintain the most popular data in the system for the potential cache replacement. The simulations driven by a series of typical real-world traces indicate that due to the great reduction on data updating frequency, ETD-Cache lowers the total SSD costs by 98.45% compared with LRU under the same cache hit rate. Copyright 201. ACM.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

An integrated classification model for massive short texts with few words 19

An integrated classification model for massive short texts w...

引用

201. International Conference on Robotics Systems and Vehicle Technology, RSVT 201.

作者： Tang, Xuetao Zhu, Yi Hu, Xuegang Li, Peipei Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China

ISBN: (纸本)9781450362429

The excellent performance of short texts classification has emerged in the past few years. However, massive short texts with few words like invoice data are different with traditional short texts like tweets in its no contextual and less semantic information, which hinders the application of conventional classification algorithms. To address these problems, we propose an integrated classification model for massive short texts with few words. More specifically, the word embedding model is introduced to train the word vectors of massive short texts with few words to form the feature space, and then the vector representation of each instance in texts is trained based on sentence embedding. With this integrated model, higher level representations are learned from massive short texts with few words. It can boost the performance of the base subsequent classifiers such as K-Nearest Neighbor. Extensive experiments conducted on dataset including 1. million real data demonstrate the superior classification performance of our proposed model compared with all competing state-of-the-art models. © 201. Association for Computing Machinery.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Size-fixed group discovery via multi-constrained graph pattern matching

引用

Information Sciences 2025年 690卷

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education 230601 Hefei China School of Computer Science and Information Engineering Hefei University of Technology 230601 Hefei China Department of Computing Macquarie University Sydney 2122 Australia

Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Representation learning via an integrated autoencoder for unsupervised domain adaptation

引用

Frontiers of Computer Science 2023年第5期17卷 75-87页

作者： Yi ZHU Xindong WU Jipeng QIANG Yunhao YUAN Yun LI School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230601China

The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose {1. distribution is different from that of the target domain for promoting the learning task in the target *** key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain ***,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of {1. into consideration for improving the effectiveness of unsupervised domain ***,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain *** address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called *** capture the inter-and inner-domain features of the raw {1.,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature *** higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain *** addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local *** results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.

关键词： unsupervised domain adaptation representation learning marginalized autoencoder convolutional autoen-coder sparse autoencoder

来源：评论

学校读者我要写书评

暂无评论

Segment-Adaptive Spread Spectrum Audio Watermarking Using NSGA-Ⅱ

引用

Chinese Journal of Electronics 2021年第4期30卷 727-735页

作者： SU Zhaopin ZHANG Guofu ZHOU Xianxian LI Wangwang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei University of Technology

In the field of robust audio watermarking,how to seek a good trade-off between robustness and imperceptibility is challenging. The existing studies use the same embedding parameter for each part of the audio signal, which ignores that different parts may have different requirements for embedding parameters. In this work, the constraints on imperceptibility are first ***, we present a segment multi-objective optimization model of the scaling parameter under the constrained Signal-to-noise ratio(SNR) in Spread spectrum(SS)audio watermarking. Additionally, we adopt the Nondominated sorting genetic algorithm Ⅱ(NSGA-Ⅱ) to solve the proposed model. Finally, we compare our algorithm(called SS-SNR-NSGA-Ⅱ) with the existing methods. The experimental results show that the proposed SS-SNRNSGA-Ⅱ not only provides flexible choices for different application demands but also achieves more and better trade-offs between imperceptibility and robustness.

关键词： Spread spectrum audio watermarking Scaling parameter Segment Constrained SNR NSGA-Ⅱ

来源：评论

学校读者我要写书评

暂无评论

Model test of the tunnel subjected to high water pressure in Jinping Second Cascade Hydropower Station,China

引用

Science China(Technological Sciences) 2011年第S1期54卷 192-198页

作者： WANG JianXiu 1.2,FENG Bo 2,HU LiSheng 2,TIAN PuZhuo 2,SUI DongChang 2,TANG YiQun 1.2 &YANG Ping 1.2 1.key {1. of Geotechnical and Underground engineering of ministry of education,Tongji University,Shanghai 200092,China 2 Department of Geotechnical engineering,Tongji University,Shanghai 200092,China 1. Key Laboratory of Geotechnical and Underground Engineering of Ministry of Education Tongji University Shanghai 200092 China2. Department of Geotechnical Engineering Tongji University Shanghai 200092 China

In the area with high groundwater pressure,grout curtain is often adopted to reduce the water pressure on tunnel lining.A series of model tests for the diversion tunnel of the Jinping Second Cascade Hydropower Station,China,is designed to study the effect of grout *** impact of the thickness of grout curtain,permeability of grout curtain,internal water pressure and drainage inflow on the distribution of water pressure are *** results indicates that under un-drained condition,water pressure is equal to hydrostatic one no matter grout curtain is selected or not,water pressure under drained condition is far less than that of un-drained condition,drainage in tunnel can reduce tunnel water pressure *** same inflow,both increasing of thickness and decrease of hydraulic conductivity of grout curtain can reduce water pressure *** the same water pressure,the smaller inflow of grout curtain,the less volume of water to be *** impact of hydraulic conductivity of grout curtain is more obvious than that of *** increasing of internal water pressure,the water pressure of grout curtain increases too,and the water pressure increases nearly *** proposed thickness of grout curtain for the diversion tunnels is 1. m.

关键词： tunnel grout curtain water pressure model test

来源：评论

学校读者我要写书评

暂无评论

Aptamer-based competitive electrochemical assay of small biomolecules

引用

Science China Chemistry 2011年第5期54卷 822-826页

作者： ZHANG YuYong,XIANG Yun,CHAI YaQin & YUAN Ruo key {1. on Luminescence and Real-Time Analysis,ministry of education School of Chemistry and Chemical engineering,Southwest University,Chongqing 40071.,China 1. Key Laboratory on Luminescence and Real-Time Analysis Ministry of Education School of Chemistry and Chemical Engineering Southwest University Chongqing 400715 China

A convenient aptamer-based competitive electrochemical biosensor for a small biomolecule,adenosine,was described. The sensing surface was fabricated by self-assembly of an aptamer/mercaptohexanol monolayer on a gold disk electrode. The principle of this aptasensor is based on the competition between an adenosine target molecule and a ferrocene-conjugated signaling DNA strand for the aptamer binding site on the sensing surface. Due to the competitive nature of this assay,the electrochemical responses of the surface captured ferrocene are inversely proportional to log[adenosine] in the range from 0.05 to 3.2 μM,with a detection limit of 25 nM. Moreover,the aptasensor also shows high selectivity for adenosine. The proposed aptasensor thus holds great potential for the detection of other small biomolecules.

关键词： aptamer adenosine biosensor competitive assay differential pulse voltammetry

来源：评论

学校读者我要写书评

暂无评论

Macro-micromechanical approaches for non-coaxiality of coarse grained soils

引用

Science China(Technological Sciences) 2011年第S1期54卷 147-153页

作者： QIAN JianGu 1.2,HUANG MaoSong 1.2 & SUN HaiZhong 1.2 1.key {1. of Geotechnical and Underground engineering of ministry of education,Tongji University,Shanghai 200092,China 2 Department of Geotechnical engineering,Tongji University,Shanghai 200092,China 1. Key Laboratory of Geotechnical and Underground Engineering of Ministry of Education Tongji University Shanghai 200092 China2. Department of Geotechnical Engineering Tongji University Shanghai 200092 China

For coarse grained soils,their principal stress directions may change when the water level of embankment dam varies *** this loading case,the principal directions of stress and strain rate will become *** an effort to model non-coaxial behavior,a modified three-dimensional non-coaxial model is developed in the context of vertex yield(tangent plasticity) *** Element Method(PFC) incorporating user-defined interparticle contact models is also employed to gain an insight into microscopic mechanism of *** analysis focuses on non-coaxial behaviors under simple shear *** has been shown that the proposed non-coaxial model gives good predictions for non-coaxiality with reference to microscopic observations while the classical coaxial model fails to simulate the non-coaxial *** general,non-coaxiality as a result of the rotation of principal stress,is large at a small shear strain,and inclined to become negligible with increasing shear *** coarse grained soils,their non-coaxiality tends to largely depend on the initial normal pressure,where a larger degree of non-coaxiality can be observed at a higher pressure.

关键词： coarse grained soils non-coaxiality particle flow code simple shear

来源：评论

学校读者我要写书评

暂无评论

Hierarchical All-Pairs SimRank Calculation 28th

Hierarchical All-Pairs SimRank Calculation

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Zhang, Liangfu Li, Cuiping Zhang, Xue Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9783031306747

All-pairs SimRank calculation is a classic SimRank problem. However, all-pairs algorithms suffer from efficiency issues and accuracy issues. In this paper, we convert the non-linear simrank calculation into a new simple closed formulation of linear system. And we come up with a sequence of novel algorithms to efficiently solve the linear system with accuracy guarantees. To reduce the memory consumption and improve the computational efficiency, we build a hierarchical framework to calculate the all-pairs SimRank scores, which includes locally coarse calculation and globally refine calculation. We first solve the local linear systems generated from the subgraphs, then we refine the SimRank scores on the full graph from the residuals of the local structures. We also show that our algorithms outperform the state-of-the-art all-pairs SimRank computation algorithms on real graphs. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：