Search

The task of multi-label image recognition is to predict a set of object labels that present in an image. As objects normally co-occur in an image, it is desirable to model label dependencies to improve recognition performance. To capture and explore such important information, we propose Graph Convolutional Networks based models for multi-label recognition, where directed graphs are constructed over classes and information is propagated between classes to learn inter-dependent class-level representations. Following this idea, we design two particular models that approach multi-label classification from different views. In our first model, the prior knowledge about the class dependencies is integrated into classifier learning. Specifically, we propose Classifier-Learning-GCN to map class-level semantic representations (\eg, word embedding) into classifiers that maintain the inter-class topology. In our second model, we decompose the visual representation of an image into a set of label-aware features and propose Prediction-Learning-GCN to encode such features into inter-dependent image-level prediction scores. Furthermore, we also present an effective correlation matrix construction approach to capture inter-class relationships and consequently guide information propagation among classes. Empirical results on generic multi-label recognition demonstrate that the effectiveness of both two proposed models. Moreover, the proposed methods also show advantages in other multi-label related applications.

In this article, we present an extended data-fitting model which involves different and conflicting criteria, and we propose an algorithm based on a scalarization technique to solve it. Our model integrates in a unique framework three different criteria, namely, a data-fitting term, and the entropy and the sparsity of the set of unknown parameters. This model can be analyzed by means of multiple criteria decision-making techniques. We then validate the proposed modified algorithm using two computational experiments: We analyze the problem of handwritten digit recognition using a logistic regression model and a deep neural network model, respectively. In the final part of the article, we employ this methodology to forecasting instead. Given the importance of forecasting techniques to predict the future, which in turn can lead to positive impacts on firm performance, we propose two numerical experiments focusing on the forecast of the US GDP. In the first one, we proceed by means of a modified iterated function system with grayscale maps-type fractal operator, and, in the second one, we implement a modified neural network-based model.

Composite indicators have been widely used in a large number of fields, including innovation and entrepreneurship as a useful tool for conveying summary information about overall performance in a relatively simple way. The construction of composite indicators implies several stages concerning collection of data, selection of criteria and individual indicators, normalization and weighting of criteria and indicators, aggregation, and comparison of overall performance of the alternatives or options. This article aims at contributing to the construction of synthetic indicators by showing with a real example, how the proposed methodology can overcome the problem of the establisment of the decision criteria relative importance. Determination of weighting schemes can be a controversial question for decision makers in those contexts where subjective weights are used. The method proposed in this article allows the ranking of a set of alternatives without the establishment of a priori criteria weights. In our proposal, based on TOPSIS, weights are unknown variables contributing to the optimization of the relative proximity of each alternative to an ideal solution.

Sampling from large dataset is commonly used in the frequent patterns (FPs) mining. To tightly and theoretically guarantee the quality of the FPs obtained from samples, current methods theoretically stabilize the supports of all the patterns in random samples, despite only FPs do matter, so they always overestimate the sample size. We propose an algorithm called multiple sampling-based FPs mining (MSFP). The MSFP first generates the set of approximate frequent items (AFI), and uses the AFI to form the set of approximate FPs without supports ( AFP*), where it does not stabilize the value of any item's or pattern's support, but only stabilizes the relationship ≥ or < between the support and the minimum support, so the MSFP can use small samples to successively obtain the AFI and AFP*, and can successively prune the patterns not contained by the AFI and not in the AFP*. Then, the MSFP introduces the Bayesian statistics to only stabilize the values of supports of AFP*'s patterns. If a pattern's support in the original dataset is unknown, the MSFP regards it as random, and keeps updating its distribution by its approximations obtained from the samples taken in the progressive sampling, so the error probability can be bound better. Furthermore, to reduce the I/O processes in the progressive sampling, the MSFP stores a large enough random sample in memory in advance. The experiments show that the MSFP is reliable and efficient.

In this brief, stabilization of Boolean networks (BNs) by flipping a subset of nodes is considered, here we call such action state-flipped control. The state-flipped control implies that the logical variables of certain nodes are flipped from 1 to 0 or 0 to 1 as time flows. Under state-flipped control on certain nodes, a state-flipped-transition matrix is defined to describe the impact on the state transition space. Weak stabilization is first defined and then some criteria are presented to judge the same. An algorithm is proposed to find a stabilizing kernel such that BNs can achieve weak stabilization to the desired state with in-degree more than 0. By defining a reachable set, another approach is proposed to verify weak stabilization, and an algorithm is given to obtain a flip sequence steering an initial state to a given target state. Subsequently, the issue of finding flip sequences to steer BNs from weak stabilization to global stabilization is addressed. In addition, a model-free reinforcement algorithm, namely the Q-learning (QL) algorithm, is developed to find flip sequences to achieve global stabilization. Finally, several numerical examples are given to illustrate the obtained theoretical results.

