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

IEEE Wireless Communications and Networking Conference

作者： Peng Liu Jia Xu Biao Xu Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University

ISBN: (纸本)9781467398152

In Mobile Opportunistic Networks, there are special cases of multicast in which destinations (except the total number) are not predetermined. E.g., a person tries to find another three players to play poker without knowing them. Achieving efficient data routing in this scenario (target any k destinations among m of them) can be very challenge due to (1) no predetermined destinations, (2) extra delay cost by the destinations collision, and (3) difficulty of the receiver quantity control. We define this as a K-Anycast problem, the goal is to route copies of the message to any k destinations with the shortest average delay. In this paper, we first propose a matching method to solve the problem in a centralized way. We then bring forward a layered hierarchical structure where nodes are organized according to their degree of activities. Based on the structure, two routing algorithms are proposed where K-Cast initializes exactly k copies of the message without replication in the middle, K-Epidemic performs epidemic routing only in a controlled range. Both algorithms will first forward copies upwards along the structure and then downwards to the destinations. Experiments on real data trace show that the proposed algorithms achieve much better delay, delivery ratio and lower forwarding numbers.

关键词： Mobile Opportunistic Network Anycast Data routing Destination collision

来源：评论

学校读者我要写书评

暂无评论

Photo Aesthetic Quality Assessment via Label Distribution Learning

Photo Aesthetic Quality Assessment via Label Distribution Le...

引用

IEEE International Conference on systems, Man, and Cybernetics

作者： Xiaowei Zhang Fei Gao Di Huang Min Tan Jun Yu Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China

ISBN: (纸本)9781509018987

Automatic prediction of photo aesthetic quality is useful for many practical purposes. Current computational approaches typically solved this problem by assigning a categorical label (good or bad) to a photo. However, due to the subjectivity and complexity of humans aesthetic judgments, only a categorical label is insufficient to represent humans perceived aesthetic quality of a photo. This paper focuses on an interesting problem: is it possible to predict the crowed opinions about the aesthetic quality of a photo? The crowed opinion here is expressed by the distribution of scores given by a number of subjects. For each given photo, a deep convolutional neural network (DCNN) is utilized to calculate its feature representation. Afterwards, the crowed opinion prediction problem is formulated as one of label distribution learning (LDL). Experiments show that the proposed method is highly effective and outperforms state-of-the-art algorithms.

关键词： label distribution support regressor photo quality assessment convolutional neural network deep learning label distribution learning

来源：评论

学校读者我要写书评

暂无评论

Clustering the Stations of Bicycle Sharing System

引用

Journal of Donghua University(English Edition) 2016年第6期33卷 968-972页

作者： SHI Xiao-ying YU Zhen-hai XU Hai-tao HUANG Bin-bin Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hang zhou 310018 China

Bicycle sharing system has emerged as a new mode of transportation in many big cities over the past *** the large number of bicycle stations distribute widely in the city,it is difficult to identify their unique attributes and characteristics *** to the real bicycle hire dataset in Hangzhou,China,the clustering analysis for the bicycle stations based on the temporal flow data was carried out ***,based on the spatial distribution and temporal attributes of calculated clusters,visual diagram and map were used to vividly analyze the bicycle hire behavior related to station category and study the travel rules of *** experimental results demonstrate the relation between human mobility,the time of day,day of week and the station location.

关键词： urban mining human mobility analysis visual analytics bicycle sharing system

来源：评论

学校读者我要写书评

暂无评论

Touching PBSData-An exploratory study of visual analytics for Public Bicycle System supporting Multi-touch device

Touching PBSData-An exploratory study of visual analytics fo...

引用

2016 IEEE International Conference on Progress in Informatics and Computing

作者： Xiaoying Shi Zhenhai Yu Xinyu Qu Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Zhejiang Institute of Communications

