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

international conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Méziane Aïder Oussama Gacem Mhand Hifi LaROMaD USTHB BP 32 El Alia Alger Algérie EPROAD UPJV 7 rue du Moulin Neuf Amiens France

ISBN: (数字)9781728175591

ISBN: (纸本)9781728175607

In this paper, we propose a two-stage method for solving the Bi-Objective Quadratic Multiple Knapsack Problem (BO-QMKP). the method combines both a special local branching (the first stage) and the ε-constraint (the second stage) strategies, where the local branching tries to intensify the search process while a series of ε-constraints are added to tailor a diversification of the search space. the method is based on solving a series of mono-objective optimization problems: from the current problem, provided by combining the original problem and an ε-constraint (using a single objective function), an optimization phase is applied in order to generate a set of non-dominated solutions. A preliminary experimental part is given, where the performance of the proposed two-stage method is evaluated on a set of benchmark containing large-scale instances. Its provided results are compared to those achieved by one of the best method available in the literature. Encouraging results have been obtained.

关键词： Optimization Search problems Linear programming Benchmark testing MONOS devices Convergence Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Symbolic linear Mathematica based technique for piecewise linear circuits

Symbolic linear Mathematica based technique for piecewise li...

引用

IEEE international conference on Electronics, Circuits and Systems (ICECS)

作者： F. Filippetti M. Artioli Dipartimento di Ingegneria Elettrica Università degli Studi di Bologna Bologna Italy

ISBN: (纸本)0780365429

this paper is intended to show an approach to directly translate linear methods to PWL circuit problems. the basic idea is to hide the non-linearity from the linear method, so that the user can handle the PWL problem as if it was a linear one. So doing writing equations for a PWL circuit can be extremely simple and fast, since the PWL formulation becomes a linear formulation. Moreover, since it is possible to use usual linear solvers the solution is improved as well. this approach is based first on symbolic formulation and calculations, then on rules application, which deliver to the symbolic processor the task to deal with the PWL aspects of the problem. A Mathematica procedure dedicated to this aim is suggested, together with a practical example where a four-diode rectifier is handled as a linear circuit.

关键词： Piecewise linear techniques Rectifiers Linear circuits Linearity Writing Nonlinear equations Linear programming H infinity control Pathology Linear systems

来源：评论

学校读者我要写书评

暂无评论

Temporal Logic-driven Symbolic Execution with the Clang Static Analyzer

Temporal Logic-driven Symbolic Execution with the Clang Stat...

引用

Software and System Engineering (ICoSSE), international conference on

作者： Endre Fülöp Norbert Pataki Department of Programming Languages and Compilers Eötvös Loránd University Budapest Hungary

ISBN: (数字)9798350386592

ISBN: (纸本)9798350386608

Symbolic execution is a way of modelling the program state without executing it. It can be used to reason about the behaviour of the program statically. One of the use cases for using symbolic execution is finding software bugs. Clang Static Analyzer can perform static analysis using symbolic execution, and the specific problems to detect are described in imperative $\mathrm{C}++$ code. One of the alternative ways of describing software bugs is linear temporal logic. this approach leads to a declarative description of the problem and allows for a higher level of abstraction. We present a mapping between the declarative temporal logic approach and the imperative Clang Static Analyzer implementation, highlighting the semantic equivalences of temporal logical formulas and $\mathrm{C}++$ programs explicitly focusing on finding bugs statically. We briefly show the implementation details of our extension and present how to use temporal logic for symbolic execution in a powerful manner.

关键词： Codes Computer bugs Semantics Focusing Static analysis Systems engineering and theory Software

来源：评论

学校读者我要写书评

暂无评论

Direct Look-Up Table Method for Field-Weakening Control of Permanent Magnet Synchronous Motor Based on Operation Conditions

Direct Look-Up Table Method for Field-Weakening Control of P...

引用

China international Electrical and Energy conference (CIEEC)

作者： Linzhi Wang Yong Yu Qinghua Dong Dianguo Xu School of Electrical Engineering and Automation Harbin Institute of Technology Harbin China

