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

International Conference on Hydrology and Management of Forested Wetlands

作者： Chen, X. Bao, S. Li, H. Wu, Z. Fu, W. Cai, X. Zhao, H. Liu, Y. Peng, G. State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan 430079 China Key Lab. of Poyang Lake Ecological Environment Resource Development Jiangxi Normal University Nanchang Jiangxi China China Data Center University of Michigan United States Environmental Monitoring Centre of Jiangxi Province Nanchang Jiangxi 330029 China

ISBN: (纸本)1892769530

Poyang Lake watershed mainly consists of Poyang Lake and its five sub-watersheds. Its wetlands, the largest bird habitat in Asia, play an important role in biodiversity and ecologic protection. With the rapid economic growth and urbanization, the wetlands in Poyang Lake area have been shrinking and face many environmental challenges. To better understand the environmental and ecologic changes of wetlands in the Poyang Lake watersheds, we applied RS/GIS techniques and a mathematical model in a study of the relationship between land use/cover changes and sediment load of the Poyang Lake watershed. RS classification was used to detect the land use/cover change, and a relational searching algorithm of spatial objects was proposed to improve the classification accuracy of wetlands. The driving forces for the land use/cover change were also analyzed. Soil erosion by water, as a big environmental problem, reflects the process of surface water related to non - point source pollution that influences water quality, the environment, and ecology of wetlands. In this study GIS and RS technologies are employed to predict annual soil loss. This work prioritizes erosion-prone areas which are important sources of sediment and highlights the severity of soil erosion in the watershed. SSC (suspended sediment concentration) data were collected for the study period. The relationships among land use/cover change, erosion area variations and SSC alterations are examined for the study period. The results show that the land use/cover change in the watershed lessen sediment sources and led to less SSC load to the wetland. The Poyang Lake is less impacted by the SSC in 2000 compared with 1991.

关键词： Wetlands

来源：评论

学校读者我要写书评

暂无评论

Top-k entities query processing on uncertainly fused multi-sensory data

Top-k entities query processing on uncertainly fused multi-s...

引用

作者： Liu, Dexi Wan, Changxuan Xiong, Naixue Park, Jong Hyuk Rho, Seungmin Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of School of Electrical Engineering Korea University Seoul Korea Republic of

Sensor fusion is the combining of sensory data from disparate sources such that the resulting information is in some sense better than would be possible when these sources were used individually. The natural uncertainty exists in these data because sensors are not precise enough. Hence, the intuitive method to store this kind of data is using uncertain database. Finding the top-k entities according to one or more attributes is a powerful technique when the uncertain database contains large quantity of data. However, compared to top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. We propose a method to process entity-based global top-k aggregate queries in uncertain database, which returns the top-k entities that have the highest aggregate value. Our method has two levels, entity state generation and G-topk-E query processing. In the former level, entity states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming-based global top-k entity query processing is employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2012 Springer-Verlag London Limited.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Sequential Manipulation Against Rank Aggregation: Theory and Algorithm

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2024年第12期46卷 9353-9370页

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Liu, Wei Cao, Xiaochun Sun, Yingfei Huang, Qingming Univ Chinese Acad Sci Sch Elect Elect & Commun Engn Beijing 100049 Peoples R China Chinese Acad Sci Inst Comp Technol Key Lab Intelligent Informat Proc Beijing 100190 Peoples R China Jiangxi Normal Univ Sch Comp & Informat Engn Nanchang 330022 Jiangxi Peoples R China Tencent Data Platform Shenzhen 518054 Peoples R China Sun Yat Sen Univ Sch Cyber Sci & Technol Shenzhen Campus Shenzhen 518107 Peoples R China Univ Chinese Acad Sci Key Lab Big Data Min & Knowledge Management BDKM Sch Comp Sci & Technol Beijing 100049 Peoples R China

Rank aggregation with pairwise comparisons is widely encountered in sociology, politics, economics, psychology, sports, etc. Given the enormous social impact and the consequent incentives, the potential adversary has a strong motivation to manipulate the ranking list. However, the ideal attack opportunity and the excessive adversarial capability cause the existing methods to be impractical. To fully explore the potential risks, we leverage an online attack on the vulnerable data collection process. Since it is independent of rank aggregation and lacks effective protection mechanisms, we disrupt the data collection process by fabricating pairwise comparisons without knowledge of the future data or the true distribution. From the game-theoretic perspective, the confrontation scenario between the online manipulator and the ranker who takes control of the original data source is formulated as a distributionally robust game that deals with the uncertainty of knowledge. Then we demonstrate that the equilibrium in the above game is potentially favorable to the adversary by analyzing the vulnerability of the sampling algorithms such as Bernoulli and reservoir methods. According to the above theoretical analysis, different sequential manipulation policies are proposed under a Bayesian decision framework and a large class of parametric pairwise comparison models. For attackers with complete knowledge, we establish the asymptotic optimality of the proposed policies. To increase the success rate of the sequential manipulation with incomplete knowledge, a distributionally robust estimator, which replaces the maximum likelihood estimation in a saddle point problem, provides a conservative data generation solution. Finally, the corroborating empirical evidence shows that the proposed method manipulates the results of rank aggregation methods in a sequential manner.