Artificial intelligence is used for various applications and is promising as an indispensable infrastructure in future societies. Neural networks are representative technologies that imitate human brains and exhibit various advantages. However, the size is bulky, the power is huge, and some advantages are not demonstrated because they are executed on Neumann-type computers. Neuromorphic systems are biomimetic systems from the hardware level to implement neuron and synapse elements, and the size is compact, the power is low, and the operation is robust. However, because the conventional ones are not composed of fully optimized hardware, the power is not yet minimal, and extra control circuits must be used. In this article, we developed a neuromorphic system using memcapacitors and autonomous local learning. By using memcapacitors, the power can be minimal, and by using autonomous local learning, the control circuits to handle the synapse elements can be deleted. First, the memcapacitors are completed in a cross-bar array, where the ferroelectric layers are sandwiched between the horizontal and perpendicular electrodes. The polarization and capacitance exhibit hysteresis due to the dielectric polarization. Next, autonomous local learning is introduced as follows. During the training phase, associative patterns to be memorized are directly sent, relatively high voltages are applied, and dielectric polarizations are induced. During the operation phase, relatively low voltages are applied, and input signals are weighted with the capacitances of the memcapacitors, summed, and transferred as the output signals. Finally, the experimental system is set up, and the experimental results are acquired. The memorized patterns during the training phase, distorted patterns as the input signals during the operation phase, and retrieved patterns as the output signals in the operation phase are shown. Researchers found that the retrieved patterns are completely the same as the memorized patterns. This means that the neuromorphic system works as an associative memory.

This article conducts a comparative analysis to investigate the effects of different classification algorithms and structural proximity indexes on the performance of the supervised link prediction approach to anticipating technology convergence at different forecast horizons. For this, we identify relationships between technologies of interest for different time periods and compute 10 structural proximity indexes among unconnected technologies at each period. We develop a set of classification models that identify potential convergence among unconnected technologies where each model is configured differently by a classification algorithm and a combination of the proximity indexes. We compare the performance of the classification models to investigate effective combinations of classification algorithms and proximity indexes at different forecast horizons. The empirical analysis on Wikipedia articles about artificial intelligence technology indicates that random forest outperforms others in short-term forecasting while support vector machine outperforms others in mid-term forecasting. We also identify structural proximity indexes that produce higher performance when combined with the most effective algorithm at each forecast horizon. The results of this article are expected to offer guidelines for choosing classification algorithms and indexes when applying the supervised link prediction approach in anticipating technology convergence.

With the dawn of 5G network, a new set of requirements for site spectrum monitoring, cellular planning are emerging, all of which are relying on fine-grained signal map. Although with significant importance, the traditional signal map construction could be time-consuming and labor-intensive. The state-of-the arts usually employ crowdsourcing scheme and matrix completion algorithm to solve the dilemma. However, the crowdsourcing scheme usually suffers from uneven distributed and inadequate participants. To this end, in this paper, we study how to effectively reconstruct and update the signal map in the case of partially measured signal maps with smaller cost and propose a GAN-based active signal map reconstruction method (GSMAC). Our method is mainly innovative in two parts: GSMC, GAN-based signal map construction, and ACS, an active crowdsourcing scheme. Specifically, GSMC can effectively update the signal map with only a small number of observations while updating the signal map online. ACS consists of a reinforce learning-based active query mechanism which quantitatively evaluates the most valuable measurement site for reconstruction. The simulation results and real implemented data-driven experiments demonstrate the advantages and effectiveness of our approach in both accuracy and cost.

The automotive industry is increasingly deploying software solutions to provide value-added features for vehicles, especially in the era of vehicle electrification and automation. However, the ever-increasing cyber components of vehicles (i.e., computation, communication, and control) incur new risks of anomalies, as evident by the millions of vehicle recalls by different automakers. To mitigate these risks, we design the B-Diag, a battery-based diagnostic system detects engine anomalies with a cyber-physical approach. The core idea of B-Diag is to diagnose engines using the physically-induced correlations between battery voltage and engine variables, which is captured as a customized 3-layer correlation graph and a set of data-driven norm models describing the edges thereof. The design of B-Diag is steered by a dataset collected with a prototype system when driving a 2018 Subaru Crosstrek in real-life for over three months. Our evaluation shows B-Diag to detect anomalies of 17 engine variables with a >86% (up to 100%) accuracy.

The extrusion process of plastic transformation involves a series of variables and components which must be associated with the concept of reliability to achieve an expected performance in operational and quality terms. This paper describes the reliability framework of an extruder of a packaging company located in Brazil through the following mathematical representations: probability density function f(t), reliability curve R(t) and function rate of failure h(t). Through a statistical software the set of representations was able to develop the reliability framework of the machine, which can be used to support a FMEA analysis. Besides that, it was evidenced that in the current operating conditions of the machine, approximately 50% of the failure observations happen on the hour 100 of operating time. The main outcome is that it is recommended a systematic preventive maintenance based on 100h cycles. It is expected that this work may act as a guide for future implementation of improvement activities.

A principal wants to procure a discrete number of homogeneous units from a finite set of agents. Each agent has an increasing and convex cost function, whose exact shape is unknown to the principal. Utility is quasilinear in money. We characterize the set of mechanisms that are strategy-proof and robust to collusion. The latter is captured by reallocation-proofness (group strategy-proofness) if the colluding agents can (cannot) make side deals among each other. We show that in every reallocation-proof mechanism, the principal offers the agents a fixed price per unit. While group-strategy-proof mechanisms can be more complex, they cannot guarantee that the principal will receive exactly her desired quantity. We fully characterize the set of group-strategy-proof mechanisms with a uniform price.

