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

A GIS-based framework using fuzzy relation equation system solutions in urban planning

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2022年第9期14卷 12159-12178页

作者： Cardone, Barbara Di Martino, Ferdinando Univ Napoli Federico II Dipartimento Architettura Via Toledo 402 I-80134 Naples Italy Univ Napoli Federico II Ctr Interdipartimentale Ric Calza Bini Via Toledo 402 I-80134 Naples Italy

Several fuzzy decision models are proposed in literature to solve urban planning problems. In this research we present a novel GIS-based framework to solve decision problems in urban planning based on a System of Fuzzy Relation Equations in which the unknowns represent characteristics affecting observable facts constituting the input variables. Aim of this research is to partition the urban study area into subzones, each of which identifies a sub-area of the study area within which the set of analyzed characteristics are homogeneous. The study area is initially decomposed in atomic urban areas called microzones;for each microzone are calculated the greatest and lowest solutions of a System of Fuzzy Relation Equations by using the universal solution algorithm and are calculated and fuzzified the values of the output variables. Spatially adjoining microzones with same output variables are dissolved forming homogeneous urban areas with reference to the problem analyzed, called Urban Contexts. For each output variable a thematic map is constructed;in addition, a thematic map of its reliability is created. This framework is tested on a study area given by the district of Ponticelli in the municipality of Naples (Italy);comparison tests performed with respect to a previous GIS-based framework based on a System of Fuzzy Relation Equations show that our method provides a more detailed knowledge of the characteristics of the urban study area with reference to the problem dealt with.

关键词： Fuzzy relation equation SFRE universal algorithm Urban context Reliability map

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Double Zero MVDR Beamformer That is universal Over the Number of Second Order Notches

引用

IEEE ACCESS 2024年 12卷 195575-195588页

作者： Erdim, Savas Buck, John R. Univ Massachusetts Dartmouth Dept Elect & Comp Engn Dartmouth MA 02740 USA

In a dynamic environment, close-range and fast-moving interferers transit the resolution cells rapidly, challenging the minimum variance distortionless response (MVDR) beamformer's ability to place accurate notches in each interferer's direction. One common approach to overcome this problem is to apply a broader or wider notch at the interferer location. The hybrid double zero (HDZ) MVDR beamformer is a simple and robust method to form a wider notch by implicitly generating second-order notches in the beampattern. The HDZ beampattern is a product of adaptive and fixed factors. The adaptive component has wide second-order notches to suppress moving interferers, while the fixed component improves the white noise gain (WNG) and ensures the array weight vector length matches the array size. However, the challenge for the HDZ beamformer is choosing the ideal number of second-order notches to suppress the moving interferers in a dynamic environment. In practice, the number of moving interferers is unknown and may also change over time. Therefore, an HDZ beamformer with a fixed number of second-order notches may not effectively suppress all the moving interferers if the number of interferers surpasses the number of second-order notches. The need for a time-varying number of second-order notches leads us to design a universal HDZ (UHDZ) beamformer that is universal over this parameter. The UHDZ beamformer rivals the best beamformer in a set of HDZ beamformers with a fixed number of second-order notches without needing prior knowledge of the number of moving interferers or the environment. This paper evaluates the performance of the UHDZ beamformer in simulations and microphone array experiments that include multiple moving interferers.

关键词： Vectors Sensor arrays Covariance matrices Array signal processing White noise Narrowband Spatial resolution Polynomials Direction-of-arrival estimation Attenuation Minimum variance distortionless response beamformer MVDR adaptive beamformer second-order notch multiple interferers moving interferer double zero MVDR beamformer array polynomial universal algorithm

来源：评论

学校读者我要写书评

暂无评论

Doubly Adaptive Covariance Matrix Taper universal Beamformer

Doubly Adaptive Covariance Matrix Taper Universal Beamformer

引用

OCEANS Hampton Roads Conference

作者： Erdim, Savas Buck, John R. Gravelle, Christopher Berg, C. J. Lacombe, Isaiah Univ Massachusetts ECE Dept Dartmouth MA 02747 USA

ISBN: (数字)9781665468091

ISBN: (纸本)9781665468091

In a dynamic environment, interferers moving with different bearing rates transit the resolution cells of an array at different speeds. This condition degrades the MVDR beamformer's performance due to the lag between the calculated notch location and interferer's actual location. One approach to overcome that challenge is applying a covariance matrix taper (CMT) that broadens the beampattern notches. The CMT widens MVDR beampattern notches by a fixed amount, and the optimal notch width depends on the unknown time-varying bearing rate of each interferer. Thus, a single fixed notch width cannot suppress all the interferers in the environment perfectly. The need for different notch widths for different bearing rates leads us to design a universal algorithm for this parameter. This universal algorithm rivals the best beamformer in a set of fixed notch width beamformers without requiring any prior knowledge of the interferer motion or the environment. This paper evaluates the performance of the universal CMT beamformer with microphone array data containing multiple moving interferers.

