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

Dual-stream coupling network with wavelet transform for cross-resolution person re-identification

Journal of Systems engineering and Electronics 2023年第3期34卷 682-695页

作者： SUN Rui YANG Zi ZHAO Zhenghui ZHANG Xudong Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education) Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China

Person re-identification is a prevalent technology deployed on intelligent *** have been remarkable achievements in person re-identification methods based on the assumption that all person images have a sufficiently high resolution,yet such models are not applicable to the open *** real world,the changing distance between pedestrians and the camera renders the resolution of pedestrians captured by the camera *** low-resolution(LR)images in the query set are matched with high-resolution(HR)images in the gallery set,it degrades the performance of the pedestrian matching task due to the absent pedestrian critical information in LR *** address the above issues,we present a dualstream coupling network with wavelet transform(DSCWT)for the cross-resolution person re-identification ***,we use the multi-resolution analysis principle of wavelet transform to separately process the low-frequency and high-frequency regions of LR images,which is applied to restore the lost detail information of LR ***,we devise a residual knowledge constrained loss function that transfers knowledge between the two streams of LR images and HR images for accessing pedestrian invariant features at various *** qualitative and quantitative experiments across four benchmark datasets verify the superiority of the proposed approach.

关键词： cross-resolution feature invariant learning person re-identification residual knowledge transfer wavelet transform

来源：评论

学校读者我要写书评

暂无评论

Attributes-based person re-identification via CNNs with coupled clusters loss

引用

Journal of Systems engineering and Electronics 2020年第1期31卷 45-55页

作者： SUN Rui HUANG Qiheng FANGWei ZHANG Xudong Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education) Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China

Person re-identification(re-id)involves matching a person across nonoverlapping views,with different poses,illuminations and *** attributes are understandable semantic information to help improve the issues including illumination changes,viewpoint variations and *** paper proposes an end-to-end framework of deep learning for attribute-based person *** the feature representation stage of framework,the improved convolutional neural network(CNN)model is designed to leverage the information contained in automatically detected attributes and learned low-dimensional CNN ***,an attribute classifier is trained on separate data and includes its responses into the training process of our person re-id *** coupled clusters loss function is used in the training stage of the framework,which enhances the discriminability of both types of *** combined features are mapped into the Euclidean *** L2 distance can be used to calculate the distance between any two pedestrians to determine whether they are the *** experiments validate the superiority and advantages of our proposed framework over state-of-the-art competitors on contemporary challenging person re-id datasets.

关键词： person re-identification(re-id) convolutions neural network(CNN) attributes coupled clusters loss(CCL)

来源：评论

学校读者我要写书评

暂无评论

A Review-Based Reputation Evaluation Approach for Web Services

引用

Journal of Computer Science & Technology 2009年第5期24卷 893-900页

作者：李海华杜小勇 Member 田萱 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Information Science & Technology Beijing Forestry University Beijing 100083 China

Web services are commonly perceived as an environment of both offering opportunities and threats. In this environment, one way to minimize threats is to use reputation evaluation, which can be computed, for example, through transaction feedback. However, the current feedback-based approach is inaccurate and ineffective because of its inner limitations （e.g., feedback quality problem）. As the main source of feedback, the qualities of existing on-line reviews are often varied greatly from low to high, the main reasons include：（1） they have no standard expression formats, （2） dishonest comments may exist among these reviews due to malicious attacking. Up to present, the quality problem of review has not been well solved, which greatly degrades their importance on service reputation evaluation. Therefore, we firstly present a novel evaluation approach for review quality in terms of multiple metrics. Then, we make a further improvement in service reputation evaluation based on those filtered reviews. Experimental results show the effectiveness and efficiency of our proposed approach compared with the naive feedback-based approaches.

关键词： Web services reputation evaluation review quality measurement

来源：评论

学校读者我要写书评

暂无评论

Larger, Cheaper, but Faster: SSD-SMR hybrid storage boosted by a new SMR-oriented cache framework 33

Larger, Cheaper, but Faster: SSD-SMR hybrid storage boosted ...

引用

33rd International Conference on Massive Storage Systems and Technology, MSST 2017

作者： Wang, Chunling Wang, Dandan Chai, Yupeng Wang, Chuanwen Sun, Diansen Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China

