ω-Gorenstein injective modules and dimensions

Gorenstein injective modules and dimensions have been studied extensively by many authors. In this paper, we investigate Gorenstein injective modules and dimensions relative to a Wakamatsu tilting module.     

κ-Gorenstein Modules

Let A and F be artin algebras and ∧UГa paper, we first introduce the notion of k-Gorenstein faithfully balanced selforthogonal bimodule. In this modules with respect to ∧UГ and then characterize it in terms of the U-resolution dimension of some special injective modules and the property of the functors Ext^i （Ext^i （-, U）, U） preserving monomorphisms, which develops a classical result of Auslander. As an application, we study the properties of dual modules relative to Gorenstein bimodules. In addition, we give some properties of ∧UГwith finite left or right injective dimension.     

ω-Gorenstein Modules

We introduce the notion of ω-Gorenstein modules, where ω is a faithfully balanced self-orthogonal module. This gives a common generalization of both Gorenstein projective modules and Gorenstein injective modules. We consider such modules in the tilting theory. Consequently, some results due to Auslander and colleagues and Enochs and colleagues are generalized.     

强Ω-Gorenstein平坦模

引入强Ω-Gorenstein平坦模的概念,证明了强Ω-Gorenstein平坦模的直和是强Ω-Gorenstein平坦模.还研究了强Ω-Gorenstein平坦模的若干性质及其与强Ω-Gorenstein投射模之间的关系.     

三角范畴中的（n,m）-强ξ-Gorenstein投射对象

引入了三角范畴中一类特殊的对象,称其为（n,m）-强ξ-Gorenstein投射对象（简记为（n,m）-ξ-SG-投射对象）,其中n≥1且m≥0.主要研究这类对象的ξ-Gorenstein投射维数及其合冲,并且给出了任一对象的ξ-Gorenstein投射维数小于m的充要条件.     

δ - and δ ′-shocks and the transportation and concentration processes

Using the definitions of δ - and δ ′-shocks for some systems of conservation laws, the corresponding Rankine–Hugoniot conditions are derived. We also derive the balance laws describing area, volume, mass and momentum transportation between the area outside the wave front and the wave front. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Soft clustering – Fuzzy and rough approaches and their extensions and derivatives

Clustering is one of the most widely used approaches in data mining with real life applications in virtually any domain. The huge interest in clustering has led to a possibly three-digit number of algorithms with the k-means family probably the most widely used group of methods. Besides classic bivalent approaches, clustering algorithms belonging to the domain of soft computing have been proposed and successfully applied in the past four decades. Bezdek’s fuzzy c-means is a prominent example for such soft computing cluster algorithms with many effective real life applications. More recently, Lingras and West enriched this area by introducing rough k-means. In this article we compare k-means to fuzzy c-means and rough k-means as important representatives of soft clustering. On the basis of this comparison, we then survey important extensions and derivatives of these algorithms; our particular interest here is on hybrid clustering, merging fuzzy and rough concepts. We also give some examples where k-means, rough k-means, and fuzzy c-means have been used in studies.     

Quasipower and hypergeometric series — construction and evaluation

It is proved that some power series converging very slowly in a neighbourhood of the point 1 can be transformed intoquasipower series. The latter converge faster but are more complicated because they contain some hypergeometric series₂ F ₁. Standard methods of the values evaluation for needed hypergeometric series with the aid of recurrence relations are not sufficiently efficient for some variable values. Therefore a new method, formally similar to Levin's transforms, is proposed. More generally, this is a method of approximative evaluating of such a solution of an inhomogeneous recurrence relation of order one which has some particular asymptotic properties.The efficacity of the proposed methods is analyzed in detail for Euler's dilogarithm. This is a typical function whose power series is approached with difficulties ifz1. In particular, its Padé approximants are sufficiently accurate only for, sayx[–1, 1/2]. Hermite-Padé approximation is more effective. Resulting irrational approximants generalize in some sense partial sums of the quasipower series introduced here.     

Lot sizing and scheduling — Survey and extensions

This contribution summarizes recent work in the field of lot sizing and scheduling. The objective is not to give a comprehensive literature survey, but to explain differences of formal models and to provide some first readings recommendations. Our focus is on capacitated, dynamic, and deterministic cases. To underscore the importance of the research efforts, current practice is described and its shortcomings are exposed. Mathematical programming models where the planning horizon is subdivided into several discrete periods are given for both approaches that are well-established and approaches which may represent tomorrow's state of the art. Two research directions are discussed in more detail: continuous time models and multi-level lot sizing and scheduling. The paper concludes with some advice for future research activities.     

Transitivity and Chaos

Several different definitions of transitivity and their relationship are carefullydiscussed for general spaces, and it is proved that a continuous map on a metric space ischaotic in the sense of Devaney if and only if it is periodic orbit transitive or periodic orbitstrongly transitive.     

E—matrices and Several Necessary and Sufficient Conditions

