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

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Lai, Xiaoping Cao, Jiuwen Lin, Zhiping Hangzhou Dianzi Univ Inst Informat & Control Hangzhou 310018 Zhejiang Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

ISBN: (纸本)9781538648810

One of the most attractive features of the extreme learning machine (ELM) is its fast speed of learning. In a big data environment, however, ELM may still suffer an overly-heavy computational issue. This paper presents a novel relaxed alternating direction method of multipliers (ADMM) for convex model fitting problems with a focus on a highly parallel implementation for least-squares problems arising from neural network training by ELM. Convergence results and computational complexity of the relaxed ADMM for least-squares problems are given, and comparisons with existing methods are also provided.

关键词： extreme learning machine alternating direction method of multipliers relaxation technique algorithm complexity parallel implementation

来源：评论

学校读者我要写书评

暂无评论

Chebyshev chaotic polynomials for MIMO radar waveform generation

引用

IET RADAR SONAR AND NAVIGATION 2017年第2期11卷 330-340页

作者： Najafabadi, Hamid Esmaeili Ataei, Mohammad Sabahi, Mohamad Farzan Univ Isfahan Dept Elect Engn Esfahan Iran

In this study, the use of a family of Chebyshev chaotic maps for pulse compression in multiple input-multiple output (MIMO) radars is studied. It is shown that, these one-dimensional chaotic maps, which are amongst the simplest chaotic systems, can produce arbitrary number of sequences with arbitrary length, low peak-to-average power ratio (PAPR), high merit factor (MF) or equivalently low integrated side-lobe ratio (ISLR), very low peak side-lobe ratio and low cross-correlation levels. The complexity of algorithm for generating sequences in this method is linear. Besides, because of the flat spectrum of the generated sequences, high spectral efficiency can be achieved utilising these sequences. Moreover, simplicity of the map results in cheap building blocks of MIMO radars. Additionally, a simple method to improve the autocorrelation side-lobe is given. By lowering the autocorrelation side-lobes, ISLR or equivalently MF is enhanced. Nevertheless, in comparison with welldesigned unimodular sequences, the produced sequences show higher PAPRs. By utilising a PAPR reduction mechanism, this shortcoming is alleviated.

关键词： chaotic communication waveform generators pulse compression sequences spectral analysis correlation methods Chebyshev approximation MIMO radar computational complexity Chebyshev chaotic polynomials MIMO radar waveform generation Chebyshev chaotic maps pulse compression multiple-input multiple-output radars one-dimensional chaotic maps peak-to-average power ratio PAPR merit factor integrated side-lobe ratio ISLR peak side-lobe ratio cross-correlation levels algorithm complexity flat spectrum sequence generation spectral efficiency autocorrelation side-lobe improvement

来源：评论

学校读者我要写书评

暂无评论

An optimal algorithm for 3D triangle mesh slicing

引用

COMPUTER-AIDED DESIGN 2017年 92卷 1-10页

作者： Minetto, Rodrigo Volpato, Neri Stolfi, Jorge Gregori, Rodrigo M. M. H. da Silva, Murilo V. G. Fed Univ Technol Parana UTFPR Dept Informat Londrina PR Brazil Fed Univ Technol Parana UTFPR Dept Mech Engn Londrina PR Brazil Univ Estadual Campinas UNICAMP Inst Comp Campinas SP Brazil

We describe an algorithm for slicing an unstructured triangular mesh model by a series of parallel planes. We prove that the algorithm is asymptotically optimal: its time complexity is O(n logk + k + m) for irregularly spaced slicing planes, where n is the number of triangles, k is the number of slicing planes, and m is the number of triangle-plane intersections segments. The time complexity reduces to O(n+ k + m) if the planes are uniformly spaced or the triangles of the mesh are given in the proper order. We also describe an asymptotically optimal linear time algorithm for constructing a set of polygons from the unsorted lists of line segments produced by the slicing step. The proposed algorithms are compared both theoretically and experimentally against known methods in the literature. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Additive manufacturing Triangle-plane intersection Contour construction algorithm algorithm complexity Process planning

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Fix-LLL Lattice Reduction algorithm for MIMO Detection System

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2017年第3期12卷 372-378页

作者： Lv, Huazhang Li, Jianping Commun Univ China Sch Informat Engn 1 Dongjie Dingfuzhuang Chaoyang Dist Beijing Peoples R China

