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

decision-making desktop software and mobile app for wastewater treatment: selection of experimental parameters to estimate hydrogen peroxide production

引用

Environment Systems and decisions 2022年第2期42卷 295-305页

作者： Neto, Mário Mollo Matulovic, Mariana Novaes, Ana Karollina M. Sanches, Livia V. Forti, Juliane C. School of Science and Engineering Biosystems Engineering Department São Paulo State University (UNESP) SP Tupã 17602-496 Brazil

In a decade marked by 4.0 technologies, using some of them for the optimization of effluent treatment processes is one of the objectives of the current researchers in this area. In this paper, we present two models as a fuzzy rule-based expert system, utilized in a computer desktop platform “Peroxide 1.0” and a mobile app “Peroxide App.” The objective is to select the best experimental parameters-electrodes type and potential-for the maximization of hydrogen peroxide (H₂O₂) electrogeneration. In situ H₂O₂ generation has as an auxiliary function to be used in the advanced oxidative processes for the degradation of persistent organic pollutants and emerging contaminants, which are not treated by traditional chemical and biological processes. For the construction of the proposed software in this study, the data were initially correlated using the MATLAB® platform Fuzzy toolbox, and the expert knowledge and literature were associated by a desktop and mobile knowledge system that weighs the variables according to their impact on the electrogeneration productivity. The desktop end-user interface was coded using Microsoft Visual Studio Rapid Application Development, and the mobile app was developed on the Android platform similar to Peroxide 1.0, adopting the specifics and particularity of the programming system. The developed systems were validated in different laboratory scenarios, and their performance were considered satisfactory, in agreement with the literature. Therefore, it is concluded that the Peroxide 1.0 and Peroxide App models can be a significant contribution to and advance the improvement in the processes for all types of industries that generate chemical effluents and require their treatment based on oxidative processes that use H₂O₂. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

关键词： decision algorithm Environmental application Expert system Fuzzy Mathematical modeling

来源：评论

学校读者我要写书评

暂无评论

Four decision algorithms for Cognitive Agens Learning How to Cross an Intersection of Minor and Major Roads and Analysis of Their Performance

Four Decision Algorithms for Cognitive Agens Learning How to...

引用

作者： Song, Guanxi University of Guelph

学位级别：硕士

Cognitive agents can be used to simulate autonomous robots, which have the ability of perceiving, reasoning, judging and learning information and then reacting to this information and to the environment. In this thesis a model of simple cognitive agents learning to cross an intersection of minor and major roads is introduced. In the model the major and minor roads are modeled by cellular automata. The cars on the major road move in accordance with the modified rules of the Nagel-Schreckenberg model and the cognitive agents on the minor road learn to cross the major road using an observational social learning process. The thesis introduces four new decision algorithms for the cognitive agents to learn to cross the intersection and investigates cognitive agents' learning performance for these algorithms and for the realistic values of the car traffic parameters. The thesis investigates the effects of the model parameters on the cognitive agents' learning performance using various statistical performance indicators. Also, the thesis compares the performance of the four new decision algorithms with the performance of the previous decision formula used by the cognitive agents. The results obtained from the statistical analysis indicate that the four new decision algorithms have distinctively different performances for the different selection of the values of the model parameters.

关键词： Traffic Model Cognitive agents Learning decision algorithm

来源：评论

学校读者我要写书评

暂无评论

On Sorting by Flanked Transpositions 19th

On Sorting by Flanked Transpositions

引用

19th International Symposium on Bioinformatics Research and Applications

作者： Xu, Huixiu Tong, Xin Jiang, Haitao Wang, Lusheng Zhu, Binhai Zhu, Daming Shandong Univ Sch Comp Sci & Technol Qingdao Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Montana State Univ Gianforte Sch Comp Bozeman MT 59717 USA

ISBN: (纸本)9789819970735;9789819970742

Transposition is a well-known genome rearrangement event that switches two consecutive segments on a genome. The problem of sorting permutations by transpositions has attracted a great amount of interest since it was introduced by Bafna and Pevzner in 1995. However, empirical evidence has reported that, in many genomes, the participation of repeat segments is inevitable during genome evolution and the breakpoints where a transposition occurs are most likely accompanied by a triple of repeated segments. For example, a transposition will transform r x r y z r into r y z r x r, where r is a relative short repeat appearing three times and x and y are long segments involved in the transposition. For this transposition event, the neighbors of segments x and y remain the same before and after the transposition. This type of transposition is called flanked transposition. In this paper, we investigate the problem of sorting by flanked transpositions, which requires a series of flanked transpositions to transform one genome into another. First, we present an O(n) expected running time algorithm to determine if a genome can be transformed into the other genome by a series of flanked transposition for a special case, where each adjacency (roughly two neighbors of two element in the genome) appears once in both input genomes. We then extend the decision algorithm to work for the general case with the same expected running time O(n). Finally, we show that the new version, sorting by minimum number of flanked transpositions is also NP-hard.

关键词： Genome rearrangement flanked transpositions decision algorithm NP-hard

来源：评论

