MILP approach to pattern generation in logical analysis of data

Pattern generation methods for the Logical Analysis of Data (LAD) have been term-enumerative in nature. In this paper, we present a Mixed 0-1 Integer and Linear Programming (MILP) approach that can identify LAD patterns that are optimal with respect to various previously studied and new pattern selection preferences. Via art of formulation, the MILP-based method can generate optimal patterns that also satisfy user-specified requirements on prevalence, homogeneity and complexity. Considering that MILP problems with hundreds of 0-1 variables are easily solved nowadays, the proposed method presents an efficient way of generating useful patterns for LAD. With extensive experiments on benchmark datasets, we demonstrate the utility of the MILP-based pattern generation.     

一类反应扩散系统的分歧与斑图

本文研究了一类发生在密闭容器中的不可激活的高次自催化反应扩散系统．在适当的条件下,用渐进近似的方法讨论了系统平衡态的稳定范围;用多重尺度的方法证明了当扩散系数λ充分小时,系统出现两种类型的斑图,一类是由Hopf分歧引出的驻波斑图;另一类是由 Pitchfork分歧引出的定波斑图．进一步还讨论了,在分歧点附近,对于大于空间或等于空间波数的小扰动,斑图是局部稳定的,而小于自身空间波数的小扰动,斑图是不稳定的．     

Adjustment patterns and equilibrium selection in experimental signaling games

This paper examines the relation between adjustment patterns and equilibrium selection in laboratory experiments with two types of simple signaling games. One type of game has two Nash equilibria, of which only one is sequential. The other type has two sequential equilibria, only one of them satisfying equilibrium dominance. For each type of game, the results show that variations in the payoff structure, which do not change the equilibrium configuration, generate different adjustment patterns. As a consequence, the less refined equilibrium is more frequently observed for some payoff structures, while the more refined equilibrium is more frequently observed in others.     

Emergence of coherent motion in aggregates of motile coupled maps

In this paper we study the emergence of coherence in collective motion described by a system of interacting motiles endowed with an inner, adaptative, steering mechanism. By means of a nonlinear parametric coupling, the system elements are able to swing along the route to chaos. Thereby, each motile can display different types of behavior, i.e. from ordered to fully erratic motion, accordingly with its surrounding conditions. The appearance of patterns of collective motion is shown to be related to the emergence of interparticle synchronization and the degree of coherence of motion is quantified by means of a graph representation. The effects related to the density of particles and to interparticle distances are explored. It is shown that the higher degrees of coherence and group cohesion are attained when the system elements display a combination of ordered and chaotic behaviors, which emerges from a collective self-organization process.     

An investigation of statistical thinking in two different contexts: Detecting a signal in a noisy process and determining a typical value

The study describes students’ patterns of thinking for statistical problems set in two different contexts. Fifteen students representing a wide range of experiences with high school mathematics participated in problem-solving clinical interview sessions. At one point during the interviews, each solved a problem that involved determining the typical value within a set of incomes. At another point, they solved a problem set in a signal-versus-noise context [Konold, C., & Pollatsek, A. (2002). Data analysis as the search for signals in noisy processes. Journal for Research in Mathematics Education, 33, 259-289]. Several patterns of thinking emerged in the responses to each task. In responding to the two tasks, some students attempted to incorporate formal measures, while others used informal estimating strategies. The different types of thinking employed in using formal measures and informal estimates are described. The types of thinking exhibited in the signal-versus-noise context are then compared against those in the typical value context. Students displayed varying amounts of attention to both data and context in formulating responses to both problems. Suggestions for teachers in regard to helping students attend to both data and context when analyzing statistical data are given.     

Rogue wave patterns associated with Okamoto polynomial hierarchies

We show that new types of rogue wave patterns exist in integrable systems, and these rogue patterns are described by root structures of Okamoto polynomial hierarchies. These rogue patterns arise when the τ functions of rogue wave solutions are determinants of Schur polynomials with index jumps of three, and an internal free parameter in these rogue waves gets large. We demonstrate these new rogue patterns in the Manakov system and the three-wave resonant interaction system. For each system, we derive asymptotic predictions of its rogue patterns under a large internal parameter through Okamoto polynomial hierarchies. Unlike the previously reported rogue patterns associated with the Yablonskii–Vorob'ev hierarchy, a new feature in the present rogue patterns is that the mapping from the root structure of Okamoto-hierarchy polynomials to the shape of the rogue pattern is linear only to the leading order, but becomes nonlinear to the next order. As a consequence, the current rogue patterns are often deformed, sometimes strongly deformed, from Okamoto-hierarchy root structures, unless the underlying internal parameter is very large. Our analytical predictions of rogue patterns are compared to true solutions, and excellent agreement is observed, even when rogue patterns are strongly deformed from Okamoto-hierarchy root structures.     

