Groups with the same order and degree pattern

The degree pattern of a finite group has been introduced in [18].A group M is called k-fold OD- characterizable if there exist exactly k non-isomorphic finite groups having the same order and degree pattern as M .In particular,a 1-fold OD-characterizable group is simply called OD-characterizable.It is shown that the alternating groups A m and A m+1 ,for m = 27,35,51,57,65,77,87,93 and 95,are OD-characterizable,while their automorphism groups are 3-fold OD-characterizable.It is also shown that the symmetric groups S m+2 ,for m = 7,13,19,23,31,37,43,47,53,61,67,73,79,83,89 and 97,are 3-fold OD-characterizable.From this,the following theorem is derived.Let m be a natural number such that m 100.Then one of the following holds: (a) if m = 10,then the alternating groups A m are OD-characterizable,while the symmetric groups S m are OD- characterizable or 3-fold OD-characterizable;(b) the alternating group A 10 is 2-fold OD-characterizable;(c) the symmetric group S 10 is 8-fold OD-characterizable.This theorem completes the study of OD-characterizability of the alternating and symmetric groups A m and S m of degree m 100.     

A novel fuzzy C-means algorithm to generate diverse and desirable cluster solutions used by genetic-based clustering ensemble algorithms

One of the most significant discussions in the field of machine learning today is on the clustering ensemble. The clustering ensemble combines multiple partitions generated by different clustering algorithms into a single clustering solution. Genetic algorithms are known for their high ability to solve optimization problems, especially the problem of the clustering ensemble. To date, despite the major contributions to find consensus cluster partitions with application of genetic algorithms, there has been little discussion on population initialization through generative mechanisms in genetic-based clustering ensemble algorithms as well as the production of cluster partitions with favorable fitness values in first phase clustering ensembles. In this paper, a threshold fuzzy C-means algorithm, named TFCM, is proposed to solve the problem of diversity of clustering, one of the most common problems in clustering ensembles. Moreover, TFCM is able to increase the fitness of cluster partitions, such that it improves performance of genetic-based clustering ensemble algorithms. The fitness average of cluster partitions generated by TFCM are evaluated by three different objective functions and compared against other clustering algorithms. In this paper, a simple genetic-based clustering ensemble algorithm, named SGCE, is proposed, in which cluster partitions generated by the TFCM and other clustering algorithms are used as the initial population used by the SGCE. The performance of the SGCE is evaluated and compared based on the different initial populations used. The experimental results based on eleven real world datasets demonstrate that TFCM improves the fitness of cluster partitions and that the performance of the SGCE is enhanced using initial populations generated by the TFCM.     

The stability of limit cycles in nonlinear systems

In this paper, a necessary condition is first presented for the existence of limit cycles in nonlinear systems, then four theorems are presented for the stability, instability, and semistabilities of limit cycles in second order nonlinear systems. Necessary and sufficient conditions are given in terms of the signs of first and second derivatives of a continuously differentiable positive function at the vicinity of the limit cycle. Two examples considering nonlinear systems with familiar limit cycles are presented to illustrate the theorems.     

Upscaled Unstructured Computational Grids for Efficient Simulation of Flow in Fractured Porous Media

Discrete fracture modeling (DFM) is currently the most promising approach for modeling of naturally fractured reservoirs and simulation of multiphase fluid flow therein. In contrast with the classical double-porosity/double permeability models, in the DFM approach all the interactions and fluid flow in and between the fractures and within the matrix are modeled in a unified manner, using the same computational grid. There is no need for computing the shape factors, which are crucial to the accuracy of the double-porosity models. We have exploited this concept in order to develop a new method for the generation of unstructured computational grids. In the new approach the geological model (GM) of the reservoir is first generated, using square or cubic grid blocks. The GM is then upscaled using a method based on the multiresolution wavelet transformations that we recently developed. The upscaled grid contains a distribution of the square or cubic blocks of various sizes. A map of the blocks’ centers is then used with an optimized Delauney triangulation method and the advancing-front technique, in order to generate the final unstructured triangulated grid suitable for use in any general reservoir simulator with any number of fluid phases. The new method also includes an algorithm for generating fractures that, contrary to the previous methods, does not require modifying their paths due to the complexities that may arise in spatial distribution of the grid blocks. It also includes an effective partitioning of the simulation domain that results in large savings in the computation times. The speed-up in the computations with the new upscaled unstructured grid is about three orders of magnitude over that for the initial GM. Simulation of waterflooding indicates that the agreement between the results obtained with the GM and the upscaled unstructured grid is excellent. The method is equally applicable to the simulations of multiphase flow in unfractured, but highly heterogeneous, reservoirs.     