学校读者我要写书评

暂无评论

Dynamic nonlinear simplified neutrosophic sets for multiple-attribute group decision making

引用

HELIYON 2024年第5期10卷 e27493页

作者： Qiu, Junda Jiang, Linjia Fan, Honghui Li, Peng You, Congzhe Jiangsu Univ Technol Sch Comp Engn Changzhou 213001 Peoples R China Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China

In this paper, the concept of a dynamic nonlinear simplified neutrosophic set (DNSNS) is proposed for describing the real-time changing expert preference information. Furthermore, the DNSNS aggregation model and decision algorithm are provided to solve the actual multiple-attribute group decision making (MAGDM) problems. The basic notions, the similarity measure, the entropy measure, and the index of distance of DNSNS are presented first. Secondly, the univariate time series of DNSNS are projected into dynamic nonlinear simplified neutrosophic curves in three-dimensional space. The areas of the surface enclosed by the curves represent the variance among the DNSNSs. Thus, the DNSNS aggregation model is established correctly without preprocessing the original data. Afterward, the aggregation algorithm extended from the plant growth simulation algorithm (PGSA) is proposed for calculating the optimal aggregation preference curve and constructing the collective matrix. Additionally, a novel corresponding decision algorithm based on TOPSIS and projection theory is proposed for obtaining the overall ranking of alternatives in the actual MAGDM problem. Finally, a typical example is presented to illustrate the feasibility and effectiveness of the proposed model and algorithm.

关键词： Dynamic nonlinear simplified neutrosophic set Aggregation model Multiple -attribute group decision making decision algorithm TOPSIS

来源：评论

学校读者我要写书评

暂无评论

Propuestas para el control y la mitigacion de la diseminacion de COVID-19: un manejo estrategico de la enfermedad

引用

REVISTA ARGENTINA DE MICROBIOLOGIA 2022年第2期54卷 125-133页

作者： Rivero, Mariano Gutierrez-Cacciabue, Dolores Rajal, Veronica Beatriz Irazusta, Veronica Patricia Univ Nacl Salta UNSa Inst Invest Ind Quim INIQUI Consejo Nacl Invest Cient & Tecn CONICET Salta Argentina UNSa Fac Ingn Salta Argentina Nanyang Technol Univ Singapore Ctr Environm Life Sci Engn SCELSE Nanyang Singapore UNSa Fac Ciencias Nat Salta Argentina

The rapid spread of COVID-19 throughout the world, has led most of the affected countries to close their borders and implement some form of lockdown. Six months after the pandemic started, many countries made decisions tending to relax the lockdown, although without a vaccine or treatment capable of confronting SARS-CoV-2 infection, the situation could be reversed at any time. In this context, the aim of this work was to propose a decision algorithm that will allow to optimize asymptomatic case detections and strategically manage quarantine to prevent the spread of the virus and drive the transition to a managed new normal. This tentative proposal was developed for optimizing and ordering the number of tests for the detection of SARS-CoV-2, analyzing composite samples (group analysis) combining with those samples individually taken from asymptomatic members of cohorts of interest. Cohorts were defined according to their critical role in society and/or their vulnerability. The algorithm includes variables such as cohort priority, number of cohort members in the analysis groups, intra-and intergroup contact, vulnerability to contagion due to the activity performed, and time elapsed since last testing. The proposed tool was illustrated with defined hypothetical cohorts, in which, for the sake of simplification, only one analysis group was considered. The application of this tool allowed to establish in a rational way a priority order to test critical groups in society. Furthermore, this tool would help to optimize resources, reducing the impact on a region???s and

关键词： decision algorithm Quarantine COVID-19 Lockdown SARS-CoV-2

来源：评论

学校读者我要写书评

暂无评论

Research on Intelligent Training Learning Terminal System Based on Computer Big Data 6

Research on Intelligent Training Learning Terminal System Ba...

引用

2023 IEEE 6th International Conference on Information Systems and Computer Aided Education, ICISCAE 2023

作者： Yihai, Zhang Chengliang, Zhang Hui, Jin Jun, Liu Guiyang Branch of Guizhou Tobacco Company Guizhou Guiyang550000 China Anshun University Guizhou Anshun561000 China

ISBN: (纸本)9798350313444

This paper designs a process simulation training support system based on microcomputer LAN development. This paper mainly introduces the information interaction technology used in the system to realize the distributed real-time simulation of the running layer. In this paper, a new machine learning model training mode for mobile terminal privacy data is proposed. All the training tasks related to user privacy data are deployed on local terminal devices. There is no need for users to upload data in any form to protect user privacy. System simulation shows that the training system can improve the training efficiency of students. © 2023 IEEE.

关键词： Big data decision algorithm intelligent training system learning terminal

来源：评论

学校读者我要写书评

暂无评论

Deciding the point-to-fixed-point problem for skew tent maps on an interval

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2021年 115卷 113-120页

作者： Kuijpers, Bart Hasselt Univ Databases & Theoret Comp Sci Grp Hasselt Belgium Hasselt Univ Data Sci Inst Hasselt Belgium

