Search

In the field of fashion design, designing garment image according to texture is actually changing the shape of texture image, and image-to-image translation based on Generative Adversarial Network (GAN) can do this well. This can help fashion designers save a lot of time and energy. GAN-based image-to-image translation has made great progress in recent years. One of the image-to-image translation models--StarGAN, has realized the function of multi-domain image-to-image translation by using only a single generator and a single discriminator. This paper details the use of StarGAN to complete the task of garment design. Users only need to input an image and a label for the garment type to generate garment images with the texture of the input image. However, it was found that the quality of the generated images is not satisfactory. Therefore, this paper introduces some improvements on the structure of the StarGAN generator and the loss function of StarGAN, and a model was obtained that can be better applied to garment design. It is called GD-StarGAN. This paper will demonstrate that GD-StarGAN is much better than StarGAN when it comes to garment design, especially in texture, by using a set of seven categories of garment datasets.

In recent times, deep artificial neural networks have achieved many successes in pattern recognition. Part of this success can be attributed to the reliance on big data to increase generalization. However, in the field of time series recognition, many datasets are often very small. One method of addressing this problem is through the use of data augmentation. In this paper, we survey data augmentation techniques for time series and their application to time series classification with neural networks. We propose a taxonomy and outline the four families in time series data augmentation, including transformation-based methods, pattern mixing, generative models, and decomposition methods. Furthermore, we empirically evaluate 12 time series data augmentation methods on 128 time series classification datasets with six different types of neural networks. Through the results, we are able to analyze the characteristics, advantages and disadvantages, and recommendations of each data augmentation method. This survey aims to help in the selection of time series data augmentation for neural network applications.

Learning transfer (i.e. accelerated learning over a series of structurally related learning tasks) differentiates species and age-groups, but the evolutionary and developmental implications of such differences are unclear. To this end, the relational schema induction paradigm employing tasks that share algebraic (group-like) structures was introduced to contrast stimulus-independent (relational) versus stimulus-dependent (associative) learning processes. However, a theory explaining this kind of relational learning transfer has not been forthcoming beyond a general appeal to some form of structure-mapping, as typically assumed in models of analogy. In this paper, we provide a theory of relational schema induction as a “reconstruction” process: the algebraic structure underlying transfer is reconstructed by comparing stimulus relations, learned within each task, for structural consistency across tasks—formally, the theory derives from a category theory version of Tannakian reconstruction. The theory also applies to non-human studies of relational concepts, thereby placing human and non-human transfer on common ground for sharper comparison and contrast. As the theory and paradigm do not depend on linguistic ability, we also have a way for pinpointing where aspects of human learning diverge from other species without begging the question of language., Author summary Learning transfer—an improvement in the rate of learning over a series of learning tasks—differs between species and age-groups, but the implications of such differences are unclear. Relational schema induction is a form of learning transfer that highlights relational aspects of learning. However, a theory explaining this kind of induction and transfer has not been forthcoming beyond a general appeal to some form of analogical mapping, as typically assumed in models of analogy. I present a theory of relational schema induction as a “reconstruction” process: the common structure affording transfer is reconstructed by comparing stimulus relations learned within each task for structural consistency across tasks. The theory also applies to non-human studies of relational concepts, thereby placing human and non-human studies on common ground for a clearer comparison and contrast.

In this paper, two new aggregation operators based on Choquet integral, namely the induced generalized interval neutrosophic Choquet integral average operator(IGINCIA) and the induced generalized interval neutrosophic Choquet integral geometric operator(IG-INCIG), are proposed for multi-criteria decision making problems (MCDM). Firstly, the criteria are dependent to each other and the evaluation information of the criteria are expressed by interval neutrosophic numbers. Moreover, two indices which are inspired by the geometrical structure are established to compare the interval neutrosophic numbers. Then, a MCDM method is proposed based on the proposed aggregation operators and ranking indices to cope with MCDM with interactive criteria. Lastly, an investment decision making problem is provided to illustrate the practicality and effectiveness of the proposed approach. The validity and advantages of the proposed method are analyzed by comparing with some existing approaches. By a numerical example in company investment to expand business though five alternatives with considering four criteria, the optimal decision is made.