AER-x.,Aiscalledanonnegative(nonPositive)matrixifau>O(a,jO(aiirtO),markedA>O(AO(i#j),auO,wecallp(A)=max{IA,l,lA,l'.-.,lAnl},(whereA,,A2,..',A"areeigenva1ueofA)asspectralradiusofA.LemmalIfAe7'.,thenareanonnegativesquarematrxBandapositivenumberksuchthatA=B-kI(whereIistheidentitymatrixofordern).ProofLetbti=…     

Structure and Application of Algebraic Spline Curve and Surface

Algebraic-geometry foundations for non-linear spline functions are estab-lished.The structure of algebraic spline curves and surfaces represented by implicitforms are investigated.The necessary and sufficient conditions for smooth connection ofalgebraic curves(or surfaces)are presented.     

Problem-Solving and Sequence

In 1971,the famous mathematician George Polya,introduced four basic steps or phases for solving problems: Step1 Understand the Problem Step2 Decide on a Plan Step 3 Carry out the Plan Step4 Look Back     

Ramanujan and extensions and contractions of continued fractions

If a continued fraction K _n=1^∞ a _n /b _n is known to converge but its limit is not easy to determine, it may be easier to use an extension of K _n=1^∞ a _n /b _n to find the limit. By an extension of K _n=1^∞ a _n /b _n we mean a continued fraction K _n=1^∞ c _n /d _n whose odd or even part is K _n=1^∞ a _n /b _n . One can then possibly find the limit in one of three ways:

Trial and Error

Trial and error is a problem-solving strategy everyone uses at one time or another.In trial and error,you try ananswer.(The word trial comes from try.)If the answer is in error,you try something else.You keep trying untilyou get a correct answer.Trial and error is a particularly good strategy if a question has only a few possible answers.     

Orthogonal and Round

Civilized man is surrounded on all sides, indoors and out, by a subtle, seldom-noticed conflict between two ancient ways of shaping things: the orthogonal and the round. Cars on circular wheels, guided by hand on circular steering wheels, move on streets that intersect like the lines of a rectangular lattice. Buildings and houses are made up mostly of right angles, relieved occasionally by circular domes and windows. At rectangular or circular tables, with rectangular napkins on our laps, we eat from circular plates and drink from glasses with circular cross sections. We light cylindrical cigarettes with matches torn from rectangular packs, and we pay the rectangular bill with rectangular bank notes and circular coins.     

Equivalence and self-improvement of p-fatness and Hardy’s inequality, and association with uniform perfectness

We present an easy proof that p-Hardy’s inequality implies uniform p-fatness of the boundary when p = n. The proof works also in metric space setting and demonstrates the self-improving phenomenon of the p-fatness. We also explore the relationship between p-fatness, p-Hardy inequality, and the uniform perfectness for all p ≥ 1, and demonstrate that in the Ahlfors Q-regular metric measure space setting with p = Q, these three properties are equivalent. When p ≠ 2, our results are new evenin the Euclidean setting.     

L-fuzzy ⋎ and ⋏ hyperoperations and the associated l-fuzzy hyperalgebras

In this paper we study two fuzzy hyperoperations, denoted by ⋎ (which can be seen as a generalization of ∨) and ⋏ (which can be seen as a generalization of ∧). ⋎ is obtained from a family of crisp ∨; _p hyperoperations and ⋏ is obtained from a family of crisp ∧ _p hyperoperations. The hyperstructure (X, ⋎, ∧) resembles ahyperlattice and the hyperstructure (X, ∨, ⋏) resembles adual hyperlattice     

On roots and squares – estimation,intuition and creativity

The paper presents findings of a small scale study of a few items related to problem solving with squares and roots, for different teacher groups (pre-service and in-service mathematics teachers: elementary and junior high school). The research participants were asked to explain what would be the units digit of a natural number to be squared in order to obtain a certain units digit as a result. They were also asked to formulate a rule – an algorithm for calculating the square of a 2-digit number which is a multiple of 5. Based on this knowledge and estimation capability, they were required to find, without using calculators, the square roots of given natural numbers. The findings show that most of the participants had only partial intuition regarding the units’ digit of a number which is squared when the units’ digit of the square is known. At the same time, the participants manifested some evidence of creativity and flow of ideas in identifying the rule for calculating the square of a natural number whose units digit is 5. However, when asked to identify, by means of estimation and based on knowledge from previous items, the square roots of three natural numbers, only few of them managed to find the three roots by estimation.     

Tensor products and homotopies for ω-groupoids and crossed complexes

Crossed complexes have longstanding uses, explicit and implicit, in homotopy theory and the cohomology of groups. It is here shown that the category of crossed complexes over groupoids has a symmetric monoidal closed structure in which the internal Hom functor is built from morphisms of crossed complexes, nonabelian chain homotopies between them and similar higher homotopies. The tensor product involves non-abelian constructions related to the commutator calculus and the homotopy addition lemma. This monoidal closed structure is derived from that on the equivalent category of ω-groupoids where the underlying cubical structure gives geometrically natural definitions of tensor products and homotopies.