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

IET Irish Signals and Systems Conference, ISSC 2010

作者： Schwarz, M.H. Cox, C.S. Börcsök, J. Department of Computer Architecture and System Programming Safety Computer Technology University of Kassel Kassel Germany Control Systems Centre University of Sunderland Sunderland United Kingdom Department of Computer Architecture and System Programming University of Kassel Kassel Germany

ISBN: (纸本)9781849192521

This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas exist. However, when it comes to designing a generalised predictive controller (GPC) four parameters have to be specified. To choose those parameters is not a trivial task since they are not directly related to control or regulation performance. The presented tuning method exploits model-parameters to select suitable controller parameters. Additionally, a Rhinehart filter is incorporated in the design to decrease the impact of noise, therefore, a fifth parameter has to be optimised. The proposed method has been tested in simulation and on a real system.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Satisfiability and validity problems in many-sorted composition-nominative pure predicate logics

Satisfiability and validity problems in many-sorted composit...

引用

8th International Conference on ICT in Education, Research, and Industrial Applications, ICTERI 2012

作者： Nikitchenko, Mykola S. Tymofieiev, Valentyn G. Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 64 Volodymyrska Street 01601 Kyiv Ukraine

ISBN: (纸本)9783642357367

We propose methods for solving the satisfiability and validity problems in many-sorted composition-nominative pure predicate logics (without functions and with equality). These logics are algebra-based logics of many-sorted partial predicates constructed in a semantic-syntactic style on the methodological basis that is common with programming;they can be considered as generalizations of traditional many-sorted logics on classes of partial predicates that do not have fixed arity. We show the reduction of the satisfiability problem to the same problem for many-sorted classical first-order pure predicate logic with equality. As validity is dual to satisfiability, the method proposed can be adopted to the validity problem. This enables us to use existent satisfiability and validity checking procedures developed for classical logic also for solving these problems in composition-nominative pure predicate logics with equality. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

A functional programming approach to the specification and verification of concurrent systems

引用

Formal Aspects of Computing 1989年第1期1卷 303-319页

作者： Dybjer, Peter Sander, Herbert P. Programming Methodology Group Department of Computer Sciences Chalmers University of Technology and University of Göteborg Göteborg S-412 96 Sweden

Networks of communicating processes can be viewed as networks of stream transformers and programmed in a lazy functional language. Thus the correctness of concurrent systems can be reduced to the correctness of functional programs. In this paper such correctness is proved formally in the μ-calculus extended with recursion equations for functional programs. The μ-calculus is chosen since it allows the definition of properties by least fixed points (induction) as well as by greatest fixed points (coinduction), and since greatest fixed points are useful for formalising properties, such as fairness, of infinitely proceeding programs. Moreover, non-deterministic processes are represented as incompletely specified deterministic processes, that is, as properties of stream transformers. This method is illustrated by proving the correctness of the alternating bit protocol. © 1989 BCS.

关键词： μ-calculus Alternating bit protocol Functional programming Greatest fixed point Kahn-networks Non-deterministic processes

来源：评论

学校读者我要写书评

暂无评论

Nested mixin-methods in Agora 7th

Nested mixin-methods in Agora

引用

7th European Conference on Object-Oriented programming, ECOOP 1993

作者： Steyaert, Patrick Codenie, Wim D’Hondt, Theo De Hondt, Koen Lucas, Carine Van Limberghen, Marc Programming Technology Lab Computer Science Department Vrije Universiteit Brussel Pieinlaan 2 BrusselsB-1050 Belgium

ISBN: (纸本)9783540571209

Mixin-based inheritance is an inheritance technique that has been shown to subsume a variety of different inheritance mechanisms. It is based directly upon an incremental modification model of inheritance. This paper addresses the question of how mixins can be seen as named attributes of classes the same way that objects, methods, and also classes in their own right, are seen as named attributes of classes. The general idea is to let a class itself have control over how it is extended. This results in a powerful abstraction mechanism to control the construction of inheritance hierarchies in two ways. Firstly, by being able to constrain the inheritance hierarchy;secondly, by being able to extend a class in a way that is specific for that class. Nested mixins are a direct consequence of having mixins as attributes. The scope rules for nested mixins are discussed, and shown to preserve the encapsulation of objects. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Satisfiability problems in quasiary program logics 8

Satisfiability problems in quasiary program logics

引用

8th International Conference Advanced Computer Information Technologies, ACIT 2018

作者： Nikitchenko, Mykola Shkilniak, Stepan Tymofieiev, Valentyn Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 60 Volodymyrska Street City of Kyiv01033 Ukraine

ISBN: (纸本)9789666544899

In the paper we present special program specification algebras and logics defined for classes of quasiary mappings. Informally speaking, such mappings are partial mappings defined over partial states (partial assignments) of variables. Conventional n-ary mappings can be considered as a special case of quasiary mappings. Such mappings better reflect properties of software systems. We describe methods of reducibility of the satisfiability problem in quasiary logics to the satisfiability problem in logics of n-ary mappings. The methods proposed can be useful for software verification. Copyright © 2018 for the individual papers by the papers'authors.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Coloring gray-scale image using artificial neural networks

Coloring gray-scale image using artificial neural networks

引用

2nd International Conference on Adaptive Science and technology, ICAST 2009

