7,121 results
Search Results
2. Exam paper generation based on performance prediction of student group
- Author
-
Chenjie Mao, Changqin Huang, Tao He, and Zhengyang Wu
- Subjects
Information Systems and Management ,Computer science ,media_common.quotation_subject ,02 engineering and technology ,Machine learning ,computer.software_genre ,Theoretical Computer Science ,Task (project management) ,Artificial Intelligence ,ComputingMilieux_COMPUTERSANDEDUCATION ,0202 electrical engineering, electronic engineering, information engineering ,Performance prediction ,Quality (business) ,media_common ,business.industry ,05 social sciences ,050301 education ,Computer Science Applications ,Control and Systems Engineering ,020201 artificial intelligence & image processing ,Artificial intelligence ,Focus (optics) ,business ,0503 education ,computer ,Software ,Student group - Abstract
Exam paper generation is an indispensable part of teaching. Existing methods focus on the use of question extraction algorithms with labels for each question provided. Obviously, manual labeling is inefficient and cannot avoid label bias. Furthermore, the quality of the exam papers generated by the existing methods is not guaranteed. To address these problems, we propose a novel approach to generating exam papers based on prediction of exam performance. As such, we update the quality of the initially generated questions one by using dynamic programming, as well as in batches by using genetic algorithms. We performed the prediction task by using Deep Knowledge Tracing. Our approach considered the skill weight, difficulty, and distribution of exam scores. By comparisons, experimental results indicate that our approach performed better than the two baselines. Furthermore, it can generate exam papers with adaptive difficulties closely to the expected levels, and the related student exam scores will be guaranteed to be relatively reasonable distribution. In addition, our approach was evaluated in a real learning scenarios and shows advantages.
- Published
- 2020
3. SimCC: A novel method to consider both content and citations for computing similarity of scientific papers
- Author
-
Masoud Reyhani Hamedani, Sang-Wook Kim, and Dong-Jin Kim
- Subjects
Scheme (programming language) ,Information Systems and Management ,Information retrieval ,Relation (database) ,Computer science ,05 social sciences ,050905 science studies ,Computer Science Applications ,Theoretical Computer Science ,Weighting ,Similarity (network science) ,Artificial Intelligence ,Control and Systems Engineering ,Content (measure theory) ,Relevance (information retrieval) ,0509 other social sciences ,050904 information & library sciences ,Citation ,computer ,Software ,computer.programming_language - Abstract
To compute the similarity of scientific papers, text-based similarity measures, link-based similarity measures, and hybrid methods can be applied. The text-based and link-based similarity measures take into account only a single aspect of scientific papers, content or citations, respectively. The hybrid methods consider both content and citations; however, they do not carefully consider the relation between the content of a pair of papers involved in a citation relationship. In this paper, we propose a novel method, SimCC (similarity based on content and citations), that considers both aspects, content and citations, to compute the similarity of scientific papers. Unlike previous methods, SimCC effectively reflects both content and authority of scientific papers simultaneously in similarity computation by applying a new RA (relevance and authority) weighting scheme. Also, we propose an RA+R weighting scheme to consider the recency of papers and an RA+E weighting scheme to take into account the author expertise of papers in similarity computation. The effectiveness of our proposed method is demonstrated by extensive experiments on a real-world dataset of scientific papers. The results show that our method achieves more than 100% improvement in accuracy in comparison with previous methods.
- Published
- 2016
4. Why are papers about filters on residuated structures (usually) trivial?
- Author
-
Martin Víta
- Subjects
Pure mathematics ,Information Systems and Management ,Property (philosophy) ,Generalization ,Extension (predicate logic) ,Computer Science Applications ,Theoretical Computer Science ,Algebra ,Artificial Intelligence ,Control and Systems Engineering ,Simple (abstract algebra) ,Filter (mathematics) ,Residuated lattice ,Software ,Quotient ,Mathematics - Abstract
In this paper we introduce a notion of a t-filter on residuated lattices which is a generalization of several special types of filters. We provide some basic properties of t-filters and show how particular results about special types of filters (e.g. Extension property, Triple of equivalent characteristics, and Quotient characteristics) are uniformly covered by this simple general framework.
- Published
- 2014
5. Using semi-structured data for assessing research paper similarity
- Author
-
Helga Naessens, Germán Hurtado Martín, Steven Schockaert, and Chris Cornelis
- Subjects
Information Systems and Management ,Information retrieval ,Computer science ,Latent Dirichlet allocation ,Computer Science Applications ,Theoretical Computer Science ,Task (project management) ,symbols.namesake ,Artificial Intelligence ,Control and Systems Engineering ,Explicit semantic analysis ,Similarity (psychology) ,symbols ,Vector space model ,Semi-structured data ,Language model ,Adaptation (computer science) ,Software - Abstract
The task of assessing the similarity of research papers is of interest in a variety of application contexts. It is a challenging task, however, as the full text of the papers is often not available, and similarity needs to be determined based on the papers' abstract, and some additional features such as their authors, keywords, and the journals in which they were published. Our work explores several methods to exploit this information, first by using methods based on the vector space model and then by adapting language modeling techniques to this end. In the first case, in addition to a number of standard approaches we experiment with the use of a form of explicit semantic analysis. In the second case, the basic strategy we pursue is to augment the information contained in the abstract by interpolating the corresponding language model with language models for the authors, keywords and journal of the paper. This strategy is then extended by revealing the latent topic structure of the collection using an adaptation of Latent Dirichlet Allocation, in which the keywords that were provided by the authors are used to guide the process. Experimental analysis shows that a well-considered use of these techniques significantly improves the results of the standard vector space model approach.
- Published
- 2013
6. A note on the paper 'A multi-population harmony search algorithm with external archive for dynamic optimization problems' by Turky and Abdullah
- Author
-
Mohammad Reza Meybodi, Amir Ehsan Ranginkaman, Javidan Kazemi Kordestani, and Alireza Rezvanian
- Subjects
Scheme (programming language) ,Information Systems and Management ,Optimization problem ,Point (typography) ,Computer science ,business.industry ,Computer Science Applications ,Theoretical Computer Science ,Dynamic problem ,Artificial Intelligence ,Control and Systems Engineering ,Multi population ,Benchmark (computing) ,Harmony search ,Artificial intelligence ,business ,computer ,Software ,computer.programming_language - Abstract
In a very recently presented paper, Turky and Abdullah 5 proposed a novel multi-population harmony search with external archive (MHSA-ExtArchive) for dynamic optimization problems. In the experimental results, the authors claimed that their approach could outperform several state-of-the-art algorithms. They also showed the superiority of their method by means of numerical experiments on Moving Peaks Benchmark (MPB). Despite the interesting idea of applying multi-population scheme on harmony search and using a new type of external archive for dealing with dynamic problems, we believe that there are two very important shortcomings in the result analysis, which we point out in this short note. The main motivation of the present note is to contribute toward preventing the same mistakes from happening by the other researchers.
- Published
- 2014
7. A note on the paper: Optimizing web servers using page rank prefetching for clustered accesses
- Author
-
Wai-Ki Ching
- Subjects
World Wide Web ,Web server ,Information Systems and Management ,Artificial Intelligence ,Control and Systems Engineering ,Computer science ,Page rank ,computer.software_genre ,computer ,Software ,Computer Science Applications ,Theoretical Computer Science - Abstract
In this short note, we briefly present and discuss an example of page rank algorithm given in [Information Sciences 150 (2003) 165-176].
- Published
- 2005
8. A short technical paper: Determining whether a vote assignment is dominated
- Author
-
David Mutchler and Sushil Jajodia
- Subjects
Information Systems and Management ,Operations research ,Computer science ,media_common.quotation_subject ,Computer Science Applications ,Theoretical Computer Science ,Artificial Intelligence ,Control and Systems Engineering ,Voting ,Mutual exclusion ,Meaning (existential) ,Mathematical economics ,Software ,media_common - Abstract
One way to achieve mutual exclusion in a distributed system is to assign votes to each site in the system. If the total number of votes is odd, the assignment is known to be nondominated, meaning that no other assignment can provide strictly greater access and still achieve mutual exclusion. We characterize in this note dominated even-totaled vote assignments. As a consequence, we obtain that the problem of determining whether an even-totaled vote assignment is dominated is trivial if each site is assigned exactly one vote; however, the problem is NP-complete in general.
- Published
- 1991
9. Call for papers: Special Issue on Graph Theory and Applications
- Author
-
Chung-Kung Yen and Paul P. Wang
- Subjects
Information Systems and Management ,Artificial Intelligence ,Control and Systems Engineering ,Computer science ,Management science ,Library science ,Graph theory ,Software ,Information science ,Computer Science Applications ,Theoretical Computer Science - Published
- 2004
10. Some remarks on a paper by R. R. Yager
- Author
-
Erich Peter Klement
- Subjects
Pure mathematics ,Information Systems and Management ,Artificial Intelligence ,Control and Systems Engineering ,Additive function ,Point (geometry) ,Monotonic function ,Fuzzy logic ,Software ,Computer Science Applications ,Theoretical Computer Science ,Mathematics - Abstract
We show that slight technical changes in the definition transform the probability of fuzzy events introduced by R. R. Yager [16] into a new concept of such probabilities having nice properties, both from an intuitive and from a mathematical point of view: monotonicity, additivity, and continuity.
- Published
- 1982
11. Corrections to the paper 'the identification of the parameters of time-invariant stochastic systems by a method derived from the continuous-time kalman filter'
- Author
-
M.W.A. Smith and A.P. Roberts
- Subjects
Information Systems and Management ,Computer science ,Invariant extended Kalman filter ,Computer Science Applications ,Theoretical Computer Science ,Extended Kalman filter ,Artificial Intelligence ,Control and Systems Engineering ,Nonlinear filter ,Control theory ,Filtering problem ,Fast Kalman filter ,Ensemble Kalman filter ,Unscented transform ,Alpha beta filter ,Software - Published
- 1980
12. An enhanced multi-objective biogeography-based optimization for overlapping community detection in social networks with node attributes
- Author
-
Ali Reihanian, Mohammad-Reza Feizi-Derakhshi, and Hadi S. Aghdasi
- Subjects
Social and Information Networks (cs.SI) ,FOS: Computer and information sciences ,Information Systems and Management ,Artificial Intelligence ,Control and Systems Engineering ,Computer Science - Neural and Evolutionary Computing ,Computer Science - Social and Information Networks ,Neural and Evolutionary Computing (cs.NE) ,Software ,Computer Science Applications ,Theoretical Computer Science - Abstract
Community detection is one of the most important and interesting issues in social network analysis. In recent years, simultaneous considering of nodes' attributes and topological structures of social networks in the process of community detection has attracted the attentions of many scholars, and this consideration has been recently used in some community detection methods to increase their efficiencies and to enhance their performances in finding meaningful and relevant communities. But the problem is that most of these methods tend to find non-overlapping communities, while many real-world networks include communities that often overlap to some extent. In order to solve this problem, an evolutionary algorithm called MOBBO-OCD, which is based on multi-objective biogeography-based optimization (BBO), is proposed in this paper to automatically find overlapping communities in a social network with node attributes with synchronously considering the density of connections and the similarity of nodes' attributes in the network. In MOBBO-OCD, an extended locus-based adjacency representation called OLAR is introduced to encode and decode overlapping communities. Based on OLAR, a rank-based migration operator along with a novel two-phase mutation strategy and a new double-point crossover are used in the evolution process of MOBBO-OCD to effectively lead the population into the evolution path. In order to assess the performance of MOBBO-OCD, a new metric called alpha_SAEM is proposed in this paper, which is able to evaluate the goodness of both overlapping and non-overlapping partitions with considering the two aspects of node attributes and linkage structure. Quantitative evaluations reveal that MOBBO-OCD achieves favorable results which are quite superior to the results of 15 relevant community detection algorithms in the literature., 1. This paper has been published in the journal of "Information Sciences". 2. https://doi.org/10.1016/j.ins.2022.11.125
- Published
- 2023
13. Computing alignments with maximum synchronous moves via replay in coordinate planes
- Author
-
Hui Yan, Uzay Kaymak, Pieter Van Gorp, Xudong Lu, Shan Nan, Huilong Duan, Information Systems IE&IS, JADS Den Bosch (TU/e), JADS Research, EAISI Foundational, EAISI Health, and Signal Processing Systems
- Subjects
Event logs ,Information Systems and Management ,Synchronous moves ,Artificial Intelligence ,Control and Systems Engineering ,Business process models ,Heuristic strategy ,Conformance check ,Software ,Computer Science Applications ,Theoretical Computer Science ,Optimal alignments - Abstract
Optimal alignments are the basis of conformance checking. For long, researchers have been devoted to the efficiency issue of computing optimal alignments. This paper focuses on the optimality issue. Specifically, we aim to find alignments with maximum synchronous moves and minimum deviations. This paper introduces a coordinate-plane search space, which allows enumerating all the possible alignments. The alignments with maximum synchronous moves are translated into the lowest-cost paths, such that heuristic strategies (such as the Dijkstra algorithm) can be applied. Both theoretical proof and experimental results show that 100% optimality can be achieved.
- Published
- 2022
14. Bayesian optimization based dynamic ensemble for time series forecasting
- Author
-
Du, Liang, Gao, Ruobin, Suganthan, Ponnuthurai Nagaratnam, Wang, David Zhi Wei, School of Civil and Environmental Engineering, and School of Electrical and Electronic Engineering
- Subjects
Forecast Combination ,Information Systems and Management ,Civil engineering [Engineering] ,Time Series Forecasting ,Artificial Intelligence ,Control and Systems Engineering ,Software ,Computer Science Applications ,Theoretical Computer Science - Abstract
Among various time series (TS) forecasting methods, ensemble forecast is extensively acknowledged as a promising ensemble approach achieving great success in research and industry. Due to the high diversification of individual model assumptions, heterogeneous information fusion contributes to generating effective and robust forecasts for Economics, Meteorology, and Transportation. This paper proposes a Bayesian optimization-based dynamic ensemble (BODE) that overcomes the single model-based methods limitation and provides a dynamic ensemble forecast combination for TS with time-varying underlying patterns. The proposed BODE method combines ten disparate model candidates, including statistical methods, machine learning (ML)-based models, and the latest deep neural networks (DNN). We take into consideration their prediction performance for the recent past to adjust their weights for combination and apply the model-based Bayesian optimization algorithm (BOA) for the combination hyperparameter (HP) tuning to endow our method with higher adaptability and better generalization performance. Besides, the frequency impact of TS data on the ensemble forecast methods is under-researched in the current literature. Therefore, four groups of distinct seasonal TS datasets are investigated in this paper. The empirical result demonstrates that our method performs robustly better performance with the main reasons analyzed in a detailed ablation study.
- Published
- 2022
15. Policy Iteration Reinforcement Learning-based control using a Grey Wolf Optimizer algorithm
- Author
-
Raul-Cristian Roman, Radu-Emil Precup, Iuliu Alexandru Zamfirache, and Emil M. Petriu
- Subjects
0209 industrial biotechnology ,Information Systems and Management ,Optimization problem ,Artificial neural network ,Computer science ,Particle swarm optimization ,02 engineering and technology ,Servomechanism ,Computer Science Applications ,Theoretical Computer Science ,law.invention ,020901 industrial engineering & automation ,Artificial Intelligence ,Control and Systems Engineering ,law ,Convergence (routing) ,0202 electrical engineering, electronic engineering, information engineering ,Reinforcement learning ,020201 artificial intelligence & image processing ,Gradient descent ,Algorithm ,Metaheuristic ,Software - Abstract
This paper presents a new Reinforcement Learning (RL)-based control approach that uses the Policy Iteration (PI) and a metaheuristic Grey Wolf Optimizer (GWO) algorithm to train the Neural Networks (NNs). Due to an efficient tradeoff to exploration and exploitation, the GWO algorithm shows good results in NN training and solving complex optimization problems. The proposed approach is compared to the classical PI RL-based control approach using the Gradient Descent (GD) algorithm, and with the RL-based control approach which uses the metaheuristic Particle Swarm Optimization (PSO) algorithm. The experiments are conducted using a nonlinear servo system laboratory equipment. Each approach evaluated on how well it solves the optimal reference tracking control for an experimental servo system position control system. The policy NNs specific to all three approaches are implemented as state feedback with integrator controllers to remove the steady-state control errors and thus ensure the convergence of the objective function. Because of the random nature of metaheuristic algorithms, the experiments for GWO and PSO algorithms are run multiple times and the results are averaged before the conclusions are presented. The experimental results shows that for the control objective considered in this paper, the GWO algorithm represents a better solution compared to GD and PSO algorithms.
- Published
- 2022
16. Survival functions versus conditional aggregation-based survival functions on discrete space
- Author
-
Borzová Jana, Halčinová Lenka, and Basarik Stanislav
- Subjects
Mathematical theory ,Information Systems and Management ,Survival function ,Artificial Intelligence ,Control and Systems Engineering ,Discrete space ,Applied mathematics ,State (functional analysis) ,Characterization (mathematics) ,Software ,Computer Science Applications ,Theoretical Computer Science ,Mathematics - Abstract
In this paper we deal with conditional aggregation-based survival functions recently introduced by Boczek et al. (2020). The concept is worth to study because of its possible implementation in real-life situations and mathematical theory as well. The aim of this paper is the comparison of this new notion with the standard survival function. We state sufficient and necessary conditions under which the generalized and the standard survival function equal. The main result is the characterization of the family of conditional aggregation operators (on discrete space) for which these functions coincide.
- Published
- 2022
17. Analysing monotonicity in non-deterministic computable aggregations: The probabilistic case
- Author
-
Luis Garmendia, Luis Magdalena, Javier Montero, and Daniel Gómez
- Subjects
Information Systems and Management ,Theoretical computer science ,Generalization ,Process (engineering) ,Computer science ,Probabilistic logic ,Monotonic function ,Sample (statistics) ,Function (mathematics) ,Extension (predicate logic) ,Computer Science Applications ,Theoretical Computer Science ,Artificial Intelligence ,Control and Systems Engineering ,Key (cryptography) ,Software - Abstract
The idea of computable aggregation operators was introduced as a generalization of aggregation operators, allowing the replacement of the mathematical function usually considered for aggregation, by a program that performs the aggregation process. There are different reasons to justify this extension. One of them is the interest in exploring some computational properties not directly related to the aggregation itself but to its implementation (complexity, recursivity, parallelisation, etc). Another reason, the one driving to the present paper, is the need to define a framework where the quite common process of first sampling (over a large data set) and then aggregating the sample, could be analysed as a formal aggregation process. This process does not match with the idea of an aggregation function, due to its non-deterministic nature, but could easily be adapted to that of a (non-deterministic) computable aggregation. The idea of non-deterministic aggregation requires the extension of the concept of monotonicity (a key aspect of aggregation operators) to this new framework. The present paper will explore this kind of non-deterministic aggregation processes, first from an empirical point of view and then in terms of populations, adapting the idea of monotonicity to both of them and finally defining a common framework for its analysis.
- Published
- 2022
18. The strategy of modeling and solving the problems described by Laplace’s equation with uncertainly defined boundary shape and boundary conditions
- Author
-
Eugeniusz Zieniuk and Marta Czupryna
- Subjects
Laplace's equation ,Information Systems and Management ,Laplace transform ,Boundary (topology) ,Interval (mathematics) ,Integral equation ,Computer Science Applications ,Theoretical Computer Science ,Interval arithmetic ,Artificial Intelligence ,Control and Systems Engineering ,Applied mathematics ,Measurement uncertainty ,Boundary value problem ,Software ,Mathematics - Abstract
This paper presents a new method for simultaneous modeling the uncertainty of measurement data (necessary to define the boundary shape and boundary conditions) in boundary problems. The interval parametric integral equation system (interval PIES) was developed for solving boundary problems with input data defined in this way. The motivation for conducting this research was that this topic (simultaneous consideration of uncertainties of all input data) has appeared sporadically in the literature (mainly with uncertainly defined boundary conditions or other parameters). In this paper, the uncertainty was defined using interval numbers and modeled using interval arithmetic. The direct application of both classical and directed interval arithmetic caused the overestimation and obtained solutions were useless in practice. Therefore, modification of the directed interval arithmetic was developed. The reliability of the interval PIES solutions obtained using such arithmetic was verified on 2D problems described by Laplace’s equation. The solutions were compared with the interval analytical solutions (differently obtained), as well as with the solutions of exactly defined (without the uncertainty) numerical methods. All performed tests indicated the high potential of the method. Obtained interval solutions occurred to be less overestimated and not as time-consuming as presented alternative methods.
- Published
- 2022
19. A survey on facial emotion recognition techniques: A state-of-the-art literature review
- Author
-
Jhennifer Cristine Matias, Gustavo Gino Scotton, Tobias Rossi Müller, Eliane Pozzebon, Felipe Zago Canal, Antonio Carlos Sobieranski, and Antonio Reis de Sá Junior
- Subjects
Facial expression ,Information Systems and Management ,Artificial neural network ,business.industry ,Generalization ,Computer science ,Scopus ,Digital library ,computer.software_genre ,Computer Science Applications ,Theoretical Computer Science ,Systematic review ,Categorization ,Artificial Intelligence ,Control and Systems Engineering ,Natural (music) ,Artificial intelligence ,business ,computer ,Software ,Natural language processing - Abstract
In this survey, a systematic literature review of the state-of-the-art on emotion expression recognition from facial images is presented. The paper has as main objective arise the most commonly used strategies employed to interpret and recognize facial emotion expressions, published over the past few years. For this purpose, a total of 51 papers were analyzed over the literature totaling 94 distinct methods, collected from well-established scientific databases (ACM Digital Library, IEEE Xplore, Science Direct and Scopus), whose works were categorized according to its main construction concept. From the analyzed works, it was possible to categorize them into two main trends: classical and those approaches specifically designed by the use of neural networks . The obtained statistical analysis demonstrated a marginally better recognition precision for the classical approaches when faced to neural networks counterpart, but with a reduced capacity of generalization . Additionally, the present study verified the most popular datasets for facial expression and emotion recognition showing the pros and cons each and, thereby, demonstrating a real demand for reliable data-sources regarding artificial and natural experimental environments.
- Published
- 2022
20. Stabilization of complex-valued stochastic coupled systems with multiple time delays and regime-switching jump diffusion via periodically intermittent control
- Author
-
Zhen Guan, Yan Liu, and Wentao Xu
- Subjects
Lyapunov function ,Information Systems and Management ,Computer science ,Jump diffusion ,Intermittent control ,Graph theory ,Regime switching ,Stability (probability) ,Computer Science Applications ,Theoretical Computer Science ,symbols.namesake ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,Multiple time ,symbols ,Realization (systems) ,Software - Abstract
This paper is concerned with the stabilization of complex-valued stochastic coupled systems possessing multiple time delays and regime-switching jump diffusion (RSJD) via periodically intermittent control. Moreover, most of the existing results about RSJD are considered in real-valued cases, which is extended to complex-valued cases in this paper. Combining the Lyapunov method with the graph theory, some sufficient conditions can be obtained, which reflect that the realization of stability is related to stochastic disturbance strength, coupling strength and control rate. Additionally, the theoretical results are applied to complex-valued stochastic coupled oscillators with multiple time delays and RSJD. In the end, some simulation results are presented to demonstrate the validity and availability of the theoretical results.
- Published
- 2022
21. Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- Author
-
Jueyou Li, Zhiyou Wu, Tingwen Huang, and Xiaomei Zhu
- Subjects
Sequence ,Information Systems and Management ,Computer science ,Swarm behaviour ,Regret ,Variation (game tree) ,Function (mathematics) ,ComputingMethodologies_ARTIFICIALINTELLIGENCE ,Computer Science Applications ,Theoretical Computer Science ,Dual (category theory) ,Artificial Intelligence ,Control and Systems Engineering ,Convex optimization ,Benchmark (computing) ,Algorithm ,Software - Abstract
The paper deals with online distributed convex optimization over a multi-agent network, where a swarm of agents attempts to minimize coordinately a sequence of time-changing global loss functions. At per time slot, the global loss function is decomposed into a sum of several local loss functions, each of which is available sequentially and held privately by one agent over the network, and individual agent does not possess prior knowledge of the future global loss function. We are interested in a bandit setting, where only the values of local loss functions at queried points are disclosed to individual agent. Meanwhile, we consider a general multi-agent network where the agents’ communication is represented as a sequence of time-changing unbalanced digraphs and the corresponding weight matrices are only row stochastic. We investigate two bandit scenarios including one- and two-point bandit feedback, and then design two corresponding online distributed bandit algorithms for such a class of problems by exploiting the classical dual averaging method. We show that both algorithms can achieve the sub-linear expected dynamic regret provided that the accumulative variation of the benchmark sequence grows sub-linearly with time. In particular, the bounds of the expected static regret obtained in this paper can reduce the relevant results when restricted to the centralized bandit online convex optimization. In contrast to existing algorithms with gradient feedback, numerical tests verify the competitive performances of the proposed algorithms.
- Published
- 2021
22. Multi-agent machine learning in self-organizing systems
- Author
-
Ehsan Hejazi
- Subjects
Structure (mathematical logic) ,Self-organization ,Information Systems and Management ,Artificial neural network ,business.industry ,Computer science ,media_common.quotation_subject ,Stability (learning theory) ,Computer Science Applications ,Theoretical Computer Science ,Variety (cybernetics) ,Task (project management) ,Artificial Intelligence ,Control and Systems Engineering ,Artificial intelligence ,Function (engineering) ,business ,Transfer of learning ,Software ,media_common - Abstract
This paper develops a novel insight and procedure that includes a variety of algorithms for finding the best solution in a structured multi-agent system with internal communications and a global purpose. In other words, it finds the optimal communication structure among agents and the optimal policy in this structure. First, a unique reinforcement learning algorithm is proposed to find the optimal policy of each agent in a fixed structure with non-linear function approximators like artificial neural networks (ANN) and with eligibility traces. Secondly, a mechanism is presented to perform self-organization based on the information of the learned policy. Finally, an algorithm that can discover an appropriate inter-structure mapping and then can transfer the previous knowledge to the new structure is developed, which increases the speed of the learning in this new environment after self-organization. This paper is one of the first works that analyzes the problem fully theoretically and devises some algorithms to find the best solution. We use a simplified version of the distributed task allocation problem (DTAP) as our case study. The experimental results verify the stability of our approach and show the high speed of finding the optimal solution as a result of using transfer learning .
- Published
- 2021
23. Subgraph matching on temporal graphs
- Author
-
Zhaonian Zou and Faming Li
- Subjects
Structure (mathematical logic) ,Information Systems and Management ,Matching (graph theory) ,Computer science ,Computer Science Applications ,Theoretical Computer Science ,Set (abstract data type) ,Artificial Intelligence ,Control and Systems Engineering ,Enumeration ,Key (cryptography) ,Timestamp ,Enhanced Data Rates for GSM Evolution ,Algorithm ,Software ,Blossom algorithm ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
Temporal graphs are graphs whose edges are associated with timestamps. Subgraph matching on temporal graphs retrieves temporal subgraphs whose edge timestamps satisfy user-specified temporal orders. In this paper, a temporal query pattern is composed of a query graph with an arbitrary structure and a partial order on the edge set of the query graph. Moreover, the time span between the minimum and the maximum edge timestamps in a matching is required to be less than or equal to a specified threshold. This paper proposes a temporal subgraph matching algorithm based on two key techniques. First, a memory-efficient index structure called TO-tree is designed to compactly store all necessary information required for finding all temporal subgraph matchings. The TO-tree constructed for a temporal query pattern is much smaller than the temporal graph because unnecessary information is mostly excluded from the TO-tree by three powerful filters. The second technique is a temporal subgraph matching enumeration method that runs on the TO-tree instead of on the temporal graph. This enumeration method expands temporal subgraph matchings in an edge-by-edge manner. Since the TO-tree can fit into the main memory, the enumeration method runs very fast on the TO-tree. An extensive experimental evaluation has been carried out. The experimental results show that the TO-tree index structure is memory-efficient, which in turn enables a fast temporal subgraph matching enumeration. Overall, our algorithm is at least 3X faster than the baseline algorithm adapted from the state-of-the-art non-temporal subgraph matching algorithm CECI and is at least 4X faster than the temporal subgraph matching algorithm HASSE .
- Published
- 2021
24. Jointly evolving and compressing fuzzy system for feature reduction and classification
- Author
-
Hai-Jun Rong, Zhao-Xu Yang, Hui Huang, and Chi-Man Vong
- Subjects
Information Systems and Management ,Fuzzy rule ,Generalization ,Computer science ,Random projection ,Fuzzy control system ,Fuzzy logic ,Computer Science Applications ,Theoretical Computer Science ,Reduction (complexity) ,Matrix (mathematics) ,Artificial Intelligence ,Control and Systems Engineering ,Feature (machine learning) ,Algorithm ,Software - Abstract
Evolving fuzzy systems (EFSs) are a type of adaptive fuzzy rule-based systems which can self-adapt both their structures and parameters simultaneously. However, the existing EFSs suffer from two drawbacks: 1) classical EFSs usually use all input features to model systems, resulting in lengthy fuzzy rules; 2) some redundant information in fuzzy rules may hinder high generalization . To address these two issues, a promising method is proposed in this paper by combining very sparse random projection (VSRP) with a class of EFSs based-on data clouds, called VSRP-AnYa-EFS. The proposed method introduces: 1) a random sparse-Bernoulli (RSB) matrix based-on VSRP is utilized to compress the lengthy antecedent part into a tighter form, triggering a feature-reduction mechanism. By employing VSRP in RSB matrix, some redundant information in fuzzy rules can be filtered; 2) Local learning is used for consequent parameter optimization to suit decoupled behavior of rules after redundant information between rules is deleted. By adopting VSRP and local learning, the proposed VSRP-AnYa-EFS owns a compact structure and fast learning speed. Numerical examples presented in this paper demonstrate that the proposed method can significantly reduce training time from hours to minutes while the accuracy can be improved up to 5%.
- Published
- 2021
25. A novel three-way decision approach under hesitant fuzzy information
- Author
-
Jianming Zhan, Jianhua Dai, Xueling Ma, and Jiajia Wang
- Subjects
Mathematical optimization ,Information Systems and Management ,Ideal (set theory) ,Computer science ,Conditional probability ,Function (mathematics) ,Fuzzy logic ,Computer Science Applications ,Theoretical Computer Science ,Operator (computer programming) ,Artificial Intelligence ,Control and Systems Engineering ,Table (database) ,Medical diagnosis ,Value (mathematics) ,Software - Abstract
The paper explores a novel way to solve the multi-attribute decision-making issues under the hesitant fuzzy environment (HF-MADM) with three-way decision (3WD) theory. Firstly, according to the nature of the relative loss function (RLF), the RLF under the hesitant fuzzy (HF) environment is defined. Then, according to the practical significance of the loss function, this paper establishes the relationship between the loss function and the evaluation value. At the same time, considering that the HF-MADM has multiple attributes and multiple evaluation values, we provide an aggregated loss function via the hesitant fuzzy weight average (HFWA) operator to reflect the overall loss of the alternative. We establish the mixed information table (HF-MADMRLF) based on the overall loss function. Secondly, based on an outranking function and a distance from the positive ideal (PI) solution, this paper defines an estimation on the conditional probability method. Finally, we utilize the presented method to solve actual medical diagnosis of pneumonia (MDP) issue, and prove the validity and applicability of the method through comparison with several representative methods and experimental evaluations.
- Published
- 2021
26. Graph compression based on transitivity for neighborhood query
- Author
-
Mohammad Taheri, Amin Emamzadeh Esmaeili Nejad, and Mansoor Zolghadri Jahromi
- Subjects
Information Systems and Management ,Optimization problem ,Dense graph ,Computer science ,Heuristic ,P versus NP problem ,Function (mathematics) ,Lossy compression ,Computer Science Applications ,Theoretical Computer Science ,Artificial Intelligence ,Control and Systems Engineering ,Adjacency list ,Graph (abstract data type) ,Algorithm ,Software - Abstract
In recent years, many graph compression methods have been introduced. One successful category of them is based on local decompression designed to answer neighborhood queries. These techniques mainly rely on local similarities of vertices. Besides, their performance is usually a function of graph sparsity. The proposed approach, in this paper, is a lossy compression technique used to answer neighborhood queries with a more general precondition, called transitivity. The output of this method is a sparse graph optimized to keep original adjacent vertices, in at most 2-distance from each other and vice versa. In other words, by traversing a compressed graph by depth of 2, from any desired vertex, its original adjacency list is reconstructed, with an acceptable error. This paper models an optimization problem to solve the inverse problem of finding the best compressed graph in order to minimize the reconstruction error. Then, this NP problem is approximated by a heuristic with a low degree polynomial time-complexity near to the complexity of the forward problem. The results of applying the proposed method on toy and real datasets are compared with the state of the art that improves compression ratio and performance with an acceptable query response time.
- Published
- 2021
27. Dynamic output-feedback control for singular interval-valued fuzzy systems: Linear matrix inequality approach
- Author
-
In Seok Park, Nam Kyu Kwon, Chan-eun Park, and PooGyeon Park
- Subjects
Lemma (mathematics) ,Information Systems and Management ,MathematicsofComputing_NUMERICALANALYSIS ,Linear matrix inequality ,Parameterized complexity ,Relaxation (iterative method) ,Fuzzy control system ,Computer Science Applications ,Theoretical Computer Science ,Matrix (mathematics) ,Transformation matrix ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,Applied mathematics ,Software ,Mathematics - Abstract
This paper introduces an admissibilization condition for singular interval-valued fuzzy systems with a dynamic output-feedback controller using a linear matrix inequality approach. The derivation of the admissibility criterion (satisfying regularity, non-impulsiveness and stability) for the closed-loop system of the singular interval-valued fuzzy systems using the dynamic output-feedback controller is concerned. Here, the derived criterion is represented as the parameterized matrix inequalities depending on the membership functions of the system and the controller. To relax the derived parameterized matrix inequalities, this paper proposes a relaxation lemma based on the properties of the membership functions and their relations. By using this lemma, the parameterized matrix inequalities are converted into the matrix inequalities independent of the membership functions but not convex. Therefore, by introducing the structures of the variables and the congruent transformation matrix , a sufficient condition for the admissibility criterion is successfully given in terms of strict linear matrix inequalities. Two numerical examples are given to show the effectiveness of the proposed control.
- Published
- 2021
28. Research on AI security enhanced encryption algorithm of autonomous IoT systems
- Author
-
Gang Liu, Yuhao Feng, Zenggang Xiong, Weidong Yang, and Bin Li
- Subjects
Information Systems and Management ,business.industry ,Computer science ,05 social sciences ,050301 education ,Data security ,Plaintext ,02 engineering and technology ,Encryption ,Computer Science Applications ,Theoretical Computer Science ,Scrambling ,Brute-force attack ,Artificial Intelligence ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,Key (cryptography) ,020201 artificial intelligence & image processing ,Enhanced Data Rates for GSM Evolution ,business ,0503 education ,Software ,Computer network ,Data transmission - Abstract
Aiming at the security issues during the multi-types data storage and data transmission in autonomous Internet of Things (IoT) systems, this paper proposes an AI algorithm for data enhanced encryption used in the ends and the intermediate nodes of IoTs. The algorithm in this paper first constructs a three-dimensional Arnold transformation matrix for data unit value encryption in the end of IoTs, and designs a quantum logic intelligent mapping that effectively diffuses the encrypted data units to reduce the linear correlation of the image data and to improve the security performance of IoT edge data. Furthermore, the algorithm designs an AI access strategy for scrambling sequence nodes and builds a random-access route for the elements of the scrambling sequence which can reduce the calculation cost and improve the operating efficiency of IoT system in the ends and intermediate nodes. Finally, the data shared matrix is used to share the encrypted data to achieve the (k, n) threshold strategy. Experimental results prove that the algorithm has high plaintext and key sensitivity and can effectively resist brute force attacks, statistical analysis and differential attacks. The algorithm in this paper provides an AI solution for data security encryption in the ends and the intermediate nodes of autonomous IoT systems.
- Published
- 2021
29. Multi-level and relevance-based parallel clustering of massive data streams in smart manufacturing
- Author
-
Devis Bianchini, Valeria De Antonellis, and Ada Bagozi
- Subjects
Data stream ,Information Systems and Management ,Apache Spark ,Computer science ,Data stream mining ,Parallel clustering ,Distributed computing ,Anomaly detection ,Big data ,Partition (database) ,Computer Science Applications ,Theoretical Computer Science ,Set (abstract data type) ,Data point ,Artificial Intelligence ,Control and Systems Engineering ,Scalability ,Cluster analysis ,Software - Abstract
Parallel implementations of incremental clustering have been provided to increase performances of data stream processing in smart factories, to enable real-time anomaly detection, remote diagnosis, condition-based monitoring of Cyber-Physical Systems. Incremental clustering algorithms iteratively extract and update over time clusters of data points (often denoted as micro-clusters) whose maximum number is bounded. However, the capability of controlling costs derived from the exploitation of computational resources on the distributed architecture is challenging to enable a sustainable processing of massive data streams. In this paper, we present a multi-level parallelization approach for clustering massive data streams based on an horizontal scaling platform for Big Data processing. In particular, the following levels are considered: (i) a first parallelization level is based on a multi-dimensional model with exploration facets used to perform a first, coarse-grained partition of data streams, according to a divide-and-conquer strategy; (ii) a second parallelization level is based on a buffering mechanism, that splits the data stream into portions of data points on which processing is performed in parallel; (iii) the third level of parallelization is defined over the set of micro-clusters that are generated and change over time. The approach is conceived for anomaly detection in smart manufacturing, where the concept of data relevance, defined in terms of distance from critical conditions of monitored systems, is used in order to force a stronger parallelization (and therefore higher resource usage) only when necessary, that is, when approaching to critical conditions. The scalability and efficiency of the approach are evaluated using a real dataset in a smart factory scenario. In particular, experiments demonstrated that when the maximum number of allowed micro-clusters decreases and the buffer size increases, parallelization based on buffering does not ensure good scalability. Additionally, as the number of features (that is, the complexity of data stream) increases, the parallelization based on buffering may present scalability issues. This paves the way to the advantages of tuning different parallelization levels according to the approach proposed in this paper.
- Published
- 2021
30. Cluster synchronization of heterogeneous nonlinear multi-agent systems with actuator faults and IQCs through adaptive fault-tolerant pinning control
- Author
-
Xiang Gui Guo, Pei Ming Liu, Jianliang Wang, Hong Jian Li, and Choon Ki Ahn
- Subjects
Information Systems and Management ,Computer simulation ,Computer science ,Multi-agent system ,05 social sciences ,050301 education ,Fault tolerance ,Topology (electrical circuits) ,02 engineering and technology ,Computer Science Applications ,Theoretical Computer Science ,Compensation (engineering) ,Nonlinear system ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,Synchronization (computer science) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Actuator ,0503 education ,Software - Abstract
In this paper, the cluster synchronization problem of a heterogeneous second-order leader-following multi-agent system with nonlinear dynamics, actuator faults, and integral quadratic constraints (IQCs) under a directed topology with a directed spanning tree is investigated. Based on the local topology information, two adaptive fault-tolerant pinning control strategies with fixed and adaptive pinning gains are proposed to guarantee cluster synchronization in finite time. An adaptive input compensation is developed to attenuate the adverse effects of actuator faults. It is worth mentioning that just one parameter needs to be estimated for each agent in this compensation, which implies that the strategies designed in this paper can effectively reduce the computational cost. Furthermore, the use of the pinning control method instead of the fully equipped control method makes the strategies more cost-effective for large-scale multi-agent systems. Finally, numerical simulation examples are introduced to demonstrate the effectiveness and advantages of the proposed strategies.
- Published
- 2021
31. Joint design of control policy and network scheduling policy for wireless networked control systems: Theory and application
- Author
-
Lei Deng, Wing Shing Wong, Cheng Tan, and Fangfang Zhang
- Subjects
Information Systems and Management ,Transmission delay ,business.industry ,Network packet ,Computer science ,Computer Science Applications ,Theoretical Computer Science ,Scheduling (computing) ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,Control system ,Wireless ,Fading ,business ,Software ,Communication channel ,Computer network - Abstract
In this paper, we study a wireless networked control system (WNCS) with N ⩾ 2 sub-systems sharing a common wireless channel. Each sub-system consists of a plant and a controller and the control message must be delivered from the controller to the plant through the shared wireless channel. The wireless channel is unreliable due to shadowing and fading. As a result, a packet can be successfully delivered in a slot with a certain probability. A network scheduling policy determines how to transmit those control messages generated by such N sub-systems and directly influences the transmission delay of control messages. We first consider the case that all sub-systems have the same sampling period. We characterize the stability condition of such a WNCS under the joint design of the control policy and the network scheduling policy by means of 2N linear inequalities . For scalar systems, we further simplify the stability condition into only one linear inequality for two special cases: the perfect-channel case and the symmetric-structure case. One main technical contribution of this paper is to introduce the recent results on the network scheduling policy design for delay-constrained wireless communications into the analysis of WNCSs. In addition, we have applied our theory to a practical problem of stabilizing multiple pendulum-cart sub-systems over a shared wireless channel. Simulations show that our joint design effectively achieves better performance than existing baseline.
- Published
- 2021
32. An efficient identity-based signature scheme with provable security
- Author
-
Chengdong Liu, Yi Peng, Chen Yu, Huaqun Wang, Jiguo Li, Jinguang Han, and Yichen Zhang
- Subjects
Scheme (programming language) ,Provable security ,Information Systems and Management ,Theoretical computer science ,Computer science ,Hash function ,Signature (logic) ,Computer Science Applications ,Theoretical Computer Science ,Random oracle ,Digital signature ,Artificial Intelligence ,Control and Systems Engineering ,Identity (object-oriented programming) ,computer ,Software ,Computer Science::Cryptography and Security ,computer.programming_language ,Standard model (cryptography) - Abstract
Many identity-based digital signature schemes are proved secure in the random oracle model. However, the application of the random oracle may lead to security risks. The used hash function is specific and the response result of the query is not always random, hence it may cause the insecurity of the scheme. To solve the above issues, this paper presents an efficient identity-based signature scheme which is proved secure under the standard model. The security of the proposed scheme is reduced to the well-known computational Diffie–Hellman (CDH) assumption. Furthermore, compared with the related identity-based signature schemes, the scheme proposed in this paper has great advantages in the computation cost of signing and verification.
- Published
- 2021
33. Maximum feasibility estimation
- Author
-
Sungil Kim
- Subjects
Mathematical optimization ,Information Systems and Management ,Record locking ,Estimation theory ,Computer science ,Feasible region ,Estimator ,Synthetic data ,Computer Science Applications ,Theoretical Computer Science ,Artificial Intelligence ,Control and Systems Engineering ,Parametric family ,Software ,Constraint satisfaction problem ,Event (probability theory) - Abstract
In a previous paper citepkim2019revealing, an analytical framework based on the constraint satisfaction problems was proposed to reveal the characteristics of households using event logs from smart door lock systems. This work provides a more rigorous justification for the previous approach. This paper proposes a novel parameter estimation method called the maximum feasibility estimation (MFE). The MFE does not rely on any assumption about the parametric family of probability densities from which a random observation is drawn. Instead, we assume that constraints are imposed on observations and that some of the constraints are a function of a parameter of interest. The proposed estimator maximizes the feasible region, a set of all possible observations that satisfy those constraints. The method proposed is validated using synthetic data as well as real streaming event log data.
- Published
- 2021
34. An axiomatic design-based mathematical programming method for heterogeneous multi-criteria group decision making with linguistic fuzzy truth degrees
- Author
-
Ai-Hua Liu, Jiu-Ying Dong, and Shu-Ping Wan
- Subjects
Mathematical optimization ,Information Systems and Management ,Linear programming ,Computer science ,05 social sciences ,050301 education ,02 engineering and technology ,Fuzzy logic ,Axiomatic design ,Linguistics ,Computer Science Applications ,Theoretical Computer Science ,Group decision-making ,Consistency (database systems) ,Ranking ,Artificial Intelligence ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,Programming paradigm ,Fuzzy number ,020201 artificial intelligence & image processing ,0503 education ,Software - Abstract
This paper aims to develop a new axiomatic design-based mathematical programming method for heterogeneous multi-criteria group decision making (HMCGDM) problems with linguistic fuzzy truth degrees (LFTDs). The main contributions of this paper are summarized in five aspects: (1) The information content definitions for six types of fuzzy numbers are initially provided according to axiomatic design . (2) Considering the authority of experts on different criteria and group consensus, a bi-objective programming model is constructed to derive experts’ weights by maximizing individual deviation and minimizing group discordance. (3) Each alternative is assessed on the basis of its information content to a fuzzy positive ideal solution. Information content is firstly used to define the linguistic fuzzy consistency and inconsistency indices. (4) A bi-objective linguistic fuzzy mathematic programming model is built to determine the criteria weights, which considers consistency and inconsistency indices simultaneously. This model can be dexterously transformed into a crisp linear programming model for resolution by the linguistic scale function. (5) The group information content of each alternative to fuzzy positive ideal solution is calculated to determine the ranking order of alternatives. Finally, an example of blockchain service provider selection is given to validate the proposed method.
- Published
- 2021
35. Connectivity status of fuzzy graphs
- Author
-
Sunil Mathew, M. Binu, and John N. Mordeson
- Subjects
Sequence ,Information Systems and Management ,Theoretical computer science ,Basis (linear algebra) ,Computer science ,05 social sciences ,050301 education ,Network science ,Graph theory ,02 engineering and technology ,Computer Science Applications ,Theoretical Computer Science ,Bandwidth allocation ,Artificial Intelligence ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,Fuzzy graph ,020201 artificial intelligence & image processing ,GeneralLiterature_REFERENCE(e.g.,dictionaries,encyclopedias,glossaries) ,0503 education ,Software ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
Network science is a widely studied subject and graph theory has a major role in it. This paper studies connectivity status of vertices in a fuzzy graph. This paper adopt connectivity status to build up the status sequence related to a fuzzy graph. Results on connectivity status and status sequence of different structures are obtained. On the basis of connectivity status, vertices of a fuzzy graph can be classified into connectivity status enhancing vertices, connectivity status reducing vertices and connectivity status neutral vertices. Connectivity status analysis of vertices is also carried out. Algorithms related to these concepts are provided and an application related to bandwidth allocation problem in networking is proposed.
- Published
- 2021
36. Spiking neural P systems with autapses
- Author
-
Jun Wang, Xiaoxiao Song, Luis Valencia-Cabrera, and Hong Peng
- Subjects
Structure (mathematical logic) ,Information Systems and Management ,Correctness ,Theoretical computer science ,Computer science ,Universality (philosophy) ,Construct (python library) ,Experimental validation ,Computer Science Applications ,Theoretical Computer Science ,law.invention ,Power (physics) ,Artificial Intelligence ,Control and Systems Engineering ,law ,Communication methods ,Universal Turing machine ,Software - Abstract
Inspired by the structure and communication method of neural systems, a parallel computing model, spiking neural P systems (SN P systems, for short), was proposed in 2006. A new class of SN P systems, SN P systems with autapses (SNP-AU systems), is presented in this work. Autapses are a special kind of synapses, connecting the axon of a neuron onto itself. We prove that SNP-AU systems can generate Turing-computable numbers, through the simulation of the modules of universal register machines. This result improves significantly the results given by classical SN P systems in terms of the number of neurons and rules, while preserving simplicity and power to a reasonable extent. Moreover, we construct an SNP-AU system using 53 neurons, proving its universality for computing functions. Finally, going beyond the design of the building blocks of register machines, a whole universal machine is provided. Thus, a simulator is developed and used to check the correctness of two universal SNP-AU systems proposed in this paper, complementing the theoretical proof with the experimental validation of our systems with respect to the reference example appearing in the foundational paper of small register machines.
- Published
- 2021
37. Cartesian product of sets without repeated elements
- Author
-
Carlos Alberto Cobos-Lozada, Jose Torres-Jimenez, Carlos Lara-Alvarez, Alfredo Cardenas-Castillo, and Roberto Blanco-Rocha
- Subjects
Information Systems and Management ,Stirling numbers of the first kind ,05 social sciences ,050301 education ,Value (computer science) ,Stirling numbers of the second kind ,02 engineering and technology ,Cartesian product ,Computer Science Applications ,Theoretical Computer Science ,Combinatorics ,symbols.namesake ,Cardinality ,Artificial Intelligence ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,020201 artificial intelligence & image processing ,Multiplication ,0503 education ,Software ,Mathematics ,Integer (computer science) ,Bell number - Abstract
In many applications, like database management systems , is very useful to have an expression to compute the cardinality of cartesian product of k sets without repeated elements; we designate this problem as T ( k ) . The value of | T ( k ) | is upper-bounded by the multiplication of cardinalities of the sets. As long as we have searched, it has not been reported a general expression to compute T ( k ) using cardinalities of the intersections of sets, this is the main topic of this paper. Given three sets with indices { 0 , 1 , 2 } , C i is the cardinality of one set, C i , j ( i j ) and C i , j , l ( i j l ) are respectively the cardinalities of the intersections of 2 and 3 sets, then the searched formulas for T ( k ) are: T ( 1 ) = C 0 ; T ( 2 ) = C 0 C 1 - C 0 , 1 ; T ( 3 ) = C 0 C 1 C 2 - ( C 0 , 1 C 2 + C 0 , 2 C 1 + C 1 , 2 C 0 ) + 2 C 0 , 1 , 2 . In this paper, we prove formulas for computing T ( k ) and its specialization when a set is contained in the next sets. For this purpose, we will use concepts like partitions of the integer k in v parts, Bell numbers, Stirling numbers of the first kind and Stirling numbers of the second kind. Additionally, we present a complexity analysis for the computation of T ( k ) .
- Published
- 2021
38. A privacy image encryption algorithm based on piecewise coupled map lattice with multi dynamic coupling coefficient
- Author
-
Jingjing Yang and Xingyuan Wang
- Subjects
Information Systems and Management ,business.industry ,Computer science ,05 social sciences ,Chaotic ,050301 education ,Cryptography ,02 engineering and technology ,Encryption ,Computer Science Applications ,Theoretical Computer Science ,Image (mathematics) ,CHAOS (operating system) ,Artificial Intelligence ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,Piecewise ,020201 artificial intelligence & image processing ,business ,0503 education ,Algorithm ,Software ,Energy (signal processing) ,Computer Science::Cryptography and Security ,Coupled map lattice - Abstract
This paper proposes a new tent-multi dynamic piecewise coupled mapping lattice (TMDPCML). Through the comprehensive analysis of the performance test results, TMDPCML system increases the correlation dynamics of spatiotemporal behavior and improves the efficiency of energy diffusion between lattices. Moreover, TMDPCML system has larger parameter space, better chaos and outstanding cryptographic characteristics. Therefore, this paper proposes a privacy image encryption algorithm combined with TMDPCML system. The application of TMDPCML system in private images encryption further proves that TMDPCML system has good chaotic behavior and meets the requirements of cryptography.
- Published
- 2021
39. The longitudinal research of type-2 fuzzy sets domain: From conceptual structure and knowledge diffusion perspectives
- Author
-
Dejian Yu, Zeshui Xu, and Yitong Chen
- Subjects
Information Systems and Management ,Computer science ,Collaborative network ,05 social sciences ,Fuzzy set ,050301 education ,02 engineering and technology ,Multiple-criteria decision analysis ,Data science ,Field (computer science) ,Computer Science Applications ,Theoretical Computer Science ,Domain (software engineering) ,Artificial Intelligence ,Control and Systems Engineering ,Path (graph theory) ,0202 electrical engineering, electronic engineering, information engineering ,Trajectory ,020201 artificial intelligence & image processing ,Path analysis (computing) ,0503 education ,Software - Abstract
Nowadays, more scholars and practitioners are committed to improving and applying type-2 fuzzy sets (T2FSs) in various domains because of the stronger ability to handle the uncertainty of fuzzy complex systems. To explore the status and internal laws of development of this field, this paper presents the development overview based on the bibliometric analysis, then the dynamic evolution of main topics and the knowledge diffusion trajectory are also displayed on the basis of the strategy diagram and main path analysis (MPA). From 1997 to 2019, 1749 documents are retrieved from Web of Science (WoS) repository for the analysis. The results show that there are four stable collaborative communities existing in the countries/regions’ collaborative network and the collaboration is affected by geographical factors to some degree. Three main evolution paths of hot topics are also presented in this paper and the multi-criteria decision-making (MCDM) has gradually developed into the moto theme. Furthermore, articles appearing on the main path mainly focus on the research of basic concept and framework, self-optimization and applications in various domains of T2FSs. In general, this paper provides a new landscape in the longitudinal research based on the development overview, thematic evolution and the knowledge diffusion trajectory.
- Published
- 2021
40. Supervised feature selection using integration of densest subgraph finding with floating forward–backward search
- Author
-
Tapas Bhadra and Sanghamitra Bandyopadhyay
- Subjects
Vertex (graph theory) ,Information Systems and Management ,Degree (graph theory) ,Computer science ,05 social sciences ,050301 education ,Approximation algorithm ,Feature selection ,02 engineering and technology ,Graph ,Computer Science Applications ,Theoretical Computer Science ,Vertex (geometry) ,Set (abstract data type) ,Artificial Intelligence ,Control and Systems Engineering ,Feature (computer vision) ,0202 electrical engineering, electronic engineering, information engineering ,Redundancy (engineering) ,Graph (abstract data type) ,020201 artificial intelligence & image processing ,0503 education ,Algorithm ,Software - Abstract
In this paper, a novel approach of supervised feature selection is proposed based on the principle of dense subgraph discovery. To exploit dense subgraph discovery for the purpose of feature selection, the dataset is initially mapped to an equivalent weighted graph notation by considering the set of all features as its vertex set and the mutual dependency between each pair of features as the weight of the corresponding edge. The proposed feature selection algorithm proceeds in a two-phase manner. In the first stage, a dense sub-graph is first discovered so that the features within it become maximally non-redundant among each other and the averaged class relevance as well as averaged standard deviation of all these features are obtained as maximal as possible. In this regard, a novel induced degree is also defined for each feature by incorporating the aforesaid three important objectives of feature selection. In this phase, a modified version of an existing approximation algorithm is also used to find dense subgraph module. Finally, in the second stage, a floating forward–backward search is performed on the dense subgraph so obtained to reveal a better feature subset. In both stages, an existing version of the normalized mutual information score is employed to compute both the class relevance and redundancy. The main contribution of this paper is proposing a feature selection strategy by which the reduced features have the characteristics like maximal average class relevance, minimal average pairwise redundancy, and good discriminating power. The experimental results demonstrate that the proposed approach is competent with several conventional as well as state-of-art algorithms of supervised feature selection.
- Published
- 2021
41. Influence maximization algorithm based on Gaussian propagation model
- Author
-
WeiMin Li, Alex Munyole Luvembe, Chao Yang, and Zheng Li
- Subjects
Information Systems and Management ,Offset (computer science) ,Series (mathematics) ,Degree (graph theory) ,Computer science ,Heuristic (computer science) ,Gaussian ,05 social sciences ,050301 education ,Contrast (statistics) ,02 engineering and technology ,Maximization ,Computer Science Applications ,Theoretical Computer Science ,symbols.namesake ,Artificial Intelligence ,Control and Systems Engineering ,Scalability ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,020201 artificial intelligence & image processing ,0503 education ,Algorithm ,Software - Abstract
The influence of each entity in a network is a crucial index of the network information dissemination. Greedy influence maximization algorithms suffer from time efficiency and scalability issues. In contrast, heuristic influence maximization algorithms improve efficiency, but they cannot guarantee accurate results. Considering this, this paper proposes a Gaussian propagation model based on the social networks. Multi-dimensional space modeling is constructed by offset, motif, and degree dimensions for propagation simulation. This space’s circumstances are controlled by some influence diffusion parameters. An influence maximization algorithm is proposed under this model, and this paper uses an improved CELF algorithm to accelerate the influence maximization algorithm. Further, the paper evaluates the effectiveness of the influence maximization algorithm based on the Gaussian propagation model supported by theoretical proofs. Extensive experiments are conducted to compare the effectiveness and efficiency of a series of influence maximization algorithms. The results of the experiments demonstrate that the proposed algorithm shows significant improvement in both effectiveness and efficiency.
- Published
- 2021
42. Distributed H∞ state estimation for switched sensor networks with packet dropouts via persistent dwell-time switching mechanism
- Author
-
Hao Shen, Xiaohui Hu, Ju H. Park, Jianwei Xia, and Jing Wang
- Subjects
Information Systems and Management ,Network packet ,Computer science ,05 social sciences ,050301 education ,Estimator ,Topology (electrical circuits) ,Context (language use) ,02 engineering and technology ,Stability (probability) ,Computer Science Applications ,Theoretical Computer Science ,Dwell time ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,Convex optimization ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,0503 education ,Wireless sensor network ,Software - Abstract
This paper addresses the distributed H ∞ state estimation problem for a class of sensor networks with switching characteristics, where the switchings of parameters are presumed to obey persistent dwell-time switching mechanism rather than dwell time or average dwell-time ones in the discrete-time context. For the purpose of tracking the unavailable state of the target plant, a sensor network is formed by employing multiple sensor nodes distributed in space and worked cooperatively under a specific connection topology. The intention of the paper mainly centers on deriving some sufficient criteria for the addressed model to achieve the exponential mean-square stability with a prescribed H ∞ performance, and the estimator gains corresponding to differently constructed estimators are further solved by means of the convex optimization method. Finally, the validity of the proposed approach is illustrated by a numerical example.
- Published
- 2021
43. An image matching optimization algorithm based on pixel shift clustering RANSAC
- Author
-
Guanglin Li, Ping He, Heng Li, Hairong You, Shuhua Ma, and Peikai Guo
- Subjects
Matching (statistics) ,Information Systems and Management ,Computer science ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,02 engineering and technology ,RANSAC ,Residual ,Theoretical Computer Science ,Artificial Intelligence ,0202 electrical engineering, electronic engineering, information engineering ,Point (geometry) ,Cluster analysis ,Pixel ,business.industry ,05 social sciences ,050301 education ,Pattern recognition ,Sample (graphics) ,Computer Science Applications ,Control and Systems Engineering ,020201 artificial intelligence & image processing ,Artificial intelligence ,Parallax ,business ,0503 education ,Software - Abstract
This paper focuses on improving the accuracy of image matching by eliminating the residual mismatches in the matching results of standard RANSAC. Based on pixel shift clustering and RANSAC algorithms, a matching optimization algorithm called pixel shift clustering RANSAC, PSC-RANSAC in short, is proposed in this paper. Firstly, the pixel shift model of space point from two perspectives are established by parallax principle and camera projection model. Then, based on the established pixel shift model, density peaks clustering (DPC) algorithm is used to select the mismatches out to enhance the accuracy of image matching. Meanwhile the comparisons among PSC-RANSAC, standard RANSAC, progressive sample consensus and graph-cut RANSAC show that PSC-RANSAC can more effectively and robustly eliminate the residual mismatches in initial matching results. The proposed method provides an effective tool for optimization on image matching.
- Published
- 2021
44. Surrogate models in evolutionary single-objective optimization: A new taxonomy and experimental study
- Author
-
Hao Tong, Xin Yao, Changwu Huang, and Leandro L. Minku
- Subjects
Information Systems and Management ,Optimization problem ,Fitness function ,Series (mathematics) ,Computer science ,business.industry ,05 social sciences ,Evolutionary algorithm ,050301 education ,02 engineering and technology ,Machine learning ,computer.software_genre ,Computer Science Applications ,Theoretical Computer Science ,Artificial Intelligence ,Control and Systems Engineering ,Taxonomy (general) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Artificial intelligence ,business ,0503 education ,Time complexity ,computer ,Software - Abstract
Surrogate-assisted evolutionary algorithms (SAEAs), which use efficient surrogate models or meta-models to approximate the fitness function in evolutionary algorithms (EAs), are effective and popular methods for solving computationally expensive optimization problems. During the past decades, a number of SAEAs have been proposed by combining different surrogate models and EAs. This paper dedicates to providing a more systematical review and comprehensive empirical study of surrogate models used in single-objective SAEAs. A new taxonomy of surrogate models in SAEAs for single-objective optimization is introduced in this paper. Surrogate models are classified into two major categories: absolute fitness models, which directly approximate the fitness function values of candidate solutions, and relative fitness models, which estimates the relative rank or preference of candidates rather than their fitness values. Then, the characteristics of different models are analyzed and compared by conducting a series of experiments in terms of time complexity (execution time), model accuracy, parameter influence, and the overall performance when used in EAs. The empirical results are helpful for researchers to select suitable surrogate models when designing SAEAs. Open research questions and future work are discussed at the end of the paper.
- Published
- 2021
45. An ontology-based deep learning approach for triple classification with out-of-knowledge-base entities
- Author
-
Emilio Serrano, Daniel Manrique, Thomas Lukasiewicz, Elvira Amador-Domínguez, and Patrick Hohenecker
- Subjects
Information Systems and Management ,Knowledge representation and reasoning ,Computer science ,business.industry ,Deep learning ,Machine learning ,computer.software_genre ,Computer Science Applications ,Theoretical Computer Science ,Knowledge graph ,Knowledge base ,Artificial Intelligence ,Control and Systems Engineering ,Scalability ,Ontology ,Leverage (statistics) ,Embedding ,Artificial intelligence ,business ,computer ,Software ,Semantic matching - Abstract
Knowledge graphs (KGs) are one of the most common frameworks for knowledge representation. However, they suffer from a severe scalability problem that hinders their usage. KG embedding aims to provide a solution to this issue. Nonetheless, general approaches are incapable of representing and reasoning about information not previously contained in the graph. This paper proposes to leverage semantic and ontological information for a significant benefit of knowledge graph completion, focusing on triple classification. The goal of this task is to determine whether a given fact holds. Furthermore, this paper also considers the classification of facts that include entities that have not been seen during training, denoted out-of-knowledge-base or OOKB entities. An incremental method is presented, composed of six stages. Although the proposal can be applied to any KG embedding model, this work focuses on its application for semantic matching models, such as ComplEx and DistMult. Compared to other approaches, our proposal is model-agnostic, computationally inexpensive, and does not require retraining. The results show that triple classification accuracy scales up to 15% with the proposed approach, as well as accelerating the convergence of the model to its optimal solution. Furthermore, facts containing OOKB entities can be classified with a reasonable accuracy.
- Published
- 2021
46. Adaptive denoising algorithm using peak statistics-based thresholding and novel adaptive complementary ensemble empirical mode decomposition
- Author
-
Haitao Liu, Mengfei Hu, Fengjiao Xu, Shuqing Zhang, and Dong Wei
- Subjects
Information Systems and Management ,Mean squared error ,Computer science ,Noise (signal processing) ,Noise reduction ,05 social sciences ,050301 education ,02 engineering and technology ,Sensor fusion ,Thresholding ,Signal ,Hilbert–Huang transform ,Computer Science Applications ,Theoretical Computer Science ,Artificial Intelligence ,Control and Systems Engineering ,Distortion ,Statistics ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,0503 education ,Algorithm ,Software - Abstract
This paper proposes an adaptive denoising methodology for noisy signals that employs a novel adaptive complementary ensemble empirical mode decomposition (NACEEMD) and a peak statistics (PS)-based thresholding technique. The key idea in this paper is the peak statistics (PS)-based thresholding technique,which breaks the traditional strategy with respect to selecting more accurate and more adaptive thresholds. The NACEEMD algorithm is proposed to decompose the noisy signal into a series of intrinsic mode functions (IMFs). At the same time, NACEEMD is also used to verify the applicability of the PS-based thresholding technique in different decomposition algorithms. The PS-based threshold is used to remove the noise inherent in noise-dominant IMFs, and the denoised signal is reconstructed by combining the denoised noise-dominant IMFs and the signal-dominant IMFs. This paper uses a various of simulated signals in various noisy environments for experiments, the experimental results indicate that the proposed algorithm outperforms traditional threshold denoising methodologies in terms of signal-to-noise ratio, root mean square error, and percent root distortion. Moreover, through real ECG signal and multi-sensor data fusion experiments, the application of the proposed algorithm in the field of engineering is explored and expanded.
- Published
- 2021
47. On the minimality of some generating sets of the aggregation clone on a finite chain
- Author
-
Jozef Pócs, Zbyněk Kurač, and Radomír Halaš
- Subjects
Information Systems and Management ,05 social sciences ,050301 education ,02 engineering and technology ,Computer Science Applications ,Theoretical Computer Science ,Combinatorics ,Set (abstract data type) ,Chain (algebraic topology) ,Artificial Intelligence ,Control and Systems Engineering ,Clone (algebra) ,Bounded function ,Lattice (order) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Bounded lattice ,Finitely-generated abelian group ,0503 education ,Software ,Mathematics - Abstract
Clone theory plays an important role in studying aggregation functions on bounded posets or bounded lattices. Several important classes of aggregation functions on a bounded lattice L form a clone, particularly the set of all aggregation functions on L, the so-called full aggregation clone on L. For any finite lattice L, this clone is known to be finitely generated and various generating sets and their constructions have been presented in recent papers. The aim of this paper is to extend previous results concerning generating sets of aggregation clones on finite chains. Namely, the objective is to discuss the minimality of certain generating bases, the so-called ( χ , ⊕ ) -generating sets.
- Published
- 2021
48. Robust guaranteed cost control for uncertain discrete-time systems with state and input quantizations
- Author
-
Qunxian Zheng, Haoling Chen, and Shengyuan Xu
- Subjects
Information Systems and Management ,Inequality ,Computer science ,media_common.quotation_subject ,05 social sciences ,Stability (learning theory) ,050301 education ,Polytope ,02 engineering and technology ,Design strategy ,Function (mathematics) ,Type (model theory) ,Computer Science Applications ,Theoretical Computer Science ,Discrete time and continuous time ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,State (computer science) ,0503 education ,Software ,media_common - Abstract
The robust guaranteed cost control problem for uncertain discrete-time systems with state and input quantizations has been studied in this paper. The polytope type uncertainties are considered in the plants. Different from previous related works, a novel guaranteed cost control strategy has been put forward in this paper. The novelty and challenge lie in that the quantized state and quantized input are included in the guaranteed cost function. Through introducing some auxiliary scalars and combining with the S-procedure, new criteria are developed for the robust stability and guaranteed cost performance for discrete-time systems with state and input quantizations. Based on a new two-step design strategy, the controller and dynamic quantizers can be easily obtained by means of linear matrix inequalities. In the end, two examples are given to demonstrate the effectiveness and applicability of the proposed method.
- Published
- 2021
49. A curvature-segmentation-based minimum time algorithm for autonomous vehicle velocity planning
- Author
-
Yanling Zheng, Qingshan Liu, and Miao Wang
- Subjects
Information Systems and Management ,Optimization problem ,Computer science ,05 social sciences ,050301 education ,Particle swarm optimization ,02 engineering and technology ,Curvature ,Upper and lower bounds ,Computer Science Applications ,Theoretical Computer Science ,Acceleration ,Artificial Intelligence ,Control and Systems Engineering ,Path (graph theory) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Motion planning ,Projection (set theory) ,0503 education ,Algorithm ,Software - Abstract
Velocity planning serves as an important issue in motion planning for autonomous vehicles. The presented paper proposes a novel velocity planning method with minimum moving time on the basis of path curvature which is accomplished in three steps. First, the assigned path is divided into some elementary parts based on the path curvature. Second, the velocity planning is transformed into an unconstrained optimization problem by assuming the velocity of vehicle to be a specific cubic polynomial on every elementary part to avoid a sudden acceleration in path switching. Finally, we use a modified projection particle swarm optimization (PPSO) algorithm to obtain the time-optimal velocity profile . The proposed method can generate a smooth time-optimal velocity profile while considering all possible relevant constraints. Three examples are provided on different types of path to demonstrate that the final velocity profile is efficient to avoid the sudden acceleration change. Furthermore, the modified PPSO algorithm in this paper is used to solve the optimization problem with high dimensional variables when its upper bound is known, which can not be achieved by the general PPSO algorithm.
- Published
- 2021
50. Preview-based leader-following consensus control of distributed multi-agent systems
- Author
-
C. L. Philip Chen, Chang-E Ren, and Guilu Li
- Subjects
Information Systems and Management ,Computer science ,Multi-agent system ,05 social sciences ,050301 education ,02 engineering and technology ,Linear-quadratic regulator ,Directed acyclic graph ,Computer Science Applications ,Theoretical Computer Science ,Computer Science::Multiagent Systems ,Consensus control ,Consensus ,Computer Science::Systems and Control ,Artificial Intelligence ,Control and Systems Engineering ,Control theory ,Step function ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,State (computer science) ,0503 education ,Software - Abstract
The preview-based leader-following consensus control of distributed multi-agent systems (MAS) with a directed acyclic graph is investigated in this paper. The external disturbance considered in this paper is the step function that can be previewed, and the information of the leader can be obtained in advance. The leader-following consensus control of MAS is solved by using the state augmentation technique and the preview control method that transforms the consensus control problem into the finite horizon linear quadratic regulator (LQR) problem and the infinite horizon LQR problem. In the finite horizon, the minimum principle is utilized to design the optimal controller. In the infinite horizon, the standard infinite horizon LQR is applied to devise the corresponding controller. Assuming the original systems are stabilisable and detectable, the distributed consensus controller guarantees the asymptotic consensus of the preview MAS. The simulation illustrates the effectiveness of the distributed leader-following consensus controller designed in this paper.
- Published
- 2021
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.