26,248 research outputs found
Comparison of Support Vector Machine and Back Propagation Neural Network in Evaluating the Enterprise Financial Distress
Recently, applying the novel data mining techniques for evaluating enterprise
financial distress has received much research alternation. Support Vector
Machine (SVM) and back propagation neural (BPN) network has been applied
successfully in many areas with excellent generalization results, such as rule
extraction, classification and evaluation. In this paper, a model based on SVM
with Gaussian RBF kernel is proposed here for enterprise financial distress
evaluation. BPN network is considered one of the simplest and are most general
methods used for supervised training of multilayered neural network. The
comparative results show that through the difference between the performance
measures is marginal; SVM gives higher precision and lower error rates.Comment: 13 pages, 1 figur
Algebraic tori revisited
Let be a finite Galois extension and \pi = \fn{Gal}(K/k). An
algebraic torus defined over is called a -torus if
T\times_{\fn{Spec}(k)} \fn{Spec}(K)\simeq \bm{G}_{m,K}^n for some integer
. The set of all algebraic -tori defined over under the stably
isomorphism form a semigroup, denoted by . We will give a complete
proof of the following theorem due to Endo and Miyata \cite{EM5}. Theorem. Let
be a finite group. Then where
is a maximal -order in containing
and is the locally free class group of
, provided that is isomorphic to the following four
types of groups : ( is any positive integer), ( is any odd
integer ), ( is any odd integer , is
an odd prime number not dividing , , and
for any prime divisor
of ), ( is any odd integer , for any
prime divisor of ).Comment: To appear in Asian J. Math. ; the title is change
Retract Rational Fields
Let be an infinite field. The notion of retract -rationality was
introduced by Saltman in the study of Noether's problem and other rationality
problems. We will investigate the retract rationality of a field in this paper.
Theorem 1. Let be fields. If is retract -rational
and is retract -rational, then is retract -rational. Theorem 2.
For any finite group containing an abelian normal subgroup such that
is a cyclic group, for any complex representation , the
fixed field is retract -rational. Theorem 3. If is a
finite group, then all the Sylow subgroups of are cyclic if and only if
is retract -rational for all -lattices ,
for all short exact sequences . Because the unramified Brauer group of a retract
-rational field is trivial, Theorem 2 and Theorem 3 generalize previous
results of Bogomolov and Barge respectively (see Theorem \ref{t5.9} and Theorem
\ref{t6.1}).Comment: Several typos in the previous version were correcte
Insider patent holder licensing in an oligopoly market with different cost structures: Fixed-fee, royalty, and auction
The issue of the optimal licensing contract in firms having different cost structures is studied when the innovator is a producing patent holder who has three alternative licensing strategies, namely, the fixed-fee, royalty rate, and auction strategies. We conclude that the auction licensing strategy is not the best strategy when the innovator is a producing patent holder. This finding differs from that of Kabiraj (2004) where the auction licensing method is the optimal licensing strategy when the innovator is a non-producing patent holder. However, when we only compare two of the licensing methods, namely, the fixed-fee licensing method and the royalty licensing method, we conclude that if the inside innovator licenses to only some of the firms, then the royalty licensing method will be the best strategy. This result is different from that of Fosfuri and Roca (2004), who concluded that if only some of the licensees obtain a licensing contract, then the fixed-fee licensing method will be the best choice for a producing patent holder.Licensing strategy, Cost structure, Auction
- …