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

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Lv, Xiangyu Hu, Wei Wang, Yonghao College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China Digital Media Lab Birmingham City University United Kingdom

ISBN: (纸本)9781728120584

Efficient scheduling algorithms play an essential part in heterogeneous computing systems (HeCS) to achieve high performance. So we proposed a new efficient dynamic multi-strategies scheduling algorithm (DMS). The basic idea of this algorithm is to reduce communication in the priority calculation phase and task mapping phase. In the priority calculation phase, the algorithm increases the weight of the task. During the task mapping phase, three approaches for mapping tasks are proposed, and the method which reduces the most communication time among the three approaches is chosen as the task mapping standard. The results of the algorithm presented in this paper demonstrate improved performance in terms of speedup, and schedule length ratio. © 2019 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Jointly learning structured analysis discriminative dictionary and analysis multiclass classifier

arXiv

引用

arXiv 2019年

作者： Zhang, Zhao Jiang, Weiming Qin, Jie Zhang, Li Li, Fanzhang Zhang, Min Yan, Shuicheng School of Computer Science and Technology Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China Computer Vision Laboratory ETH Zürich Zürich8092 Switzerland Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore

In this paper, we propose an analysis mechanism based structured Analysis Discriminative Dictionary Learning (ADDL) framework. ADDL seamlessly integrates the analysis discriminative dictionary learning, analysis representation and analysis classifier training into a unified model. The applied analysis mechanism can make sure that the learnt dictionaries, representations and linear classifiers over different classes are independent and discriminating as much as possible. The dictionary is obtained by minimizing a reconstruction error and an analytical incoherence promoting term that encourages the sub-dictionaries associated with different classes to be independent. To obtain the representation coefficients, ADDL imposes a sparse l2,1-norm constraint on the coding coefficients instead of using l0 or l1-norm, since the l0 or l1-norm constraint applied in most existing DL criteria makes the training phase time consuming. The codes-extraction projection that bridges data with the sparse codes by extracting special features from the given samples is calculated via minimizing a sparse codes approximation term. Then we compute a linear classifier based on the approximated sparse codes by an analysis mechanism to simultaneously consider the classification and representation powers. Thus, the classification approach of our model is very efficient, because it can avoid the extra time-consuming sparse reconstruction process with trained dictionary for each new test data as most existing DL algorithms. Simulations on real image databases demonstrate that our ADDL model can obtain superior performance over other state-of-the-arts. Copyright © 2019, The Authors. All rights reserved.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

二维材料最新研究进展

引用

物理化学学报 2021年第12期37卷 1-151页

作者：常诚陈伟陈也陈永华陈雨丁峰樊春海范红金范战西龚成宫勇吉何其远洪勋胡晟胡伟达黄维黄元季威李德慧李连忠李强林立凌崇益刘鸣华刘楠刘庄 Kian Ping Loh 马建民缪峰彭海琳邵明飞宋礼苏邵孙硕谭超良唐智勇王定胜王欢王金兰王欣王欣然 Andrew T.S.Wee 魏钟鸣吴宇恩吴忠帅熊杰熊启华徐伟高尹鹏曾海波曾志远翟天佑张晗张辉张其春张铁锐张翔赵立东赵美廷赵伟杰赵运宣周凯歌周兴周喻朱宏伟张华刘忠范 Institute of Science and Technology Austria Am Campus 13400 KlosterneuburgAustria Department of Chemistry National University of Singapore3 Science Drive 3117543Singapore Department of Chemistry The Chinese University of Hong KongShatinNew TerritoriesHong KongChina Key Laboratory of Flexible Electronics and Institute of Advanced Materials Nanjing Tech UniversityNanjing 211816China School of Life Sciences Shanghai UniversityShanghai 200444China Centre for Multidimensional Carbon Materials Institute for Basic ScienceUlsan 44919Korea School of Chemistry and Chemical Engineering Shanghai Jiao Tong UniversityShanghai 200240China School of Physical and Mathematical Sciences Nanyang Technological UniversitySingapore 637371Singapore Department of Chemistry City University of Hong KongKowloonHong KongChina Department of Electrical and Computer Engineering and Quantum Technology Center University of MarylandCollege ParkMaryland 20742USA School of Materials Science and Engineering Beihang UniversityBeijing 100191China Department of Materials Science and Engineering City University of Hong KongKowloonHong KongChina Center of Advanced Nanocatalysis(CAN) Hefei National Laboratory for Physical Sciences at the MicroscaleDepartment of Applied ChemistryUniversity of Science and Technology of ChinaHefei 230026China College of Chemistry and Chemical Engineering State Key Laboratory of Physical Chemistry of Solid SurfacesCollaborative Innovation Center of Chemistry for Energy Materials(iChEM)Xiamen UniversityXiamen361005Fujian ProvinceChina State Key Laboratory of Infrared Physics Shanghai Institute of Technical PhysicsChinese Academy of SciencesShanghai 200083China Advanced Research Institute of Multidisciplinary Science Beijing Institute of TechnologyBeijing100081China Beijing Key Laboratory of Optoelectronic Functional Materials&Micro-Nano Devices Department of PhysicsRenmin University of ChinaBeijing 100872China School of Optical and Electronic Information Wuhan National Laboratory