Two critical tasks in multi-criteria group decision making (MCGDM) are to describe criterion values and to aggregate the described information to generate a ranking of alternatives. A flexible and superior tool for the first task is q-rung orthopair fuzzy number (qROFN) and an effective tool for the second task is aggregation operator. So far, nearly thirty different aggregation operators of qROFNs have been presented. Each operator has its distinctive characteristics and can work well for specific purpose. However, there is not yet an operator which can provide desirable generality and flexibility in aggregating criterion values, dealing with the heterogeneous interrelationships among criteria, and reducing the influence of extreme criterion values. To provide such an aggregation operator, Muirhead mean operator, power average operator, partitioned average operator, and Archimedean T-norm and T-conorm operations are concurrently introduced into q-rung orthopair fuzzy sets, and an Archimedean power partitioned Muirhead mean operator of qROFNs and its weighted form are presented and a MCGDM method based on the weighted operator is proposed in this paper. The generalised expressions of the two operators are firstly defined. Their properties are explored and proved and their specific expressions are constructed. On the basis of the specific expressions, a method for solving the MCGDM problems based on qROFNs is then designed. Finally, the feasibility and effectiveness of the method is demonstrated via a numerical example, a set of experiments, and qualitative and quantitative comparisons.

Managing the biodiversity extinction crisis requires wise decision-making processes able to account for the limited resources available. In most decision problems in conservation biology, several conflicting objectives have to be taken into account. Most methods used in conservation either provide suboptimal solutions or use strong assumptions about the decision-maker’s preferences. Our paper reviews some of the existing approaches to solve multi-objective decision problems and presents new multi-objective linear programming formulations of two multi-objective optimization problems in conservation, allowing the use of a reference point approach. Reference point approaches solve multi-objective optimization problems by interactively representing the preferences of the decision-maker with a point in the criteria (objectives) space, called the reference point. We modelled and solved the following two problems in conservation: a dynamic multi-species management problem under uncertainty and a spatial allocation resource management problem. Results show that the reference point method outperforms classic methods while illustrating the use of an interactive methodology for solving combinatorial problems with multiple objectives. The method is general and can be adapted to a wide range of ecological combinatorial problems.

In the last years, there has been a considerable increase of research into the neuroimaging correlates of inter-individual temperament and character variability-an endeavour for which the term 'personality neuroscience' was coined. Among other neuroimaging modalities and approaches, substantial work focuses on functional connectivity in resting state (rs-FC) functional magnetic resonance imaging data. In the current paper, we set out to independently query the questions asked in a highly cited study that reported a range of functional connectivity correlates of personality dimensions assessed by the widely used 'Big Five' Personality Inventory. Using a larger sample (84 subjects) and an equivalent data analysis pipeline, we obtained widely disagreeing results compared to the original study. Overall, the results were in line with the hypotheses of no relation between functional connectivity and personality, when more precise permutation-based multiple testing procedures were applied. The results demonstrate that as with other neuroimaging studies, great caution should be applied when interpreting the findings, among other reasons due to multiple testing problem involved at several levels in many neuroimaging studies. Of course, the current study results can not ultimately disprove the existence of some link between personality and brain's intrinsic functional architecture, but clearly shows that its form is very likely different and much more subtle and elusive than was previously reported.

Muirhead mean (MM) is a well-known aggregation operator which can consider interrelationships among any number of arguments assigned by a variable vector. Besides, it is a universal operator since it can contain other general operators by assigning some special parameter values. However, the MM can only process the crisp numbers. Inspired by the MM' advantages, the aim of this paper is to extend MM to process the intuitionistic fuzzy numbers (IFNs) and then to solve the multi-attribute group decision making (MAGDM) problems. Firstly, we develop some intuitionistic fuzzy Muirhead mean (IFMM) operators by extending MM to intuitionistic fuzzy information. Then, we prove some properties and discuss some special cases with respect to the parameter vector. Moreover, we present two new methods to deal with MAGDM problems with the intuitionistic fuzzy information based on the proposed MM operators. Finally, we verify the validity and reliability of our methods by using an application example, and analyze the advantages of our methods by comparing with other existing methods.

Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at https://github.com/IneMelckenbeeck/equation-generator and https://github.com/IneMelckenbeeck/graphlet-naming.