关键词： Online manipulation adversarial learning pairwise comparison ranking aggregation

来源：评论

学校读者我要写书评

暂无评论

Emotion-Cause Pair Extraction Based on knowledge-Transfer 21

Emotion-Cause Pair Extraction Based on Knowledge-Transfer

引用

21st Chinese National Conference on Computational Linguistic, CCL 2022

作者： Fengyuan, Zhao Dexi, Liu Qizhi, Wan Changxuan, Wan Xiping, Liu Guoqiong, Liao School of Information Management Jiangxi University of Finance and Economics Jiangxi Nanchang China Jiangxi University of Finance and Economics Key Laboratory of Data and Knowledge Engineering Jiangxi Nanchang China

The existing emotion cause pair extraction models do not improve the performance of emotion cause pair extraction by incorporating external knowledge. In this work, we propose an emotion-cause pair extraction model based on knowledge transfer (ECPE-KT), in which knowledge is utilized to obtain explicit knowledge encoding of text. Subsequently, the implicit knowledge encoding of clauses is obtained by the transfer of external sentiment classification corpus. Moreover, conduct filtering via adding the relative position and prediction probability to the representation of clause semantic features. Transformer with window mechanism is used to optimize the calculation pressure. Experimental results show that the proposed method outperforms the state-of-the-art method, i.e., ECPE-2D. © 2022 China National Conference on Computational Linguistics Published under Creative Commons Attribution 4.0 International License.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Evaluating journals' yearly impact with altmetric indicators

引用

Chinese Journal of Library and Information Science 2015年第2期 25-38页

作者： Simon S.LI Fred Y.YE School of Information Management Nanjing University Jiangsu Key Lab of Data Engineering & Knowledge Service Nanjing University

Purpose： Applying SSCI journals of library and information science （LIS） as the research sample, we explore the feasibility of measuring academic journals＇ yearly social impact by using altmetric indicators. Design/methodology/approach： Using a sample of 66 SSCI joumals in LIS published in 2013, statistics regarding journal mentions in social media and other online tools were retrieved from *** and meanwhile citation data was also collected from JCR and Scopus. Based on the method of principal component analysis, data was analyzed for associations between the altmetric and traditional metrics to demonstrate the effect ofaltmetric indicators on measuring academic j oumals＇ yearly impact. Findings： The Spearman＇s rank correlation test results show that altmetric indicators and traditional citation counts were significantly correlated, indicating that altmetrics can be used to measure a journal＇s yearly social impact. Research limitations： The time frame of data collected from *** may not be consistent with that of JCR and Scopus citation data. Practical implications： A new method is provided based on altmetrics for evaluating the social impact of academic journals, which can be applied to design new indicators of short-term journal impact. Originality value： In this paper, we have established a method for evaluating the social impact of academic journals based on altmetric indictors. Altmetrics can be complementary to traditional citation metrics in assessing a journal＇s impact within a year or even in a shorter period of time.

关键词： Altmetrics Journal evaluation Informetrics Bibliometrics Principalcomponent analysis （PCA）

来源：评论

学校读者我要写书评

暂无评论

Robust Analysis of Network based Recommendation Algorithms against Shilling Attacks

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2015年第3期9卷 13-23页

作者： Zhangi, Fuguo Jiangxi Univ Finance & Econ Sch Informat & Technol Nanchang Peoples R China Jiangxi Univ Finance & Econ Jiangxi Key Lab Data & Knowledge Engn Nanchang Peoples R China

Despite their great adoption in e-commerce sites, recommender systems are still vulnerable to unscrupulous producers who try to promote their products by shilling the systems. In the past decade, network based recommendation approaches have been demonstrated to be both more efficient and of lower computational complexity than collaborative filtering methods, however as far as we know, there is rare research on the robustness of network based recommendation approaches. In this paper, we conducted a serious of experiments to examine the robustness of five typical network based recommendation algorithms. The empirical results obtained from the movielens dataset show that all the two limited knowledge shilling attacks are successful against the network based algorithms, and the bandwagon attack affects very strongly against most network based recommendation algorithms, especially the algorithms considering the preferential diffusion at the last step. One way to relieve the attack impact is to assign the algorithm a heterogeneous initial resource configuration.

关键词： recommender system shilling attack network based algorithm hit ratio

来源：评论

学校读者我要写书评

暂无评论

Reference point reconstruction-based firefly algorithm for irregular multi-objective optimization

引用

APPLIED INTELLIGENCE 2023年第1期53卷 962-983页