This article is concerned with the neural network (NN)-based event-triggered control problem for discrete-time networked Markov jump systems with hybrid cyberattacks and unmeasured states. The event-triggered mechanism (ETM) is used to reduce the communication load, and a Luenberger observer is introduced to estimate the unmeasured states. Two kinds of cyberattacks, denial-of-service (DoS) attacks and deception attacks, are investigated due to the vulnerability of cyberlayer. For the sake of mitigating the impact of these two types of cyberattacks on system performance, the ETM under DoS jamming attacks is discussed first, and a new estimation of such mechanism is given. Then, the NN technique is applied to approximate the injected false information. Some sufficient conditions are derived to guarantee the boundedness of the closed-loop system, and the observer and controller gains are presented by solving a set of matrix inequalities. The effectiveness of the presented control method is demonstrated by a numerical example.

Partial multilabel learning (PML) aims to learn from training data, where each instance is associated with a set of candidate labels, among which only a part is correct. The common strategy to deal with such a problem is disambiguation, that is, identifying the ground-truth labels from the given candidate labels. However, the existing PML approaches always focus on leveraging the instance relationship to disambiguate the given noisy label space, while the potentially useful information in label space is not effectively explored. Meanwhile, the existence of noise and outliers in training data also makes the disambiguation operation less reliable, which inevitably decreases the robustness of the learned model. In this article, we propose a prior label knowledge regularized self-representation PML approach, called PAKS, where the self-representation scheme and prior label knowledge are jointly incorporated into a unified framework. Specifically, we introduce a self-representation model with a low-rank constraint, which aims to learn the subspace representations of distinct instances and explore the high-order underlying correlation among different instances. Meanwhile, we incorporate prior label knowledge into the above self-representation model, where the prior label knowledge is regarded as the complement of features to obtain an accurate self-representation matrix. The core of PAKS is to take advantage of the data membership preference, which is derived from the prior label knowledge, to purify the discovered membership of the data and accordingly obtain more representative feature subspace for model induction. Enormous experiments on both synthetic and real-world datasets show that our proposed approach can achieve superior or comparable performance to state-of-the-art approaches.

Camouflaged object detection is a challenging task that aims to identify objects having similar texture to the surroundings. This paper presents to amplify the subtle texture difference between camouflaged objects and the background for camouflaged object detection by formulating multiple texture-aware refinement modules to learn the texture-aware features in a deep convolutional neural network. The texture-aware refinement module computes the biased co-variance matrices of feature responses to extract the texture information, adopts an affinity loss to learn a set of parameter maps that help to separate the texture between camouflaged objects and the background, and leverages a boundary-consistency loss to explore the structures of object details. We evaluate our network on the benchmark datasets for camouflaged object detection both qualitatively and quantitatively. Experimental results show that our approach outperforms various state-of-the-art methods by a large margin.

Graphs are essential to improve the performance of graph-based machine learning methods, such as spectral clustering. Various well-designed methods have been proposed to learn graphs that depict specific properties of real-world data. Joint learning of knowledge in different graphs is an effective means to uncover the intrinsic structure of samples. However, the existing methods fail to simultaneously mine the global and local information related to sample structure and distribution when multiple graphs are available, and further research is needed. Hence, we propose a novel intrinsic graph learning (IGL) with discrete constrained diffusion-fusion to solve the above problem in this article. In detail, given a set of the predefined graphs, IGL first obtains the graph encoding the global high-order manifold structure via the diffusion-fusion mechanism based on the tensor product graph. Then, two discrete operators are integrated to fine-prune the obtained graph. One of them limits the maximum number of neighbors connected to each sample, thereby removing redundant and erroneous edges. The other one forces the rank of the Laplacian matrix of the obtained graph to be equal to the number of sample clusters, which guarantees that samples from the same subgraph belong to the same cluster and vice versa. Moreover, a new strategy of weight learning is designed to accurately quantify the contribution of pairwise predefined graphs in the optimization process. Extensive experiments on six single-view and two multiview datasets have demonstrated that our proposed method outperforms the previous state-of-the-art methods on the clustering task.

Human brain is a complex yet economically organized system, where a small portion of critical hub regions support the majority of brain functions. The identification of common hub nodes in a population of networks is often simplified as a voting procedure on the set of identified hub nodes across individual brain networks, which ignores the intrinsic data geometry and partially lacks the reproducible findings in neuroscience. Hence, we propose a first-ever group-wise hub identification method to identify hub nodes that are common across a population of individual brain networks. Specifically, the backbone of our method is to learn common graph embedding that can represent the majority of local topological profiles. By requiring orthogonality among the graph embedding vectors, each graph embedding as a data element is residing on the Grassmannian manifold. We present a novel Grassmannian manifold optimization scheme that allows us to find the common graph embeddings, which not only identify the most reliable hub nodes in each network but also yield a population-based common hub node map. Results of the accuracy and replicability on both synthetic and real network data show that the proposed manifold learning approach outperforms all hub identification methods employed in this evaluation.

Enforcing admired machine learning approaches to huge data enhanced novel issues for researchers. Conventional libraries could not suitably fulfil the requirement of complex model with wide variety of data and system parameters. Therefore new methodologies are required performing the computation on more than one machine over distributed environment. Some distributed frameworks on huge data such as MapReduce and TensorFlow have been deployed to solve various machine learning problems in heterogeneous distributed environment. The objective of this paper is providing a wide variety of useful information about platforms, approaches, problems, datasets, and optimization approaches in distributed systems. So researchers have been used the beneficial information to develop new approaches for efficient machine learning. This paper also covers the various formats of data like structured, semi structured and unstructured big data. A brief review of previous works is also represented in text and tabular format to provide motivation to the researchers for developing new paradigm of distributed computing environment.

