Computation of K0(RMNS_(θ,h))

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｐｕｒｐｏｓｅｏｆｔｈｉｓｐａｐｅｒｉｓｔｏｃｏｍｐｕｔｅｔｈｅＧｒｏｔｈｅｎｄｉｅｃｋｇｒｏｕｐｏｆＴ＝ＲＭＮＳ（θ，φ）．ＴｉｓｃａｌｌｅｄｔｈｅｒｉｎｇｏｆＭｏｒｉｔａＣｏｎｔｅｘｔｉｎｓｏｍｅｌｉｔｅｒａｔｕｒｅ（ｓｅｅ［１］）．Ｉｎ１９７４，ＱｕｉｌｌｅｎａｎｎｏｕｃｅｄｔｈａｔＫ０（ＲＭＯＳ）Ｋ０（Ｒ）Ｋ０（Ｓ）．ＵｐｔｏｔｈｅｐｒｅｓｅｎｔｍｏｍｅｎｔｔｈｅｒｅｓｔｉｌｌｅｘｉｓｔｓｎｏｉｎｆｏｒｍａｔｉｏｎｃｏｎｃｅｒｎｉｎｇＫ０（Ｔ）ｆ…     

The Global Existence of Solutions for a Cross-Diffusion System

ＴｈｅＧｌｏｂａｌＥｘｉｓｔｅｎｃｅｏｆＳｏｌｕｔｉｏｎｓｆｏｒａＣｒｏｓｓ－ＤｉｆｆｕｓｉｏｎＳｙｓｔｅｍ￥（娄元）（倪维明）（吴雅萍）ＹｕａｎＬｏｕ；Ｗｅｉ－ＭｉｎｇＮｉ（ＳｃｈｏｏｌｏｆＭａｔｈｅｍａｔｉｃｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＭｉｎｎｅ...     

The Strong Compact-covering ss-images of Metric Spaces

ＴｈｅＳｔｒｏｎｇＣｏｍｐａｃｔ┐ｃｏｖｅｒｉｎｇｓｓ┐ｉｍａｇｅｓｏｆＭｅｔｒｉｃＳｐａｃｅｓＬｉＫｅｄｉａｎ（李克典）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｇｑｉｕＴｅａｃｈｅｒｓ＇Ｃｏｌｅｇｅ，Ｈｅｎａｎ，４７６０００）Ａｂ...     

Some Spectral Properties of Metapositive Definite Matrice

ＳｏｍｅＳｐｅｃｔｒａｌＰｒｏｐｅｒｔｉｅｓｏｆＭｅｔａｐｏｓｉｔｉｖｅＤｅｆｉｎｉｔｅＭａｔｒｉｃｅｓＬｉＺｈｕｘｉａｎｇ（李竹香）ＬｕＨｏｎｇｂｉｎ（吕洪斌）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＴｅａｃｈｅｒ＇ｓＣｏｌｅｇ...     

MAXIMUM TREES OF SUBSETS

ＭＡＸＩＭＵＭＴＲＥＥＳＯＦＳＵＢＳＥＴＳＷｕＳｈｉｑｕａｎ（巫世权）（Ｉｎｓｔ．ｏｆＡｐｐｌ．Ｍａｔｈ．，ＣｈｉｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，ＰＯＢｏｘ２７３４，Ｂｅｉｊｉｎｇ１０００８０，Ｃｈｉｎａ）Ａｂｓｔｒａｃｔ：ＬｅｔＸｂｅａｆ...     

Existence of the Self-Similar Solutions in the Heat Flow of Harmonic Maps

ＥｘｉｓｔｅｎｃｅｏｆｔｈｅＳｅｌｆＳｉｍｉｌａｒＳｏｌｕｔｉｏｎｓｉｎｔｈｅＨｅａｔＦｌｏｗｏｆＨａｒｍｏｎｉｃＭａｐｓＦａｎＨｕｉｊｕｎ（范辉军）（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＰｅｋｉｎｇＵｎｉｖｅｒｓｉｔｙ，１００８７１）Ｃ...     

