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

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Haipeng Dai Yunhuai Liu Alex X. Liu Lingtao Kong Guihai Chen Tian He State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu CHINA Third Research Institute of Ministry of Public Security Shanghai CHINA Shanghai key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Computer Science and Engineering University of Minnesota Minneapolis MN USA Department of Automation Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781467399548

Wireless Power Transfer has become a commercially viable technology to charge devices because of the convenience of no power wiring and the reliability of continuous power supply. This paper concerns the fundamental issue of wireless charger placement with electromagnetic radiation (EMR) safety. Although there are a few wireless charging schemes consider EMR safety, none of them addresses the charger placement issue. In this paper, we propose PESA, a wireless charger Placement scheme that guarantees EMR SAfety for every location on the plane. First, we discretize the whole charging area and formulate the problem into the Multidimensional 0/1 Knapsack (MDK) problem. Second, we propose a fast approximation algorithm to the MDK problem. Third, we optimize our scheme to improve speed by double partitioning the area. We prove that the output of our algorithm is better than (1 - ϵ) of the optimal solution to PESA with a smaller EMR threshold (1 - ϵ/2)Rt and a larger EMR coverage radius (1 + ϵ/2)D. We conducted both simulations and field experiments to evaluate the performance of our scheme. Our experimental results show that in terms of charging utility, our algorithm outperforms the prior art by up to 45.7%.

关键词： Safety Wireless communication Wireless sensor networks Approximation algorithms Partitioning algorithms Inductive charging Aggregates

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Driver's Avoiding Maneuver in a Highly Emergency Situation

引用

SICE Journal of Control, Measurement, and System Integration 2015年第1期8卷 27-33页

作者： Makoto Itoh Marie-Pierre Pacaux Lemoine Fré dé ric Robache Hervé Morvan Faculty of Engineering Information and Systems University of Tsukuba Laboratory of Industrial and Human Automation Mechanics and Computer Science University of Valenciennes

This paper discusses driver's emergency avoiding behavior while he or she is driving a car in a rural area. Based on behavioral data obtained from an experiment conducted in France with a high-fidelity driving simulator, the authors analyzed the driver behavior just before the collision. The results showed that the drivers tended to choose a “rational” behavior to avoid the collision by using the available visual cues even though the situation is extremely time critical, i.e., the time to collision was only approximately 1.5 seconds.

关键词： emergency automobile collision avoidance driving assistance

来源：评论

学校读者我要写书评

暂无评论

Moth-inspired plume tracing via autonomous underwaer vehicle with only a pair of separated chemical sensors

Moth-inspired plume tracing via autonomous underwaer vehicle...

引用

MTS/IEEE Washington, OCEANS 2015

作者： Tian, Yu Li, Wei Zhang, Fumin State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Department of Computer and Electrical Engineering and Computer Science California State University BakersfieldCA93311 United States School of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332 United States

ISBN: (纸本)9780933957435

Effective chemical plume tracing strategies are important for autonomous underwater vehicles (AUVs) to perform a variety of missions of searching for underwater targets, such as oil spill sources and deep-sea hydrothermal vents. In such circumstances where fluid flow direction cannot be measured by AUVs or fluid flow direction provides little or wrong information about the distribution of a dynamic chemical plume or its source location, chemical plume tracing strategies that rely on information of fluid flow direction may not work effectively. In this paper, a modified moth-inspired chemical plume tracing strategy is presented, which could trace a turbulent chemical plume without need of information of flow direction. The strategy estimates the direction of plume centerline based on information from a pair of spatially separated chemical sensors symmetrically mounted on an AUV's nose together with the AUV's zigzag plume-tracing trajectory, and employs the estimated direction of plume centerline to implement the plume tracing. The proposed strategy is implemented in a computer simulation environment and the simulation results demonstrate that with the strategy an AUV could track a turbulent chemical plume over a long distance and finally localize the plume source. © 2015 MTS.

关键词： Autonomous underwater vehicles

来源：评论

学校读者我要写书评

暂无评论

5G entering into a new era [Guest Editorial]

引用

China Communications 2017年第12期14卷 iv-vi页

作者： Feifei Gao Changle Li Jun Fang Kaizhi Huang Zhi Quan Chengwen Xing Jianhua Zhang Zhongshan Zhang Liqiang Zhao Yulong Zou Department of Automation Tsinghua University Beijing China State Key Laboratory of Integrated Services Networks Xidian University University of Eletronic Science and Technology of China National Digital Switching System Engineering & Technological Research Center Zhengzhou China College of Information Engineering Shenzhen University School of Information and Electronics Beijing Institute of Technology Beijing University of Posts and Telecommunication School of Computer and Communication Engineering in the University of Science and Technology Beijing State Key Lab. of Integrated Service Networks Xidian University Nanjing University of Posts and Telecommunications (NUPT) Nanjing China