Policy-based chameleon hash (PCH) is one of the techniques used for rewriting transaction-level data stored in blockchains. This technique integrates the access policy of the attribute-based encryption (ABE) in the transactions and only allows users with attributes set satisfying the access policy to modify the transactions. However, some operations in the PCH-based rewritable blockchain solution require high computational cost which may impact the performance of user systems, especially on resource-constrained devices. To solve this problem, we propose an online/offline rewritable blockchain with auditable outsourced computation (OO-RB-AOC) scheme. We utilize the ring signature to ensure the credibility of multiple attribute authorities, and adopt the online/offline technique for generating the hash of the rewritable transaction. In addition, expensive computations (e.g., pairings) required for rewriting the transactions can be outsourced to the clouds. The users can rest assured that the computations from the clouds are correct with the audit mechanism of the proposed scheme. On the other hand, the proposed scheme offers a desirable feature for commercial application where the clouds can limit the number of outsourced requests according to the subscription of the users. We also prove the security of the proposed OO-RB-AOC scheme. Finally, we present a theoretical comparison and experimental analysis of the proposed scheme.

Privacy preserving data mining has much importance in the data analysis because it maintains confidential or highly sensitive data in the purpose of data analysis. Many perturbation techniques are developed, but do not perform well. There are used for different purposes in various techniques. Though, the reconstruction of original data can be done from the samples of perturbed data. It does not always preserve the distance that exists in the original data samples. During reconstruction of the original data, some of the information is loosed which is again a complex and time consuming task for traditional data mining algorithm. Therefore, a novel hybrid data perturbation technique is introduced that overcomes the above addressed issues. The proposed paper includes a novel data perturbation technique to hybridize the traditional Geometric Data Perturbation Technique along with the Euclidean distance method to preserve privacy. It obtains the distorted or perturbed data which is sampled at different intervals depending on the levels of privacy. The proposed approach attempts to reduce the tradeoffs that persists between privacy levels, accuracy and information loss. The experimental results for this approach is implemented using real world bench mark datasets downloaded from UCI Repositories using three different data mining clustering algorithms. It is shown that clustering accuracy is similar and fairly high for the perturbed data obtained from the proposed approach when matched with the original data set clustering algorithms. The analysis were shown for different privacy levels on different data samples.

In this article, we define a new class of functions on Riemannian manifolds, called geodesic \begin{document}$ \mathcal{E} $\end{document} -prequasi-invex functions. By a suitable example it has been shown that it is more generalized class of convex functions. Some of its characteristics are studied on a nonlinear programming problem. We also define a new class of sets, named geodesic slack invex set. Furthermore, a sufficient optimality condition is obtained for a nonlinear programming problem defined on a geodesic local \begin{document}$ \mathcal{E} $\end{document} -invex set.

In this paper, we propose a new class of optimal one-coincidence FHS (OC-FHS) sets with respect to the Peng-Fan bounds, including prime sequence sets and HMC sequence sets as special cases. Thereafter, through investigating their properties, we determine all of the FHS distances in the OC-FHS set. Finally, for a given positive integer, we also propose a new class of wide-gap one-coincidence FHS (WG-OC-FHS) sets where the FHS gap is larger than the given positive integer. Moreover, such a WG-OC-FHS set is optimal with respect to the WG-Lempel-Greenberger bound and the WG-Peng-Fan bounds simultaneously.

We consider relationships between Vandermonde sets and hyperovals. Hyperovals are Vandermonde sets, but in general, Vandermonde sets are not hyperovals. We give necessary and sufficient conditions for a Vandermonde set to be a hyperoval in terms of power sums. Therefore, we provide purely algebraic criteria for the existence of hyperovals. Furthermore, we give necessary and sufficient conditions for the existence of hyperovals in terms of \begin{document}$ g $\end{document} -functions, which can be considered as an analog of Glynn's Theorem for \begin{document}$ o $\end{document} -polynomials. We also get some important applications to Niho bent functions.

We propose an automatic ternary classification model for Bipolar Disorder (BD) states. As input information, the model uses speech signals from patients' audio-visual recordings of structured interviews. The model classifies the patient's clinical state as Mania, Hypo-Mania, or Remission. We capture Mel-Frequency Cepstral Coefficients (MFCCs) and Geneva Minimalistic Acoustic Parameter Set (GeMAPS) as audio features. We compute linguistic and sentiment features for each subject's transcript. We present a stacked ensemble classifier to classify all fused features after feature selection. A set of three homogeneous Convolutional Neural Networks (CNNs) and a Multi Layer Perceptron (MLP) construct the first-level and second-level of the stacked ensemble classifier respectively. Moreover, we use reinforcement learning to optimize the networks and their hyperparameters. We show that our stacked ensemble framework outperforms existing models on the BD Turkish corpus with a %59.3 Unweighted Average Unit (UAR) on the test set. To the best of our knowledge, this is the highest UAR achieved on this dataset.