A Characterization of a Class of Symmetric(0,1)Matrices

ＡＣｈａｒａｃｔｅｒｉｚａｔｉｏｎｏｆａＣｌａｓｓｏｆＳｙｍｍｅｔｒｉｃ（０，１）ＭａｔｒｉｃｅｓＬｉＷｅｎ（黎稳）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｏｕｔｈＣｈｉｎａＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｇｕａｎｚｈｏｎ，５１０６３１...     

Centre of Measure and Minimal Centre of Attraction for the Shift Maps on the Inverse Limit Spaces

ＣｅｎｔｒｅｏｆＭｅａｓｕｒｅａｎｄＭｉｎｉｍａｌＣｅｎｔｒｅｏｆＡｔｒａｃｔｉｏｎｆｏｒｔｈｅＳｈｉｆｔＭａｐｓｏｎｔｈｅＩｎｖｅｒｓｅＬｉｍｉｔＳｐａｃｅｓ＊）ＧｕＲｏｎｇｂａｏ（顾荣宝）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ａｎｈｕ...     

A Class of Multisided Surface Patches

Ａ　Ｃｌａｓｓ　ｏｆ　Ｍｕｌｔｉｓｉｄｅｄ　Ｓｕｒｆａｃｅ　ＰａｔｃｈｅｓＬｉｕＳｈｕｘｉｎ（刘树信）；ＸｉｎｇＬｉｐｉｎｇ（邢丽萍）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｃｈａｎ，１３００２３）...     

Kuranishi Families and Moduli Spaces for Hopf Surfaces

ＫｕｒａｎｉｓｈｉＦａｍｉｌｉｅｓａｎｄＭｏｄｕｌｉＳｐａｃｅｓｆｏｒＨｏｐｆＳｕｒｆａｃｅｓＬｉＱｉｎｇｚｈｏｎｇ（李庆忠）ＺｈａｎｇＪｉｎｈａｏ（张锦豪）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓｏｆＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓｈａｎ...     

Fuzzy multi-choice goal programming

Goal programming as a well known technique has been widely used for solving multi objective decision making problems. However, in some practical cases, there may exist situations where the decision maker is interested in setting multi aspiration levels for objectives that may not be expressed in a precise manner. In this paper, a novel formulation of fuzzy multi-choice goal programming (FMCGP) is presented. The proposed approach not only improves the applicability of goal programming in real world situations but also provides useful insight about the solution of a new class of problems. To illustrate and clarify the proposed approach, a numerical example is presented.     

A new mixed integer linear programming model for the multi level uncapacitated facility location problem

This paper considers the multi level uncapacitated facility location problem (MLUFLP). A new mixed integer linear programming (MILP) formulation is presented and validity of this formulation is given. Experimental results are performed on instances known from literature. The results achieved by CPLEX and Gurobi solvers, based on the proposed MILP formulation, are compared to the results obtained by the same solvers on the already known formulations. The results show that CPLEX and Gurobi can optimally solve all small and medium sized instances and even some large-scale instances using the new formulation.     

Multi Fuzzy Fractal Theorems in Fuzzy Metric Spaces

The Hutchinson-Barnsley (HB) operators are studied for multi iterated function system in a general setting. Some existence and uniqueness results are obtained in fuzzy fractal and multi fuzzy fractal spaces. From them, we obtain our results, which generalize some recent results in the literature.     

Metrics and undirected cuts

