中小企业税务稽查投影寻踪建模与实证分析

从上海市某区386家中小企业申报的15项税收指标数据中筛选出对判定企业纳税情况具有重要影响的10个评价指标,并将全部386个样本分成性质相似的建模样本和测试样本(其中测试样本个数占45%),建立了基于投影寻踪分类(PPC)技术的税务稽查评价模型.与多元线性回归(MLR)、判别分析(MDA)、Logistic和支持向量机(SVM)模型相比,PPC模型的识别错误率最低,建模样本和测试样本的平均分类错误率低于6%,改进型PPC模型包含的评价指标少,两类错误率很接近,非常适用于实际企业的税务稽查评估研究和实践.对339家待判断企业纳税情况的判定结果研究表明,建立的改进型PPC模型具有很好的泛化能力和鲁棒性.     

Influence of flat milling on vortex matching effect in Bi2Sr2CaCu2O8+y with antidot array

Significant enlargements of antidot diameter by Ar-ion milling were observed in Bi₂Sr₂CaCu₂O_8+y single-crystal films with antidot arrays as well as the thinning of the films. In an original sample with triangular array of antidots, whose diameter is about 200 nm, a few dip structures by the matching effect were observed in the vortex-flow resistance as a function of magnetic field. With increasing the milling time, the number of the dips increases and the appearance of the flow resistance becomes periodic oscillations. These features can be explained mainly by the increase of the antidot diameter.     

On the matching polynomial of subdivision graphs

Let G be a simple graph and let S(G) be the subdivision graph of G, which is obtained from G by replacing each edge of G by a path of length two. In this paper, by the Principle of Inclusion and Exclusion we express the matching polynomial and Hosoya index of S(G) in terms of the matchings of G. Particularly, if G is a regular graph or a semi-regular bipartite graph, then the closed formulae of the matching polynomial and Hosoya index of S(G) are obtained. As an application, we prove a combinatorial identity.     

On extremal unicyclic molecular graphs with maximal Hosoya index

Let G be a unicyclic n-vertex graph and Z(G) be its Hosoya index, let F_n stand for the nth Fibonacci number. It is proved in this paper that Z(G)≤F_n+1+F_n−1 with the equality holding if and only if G is isomorphic to C_n, the n-vertex cycle, and that if G≠C_n then Z(G)≤F_n+1+2F_n−3 with the equality holding if and only if G=Q_n or D_n, where graph Q_n is obtained by pasting one endpoint of a 3-vertex path to a vertex of C_n−2 and D_n is obtained by pasting one endpoint of an (n−3)-vertex path to a vertex of C₄.     

d-matching in 3-uniform hypergraphs

A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. A $d$-matching in a 3-uniform hypergraph $H$ is a matching of size $d$. Let $V_1,V_2$ be a partition of $n$ vertices such that $\left|V_1\right|=2d?1$ and $\left|V_2\right|=n?2d+1$. Denote by $E_3(2d?1,n?2d+1)$ the 3-uniform hypergraph with vertex set $V_1\cup V_2$ consisting of all those edges which contain at least two vertices of $V_1$. Let $H$ be a 3-uniform hypergraph of order $n\ge 9d^2$ such that $deg\left(u\right)+deg\left(v\right)>2\left[\left(\genfrac{}{}{0ex}{}{n?1}{2}\right)?\left(\genfrac{}{}{0ex}{}{n?d}{2}\right)\right]$ for any two adjacent vertices $u,v\in V\left(H\right)$. In this paper, we prove $H$ contains a $d$-matching if and only if $H$ is not a subgraph of $E_3(2d?1,n?2d+1)$.     

基于投影寻踪分类模型的各地区节能降耗评价研究

能源作为经济增长中重要的投入要素,对各国经济发展都起着决定性影响。国家"十一五"规划中明确提出2010年中国单位GDP能源消耗下降20%,这个宏伟目标的实现对于我国经济的可持续发展和改善人民生活环境具有重要意义。本文运用投影寻踪分类模型,对节能降耗综合评价指标体系进行分析,得到最佳投影值及各地区应承担的节能降耗责任大小。与主成分分析法结果的比较表明投影寻踪分类模型对这类指标评价问题的合理性和可行性。     

Win–win match using a genetic algorithm

As the service industries grow, tasks are not directly assigned to the skills but the knowledge of the worker which is to be valued more in finding the best match. The problem becomes difficult mainly because the match has to be seen with the objectives of both sides. Assignment methods fail to respond to a multi-objective, multi-constraint problem with complicated match; whereas, metaheuristics is preferable based on computational simplicity. A conditional genetic algorithm is developed in this study to propose both global and composite match using different fitness functions. This algorithm kills the infeasibilities to achieve the maximum number of matches. The proposed algorithm is applied on an academic problem of multi-alternative candidates and multi-alternative tasks (m × n problem) in two stages. In the first stage, four different fitness functions are evaluated and in the second stage using one of the fitness functions global and composite matching have been compared. The achievements will contribute both to the academic and business world.     

Nonlinear bipartite matching

We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization and maximization, and a randomized algorithm for optimizing arbitrary objectives.     

Generalized type theorems in topological spaces with applications

In this work, some new generalized type theorems for generalized mappings with compactly open values are established in topological spaces without any convexity assumptions. As applications, a Ky Fan type matching theorem, fixed point theorem and coincidence theorem are obtained in topological spaces. These results generalize some known results from the recent literature.     

A PROJECTION NT-TYPE TEST OF ELLIPTICAL SYMMETRY BASED ON THE SKEWNESS AND KURTOSIS MEASURES

1.IntroductionTheunivariateandmultivariatenormaldistributionshaveplayedacentralroleinstatistics.However,therearemanynaturalphenomenathatdonotfollowthenormallaw.Thereisaneedtostatisticalmodellingbytheuseofmultivariatenon-normaldistributions.Amongthemthesphericallysymmetricandellipticallysymmetricdistributions(sphericalandellipticaldistributionsforsimplicity)haveattractedmuchattentionduringthelasttwodecadesbecausetheellipticaldistributionspossessmanynicepropertieswhicharesimilartothoseofthemulti…