Public bicycle sharing services are becoming popular over the past decade. The behavior of using public bicycle system(PBS) produces numerous hire records involving citizens' movement. This paper presents a visual analytics system-Touching PBSData, to help both traffic administrators and ordinary citizens visually explore and understand PBS data on multi-touch devices. Tasks and design principles are put forward firstly. Four views are designed to show different aspects of the dataset, including the geographical distribution, the spatio-temporal pattern and personal relevant information. In order to enhance the flexibility and usability of system, the organization mode of views and rich user interaction suitable for multi-touch device are further studied. By adopting real PBS dataset, the results of case studies certify that our method is able to help analyzers to find stations' main function and citizens' travel habits. Moreover, the feedback from the participants with various backgrounds is very affirmative through the user study.

关键词： traffic system management public bicycle system multi-touch device human mobility analysis visual analytics

来源：评论

学校读者我要写书评

暂无评论

A study on formation configuration design for long rang anti-radiation loitering munitions 27

A study on formation configuration design for long rang anti...

引用

27th Chinese Control and Decision Conference, CCDC 2015

作者： Tang, Xue-Mei Yuan, Cao Bo, Pu Bin, Gan Science and Technology on Complex Land Systems Simulation Laboratory Beijing China

ISBN: (纸本)9781479970179

Aiming at improving the target positioning accuracy, the formation configuration of anti-radiation loitering munitions is optimized. Firstly the time difference measuring error and positioning error of the loitering munitions are analyzed and the error propagation model is developed. Then the formation configuration design model is established based on the proposed time difference localization algorithm and the formation flying boundary conditions. Finally, considering the nonlinear features of optimization function for configuration optimization design, the genetic algorithm is introduced to obtain the optimal configuration. The simulation results show that, compared with the traditional formation configurations, the optimization design of configuration can acquire higher estimation accuracy of target position. Besides, the designed configuration has strong robustness. High accuracy estimations of target position can be obtained under a wide range of target position changes. © 2015 IEEE.

关键词： formation configuration loitering munitions optimization design time difference localization

来源：评论

学校读者我要写书评

暂无评论

A study on formation configuration design for long rang anti-radiation loitering munitions

A study on formation configuration design for long rang anti...

引用

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

作者： Tang Xue-mei Cao Yuan Pu Bo Gan Bin Science and Technology on Complex Land Systems Simulation Laboratory

ISBN: (纸本)9781479970186

Aiming at improving the target positioning accuracy,the formation configuration of anti-radiation loitering munitions is *** the time difference measuring error and positioning error of the loitering munitions are analyzed and the error propagation model is *** the formation configuration design model is established based on the proposed time difference localization algorithm and the formation flying boundary ***,considering the nonlinear features of optimization function for configuration optimization design,the genetic algorithm is introduced to obtain the optimal *** simulation results show that,compared with the traditional formation configurations,the optimization design of configuration can acquire higher estimation accuracy of target ***,the designed configuration has strong *** accuracy estimations of target position can be obtained under a wide range of target position changes.

关键词： loitering munitions formation configuration time difference localization optimization design

来源：评论

学校读者我要写书评

暂无评论

Towards Realistic Face Photo-Sketch Synthesis via Composition-Aided GANs

arXiv

引用

arXiv 2017年

作者： Yu, Jun Shi, Shengjie Gao, Fei Tao, Dacheng Huang, Qingming Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China State Key Laboratory of Integrated Services Networks Xidian University Xian710071 China UBTech Sydney Artificial Intelligence Institute The School of Information Technologies Faculty of Engineering and Information Technologies The University of Sydney J12 Cleveland St DarlingtonNSW2008 Australia School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing100190 China

