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

IEEE International Symposium on Industrial Electronics

作者： Qichao Ma Jiahu Qin Yu Kang Wei Xing Zheng Department of Automation University of Science and Technology of China Hefei China Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Chinese Academy of Sciences Beiiinz China School of Computing Engineering and Mathematics Western Sydney University Sydney Australia

The cooperative tracking problem for a class of nonlinear affine systems are addressed. Actuator faults and external disturbance/model uncertainty are allowed such that we aim to design distributed controllers that can tolerate them while realize cooperative tracking. A general setup is considered, that is, actuator faults can take such forms as actuator degradation and total failure. Then, to guarantee the feasibility of fault-tolerant control, we assume that the actuator has sufficiently many healthy components which enables us to apply integral sliding mode control (ISMC) to develop the distributed controllers that can fulfill the control target and the external disturbance can simultaneously be successfully rejected. We also provide the simulation results to verify the validity of our theoretical findings.

关键词： Cooperative tracking Fault-tolerant control Nonlinear affine systems Integral sliding mode control

来源：评论

学校读者我要写书评

暂无评论

New Big Data Collecting Method Based on Compressive Sensing in WSN

New Big Data Collecting Method Based on Compressive Sensing ...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： De-gan Zhang Xiao-hua Liu Yu-ya Cui Hong-tao Peng School of Computer Science &Engineering Tianjin University of Technology Tianjin China Computing & Novel software Technology Tianjin Key Lab of Intelligent Tianjin China Ministry of Education Key Laboratory of Computer Vision and System(TJUT) Tianjin China National Petroleum Corporation (CNPC) Managers Training Institute Beijing China

Considered the wireless sensor network clustering structure, a new big data collecting method based on compressive sensing is proposed. The collection process is as follows: in the cluster, the sink node sets the corresponding seed vector based on the distribution of network, and then sends it to each cluster head. Cluster head can generate corresponding own random spacing sparse matrix based on its received seed vector, and collect data through compressive sensing technology; Among clusters, clusters forward measurement values to sink node along multi-hop routing tree which we built before. Performance analyzing and comparison of results show that this method is superior to other methods regardless of in a cluster or inter-cluster.

关键词： Wireless sensor networks Compressed sensing Sparse matrices Big Data Routing Energy consumption Training

来源：评论

学校读者我要写书评

暂无评论

WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color Images

arXiv

引用

arXiv 2018年

作者： Zeng, Jishen Tan, Shunquan Liu, Guangqing Li, Bin Huang, Jiwu Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Guangdong Key Lab. of Intelligent Info. Processing and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Peng Cheng Laboratory Shenzhen518052 China

Until recently, deep steganalyzers in spatial domain have been all designed for gray-scale images. In this paper, we propose WISERNet (the wider separate-then-reunion network) for steganalysis of color images. We provide theoretical rationale to claim that the summation in normal convolution is one sort of "linear collusion attack" which reserves strong correlated patterns while impairs uncorrelated noises. Therefore in the bottom convolutional layer which aims at suppressing correlated image contents, we adopt separate channel-wise convolution without summation instead. Conversely, in the upper convolutional layers we believe that the summation in normal convolution is beneficial. Therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of "linear collusion attack". As a result, our proposed wide-and-shallow, separate-then-reunion network structure is specifically suitable for color image steganalysis. We have conducted extensive experiments on color image datasets generated from BOSSBase raw images and another large-scale dataset which contains 100,000 raw images, with di_erent demosaicking algorithms and downsampling algorithms. The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin. Specifically, it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know, which is scarce in the literature. Copyright © 2018, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

A fine-grained perspective on the robustness of global cargo ship transportation networks

引用

Journal of Geographical Sciences 2018年第7期28卷 881-899页

作者：彭澎程诗奋陈金海廖梦迪吴琳刘希亮陆锋 State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research CAS University of Chinese Academy of Sciences Navigation Aids Technology Research Center of Jimei University National & Local Joint Engineering Research Center for Marine Navigation Aids Services College of Geomatics Shandong University of Science and Technology Institute of Computing Technology CAS Fujian Collaborative Innovation Center for Big Data Applications in Governments Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application

The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current research mainly focuses on the coarse-grained, holistic cargo ship transportation network while ignoring the structural diversity of different sub-networks. In this paper, we evaluate the robustness of the global cargo ship transportation network based on the most recent Automatic Identification system（AIS） data available. First, we subdivide three typical cargo ship transportation networks（i.e., oil tanker, container ship and bulk carrier） from the original cargo ship transportation network. Then, we design statistical indices based on complex network theory and employ four attack strategies, including random attack and three intentional attacks（i.e., degree-based attack, betweenness-based attack and flux-based attack） to evaluate the robustness of the three typical cargo ship transportation networks. Finally, we compare the integrity of the remaining ports of the network when a small proportion of ports lose their function. The results show that 1） compared with the holistic cargo ship transportation network, the fine-grain-based cargo ship transportation networks can fully reflect the pattern and process of global cargo transportation; 2） different cargo ship networks behave heterogeneously in terms of their robustness, with the container network being the weakest and the bulk carrier network being the strongest; and 3） small-scale intentional attacks may have significant influence on the integrity of the container network but a minor impact on the bulk carrier and oil tanker transportation networks. These conclusions can help improve the decision support capabilities in maritime transportation planning and emergency response and facilitate the establishment of a more reliable maritime transportation ***： The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current resear