Suppose thatG is an undirected graph whose edges have nonnegative integer-valued lengthsl(e), and that {s ₁,t ₁},?, {s _m ,t _m } are pairs of its vertices. Can one assign nonnegative weights to the cuts ofG such that, for each edgee, the total weight of cuts containinge does not exceedl(e) and, for eachi, the total weight of cuts ‘separating’s _i andt _i is equal to the distance (with respect tol) betweens _i andt _i ? Using linear programming duality, it follows from Papernov's multicommodity flow theorem that the answer is affirmative if the graph induced by the pairs {s ₁,t ₁},?, {s _m ,t _m } is one of the following: (i) the complete graph with four vertices, (ii) the circuit with five vertices, (iii) a union of two stars. We prove that if, in addition, each circuit inG has an even length (with respect tol) then there exists a suitable weighting of the cuts with the weights integer-valued; moreover, an algorithm of complexity O(n ³) (n is the number of vertices ofG) is developed for solving such a problem. Also a class of metrics decomposable into a nonnegative linear combination of cut-metrics is described, and it is shown that the separation problem for cut cones isNP-hard.     

Fast computation of two-level circulant preconditioners

In this paper we present an algorithm for the construction of the superoptimal circulant preconditioner for a two-level Toeplitz linear system. The algorithm is fast, in the sense that it operates in FFT time. Numerical results are given to assess its performance when applied to the solution of two-level Toeplitz systems by the conjugate gradient method, compared with the Strang and optimal circulant preconditioners.     

Full backward non-homogeneous semi-Markov processes for disability insurance models: A Catalunya real data application

In this paper a stochastic model for disability insurance contracts is presented. The model is based on a discrete time non-homogeneous semi-Markov process to which the backward recurrence time process is joined. This permits us to study in a more complete way the disability evolution and to face the duration problem in a more effective way. The model is applied to a sample of contracts drawn at random from a mutual insurance company.     

一种多指标综合评价合成技术方法研究

对目前多指标评价合成技术进行了回顾，运用模糊系统理论提出了模糊积分合成技术方法，提示了评价指标（或评价单元）之间内在的本质关联、制约以及协调作用对评价系统状态的贡献效应，拓宽了权值的内在含义。     

On minquantile and maxcovering optimisation

In this paper we introduce the parametric minquantile problem, a weighted generalisation ofkth maximum minimisation. It is shown that, under suitable quasiconvexity assumptions, its resolution can be reduced to solving a polynomial number of minmax problems.It is also shown how this simultaneously solves (parametric) maximal covering problems. It follows that bicriteria problems, where the aim is to both maximize the covering and minimize the cover-level, are reducible to a discrete problem, on which any multiple criteria method may be applied.Corresponding author.Visiting researcher at the Center for Industrial Location of the Vrije Universiteit Brussel during this research.     

Range of lower bounds

Each of n jobs is to be processed without interruption on a single machine. Each job becomes available for processing at time zero. The objective is to find a processing order of the jobs which minimizes the sum of weighted completion times added with maximum weighted tardiness. In this paper we give a general case of the theorem that given in [6]. This theorem shows a relation between the number of efficient solutions, lower bound LB and optimal solution. It restricts the range of the lower bound, which is the main factor to find the optimal solution. Also, the theorem opens algebraic operations and concepts to find new lower bounds.     

Distributed personnel scheduling—negotiation among scheduling agents

This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) paradigm. The architecture is composed of a set of autonomous software Scheduling Agents (SAs) that solve the Employee Timetabling Problems (ETP) for each department. Each agent has its own local ETP problem and its own goals. The Scheduling Agents must coordinate their local solution with the other agents in order to achieve a global solution for the whole organization that yields a better result with respect to the organization’s global targets. To achieve a coherent and consistent global solution, the SAs make use of a sophisticated negotiation protocol among scheduling agents that always ends in an agreement (not ensured to be optimal). The main functionalities of this protocol are agent to agent relation definition, a mechanism to approve a chain of Request for Changes and an electronic marketplace for bidding on preferred common time slots. Experimental analysis of the implemented Multi Agent System for the Soroka medical center is presented. The results of our study indicate that the proposed framework has the potential to reduce the cost of transportation for the nurses that traveling to and from the hospital.