For a graph G and a set Z of four distinct vertices of G, a diamond on Z is a subgraph of G such that, for some labeling Z = { v 1 , v 2 , v 3 , v 4 } , there are three internally disjoint paths P 1 , P 2 , P 3 with end vertices v 1 , v 2 with v 3 , v 4 on P 1 , P 2 , respectively. Therefore, this yields a K 4 − -subdivision with branch vertices on Z. We characterize graphs G that contain no diamond on a prescribed set Z of four vertices, under the assumption that for every v ∈ Z there are three paths of G from v to Z − { v } , mutually disjoint except for v. Moreover, we can find two “different” such subdivisions, if one exists. Our proof is based on Mader's S-paths theorem.

Nested data structures, in which conditions include multiple trials and are fully crossed with participants, are often analyzed using repeated-measures analysis of variance or mixed-effects models. Typically, researchers are interested in determining whether there is an effect of the experimental manipulation. These kinds of analyses have different appropriate specifications for the null and alternative models, and a discussion on which is to be preferred and when is sorely lacking. van Doorn et al. (2021) performed three types of Bayes factor model comparisons on a simulated data set in order to examine which model comparison is most suitable for quantifying evidence for or against the presence of an effect of the experimental manipulation. Here, we extend their results by simulating multiple data sets for various scenarios and by using different prior specifications. We demonstrate how three different Bayes factor model comparison types behave under changes in different parameters, and we make concrete recommendations on which model comparison is most appropriate for different scenarios.

Extraction of information in enterprise applications due to complex distribution of information in large identical sources. In such a scenario, a single approach or method for extracting information text would limit information needs, which would require a high level of work and time. So, it is an open problem in data analysis application to construct a suitable classification model for unsupervised datasets which having multi level of information attributes. It is vital to analyse and discover the valuable pattern information to support the accurate classification. Selection of attributes and construction of relation model always is a challenging due the increasing attribute dimensionality. So, it is important to learn and select the best attributes patterns to enhance the information association through accurate classification. In this paper, we propose an ARP-RW method for construction of Attribute Relation Pattern (ARP) through computing attributes Relation Weightage (RW) to enhance the information classification. The ARP-RW method provides the solution to identifying the relation class of the multi-attributes documents. It initially constructs an attribute relation class matrix (ARCM) utilizing the set of data collection and the RW value of the MLA. Later, it builds an ARP based on the MLA selected to perform accurate classification. The evaluation of the proposal method using the datasets of UCI Machine Learning Repository shows improvisation in comparison the existing approaches.

The Picture Fuzzy Set (PFS) is a broadening of the fuzzy set and intuitionistic fuzzy set. Pattern recognition, picture segmentation, and decision-making are some of the applications of PFS. The dissimilarity measure technique is used to illustrate a decision-making issue on an image fuzzy set in this article. Decision-making is a technique that enables a computer to think like a person, and it is critical for machine learning and the application of artificial intelligence to machines. These aids robots in thinking like humans. Finally, the suggested approach is presented in this article using a case study based on a survey of 100 consumers performed at a two-wheeler showroom.

The various extensions of the fuzzy set are considerably applied in many complex problems of real world to describes the improper information. The PFS (pythagorean fuzzy set) which is the expanded form of IFS (intuitionistic fuzzy set) is more applicable and precise to measure the uncertainty. The research work presents the novel entropy measure defined on PFS which satisfied axioms of the entropy. The entropy measure is determined the uncertainty that defined the fuzziness degree on the fuzzy set. The applicability of the entropy is verified in selection of the advertising company and results compared to the existing entropies defined on PFS. The outcomes of the illustrative example show that the new entropy measure is more precise, simpler, and consistent as compare to existing entropies on PFS.

This paper deals with automatic clustering algorithm, which partitions a many of objects to get smaller sets (clusters). Where objects of the one set are related to each other rather than to those in the other sets. The number of clusters in automatic clustering don’t given priori, they determinates automatically, the number resulted of clusters exact closed to the numbers of the real dataset structure. This paper represents a stimulus for the current study to introduce an algorithm that automatically finds the number of clusters based on distance among vertices. The study is based on the hypothesis that the proposed algorithm is able to efficiently find the clustering partitions for the whole dataset.

In this article, the event-triggered bipartite consensus problem for stochastic nonlinear multiagent systems (MASs) with unknown dead-zone input under the prescribed performance is studied. To surmount the influence of the dead-zone input, the dead-zone model is transformed into a linear term and a disturbance term. Meanwhile, the prescribed tracking performance is realized by developing a speed function, which means that all tracking errors of MASs can converge to a predefined set in a given finite time. Moreover, the unknown nonlinear dynamics are approximated by fuzzy-logic systems. By combining the dynamic surface approach and the Lyapunov stability theory, we design an adaptive event-triggered control algorithm, such that the bipartite consensus problem of stochastic nonlinear MASs can be achieved, and all signals are semiglobally uniformly ultimately bounded in probability of the closed-loop systems. Finally, simulation examples are proposed to verify the feasibility of the algorithm.

The way Data Science and Machine Learning have set modern trends for automation. It is thoughtful to simplify our day to day activities which are related to these domains. One such task is the repetitive submission of the same personal details while submitting any online form regarding academic or other purposes. The repetitiveness seems a bit dilatory. Plus, the involvement of machine learning further espouses the concept to automate re-iteration of personal details each time we fill a form, instead of manual entry. To obviate the above redundancy, we have proposed to implement “Exam Form Automation Using Facial Recognition” which includes real time face recognition with the help of webcam, pre-storing data on web servers with Panda and NumPy library of Python and then automating the entries on form using selenium library of python. The system captures a real time image of a user and collects the particular details from data hosted on a web server. Thus, precluding the monotonous procedure of manual entry.