ISBN: (数字)9798350359558

ISBN: (纸本)9798350359565

To operate a permanent magnet synchronous motor (PMSM) in the field-weakening region, the voltage closed loop is the most common method with strong robustness and stability. However, the coefficients tuning of the additional PI regulator is a complex work because of no suitable theory. Also, it stills lead to instability if the coefficients are not appropriate. To solve it, a direct look-up table method is proposed for PMSM field-weakening control without using additional PI regulator. through the relation of speed, torque and $\boldsymbol{d}-\mathbf{axis}$ current, a look-up table is designed to generate the required $\boldsymbol{d}-\mathbf{axis}$ current reference, which can be adjusted dynamically according to different operation conditions. Compared to the traditional one, the proposed method has better current rapidity and stability to some extent, which is verified through experiments.

关键词： Torque Regulators Costs programming Permanent magnet motors Robustness Table lookup

来源：评论

学校读者我要写书评

暂无评论

Optimal Operation of Adjustable Load via Intelligent Energy Terminals for Renewable Energy Consumption

Optimal Operation of Adjustable Load via Intelligent Energy ...

引用

IEEE conference on Energy Internet and Energy System Integration (EI2)

作者： Bowen Zheng Mingming Pan Yunfei Bo Chang Liu Xu Xu Chu Wen Xuchen Wang Yongjun Li Shiming Tian China Electric Power Research Institute Co. Ltd. Beijing China Xi'an Jiaotong-Liverpool University Suzhou China China International Engineering Consulting Corporation Co. Ltd Beijing China

Traditional power load management terminals lack precision and flexibility in controlling customer power loads, hindering efficient energy use. Developing intelligent energy terminals is essential to meet national demand-side management standards and enhance energy efficiency. this paper designs a functional architecture of intelligent energy terminals on the customer side and constructs a flexible regulation strategy set of customer-side diversified demand-side resources for the local power grid supply and demand balance as well as renewable energy consumption goals. It also explores collaborative optimization strategies for efficient energy utilization and distributed power consumption. the proposed control strategies for customer-side intelligent energy terminals enable precise regulation of diverse resources. this supports government oversight and empowers power grid companies and demand response agencies to provide high-quality services, contributing to low-carbon and efficient energy utilization while ensuring load control in compliance with safety standards.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Whole-program optimization for time and space efficient threads

引用

Computer architecture news 1996年第Special Issu期24卷 50-59页

作者： Grunwald, D. Neves, R. Univ of Colorado Boulder CO United States

Modern languages and operating systems often encourage programmers to use threads, or independent control streams, to mask the overhead of some operations and simplify program structure. Multitasking operating systems use threads to mask communication latency, either with hardwares devices or users. Client-server applications typically use threads to simplify the complex control-flow that arises when multiple clients are used. Recently, the scientific computing community has started using threads to mask network communication latency in massively parallel architectures, allowing computation and communication to be overlapped. Lastly, some architectures implement threads in hardware, using those threads to tolerate memory latency. In general, it would be desirable if threaded programs could be written to expose the largest degree of parallelism possible, or to simplify the program design. However, threads incur time and space overheads, and programmers often compromise simple designs for performance. In this paper, we show how to reduce time and space thread overhead using control flow and register liveness information inferred after compilation. Our techniques work on binaries, are not specific to a particular compiler or thread library and reduce the overall execution time of fine-grain threaded programs by ≈15-30%. We use execution-driven analysis and an instrumented operating system to show why the execution time is reduced and to indicate areas for future work.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Practice of Virtual Reality Technology in Electric Emergency Repair Practice

Analysis on the Practice of Virtual Reality Technology in El...

引用

2018 7th international conference on Advanced Materials and Computer Science(ICAMCS 2018)

作者： Huang Chengyun Guo Jianlong Xiong Shan Hao Tengfei

China has a vast territory and a wide distribution network,which has many factors affecting the stability and safety of the distribution *** recent years,China’s emphasis on the quality of distribution network operation has been continuously improved,and research on power emergency management has been strengthened,and emergency work systems such as emergency organization and emergency materials reserve have been *** paper analyzes the technical architecture of power emergency simulation system and the functional architecture and design of power emergency simulation system,and studies the practice of virtual reality technology in power emergency repair drill.