Structural equivalence of individuals in social networks

The aim of this paper is to understand the interrelations among relations within concrete social groups. Social structure is sought, not ideal types, although the latter are relevant to interrelations among relations. From a detailed social network, patterns of global relations can be extracted, within which classes of equivalently positioned individuals are delineated. The global patterns are derived algebraically through a ‘functorial’ mapping of the original pattern. Such a mapping (essentially a generalized homomorphism) allows systematically for concatenation of effects through the network. The notion of functorial mapping is of central importance in the ‘theory of categories,’ a branch of modern algebra with numerous applications to algebra, topology, logic. The paper contains analyses of two social networks, exemplifying this approach.     

The henomeric types of 2-sided patterns in the plane

We extend the classification of pattern types by Grünbaum and Shephard to the 2-sided plane to include patterns having layered or interlaced motifs. Such patterns may have symmetries that turn the plane over. There are 17 infinite families of pattern types for 2-sided rosettes (twelve 1-parameter families and five 2-parameter families), 68 types of 2-sided frieze pattern, and 264 types of 2-sided periodic pattern. The definition of ‘henomeric’ is clarified to ensure that two of the periodic patterns are distinguished.      

Chaotic and fractal patterns for interacting nonlinear waves

Using an appropriate reduction method, a quite general new integrable system of equations 2 + 1 dimensions can be derived from the dispersive long-wave equation. Various soliton and dromion solutions are obtaining by selecting some types of solutions appropriately. The interaction between the localized solutions is completely elastic, because they pass through each other and preserve their shapes and velocities, the only change being a phase shift. The arbitrariness of the functions included in the general solution implies that approximate lower dimensional chaotic patterns such as chaotic–chaotic patterns, periodic–chaotic patterns, chaotic line soliton patterns and chaotic dromion patterns can appear in the solution. In a similar way, fractal dromion patterns and stochastic fractal excitations also exist for appropriate choices of the boundary conditions and/or initial conditions.     

Classes of finite relations as initial abstract data types I

The aim of this paper is to give axiomatizations for sixteen types of finite relations. These classes of relations are obtained as intersections of the following basic classes of relations: total relations, surjective relations, partial functions, and injective relations.

A normal form for all relations is given and each of the sixteen types of relations is (syntactically) characterized by certain additional conditions on this normal form.

For each of the sixteen types T, a set of identities E_T is singled out. The class of relations of type T forms an initial algebra in the category of all algebras which satisfy E_T. In the first part of this paper, for each type T the involved algebras are symmetric strict monoidal categories (in the sense of MacLane), enriched with certain specific constants.     

Manifold construction based on local distance invariance

This paper presents a distance invariant manifold that preserves the neighborhood relations among data patterns. All patterns have their corresponding cells in the manifold space. The constellation of neighborhood cells closely resembles that of patterns. The manifold is invariant under the translation, rotation and scale of the pattern coordinates. The neighborhood relations among cells are adjusted and improved in each iteration according to the reduction of the distance preservation energy.     

The compact and noncompact structures for two types of generalized Camassa–Holm–KP equations

The objective of this paper is to investigate two types of generalized nonlinear Camassa–Holm–KP equations in (2+1) dimensional space. Compactons, solitons, solitary patterns, periodic solutions and algebraic travelling wave solutions are expressed analytically under various circumstances. The conditions that cause the qualitative change in the physical structures of the solutions are emphasized.     

K-Controllability and Approximate K-Controllability of Nonlinear Neutral Systems in Banach Spaces

In this paper, K-controllability and approximate K-controllability of non-linear neutral differential equations in Banach spaces are studied. Sufficient conditions are established for each of these types of controllability. The results are obtained by using Leray-Schauder theory.     

Optimisation of gravity-fed water distribution network design: A critical review

This paper surveys the literature on the optimisation of water distribution network design. The water distribution network design (WDND) optimisation problem entails finding the material and diameter of each pipe in the network so that the total cost of the network is minimised without violating any hydraulic constraints. This is a difficult combinatorial optimisation problem, in which decision variables are discrete and both cost function and constraints are non-linear. Over the past 30 years, a large number of methods, especially in the field of (meta) heuristics, have been developed to solve this problem, most of which obtain good results on the available benchmark networks. In addition to outlining the basic features of each method, a detailed computational comparison is presented. Based on this comparison, some issues with the current state of the art in this domain are discussed, and some future research directions are suggested. Additionally, the need for an adequate set of benchmark instances is motivated, and the minimal requirements for an instance set generator are discussed.     

