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

arXiv 2017年

作者： Lang, Guangming School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Department of Computer Science and Technology Tongji University Shanghai201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China College of Mathematics and Econometrics Hunan University Changsha Hunan410004 China

In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consistent covering decision information systems when deleting objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when deleting objects. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering decision information systems when object sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Lang, Guangming School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China College of Mathematics and Econometrics Hunan University Changsha Hunan410004 China

In practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering information systems when attribute sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

Finite-time Cluster Synchronization of Complex Networks With Time-Varying Delays

Finite-time Cluster Synchronization of Complex Networks With...

引用

第28届中国控制与决策会议

作者： Xiwei Liu Shaohua Li Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (纸本)9781467397155

In this paper,we study the finite-time cluster synchronization of complex networks with time *** are two different types of time-varying delays in the network:the internal time delay and the coupling ***'s more,we assume that coupling time-varying delays exist only between nodes in different clusters,while no delay happens between nodes in the same cluster,which is more consistent with the real *** on the Lyapunov stability theorem,sufficient conditions are derived to guarantee the realization of the finite-time cluster ***,numerical simulations are provided to support the obtained theoretical results.

关键词： Complex network Cluster synchronization Finite-time Time-varying delays

来源：评论

学校读者我要写书评

暂无评论

Real-time action recognition with enhanced motion vector CNNs

Real-time action recognition with enhanced motion vector CNN...

引用

2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016

作者： Zhang, Bowen Wang, Limin Wang, Zhe Qiao, Yu Wang, Hanli Shenzhen Key Lab of Comp. Vis. and Pat. Rec. Shenzhen Institutes of Advanced Technology CAS China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Computer Vision Lab ETH Zurich Switzerland

ISBN: (纸本)9781467388511

The deep two-stream architecture [23] exhibited excellent performance on video based action recognition. The most computationally expensive step in this approach comes from the calculation of optical flow which prevents it to be real-time. This paper accelerates this architecture by replacing optical flow with motion vector which can be obtained directly from compressed videos without extra calculation. However, motion vector lacks fine structures, and contains noisy and inaccurate motion patterns, leading to the evident degradation of recognition performance. Our key insight for relieving this problem is that optical flow and motion vector are inherent correlated. Transferring the knowledge learned with optical flow CNN to motion vector CNN can significantly boost the performance of the latter. Specifically, we introduce three strategies for this, initialization transfer, supervision transfer and their combination. Experimental results show that our method achieves comparable recognition performance to the state-of-the-art, while our method can process 390.7 frames per second, which is 27 times faster than the original two-stream method.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Bridge the Gap Between Network-Based Inference Method and Global Ranking Method in Personal Recommendation

Bridge the Gap Between Network-Based Inference Method and Gl...

引用

IEEE Conference on Industrial Electronics and Applications

作者： Xiwei Liu Department of Computer Science and Technology Tongji University China The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 200092 China

In this paper, we study the relationship between the network-based inference method and global ranking method in personal recommendation. By some theoretical analysis, we prove that the recommendation result under the... 详细信息

ISBN: (纸本)9781467386456

关键词： Eigenvalues and eigenfunctions Heating Bridges Inference algorithms Prediction algorithms Conferences Industrial electronics

来源：评论

学校读者我要写书评

暂无评论

Joint power allocation and beamforming for non-orthogonal multiple access (NOMA) in 5G millimeter-wave communications

arXiv

引用

arXiv 2017年

作者： Xiao, Zhenyu Zhu, Lipeng Choi, Jinho Xia, Pengfei Xia, Xiang-Gen School of Electronic and Information Engineering Beihang University Beijing100191 China Beijing Key Laboratory for Network-Based Cooperative Air Traffic Management Beijing Laboratory for General Aviation Technology Beijing100191 China Collaborative Innovation Center of Geospatial Technology Wuhan430079 China Korea Republic of School of Electronics and Information Engineering Key Laboratory of Embedded System and Service Computing Tongji University Shanghai200092 China College of Information Engineering Shenzhen University Shenzhen China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

In this paper we explore non-orthogonal multiple access (NOMA) in millimeter-wave (mmWave) communications (mmWave-NOMA). In particular, we consider a typical problem, i.e., maximization of the sum rate of a 2-user mmWave-NOMA system. In this problem, we need to find the beamforming vector to steer towards the two users simultaneously subject to an analog beamforming structure, while allocating appropriate power to them. As the problem is non-convex and may not be converted to a convex problem with simple manipulations, we propose a suboptimal solution to this problem. The basic idea is to decompose the original joint beamforming and power allocation problem into two sub-problems which are relatively easy to solve: one is a power and beam gain allocation problem, and the other is a beamforming problem under a constant-modulus constraint. Extension of the proposed solution from 2-user mmWave-NOMA to more-user mmWave-NOMA is also discussed. Extensive performance evaluations are conducted to verify the rational of the proposed solution, and the results also show that the proposed sub-optimal solution achieve close-to-bound sum-rate performance, which is significantly better than that of time-division multiple access (TDMA). Copyright © 2017, The Authors. All rights reserved.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

