5,901 results
Search Results
2. Paper-based flexible metamaterial for microwave applications
- Author
-
Runhua Fan, Yao Liu, Yaman Zhao, Zidong Zhang, Jiurong Liu, Wenjin Zhang, and Guohua Fan
- Subjects
Fabrication ,microwave ,Computer science ,Physics::Optics ,02 engineering and technology ,metamaterial ,010402 general chemistry ,01 natural sciences ,Microwave applications ,Negative refraction ,Electromagnetism ,General Materials Science ,paper ,Cloak ,Metamaterial ,Paper based ,Physics::Classical Physics ,021001 nanoscience & nanotechnology ,Condensed Matter Physics ,Engineering physics ,lcsh:QC1-999 ,0104 chemical sciences ,metasurface ,Mechanics of Materials ,lcsh:Electrical engineering. Electronics. Nuclear engineering ,flexible ,0210 nano-technology ,lcsh:TK1-9971 ,lcsh:Physics ,Microwave - Abstract
Metamaterial has become a hotspot in many research fields, including electromagnetism, thermodynamics and mechanics, as it can offers additional design freedom for material to obtain novel properties. Especially for the electromagnetic devices, various interesting electromagnetic properties which cannot be found in nature materials can be realized, such as negative refraction, invisible cloak, etc. Herein, we provide an overview of paper-based metamaterial for microwave application. This work reviews the metamaterial realized on paper substrate, including the fabrication techniques, application fields, as well as the outlook on future directions of the paper-based metamaterial for the readership.
- Published
- 2021
3. Optimal paper web weight control system based on the Pontryagin’s maximum principle
- Author
-
Natalia Lysova and Nina V. Myasnikova
- Subjects
lcsh:GE1-350 ,Computer science ,0211 other engineering and technologies ,System identification ,Computational intelligence ,02 engineering and technology ,010501 environmental sciences ,Nonlinear control ,Optimal control ,01 natural sciences ,Industrial engineering ,Nonlinear system ,Maximum principle ,Control system ,021108 energy ,Adaptive learning ,lcsh:Environmental sciences ,0105 earth and related environmental sciences - Abstract
The paper describes the stages of paper production, considers the structure of a paper-making machine. Questions related to the proof and use of the Pontryagin’s maximum principle in the theory of optimal control are considered. Optimal paper web weight control system based on the Pontryagin’s maximum principle is presented. Adaptive learning methods for modeling nonlinear systems represent some of the latest advances in adaptive algorithms and machine learning techniques designed to model and identify nonlinear systems. Real-world problems always involve a certain degree of non-linearity, which makes linear models a suboptimal choice. This article may be of interest to research engineers and practitioners in the study and application of control systems using adaptive regulators. This book serves as an essential resource for researchers, graduate students and doctoral students working in the field of machine learning, signal processing, adaptive filtering, nonlinear control, system identification, cooperative systems, and computational intelligence. This book may also be of interest to the industry market and practitioners working with a wide range of nonlinear systems.
- Published
- 2021
4. Application of artificial neural network for design: a case of paper helicopter
- Author
-
Tanaporn Klangpetch and Tossapol Kiatcharoenpol
- Subjects
Artificial neural network ,business.industry ,Computer science ,lcsh:TA1-2040 ,Artificial intelligence ,business ,lcsh:Engineering (General). Civil engineering (General) - Abstract
The design engineering is one of essential work in modern manufacturing environment. The optimization is principal technique to be used widely for searching the solution. However, primary process of optimization is to know the relation between design input parameters and target output. In this work, an artificial neural network (ANN) approach as an intelligent algorithm is proposed to construct the relation and also provides it in form of mathematic modeling. Even though the ANN modeling is so call a backblock due to difficulty to understand complicated equations, it is simply constructed by automate iteration process. A case of paper helicopter is used as an example of the application. The classical 2k Factorial design is used to provide an experiment plan to create training and testing data. 93 experiments are carried out. The architecture of ANN is set according to lowest Mean square error (MSE) of training and testing procedure. The result of 5-10-1 architecture has shown ability to accurately predict output, landing time, with MSE of 0.012. With such a highly quantitative accuracy of results, the developed model using the neural network approach can be used for finding the suitable input parameters to achieve a desired target output. In this case, the design of dimension (A) Depth of cut wing is 1.3 cm., (B) Length of wing is 12.9 cm., (C) Length of body is 9.0, (D) Width of body is 2.0 cm., and (E) Depth of cut body is 0 cm. yield the lowest area of a paper helicopter that can meet the target landing time, 2.85 + 5% second.
- Published
- 2018
5. Based on PCI Software Day Draw Satellite is Projective Like Making Technology Discussed in This Paper
- Author
-
Rui Wang, Ming Zhao, Yongming Xu, and Xiaochun Xu
- Subjects
Software ,Computer science ,business.industry ,lcsh:TA1-2040 ,Conventional PCI ,Satellite ,Projective test ,business ,lcsh:Engineering (General). Civil engineering (General) ,Computer hardware - Abstract
This article introduces the use of PCI software production day draw satellite is projective like production process, analyzes the key technologies in the production, summarizes the Suggestions to improve the quality of results, strengthen quality control method is proposed, for the day draw satellite orthogonal projection as mass production work has carried on the beneficial exploration.
- Published
- 2018
6. Peculiarities of teaching translation of scientific and technical papers to engineering students
- Author
-
Nikolay Kachalov, R.M. Fedorenko, and Dmitry L. Matukihn
- Subjects
Point (typography) ,Computer science ,научно-технические тексты ,Interpretation (philosophy) ,Teaching method ,обучение ,0211 other engineering and technologies ,Library science ,Technical translation ,студенты ,02 engineering and technology ,Indirect translation ,Translation (geometry) ,Linguistics ,Professional activity ,технические университеты ,020303 mechanical engineering & transports ,0203 mechanical engineering ,lcsh:TA1-2040 ,021105 building & construction ,переводы ,lcsh:Engineering (General). Civil engineering (General) ,технические переводы - Abstract
The article deals with the issues and methods of teaching translation and interpretation of scientific and technical papers to engineering students from a linguistic point of view. The authors describe the concept and special features of technical translation as a professional activity compared to different kinds of translation. The paper analyzes stylistic, lexical and phraseological, and grammatical peculiarities of scientific and technical papers. Moreover, the authors suggest the main techniques of translating scientific and technical papers such as direct and indirect translation methods.
- Published
- 2017
7. Summary of papers on technology
- Author
-
Burkhard Plaum
- Subjects
Computer science ,Physics ,QC1-999 ,Library science - Abstract
The contributions on technology are summarized.
- Published
- 2017
8. The Journal of Space Weather and Space Climate – the first six years: status and evaluation of published papers and policies
- Author
-
Jan Janssens, Agnès Henri, Jurgen Watermann, Anna Belehaki, Jean Lilensten, Institut de Planétologie et d'Astrophysique de Grenoble (IPAG), Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Observatoire des Sciences de l'Univers de Grenoble (OSUG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut national des sciences de l'Univers (INSU - CNRS)-Institut national de recherche en sciences et technologies pour l'environnement et l'agriculture (IRSTEA)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut national de recherche en sciences et technologies pour l'environnement et l'agriculture (IRSTEA)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), National Observatory of Athens (NOA), LE STUDIUM (LE STUDIUM), Bureau de Recherches Géologiques et Minières (BRGM) (BRGM)-Centre national du machinisme agricole, du génie rural, des eaux et forêts (CEMAGREF)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de recherche pour le développement [IRD] : UR-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Solar-Terrestrial Centre of Excellence [Brussels] (STCE), EDP SCiences, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de recherche pour le développement [IRD] : UR-Centre National de la Recherche Scientifique (CNRS), and Sciences, EDP
- Subjects
Atmospheric Science ,010504 meteorology & atmospheric sciences ,Meteorology ,Computer science ,lcsh:QC851-999 ,Space weather ,Space (commercial competition) ,01 natural sciences ,Physics::Geophysics ,Space and Planetary Science ,Physics::Space Physics ,0103 physical sciences ,Astrophysics::Solar and Stellar Astrophysics ,lcsh:Meteorology. Climatology ,Astrophysics::Earth and Planetary Astrophysics ,[PHYS.ASTR] Physics [physics]/Astrophysics [astro-ph] ,[PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph] ,010303 astronomy & astrophysics ,ComputingMilieux_MISCELLANEOUS ,Physics::Atmospheric and Oceanic Physics ,0105 earth and related environmental sciences - Abstract
International audience; No abstract available
- Published
- 2017
9. Summary of papers presented in the Theory and Modelling session
- Author
-
E. Westerhof and Y.R. Lin-Liu
- Subjects
Edge density ,Computer science ,business.industry ,Physics::Plasma Physics ,Physics ,QC1-999 ,Nonlinear physics ,Electrical engineering ,Session (computer science) ,Aerospace engineering ,business ,Parametric statistics - Abstract
A total of 14 contributions were presented in the Theory and Modelling sessions at EC-17. One Theory and Modelling paper was included in the ITER ECRH and ECE sessions each. Three papers were in the area of nonlinear physics discussing parametric processes accompanying ECRH. Eight papers were based on the quasi-linear theory of wave heating and current drive. Three of these addressed the application of ECCD for NTM stabilization. Two papers considered scattering of EC waves by edge density fluctuations and related phenomena. In this summary, we briefly describe the highlights of these contributions. Finally, the three papers concerning modelling of various aspects of ECE are reported in the ECE session.
- Published
- 2012
10. Review paper Image Algebra for Electron Images
- Author
-
Peter Hawkes
- Subjects
Image coding ,business.industry ,Computer science ,Image algebra ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Image processing ,Electron ,Lingua franca ,Algebra ,Optics ,Electron optics ,Algebra over a field ,business ,Instrumentation ,computer ,computer.programming_language - Abstract
An ever-increasing proportion of the algorithms employed in image processing are being translated into the language of image algebra. The aspects of this algebra of particular interest in electron optics are presented and the advantages of adopting it as a lingua franca are described.
- Published
- 1995
11. Skid adjuster for humps
- Author
-
Alexey Demyanov, Alexander Rybak, and Alexander Demyanov
- Subjects
lcsh:GE1-350 ,Mean time between failures ,Computer science ,02 engineering and technology ,Paper based ,021001 nanoscience & nanotechnology ,Durability ,Automotive engineering ,Marshalling ,Braking distance ,020303 mechanical engineering & transports ,0203 mechanical engineering ,Skid (automobile) ,Service life ,Brake ,0210 nano-technology ,lcsh:Environmental sciences - Abstract
The paper based on the analysis of the working conditions of railway transport shows that, ceteris paribus, an increase in actual durability and mean time before failure of rolling stock units is obtained through maintenance of wheelsets, especially during logistic processes on nonmechanized humps. One of the main causes for the service life decrease of wheelsets is brake damage. To eliminate such brake damage on highways, on-board braking dis-tance regulators mounted on the locomotive are used. In the hump yards, using such systems is not possible, since under marshalling, cars are detached from the locomotive. In this regard, an industrial challenge turns up to design a similar in purpose braking distance regulator for humps through skidding. To solve this problem, we developed a method of controlling the speed of cars to be sorted, which complements the widely used technology of the shoe braking and avoids the formation of one-way sliders. The paper presents a skid adjuster, which excludes brake damage to the rolling stock wheels by the slides on the humps using the shoe braking techniques. The motion equation of the rolling stock equipped with a skid adjuster on the hump tracks is developed. In the result of this study, an equation of car motion in the system of “rolling stock Hughes regulator way” allowing to enter the working elements of Hughes controller to an existing and debugged algorithm of any slides with minimal change it.
- Published
- 2019
12. Investigation into color designs of product packaging through visual evaluations using machine learning methods
- Author
-
Yang Gao
- Subjects
Scheme (programming language) ,Computer science ,Manufactures ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Scale-invariant feature transform ,Machine learning ,computer.software_genre ,01 natural sciences ,Convolutional neural network ,TS1-2301 ,050105 experimental psychology ,Industrial and Manufacturing Engineering ,010309 optics ,Set (abstract data type) ,paper packaging ,0103 physical sciences ,T1-995 ,support vector machine ,0501 psychology and cognitive sciences ,Visual communication ,Technology (General) ,computer.programming_language ,visual communication ,business.industry ,05 social sciences ,color design ,Engineering (General). Civil engineering (General) ,Sample (graphics) ,Support vector machine ,Artificial intelligence ,TA1-2040 ,Packaging and labeling ,business ,computer - Abstract
For a commodity, in addition to its quality, its external package is also very essential. This paper briefly introduced the intelligent support vector machine (SVM) algorithm for color design of paper packaging. The features were extracted from photos of packages using scale-invariant feature transform (SIFT), and the intelligent algorithm was trained and tested using photos of paper packaging for ceramic products collected at the ceramic crafts market as a sample set. Two paper package schemes designed in this study were used for further test. The SVM algorithm was compared with the back-propagation (BP) algorithm and the convolutional neural network (CNN) algorithm. The results showed that the three intelligent algorithms could evaluate the color design of paper packages, but the SVM algorithm was more accurate than the BP and CNN algorithms in evaluating the imagery of color design, both for the samples collected in the craft market and for the paper packaging scheme designed in this paper.
- Published
- 2021
13. Predicting the influence of the non-sinusoidal network mode on power transformers
- Author
-
Ngo Van Cuong and Lidiia I. Kovernikova
- Subjects
lcsh:GE1-350 ,Computer science ,Transformer oil ,0211 other engineering and technologies ,Electrical insulation paper ,02 engineering and technology ,010501 environmental sciences ,AC power ,01 natural sciences ,Automotive engineering ,law.invention ,law ,Electrical equipment ,Harmonics ,Electrical network ,021108 energy ,Electric power ,lcsh:Environmental sciences ,0105 earth and related environmental sciences ,Voltage - Abstract
The parameters of electrical network modes often do not meet the requirements of Russian GOST 32144-2013 and the guidelines of Vietnam. In the actual operating conditions while there is the non-sinusoidal mode in electrical networks voltage and current harmonics are present. Harmonics result in overheating and damage of power transformers since they cause additional active power losses. Additional losses lead to the additional heat release, accelerating the process of insulating paper, transformer oil and magnetic structure deterioration consequently shortening the service life of a power transformer. In this regard there arises a need to develop certain scientific methods that would help demonstrate that low power quality, for instance could lead to a decrease in the electrical equipment service life. Currently we see a development of automated systems for continuous monitoring of power quality indices and mode parameters of electrical networks. These systems could be supplemented by characteristics calculating programs that give out a warning upon detection of the adverse influence of voltage and current harmonics on various electrical equipment of both electric power providers and electric power consumers. A software program presented in the article may be used to predict the influence of voltage and current harmonics on power transformers.
- Published
- 2019
14. PISA: new design methods for offshore wind turbine monopiles
- Author
-
Harvey J. Burd, Christopher M. Martin, Guy T. Houlsby, David M. Potts, Byron W. Byrne, Lidija Zdravković, Ross A. McAdam, Kenneth Gavin, Richard J. Jardine, and David M. G. Taborda
- Subjects
Computer science ,Short paper ,0211 other engineering and technologies ,020101 civil engineering ,02 engineering and technology ,General Medicine ,Turbine ,0201 civil engineering ,Offshore wind power ,Cyclic loading ,Pile ,Design methods ,021101 geological & geomatics engineering ,Marine engineering - Abstract
This paper provides a summary of the PIle Soil Analysis (PISA) project, completed in the UK during the period 2013 to 2018. The research led to the development of a new, computationally efficient, one dimensional design model for laterally loaded monopile foundations, particularly for offshore wind turbine support structures. The current form of the design model is applicable to monotonic loading only, but it could form a basis for extensions to cyclic loading. This short paper describes the background to the project, outlining the key research elements completed, as well as the main impacts that have been achieved. A number of publications describing the research in further detail are highlighted.
- Published
- 2019
15. Development of Prediction models for Bond Strength of Steel Fiber Reinforced Concrete by Computational Machine Learning
- Author
-
Rajesh Kumar Rai, Priyanka Singh, Aman Namdeo, Chakshu Garg, and Krishna Mohan Agarwal
- Subjects
lcsh:GE1-350 ,Soft computing ,business.product_category ,Computer science ,Bond strength ,business.industry ,020209 energy ,0211 other engineering and technologies ,02 engineering and technology ,Fiber-reinforced concrete ,Machine learning ,computer.software_genre ,law.invention ,Paper machine ,law ,021105 building & construction ,0202 electrical engineering, electronic engineering, information engineering ,Production (economics) ,Artificial intelligence ,Reduction (mathematics) ,business ,computer ,lcsh:Environmental sciences ,Predictive modelling ,Network model - Abstract
Sustainable construction contributed to the usage of recycled and waste materials to substitute conventional concrete. This research focuses on prediction of normalized bond strength of cement concrete substituted by large amounts of waste materials and products with strong mechanical properties and sustainability. It also emphases on using analytical model for the prediction of bond strength of the green concrete, so that there is a reduction in the cost of construction, con-serve energy, and it will lead to a reduction of CO2 production from cement industries within reliable limits. In this paper machine learning approach has been used to predict the normalized bond strength of green and sustainable concrete. Machine learning empowers machines to learn from their experiences and data provided. The system analyses the datasets and finds different patterns formed in the given data. Then, based on its learnings the machine can make certain predictions. In civil engineering application, a special computing technique called the Machine learning (ML) is in huge demand. ANN is a soft computing technique that learns from previous situations and adapts without constraints to a new environment. In this work, a ML network model for prediction of normalized bond strength of concrete has been illustrated. Different sets of data based upon several concrete design mixes were taken from technical literature and were fed to the model. The model is then trained for prediction, which are being influenced by several input attributes and were jotted down a linear regression analysis.
- Published
- 2020
16. Electronic Document Management Using Inverted Files System
- Author
-
Derwin Suhartono, Erwin Setiawan, and Djon Irwanto
- Subjects
Information retrieval ,Database ,business.industry ,Computer science ,Physics ,QC1-999 ,Document management system ,Paper based ,computer.software_genre ,Term (time) ,Search engine ,Design Document Listing ,ComputingMethodologies_DOCUMENTANDTEXTPROCESSING ,The Internet ,business ,Digital document ,computer - Abstract
The amount of documents increases so fast. Those documents exist not only in a paper based but also in an electronic based. It can be seen from the data sample taken by the SpringerLink publisher in 2010, which showed an increase in the number of digital document collections from 2003 to mid of 2010. Then, how to manage them well becomes an important need. This paper describes a new method in managing documents called as inverted files system. Related with the electronic based document, the inverted files system will closely used in term of its usage to document so that it can be searched over the Internet using the Search Engine. It can improve document search mechanism and document save mechanism.
- Published
- 2014
17. The Detection Method of Fire Abnormal Based on Directional Drilling in Complex Conditions of Mine
- Author
-
Hao Shijun, Feng Jie, and Duan Huijun
- Subjects
lcsh:GE1-350 ,Computer science ,Directional drilling ,Fire prevention ,Process (computing) ,ComputerApplications_COMPUTERSINOTHERSYSTEMS ,Measurement while drilling ,Anomaly detection ,Paper based ,Trajectory control ,lcsh:Environmental sciences ,Energy (signal processing) ,Marine engineering - Abstract
In the light of more and more urgent hidden fire abnormal detection problem in complex conditions of mine, a method which is used directional drilling technology is put forward. The method can avoid the obstacles in mine, and complete the fire abnormal detection. This paper based on analyzing the trajectory control of directional drilling, measurement while drilling and the characteristic of open branch process, the project of the directional drilling is formulated combination with a complex condition mine, and the detection of fire abnormal is implemented. This method can provide technical support for fire prevention, which also can provide a new way for fire anomaly detection in the similar mine.
- Published
- 2018
18. dCache – Efficient Message Encoding For Inter-Service Communication in dCache: Evaluation of Existing Serialization Protocols as a Replacement for Java Object Serialization.
- Author
-
Doglioni, C., Kim, D., Stewart, G.A., Silvestris, L., Jackson, P., Kamleh, W., Morschel, Lea, Adeyemi, Olufemi, Garonne, Vincent, Litvintsev, Dmitry, Millar, Paul, Mkrtchyan, Tigran, Rossi, Albert, Sahakyan, Marina, Starek, Juergen, and Yasar, Sibel
- Subjects
PARTICLE physics ,ASTROPHYSICS ,DISTRIBUTED computing ,COMPUTER science ,DATA structures - Abstract
As a well established, large-scale distributed storage system, dCache is used to manage and serve huge amounts of data collected by high energy physics, astrophysics and photon science experiments. Based on a microservices-like architecture, dCache is built as a modular distributed system, where each component provides a different core functionality. These services communicate by passing serialized messages to each other, a core behavior whose performance properties can consequently affect the entire system. This paper compares and evaluates different data serialization protocols in computer science with the objective of replacing and improving upon Java Object Serialization (JOS), which has increasingly presented itself as no longer being sufficiently performant for encoding messages. The criteria for choosing a new framework are collected, analyzed and formalized. The primary motivation for replacing Java serialization for encoding dCache messages is increasing the general speed of message-passing and thereby reducing the round-trip time for user requests. Emphasis is also placed on schema evolution capabilities and framework usability. Approaches for generalizing (de)serialization speed and size measurements based on data structure complexity are introduced, criteria for measuring documentation, learning curve, maintainability and introduction effort are defined. Finally, several selected serialization protocols are evaluated and compared accordingly, concluding with a recommendation for a suitable JOS replacement. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
19. Elastohysteresis model implemented in the finite element sofware HEREZH++
- Author
-
Gérard Rio, Yong Liu, and Denis Favier
- Subjects
Software ,business.industry ,Computer science ,Short paper ,Benchmark (computing) ,Experimental data ,Element (category theory) ,Physics::Classical Physics ,business ,SMA ,Computational science - Abstract
This short paper describes the simulation results obtained with the elasto-hysteresis model implemented in the finite element software Herezh++ and compares them with the experimental data of the Roundrobin SMA Modelling benchmark.
- Published
- 2009
20. Computing some role assignments of Cartesian product of graphs.
- Author
-
Castonguay, Diane, Silva Dias, Elisangela, Mesquita, Fernanda Neiva, and Nascimento, Julliano Rosa
- Subjects
SOCIAL role ,COMPUTATIONAL complexity ,STATISTICAL decision making ,SOCIAL networks ,COMPUTER science ,ASSIGNMENT problems (Programming) ,CHARTS, diagrams, etc. - Abstract
In social networks, a role assignment is such that individuals play the same role, if they relate in the same way to other individuals playing counterpart roles. When a smaller graph models the social roles in a network, this gives rise to the decision problem called r-Role Assignment whether it exists such an assignment of r distinct roles to the vertices of the graph. This problem is known to be NP-complete for any fixed r ≥ 2. The Cartesian product of graphs is one of the most studied operation on graphs and has numerous applications in diverse areas, such as Mathematics, Computer Science, Chemistry and Biology. In this paper, we determine the computational complexity of r-Role Assignment restricted to Cartesian product of graphs, for r = 2, 3. In fact, we show that the Cartesian product of graphs is always 2-role assignable, however the problem of 3-Role Assignment is still NP-complete for this class. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. MINIMAL NFA AND BIRFSA LANGUAGES.
- Author
-
Latteux, Michel, Roos, Yves, and Terlutte, Alain
- Subjects
ROBOTS ,MACHINE theory ,SEQUENTIAL machine theory ,COMPUTERS ,CELLULAR automata ,LANGUAGE & languages ,COMPUTER science - Abstract
In this paper, we define the notion of biRFSA which is a residual finate state automaton (RFSA) whose the reverse is also an RFSA. The languages recognized by such automata are called biRFSA languages. We prove that the canonical RFSA of a biRFSA language is a minimal NFA for this language and that each minimal NFA for this language is a sub-automaton of the canonical RFSA. This leads to a characterization of the family of biRFSA languages. In the second part of this paper, we define the family of biseparable automata. We prove that every biseparable NFA is uniquely minimal among all NFAs recognizing a same language, improving the result of H. Tamm and E. Ukkonen for bideterministic automata. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
22. ON THE AVERAGE LOWER BONDAGE NUMBER OF A GRAPH.
- Author
-
TURACI, TUFAN
- Subjects
GRAPH theory ,COMPUTER science ,GRAPH connectivity ,DOMINATING set ,COMPUTER networks - Abstract
The domination number is an important subject that it has become one of the most widely studied topics in graph theory, and also is the most often studied property of vulnerability of communication networks. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. Let G = (V (G),E(G)) be a simple graph. The bondage number b(G) of a nonempty graph G is the smallest number of edges whose removal from G result in a graph with domination number greater than that of G. If we think a graph as a modeling of network, the average lower bondage number of a graph is a new measure of the graph vulnerability and it is defined by b
av (G) = 1/∣E(G)∣ Σ e∊E(G) be (G), where the lower bondage number, denoted by be (G), of the graph G relative to e is the minimum cardinality of bondage set in G that contains the edge e. In this paper, the above mentioned new parameter has been defined and examined. Then upper bounds, lower bounds and exact formulas have been obtained for any graph G. Finally, the exact values have been determined for some well-known graph families. [ABSTRACT FROM AUTHOR]- Published
- 2016
- Full Text
- View/download PDF
23. ADVICE COMPLEXITY OF DISJOINT PATH ALLOCATION.
- Author
-
KOVÁČOVÁ, IVANA
- Subjects
ONLINE algorithms ,MATHEMATICAL bounds ,COMPLEXITY (Philosophy) ,CONJOINT analysis ,COMPUTER science - Abstract
This paper contributes to the research of advice complexity of online problems. Namely, we discuss the disjoint path allocation problem in various versions, based on the choice of values of the calls, and ability to preempt. The advice complexity is measured relative to either the length of the input sequence of requests, or the length of the input path. We provide lower and upper bounds on advice complexity of optimal online algorithms for these problems, and some bounds on trade-off between competitiveness and advice complexity. One of the results is an improved lower bound of n − 1 on advice complexity for the non-preemptive version with constant values of calls. For all considered variations, the newly provided lower and upper bounds on advice complexity of optimal algorithms are linear, and therefore asymptotically tight. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
24. Simulink Modelling for Simulating Intensive Care Mechanical Ventilators
- Author
-
Pietro De Palma, Andrew Plummer, Riccardo Amirante, Elia Distaso, and Paolo Tamburrano
- Subjects
lcsh:GE1-350 ,Coronavirus disease 2019 (COVID-19) ,Design stage ,mechanical ventilators ,business.industry ,Computer science ,Subroutine ,Interface (computing) ,volume controlled ventilation ,030208 emergency & critical care medicine ,simulink ,03 medical and health sciences ,0302 clinical medicine ,Software ,030228 respiratory system ,Mechanical ventilator ,Intensive care ,Relief valve ,business ,Simulation ,lcsh:Environmental sciences ,intensive care - Abstract
This paper proposes a modelling approach for simulating mechanical ventilators for intensive care units (ICUs) The shortage of ventilators during the coronavirus disease 2019 (COVID-19) pandemic has focused attention on their design and performance The proposed modelling approach consists in using the Mathworks® Simulink software tool and the SimScape Fluids (gas) library, so as to use well-established subroutines to simulate all the pneumatic components of typical ventilators for ICUs, such as the pressure reducing valves, pressure relief valves, check valves, tanks, ON\OFF and proportional directional valves, etc The patient is simulated by setting the values of lung compliance and pressure losses occurring in the trachea The proposed modelling approach is used in this paper to simulate a pneumatic scheme employed in some commercial ventilators The model allows a very accurate prediction of fundamental parameters, such as the inspiratory flow rate, the inspiratory pressure, the end-expiratory pressure Since the software interface is user-friendly, it can easily be used by manufacturers to correctly choose the geometrical and operating parameters of the components during the design stage or to assess different scenarios © 2020 The Authors, published by EDP Sciences
- Published
- 2020
25. NESTED SIBLING TREE AUTOMATA.
- Author
-
Gire, Françoise and Talbot, Jean-Marc
- Subjects
XML (Extensible Markup Language) ,BOOLEAN searching ,ELECTRONIC information resource searching ,COMPUTER science ,MACHINE theory - Abstract
In the XML standard, data are represented as unranked labeled ordered trees. Regular unranked tree automata provide a useful formalism for the validation of schemas enforcing regular structural constraints on XML documents. However some concrete application contexts need the expression of more general constraints than the regular ones. In this paper we propose a new framework in which context-free style structural constraints can be expressed and validated. This framework is characterized by: (i) the introduction of a new notion of trees, the so-called typed unranked labeled trees (tulab trees for short) in which each node receives one of three possible types (up, down or fix), and (ii) the definition of a new notion of tree automata, the so-called nested sibling tulab tree automata, able to enforce context-free style structural constraints on tulab tree languages. During their structural control process, such automata are using visibly pushdown languages of words [R. Alur and P. Madhusudan, Visibly pushdown languages, 36th ACM symposium on Theory of Computing, Chicago, USA (2004) 202-211] on their alphabet of states. We show that the resulting class NSTL of tulab tree languages recognized by nested sibling tulab tree automata is robust, i.e. closed under Boolean operations and with decision procedures for the classical membership, emptiness and inclusion problems. We then give three characterizations of NSTL: a logical characterization by defining an adequate logic in which NSTL happens to coincide with the models of monadic second order sentences; the two other characterizations are using adequate encodings and map together languages of NSTL with some regular sets of 3-ary trees or with particular sets of binary trees. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
26. Polynomial algorithms for some scheduling problems with one nonrenewable resource
- Author
-
Aziz Moukrim, Abderrahim Sahli, and Jacques Carlier
- Subjects
Mathematical optimization ,Computer science ,Scheduling (production processes) ,Management Science and Operations Research ,Polynomial algorithm ,Non-renewable resource ,Computer Science Applications ,Theoretical Computer Science - Abstract
This paper deals with the Extended Resource Constrained Project Scheduling Problem (ERCPSP) which is defined by events, nonrenewable resources and precedence constraints between pairs of events. The availability of a resource is depleted and replenished at the occurrence times of a set of events. The decision problem of ERCPSP consists of determining whether an instance has a feasible schedule or not. When there is only one nonrenewable resource, this problem is equivalent to find a feasible schedule that minimizes the number of resource units initially required. It generalizes the maximum cumulative cost problem and the two-machine maximum completion time flow-shop problem. In this paper, we consider this problem with some specific precedence constraints: parallel chains, series-parallel and interval order precedence constraints. For the first two cases, polynomial algorithms based on a linear decomposition of chains are proposed. For the third case, a polynomial algorithm is introduced to solve it. The priority between events is defined using the properties of interval orders.
- Published
- 2021
27. A beam search for the equality generalized symmetric traveling salesman problem
- Author
-
Rym M'Hallah and Ibtissem Ben Nejma
- Subjects
Mathematical optimization ,Computer science ,business.industry ,Node (networking) ,Lin–Kernighan heuristic ,Management Science and Operations Research ,Travelling salesman problem ,Computer Science Applications ,Theoretical Computer Science ,Tree (data structure) ,Production schedule ,Beam search ,Local search (optimization) ,Polling ,business - Abstract
This paper studies the equality generalized symmetric traveling salesman problem (EGSTSP). A salesman has to visit a predefined set of countries. S/he must determine exactly one city (of a subset of cities) to visit in each country and the sequence of the countries such that s/he minimizes the overall travel cost. From an academic perspective, EGSTSP is very important. It is NP-hard. Its relaxed version TSP is itself NP-hard, and no exact technique solves large difficult instances. From a logistic perspective, EGSTSP has a broad range of applications that vary from sea, air, and train shipping to emergency relief to elections and polling to airlines' scheduling to urban transportation. During the COVID-19 pandemic, the roll-out of vaccines further emphasizes the importance of this problem. Pharmaceutical firms are challenged not only by a viable production schedule but also by a flawless distribution plan especially that some of these vaccines must be stored at extremely low temperatures. This paper proposes an approximate tree-based search technique for EGSTSP. It uses a beam search with low and high level hybridization. The low-level hybridization applies a swap based local search to each partial solution of a node of a tree whereas the high-level hybridization applies 2-Opt, 3-Opt or Lin-Kernighan to the incumbent. Empirical results provide computational evidence that the proposed approach solves large instances with 89 countries and 442 cities in few seconds while matching the best known cost of 8 out of 36 instances and being less than 1.78% away from the best known solution for 27 instances. © The authors. Published by EDP Sciences, ROADEF, SMAI 2021.
- Published
- 2021
28. Forecasting the wind power generation in China by seasonal grey forecasting model based on collaborative optimization
- Author
-
Wuyong Qian and Aodi Sui
- Subjects
Wind power ,Meteorology ,Computer science ,business.industry ,Lag ,Management Science and Operations Research ,Energy planning ,Computer Science Applications ,Theoretical Computer Science ,Power (physics) ,Renewable energy ,Moving average ,Seasonal adjustment ,business ,Realization (probability) - Abstract
Renewable energy represented by wind energy plays an increasingly important role in China’s national energy system. The accurate prediction of wind power generation is of great significance to China’s energy planning and power grid dispatch. However, due to the late development of the wind power industry in China and the lag of power enterprise information, there are little historical data available at present. Therefore, the traditional large sample prediction method is difficult to be applied to the forecasting of wind power generation in China. For this kind of small sample and poor information problem, the grey prediction method can give a good solution. Thus, given the seasonal and long memory characteristics of the seasonal wind power generation, this paper constructs a seasonal discrete grey prediction model based on collaborative optimization. On the one hand, the model is based on moving average filtering algorithm to realize the recognition of seasonal and trend features. On the other hand, based on the optimization of fractional order and initial value, the collaborative optimization of trend and season is realized. To verify the practicability and accuracy of the proposed model, this paper uses the model to predict the quarterly wind power generation of China from 2012Q1 to 2020Q1, and compares the prediction results with the prediction results of the traditional GM(1,1) model, SGM(1,1) model and Holt-Winters model. The results are shown that the proposed model has a strong ability to capture the trend and seasonal fluctuation characteristics of wind power generation. And the long-term forecasts are valid if the existing wind power expansion capacity policy is maintained in the next four years. Based on the forecast of China’s wind power generation from 2021Q2 to 2024Q2 in the future, it is predicted that China’s wind power generation will reach 239.09 TWh in the future, which will be beneficial to the realization of China’s energy-saving and emission reduction targets.
- Published
- 2021
29. Multi-leader-follower potential games
- Author
-
Sonja Steffensen
- Subjects
Class (set theory) ,Computer Science::Computer Science and Game Theory ,T57-57.97 ,Applied mathematics. Quantitative methods ,Computer science ,ComputingMilieux_PERSONALCOMPUTING ,TheoryofComputation_GENERAL ,symbols.namesake ,Nash equilibrium ,symbols ,QA1-939 ,Uniqueness ,Leader follower ,Potential game ,Mathematical economics ,Mathematics ,Nash games - Abstract
In this paper, we discuss a particular class of Nash games, where the participants of the game (the players) are divided into two groups (leaders and followers) according to their position or influence on the other players. Moreover, we consider the case, when the leaders’ and/or the followers’ game can be described as a potential game. This is a subclass of Nash games that has been introduced by Monderer and Shapley in 1996 and has beneficial properties to reformulate the bilevel Nash game. We develope necessary and sufficient conditions for Nash equilibria and present existence and uniqueness results. Furthermore, we discuss some Examples to illustrate our results. In this paper, we discussed analytical properties for multi-leader follower potential games, that form a subclass of hierarchical Nash games. The application of these theoretical results to various fields of applications are a future research topic. Moreover, they are meant to serve as a starting point for the developement of efficient numerical solution methods for multi-leader-follower games.
- Published
- 2021
30. A multi-objective multi-agent optimization algorithm for the multi-skill resource-constrained project scheduling problem with transfer times
- Author
-
Amir Hossein Hosseinian and Vahid Baradaran
- Subjects
Mathematical optimization ,021103 operations research ,Optimization problem ,Similarity (geometry) ,Computer science ,Multi-agent system ,0211 other engineering and technologies ,TOPSIS ,02 engineering and technology ,Ideal solution ,Management Science and Operations Research ,Multi-objective optimization ,Computer Science Applications ,Theoretical Computer Science ,0202 electrical engineering, electronic engineering, information engineering ,Benchmark (computing) ,020201 artificial intelligence & image processing ,Duration (project management) - Abstract
This paper addresses the Multi-Skill Resource-Constrained Project Scheduling Problem with Transfer Times (MSRCPSP-TT). A new model has been developed that incorporates the presence of transfer times within the multi-skill RCPSP. The proposed model aims to minimize project’s duration and cost, concurrently. The MSRCPSP-TT is an NP-hard problem; therefore, a Multi-Objective Multi-Agent Optimization Algorithm (MOMAOA) is proposed to acquire feasible schedules. In the proposed algorithm, each agent represents a feasible solution that works with other agents in a grouped environment. The agents evolve due to their social, autonomous, and self-learning behaviors. Moreover, the adjustment of environment helps the evolution of agents as well. Since the MSRCPSP-TT is a multi-objective optimization problem, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used in different procedures of the MOMAOA. Another novelty of this paper is the application of TOPSIS in different procedures of the MOMAOA. These procedures are utilized for: (1) detecting the leader agent in each group, (2) detecting the global best leader agent, and (3) the global social behavior of the MOMAOA. The performance of the MOMAOA has been analyzed by solving several benchmark problems. The results of the MOMAOA have been validated through comparisons with three other meta-heuristics. The parameters of algorithms are determined by the Response Surface Methodology (RSM). The Kruskal–Wallis test is implemented to statistically analyze the efficiency of methods. Computational results reveal that the MOMAOA can beat the other three methods according to several testing metrics. Furthermore, the impact of transfer times on project’s duration and cost has been assessed. The investigations indicate that resource transfer times have significant impact on both objectives of the proposed model.
- Published
- 2021
31. Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy
- Author
-
Libério Martins Silva and Sanderson L. Gonzaga de Oliveira
- Subjects
0209 industrial biotechnology ,Computer science ,Heuristic ,MathematicsofComputing_NUMERICALANALYSIS ,02 engineering and technology ,Management Science and Operations Research ,01 natural sciences ,Computer Science Applications ,Theoretical Computer Science ,010309 optics ,Reduction (complexity) ,Matrix (mathematics) ,020901 industrial engineering & automation ,0103 physical sciences ,Bandwidth (computing) ,Hyper-heuristic ,Heuristics ,Hill climbing ,Algorithm ,Sparse matrix - Abstract
This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computations. Bandwidth optimization is a demanding subject for a large number of scientific and engineering applications. A heuristic for bandwidth reduction labels the rows and columns of a given sparse matrix. The algorithm arranges entries with a nonzero coefficient as close to the main diagonal as possible. This paper modifies an ant colony hyper-heuristic approach to generate expert-level heuristics for bandwidth reduction combined with a Hill-Climbing strategy when applied to matrices arising from specific application areas. Specifically, this paper uses low-cost state-of-the-art heuristics for bandwidth reduction in tandem with a Hill-Climbing procedure. The results yielded on a wide-ranging set of standard benchmark matrices showed that the proposed strategy outperformed low-cost state-of-the-art heuristics for bandwidth reduction when applied to matrices with symmetric sparsity patterns.
- Published
- 2021
32. On compromise solutions in multiple objective programming.
- Author
-
Soleimani–Damaneh, Majid and Zamani, Moslem
- Subjects
COMPUTER programming ,MATHEMATICAL proofs ,HYPOTHESIS ,COMPUTER science ,MATHEMATICAL analysis - Abstract
Compromise solutions, as feasible points as close as possible to the ideal (utopia) point, are important solutions in multiple objective programming. It is known in the literature that each compromise solution is a properly efficient solution if the sum of the image set and conical ordering cone is closed. In this paper, we prove the same result in a general setting without any assumption. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
33. Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times
- Author
-
Yaser Zarook, Javad Rezaeian, Masoud Yaghini, and Iraj Mahdavi
- Subjects
Mathematical optimization ,Job shop scheduling ,Computer science ,Heuristic (computer science) ,020209 energy ,media_common.quotation_subject ,02 engineering and technology ,Management Science and Operations Research ,Upper and lower bounds ,Computer Science Applications ,Theoretical Computer Science ,03 medical and health sciences ,0302 clinical medicine ,030221 ophthalmology & optometry ,0202 electrical engineering, electronic engineering, information engineering ,Batch processing ,Quality (business) ,Minification ,Heuristics ,Integer programming ,media_common - Abstract
This paper considers the minimization of makespan in the unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic job ready time. The considered unrelated machines have different capacity and different processing speed. Each machine processes a number of the jobs as a batch at the same time so that the machine’s capacity is not exceeded. The batch processing time and the batch ready time are equal to the largest processing time and the largest ready time of jobs in the same batch, respectively. In this paper, a Mixed Integer Linear Programming (MILP) model, two categories of the heuristic procedures (six heuristics) and a meta-heuristic algorithm are proposed to solve the problem. A lower bound is also presented by relaxing of the original problem to evaluate the quality of the proposed algorithms. The computational experiments show the performance of the proposed algorithms under the considered measures.
- Published
- 2021
34. Integrating decision making conditions into DEA models
- Author
-
Adli Mustafa and Rokhsaneh Yousef Zehi
- Subjects
Mathematical optimization ,021103 operations research ,Computer science ,media_common.quotation_subject ,Control (management) ,0211 other engineering and technologies ,Value (computer science) ,02 engineering and technology ,Management Science and Operations Research ,Computer Science Applications ,Theoretical Computer Science ,Set (abstract data type) ,Variable (computer science) ,Homogeneous ,Voting ,0202 electrical engineering, electronic engineering, information engineering ,Data envelopment analysis ,020201 artificial intelligence & image processing ,media_common - Abstract
Data Envelopment Analysis (DEA) is a popular non-parametric technique for the assessment of efficiency of a set of homogeneous decision making units (DMUs) with the same set of inputs and outputs. In the conventional DEA models, it is assumed that all variables are fully controllable. However, in the real-world applications of DEA, some of the variables are completely uncontrollable or partially controllable. In this paper, we are concerned about partially controllable variables which are called semi-discretionary variables. In DEA models, in the presence of semi-discretionary variables, decision makers have partial control on these variables and the proportional changes are possible to some extent. Previous DEA models with semi-discretionary variables consider a certain level of control on the variables which is fixed and it is given by decision makers or a higher authority. Since this level is usually given by experts, it is possible that in some cases all experts may not come up with an agreement, so in this paper we consider variable instead of fixed level of control on each semi-discretionary variable. In the presence of semi-discretionary variables, the proportional changes in inputs and out-puts may not be feasible and as a result the obtained target value by conventional DEA models is not achievable for an inefficient DMU. Thus, we propose a bi-objective model to evaluate DMUs when modifying a variable to its target value should be managed by decision makers in a voting system. One of the advantages of the proposed model is including decision making conditions directly into a DEA model.
- Published
- 2021
35. A dynamic adaptive AHRS algorithm for UAV based on SVDCKF
- Author
-
Yicong Guo, Xiaoxiong Liu, Weiguo Zhang, Yue Yang, and Xuhang Liu
- Subjects
Covariance matrix ,Computer science ,cubature kalman filter ,010401 analytical chemistry ,singular value decomposition ,0211 other engineering and technologies ,General Engineering ,Attitude and heading reference system ,low-cost attitude sensor ,Estimator ,State vector ,TL1-4050 ,02 engineering and technology ,Filter (signal processing) ,01 natural sciences ,0104 chemical sciences ,Adaptive filter ,Robustness (computer science) ,021105 building & construction ,Singular value decomposition ,dynamic adaptive factor ,Algorithm ,small uavs ,Motor vehicles. Aeronautics. Astronautics - Abstract
Aiming at the attitude solution accuracy and robustness for small UAVs in complex flight conditions, this paper proposes a dynamic adaptive attitude and heading systems(AHRS) estimator with singular value decomposition Cubature Kalman filter(SVDCKF). Considering the problem of random bias for the low-cost attitude sensor, this paper designs a method that the sensor random bias is used as the state vector to eliminate the effect of the sensor random bias. Due to the non-linearity of small UAVs AHRS model and the non-positive definite phenomenon of the covariance matrix, a nonlinear AHRS filter combined with the Cubature Kalman filter and singular value decomposition is designed to improve the attitude solution accuracy. In addition, when the UAV flies in the different flight conditions, the three-axis acceleration of the attitude sensor will affect the attitude solution. Thus, a dynamic adaptive factor based on adaptive filtering is used to adjust continuously the acceleration noise variance to improve the robustness of the AHRS. The experimental results show that the method and algorithm proposed not only improve the attitude solution accuracy, and satisfy the flight requirements of small UAVs, but also eliminate the influence of the attitude sensor random bias and three-axis acceleration for the attitude solution to improve the proposed algorithm robustness and anti-interference.
- Published
- 2021
36. An unsupervised learning neural network for planning UAV full-area reconnaissance path
- Author
-
Bo Li, Zhi-peng Yang, Zhuoran Jia, and Hao Ma
- Subjects
full-area reconnaissance ,Artificial neural network ,neural network ,Computer science ,business.industry ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,General Engineering ,TL1-4050 ,ComputerApplications_COMPUTERSINOTHERSYSTEMS ,Plan (drawing) ,unsupervised learning ,Machine learning ,computer.software_genre ,Path (graph theory) ,Offline learning ,Genetic algorithm ,genetic algorithm ,Unsupervised learning ,Artificial intelligence ,unmanned aerial vehicle (uav) ,business ,computer ,Motor vehicles. Aeronautics. Astronautics - Abstract
To plan a UAV's full-area reconnaissance path under uncertain information conditions, an unsupervised learning neural network based on the genetic algorithm is proposed. Firstly, the environment model, the UAV model and evaluation indexes are presented, and the neural network model for planning the UAV's full-area reconnaissance path is established. Because it is difficult to obtain the training samples for planning the UAV's full-area reconnaissance path, the genetic algorithm is used to optimize the unsupervised learning neural network parameters. Compared with the traditional methods, the evaluation indexes constructed in this paper do not need to specify UAV maneuver rules. The offline learning method proposed in the paper has excellent transfer performances. The simulation results show that the UAV based on the unsupervised learning neural network can plan effective full-area reconnaissance paths in the unknown environments and complete full-area reconnaissance missions.
- Published
- 2021
37. Path following of ship based on sliding mode control with improved RBF neural network and virtual circle
- Author
-
Hugan Zhang, Zongxuan Li, and Renxiang Bu
- Subjects
path following ,Observer (quantum physics) ,Artificial neural network ,Computer science ,020209 energy ,General Engineering ,Internal model ,sliding mode control ,TL1-4050 ,020101 civil engineering ,02 engineering and technology ,Sliding mode control ,0201 civil engineering ,Control theory ,nonlinear observer ,Path (graph theory) ,0202 electrical engineering, electronic engineering, information engineering ,Inverse trigonometric functions ,Radial basis function ,radial basis function neural network ,Motor vehicles. Aeronautics. Astronautics - Abstract
To address the unmeasured velocity, external disturbance and internal model uncertainty for following the path of an under-actuated ship, the paper presents a sliding mode control method based on the radial basis function(RBF) neural network and the velocity observer. To enhance the RBF performance of approximating the unknown, an arc tangent function was exploited in the RBF neural network to update its weight values. Then, the nonlinear observer was built via the hyperbolic tangent function to deal with the unmeasured velocity of the ship. Furthermore, in order to avoid overshoots when the ship is moving to its way points, the virtual paths of a variable circle based on the turning angle were designed at the joints of the path of the ship to enhance its path following capability. Finally, the simulation results show that the sliding mode controller designed in the paper can force the ship to follow accurately the reference path in case of time-varying disturbances without measured velocity and enhance the path following performance of the ship and the accuracy of the RBF neural network, thus demonstrating its effectiveness.
- Published
- 2021
38. Multi-objective multi-factory scheduling
- Author
-
Seyyed Mohammad Taghi Fatemi Ghomi and Javad Behnamian
- Subjects
Mathematical optimization ,Job shop scheduling ,Linear programming ,Heuristic (computer science) ,Computer science ,Tardiness ,Scheduling (production processes) ,Minification ,Management Science and Operations Research ,Completion time ,Multi-objective optimization ,Computer Science Applications ,Theoretical Computer Science - Abstract
This paper introduces a multi-factory scheduling problem with heterogeneous factories and parallel machines. This problem, as a major part of supply chain planning, includes the finding of a suitable factory for each job and the scheduling of the assigned jobs at each factory, simultaneously. For the first time, this paper studies multi-objective scheduling in the production network in which each factory has its customers and demands can be satisfied by itself or other factories. In other words, this paper assumes that jobs can transfer from the overloaded machine in the origin factory to the factory, which has fewer workloads by imposing some transportation times. For simultaneous minimization of the sum of the earliness and tardiness of jobs and total completion time, after modeling the scheduling problem as a mixed-integer linear program, the existing multi-objective techniques are analyzed and a new one is applied to our problem. Since this problem is NP-hard, a heuristic algorithm is also proposed to generate a set of Pareto optimal solutions. Also, the algorithms are proposed to improve and cover the Pareto front. Computational experiences of the heuristic algorithm and the output of the model implemented by CPLEX over a set of randomly generated test problems are reported.
- Published
- 2021
39. Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review
- Author
-
Jaspreet Singh Oberoi, Harpreet Singh, and Doordarshi Singh
- Subjects
0209 industrial biotechnology ,Operations research ,Computer science ,Scheduling (production processes) ,Flexible scheduling ,02 engineering and technology ,Flow shop scheduling ,Management Science and Operations Research ,Computer Science Applications ,Theoretical Computer Science ,020901 industrial engineering & automation ,Systematic review ,Work order ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Flow optimization ,Parametric statistics - Abstract
Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows the changes in the job order to flexibly manage such irregularity. The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries. The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint. This paper organizes scheduling problems based on performance measures of variability and shop environments. The extended summary of two/three-machine and m-machine problems has been compiled, including their objectives, algorithms, parametric considerations, and their findings. A systematic appearance of both conceptual and analytical results summarizes various advances of the no-wait constraint. The paper includes independently investigated problems and suggestions for future research directions.
- Published
- 2021
40. An algorithm for the anchor points of the PPS of the FRH models
- Author
-
Dariush Akbarian
- Subjects
Set (abstract data type) ,Anchor point ,Computer science ,Hull ,Data envelopment analysis ,Production (computer science) ,Management Science and Operations Research ,Algorithm ,Integer programming ,Replication (computing) ,Computer Science Applications ,Theoretical Computer Science - Abstract
In this paper we deal with a variant of non-convex data envelopment analysis, called free replication hull model and try to obtain their anchor points. This paper uses a variant of super-efficiency model to characterize all extreme efficient decision making units and anchor points of the free replication hull models. A necessary and sufficient conditions for a decision making unit to be anchor point of the production possibility set of the free replication hull models are stated and proved. Since the set of anchor points is a subset of the set of extreme units, a definition of extreme units and a new method for obtaining these units in non-convex technologies are given. To illustrate the applicability of the proposed model, some numerical examples are finally provided.
- Published
- 2021
41. Fuzzy weak link approach to the two-stage DEA
- Author
-
Dorota Kuchta and Dimitris K. Despotis
- Subjects
Mathematical optimization ,021103 operations research ,Selection (relational algebra) ,Computer science ,Existential quantification ,Fuzzy set ,0211 other engineering and technologies ,Pareto principle ,02 engineering and technology ,Management Science and Operations Research ,Fuzzy logic ,Computer Science Applications ,Theoretical Computer Science ,Order (exchange) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Uniqueness ,Preference (economics) - Abstract
This paper refers to a recent approach to two-stage DEA called the weak link approach. It underlines the lack of solution uniqueness in this approach to DEA and the fact that in order for the solution to the weak link approach to be unique, the decision maker needs to express a preference on which Pareto solution would be most satisfactory. In this paper, we propose to use a fuzzy set approach called fuzzy bicriterial programming to help the decision maker to express this preference. Fuzzy bicriterial programming is explained and then applied to the weak link approach to the DEA. It is shown that for each candidate (Pareto) solution to the original weak link approach, there exists an expert opinion that can lead to the unequivocal selection of this solution due to the use of the fuzzy approach. The proposal is illustrated with examples.
- Published
- 2021
42. Impact of an input-output specification on efficiency scores in data envelopment analysis: A banking case study
- Author
-
Martin Boďa and Zuzana Piklová
- Subjects
Input/output ,Measure (data warehouse) ,021103 operations research ,Computer science ,05 social sciences ,Comparability ,0211 other engineering and technologies ,02 engineering and technology ,Management Science and Operations Research ,Computer Science Applications ,Theoretical Computer Science ,Set (abstract data type) ,0502 economics and business ,Data envelopment analysis ,Econometrics ,Intermediation ,Production (economics) ,050207 economics ,Empirical evidence - Abstract
The paper stresses the importance of making an appropriate specification of inputs and outputs in technical efficiency measurement and provides empirical evidence that this initial step of an efficiency measurement project should not be underestimated. Oriented on a case study of Slovak commercial banks for the period from 2005 to 2016, the paper explores to what extent different input-output specifications affect the comparability or congruence of technical efficiency scores in a banking application produced by four different data envelopment models differing in the efficiency measure and orientation. Building on the long-standing controversy in the banking literature about the most appropriate description of banking production, the paper compares technical efficiency scores for 9 input-output specifications of the intermediation approach, 9 specifications of the production-like approaches and 3 network integrated specifications. All these specifications were empirically applied earlier in the literature. The efficiency scores produced by different input-output specifications and models are confronted by six measures of association or dependence, and their levels are explained in a regression framework. The results attest that the choice of the input-output set is a critical judgemental input to efficiency measurement since there is vast diversity in efficiency scores of input-output sets coming from different approaches but also for input-output sets associated with the same approach. In addition, intermediation input-output specifications tend to produce higher efficiency scores than production-like specifications.
- Published
- 2021
43. An improved Evaporation Rate-Water Cycle Algorithm based Genetic Algorithm for solving generalized ratio problems
- Author
-
C. Veeramani and S. Sharanya
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,021103 operations research ,Optimization problem ,Computer science ,0211 other engineering and technologies ,Evolutionary algorithm ,02 engineering and technology ,Management Science and Operations Research ,Computer Science Applications ,Theoretical Computer Science ,020901 industrial engineering & automation ,Chromosome (genetic algorithm) ,Robustness (computer science) ,Genetic algorithm ,Firefly algorithm ,Cuckoo search ,Metaheuristic - Abstract
This paper presents an efficient metaheuristic approach for optimizing the generalized ratio problems such as the sum and multiplicative of linear or nonlinear ratio objective function with affine constraints. This paper focuses on the significance of hybrid techniques, which are implemented by using GA and ER-WCA to increase efficiency and robustness for solving linear and nonlinear generalized ratio problems. Initially, GA starts with an initial random population and it is processed by genetic operators. ER-WCA will observe and preserve the GAs fittest chromosome in each cycle and every generation. This Genetic ER-WCA algorithm is provided with better optimal solutions while solving constrained ratio optimization problems. Also, the effectiveness of the proposed genetic ER-WCA algorithm is analyzed while solving the large scale ratio problems. The results and performance of the proposed algorithm ensures a strong optimization and improves the exploitative process when compared to the other existing metaheuristic techniques. Numerical problems and applications are used to test the performance of the convergence and the accuracy of the approached method. The behavior of this Genetic ER-WCA algorithm is compared with those of evolutionary algorithms namely Neural Network Algorithm, Grey Wolf Optimization, Evaporation Rate - Water Cycle Algorithm, Water Cycle Algorithm, Firefly algorithm, Cuckoo search algorithm. The evaluated results show that the proposed algorithm increases the convergence and accuracy more than other existing algorithms.
- Published
- 2021
44. Comparative study of distribution networks reconfiguration problem approaches
- Author
-
Ana Moura, Bárbara Soares, Joana Cordeiro, and Juliana Salvadorinho
- Subjects
Mathematical optimization ,Computer science ,020209 energy ,020208 electrical & electronic engineering ,Control reconfiguration ,Initialization ,02 engineering and technology ,Management Science and Operations Research ,Resolution (logic) ,Computer Science Applications ,Theoretical Computer Science ,Power (physics) ,0202 electrical engineering, electronic engineering, information engineering ,Minification ,Focus (optics) ,Metaheuristic ,Energy (signal processing) - Abstract
This work presents a comparative study between different resolutions approaches applied to the problem of power distribution. The main objective is to present a comparison between the various methods of resolution presented in the literature and the most used by the various authors. For this study, ninety papers that address the problem of reconfiguration of power distribution networks were analysed. The main objective is to reduce the real energy losses in the system, while several constraints regarding distribution are satisfied. The most recent papers were analysed, taking into account the approaches presented by the various authors, the formulation of the problem – namely its objective functions and constraints – the initialization methods and the stopping methods, as well as the results obtained. As such, an analysis and categorization of the various problems and approaches is presented, with the main focus being on the analysis and minimization of energy losses in 33-bus systems.
- Published
- 2021
45. Effect of price-sensitive demand and default risk on optimal credit period and cycle time for a deteriorating inventory model
- Author
-
Abolfazl Mirzazadeh, Magfura Pervin, Sankar Kumar Roy, Asim Paul, and Gerhard-Wilhelm Weber
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,021103 operations research ,Computer science ,0211 other engineering and technologies ,Economic shortage ,02 engineering and technology ,Management Science and Operations Research ,Profit (economics) ,Computer Science Applications ,Theoretical Computer Science ,Cycle time ,Inventory management ,020901 industrial engineering & automation ,Default risk ,Economic order quantity - Abstract
In this paper, we formulate and solve an economic order quantity model with default risk. Our main purpose is to investigate retailer’s optimal replenishment time and credit period for deteriorating items under selling price-dependent demand while maximizing profit per unit time. Here, shortages are allowed and items are partially backlogged for interested customers. We show that optimal replenishment time and credit period not only exist but they are also unique. We solve the proposed problem analytically. An algorithm is presented to derive the optimal solution of the model. The mathematical model is evaluated by numerical examples. We use Mathematica to obtain a global maximum solution to the optimal cycle time and the optimal credit period for the proposed model. A sensitivity analysis with respect to major parameters is performed in order to examine the stability of our model. At the end of the paper, conclusions are drawn and an outlook of possible future directions is depicted.
- Published
- 2021
46. Modeling and optimization of batch production based on layout and cutting problems under uncertainty
- Author
-
Ramyar Feizi and Mohammadhossein Saeedi
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,021103 operations research ,Computer science ,business.industry ,0211 other engineering and technologies ,02 engineering and technology ,Management Science and Operations Research ,Computer Science Applications ,Theoretical Computer Science ,020901 industrial engineering & automation ,Software ,Simple (abstract algebra) ,Genetic algorithm ,Batch production ,business ,Variable neighborhood search ,Suggested algorithm - Abstract
This paper presents modeling and optimization of batch production based on layout, cutting and project scheduling problems by considering scenario planning. In order to solve the model, a novel genetic algorithm with an improvement procedure based on variable neighborhood search (VNS) is presented. Initially, the model is solved in small sizes using Lingo software and the combined (proposed) genetic algorithm; then the results are compared. Afterwards, the model is solved in large sizes by utilizing the proposed algorithm and simple genetic algorithm. The main findings of this paper show: (1) The suggested algorithm is valid and able to achieve optimal and near-optimal solutions. This conclusion was made after proving the validity of the proposed method by solving a case study by employing the classical method (employing Lingo 11). And when the results were compared with the ones obtained by the proposed algorithm, they were found to be the same in both cases. (2) The combined genetic algorithm is more effective in obtaining optimal boundaries and the solutions close to them in all cases compared to the classical (simple) genetic algorithm. In other words, the main finding of this paper is a combined genetic algorithm to optimize batch production modeling problems, which is more efficient than the methods provided in the literature.
- Published
- 2021
47. A new soft computing algorithm based on cloud theory for dynamic facility layout problem
- Author
-
Mostafa Zandieh, Mani Sharifi, Seyed Shamsodin Hosseini, and Parham Azimi
- Subjects
Soft computing ,0209 industrial biotechnology ,Sequence ,Mathematical optimization ,Computer science ,business.industry ,Time horizon ,Cloud computing ,02 engineering and technology ,Management Science and Operations Research ,Computer Science Applications ,Theoretical Computer Science ,Set (abstract data type) ,020901 industrial engineering & automation ,Position (vector) ,Simulated annealing ,Genetic algorithm ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,business - Abstract
This paper deals with dynamic facility layout problem (DFLP) in a plant which is concerned with determining the best position of machines in the plant during a multi-period planning horizon. The material handling costs and machines rearrangement costs (MRC) are used to determine the best layout. In addition to the positions of machines, the details of transportation such as type of transporters and sequence of transportation operations have a direct effect on material handling costs (MHC). Therefore, it is more realistic to consider the transportation details during DFLP optimization. This paper proposes a new mathematical model to simultaneously determine the best position of machines in each period and to plan the transportation operations. Minimizing sum of MHC and MRC is considered as the objective function. A new hybrid meta-heuristic approach has been developed by combining modified genetic algorithm and cloud-based simulated annealing algorithm to solve the model. Finally, the proposed methodology is compared with two meta-heuristics on a set of test problems.
- Published
- 2021
48. Air Combat Maneuver Decision Based on Reinforcement Genetic Algorithm
- Author
-
Jianfeng Xie, Wanyang Wang, Jiandong Zhang, Qiming Yang, and Shuling Dai
- Subjects
reinforcement learning ,Optimization problem ,Computer science ,ComputerApplications_COMPUTERSINOTHERSYSTEMS ,02 engineering and technology ,air combat maneuvering decision ,Robustness (computer science) ,Genetic algorithm ,genetic algorithm ,0202 electrical engineering, electronic engineering, information engineering ,Reinforcement learning ,ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS ,simulation test scenario ,Motor vehicles. Aeronautics. Astronautics ,model ,Simulation test ,uav ,020208 electrical & electronic engineering ,General Engineering ,Air combat ,TL1-4050 ,020206 networking & telecommunications ,Control engineering ,Key (cryptography) ,Decision model ,control and decision - Abstract
With the continuous development of UAV technology, the trend of using UAV in the military battlefield is increasingly obvious, but the autonomous air combat capability of UAV needs to be further improved. The air combat maneuvering decision is the key link to realize the UAV autonomous air combat, and the genetic algorithm has good robustness and global searching ability which is suitable for solving large-scale optimization problems. This paper uses an improved genetic algorithm to model UAV air combat maneuvering decisions. Based on engineering application requirements, a typical simulation test scenario is established. The simulation results show that the air combat maneuvering decision model based on reinforcement genetic algorithm in this paper can obtain the correct maneuvering decision sequence and gain a position advantage in combat.
- Published
- 2020
49. Mechanism Design and Analysis of a New Overhead Transmission Line Inspection Robot
- Author
-
Zhai Yongjie, Wang Yishuang, and Yuan Chao
- Subjects
0209 industrial biotechnology ,Computer science ,design ,Frame (networking) ,General Engineering ,TL1-4050 ,Mobile robot ,02 engineering and technology ,inspection robot ,simulation ,obstacle-crossing mechanism ,Electric power system ,020901 industrial engineering & automation ,Electric power transmission ,Transmission line ,Line (geometry) ,0202 electrical engineering, electronic engineering, information engineering ,Robot ,Overhead (computing) ,strain tower ,020201 artificial intelligence & image processing ,four-arm structure ,Simulation ,Motor vehicles. Aeronautics. Astronautics - Abstract
The requirements of power system for the safety of overhead transmission lines are increasing. With the rapid development of mobile robot technology, the inspection of overhead transmission lines by inspection robots has become a research hotspot in recent years. Aiming at the task requirements of transmission line inspection robots and the environmental characteristics of transmission lines, researchers at home and abroad have developed a variety of inspection robots. However, most of these robots have problems such as inability to cross the strain tower, low obstacle crossing efficiency and poor safety. In order to solve the above problems, this paper proposes a new four-arm inspection robot mechanism. The robot can cross the strain tower with two different sets of arms working together. The rectangular frame structure on the walking arm improves the obstacle crossing efficiency of the robot, and the closed hanging mechanism ensures that the robot does not fall from the line. In this paper, the three-dimensional model of the robot is established, and the specific structure and motion parameters are given. Three typical obstacle-crossing modes are planned, and the motion analysis and force simulation analysis of the robot's obstacle-crossing process are carried out. The simulation result shows that the mechanism can efficiently cross the strain towers and common obstacles on the transmission line.
- Published
- 2020
50. A Combined Filter for Synchronous Detection in Underwater Acoustic Mobile Communication System
- Author
-
Fei Hua, Xiaohong Shen, Zhang Zhichen, Haiyan Wang, and Ling Wang
- Subjects
Computer science ,Acoustics ,Matched filter ,Echo (computing) ,General Engineering ,Audio time-scale/pitch modification ,TL1-4050 ,020206 networking & telecommunications ,02 engineering and technology ,Synchronization ,delay estimation ,synchronous detection ,symbols.namesake ,Filter (video) ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS ,Wideband ,Underwater ,underwater acoustic mobile communication ,Doppler effect ,Motor vehicles. Aeronautics. Astronautics - Abstract
A scale-stretching combined filter is proposed for underwater acoustic mobile communication receivers. The combined filter consists of the sum of signals with different time stretching and shifting. Based on the matched filtering theory, Doppler stretching scales, time shift, and the order of each component of the combined filter are derived. The method proposed in this paper improves the matching degree of the filter with wideband Doppler echo signals with different moving speeds. Simulation results show that the combined filter proposed in this paper can improve the detection probability and synchronization time estimation accuracy of wideband Doppler echo. In addition, the combined filter proposed in this paper has the same calculation amount as the matched filter. This feature makes this filter suitable for the synchronous detection of underwater acoustic mobile communication with real-time operation and low power consumption requirements.
- Published
- 2020
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.