By utilizing the new Shingled Magnetic Recording (SMR) technique, the emerging SMR disks achieve higher storage density and lower costs. Together with Flash-based SSDs, SMR disks can be used to construct a new hybrid storage system that is larger, but cheaper than the widely used conventional diskbased storage systems. It is appropriate for the fast growing big data applications which have strict requirements on both capacity and cost, e.g., the scientific computing in the fields of meteorology and astronomy. However, the most serious challenge of the SSD-SMR hybrid storage lies in its weak fine-grained random write performance caused by the write amplification in SMR disks, especially when I/Os are spread randomly across the Logical Block Address (LBA) range of the entire disk. Traditional cache algorithms like LRU usually lead to tens of or even hundreds of times more data written into magnetic plates than the original requests, thus resulting in poor I/O performance, because they do not consider and limit the LBA distribution of the eviction victims at all. Therefore, the cache algorithms for SSD-SMR hybrid storage systems should take this new dimension into account except for the data popularity. In this paper, we propose a new SMR-oriented cache framework, i.e., Partially Open Region for Eviction (PORE), which restricts the LBA range of evicted data from SSD caches appropriately to promote the overall performance of the hybrid storage by making a better tradeoff between the cached data popularity and the SMR write amplification. The experiments based on real-world traces reveal that PORE can boost the SSD-SMR hybrid storage performance by a factor of 3.26∼10.2 with only a 2% SSD cache compared with a conventional disk-based storage on average, while the hybrid storage coupled with LRU is slower than the conventional storage sometimes. PORE makes the hybrid storage much faster than traditional storage besides the advantages on capacity and cost. © 33rd Internati

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

Does ad-context matter on the effectiveness of online advertising? 30

Does ad-context matter on the effectiveness of online advert...

引用

30th International Conference on Software engineering and knowledge engineering, SEKE 2018

作者： Sun, Caihong Zhang, Meina Zuo, Meiyun Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China

ISBN: (纸本)1891706446

In this paper, we focus on examining the effects of Ad-context on the click-Through rate (CTR) for the online advertising. Many researches have shown that ad-context congruity is a key factor to CTR, but the features of ad-context are rarely introduced in CTR prediction algorithms. By leveraging data from various sources, and using text mining and sentiment analysis techniques, our proposed approach extracts three types of features (i.e. users, advertisements and ad-context features) to predict CTR. User features describe "Who" is browsing the webpage, advertisement features depict "How" an ad serving is, and ad-context features include "What" the product is, "Where" an ad displays, as well as the "Mood" of the context. Experiment results show that our proposed approach outperforms the benchmark models by introducing ad-context features. Novel ad-context features we proposed make good contributions to the prediction of CTR. The research highlights the power of ad-context in online advertising CTR prediction. Moreover it gives an insight into supporting effective advertising and improving users' satisfaction. © 2018 Universitat zu Koln. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Optimization framework for distributed clustering scheme in wireless sensor networks

Optimization framework for distributed clustering scheme in ...

引用

SNPD 2007: 8th ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

作者： Yongxuan, Lai Xiaobo, Fan Hong, Chen Tingting, Xie School of Information Renmin University of China Beijing Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)0769529097

Recently there have been growing interests in the applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach and data gathering protocol in wireless sensor networks. In this paper, we propose a novel optimization framework called MICA (MICa Adjustments) for clustering scheme in wireless sensor networks. MICA takes the cluster as a whole, and dynamically adjusts the clusters according to the real-lime workload of the local clusters to balance energy consumption among clusters. The adjustments can also deal with link failures. Simulation results show that MICA can be easily embedded into existing clustering schemes to balance the energy consumptions among the clusters, and to prolong the lifetime of wireless sensor networks. © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A WSMO-based semantic web services discovery framework in heterogeneous ontologies environment

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： Haihua, Li Xiaoyong, Du Xuan, Tian School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)9783540767183

Nowadays, WSMO (Web Service Modeling Ontology)1 has received great attention of academic and business communities, since its potential to achieve dynamic and scalable infrastructure for web services is extracted. Therefore, we design an ontology-based Semantic Web Services (SWSs) discovery framework based on WSMO so as to searching dynamically web services located at different nodes. Also, we provide several SWSs matching techniques based on this framework. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Weighted neural bag-of-n-grams model: New baselines for text classification 26