关键词： adaptive beamformer minimum variance distortionless response covariance matrix taper universal algorithm

来源：评论

学校读者我要写书评

暂无评论

Covariance Matrix Tapered Beamformer That Is universal Over Notch Width 56

Covariance Matrix Tapered Beamformer That Is Universal Over ...

引用

56th Asilomar Conference on Signals, Systems, and Computers

作者： Erdim, Savas Buck, John R. Berg, C. J. Univ Massachusetts ECE Dept Dartmouth MA 02747 USA

ISBN: (纸本)9781665459068

Moving interferers with different speeds create different bearing rates while crossing the resolution cells of a uniform linear array. The notches in MVDR's beampattern do not track moving interferers well. One approach to handle this problem is to make a broader and flatter notch by applying a Covariance Matrix Taper (CMT). The CMT increases the notch width by a fixed amount at each interferer location. In practice, the bearing rate of a moving interferer is unknown and may also change over time. Different bearing rates will require different notch widths and a single fixed CMT width will not be able to suppress all moving interferers perfectly. The need for different notch widths leads us to the possibility of designing a universal adaptive beamformer for the notch width. This paper processes data from a microphone array to demonstrate that the proposed universal CMT algorithm rivals the performance of the best fixed notch width CMT beamformer in a set.

关键词： adaptive beamformer minimum variance distortionless response covariance matrix taper universal algorithm moving interferer

来源：评论

学校读者我要写书评

暂无评论

universal Full-Speed Sensorless Control Scheme for Interior Permanent Magnet Synchronous Motors

引用

IEEE TRANSACTIONS ON POWER ELECTRONICS 2021年第4期36卷 4723-4737页

作者： Xiao, Dianxun Nalakath, Shamsuddeen Filho, Silvio Rotilli Fang, Gaoliang Dong, Alice Sun, Yingguang Wiseman, Jason Emadi, Ali McMaster Univ McMaster Automot Resource Ctr Hamilton ON L8P 0A6 Canada Enedym Inc Hamilton ON L8P 0A1 Canada BorgWarner Inc Waterloo Tech Ctr Kitchener ON N2G 4X8 Canada

This article presents a general-purpose full-speed sensorless control scheme for interior permanent magnet synchronous motors (IPMSMs). By applying a quadratic extended back electromotive force (QBEMF) model, the injection-based and model-based position estimations can be combined into a universal sensorless control strategy for the full-speed operation. At low speed, the QBEMF model acts as a self-demodulator that can extract position information from arbitrary high-frequency currents without using digital filters. Therefore, it is suitable for any type of injection signals and can eliminate the adverse effect of filters. When the injection is removed at high speed, the same QBEMF model can still be used for position estimation, thereby solving the conventional transition issue from low-speed to high-speed sensorless control. In consequence, a unified algorithm is designed to achieve arbitrary injection for low-speed sensorless control and seamless transition across full-speed region. The proposed scheme is hence simpler and more effective compared to conventional full-speed sensorless methods. Finally, the feasibility of the proposed estimation algorithm is verified for a 15-kW IPMSM drive.

关键词： Estimation Rotors Sensorless control Hafnium Permanent magnet motors Digital filters Load modeling Arbitrary injection interior permanent magnet synchronous motor (IPMSM) sensorless control parameter sensitivity universal algorithm

来源：评论

学校读者我要写书评

暂无评论

Pri-EMO:A universal perturbation method for privacy preserving facial emotion recognition

引用

Journal of Information and Intelligence 2023年第4期1卷 330-340页

作者： Yong Zeng Zhenyu Zhang Jiale Liu Jianfeng Ma Zhihong Liu School of Cyber Engineering Xidian UniversityXi'an 710071China

Facial emotion have great significance in human-computer interaction,virtual reality and people's *** methods for facial emotion privacy mainly concentrate on the perturbation of facial emotion ***,cryptography-based perturbation algorithms are highly computationally expensive,and transformation-based perturbation algorithms only target specific recognition *** this paper,we propose a universal feature vector-based privacy-preserving perturbation algorithm for facial *** method implements privacy-preserving facial emotion images on the feature space by computing tiny perturbations and adding them to the original *** addition,the proposed algorithm can also enable expression images to be recognized as specific *** show that the protection success rate of our method is above 95%and the image quality evaluation degrades no more than *** quantitative and qualitative results show that our proposed method has a balance between privacy and usability.

关键词： Facial emotion recognition Privacy preserving Perturbation universal algorithm Feature space

来源：评论

学校读者我要写书评

暂无评论

Type Size Code for Compressing Erdos-Renyi Graphs 55

Type Size Code for Compressing Erdos-Renyi Graphs

引用

55th Annual Conference on Information Sciences and Systems (CISS)

作者： Iri, Nematollah Apple Inc Cupertino CA 95014 USA