The ever increasing wireless data services, such as imaging, video, audio, multimedia, etc., have demands for the very high speed wireless communications and network, which are unfortunately a bottleneck when combining with the wireline core network. Users' are now expecting high quality of experience with low-cost devices, ubiquitous connectivity, energy efficiency, high reliability, or even ultra-low latency if a vehicle terminal is applied.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-scale convolutional neural networks for lung nodule classification 24th

Multi-scale convolutional neural networks for lung nodule cl...

引用

24th International Conference on Information Processing in Medical Imaging, IPMI 2015

作者： Shen, Wei Zhou, Mu Yang, Feng Yang, Caiyun Tian, Jie Key Laboratory of Molecular Imaging of Chinese Academy of Sciences Institute of Automation Chinese Academy of Sciences Beijing China School of Computer and Information Technology Beijing Jiaotong University Beijing China Department of Computer Science and Engineering University of South Florida Tampa United States

We investigate the problem of diagnostic lung nodule classification using thoracic Computed Tomography (CT) screening. Unlike traditional studies primarily relying on nodule segmentation for regional analysis, we tackle a more challenging problem on directly modelling raw nodule patches without any prior definition of nodule morphology. We propose a hierarchical learning framework-Multi-scale Convolutional Neural Networks (MCNN)-to capture nodule heterogeneity by extracting discriminative features from alternatingly stacked layers. In particular, to sufficiently quantify nodule characteristics, our framework utilizes multi-scale nodule patches to learn a set of class-specific features simultaneously by concatenating response neuron activations obtained at the last layer from each input scale. We evaluate the proposed method on CT images from Lung Image Database Consortium and Image Database Resource Initiative (LIDC-IDRI), where both lung nodule screening and nodule annotations are provided. Experimental results demonstrate the effectiveness of our method on classifying malignant and benign nodules without nodule segmentation. © Springer International Publishing Switzerland 2015.

关键词： computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

Plasmonic metalens based on coupled resonators for focusing of surface plasmons

引用

Scientific Reports 2016年第1期6卷 1-8页

作者： Xu, Quan Zhang, Xueqian Xu, Yuehong Li, Quan Li, Yanfeng Ouyang, Chunmei Tian, Zhen Gu, Jianqiang Zhang, Wentao Zhang, Xixiang Han, Jiaguang Zhang, Weili Center for Terahertz Waves College of Precision Instrument and Optoelectronics Engineering Tianjin University Key Laboratory of Optoelectronics Information and Technology Ministry of Education Tianjin 300072 China Cooperative Innovation Center of Terahertz Science Chengdu 610054 China College of Electrical Engineering and Automation Guilin University of Electronic Technology Guilin 541000 China Divison of Physical Science and Engineering King Abdullah University of Science and Technology Thuwal 23955-6900 Saudi Arabia School of Electrical and Computer Engineering Oklahoma State University Stillwater 74078 OK United States

As an essential functionality, flexible focusing of surface plasmons (SPs) is of particular interest in nonlinear optics and highly integrated plasmonic circuitry. Here, we developed a versatile plasmonic metalens, a metasurface comprised of coupled subwavelength resonators, whose optical responses exhibit a remarkable feature of electromagnetically induced transparency (EIT). We demonstrate numerically and experimentally how a proper spatial design of the unit elements steers SPs to arbitrary foci based on the holographic principles. More specifically, we show how to control the interaction between the constituent EIT resonators to efficiently manipulate the focusing intensity of SPs. We also demonstrated that the proposed metalens is capable of achieving frequency division multiplexing. The power and simplicity of the proposed design would offer promising opportunities for practical plasmonic devices.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A real time data mining rules selection model for the Job Shop Scheduling Problem 45

A real time data mining rules selection model for the Job Sh...

引用

45th International Conference on computers and Industrial engineering, CIE 2015

作者： Zahmani, M. Habib Atmani, B. Bekrar, A. Aissani, N. Laboratory of Pure and Applied Mathematics University of Mostaganem Mostaganem Algeria Laboratoire d'Informatique d'Oran University of Oran 1 Oran Algeria Laboratory of Industrial and Human Automation Control Mechanical Engineering and Computer Science University of Valenciennes and Hainaut Cambrésis Valenciennes France

Finding the best Dispatching Rule for a Job Shop Scheduling Problem is a tedious task, both time and cost consuming. Since there is no rule that can outperform the others, in this paper we propose an approach able to affect in real-time a different Dispatching Rule for each machine while minimizing makespan. This approach is based on simulation and Data Mining. Experimentations show that the proposed system returns good results in both makespan and processing time needs.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Identifiability and Parameter Estimation of Linear Continuous-time Systems under Irregular and Random Sampling