关键词： complex network fine-grained cargo ship transportation network robustness automatic identification system

来源：评论

学校读者我要写书评

暂无评论

Full-Duplex Millimeter-Wave Communication

arXiv

引用

arXiv 2017年

作者： Xiao, Zhenyu Xia, Pengfei Xia, Xiang-Gen Beihang University Key Laboratory of Embedded System and Service Computing Tongji University University of Delaware

The potential of doubling the spectrum efficiency of full-duplex (FD) transmission motivates us to investigate FD millimeter-wave (FD-mmWave) communication. To realize FD transmission in the mmWave band, we first introduce possible antenna configurations for FD-mmWave transmission. It is shown that, different from the cases in micro-wave band FD communications, the configuration with separate Tx/Rx antenna arrays appears more flexible in self-interference (SI) suppression while it may increase some cost and area versus that with the same array. We then model the mmWave SI channel with separate Tx/Rx arrays, where a near-field propagation model is adopted for the line-of-sight (LOS) path, and it is found that the established LOS-SI channel with separate Tx/Rx arrays also shows spatial sparsity. Based on the SI channel, we further explore approaches to mitigate SI by signal processing, and we focus on a new cancellation approach in FD-mmWave communication, i.e., beamforming cancellation. Centered on the constant-amplitude (CA) constraint of the beamforming vectors, we propose several candidate solutions. Lastly, we consider an FD-mmWave multi-user scenario, and show that even if there are no FD users in an FD-mmWave cellular system, the FD benefit can still be exploited in the FD base station. Candidate solutions are also discussed to mitigate both SI and multi-user interference (MUI) simultaneously. Copyright © 2017, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

User Behavior Analysis of Location-Based Social Network

User Behavior Analysis of Location-Based Social Network

引用

IIAI International Conference on Advanced Applied Informatics (IIAIAAI)

作者： Jun Zeng Xin He Yingbo Wu Sachio Hirokawa Key Laboratory of Dependable Service Computing in Cyber Physical Society School of Big Data and Software Engineering Chongqing China School of Big Data and Software Engineering Chongqing China Research Institute for Information Technology Kyushu University Fukuoka Japan

ISBN: (纸本)9781538674482;9781538674475

User behavior changes over time under the influence of their activities. We contend that these activities are non-random behavior and have a desire to explore the underlying information behind these changes. In this paper, we analyze user behavior by using the check-in data in Location Based Social Networks (LBSNs), and examine whether they have the features of trend, periodicity and surprise or not. We explore some dynamics behaviors of people through their check-in times, and divide time into annually, monthly and even weekly analysis to find out the pattern of their behavior. Eventually, we found the check-in data do exhibit these three features by analyzing them deeply. The analytical work lays the foundation for the further recommendation research.

关键词： Market research Social networking (online) Big Data Software engineering Accidents Trajectory Motion pictures

来源：评论

学校读者我要写书评

暂无评论

A Power and Area Optimization Approach of Mixed Polarity Reed-Muller Expression for Incompletely Specified Boolean Functions

引用

Journal of Computer Science & technology 2017年第2期32卷 297-311页

作者： Zhen-Xue He Li-Min Xiao Li Ruan Fei Gu Zhi-Sheng Huo Guang-Jun Qin Ming-Fa Zhu F Long-Bing Zhang Rui Liu Xiang Wang State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China School of Electronic and Information Engineering Beihang University Beijing 100191 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China National Engineering Research Center for Science and Technology Resources Sharing Service Beihang University Beijing 100191 China

The power and area optimization of Reed-Muller （RM） circuits has been widely concerned. However, almost none of the exiting power and area optimization approaches can obtain all the Pareto optimal solutions of the original problem and are efficient enough. Moreover, they have not considered the don＇t care terms, which makes the circuit performance unable to be further optimized. In this paper, we propose a power and area optimization approach of mixed polarity RM expression （MPRM） for incompletely specified Boolean functions based on Non-Dominated Sorting Genetic Algorithm II （NSGA-II）. Firstly, the incompletely specified Boolean function is transformed into zero polarity incompletely specified MPRM （ISMPRM） by using a novel ISMPRM acquisition algorithm. Secondly, the polarity and allocation of don＇t care terms of ISMPRM is encoded as chromosome. Lastly, the Pareto optimal solutions are obtained by using NSGA-II, in which MPRM corresponding to the given chromosome is obtained by using a chromosome conversion algorithm. The results on incompletely specified Boolean functions and MCNC benchmark circuits show that a significant power and area improvement can be made compared with the existing power and area optimization approaches of RM circuits.