A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline

This paper considers a simple discrete-time queueing model with two types (classes) of customers (types 1 and 2) each having their own dedicated server (servers A and B resp.). New customers enter the system according to a general independent arrival process, i.e., the total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. Service times are deterministically equal to 1 slot each. The system uses a “global FCFS” service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their types. As a consequence of the “global FCFS” rule, customers of one type may be blocked by customers of the other type, in that they may be unable to reach their dedicated server even at times when this server is idle, i.e., the system is basically non-workconserving. One major aim of the paper is to estimate the negative impact of this phenomenon on the queueing performance of the system, in terms of the achievable throughput, the system occupancy, the idle probability of each server and the delay. As it is clear that customers of different types hinder each other more as they tend to arrive in the system more clustered according to class, the degree of “class clustering” in the arrival process is explicitly modeled in the paper and its very direct impact on the performance measures is revealed. The motivation of our work are systems where this kind of blocking is encountered, such as input-queueing network switches or road splits.     

Effects of power law logistic technologies on economic growth

Based on the S-shaped power law logistic technology, we set up an economic growth model in this paper. The solution of the model is given via hypergeometric functions. We show that the dynamics of the model is asymptotically stable. And, it is found that the dynamics of the model is actually controlled by the power law logistic function through an ordinary logistic function, as a power function of the power law logistic. From the statistical point of view, in this paper, three different types of power law index means three different types of skewness, giving three different types of growth and diffusion patterns of technology. Then, we show some comparison results of different types of technology and of different initial levels of capital, and their effects on economic growth. A numerical example is also given in this paper to illustrate the effects.     

Chaos, solitons and fractals in (2 + 1)-dimensional KdV system derived from a periodic wave solution

With the help of an extended mapping method and a linear variable separation method, new types of variable separation solutions (including solitary wave solutions, periodic wave solutions and rational function solutions) with two arbitrary functions for (2 + 1)-dimensional Korteweg–de Vries system (KdV) are derived. Usually, in terms of solitary wave solutions and rational function solutions, one can find some important localized excitations. However, based on the derived periodic wave solution in this paper, we find that some novel and significant localized coherent excitations such as dromions, peakons, stochastic fractal patterns, regular fractal patterns, chaotic line soliton patterns as well as chaotic patterns exist in the KdV system as considering appropriate boundary conditions and/or initial qualifications.     

大学评价与黄金分割

根据教育部对学科门的划分及大学各学科门的比例对高校进行分类,再利用模糊聚类方法从教学、科研两方面分别进行分型.当阈值降至黄金分割位0.618附近时,刚好分成了四个型,称之为:教学Ⅰ,Ⅱ,Ⅲ,Ⅳ型和科研Ⅰ,Ⅱ,Ⅲ,Ⅳ型,然后根据每个学校的类和教学、科研两方面的型给出他们的类型结果.     

Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks

Variable neighborhood search (VNS) and Greedy randomized adaptive search procedure (GRASP) are among the well studied local search based metaheuristics providing good results for many combinatorial optimization problems throughout the last decade. While they are usually explored in different environments one may encounter quite obvious commonalities. Based on previous successful applications of these two types of metaheuristics on various network design problems in telecommunications, we further enhance these approaches by incorporating ideas from the pilot method. The different heuristics are compared among each other as well as against objective function values obtained from a mathematical programming formulation based on a commercial solver. The problem instances cover a large variety of networks and demand patterns.     

A compact optimization model for the tail assignment problem

This paper investigates a new model for the so-called Tail Assignment Problem, which consists in assigning a well-identified airplane to each flight leg of a given flight schedule, in order to minimize total cost (cost of operating the flights and possible maintenance costs) while complying with a number of operational constraints. The mathematical programming formulation proposed is compact (i.e., involves a number of $0?1$ decision variables and constraints polynomial in the problem size parameters) and is shown to be of significantly reduced dimension as compared with previously known compact models. Computational experiments on series of realistic problem instances (obtained by random sampling from real-world data set) are reported. It is shown that with the proposed model, current state-of-the art MIP solvers can efficiently solve to exact optimality large instances representing 30-day flight schedules with typically up to 40 airplanes and 1500 flight legs connecting as many as 21 airports. The model also includes the main existing types of maintenance constraints, and extensive computational experiments are reported on problem instances of size typical of practical applications.