Lenstra-Lenstra-Lovasz (LLL) is an effective lattice reduction algorithm for multiple-input multiple-output (MIMO) systems, which was considered to achieve full diversity in the MIMO fading channel. In the LLL algorithm, size reduction is performed for pairs of consecutive basis vectors, and the concern of numerical stability is raised. However, the whole complexity of the LLL algorithm is of polynomial order, and its characteristics of the convergence perform poor in MIMO system. In this paper, a variant version, named the novel hybrid algorithm, which combines both fix measurement and round measurement, is proposed. By modifying the iteration criterion and choosing proper values of the parameters, the algorithm has a large probability to skip the size reduction and cause a faster convergence, It means in one algorithm iteration the LLL potential can be reduced as much as possible. Also, the performance bound derived by the proximity factor shows that the hybrid LLL has a minor performance loss compared to the LLL algorithm. As a direct consequence, in simulation results, the hybrid LLL algorithm can make a better compromise between the rate of convergence, complexity of the algorithm, and algorithmic performance. (c) 2016 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： LLL algorithm LLL potential lattice reduction algorithm complexity MIMO system

来源：评论

学校读者我要写书评

暂无评论

Quantity and shape modification for random-fractal-based 3D concrete meso-simulation

引用

POWDER TECHNOLOGY 2017年 320卷 161-178页

作者： Yang, Xu Wang, Fenglai Yang, Xincong Zhu, Fei Chi, Bin Harbin Inst Technol Sch Civil Engn Harbin 150090 Heilongjiang Peoples R China Harbin Inst Technol Key Lab Struct Dynam Behav & Control Minist Educ Harbin 150090 Heilongjiang Peoples R China Harbin Inst Technol Minist Ind & Informat Technol Key Lab Smart Prevent & Mitigat Civil Engn Disast Harbin 150090 Heilongjiang Peoples R China

The importance of the meso-scale analysis of concrete has been a controversial topic. The accuracy and efficiency of numerical modelling directly influence the results and computational cost. In this study, we propose a versatile fractal-geometry-based modelling method that can generate an aggregate model with a known gradation curve. Two numerical meso-model groups generated by the random fractal method are measured and analysed considering the gradation curve, coarse aggregate content, and fractal dimension as evaluation indices. It is verified that the evaluation indices of the numerical models are consistent with the actual ones. Based on sampling statistical analysis, the geometrical homogenization of the meso-model generated by the random fractal method is found to be satisfactory for meso-scale applications. Furthermore, the random fractal method is shown to have low algorithm complexity. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Random fradtal method Aggregate Meso-simulation algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Optimizing the algorithm Localization Mobile Robot Using Triangulation Map 1

引用

5th International Conference on Context-Aware Systems and Applications (ICCASA)

作者： Dao Duy Nam Nguyen Quoc Huy SaigonTech SaigonTech TowerLot 14Dist 12 Ho Chi Minh City Vietnam VNUHCM High Sch Gifted 153 Nguyen Chi ThanhDist 5 Ho Chi Minh City Vietnam Saigon Univ 273 An Duong VuongDist 5 Ho Chi Minh City Vietnam

ISBN: (数字)9783319563572

ISBN: (纸本)9783319563572;9783319563565

The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2D self-similar polygonal environment P. The robot has a map of P and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several different locations. The goal, therefore, is to determine the robot's true initial location while minimizing the distance traveled by the robot. We consider approximation algorithm for the robot localization problem. The algorithm is based on triangulation of a simple polygon representing a map. Based on the basis of the implemented program, we conducted experimental studies of this algorithm. The numerical results and their interpretation are better than others.

关键词： Computational geometry Robotics Robot localization Overlay polygon algorithm complexity Approximation algorithm Polygon triangulation

来源：评论

学校读者我要写书评

暂无评论

Comparison of perfect table cryptanalytic tradeoff algorithms

引用

DESIGNS CODES AND CRYPTOGRAPHY 2016年第3期80卷 473-523页

作者： Lee, Ga Won Hong, Jin Seoul Natl Univ Dept Math Sci Seoul 151747 South Korea