Image deletion refers to removing images from a compressed image set in cloud servers, which has always received much attention. However, in some cases images are not successfully deleted, and coding performance still remains to rise. In this paper, we propose a low-complexity and high-coding-efficiency image deletion algorithm. First, all the images are classified into to-be-deleted images, images unneeded to be processed, and images needed to be processed further divided into images needed to be only decoded and images needed to be re-encoded. Then, we also propose a depth- and subtree-constrained minimum spanning tree (DSCMST) heuristics to produce the DSCMST of images needed to be processed. Third, every image unneeded to be processed is added to the just obtained DSCMST as the child of the vertex that is still its parent in the compressed image set. Finally, after the encoding of images needed to be re-encoded, a new compressed image set is constructed, implying the completion of image deletion. Experimental results show that under various circumstances our proposed algorithm can effectively remove any images, including root vertex, internal vertices, and leaf vertices. Moreover, compared with state-of-the-art methods, the proposed algorithm achieves higher coding efficiency while having the minimum complexity.

Knowledge graph embedding is an effective way to represent knowledge graph, which greatly enhance the performances on knowledge graph completion tasks, e.g. entity or relation prediction. For knowledge graph embedding models, designing a powerful loss framework is crucial to the discrimination between correct and incorrect triplets. Margin-based ranking loss is a commonly used negative sampling framework to make a suitable margin between the scores of positive and negative triples. However, this loss can not ensure ideal low scores for the positive triplets and high scores for the negative triplets, which is not beneficial for knowledge completion tasks. In this paper, we present a double limit scoring loss to separately set upper bound for correct triplets and lower bound for incorrect triplets, which provides more effective and flexible optimization for knowledge graph embedding. Upon the presented loss framework, we present several knowledge graph embedding models including TransE-SS, TransH-SS, TransD-SS, ProjE-SS and ComplEx-SS. The experimental results on link prediction and triplet classification show that our proposed models have the significant improvement compared to state-of-the-art baselines.

Multi-set membership queries are fundamental operations in data science. In this paper, we propose a new data structure for multi-set membership queries, named coloring embedder, which is fast, accurate, and memory efficient. The idea of coloring embedder is to first map elements to a high-dimensional space, which nearly eliminates hashing collisions, and then use a dimensional reduction representation, similar to coloring a graph, to save memory. Theoretical proofs and experimental results show that the coloring embedder is effective in solving the problem of multi-set membership queries. We also find that web cache sharing is one of the typical application scenarios of the multi-set membership queries and current methods based on Bloom filters always send redundant queries. We apply coloring embedder to web cache sharing by arranging our data structure on the on-chip and off-chip memory and designing query, insertion and deletion operations for this scenario. The experimental results show that compared with the present method, our method can reduce the queries sent by proxies while reaching equal hit rate with the same size of on-chip memory. The source code of coloring embedder has been released on Github.

We establish conditions under which forecasting performance can be improved by rotating between a set of underlying forecasts whose predictive accuracy is tracked using a set of time-varying monitoring instruments. We characterize the properties that the monitoring instruments must possess to be useful for identifying, at each point in time, the best forecast and show that these reflect both the accuracy of the predictors used by the underlying forecasting models and the strength of the monitoring instruments. Finite-sample bounds on forecasting performance that account for estimation error are used to compute the expected loss of the competing forecasts as well as for the dynamic rotation strategy. Finally, using Monte Carlo simulations and empirical applications to forecasting inflation and stock returns, we demonstrate the potential gains from using conditioning information to rotate between forecasts.

In semi-supervised video object segmentation (VOS) task, temporal coherent object-level cues play a key role yet are hard to accurately model. To this end, this paper presents an object-aware global-local correspondence architecture, which enables to extract the inter-frame temporal coherent object-level features for accurate VOS. Specifically, we first generate a set of object masks by the ground-truth segmentation, and then we squeeze the current frame representation inside the object masks into a set of global object embeddings. Second, we compute the similarity between each embedding and the feature map, producing an object-aware weight for each pixel. The object-aware feature at each pixel is then constructed by summing the object embeddings weighted by their corresponding object-aware weights, which is able to capture rich object category information. Third, to establish the accurate correspondences between the inter-frame temporal coherent cues, we further design a novel global-local correspondence module to refine the temporal feature representations. Finally, we augment the object-aware features with the global-local aligned information to produce a strong spatio-temporal representation, which is essential to a more reliable pixel-wise segmentation prediction. Extensive evaluations are conducted on three popular VOS benchmarks containing Youtube-VOS, Davis2017 and Davis2016, demonstrating that the proposed method achieves favourable performance compared to the state-of-the-arts.

This article analyzes the exponentially stable problem of neural networks (NNs) with two additive time-varying delay components. Disparate from the previous solutions on this similar model, switching ideas, that divide the time-varying delay intervals and treat the small intervals as switching signals, are introduced to transfer the studied problem into a switching problem. Besides, delay-dependent switching adjustment indicators are proposed to construct a novel set of augmented multiple Lyapunov-Krasovskii functionals (LKFs) that not only satisfy the switching condition but also make the suitable delay-dependent integral items be in the each corresponding LKF based on each switching mode. Combined with some switching techniques, some less conservativeness stability criteria with different numbers of switching modes are obtained. In the end, two simulation examples are performed to demonstrate the effectiveness and efficiency of the presented methods comparing other available ones.

