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

Synthesis of a Radiating Elements for Side Lobe Reduction Using a Hybrid Beamforming Technique Based on non-linear programming and Stochastic Optimization

引用

TRAITEMENT DU SIGNAL 2022年第3期39卷 771-780页

作者： Brahimi, Mohamed Inc, Mustafa Ahmad, Hijaz Menni, Younes Lorenzini, Giulio Univ Ctr Salhi Ahmed Naama Ctr Univ Naama Dept Technol POB 66 Naama 45000 Algeria Biruni Univ Dept Comp Engn TR-34025 Istanbul Turkey Firat Univ Sci Fac Dept Math TR-23119 Elazig Turkey China Med Univ China Med Univ Hosp Dept Med Res Taichung 40402 Taiwan Int Telemat Univ Uninettuno Sect Math Corso Vittorio Emanuele II 39 I-00186 Rome Italy Univ Parma Dept Engn & Architecture Parco Area Sci 181-A I-43124 Parma Italy

In this article, an algorithm with global constraints known as hybrid non-linear programming with particle swarm enhancement is available for improving the circular antenna array (CAA) radiation characteristics. The suggested method combines the optimization of excitation currents with the array's element spacing to create the correct beam patterns. In this context, adaptive particle optimization (APSO) and basic particle swarm optimization (BPSO) algorithms are applied with the previous method to the (8,12,20) elements to tune the array's amplitude and positioning to achieve a radiation profile with reduced SLL. The simulated results show that the recommended strategy provides the greatest decrease in side lobe levels and directivity.

关键词： non-linear programming stochastic optimization mathematical modeling circular antenna elements side lobe level particle swarm enhancement

来源：评论

学校读者我要写书评

暂无评论

Bit-length optimization method for high-level synthesis based on non-linear programming technique

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年第12期E89A卷 3427-3434页

作者： Doi, Nobuhiro Horiyama, Takashi Nakanishi, Masaki Kimura, Shinji Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan Nara Inst Sci & Technol Grad Sch Informat Sci Ikoma 6300101 Japan

High-level synthesis is a novel method to generate a RT-level hardware description automatically from a high-level language such as C, and is used at recent digital circuit design. Floating-point to fixed-point conversion with bit-length optimization is one of the key issues for the area and speed optimization in high-level synthesis. However, the conversion task is a rather tedious work for designers. This paper,introduces automatic bit-length optimization method on floating-point to fixed-point conversion for high-level synthesis. The method estimates computational errors statistically, and formalizes an optimization problem as a non-linear problem. The application of NLP technique improves the balancing between computational accuracy and total hardware cost. Various constraints such as unit sharing, maximum bit-length of function units can be modeled easily, too. Experimental result shows that our method is fast compared with typical one, and reduces the hardware area.

关键词： HDL high-level synthesis bit-length optimization non-linear programming

来源：评论

学校读者我要写书评

暂无评论

A non-linear programming MODEL TO SOLVE MADM PROBLEMS WITH INTERVAL-VALUED INTUITIONISTIC FUZZY NUMBERS

引用

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE 2023年第3期30卷 750-762页

作者： Arshi, Maryam Hadi-Vencheh, Abdollah Nazari, Mojtaba Jamshidi, Ali Islamic Azad Univ Khorramabad Branch Dept Math Khorramabad Iran Islamic Azad Univ Isfahan Khorasgan Branch Dept Math Esfahan Iran

It is believed that Multi Attribute Decision Making (MADM) problem is an ill-defined and unstructured problem. This difficulty intensifies while considering the uncertainty of decision-makers information about the problem. In recent years, interval-valued intuitionistic fuzzy sets (hereafter IVIFs), as a generalization of ordinal fuzzy sets, became a well-known and widely applied framework for dealing with the uncertainty of decision-making problems. However, the mathematical programming aspects of IVIFs, besides their applications in decision-making problems, were ignored. To reinforce the mathematical programming approach in the IVIF environment, an IVIF-MADM problem is formulated as a non-linear programming model. Using a variable transformation and the notion of aggregation operator, the proposed model is transformed into an equivalent non-linear programming model. Application of the proposed method is represented in a decision-making problem, and the results are compared with similar methods, proving the compatibility of the proposed method with previous ones. The solid and understandable logic with computational easiness are the main advantages of the proposed method.

