• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.445-453
• /
• 2007

Using Schensted Insertion and Deletion algorithm for shifted rim hook tableaux described in [7], we construct Schensted algorithm for shifted rim hook tableaux. This give us the combinatorial proof for the orthogonality of the second kind for the spin characters of $\tilde{S}n$.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.77-88
• /
• 2006

The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.141.4-141
• /
• 2001

In this paper the Local Weighted Regression LWR technique is applied to the estimation of aircrcraft parameters. The method consists In improving the Local Weighted Regression LWR technique by adding a data Retention-and-Deletion RD strategy. The improvement comes with reduced computational effort since the two techniques can share their main computational procedures. The purpose of the study was to establish if the proposed algorithm could provide fast and reliable real-time estimations, with accuracy comparable to other well-known off-line identification schemes. The algorithm was tested using specific parameter estimation maneuvers and flight data of the NASA F/A-18 HARV. The results were compared with both the estimation obtained from ...

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.64-70
• /
• 1993

This paper presents an efficient SOFM(self-organizing feature map) algorithm for the solution of the large scale TSPs(traveling salesman problems). Because no additional winner neuron for each city is created in the next competition, the proposed algorithm requires just only the N output neurons and 2N connections, which are fixed during the whole process, for N-city TSP, and it does not requires any extra algorithm of creation of deletion of the neurons. And due to direct exploitation of the output potential in adaptively controlling the neighborhood, the proposed algorithm can obtain higher convergence rate to the suboptimal solutions. Simulation results show about 30% faster convergence and better solution than the conventional algorithm for solving the 30-city TSP and even for the large scale of 1000-city TSPs.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.921-926
• /
• 2002

B+-Tree is the most popular indexing method in DBMS to manage large size data in more efficiency. However the existing B+-Tree has shortcomings in there is overhead on DISK/IO when the first time of constructing DB or of making Index, and it lessens the concurrency if there are frequent delete operations so that the index structure also should be changed frequently. To solve these problems almost DBMS is using batch construction method and lazy deletion method. But to apply B+-Tree, which is using batch construction method and lazy deletion method, into DBMS the technique for controlling and recovering concurrency is necessary, but its researching is still unsatisfactory so that there is a problem on applying it into actual systems. On this paper I suggest the technique for controlling and recovering concurrency how to implement the batch construction method and the lazy deletion method in actual DBMS. Through the suggested technique there is no cascade rollback by using Pending list, it enhances the concurrency by enabling insertion and deletion for base table on every reconstruction, and it shortens transaction response time for user by using system queue which makes the batch constructing operation is processed not in user's transaction level but in system transaction level.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.225-232
• /
• 2003

The support vector machine (SVM) is becoming increasingly popular in classification. The import vector machine (IVM) has been introduced for its advantages over SMV. This paper tries to improve the IVM. The proposed method, which is referred to as the polychotomous machine (PM), uses the Newton-Raphson method to find estimates of coefficients, and the Rao and Wald tests, respectively, for addition and deletion of import points. Because the PM basically follows the same addition step and adopts the deletion step, it uses, typically, less import vectors than the IVM without loosing accuracy. Simulated and real data sets are used to illustrate the performance of the proposed method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Archives of Plastic Surgery
• /
• v.36 no.4
• /
• pp.397-405
• /
• 2009

Purpose: Soft tissue defect of anterior chest wall is caused by trauma, infection, tumors and irradiation. To reconstruct damaged anterior chest wall does require to consider the patient's body condition, the cause, the location, the depth and the size of deletion, the circulation of surrounding tissue and minimization of functional and cosmetic disability. In this report, we suggest the algorithm of configuration for reconstruction methods. Methods: A retrospective study of 20 patients who underwent anterior chest wall reconstruction with pedicled musculocutaneous flap and fasciocutaneous flap was conducted. We collected the information of the patient's body condition, the cause, the size, the depth and the location of deletion, implemented flap and complication. We observed and evaluated flap compatibility, functional and cosmetic results. Patients completed survey about the extent to their satisfaction. Result: Follow up period after surgery was from 6 to 26 months, survival of flap were confirmed in all of patients' case. Two cases of local necrosis, one case of wound disruption were reported, but all these were cured by the debridement and primary closure. One hematoma and one seroma formation were observed in donor site. Longer surgery time, more bleeding amount and more transfusion volume were reported in the group of musculocutenous flap. Conclusion: Long term follow up result showed the successful reconstruction in all patients without recurrence and with minimal donor site morbidity. In addition, the patients' satisfaction for cosmetic and functional results were scaled relatively higher. This confirmed the importance of reconstruction algorithm for the chest wall reconstruction.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.177-186
• /
• 2000

An improved multi-level（IML) optimization algorithm using automatic differentiation (AD) for multi-objective optimum design of framed structures is proposed in this paper. In order to optimize the steel frames under seismic load, two main objective functions need to be considered for minimizing the structural weight and maximizing the strain energy. For the efficiency of the proposed algorithm, multi-level optimization techniques using decomposition method that separately utilizes both system-level and element-level optimizations and an artificial constraint deletion technique are incorporated in the algorithm. And also to save the numerical efforts, an efficient reanalysis technique through approximated structural responses such as moments, frequencies, and strain energy with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by AD that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. The efficiency and robustness of the IML algorithm, compared with a plain multi-level (PML) algorithm, is successfully demonstrated in the numerical examples.