引用

IFAC-PapersOnLine 2015年第28期48卷 332-337页

作者： Mu, Biqiang Guo, Jin Wang, Le Yi Yin, George Xu, Lijian Zheng, Wei Xing Key Laboratory of Systems and Control Chinese Academy of Sciences Beijing100190 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Department of Electrical and Computer Engineering Wayne State University DetroitMI48202 United States Department of Mathematics Wayne State University DetroitMI48202 United States Department of Electrical and Computer Engineering Technology Farmingdale State College State University of New York FarmingdaleNY11735 United States School of Computing Engineering and Mathematics University of Western Sydney PenrithNSW2751 Australia

This paper considers the problem of identifiability and parameter estimation of single-input-single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditions for system identifiability are established under inputs of exponential polynomial types and a tight bound on sampling density. Identification algorithms of Gauss-Newton iterative types are developed to generate convergent estimate sequences. When the sampled output is corrupted by observation noises, input design, sampling times, and convergent algorithms are intertwined. Persistent excitation (PE) conditions for strongly convergent algorithms are derived. Unlike the traditional identification, the PE conditions under irregular and random sampling involve both sampling times and input values. Under the given PE conditions, iterative and recursive algorithms are developed to estimate the original continuous-time system parameters. The corresponding convergence results are obtained. Several simulation examples are displayed to verify the theoretical results. © 2015

关键词： Continuous time systems Iterative methods Lyapunov methods Nonlinear control systems Parameter estimation Sampling convergence and asymptotical normality Estimation algorithm Identifiability Irregular sampling Linear continuous time system Non linear least squares

来源：评论

学校读者我要写书评

暂无评论

Online Sketching Hashing

Online Sketching Hashing

引用

IEEE Conference on computer Vision and Pattern Recognition

作者： Cong Leng Jiaxiang Wu Jian Cheng Xiao Bai Hanqing Lu National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences School of Computer Science and Engineering Beihang University

ISBN: (纸本)9781467369657

Recently, hashing based approximate nearest neighbor (ANN) search has attracted much attention. Extensive new algorithms have been developed and successfully applied to different applications. However, two critical problems are rarely mentioned. First, in real-world applications, the data often comes in a streaming fashion but most of existing hashing methods are batch based models. Second, when the dataset becomes huge, it is almost impossible to load all the data into memory to train hashing models. In this paper, we propose a novel approach to handle these two problems simultaneously based on the idea of data sketching. A sketch of one dataset preserves its major characters but with significantly smaller size. With a small size sketch, our method can learn hash functions in an online fashion, while needs rather low computational complexity and storage space. Extensive experiments on two large scale benchmarks and one synthetic dataset demonstrate the efficacy of the proposed method.

关键词： hashing Dataset storage spaces Sketches complexity classes hashing method small size

来源：评论

学校读者我要写书评

暂无评论

Mixed integer programming formulations for the single processor scheduling problem with time restrictions 45

Mixed integer programming formulations for the single proces...

引用

45th International Conference on computers and Industrial engineering, CIE 2015

作者： Benmansour, R. Braun, O. Artiba, A. LAMIH UMR CNRS 8201 Laboratory of Industrial and Human Automation Control Mechanical Engineering and Computer Science Université de Valenciennes et du Hainaut Cambrésis France Trier University of Applied Sciences Environmental Campus Birkenfeld Birkenfeld55761 Germany

In the single-processor scheduling problem with time restrictions, n independent jobs have to be processed non-preemptively on a single processor that can handle only one job at a time, subject only to the following constraint: during any time period of length α > 0 the number of jobs being executed is less than or equal to a given integer value B ≥ 2. This constraint reflects the condition that each job needs one of B additional resources for being processed and that a resource has to be renewed after the processing of a job has been finished. The jobs are simultaneously available for processing at the beginning of the planning horizon, and their processing times are fixed and known in advance. The objective is to minimize the completion time of the last job in the optimal sequence (i.e. the makespan). In a previous work it is shown that this problem is NP-hard when the value B is variable and a classical worst-case analysis of List Scheduling for this situation has been carried out. We present two mixed integer programming (MIP) formulations to solve the single-processor scheduling problem with time restrictions exactly. The first model is based on time indexed variables whereas the second is based on assignment and positional date variables. The performances of these models are tested by running them on randomly generated instances. Extensive computational studies show the effectiveness (in the number of problems solved) and efficiency (in computational time) of the assignment and positional date variables formulation for the randomly generated instances with up to n = 500 jobs, B = 10 number of resources and processing times out of the interval 1 up to 1000.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：