作者： Karlik, Bekir Sariöz, Mustafa Haliç University Department of Computer Engineering 34381 Istanbul Turkey Fatih University Computer Technology and Programming 34500 Istanbul Turkey

ISBN: (纸本)9781424435234

This paper presents a novel method on coloring the grayscale images. For this purpose, a combination of artificial neural networks and some image processing algorithms was developed to transfer colors from a user-selected source image to a target grayscale image. According to the results of this combining method, a survey where volunteers were asked to rate the plausibility of the colorings generated automatically was performed for individual images. In most cases automatically-colored images were rated either as totally or mostly acceptable. ©2009 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

AmbientTalk: Language support for mobile computing

AmbientTalk: Language support for mobile computing

引用

International Workshop on System Support for Future Mobile Computing Applications, FUMCA 2006

作者： Dedecker, Jessie Van Cutsem, Tom Mostinckx, Stijn De Meuter, Wolfgang D'Hondt, Theo Fund for Scientific Research Flanders Belgium Belgium Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

ISBN: (纸本)0769527299

An important aspect of system support for mobile computing involves alleviating the issues related to programming the underlying distributed system. Our approach to dealing with these issues is by means of programming language support. To this end, we have designed a high-level, distributed object-oriented programming language - called Ambient Talk - which has been designed specifically for mobile networks. We motivate the need for such dedicated language support based on the fundamental characteristics of mobile distributed systems. Subsequently, we describe the salient features of Ambient Talk with respect to distributed programming by means of an exemplar mobile computing application. © 2006 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Fuzzy k-competition graphs

Fuzzy k-competition graphs

引用

2013 Science and Information Conference, SAI 2013

作者： Pal, Madhumangal Samanta, Sovan Pal, Anita Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore-721102 India Department of Mathematics National Institute of Technology Durgapur 713209 India

ISBN: (纸本)9780989319300

Fuzzy competition graph as the generalization of competition graph is introduced here. A generalization of fuzzy competition graph known as fuzzy k-competition graph is also defined. These graphs are related to fuzzy digraphs. Fuzzy neighbourhood graphs, which are related to fuzzy graphs are defined here. Some relations between fuzzy competition graphs and fuzzy neighbourhood graphs have been established. Also several results to find strong edges of the stated graphs are obtained. © 2013 The Science and Information Organization.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Forecasting Global Monkeypox Infections Using LSTM: A Non-Stationary Time Series Analysis 3

Forecasting Global Monkeypox Infections Using LSTM: A Non-St...

引用

3rd IEEE International Conference on Electronic Engineering, ICEEM 2023

作者： Osama, Omnia M. Alakkari, Khder Abotaleb, Mostafa El-Kenawy, El-Sayed M. Delta Higher Institute of Engineering and Technology Department of Communications and Electronics Mansoura Egypt University of Tishreen Faculty of Economics Department of Statistics and Programming Tartous Syria South Ural State University Department of System Programming Chelyabinsk454080 Russia Delta Higher Institute Department of Communications Mansoura Egypt

ISBN: (纸本)9798350323511

This study leverages the capabilities of Long Short-Term Memory (LSTM) models in forecasting global Monkeypox infections, thereby demonstrating the significant potential of advanced machine learning techniques in epidemiological forecasting. Our LSTM model effectively navigates the challenges posed by non-stationary time-series data, a common issue in epidemiological studies. It successfully captures the underlying patterns in the data, producing reliable forecasts. The model's performance was evaluated using several metrics, including RMSE, MSE, MAE, and R2, all of which pointed to its robust and satisfactory predictive capabilities. Our findings underscore the significant role LSTM models can play in informing the development of timely and effective disease control and prevention strategies. They thereby contribute to enhancing public health responses to emerging infectious diseases such as Monkeypox. However, despite the promising results, the study highlights the ongoing challenge of enhancing the interpretability of LSTM models, an area that warrants further research. As a future direction, efforts should focus on refining LSTM models to bolster their interpretability, ensuring their broader adoption and utility in public health practice. © 2023 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Optimization of Ethylene Oligomerization Process Based on Genetic Algorithms

Optimization of Ethylene Oligomerization Process Based on Ge...

引用

2024 International Russian Automation Conference, RusAutoCon 2024

作者： Antipina, Evgenia Mustafina, Svetlana Antipin, Andrev Ufa University of Science and Technology Department of Scientific Research and Development Ufa Russia Ufa University of Science and Technology Department of Mathematical Modeling Ufa Russia Ufa University of Science and Technology Department of Applied Informatics and Programming Ufa Russia

The paper is devoted to the development of a genetic algorithm for finding the optimal values of control parameters of the ethylene oligomerization process. The formulation of the problem of optimal control of the ethylene oligomerization process is given. The control parameters are temperature and reaction duration, the values of which are subject to constraints. It is proposed to search for the solution of the formulated problems using a genetic algorithm with real coding. The principle of operation of genetic algorithms is based on the imitation of the processes of evolution of living nature. It includes cyclic application of selection, crossing, mutation and renewal operations to a population of individuals. For each of the problems under consideration the method of representation of the mathematical analog of the population, on the basis of which the solution is searched, is described. A step-by-step genetic algorithm for solving the formulated optimal control problems is given. A computational experiment is carried out, as a result of which the optimal reaction temperature and process duration, at which the target functional takes the largest value, are calculated. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：