关键词： Multiple Attribute Group Decision-Making (MADM) Interval-Valued Intuitionistic Fuzzy Sets (IVIFS) non-linear programming Aggregation Operator

来源：评论

学校读者我要写书评

暂无评论

The use of non-linear programming in matrix analytic methods

引用

Communications in Statistics. Stochastic Models 1998年第1-2期14卷 351-367页

作者： Attahiru Sule Alfa[a] Bhaskar Sengupta[b] Tetsuya Takine[c] [a] Department of Mechanical and Industrial Engineering University of Manitoba Winnipeg Manitoba Canada [b] C'C Research Labs NEC USA Inc Princeton U.S.A [c] Department of Information Systems Engineering Faculty of Engineering Osaka University Suita Osaka Japan

In this paper, we present new methods for finding the R and G matrices which play a crucial role in determining the steady-state distribution of Markov chains of the GI/M/1 and M/G/l type respectively. The methods involve finding solutions to some non-linear programming problems. We obtain the Karush-Kuhn-Tucker (KKT) conditions for two of the non-linear programming problems and, for the M/G/l case, show that there is a simple relationship between the dual variables and the G matrix. We present two algorithms for solving the non-linear programming problems. We have also carried out numerical investigations for the M/G/l problem and found that one of the algorithms often performs much better than what we call the “standard method” of solution

关键词： non-linear programming matrix equations queueing theory

来源：评论

学校读者我要写书评

暂无评论

A non-linear programming Model for Funds Allocation in Software Development Projects

A Non-Linear Programming Model for Funds Allocation in Softw...

引用

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Ning Wang Lu Wang Nannan Yang Economics and Management School Beijing University of Posts and Telecommunications Beijing China The College of Economics and Management Beijing University of Technology Beijing China Business school Beijing Institute of Fashion Technology Beijing China

In order to effectively avoid risks that might result in loss of failure in software development process, based on the experiences of software development and project management, this paper identifies 4 potential risk factors specific to software development projects which are integrated with 6 stages in software development process, and proposes a non-linear programming model to optimize funds allocation to reduce the risks. The paper provides an example to validate the effectiveness of the model.

关键词： software project development risk factors funds allocation non-linear programming K-T Condition

来源：评论

学校读者我要写书评

暂无评论

A non-linear programming approach to maintenance budgeting for multi-component systems

A non-linear programming approach to maintenance budgeting f...

引用

IEEE Power and Energy Society General Meeting

作者： R. S. Ferreira L. A. Barroso C. D. Feinstein C. L. T. Borges PSR Rio de Janeiro RJ Brazil Santa Clara University Santa Clara CA USA UFRJ/COPPE Rio de Janeiro RJ Brazil

ISBN: (纸本)9781479913022

Maintenance budgeting refers to optimally allocating monetary resources so as to minimize the sum of (deterministic) preventive maintenance and (stochastic) corrective maintenance and unavailability costs. We propose a non-linear programming formulation for this problem, for a complex, multi-component system. Results of a case study for a combined cycle thermal power plant indicate the applicability of the proposed approach.

关键词： Maintenance budgeting reliability Markov process non-linear programming nonlinear programming Markov chain Structural Elements (Construction) Budgets Problem Formulation

来源：评论

学校读者我要写书评

暂无评论

Automatic Hardware Pragma Insertion in High-Level Synthesis: A non-linear programming Approach 24

Automatic Hardware Pragma Insertion in High-Level Synthesis:...

引用

Proceedings of the 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays

作者： Stéphane Pouget Louis-Noël Pouchet Jason Cong University of California Los Angeles Los Angeles CA USA Colorado State University Fort Collins CO USA

ISBN: (纸本)9798400704185

