Analysis of the Employment Situation of Non Private Enterprises in Various Regions of China

In the past 30 years, Chinese enterprises have been a hot topic of discussion and concern among the general public in terms of economic and social status, ownership structure, business mechanism, and management level. Solving the problem of employment for the people is an important prerequisite for their peaceful living and work, as well as a prerequisite and foundation for building a harmonious society. The employment situation of private enterprises has always been of great concern to the outside world, and these two major jobs have always occupied an important position in the employment field of China that cannot be ignored. With the establishment of the market economy system, individual and private enterprises have become important components of the socialist economy, making significant contributions to economic development and social progress. The rapid development of China’s economy, on the one hand, is the embodiment of the superiority of China’s socialist market economic system, and on the other hand, it is the role of the tertiary industry and private enterprises in promoting the national economy. Since the 1990s, China’s private enterprises have become a new economic growth point for local and even national countries, and are one of the important ways to arrange employment and achieve social stability. This paper studies the employment of private enterprises and individuals from the perspective of statistics, extracts relevant data from China statistical Yearbook, uses the relevant knowledge of statistics to process the data, obtains the conclusion and puts forward relevant constructive suggestions.

On the numbers of connected components of hattorigraph

ＯｎｔｈｅｎｕｍｂｅｒｓｏｆｃｏｎｎｅｃｔｅｄｃｏｍｐｏｎｅｎｔｓｏｆｈａｔｔｏｒｉｇｒａｐｈＣｈｅｎＧｕｉｙｕｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓＳｏｕｔｈｗｅｓｔＣｈｉｎａＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｃｈｏｎｇｑｉｎｇ６３０７...

A moment-based criterion for determining the number of components in a normal mixture model

Determining the number of components is a crucial issue in a mixture model. A moment-based criterion is considered to estimate the number of components arising from a normal mixture model. This criterion is derived from an omnibus statistic involving the skewness and kurtosis of each component. The proposed criterion additionally provides a measurement for the model fit in an absolute sense. The performances of our criterion are satisfactory compared with other classical criteria through Monte-Carlo experiments.

On the growth of transcendental entire functions with multiply connected components

Let g and h be two transcendental entire functions. Suppose that the Fatou set F（goh） contains multiply connected components. In this article, we will consider the growth of the functions g and h.

The g-Component Connectivity of Some Networks