作者： He, Yichen Peng, Hu Deng, Changshou Dong, Xiwei Wu, Zhijian Guo, Zhaolu Jiujiang Univ Sch Comp & Big Data Sci Jiujiang 332005 Peoples R China Wuhan Univ Sch Comp Sci Wuhan 430072 Peoples R China Jiangxi Univ Sci & Technol Sch Sci Ganzhou 341000 Peoples R China Jilin Univ Minist Educ Key Lab Symbol Computat & Knowledge Engn Changchun 130012 Peoples R China

Reference point-based environmental selection has achieved promising performance in multi-objective optimization problems. However, when solving the irregular multi-objective optimization problems, the performance of environmental selection is affected. This is because the irregular Pareto front is often degraded, disconnected, inverted, or with sharp tails, resulting in some reference points not located in appropriate region. This releases the selection pressure. Therefore, adjusting or generating some points is necessary to tackle this problem. However, how to identify the region of interest and how to generate new points in the appropriate region are the current problems to be solved. In this paper, a region-based reconstruction for reference points is proposed. For simplicity, the smallest region which consists of M reference points (M is the dimension of objective space) in the hyperplane of reference point is identified as the unit region. If the vertexes of the region all belong to active reference points, the region will be identified as region of interest and new reference points will be reconstructed in this region. In addition, the process is activated in the later stage of the algorithm operation, while the efficient of the search algorithm is weak. In order to find more valuable individuals in the neighborhood region of selected individuals, thereby, firefly algorithm is employed as search algorithm because of its search mechanism which has strong indicative features. Several experiments are designed to verify the performance of the proposed method. The experiment results show that the proposed method is effective.

关键词： Multi-objective optimization Region of interest Reference point reconstruction Firefly algorithm

来源：评论

学校读者我要写书评

暂无评论

HUSS:A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

引用

data Intelligence 2023年第3期5卷 537-559页

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S.Sheng Key Laboratory of Knowledge Engineering with Big Data(the Ministry of Education of China) Hefei University of TechnologyChinaSchool of Computer Science and Information EngineeringHefei University of TechnologyHefeiChina Research Institute of Artificial Intelligence Zhejiang LabHangzhouChina Department of Computer Science Texas Tech UniversityLubbockTX 79409USA

Spreadsheets contain a lot of valuable data and have many practical *** key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets,e.g.,identifying cell function types and discovering relationships between cell *** existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells.A few studies do,but they ignore the layout structure information of spreadsheets,which affects the performance of cell function classification and the discovery of different relationship types of cell *** this paper,we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets(HUSS).Specifically,for improving the cell function classification,we propose an error correction mechanism(ECM)based on an existing cell function classification model[11]and the layout features of *** improving the table structure analysis,we propose five types of heuristic rules to extract four different types of cell pairs,based on the cell style and spatial location *** experimental results on five real-world datasets demonstrate that HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Spreadsheet semantic structure Information extraction Heuristics Cell function analysis Table structure analysis

来源：评论

学校读者我要写书评

暂无评论

Synonyms weighted LDA for product aspects extraction

引用

International Journal of Applied Mathematics and Statistics 2013年第24期51卷 283-291页

作者： Peng, Yun Wan, Changxuan School of Information and Technology Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China Computer and Information Engineering College Jiangxi Normal University Nanchang 330022 Jiangxi China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China

It is important to extract the aspects from the comments of shoppers about certain products. Product aspect descriptions often contain words of same meaning, and discriminating these synonyms effectively can improve the efficiency of aspects extraction. Standard topic model in identifying those words, because of the absent introduction of priori knowledge, will largely ignore the relations of words meaning. An improved aspects extracting model of LDA by adding synonymous words constraint is proposed in this paper. In the process of words clustering analysis, words with high similarity are aggregated in the same cluster. In the stage of aspects extraction, we introduce words clustering and cluster membership weights as priori knowledge to strengthen the original LDA topic model for features clustering, which can improve the accuracy of product aspects extraction. Our experiments show that synonyms weighted LDA proposed in this paper outperforms the original LDA by a large margin. © 2013 by CESER Publications.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Which One Is Better, Simple or Complex Metrics?

引用

Journal of Computer and Communications 2015年第11期3卷 52-57页

作者： Fangjun Wu School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China High Level Engineering Research Center of Electronic-Commerce Jiangxi Provincial Colleges and Universities Nanchang China

At the early stage of software lifecycle, the complexity measurement of UML class diagrams plays an important role in software development, testing and maintenance, and provides guidance for developing high quality software. In order to study which one is better, simple or complex metrics, this paper analyzes and compares four typical metrics of UML class diagrams from experimental software engineering view points. Understandability, analyzability and maintainability were classified and predicted for 27 class diagrams related to a banking system by means of algorithm C5.0 within the famous toolkit Weka. Results suggest that the performance of simple metrics is not inferior to that of complex metrics, in some cases even better than that of complex metrics.

关键词： Software Measurement UML Class Diagram Empirical Validation Classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：