The performances of three major time memory tradeoff algorithms were compared in a recent paper. The algorithms considered there were the classical Hellman tradeoff and the non-perfect table versions of the distinguished point method and the rainbow table method. This paper adds the perfect table versions of the distinguished point method and the rainbow table method to the list, so that all the major tradeoff algorithms may now be compared against each other. Even though there are existing claims as to the superiority of one tradeoff algorithm over another algorithm, the algorithm performance comparisons provided by the current work and the recent paper mentioned above are of higher practical value. We provide comparisons of algorithms at parameters that achieve a common success rate of inversion and which take both the cost of pre-computation and the efficiency of the online phase into account. The comparisons are based on the average case execution behaviors rather than the worst case situations, and non-negligible details such as the effects of false alarms and various storage optimization techniques are no longer ignored. A large portion of this paper is allocated to analyzing the execution behavior of the perfect table distinguished point method. In particular, we obtain a closed-form formula for the average length of chains associated with a perfect distinguished point table.

关键词： Time memory tradeoff Distinguished point Rainbow table Perfect table algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

A Study about Kalman Filters Applied to Embedded Sensors

引用

SENSORS 2017年第12期17卷 2810-2810页

作者： Valade, Aurelien Acco, Pascal Grabolosa, Pierre Fourniols, Jean-Yves Univ Toulouse CNRS INSA LAAS F-31031 Toulouse France Inst Mediterraneen Enseignement & Rech Informat & F-66004 Perpignan France

Over the last decade, smart sensors have grown in complexity and can now handle multiple measurement sources. This work establishes a methodology to achieve better estimates of physical values by processing raw measurements within a sensor using multi-physical models and Kalman filters for data fusion. A driving constraint being production cost and power consumption, this methodology focuses on algorithmic complexity while meeting real-time constraints and improving both precision and reliability despite low power processors limitations. Consequently, processing time available for other tasks is maximized. The known problem of estimating a 2D orientation using an inertial measurement unit with automatic gyroscope bias compensation will be used to illustrate the proposed methodology applied to a low power STM32L053 microcontroller. This application shows promising results with a processing time of 1.18 ms at 32 MHz with a 3.8% CPU usage due to the computation at a 26 Hz measurement and estimation rate.

关键词： smart sensors Kalman filters algorithm complexity IMU compensation

来源：评论

学校读者我要写书评

暂无评论

On Resilient Graph Spanners

引用

algorithmICA 2016年第4期74卷 1363-1385页

作者： Ausiello, Giorgio Franciosa, Paolo G. Italiano, Giuseppe F. Ribichini, Andrea Univ Roma La Sapienza Dipartimento Ingn Informat Automat & Gest Via Ariosto 25 I-00185 Rome Italy Univ Roma La Sapienza Dipartimento Sci Stat Piazzale Aldo Moro 5 I-00185 Rome Italy Univ Roma Tor Vergata Dipartimento Ingn Civile & Ingn Informat Via Politecn 1 I-00133 Rome Italy

We introduce and investigate a new notion of resilience in graph spanners. Let be a spanner of a weighted graph . Roughly speaking, we say that is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in fails, then as a consequence of this failure all distances do not degrade in substantially more than in (i.e., the relative distance increases in are very close to those in the underlying graph ). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently.

关键词： Graph algorithms Graph spanners Fault tolerance algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Research on an algorithm of the Acceptable Shortest Path

Research on an Algorithm of the Acceptable Shortest Path

引用

2017 2nd International Conference on Computational Modeling, Simulation and Applied Mathematics（CMSAM 2017)

作者： Dong-dong HE Yin-zhen LI Jia-jie SHEN Wen LI School of Traffic and Transportation Lanzhou Jiaotong University

In transportation network, the path interruption occurs frequently, and how to choose a reasonable path before departure is the key to ensure the timely delivery of materials. In this paper, on the basis of defining the alternative acceptable coefficient of the edge, the alternative acceptable coefficient of the path and the acceptable shortest path(ASP), the algorithm of the ASP is proposed, which can guarantee the transportation time is still acceptable after path interruption, and its complexity is also analyzed. Finally, a numerical example is performed to validate the efficiency and rationality of the proposed algorithm, and the results indicate that the proposed algorithm provides a good way to solve such kinds of problems in the fields of traffic, communication and so on.

关键词： The acceptable shortest path Traffic and transportation network Vital edge algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：