In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CKg (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.

On the Decay Number of a Graph

The decay number of a connected graph is defined to be the minimum number of the components of the cotree of the graph. Upper bounds of the decay numbers of graphs are obtained according to their edge connectivities. All the bounds in this paper are tight.Moreover, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.

Influence of dc Component during Inadvertent Operation of the High Voltage Generator Circuit Breaker during Mis-Synchronization

This paper analyses the synchronization problem of a generator onto power system without satisfying synchronization condition. The main focus of the paper is on the impact of the dc component of the current in the high voltage circuit breaker during its close-open operating cycle. Using real time measurements of currents/voltages and angles during the close-opening cycle of high voltage generator circuit breaker and the impact of the dc component of current in context of interrupting large magnitude of current from the circuit breaker. In addition, the paper describes a study case model and the results of simulations performed using the software EMTP-ATP of an actual incident that occurred during the inadvertent synchronization of a large 339 MW, 24 kV generator to the grid.

An Adaptive Parameter-Free Optimal Number of Market Segments Estimation Algorithm Based on a New Internal Validity Index

An appropriate optimal number of market segments(ONS)estimation is essential for an enterprise to achieve successful market segmentation,but at present,there is a serious lack of attention to this issue in market segmentation.In our study,an independent adaptive ONS estimation method BWCON-NSDK-means++is proposed by integrating a newinternal validity index(IVI)Between-Within-Connectivity(BWCON)and a newstable clustering algorithmNatural-SDK-means++(NSDK-means++)in a novel way.First,to complete the evaluation dimensions of the existing IVIs,we designed a connectivity formula based on the neighbor relationship and proposed the BWCON by integrating the connectivity with other two commonly considered measures of compactness and separation.Then,considering the stability,number of parameters and clustering performance,we proposed the NSDK-means++to participate in the integrationwhere the natural neighbor was used to optimize the initial cluster centers(ICCs)determination strategy in the SDK-means++.At last,to ensure the objectivity of the estimatedONS,we designed a BWCON-based ONS estimation framework that does not require the user to set any parameters in advance and integrated the NSDK-means++into this framework forming a practical ONS estimation tool BWCON-NSDK-means++.The final experimental results showthat the proposed BWCONand NSDK-means++are significantlymore suitable than their respective existing models to participate in the integration for determining theONS,and the proposed BWCON-NSDK-means++is demonstrably superior to the BWCON-KMA,BWCONMBK,BWCON-KM++,BWCON-RKM++,BWCON-SDKM++,BWCON-Single linkage,BWCON-Complete linkage,BWCON-Average linkage and BWCON-Ward linkage in terms of the ONS estimation.Moreover,as an independentmarket segmentation tool,the BWCON-NSDK-means++also outperforms the existing models with respect to the inter-market differentiation and sub-market size.

Bounding the sum of powers of the Laplacian eigenvaluesof graphs

For a non-zero real number α, let sα（G） denote the sum of the αth power of thenon-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection betweensα（G） and the first Zagreb index in which the H¨older’s inequality plays a key role. By usingthis result, we present a lot of bounds of sα（G） for a connected （molecular） graph G in terms ofits number of vertices （atoms） and edges （bonds）. We also present other two bounds for sα（G）in terms of connectivity and chromatic number respectively, which generalize those results ofZhou and Trinajsti′c for the Kirchho？ index [B Zhou, N Trinajsti′c. A note on Kirchho？ index,Chem. Phys. Lett., 2008, 455： 120-123].

Unsupervised Segmentation Method of Multicomponent Images based on Fuzzy Connectivity Analysis in the Multidimensional Histograms

Image segmentation denotes a process for partitioning an image into distinct regions, it plays an important role in interpretation and decision making. A large variety of segmentation methods has been developed;among them, multidimensional histogram methods have been investigated but their implementation stays difficult due to the big size of histograms. We present an original method for segmenting n-D (where n is the number of components in image) images or multidimensional images in an unsupervised way using a fuzzy neighbourhood model. It is based on the hierarchical analysis of full n-D compact histograms integrating a fuzzy connected components labelling algorithm that we have realized in this work. Each peak of the histo- gram constitutes a class kernel, as soon as it encloses a number of pixels greater than or equal to a secondary arbitrary threshold knowing that a first threshold was set to define the degree of binary fuzzy similarity be- tween pixels. The use of a lossless compact n-D histogram allows a drastic reduction of the memory space necessary for coding it. As a consequence, the segmentation can be achieved without reducing the colors population of images in the classification step. It is shown that using n-D compact histograms, instead of 1-D and 2-D ones, leads to better segmentation results. Various images were segmented;the evaluation of the quality of segmentation in supervised and unsupervised of segmentation method proposed compare to the classification method k-means gives better results. It thus highlights the relevance of our approach, which can be used for solving many problems of segmentation.

Application of a Fast Connected Components Labeling Algorithm in Processing Landmark Images

Extracting geometric data of landmarks from fluoroscopic images plays an important role in camera calibration process of a fluoroscopic-image-based surgical navigation system. Connected components labeling is the essential technique for the extraction. A new fast connected components labeling algorithm was presented. The definition of upward concave set was introduced to explain the algorithm. Feasibility and efficiency of the algorithm were verified with experiments. This algorithm performs well in labeling non-upward concave set connected components and applies to landmarks labeling well. Moreover, the proposed algorithm possesses a desirable characteristic that will facilitate the subsequent processing of fluoroscopic images.

Alternative Method of Constructing Granular Neural Networks

Utilizing granular computing to enhance artificial neural network architecture, a newtype of network emerges—thegranular neural network (GNN). GNNs offer distinct advantages over their traditional counterparts: The ability toprocess both numerical and granular data, leading to improved interpretability. This paper proposes a novel designmethod for constructing GNNs, drawing inspiration from existing interval-valued neural networks built uponNNNs. However, unlike the proposed algorithm in this work, which employs interval values or triangular fuzzynumbers for connections, existing methods rely on a pre-defined numerical network. This new method utilizesa uniform distribution of information granularity to granulate connections with unknown parameters, resultingin independent GNN structures. To quantify the granularity output of the network, the product of two commonperformance indices is adopted: The coverage of numerical data and the specificity of information granules.Optimizing this combined performance index helps determine the optimal parameters for the network. Finally,the paper presents the complete model construction and validates its feasibility through experiments on datasetsfrom the UCIMachine Learning Repository. The results demonstrate the proposed algorithm’s effectiveness andpromising performance.

The hamiltonicity on the competition graphs of round digraphs

Given a digraph D =（V, A）, the competition graph G of D, denoted by C（D）, has the same set of vertices as D and an edge between vertices x and y if and only if N;（x）∩N;（y）≠Ф. In this paper, we investigate the competition graphs of round digraphs and give a necessary and sufficient condition for these graphs to be hamiltonian.

On the Cozero-Divisor Graphs of Commutative Rings

Let R be a commutative ring with non-zero identity. The cozero-divisor graph of R, denoted by , is a graph with vertices in , which is the set of all non-zero and non-unit elements of R, and two distinct vertices a and b in are adjacent if and only if and . In this paper, we investigate some combinatorial properties of the cozero-divisor graphs and such as connectivity, diameter, girth, clique numbers and planarity. We also study the cozero-divisor graphs of the direct products of two arbitrary commutative rings.

A Note on the Prime Spectrums of Character Rings of Finite Groups

Let G be a finite group with order g and S be a subring of the algebraic number field which contains the integral extension over Z generated by a g-th primitive root co of unity, and R（G） be the character ring of G. The prime spectrum of the commutative ring S×Z R（G） iv denoted by Spec（S×Z R（G）） and set π={p｜p is a rational prime number such that p^-1 S}. We prove that when G is a regroup, a π＇-group, or a finite Abelian group, the number of the connetted components of Spec（ S×Z R （G） ） coincides with the number of the π-regular classes in G,

Reliability Analysis of Varietal Hypercube

Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. The g-component connectivity of a graph G, denoted by , is the minimum number of vertices whose removal from G results in a disconnected graph with at least g components or a graph with fewer than g vertices. The g-component edge connectivity can be defined similarly. In this paper, we determine the g-component (edge) connectivity of varietal hypercube for small g.

Vibration Source Number Estimation of A Shell Structure

It has been challenging to correctly separate the mixed signals into source components when the source number is not known a priori.To reveal the complexity of the measured vibration signals,and provide the priori information for the blind source separation,in this paper,we propose a novel source number estimation based on independent component analysis(ICA)and clustering evaluation analysis,and then carry out experiment studies with typical mechanical vibration signals from a shell structure.The results demonstrate that the proposed ICA based source number estimation performs stably and robustly for the shell structure.

A fast connected components labeling algorithm for binary images

A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.

ON k-DIAMETER OF k-CONNECTED GRAPHS

Let G be a k-connected simple graph with order n. The k-diameter, combining connectivity with diameter, of G is the minimum integer d k(G) for which between any two vertices in G there are at least k internally vertex-disjoint paths of length at most d k(G). For a fixed positive integer d, some conditions to insure d k(G)≤d are given in this paper. In particular, if d≥3 and the sum of degrees of any s (s =2 or 3) nonadjacent vertices is at least n+(s-1)k+1-d, then d k(G)≤d. Furthermore, these conditions are sharp and the upper bound d of k-diameter is best possible.

A Study of Method on Connectivity Analysis of Between Software Components

An analysis and computation method of connectivity between components that based on logical subtyping is first presented, the concepts of virtual interface and real interface, and quantitative analysis and computation formula of connectivity between interfaces are also introduced, that based on a extendable software architecture specification language model. We provide a new idea for solving the problem of connection between reuse components.