33,904 research outputs found

    A bank customer credit evaluation based on the decision tree and the simulated annealing algorithm

    Full text link
    C4.5 is a learning algorithm that adopts local search strategy, and it cannot obtain the best decision rules. On the other hand, the simulated annealing algorithm is a globally optimized algorithm and it avoids the drawbacks of C4.5. This paper proposes a new credit evaluation method based on decision tree and simulated annealing algorithm. The experimental results demonstrate that the proposed method is effective. © 2008 IEEE

    Generalized Darboux transformations for the KP equation with self-consistent sources

    Full text link
    The KP equation with self-consistent sources (KPESCS) is treated in the framework of the constrained KP equation. This offers a natural way to obtain the Lax representation for the KPESCS. Based on the conjugate Lax pairs, we construct the generalized binary Darboux transformation with arbitrary functions in time tt for the KPESCS which, in contrast with the binary Darboux transformation of the KP equation, provides a non-auto-B\"{a}cklund transformation between two KPESCSs with different degrees. The formula for N-times repeated generalized binary Darboux transformation is proposed and enables us to find the N-soliton solution and lump solution as well as some other solutions of the KPESCS.Comment: 20 pages, no figure

    Rake-based multiuser detection for quasi-synchronous SDMA systems

    Get PDF
    In this letter, a Rake-based multiuser detection technique, consisting of multiuser single-path signal separation, time-delay estimation, and multipath combining, is proposed for quasi-synchronous spatial-division multiple-access (SDMA) systems. Time diversity is achieved for performance improvement. In addition, only the upper bounds of the channel length and the time delays are required. Simulation results verify the effectiveness of the proposed technique, as well as its robustness against overestimation of the maximum channel length and the maximum time delay. © 2007 IEEE.published_or_final_versio

    Nuclear pairing reduction due to rotation and blocking

    Get PDF
    Nuclear pairing gaps of normally deformed and superdeformed nuclei are investigated using the particle-number conserving (PNC) formalism for the cranked shell model, in which the blocking effects are treated exactly. Both rotational frequency ω\omega-dependence and seniority (number of unpaired particles) ν\nu-dependence of the pairing gap Δ~\tilde{\Delta} are investigated. For the ground-state bands of even-even nuclei, PNC calculations show that in general Δ~\tilde{\Delta} decreases with increasing ω\omega, but the ω\omega-dependence is much weaker than that calculated by the number-projected Hartree-Fock-Bogolyubov approach. For the multiquasiparticle bands (seniority ν>2\nu> 2), the pairing gaps keep almost ω\omega-independent. As a function of the seniority ν\nu, the bandhead pairing gaps Δ~(ν,ω=0)\tilde{\Delta}(\nu,\omega=0) decrease slowly with increasing ν\nu. Even for the highest seniority ν\nu bands identified so far, Δ~(ν,ω=0)\tilde{\Delta}(\nu,\omega=0) remains greater than 70% of Δ~(ν=0,ω=0)\tilde{\Delta}(\nu=0,\omega=0).Comment: 15 pages, 5 figure
    corecore