Research on two-dimensional(2D) materials has been explosively increasing in last seventeen years in varying subjects including condensed matter physics, electronic engineering, materials science, and chemistry since the mechanical exfoliation of graphene in 2004. Starting from graphene, 2D materials now have become a big family with numerous members and diverse categories. The unique structural features and physicochemical properties of 2D materials make them one class of the most appealing candidates for a wide range of potential applications. In particular, we have seen some major breakthroughs made in the field of 2D materials in last five years not only in developing novel synthetic methods and exploring new structures/properties but also in identifying innovative applications and pushing forward commercialisation. In this review, we provide a critical summary on the recent progress made in the field of 2D materials with a particular focus on last five years. After a brief backgroundintroduction, we first discuss the major synthetic methods for 2D materials, including the mechanical exfoliation, liquid exfoliation, vapor phase deposition, and wet-chemical synthesis as well as phase engineering of 2D materials belonging to the field of phase engineering of nanomaterials(PEN). We then introduce the superconducting/optical/magnetic properties and chirality of 2D materials along with newly emerging magic angle 2D superlattices. Following that, the promising applications of 2D materials in electronics, optoelectronics, catalysis, energy storage, solar cells, biomedicine, sensors, environments, etc. are described sequentially. Thereafter, we present the theoretic calculations and simulations of 2D materials. Finally, after concluding the current progress, we provide some personal discussions on the existing challenges and future outlooks in this rapidly developing field.

关键词： Two-dimensional materials Transition metal dichalcogenides Phase engineering of nanomaterials Electronics Optoelectronics Catalysis Energy storage and conversion

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Incremental algorithms for the maximum internal spanning tree problem

引用

Science China information Sciences 2022年第10期65卷 1-1页

作者： Zhu, Xianbin Li, Wenjun Yang, Yongjie Wang, Jianxin School of Computer Science and Engineering Central South University Changsha China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha China Chair of Economic Theory Saarland University Saarbrücken Germany

In the original paper [1], there are two errors on page 5. The rules in the algorithm are not sufficient since we omitted one rule during publication. The following rule should be added to the paper. Rule 3: If P1 = (u, v) and P2 = (x, y) are two maximal leaf-paths both with two vertices in T, where u and x are leaves in T and (v, y) ∈ E(G), we remove (y′, y) and then add (v, y) to T where y′ is the non-leaf neighbor of y in T. The expression of Algorithm 2 is not accurate. It should be modified as follows. Line 3: Exhaustively apply Rules 1–3, and for i ∈ {2, 3} only apply Rule i when none of Rules j where 1 ⩽ j < i is applicable. Line 8: Determine the longest path P among all paths whose endpoints have nonempty neighbors in T \ V(T′).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Preliminary ideas for intelligent recognition paths of anomie behaviors among MOOC learners 2nd

Preliminary ideas for intelligent recognition paths of anomi...

引用

2nd International Conference on Smart Vehicular technology, Transportation, Communication and Applications, VTCA 2018

作者： Liu, Shutang Zhang, Fuquan Jiang, Chunfen Academic Affairs Office Minjiang University Fuzhou University Town Fuzhou350108 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350121 China School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China School of Foreign Language Minjiang University Fuzhou University Town Fuzhou350108 China

ISBN: (纸本)9783030045845

This paper identifies the characteristics of anomie behaviors of MOOC learners through the cluster analysis of those anomie behaviors, and finds out the initial paths of intelligent recognition through online analysis of the background data characteristics of these anomie behaviors. The paper also suggests that these identification paths are not difficult to find, but there are still some profound reasons why many MOOC companies have not adopted those paths so far. © Springer Nature Switzerland AG 2019.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimization on multistage half-band FIR filter design using simulated annealing algorithm 21

Multi-objective optimization on multistage half-band FIR fil...

引用

作者： Zhang, Jin Hu, Wei Wang, Yonghao Zhu, Xiangyu College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System Wuhan China Digital Media Technology Lab Birmingham City University Birmingham United Kingdom

ISBN: (纸本)9781728120584

The design of a finite impulse response (FIR) digital filter is essentially a multi-parameter and multi-objective optimization problem, different optimization techniques can be utilized to minimize the latency in the live audio processing chain by minimization or maximization of the objective function. Using cascaded FIR filters as anti-aliasing and anti-image filters for high-resolution audio conversion are common. We can optimize the parameters of each stage to achieve the overall performance requirements. the method of modified Simulated Annealing (SA) Algorithm is proposed to resize the best distribution of passband ripple, transition band and stopband attenuation for each level of Multi-stage filter. It shows the proposed a new multi-stage filter design method improves the efficiency of the designed filter in terms of filter cost and group delay comparing with traditional design. © 2019 IEEE.

关键词： FIR filters

来源：评论

学校读者我要写书评

暂无评论

AI-assisted MAC for reconfigurable intelligent surface-aided wireless networks: Challenges and opportunities

arXiv

引用

arXiv 2021年