Weighted neural bag-of-n-grams model: New baselines for text...

引用

26th International Conference on Computational Linguistics, COLING 2016

作者： Li, Bofang Zhao, Zhe Liu, Tao Wang, Puwei Du, Xiaoyong School of Information Renmin University of China Key laboratory of Data Engineering and Knowledge Engineering MOE China

ISBN: (纸本)9784879747020

NBSVM is one of the most popular methods for text classification and has been widely used as baselines for various text representation approaches. It uses Naive Bayes (NB) feature to weight sparse bag-of-n-grams representation. N-gram captures word order in short context and NB feature assigns more weights to those important words. However, NBSVM suffers from sparsity problem and is reported to be exceeded by newly proposed distributed (dense) text representations learned by neural networks. In this paper, we transfer the n-grams and NB weighting to neural models. We train n-gram embeddings and use NB weighting to guide the neural models to focus on important words. In fact, our methods can be viewed as distributed (dense) counterparts of sparse bag-of-n-grams in NBSVM. We discover that n-grams and NB weighting are also effective in distributed representations. As a result, our models achieve new strong baselines on 9 text classification datasets, e.g. on IMDB dataset, we reach performance of 93.5% accuracy, which exceeds previous state-of-the-art results obtained by deep neural models. All source codes are publicly available at https://***/zhezhaoa/neural-BOW-toolkit. © 1963-2018 ACL.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Reduce pruning cost to accelerate multimedia kNN search over MBRs based index structures

Reduce pruning cost to accelerate multimedia kNN search over...

引用

3rd International Conference on Multimedia Information Networking and Security, MINES 2011

作者： Li, Hui Zhang, Xiao Wang, Shan School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

ISBN: (纸本)9780769545592

MBR (Minimum Bounding Rectangle) has been widely used to represent multimedia data objects for multimedia indexing techniques. In kNN search, MINDIST and MINMAXDIST was the most popular pruning metrics employed by MBR based index structures. However, with the increase of dimensionality, the computation costs of above two metrics are expensive, and the involved distance computations may become the considerable component. In this paper, to improve the performance of kNN search over multimedia data, we proposed an approach to reduce the computation cost of pruning heuristics by use the cheap upper bound of MINMAXDIST instead of its precise value, and then we derive enhanced cheap heuristics based on this upper bound for kNN pruning, which are helpful to avoid visiting unnecessary data objects and MBRs. We conducted an extensive experimental study on a large real-life multimedia dataset called MSRA-MM 2.0, obtained from the commercial Bing Image search engine. The results show that the proposed approach significantly reduced the computation cost and boosted the overall performance of MBR based multimedia kNN search. © 2011 IEEE.

关键词： Cost reduction

来源：评论

学校读者我要写书评

暂无评论

Mining Bytecode Features of Smart Contracts to Detect PonziScheme on Blockchain

引用

Computer Modeling in engineering & Sciences 2021年第6期127卷 1069-1085页

作者： Xiajiong Shen Shuaimin Jiang Lei Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng47500China Institute of Data and Knowledge Engineering Henan UniversityKaifeng47500China School of Computer and Information Engineering Henan UniversityKaifeng47500China

The emergence of smart contracts has increased the attention of industry and academia to blockchain technology,which is tamper-proofing,decentralized,autonomous,and enables decentralized applications to operate in untrustworthy ***,these features of this technology are also easily exploited by unscrupulous individuals,a typical example of which is the Ponzi scheme in *** negative effect of unscrupulous individuals writing Ponzi scheme-type smart contracts in Ethereum and then using these contracts to scam large amounts of money has been *** solve this problem,we propose a detection model for detecting Ponzi schemes in smart contracts using *** this model,our innovation is shown in two aspects:We first propose to use two bytes as one characteristic,which can quickly transform the bytecode into a high-dimensional matrix,and this matrix contains all the implied characteristics in the ***,We innovatively transformed the Ponzi schemes detection into an anomaly detection ***,an anomaly detection algorithm is used to identify Ponzi schemes in smart *** results show that the proposed detection model can greatly improve the accuracy of the detection of the Ponzi scheme ***,the F1-score of this model can reach 0.88,which is far better than those of other traditional detection models.

关键词： Ponzi scheme blockchain security smart contracts anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：