ISBN: (纸本)9781665412681

We consider universal source coding of unlabeled graphs which are commonly referred to as graphical structures. We adopt an Erdos-Renyi model to generate the random graphical structures. We propose a variant of the previously introduced Type Size code, where type classes are characterized based on the number of edges of the graphical structures. The proposed scheme sorts the graphical structures based on the size of their type classes and assigns binary sequences to them in this order. The epsilon-coding rate of the Type Size code (up to the third-order term) for compressing graphical structures is derived.

关键词： universal algorithm Fine asymptotics Graph compression Finite blocklength analysis

来源：评论

学校读者我要写书评

暂无评论

universal algorithm for Trading in Stock Market Based on the Method of Calibration

Universal Algorithm for Trading in Stock Market Based on the...

引用

24th International Conference on algorithmic Learning Theory (ALT)

作者： V'yugin, Vladimir Russian Acad Sci Inst Informat Transmiss Problems Moscow 127994 Russia Moscow Inst Phys & Technol Lab Struct Methods Data Anal Predict Modeling Moscow Russia

ISBN: (纸本)9783642409349;9783642409356

We present a universal method for algorithmic trading in Stock Market which performs asymptotically at least as well as any stationary trading strategy that computes the investment at each step using a continuous function of the side information. In the process of the game, a trader makes decisions using predictions computed by a randomized well-calibrated algorithm. We use Dawid's notion of calibration with more general checking rules and some modification of Kakade and Foster's randomized rounding algorithm for computing the well-calibrated forecasts. The method of randomized calibration is combined with Vovk's method of defensive forecasting in RKHS. Unlike in statistical theory, no stochastic assumptions are made about the stock prices.

关键词： universal algorithm Calibration prices

来源：评论

学校读者我要写书评

暂无评论

Ghost Suppression algorithm Based on TFDT Modeling

引用

电脑学刊 2021年第1期32卷 53-64页

作者： Guo-Liang Xu Hang Zhou Liang-You Yuan

In the background modeling, moving objects would often enter the scene. ＂Ghost＂ emerges as the pixels of interfering objects damage the background model. This paper presents a ＂ghost＂ suppression algorithm based on two - frame difference method and topology (TFDT). First in TFDT algorithm is to obtain the change mask with two-frame-difference method detecting the difference between two adjacent frames. Then according to the change mask, the complete object region and its bounding box are estimated with topo-logical structure. Finally, the pixels in the bounding box are eliminated, and the remaining pixels are added to the background model. TFDT is a universal algorithm for background modeling and can be adapted in foreground detection algorithms such as Codebook and ViBe. It can effectively remove object's pixels and build a background model for foreground detection algorithms. In this work, TFDT is used to improve Codebook and ViBe, and the ＂ghost＂ is absent from the result, which has been verfied in the CDnet database.

关键词： background modeling two-frame difference topological structure foreground detection universal algorithm

来源：评论

学校读者我要写书评

暂无评论

A universal ADJOINT-WEIGHTED algorithm FOR GEOMETRIC SENSITIVITY ANALYSIS OF K-EIGENVALUE BASED ON CONTINUOUS-ENERGY MONTE CARLO METHOD 26

引用

26th International Conference on Nuclear Engineering (ICONE-26)

作者： Li, Hao Yu, Ganglin Huang, Shanfang Wang, Kan Tsinghua Univ Dept Engn Phys Beijing 100084 Peoples R China

ISBN: (纸本)9780791851531

There exists a typical problem in Monte Carlo neutron transport: the effective multiplication factor sensitivity to geometric parameter. In several methods attempting to solve it, Monte Carlo adjoint-weighted theory has been proven to be quite effective. The major obstacle of adjoint-weighted theory is calculating derivative of cross section with respect to geometric parameter. In order to fix this problem, Heaviside step function and Dirac delta function are introduced to describe cross section and its derivative. This technique is crucial, and it establishes the foundation of further research. Based on above work, adjoint-weighted method is developed to solve geometric sensitivity. However, this method is limited to surfaces which are uniformly expanded or contracted with respect to its origin, such as vertical movement of plane or expansion of sphere. Rotation and translation are not allowed, while these two transformation types are more common and more important in engineering projects. In this paper, a more universal method, Cell Constraint Condition Perturbation (CCCP) method, is developed and validated. Different from traditional method, CCCP method for the first time explicitly articulates that the perturbed quantity is the parameter of spatial analytic geometry equations that used to describe surface. Thus, the CCCP can treat arbitrary one-parameter geometric perturbation of arbitrary surface as long as this surface can be described by spatial analytic geometry equation. Furthermore, CCCP can treat the perturbation of the whole cell, such as translation, rotation, expansion and constriction. Several examples are calculated to confirm the validity of CCCP method.

关键词： Geometric perturbation Sensitivity Adjoint universal algorithm Arbitrary geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：