作者： Cao, Xuelin Yang, Bo Huang, Chongwen Yuen, Chau Renzo, Marco Di Han, Zhu Niyato, Dusit Poor, H. Vincent Hanzo, Lajos Engineering Product Development Pillar Singapore University of Technology and Design Singapore Singapore Zhejiang Provincial Key Lab of information processing Communication and networking Zhejiang University China Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et Systèmes 3 Rue Joliot-Curie Gif-sur-Yvette91192 France Department of Electrical and Computer Engineering University of Houston United States School of Computer Science and Engineering Nanyang Technological University Singapore Singapore Department of Electrical Engineering Princeton University United States School of Electronics and Computer Science University of Southampton United Kingdom

Recently, significant research attention has been devoted to the study of reconfigurable intelligent surfaces (RISs), which are capable of reconfiguring the wireless propagation environment by exploiting the unique properties of metamaterials-based integrated large arrays of inexpensive antennas. Existing research demonstrates that RISs significantly improve the physical layer performance, including the wireless coverage, achievable data rate and energy efficiency. However, the medium access control (MAC) of multiple users accessing an RIS-enabled channel is still in its infancy, while many open issues remain to be addressed. In this article, we present four typical RIS-aided multi-user scenarios with special emphasis on the MAC schemes. We then propose and elaborate upon centralized, distributed and hybrid artificial-intelligence (AI)-assisted MAC architectures in RIS-aided multi-user communications systems. Finally, we discuss some challenges, perspectives and potential applications of RISs as they are related to MAC design. Copyright © 2021, The Authors. All rights reserved.

关键词： Medium access control

来源：评论

学校读者我要写书评

暂无评论

A budget constraint incentive mechanism in spatial-temporal mobile crowdsensing 21

A budget constraint incentive mechanism in spatial-temporal ...

引用

作者： Kong, Xujiao Li, Peng Zhang, Tao Tu, Meimei Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

Mobile crowdsensing is an effective way to collect sensing data about regions of interest. Effective incentive mechanisms are invaluable in mobile crowd sensing, for recruiting a number of mobile users to fulfill coverage requirement in the interested regions. In this paper, we exploit the potential of mobile users by designing a spatial-temporal crowd sensing incentive mechanism for smartphone users. We first use the logistic regression technique to mine user preferences from the user's historical data. Then, we propose a sub-module approximation algorithm to solve the participant recruitment problem, which is proved to be an NP-hard problem. Moreover, we design the winner auction algorithm (WAA) based on the reverse auction mechanism to solve the critical payment allocation problem. Finally, we demonstrate that our mechanism achieves truthfulness, individual rationality, and high computation efficiency through both theoretical analysis and experimental simulation. © 2019 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Budget constraint roadside units placement for traffic flows monitoring system with reliability in vehicular networks 21

Budget constraint roadside units placement for traffic flows...

引用

作者： Jiang, Peng Li, Peng Zhang, Tao Huang, Weiyi He, Heng Nie, Lei Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

In Traffic Flows Monitoring System (TFMS), the key problem is how to install Roadside Units (RSUs) reliably to monitor traffic flows with the constrained budget. The reliability of Traffic Flows Monitoring System(TFMS) is determined by the number of RSUs each traffic flow pass through, and the RSUs placement number is determined by the budget and the placement strategy. In this paper, we investigate the budget constraint RSUs placement problem for traffic flows monitoring system with reliability in vehicular networks. Given a budget constraint, the problem is how to install RSUs to ensure the reliability of TFMS, that is each traffic flow pass through RSUs as many as possible with the limited budget. We prove that this problem is NP-hard. Then, we propose two greedy algorithms to solve the problem according to the pigeonhole principle. Moreover, approximation ratios of proposed algorithms are given. Finally, we verify the feasibility of proposed algorithms through extensive experiments, and the results show that the proposed algorithms are superior to the other algorithms. © 2019 IEEE.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Minimum cost task assignment for vehicle-based crowdsensing with deterministic and nondeterministic trajectory 21

Minimum cost task assignment for vehicle-based crowdsensing ...

引用

作者： Tu, Meimei Li, Peng Zhang, Tao Zhou, Qiang Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

Vehicle-based crowdsensing (VCS) is a special case in crowdsourcing, and task assignment is a basic and important problem. In this paper, we investigate the minimum cost task assignment (MCTA) problem for vehicle-based crowdsensing. The VCS platform hopes to recruit some vehicles to complete given spatial-temporal tasks with the minimum cost. As vehicle trajectories are dynamic, we divide the MCTA problem into two sub-problems, the deterministic trajectory (D-MCTA) problem, and nondeterministic trajectory (N-MCTA) problem. For D-MCTA problem, we prove that the D-MCTA problem is NP-hard, and we propose a greedy algorithm to solve this problem. For N-MCTA problem, firstly, we determine the probability of each vehicle's trajectory through the logistic regression method. Then, we exploit the semi-Markov method to calculate the probability of each vehicle executing the task. Moreover, a greedy algorithm is proposed and the theoretical analysis is given. Finally, extensive simulations have been conducted to show the performance of our proposed algorithms is superior to the other algorithms. © 2019 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：