In this paper, we study a novel service reliability augmentation problem in an Edge Computing network, where mobile users request network services with a service function chain (SFC) and reliability expectation requirements. To enhance the service reliability of user requests, it is a common practice to make use of redundant network function (VNF) instance placement in case their primary VNF instances fail. To this end, we first formulate a novel service reliability augmentation problem for each admitted request and show the NP-hardness of the problem. We then provide an admission framework of user requests by placing primary VNF instances of network functions in the SFC to different cloudlets, and then develop a randomized algorithm with a good approximation ratio and high probability for the service reliability augmentation problem, at the expense of moderate resource constraint violations. We also devise a deterministic heuristic for the problem without any resource violation. We thirdly extend the proposed algorithm for a single request to the service reliability augmentation problem for a set of requests. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and superior to their analytical counterparts.

Classical data cleaning performs a minimal set of operations on the data to satisfy the given integrity constraints. Often, this minimization is equivalent to vertex cover, for example when tuples can be removed due to the violation of functional dependencies. Classically, the uncertainty of tuples and constraints is ignored. We propose not to view data as dirty but the uncertainty information about data. Since probabilities are often unavailable and their treatment is limited due to correlations in the data, we investigate a qualitative approach to uncertainty. Tuples are assigned degrees of possibility with which they occur, and constraints are assigned degrees of certainty that say to which tuples they apply. Our approach is non-invasive to the data as we lower the possibility degree of tuples as little as possible. The new resulting qualitative version of vertex cover remains NP-hard. We establish an algorithm that is fixed-parameter tractable in the size of the qualitative vertex cover. Experiments with synthetic and real-world data show that our algorithm outperforms the classical algorithm proportionally to the available number of uncertainty degrees. Based on the novel mining of the certainty degrees with which constraints hold, our framework becomes applicable even when uncertainty information is unavailable.

We introduce the problem of clustering the set of vertices in a given 3D mesh. The problem is motivated by the need for value engineering in architectural projects. We first derive a max-norm based metric to estimate the geometric disparity between a given pair of vertices, and characterize the problem in terms of this measure. We show that this distance can be computed by using Sequential Quadratic Programming (SQP). Next we introduce two different algorithms for clustering the set of vertices on a given mesh, respectively based on two disparity measurements: max-norm and L2-norm based metric. An equivalence is established between mesh vertices and physical joints in an architectural mesh. By replacing individual joints by their equivalent cluster representative, the number of unique joints in the facade mesh, and therefore the fabrication cost, is dramatically reduced. Finally, we present an algorithm for remeshing a given surface in order to further reduce the number of joint clusters. The framework is tested for a set of real-world architectural surfaces to illustrate the effectiveness and utility of our approach. Overall, this approach tackles the important problem reducing fabrication cost of joints without modifying the underlying connectivity that was specified by the architect.

To identify the abnormal characteristics of the oplegnathus punctatus is great importance to the detection of iridovirus disease in the breeding environment. In this paper, an advanced neural network model to identify the characteristics of the oplegnathus punctatus and predict its different periods of suffering from iridovirus disease is proposed based on the establishment of a data set. First of all, a standard format data set of oplegnathus punctatus and an abnormal format date set are established in order to verify the effectiveness of the method in this paper. And then, the feature extraction fusion method is used for preprocessing in terms of the abnormal format data set, which combines the edge features extracted by the improved multi-template Sobel operator and the color features extracted by the HSV model. Finally, an improved VGG-GoogleNet network recognition model comes into being through the fusion and improvement of the VGG and GoogleNet neural network structure. The experiments results show that the prediction accuracy rate for oplegnathus punctatus suffering from iridovirus disease in the the abnormal format data set and the standard format data set are improved, which reach 98.55% and 69.18%.

A mixed-integer programming (MIP) problem contains both constraints and integer restrictions. Integer restrictions divide the feasible region defined by constraints into multiple discontinuous feasible parts. In particular, the number of discontinuous feasible parts will drastically increase with the increase of the number of integer decision variables and/or the size of the candidate set of each integer decision variable. Due to the fact that the optimal solution is located in one of the discontinuous feasible parts, it is a challenging task to solve a MIP problem. This article presents a cutting and repulsion-based evolutionary framework (called CaR) to solve MIP problems. CaR includes two main strategies: 1) the cutting strategy and 2) the repulsion strategy. In the cutting strategy, an additional constraint is constructed based on the objective function value of the best individual found so far, the aim of which is to continuously cut unpromising discontinuous feasible parts. As a result, the probability of the population entering a wrong discontinuous feasible part can be decreased. In addition, in the repulsion strategy, once it has been detected that the population has converged to a discontinuous feasible part, the population will be reinitialized. Moreover, a repulsion function is designed to repulse the previously explored discontinuous feasible parts. Overall, the cutting strategy can significantly reduce the number of discontinuous feasible parts and the repulsion strategy can probe the remaining discontinuous feasible parts. Sixteen test problems developed in this article and two real-world cases are used to verify the effectiveness of CaR. The results demonstrate that CaR performs well in solving MIP problems.

