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

Toward Scalable and Robust Indoor Tracking: design, Implementation, and Evaluation

IEEE INTERNET OF THINGS JOURNAL 2020年第2期7卷 1192-1204页

作者： Jin, Feiyu Liu, Kai Zhang, Hao Ng, Joseph Kee-Yin Guo, Songtao Lee, Victor C. S. Son, Sang H. Chongqing Univ Key Lab Dependable Serv Comp Cyber Phys Soc Minist Educ Chongqing 400040 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400040 Peoples R China Hong Kong Baptist Univ Dept Comp Sci Hong Kong Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Daegu Gyeongbuk Inst Sci & Technol Dept Informat & Commun Engn Daegu 42988 South Korea

Although indoor localization has been studied over a decade, it is still challenging to enable many IoT applications, such as activity tracking and monitoring in smart home and customer navigation and trajectory mining in smart shopping mall, which typically require meter-level localization accuracy in a highly dynamic and large-scale indoor environment. Therefore, this article aims at designing and implementing an adaptive and scalable indoor tracking system in a cost-effective way. First, we propose a zero site-survey overhead (ZSSO) algorithm to enhance the system scalability. It integrates the step information and map constraints to infer user's positions based on the particle filter and supports the auto labeling of scanned Wi-Fi signal for constructing the fingerprint database without the extra site-survey overhead. Further, we propose an iterative-weight-update (IWU) strategy for ZSSO to enhance system robustness and make it more adaptive to the dynamic changing of environments. Specifically, a two-step clustering mechanism is proposed to delete outliers in the fingerprint database and alleviate the mismatch between the auto-tagged coordinates and the corresponding signal features. Then, an iterative fingerprint update mechanism is designed to continuously evaluate the Wi-Fi fingerprint localization results during online tracking, which will further refine the fingerprint database. Finally, we implement the indoor tracking system in real-world environments and conduct a comprehensive performance evaluation. The field testing results conclusively demonstrate the scalability and effectiveness of the proposed algorithms.

关键词： algorithm design indoor localization performance evaluation trajectory tracking Wi-Fi fingerprint

来源：评论

学校读者我要写书评

暂无评论

Block-based multiperiod dynamic memory design for low data-retention power

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2003年第6期11卷 1006-1018页

作者： Kim, J Papaefthymiou, MC Univ Michigan Dept Elect Engn & Comp Sci Adv Comp Architecture Lab Ann Arbor MI 48109 USA

Dynamic random access memorys (DRAMs) are widely used in portable applications due to their high storage density. In standby mode, the main source of DRAM power dissipation is the refresh operation that periodically restores leaking charge in each memory cell to its correct level. Conventional DRAMs use a single refresh period determined by the cell with the largest leakage. This approach is simple but dissipative, because it forces unnecessary refreshes for the majority of the cells with small leakage. In this paper, we investigate a novel scheme that relies on small refresh blocks and multiple refresh periods to reduce DRAM dissipation by decreasing the number of cells refreshed too often. In contrast to conventional row-based refresh, small refresh blocks are used to increase worst case data retention times. Long periods are used to accommodate cells with small leakage. Retention times are further extended by adding a swap cell to each refresh block. We give a novel polynomial-time algorithm for computing an optimal set of refresh periods for block-based multiperiod refresh. Specifically, given an integer K and a distribution of data-retention times, in O(KN2) steps our algorithm computes K refresh periods that minimize DRAM dissipation, where N is the number of refresh blocks in the memory. We describe and evaluate a scalable implementation of our refresh scheme whose overhead is asymptotically linear with memory size. In simulations with a 16-Mb DRAM, block-based multiperiod refresh reduces DRAM standby dissipation by a multiplicative factor of 4 with area overhead below 6%. Moreover, our proposed scheme is robust to semiconductor process variations, with power savings degrading no more than 7% over a 20-fold increase of leaky cells.

关键词： algorithm design block-based multiperiod refresh dynamic memory low-energy design low-power design process variations tolerance

来源：评论

学校读者我要写书评

暂无评论

Multidisciplinary design of Ultra-High-Speed Electrical Machines

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 2018年第3期33卷 1203-1212页

作者： Ismagilov, Flur R. Uzhegov, Nikita Vavilov, Vyacheslav E. Bekuzin, Vladimir I. Ayguzina, Valentina V. Ufa State Aviat Tech Univ Dept Electromech Ufa 450005 Russia SpinDrive Lappeenranta 54100 Finland

