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

IEEE International Conference on Computer Science and Automation Engineering (CSAE)

作者： Zhao Mingqing Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

In order to strengthen the traditional information system's capacity of describing practical problems, preference relation is introduced into information system and the concepts of preference information system, preference decision table, and information utility function are offered in this paper. In addition, the existence theorem of information utility function and several applications of information utility function in knowledge acquisition are provided.

关键词： Information systems Knowledge acquisition Economics Clustering methods Transforms Information science Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Quality assessment for color images with tucker decomposition

Quality assessment for color images with tucker decompositio...

引用

IEEE International Conference on Image Processing

作者： Cheng, Cheng Wang, Hanli Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

As an extension of the singular value decomposition based approaches, a novel metric based on Tucker decomposition for color image quality assessment is proposed in this paper. It extracts both the spacial and chromatic information of a color image with Tucker decomposition. As compared to most of the other existing quality metrics for color images, the key advantage of the proposed metric is that it treats the color image as a whole entity instead of an assembly of three independent visual channels, and thus the interrelation among the different visual channels is well involved. Experimental results on the LIVE Database Release 2 demonstrate that the proposed metric can generally achieve similar or better performance than other metrics.

关键词： Tensile stress Measurement Image color analysis Color Matrix decomposition Image quality Vectors

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Heterogeneous Credit Card Fraud Detection Model Based on Deep Reinforcement Training Subset Selection

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第8期5卷 4026-4041页

作者： Zhu, Kun Zhang, Nana Ding, Weiping Jiang, Changjun the Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China the School of Computer Science and Technology Donghua University Shanghai201620 China the School of Information Science and Technology Nantong University Nantong226019 China

Heterogeneous fraud detection is an important means of credit card security assurance, which can utilize historical transaction records in a source and target domain to build an effective fraud detection model. Nevertheless, large feature distribution differences between source and target transaction instances and the complex intrinsic structure hidden behind transaction data make it difficult for existing credit card fraud detection (CCFD) models to capture and transfer the most informative feature representations and seriously hinder detection performance. In this work, we propose a novel adaptive heterogeneous CCFD model named adaptive heterogeneous credit card fraud detection model based on deep reinforcement training subset selection (RTAHC) based on deep reinforcement training subset selection, which mainly contains two components: selection distribution generator (SDG) and transaction fraud detector (TFD, including feature extractor with an attention mechanism and classifier). The SDG can generate the selection probability distribution vector via the reinforcement reward mechanism, and then transaction instances in the source domain relevant to the target domain are selected. The feature extractor with an attention mechanism can learn the abstract deep semantic feature representations of selected source transaction instances and the target domain. The joint training of SDG and TFD can provide more real-time and accurate transaction feature representations to reduce the distribution discrepancy between the two domains. We verify the detection performance of RTAHC across a large real-world credit card transaction dataset and four public datasets. Experimental results demonstrate that the RTAHC model can exhibit competitive CCFD performance. Impact Statement—With the rise of artificial intelligence (AI)generated models, credit card fraud has become increasingly rampant, which also causes tens of billions of U.S. dollars in credit card losses worldwide every year

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Reader activation scheduling in multi-reader RFID systems: A study of general case

Reader activation scheduling in multi-reader RFID systems: A...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Tang, Shaojie Wang, Cheng Li, Xiang-Yang Jiang, Changjun Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

ISBN: (纸本)9780769543857

Radio frequency identification (RFID) is a technology where a reader device can "sense" the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis. © 2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Single camera 3D lane detection and tracking based on EKF for urban intelligent vehicle

Single camera 3D lane detection and tracking based on EKF fo...

引用

IEEE International Conference on Vehicular Electronics and Safety, ICVES 2006

作者： Min, Tian Fuqiang, Liu Zhencheng, Hu IEEE Key Laboratory of Embedded System and Service Computing Ministry of Education China Electronic and Information Engineering Department Tongji University Shanghai 201804 China Department of Computer Science Kumamoto University Kumamoto 860-8555 Japan

ISBN: (纸本)1424407591

Road boundary detection and tracking is an important and integral function in advanced driver-assistance system. This paper proposes an algorithm, which can follow multi-kinds of lane, straight and curved, quickly and robustly. The algorithm uses several masks to extract blobs of road markings, combining with KNN function to remove the disturbance. Further more, road is modeled as a 3D surface, and some important parameters of current lane are provided on real-time by tracking based on Extended Kalman Filter (EKF). The results of experiments, which have been done in urban road, show that the algorithm is adapted to many road conditions. Even in a complex driving environment, it also has a good performance. © 2006 IEEE.

关键词： Extended Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Implicit cooperative caching based on information popularity for vehicular networks 12

Implicit cooperative caching based on information popularity...

引用

12th Workshop on Challenged Networks, CHANTS 2017

作者： Li, Yuhong Wang, Ji Lindgren, Anders Su, Xiang Riekki, Jukka State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China RISE SICS Sweden Luleå University of Technology Sweden Centre for Ubiquitous Computing University of Oulu Finland