We consider a family of skew tent maps f(a) on the unit interval, determined by the parameter a, with 0 < a < 1. We give a decision procedure, that on input a and a point x(0) in the unit interval, determines whether or not the sequence x(0), f(a)(x(0)), f(a)(2)(x(0)), ... of iterates of f(a) on x(0) reaches one of the two fixed points of f(a) after a finite number of iterations. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Dynamic systems decision algorithm Fixed points

来源：评论

学校读者我要写书评

暂无评论

A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams

引用

INFORMATION SCIENCES 2021年 578卷 236-256页

作者： Senturk, Ibrahim Gursoy, Necla Kircali Oner, Tahsin Gursoy, Arif Ege Univ Fac Sci Dept Math TR-35040 Izmir Turkey Ege Univ Tire Kutsan Vocat Training Sch TR-35900 Izmir Turkey

In this work, with the help of a calculus system syllogistic logic with Carroll's diagrams (SLCD), we construct a useful algorithm for the possible deductions of polysyllogisms (soriteses). This algorithm makes a general deduction in categorical syllogisms with the help of diagrams to depict each proposition of polysyllogisms. The developed calculus system PolySLCD (PSLCD) is used to allow a formal deduction from premises set by comprising synchronically biliteral and triliteral diagrammatical appearance and simple algorithmic nature. This algorithm can be used to deduce new conclusions, step by step, through recursive conclusion sets that are obtained from premises of categorical polysyllogisms. The fundamental contributions of this paper are accurately deducing conclusions from sets corresponding to given premises as exact human reasoning using a single algorithm and designing this algorithm based on SLCD. Therefore, it is more suitable for computer aided solution. Since the algorithm is set-based, it is a novel algorithm in the literature and it can easily contribute to the researchers using polysyllogisms in different scientific branches, such as computer science, decision-making systems and artificial intelligence. (c) 2021 Elsevier Inc. All rights reserved.

关键词： Polysyllogism decision algorithm Validity Deduction Carroll's diagrammatic system

来源：评论

学校读者我要写书评

暂无评论

Revisiting the Fréchet distance between piecewise smooth curves

引用

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2025年 129卷

作者： Conradi, Jacobus Driemel, Anne Kolbe, Benedikt Univ Bonn Dept Comp Sci Bonn Germany Univ Bonn Lamarr Inst Machine Learning & Artificial Intellig Hausdorff Ctr Math Bonn Germany

Since its introduction to computational geometry by Alt and Godau in 1992, the Fr & eacute;chet distance has been a mainstay of algorithmic research on curve similarity computations. The focus of the research has been on comparing polygonal curves, with the notable exception of an algorithm for the decision problem for planar piecewise smooth curves due to Rote (2007). We present an algorithm for the decision problem for piecewise smooth curves that is both conceptually simpler and naturally extends to the first algorithm for the problem for piecewise smooth curves in Rd. We assume that the algorithm is given two continuous curves, each consisting of a sequence of m, resp. n, smooth pieces, where each piece belongs to a sufficiently wellbehaved class of curves, such as the set of algebraic curves of bounded degree. We introduce a decomposition of the free space diagram into a controlled number of pieces that can be used to solve the decision problem similarly to the polygonal case, in O (mn) time, leading to a computation of the Fr & eacute;chet distance that runs in O(mnlog(mn)) time. Furthermore, we study approximation algorithms for piecewise smooth curves that are also c-packed for some fixed value c. We adapt the existing framework for polygonal curves that leads to a near-linear (1 + epsilon)-approximation to the Fr & eacute;chet distance to the setting of piecewise smooth curves. (c) 2025 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Fr & eacute chet distance Piecewise smooth curves decision algorithm

来源：评论

学校读者我要写书评

暂无评论

A new algorithmic decision for categorical syllogisms via Carroll's diagrams

引用

SOFT COMPUTING 2020年第15期24卷 11337-11346页

作者： Kircali Gursoy, Necla Senturk, Ibrahim Oner, Tahsin Gursoy, Arif Ege Univ Dept Math Fac Sci Izmir Turkey Ege Univ Tire Kutsan Vocat Sch Izmir Turkey

In this paper, we propose a new effective algorithm for the categorical syllogisms by using a calculus system Syllogistic Logic with Carroll Diagrams, which determines a formal approach to logical reasoning with diagrams, for representations of the fundamental Aristotelian categorical syllogisms. We show that this logical reasoning is closed under the syllogistic criterion of inference. Therefore, the calculus system is implemented to let the formalism which comprises synchronically bilateral and trilateral diagrammatical appearance and naive algorithmic nature. And also, there is no need specific knowledge or exclusive ability to understand this decision procedure as well as to use it in an algorithmic system. Consequently, the empirical contributions of this paper are to design a polynomial-time algorithm at the first time in the literature to conduce to researchers getting into the act in different areas of science used categorical syllogisms such as artificial intelligence, engineering, computer science and etc.

关键词： Categorical syllogism Validity Deduction decision algorithm Complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：