This paper presents a multidisciplinary design algorithm of the ultra-high-speed electrical machine (UHSEM). Presented algorithm enables UHSEM design with a rotational speed of 0.5-1.2 Mrpm, taking into account the mutual influence of thermal, mechanical, and electromagnetic processes. Based on the algorithm, the 138 W UHSEM with a 1.2 Mrpm rotational speed was calculated. Material selection for the active parts of the machine is described. Analysis of the suitable bearings for UHSEM application is presented. Mechanical, electromagnetic, and cooling design aspects are shown with example of the calculated machine. To evaluate the effectiveness of the developed computer models and the calculation method, the experimental model of the 100 W UHSEM was tested in the motor mode at the rotational speed of 500 000 rpm. The test results demonstrated that the multidisciplinary design algorithm has high accuracy and is suitable for UHSEMs. The discrepancy between developed models and experimental results does not exceed 7%.

关键词： Ultra-high-speed electrical machine algorithm design permanent magnets

来源：评论

学校读者我要写书评

暂无评论

Permutation routing in double-loop networks: design and empirical evaluation

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2003年第13-15期48卷 387-402页

作者： Dobravec, T Robic, B Zerovnik, J Univ Ljubljana Fac Comp & Informat Sci Ljubljana 1000 Slovenia Inst Math Phys & Mech Ljubljana Slovenia Univ Maribor Fac Mech Engn SLO-2000 Maribor Slovenia

A double-loop network is an undirected graph whose nodes are integers 0, 1,..., n-1 and each node a is adjacent to four nodes u +/- h(1) (mod > n), u +/- h(2) (mod > n), where 0 pi(u) is a permutation. The aim i... 详细信息

A double-loop network is an undirected graph whose nodes are integers 0, 1,..., n-1 and each node a is adjacent to four nodes u +/- h(1) (mod > n), u +/- h(2) (mod > n), where 0 < h(1) < h(2) < n/2. There are initially n packets, one at each of the n nodes. The packet at node a is destined to node pi(u), where the mapping u-->pi(u) is a permutation. The aim is to minimize the number of routing steps to route all the packets to their destinations. If P is the tight lower bound for this number, then the best known permutation routing algorithm takes, on average, 1.98l routing steps (and 2l routing steps in the worst-case). Because the worst-case complexity cannot be improved, we design four new static permutation routing algorithms with gradually improved average-case performances, which are 1.37l, 1.35l, 1.18l, and 1.12l. Thus, the best of these algorithms exceeds the optimal routing by at most 12% on average. To support our algorithm design we develop a program which simulates permutation routing in a network according to the given topology, routing model as well as communication pattern and measure several quality criteria. We have tested our algorithms on a large number of double-loop networks and permutations (randomly generated and standard). (C) 2003 Elsevier Science B.V. All rights reserved.

关键词： double-loop network permutation routing algorithm design simulation

来源：评论

学校读者我要写书评

暂无评论

Application of genetic algorithms for the design of ozone control strategies

引用

JOURNAL OF THE AIR & WASTE MANAGEMENT ASSOCIATION 2000年第6期50卷 1050-1063页

作者： Loughlin, DH Ranjithan, SR Baugh, JW Brill, ED N Carolina State Univ Raleigh NC 27695 USA

designing air quality management strategies is complicated by the difficulty in simultaneously considering large amounts of relevant data, sophisticated air quality models, competing design objectives, and unquantifiable issues. For many problems, mathematical optimization can be used to simplify the design process by identifying cost-effective solutions. Optimization applications for controlling nonlinearly reactive pollutants such as tropospheric ozone, however, have been lacking because of the difficulty in representing nonlinear chemistry in mathematical programming models. We discuss the use of genetic algorithms (GAs) as an alternative optimization approach for developing ozone control strategies. A GA formulation is described and demonstrated for an urban-scale ozone control problem in which controls are considered for thousands of pollutant sources simultaneously. A simple air quality model is integrated into the GA to represent ozone transport and chemistry. Variations of the GA formulation for multiobjective and chance-constrained optimization are also resented. The paper concludes with a discussion of the practicality of using more sophisticated, regulatory-scale air quality models with the GA. We anticipate that such an approach will be practical in the near term for supporting regulatory decision-making.

关键词： Linear-programming model Air-pollution Optimization Solve Cost Solve Gallium control strategy design process Air contamination Tropospheric Ozone algorithm design Air quality models air quality management ozone Genetic algorithm (GA)

来源：评论

学校读者我要写书评

暂无评论

A few results for using genetic algorithms in the design of electrical machines

引用

IEEE TRANSACTIONS ON MAGNETICS 1997年第2期33卷 1892-1895页