ISBN: (纸本)9781450351447

Information-centric networking (ICN) technology is becoming a popular research topic in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for the dynamic and wireless vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information being distributed. We introduce an interval metric for selective caching. With this metric and estimates of information popularity and vehicle density, cooperative caching can be realized without exchanging cache management information among the vehicular nodes. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks. © 2017 Association for computing Machinery.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Moving object detection through efficient detection and clustering of reliable singular points

Advances in Intelligent and Soft Computing

引用

Advances in Intelligent and Soft computing 2011年 104卷 381-385页

作者： Cui, Jianzhu Wang, Ping Li, Zhipeng Li, Jing Li, Yan Key Laboratory of Embedded System and Service Computing Supported by Ministry of Education Tongji University Cao'an Highway Shanghai 4800 China

ISBN: (纸本)9783642237768

This paper presents a method to detect vehicles from a moving camera. The detection component involves a cascade of modules. First, motion estimation of singular points in video sequences is used to detect moving vehicle. Finding the image points is the selection of singular points. We impose restrictions about the gradient magnitude and the cornerness. A sparse motion vector field outlines the image motion. We obtain excellent results in real sequences in China. At last, vehicles are detected by clustering of singular points. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

A Novel Frequency Selective Sounding Scheme for TDD LTE-Advanced systems

A Novel Frequency Selective Sounding Scheme for TDD LTE-Adva...

引用

IEEE Global Communications Conference

作者： Shengjie Zhao Baolong Zhou Daqiang Zhang Key Lab of Embedded System and Service Computing Ministry of Education Tongji University

ISBN: (纸本)9781479935130

In this paper we propose a novel Frequency Selective SRS (FS-SRS) scheme to improve the quality of CSI. According to the CQIs (channel quality indications), which are periodically reported by each user, and the bandwidth requirement of each user, BSs dynamically schedule each user to send SRSs only on the requisite bandwidth with best CQIs instead of on full bandwidth or on specified sub-bandwidth as in the current LTE TDD systems. Simulation results show that the proposed FS-SRS scheme outperforms the current schemes in estimation accuracy for various frequency-selective and/or time-selective fading channels. In addition, the proposed FS-SRS scheme offers unique advantages over the current schemes. Firstly, it is robust to frequency selective channels. Secondly, it is hardly impacted by timing offset. Thirdly, it is adaptive to the change of the underlying scheduler. Fourthly, it can increase SRS capacity. Finally, it can be extended to multi-user MIMO (multiple-input multiple-output) systems, called extended FS-SRS scheme. Moreover, the proposed schemes are applicable to the uplink SRS design in LTE-Advanced systems.

关键词： Channel estimation error Frequency selective Long Term Evolution (LTE) Sounding Time division duplex (TDD)

来源：评论

学校读者我要写书评

暂无评论

Top-n recommendation algorithms for cloud data

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2015年第1期43卷 54-61页

作者： Huang, Zhen-Hua Department of Computer and Technology Tongji University Shanghai200092 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China

Top-n recommendation technology has recently received a lot of attention in information service community. In this paper, we study the problem of top-n recommendation under the cloud data. Firstly, we propose a multilayer distributed storage architecture(MDSA)which can fit the need of top-n recommendation. Secondly, based on the consideration of reducing the cost of network transmission, we present the data encoding pattern which is based on the MDSA architecture. Lastly, we fast realize top-n recommendation using the map/reduce distributed programming model. For satisfying the realistic requirement, we further present three application variants of top-n recommendation. Massive experiments demonstrate that our approach is efficient and has high overall performance. ©, 2015, Chinese Institute of Electronics. All right reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A Prediction Based on Clustering and Personality Questionnaire Data for IGD Risk

A Prediction Based on Clustering and Personality Questionnai...

引用

International Conference on Natural Computation, Fuzzy systems and Knowledge Discovery

作者： Xiaoliang Gong Kun Fang Yichu Hou Bozhong Long Zongling Di Lei Cao National Key Laboratory of Embedded System and Service Computing (Ministry of Education) Tongji University Shanghai China

ISBN: (纸本)9781509040940

With the development of the Internet, a lot of people trapped in the network, especially the adolescent depending on the network game and disturbing their normal life. 579 freshmen participated in this work who were collected the personality questionnaires in the first week they came in university and their grades points average (GPA) after half year. The questionnaires were including Self-Control (SCS), Barratt impulse Inventory (BIS) and Chinese Big Five Personality (CBF). This work used multi-clustering algorithms to construct the models of predicting for Internet game disorder (IGD) risk, including FCM, K-means, and Hierarchical for training model. This is the first try to predict the risk of IGD by personality traits. The results shown the questionnaire data were well separated by different clustering algorithms into three groups who were shared the analogous personality traits which has a relationship with the behavior of IGD. But compared to the GPA of each group, the efficiency of the prediction model seems not so satisfactory. There need more efforts to optimized the model in the future.

关键词： Personality questionnaire Data IGD Risk FCM K-means Hierarchical

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：