A Novel Adaptive Algorithm for Location based on Distance-Loss Model in Complex Environment

A Novel Adaptive Algorithm for Location based on Distance-Lo...

引用

IEEE International Conference on Computer Supported Cooperative Work in Design

作者： Hao Fang Fei Li Feng Zhang Min Liu Weiming Shen School of Electronic and Information Engineering Tongji University Department of Computer Zhejiang University City College The Key Laboratory of Embedded System and Service Computing Tongji University

ISBN: (纸本)9781509019168

Location based services are the hottest applications on mobile device nowadays. Indoor wireless position is the key technology to enable location based service to work well indoors, where Global Position system normally couldn't work. The main tendency of indoor wireless position is based on Bluetooth and RSSI (radio signal strength indicator). RSSI is the key parameter for wireless position. But values of RSSI are affected by environment factors easily. Because of this reason, results got from the indoor location technology are usually imprecise and unacceptable. In this paper, an adaptive algorithm based on Distance-Loss model in complex environment is introduced to deal with such problems. The algorithm makes the model adapt to the environment by several parameters which are not influenced by environment. The stability and the accuracy of the algorithm is evidenced by a series of strict experiences.

关键词： Complex environment Distance-loss model RSSI Self-adaptation Location

来源：评论

学校读者我要写书评

暂无评论

Global climate

引用

Bulletin of the American Meteorological Society 2020年第8期101卷 S9-S128页

作者： Dunn, R.J.H. Stanitski, D.M. Gobron, N. Willett, K.M. Met Office Hadley Centre Exeter United Kingdom NOAA/OAR Earth System Research Laboratories Boulder Colorado European Commission Joint Research Centre Ispra Italy Met Office Hadley Centre Exeter United Kingdom European Centre for Medium-Range Weather Forecasts Reading United Kingdom University of Maryland College Park Maryland Met Office Hadley Centre Exeter United Kingdom University of Reading Reading United Kingdom Department of Atmospheric and Planetary Science Hampton University Hampton Virginia NOAA/NESDIS National Centers for Environmental Information Asheville North Carolina University of Bremen Bremen Germany NOAA/OAR Earth System Research Laboratories Boulder Colorado Centro de Investigaciones sobre Desertificación - Spanish National Research Council Moncada (Valencia) Spain and Regional Climate Group Department of Earth Sciences University of Gothenburg Gothenburg Sweden Instituto de Geografía Pontificia Universidad Católica de Valparaíso Valparaíso Chile NOAA/OAR ESRL Global Monitoring Laboratory Boulder Colorado Department of Civil and Environmental Engineering Princeton University Princeton New Jersey Global Precipitation Climatology Centre Deutscher Wetterdienst Offenbach Germany University of Reading Reading United Kingdom European Centre for Medium-Range Weather Forecasts Reading United Kingdom National Oceanography Centre Southampton United Kingdom School of Engineering Newcastle University Newcastle-upon-Tyne United Kingdom Université de Paris Institut de physique du globe de Paris CNRS IGN Paris France and ENSG-Géomatique IGN Marne-la-Vallée France Global Modeling and Assimilation Office NASA Goddard Space Flight Center Greenbelt Maryland Sorbonne Université Paris France Universität Hamburg Hamburg Germany Department of Meteorology University of Reading Reading United Kingdom Geology Department University Centre in Svalbard Longyearbyen Norway Jet Propulsion Laboratory California Institute of Technology Wrightwood Calif

来源：评论

学校读者我要写书评

暂无评论

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

引用

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 345-352页

作者： Shouguang Wang Mengdi Gan Mengchu Zhou Dan You School of Information and Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Ministry of Education(MoE)Key Laboratory of Embedded System and Service Computing Tongji University MoE Key Laboratory of Embedded System and Service Computing Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. © 2014 Chinese Association of Automation.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Novel Clustering-Based Approach for Local Outlier Detection

Novel Clustering-Based Approach for Local Outlier Detection

引用

IEEE Conference on Computer Communications Workshops

作者： Haizhou Du Shengjie Zhao Daqiang Zhang Jinsong Wu Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University School of Software Engineering Tongji University Department of Electrical Engineering Universidad de Chile

ISBN: (纸本)9781467399562

With the rapid expansion of data scale, big data mining and analysis have attracted increasing attention. Outlier detection as an important task of data mining is widely used in many applications. However, conventional outlier detection methods have difficulty handling large-scale datasets. In addition, most of them typically can only identify global outliers and are over sensitive to parameters variation. In this paper, we propose a novel method for robust local outlier detection with statistical parameters, which incorporates the clustering-based ideas in dealing with big data. Firstly, this method finds some density peaks of dataset by 3σ standard. Secondly, each remaining data object in the dataset is assigned to the same cluster as its nearest neighbor of higher density. Finally, we use Chebyshev's inequality and density peak reachability to identify local outliers of each group. The experimental results demonstrate the efficiency and accuracy of the proposed method in identifying both global and local outliers. Moreover, the method is also proved to be more stability analysis than typical outlier detection methods, such as LOF (Local Outlier Factor) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise).

关键词： Outlier detection Big data Data mining Clustering-based

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：