作者： Wurtz, F Richomme, M Bigeon, J Sabonnadiere, JC Laboratory of Chromatography DEPg.Fac.Quimica Universidad Nacional Autonoma de Mexico Circuito interior Cd Universitaria/CP 04510 Mexico D.F.Mexico

Genetic algorithms (GAs) seem to be attractive for the design of electrical machines but their main difficulty is to find a configuration so that they are efficient. This paper exposes a criterion and a methodology we have imagined to find efficient configurations. The first configuration we obtained will then be detailed. The results based on this configuration will be exposed with an example of a design problem.

关键词： electric machines algorithm design configurations Genetic algorithm (GA) design problems

来源：评论

学校读者我要写书评

暂无评论

Spatial-dependent waveform design for colocated uniform linear array multiple-input multiple-output radar

引用

IET RADAR SONAR AND NAVIGATION 2011年第5期5卷 545-550页

作者： Jindong, Z. Kerang, W. Xiaohua, Z. Nanjing Univ Sci & Technol Sch Elect Engn & Optoelect Technol Nanjing 210094 Jiangsu Peoples R China

Multiple-input multiple-output (MIMO) radars have attracted considerable attention for their ability to transmit multiple waveforms. These waveforms affect the range, Doppler and spatial performance. Recently, the concept of ambiguity function, which is an important mathematical tool for analysing and designing radar signals, has been extended to the MIMO radar case. In this study, the authors investigate the range and spatial properties of colocated MIMO radar based on range-spatial ambiguity function. Owing to spatial dependence of the matched filter output of MIMO radar, the spatial detection region is divided into multiple sections by spatial resolution. A new algorithm for designing orthogonal frequency-hopping waveforms according to the spatial section where the target may appear is proposed. This algorithm improves the peak sidelobe level of the matched filter output.

关键词： algorithm design filter output RADAR SIGNALS matched filters MIMO radar waveforms ambiguity function SPACE DEPENDENCE multiple input multiple output systems

来源：评论

学校读者我要写书评

暂无评论

Joint design of a channel-optimized quantizer and multicarrier modulation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1998年第10期46卷 1254-1257页

作者： Ho, KP Kahn, JM Chinese Univ Hong Kong Dept Informat Engn Shatin NT Peoples R China Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We present an algorithm for design of a joint source-channel coder using a channel-optimized quantizer and multicarrier modulation, By changing the power of each subchannel in the multicarrier modulation system, different degrees of error protection can be provided for different bits according to their importance. The algorithm converges to a locally optimum system design. Compared to a Lloyd-Max scalar quantizer or a LEG vector quantizer using single-channel transmission, our optimized code can yield substantial performance improvements. The performance improvements are most pronounced at low channel signal-to-noise ratios.

关键词： single-channel performance boost quantizer algorithms ENCODER algorithm design error protection subchannel

来源：评论

学校读者我要写书评

暂无评论

Critique of the paper 'Novel design of arithmetic coding for data compression'

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1997年第6期144卷 394-396页

作者： Moffat, A Univ Melbourne Dept Comp Sci Parkville Vic 3052 Australia

In the note the author provides a critique of the paper 'Novel design of arithmetic coding for data compression' by J. Jiang. A number of problems in the proposed implementation are pointed out, and the origin... 详细信息

关键词： arithmetic coding data compression algorithm design signal processing

来源：评论

学校读者我要写书评

暂无评论

A study on design of object sorting algorithms in the industrial application using hyperspectral imaging

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2006年第2期1卷 101-108页

作者： Paclik, Pavel Leitner, Raimund Duin, Robert P. W. Delft Univ Technol ICT Grp NL-2628 CD Delft Netherlands CTR AG A-9524 Villach Austria

Many industrial object-sorting applications leverage benefits of hyperspectral imaging technology. design of object sorting algorithms is a challenging pattern recognition problem due to its multi-level nature. Objects represented by sets of pixels/spectra in hyperspectral images are to be allocated into pre-specified sorting categories. Sorting categories are often defined in terms of lower-level concepts such as material or defect types. This paper illustrates the design of two-stage sorting algorithms, learning to discriminate individual pixels/spectra and fusing the per-pixel decisions into a single per-object outcome. The paper provides a case-study on algorithm design in a real-world industrial sorting problem. Four groups of algorithms are studied varying the level of prior knowledge about the sorting problem. Apart of the sorting accuracy, the algorithm execution speed is estimated assuming an ideal implementation. Relating these two performance criteria allows us to discuss the accuracy/speed trade-off of different algorithms.

关键词： Hyperspectral imaging Object sorting algorithm design Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：