Numerical investigation of turbulent free jet flows issuing from rectangular nozzles: the influence of small aspect ratio

In this research, the fluid and thermal characteristics of a rectangular turbulent jet flow is studied numerically. The results of three-dimensional jet issued from a rectangular nozzle are presented. A numerical method employing control volume approach with collocated grid arrangement was employed. Velocity and pressure fields are coupled with SIMPLEC algorithm. The turbulent stresses are approximated using k–e{\varepsilon} model with two different inlet conditions. The velocity and temperature fields are presented and the rates of their decay at the jet centerline are noted. The velocity vectors of the main flow and the secondary flow are illustrated. Also, effect of aspect ratio on mixing in rectangular cross-section jets is considered. The aspect ratios that were considered for this work were 1:1 to 1:4. The results showed that the jet entrains more with smaller AR. Special attention has been drawn to the influence of the Reynolds number (based on hydraulic diameter) as well as the inflow conditions on the evolution of the rectangular jet. An influence on the jet evolution is found for smaller Re, but the jet is close to a converged state for higher Reynolds numbers. The inflow conditions have considerable influence on the jet characteristics.     

直观随机赋范空间中三次泛函方程的稳定性

先引入直观随机赋范空间的概念．然后,借助这一概念,然后对任意的三角范数在该空间的框架下,研究了三次泛函方程的稳定性．另外,还介绍了随机空间理论、直观空间理论及泛函方程理论间的密切关系．     

New proximity and complexity result for P*(κ)-linear complementarity problem (Poster Presentation)

One of the main ingredients of interior point methods is the proximity functions to measure the distance of the iterates from the central path of linear optimization problems. In this paper, an interior point method for solving P_*(κ)-linear complementarity problem, κ ≥ 0, is proposed. For this version, we use a new class of proximity functions induced by new kernel functions. Using some mild and easy to check conditions, we show that the large-update primal-dual interior point methods for solving P_*(κ)-linear complementarity problem enjoy the so far best worst case theoretical complexity, namely O (κ √n log n log n /ε) iteration bound, with special choices of the parameters p, q ≥ 1. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Structuring product development processes

This paper proposes operational frameworks for structuring product development processes. The primary objective of this research is to develop procedures to minimize iterations during the development process which adversely affect development time and costs. Several procedures are introduced to restructure the development process. The computation of the corresponding product development times is facilitated by two Markov models addressing different types of learning. The methodologies are employed to identify a set of managerial concerns in restructuring the product development processes.The developed framework has become an integral part of a re-engineering project for the development of rocket engines at Rocketdyne Division of Rockwell International. Throughout the paper, the methodologies are illustrated with the help of this process.     

Investigation of the equality constraint effect on the reduction of the rotational ambiguity in three-component system using a novel grid search method

The obtained results by soft modeling multivariate curve resolution methods often are not unique and are questionable because of rotational ambiguity. It means a range of feasible solutions equally fit experimental data and fulfill the constraints. Regarding to chemometric literature, a survey of useful constraints for the reduction of the rotational ambiguity is a big challenge for chemometrician. It is worth to study the effects of applying constraints on the reduction of rotational ambiguity, since it can help us to choose the useful constraints in order to impose in multivariate curve resolution methods for analyzing data sets. In this work, we have investigated the effect of equality constraint on decreasing of the rotational ambiguity. For calculation of all feasible solutions corresponding with known spectrum, a novel systematic grid search method based on Species-based Particle Swarm Optimization is proposed in a three-component system.