关键词： power and area optimization Reed-Muller （RM） circuit Pareto optimal solution don＇t care term chromosomeconversion

来源：评论

学校读者我要写书评

暂无评论

Risk clearance with guaranteed precision 17

Risk clearance with guaranteed precision

引用

17th SIAM International Conference on Data Mining, SDM 2017

作者： McBride, Ryan Wang, Ke Nekkanti, Viswanadh Li, Wenyuan Computing Science Simon Fraser University BurnabyBC Canada State Key Laboratory of Power Transmission Equipment and System Security and New Technology Chongqing University Chongqing China BC Hydro China

ISBN: (纸本)9781611974874

In real life applications, we often face the following risk clearance problem: given a set of instances with a known numeric outcome Y (e.g., a toxicity level), we want to learn a model to identify new instances that have a low risk, i.e., the probability of the Y value exceeding a certain maximum MAX is less than some threshold t. This problem guarantees that the cleared instances have the minimum precision of 1 - t for Y ≤ MAX. By clearing such low risk instances, we can allocate costly resources to the remaining high risk instances. In this work, we formulate this problem as Risk Clearance with a goal of maximizing the clearance of low risk instances. Existing classification models fail to solve Risk Clearance adequately, so we develop algorithms designed specifically for this problem. We then validate that our approach improves on existing work via experiments on an industrial case study. Copyright © by SIAM.

关键词： Risks

来源：评论

学校读者我要写书评

暂无评论

A novel denoising method for infrared image based on bilateral filtering and non-local means

引用

Optoelectronics Letters 2017年第3期13卷 237-240页

作者：刘凤连孙梦尧蔡文娜 Key Laboratory of Computer Vision and System Ministry of Education of ChinaTianjin Key Laboratory of Intelligence Computing and Novel Software TechnologySchool of Computer and Communication EngineeringTianjin University of TechnologyTianjin 300384China

This paper presents an image denoising method based on bilateral filtering and non-local means. The non-local region texture or structure of the image has the characteristics of repetition, which can be used to effectively preserve the edge and detail of the image. And compared with classical methods, bilateral filtering method has a better performance in denosing for the reason that the weight includes the geometric closeness factor and the intensity similarity factor. We combine the geometric closeness factor with the weight of non-local means, and construct a new weight. Experimental results show that the modified algorithm can achieve better performance. And it can protect the image detail and structure information better.

关键词： bilateral filtering similarity pixel texture combine repetition neighborhood preserve noisy

来源：评论

学校读者我要写书评

暂无评论

Finding the proper node ranking method for complex networks

arXiv

引用

arXiv 2018年

作者： Yu, Senbin Gao, Liang Wang, Yi-Fan Institute of Transportation Systems Science and Engineering MOE Key Laboratory of Urban Transportation System Theory and Technology State Key Laboratory of Rail Traffic Control and Safety Center of Cooperative Innovation for Beijing Metropolitan Transportation Beijing Jiaotong University Beijing100044 China Yinchuan Municipal Bureau of Big Data Management and Service Yinchuan750011 China

Ranking node importance is crucial in understanding network structure and function on complex networks. Degree, h-index and coreness are widely used, but which one is more proper to a network associated with a dynamical process, e.g. SIR spreading process, is still unclear. To fill this gap, a, which is extracted from the fitting 1 function (f(x) = 1 − e2a(x−b)+1) of the average number of nodes in each radius of the neighborhood of a node, is proposed. Experiment results which are carried out on twenty real-world networks show that a can classify which of the three measures (degree, h-index and coreness) is more proper to a network in ranking node importance. We also find that [b/3] is a good indicator for forecasting the optimal radius of the neighborhood of a node in ranking node importance for a given network. To the best of our knowledge, it is the first solution of this interesting and open issue. Furthermore, by extending the range of neighborhood where we construct an operator ℋ on of a node, we propose a new method to quantify the importance of a node. The ranking accuracies of most networks can be improved when the radius is increased from 0 to its forecasting optimal radius and the improvement, for the best case, reaches up to 111%. The performances will reduce on half of the networks studied in this paper if we roughly extend the radius of the neighborhood. Our work deepens the understanding of how to find out the proper node ranking method for complex networks. The proposed methods bridge the gaps among network structure and node importance, and may have potential applications in controlling the outbreak of disease, designing of optimal information spreading *** Codes Game theory, economics, social and behavioral sciences Copyright © 2018, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：