Face photo-sketch synthesis aims at generating a facial sketch/photo conditioned on a given photo/sketch. It is of wide applications including digital entertainment and law enforcement. Precisely depicting face photos/sketches remains challenging due to the restrictions on structural realism and textural consistency. While existing methods achieve compelling results, they mostly yield blurred effects and great deformation over various facial components, leading to the unrealistic feeling of synthesized images. To tackle this challenge, in this work, we propose to use the facial composition information to help the synthesis of face sketch/photo. Specially, we propose a novel composition-aided generative adversarial network (CA-GAN) for face photo-sketch synthesis. In CA-GAN, we utilize paired inputs including a face photo/sketch and the corresponding pixel-wise face labels for generating a sketch/photo. In addition, to focus training on hard-generated components and delicate facial structures, we propose a compositional reconstruction loss. Finally, we use stacked CA-GANs (SCA-GAN) to further rectify defects and add compelling details. Experimental results show that our method is capable of generating both visually comfortable and identity-preserving face sketches/photos over a wide range of challenging data. Our method achieves the state-of-the-art quality, reducing best previous Fréchet Inception distance (FID) by a large margin. Besides, we demonstrate that the proposed method is of considerable generalization ability. We have made our code and results publicly available: Https://***/ca-gan/. Copyright © 2017, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

arXiv

引用

arXiv 2017年

作者： Xu, Gang Li, Ming Mourrain, Bernard Rabczuk, Timon Xu, Jinlan Bordas, Stéphane P.A. School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou310018 China State Key Laboratory of CAD &CG Zhejiang University Hangzhou310058 China INRIA Sophia-Antipolis 2004 Route des Lucioles Cedex06902 France Institute of Structural Mechanics Bauhaus-University Weimar Marienstr. 15 WeimarD-99423 Germany Research Unit in Engineering University of Luxembourg Luxembourg

In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including Bézier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization;then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior Bézier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1/G1-continuity constraints on the interface of neighboring Bézier patches with respect to each quad in the quadrangulation, the high-quality Bézier patch parameterization is obtained by a C1constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach. Copyright © 2017, The Authors. All rights reserved.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Effect of Different Migration Strategies on Evolution of Cooperation in Spatial Prisoner's Dilemma Game

Effect of Different Migration Strategies on Evolution of Coo...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Hong Ding Xiangyu Chen Benyun Shi Yanming Ye Yizhi Ren School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory of Complex Systems Modeling and Simulation Hangzhou Dianzi University Hangzhou China Key Lab. of Complex Syst. Modeling & Simulation Dianzi Univ. Hangzhou China

Many migration strategies have been proposed forPrisoner's Dilemma game on square lattice, such as randommigration, success-driven migration and adaptive migration. Inthis paper, we introduce three novel migration strategies: failure driven migration, hate-driven migration and global-scope migration. Based on the length of migration, individual with one of the first two strategies decides when and where to move into empty nearby places based on its performance in current site, while individual with a global-scope migration can move to anywhere. Then we compare them with the cases of no migration, random migration and success-driven migration. The simulations show that the failure-driven migration has the best performance in most circumstances. While defectors dominate in success-driven migration cases.

关键词： High definition video Big data

来源：评论

学校读者我要写书评

暂无评论

New self-calibration schemes for accelerometers in platform INS

引用

Journal of systems science & complexity 2015年第5期28卷 1032-1042页

作者： Hong Cai Anliang Li Yuan Cao College of Aerospace Science and Engineering National University of Defence Technology Science and Technology on Complex Land Systems Simulation Laboratory

To ensure success of precise navigation, it is necessary to carry out in-field calibration for the accelerometers in platform inertial navigation system(PINS) before a mission is *** continuous self-calibration methods are not fit for fast calibration of accelerometers because the platform misalignments have to be estimated precisely and the nonlinear coupling terms will affect accuracy. The multi-position methods with a "shape of motion" algorithm also have some existing disadvantages: High precision calibration results cannot be obtained when the accelerometer's output data are used directly and it is difficult to optimize the calibration scheme. Focusing on this field, this paper proposes new fast self-calibration methods for the accelerometers of PINS. A data compression filter is employed to improve the accuracy of parameter estimation because it is impossible to obtain non-biased estimation for accelerometer parameters when using the "shape of motion" algorithm. Besides, continuous calibration schemes are designed and optimized by the genetic algorithm(GA) to improve the observability of parameters. simulations prove that the proposed methods can estimate the accelerometer parameter more precisely than traditional continuous methods and multi-position methods, and they are more practical to deal with urgent situations than multi-position methods.

关键词： self-calibration accelerometers data compression genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：