High-Level Synthesis enables the rapid prototyping of hardware accelerators, by combining a high-level description of the functional behavior of a kernel with a set of micro-architecture optimizations as inputs. Such pragmas may describe the pipelining and replication of units, or even higher-level transformations for HLS such as automatic data caching using the AMD/Xilinx Merlin compiler. Selecting the best combination of pragmas, even within a restricted set, remains particularly challenging and the typical state-of-practice uses design-space exploration to navigate this space. But due to the highly irregular performance distribution of pragma configurations, typical DSE approaches are either extremely time consuming, or operating on a severely restricted search space. In this work we propose a framework to automatically insert HLS pragmas in regular loop-based programs, supporting pipelining, unit replication (coarse- and fine-grain), and data caching. We develop a simple analytical performance and resource model as a function of the input program properties and pragmas inserted. We prove this model provides a lower bound on the actual performance for any possible configuration. We then encode this model as a non-linear Program, by making the pragma configuration as unknowns of the system, which is computed optimally by solving this NLP. This approach can also be used during DSE, to quickly prune points with a (possibly partial) pragma configuration, employing this latency lower bound property. We extensively evaluate our end-to-end fully implemented system, showing it can effectively manipulate spaces of billions of designs in seconds to minutes for the kernels evaluated.

关键词： fpga hls non-linear programming program optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal location of landfills and transfer stations for municipal solid waste in developing countries using non-linear programming

引用

SUSTAINABLE FUTURES 2021年 3卷

作者： Monzambe, Giovani M. Mpofu, Khumbulani Daniyan, Ilesanmi A. Tshwane Univ Technol Dept Ind Engn 01 Staatsartillerie Rd ZA-0183 Pretoria South Africa

The design of Municipal Solid Waste Management Systems (MSWMS) is one of the fields where optimization techniques have been used in different places. The aim of this study was to develop a mathematical model for the optimization of MSW Transportation System, in order to assist waste management institutions, and local governments to minimise waste transportation time and cost. non-linear Mixed Integer mathematical model, with the objective function to minimize the time and cost of waste transportation, was developed and solved using Microsoft Excel solver. The developed model was applied to a case study city situated in South Africa. The application of this model to this case study has provided an approximate decrease in total transportation cost per week of 2.04%. The novelty of this research lies in the simplification of the existing mathematical model and the development of a new approach to solve the non-linear model.

关键词： Mathematical programming non-linear programming Binary optimization Waste management system

来源：评论

学校读者我要写书评

暂无评论

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

引用

Numerical linear Algebra with Applications 1999年第3期5卷

作者： Ladislav Lukšan Jan Vlček Institute of Computer Science Academy of Sciences of the Czech Republic Pod vodárenskou věží 2 182 07 Prague 8 Czech Republic

An inexact Newton algorithm for large sparse equality constrained non-linear programming problems is proposed. This algorithm is based on an indefinitely preconditioned smoothed conjugate gradient method applied to the linear KKT system and uses a simple augmented Lagrangian merit function for Armijo type stepsize selection. Most attention is devoted to the termination of the CG method, guaranteeing sufficient descent in every iteration and decreasing the number of required CG iterations, and especially, to the choice of a suitable preconditioner. We investigate four preconditioners, which have 2 × 2 block structure, and prove theoretically their good properties. The efficiency of the inexact Newton algorithm, together with a comparison of various preconditioners and strategies, is demonstrated by using a large collection of test problems. © 1998 John Wiley & Sons, Ltd.

关键词： non-linear programming sparse problems equality constraints inexact Newton method augmented Lagrangian function indefinite systems indefinite preconditioners conjugate gradient method residual smoothing

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for solving the Weber location problem

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2025年第1期23卷 53-63页

作者： Drezner, Zvi Calif State Univ Fullerton Coll Business & Econ Fullerton CA 92834 USA

In this note we propose an improved algorithm for the solution of the Weber problem which is the most fundamental problem in location analysis. It is used as a building block in many algorithms for solving more complicated location problems. The algorithm is very simple to implement and the idea behind it can inspire solution approaches to other optimization problems as well. Computational experiments demonstrated the superior performance of the proposed algorithm. Such an improvement will assist in the solution of more complicated models that apply the solution to Weber problem repeatedly many times as part of their solution algorithms.

关键词： Location analysis Weber problem Solution algorithm non-linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：