Single-inductor multi-port converters have great application potential due to their “more silicon less magnetic” feature. However, the recent topology design methods, such as the forward design and reverse design, require strong power electronics knowledge, which troubles the application engineers lacking power electronics background. In this paper, a topology deduction method based on Reinforcement Learning (RL) is proposed to gain the benefits of both forward and inverse design. The proposed method uses a neural network (NN) for forward design, and takes a set of simple rules to give rewards for reverse design. With RL, the NN sums up experience during trial-and-error without human intervention, and finally finds the topology that gains the highest reward. Benefits of this method include: (1) it only requires design specifications such as components and port voltage as inputs and some simple rules as rewards, avoiding complicated feature predesign; (2) it allows the deduction to be started from any pre-connection, satisfying the prior constraints of application engineers, and (3) it can recommend several actions at each step, providing good diversity of deduction results. Using this method, many topologies in the literatures are deduced, and some new topologies are also found. One of the topologies is experimentally tested and the results show the validity.

Knee points, characterized as a small improvement on one objective can lead to a significant degradation on at least one of the other objectives, are attractive to decision makers in multi-criterion decision-making. This paper presents a simple and effective knee point identification method to help decision makers identify solution(s) of interest from a given set of trade-off solutions thus facilitating posterior decision-making. Our basic idea is to sequentially validate whether a solution is a knee point or not by comparing its localized trade-off utility with others within its neighborhood characterized from a decomposition perspective. In particular, a solution is a knee point if and only if it has the best localized trade-off utility among its neighbors. We implement a GPU version that carries out the knee point identification in a parallel manner. This GPU version reduces the worst-case complexity from quadratic to linear. The performance of our proposed method is compared with five state-of-the-art knee point identification methods on 134 test problem instances and two real-world engineering design problems. Empirical results demonstrate its outstanding performance especially on problems with many local knee points. We further validate the usefulness of our proposed method for guiding evolutionary multi-objective optimization algorithms to search for knee points on the fly during the evolutionary process.

One-class collaborative filtering (OCCF) problems are prevalent in real-world recommender systems, such as news and music recommendation, but suffer from sparsity issues and particularly lack negatively preferred items. To address the challenge, the state-of-the-art algorithms assigned uninteracted items smaller weights of being negative and performed low-rank approximation over a user-item interaction matrix. However, the prior ratings of uninteracted items are usually set to zero but may not well-defined. To avert the prior ratings of uninteracted items, in this paper, we propose a novel ranking-based implicit regularizer by hypothesizing that users preference scores for uninteracted items are close to each other. The regularizer is then used in a ranking-based OCCF framework to penalize large difference of preference scores between uninteracted items. To optimize model parameters in this framework, we develop a scalable alternating least square algorithm and coordinate descent algorithm, whose time complexity is linearly proportional to data size. Finally, we extensively evaluate the proposed algorithms with six real-world datasets. The results show that the proposed regularizer significantly improves recommendation quality of ranking-based OCCF algorithms, such as BPRMF and RankALS. Moreover, the ranking-based framework with the proposed regularizer outperforms the state-of-the-art recommendation algorithms for implicit feedback.

Colormapping is an effective and popular visualization technique for analyzing patterns in scalar fields. Scientists usually adjust a default colormap to show hidden patterns by shifting the colors in a trial-and-error process. To improve efficiency, efforts have been made to automate the colormap adjustment process based on data properties (e.g., statistical data value or histogram distribution). However, as the data properties have no direct correlation to the spatial variations, previous methods may be insufficient to reveal the dynamic range of spatial variations hidden in the data. To address the above issues, we conduct a pilot analysis with domain experts and summarize three requirements for the colormap adjustment process. Based on the requirements, we formulate colormap adjustment as an objective function, composed of a boundary term and a fidelity term, which is flexible enough to support interactive functionalities. We compare our approach with alternative methods under a quantitative measure and a qualitative user study (25 participants), based on a set of data with broad distribution diversity. We further evaluate our approach via three case studies with six domain experts. Our method is not necessarily more optimal than alternative methods of revealing patterns, but rather is an additional color adjustment option for exploring data with a dynamic range of spatial variations.

With increasing of data size and development of multi-core computers, asynchronous parallel stochastic optimization algorithms such as KroMagnon have gained significant attention. In this paper, we propose a new Sparse approximation and asynchronous parallel Stochastic Variance Reduced Gradient (SSVRG) method for sparse and high-dimensional machine learning problems. Unlike standard SVRG and its asynchronous parallel variant, KroMagnon, the snapshot point of SSVRG is set to the average of all the iterates in the previous epoch, which allows it to take much larger learning rates and makes it more robust to the choice of learning rates. In particular, we use the sparse approximation of the popular SVRG estimator to perform completely sparse updates. Therefore, SSVRG has a much lower per-iteration computational cost than its dense counterpart, SVRG++, and is very friendly to asynchronous parallel implementation. Moreover, we provide the convergence guarantees of SSVRG for both SC and non-SC problems, while existing asynchronous algorithms (e.g., KroMagnon) only have convergence guarantees for SC problems. Finally, we extend SSVRG to non-smooth and asynchronous parallel settings. Numerical results demonstrate that SSVRG converges significantly faster than the state-of-the-art asynchronous parallel methods, e.g., KroMagnon, and is usually more than three orders of magnitude faster than SVRG++.