关键词： Virtual reality technology electric power emergency repair drill practice

来源：评论

学校读者我要写书评

暂无评论

Structure and performance of interpreters

引用

Computer architecture news 1996年第Special Issu期24卷 150-159页

作者： Romer, T.H. Lee, D. Voelker, G.M. Wolman, A. Wong, W.A. Baer, J.-L. Bershad, B.N. Levy, H.M. Univ of Washington Seattle WA United States

Interpreted languages have become increasingly popular due to demands for rapid program development, ease of use, portability, and safety. Beyond the general impression that they are ″slow″, however, little has been documented about the performance of interpreters as a class of applications. this paper examines interpreter performance by measuring and analyzing interpreters from both software and hardware perspectives. As examples, we measure the MIPSI, Java, Perl, and Tcl interpreters running as array of micro and macro benchmarks on a DEC Alpha platform. Our measurements of these interpreters relate performance to the complexity of the interpreter's virtual machine and demonstrate that native runtime libraries can play a key role in providing good performance. From an architecture perspective, we show that interpreter performance is primarily a function of the interpreter itself and is relatively independent of the application being interpreted. We also demonstrate that high-level interpreters' demands on processor resources are comparable to those of other complex compiled programs, such as gcc. We conclude that interpreters, as a class of applications, do not currently motivate special hardware support for increased performance.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Cluster Analysis of mobile communication network station location 22

Cluster Analysis of mobile communication network station loc...

引用

Proceedings of the 7th international conference on Intelligent Information Processing

作者： Nian Min Xiang Zhengheng Jin Lu Wuhan Business University China

ISBN: (纸本)9781450396714

Nowadays mobile communication technology develops rapidly, the demand for mobile communication network is getting higher and higher. In recent years, China's communication networks have become more and more complex, with more and more broadband, but the coverage of base stations has become smaller and smaller. thus, the process of China's mobile communication network is affected. the location of communication base station is the first and important step of base station construction. Because it can not only ensure the smooth progress of the construction process, but also ensure the safety of the construction. Considering the coverage of the base station and the actual capital situation, in order to make the coverage as large as possible, how should the base station location be chosen becomes very important. Because there are so many different types of base stations and antennas, the choice of site becomes more complicated. this paper mainly uses the 0-1 knapsack dynamic programming model and simulated annealing algorithm to analyze the best location problem of the base station and summarize.

关键词： 0-1 Knapsack dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Specification and proof in membership equational logic 7th

引用

7th international Joint conference on theory and Practice of Software Development, TAPSOFT 1997

作者： Bouhoula, Adel Jouannaud, Jean-Pierre Meseguer, Josè SRI International Computer Science Laboratory 333 Ravenswood Avenue Menlo ParkCA94025 United States INRIA Lorraine and CRIN 615 rue du Jardin Botanique B.P. 101 Villers-lès-Nancy Cedex54602 France LRI CNRS and Universitè de Paris-Sud BAt 405 Orsay Cedex91405 France

ISBN: (纸本)9783540627814

this paper is part of a long-term effort to increase expressiv eness of algebraic specification languages while at the same time having a simple semantic basis on which efficient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, wherethey have been efficiently implemented. Membership equational logic is quite simple, and yet quite powerful. Its atomic formulae are equations and sort membership assertions, and its sentences are Horn clauses. It extends in a conservative way both ordersorted equational logic and partial algebra approaches, while Horn logic can be very easily encoded. After introducing the basic concepts of the logic, we give conditions and proof rules with which efficient equational deduction by rewriting can be achieved. We also give completion techniques to transform a specification into one meeting these conditions. We address the important issue of proving sufficient completeness of a specification. Using tree-automata techniques, we develop a test set based approach for proving inductive theorems about a specification. Narrowing and proof techniques for parameterized specifications are investigated as well. Finally, we discuss the generality of our approach and how it extends several previous approaches. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：