• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.8
• /
• pp.3097-3100
• /
• 2015

Projections of cancer cases are particularly useful in developing countries to plan and prioritize both diagnostic and treatment facilities. In the prediction of cancer cases for the future period say after 5 years or after 10 years, it is imperative to use the knowledge of past time trends in incidence rates as well as in population at risk. In most of the recently published studies the duration for which the time trend was assessed was more than 10 years while in few studies the duration was between 5-7 years. This raises the question as to what is the optimum time period which should be used for assessment of time trends and projections. Thus, the present paper explores the suitability of different time periods to predict the future rates so that the valid projections of cancer burden can be done for India. The cancer incidence data of selected cancer sites of Bangalore, Bhopal, Chennai, Delhi and Mumbai PBCR for the period of 1991-2009 was utilized. The three time periods were selected namely 1991-2005; 1996-2005, 1999-2005 to assess the time trends and projections. For the five selected sites, each for males and females and for each registry, the time trend was assessed and the linear regression equation was obtained to give prediction for the years 2006, 2007, 2008 and 2009. These predictions were compared with actual incidence data. The time period giving the least error in prediction was adjudged as the best. The result of the current analysis suggested that for projections of cancer cases, the 10 years duration data are most appropriate as compared to 7 year or 15 year incidence data.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1481-1494
• /
• 1997

In hard real-time systems, a timing fault may yield catastrophic results. Dynamic scheduling provides the flexibility to compensate for unexpected events at runtime; however, scheduling overhead at runtime is relatively large, constraining both the accuracy of the timing and the complexity of the scheduling analysis. In contrast, static scheduling need not have any runtime overhead. Thus, it has the potential to guarantee the precise time at which each instruction implementing a control action will execute. This paper presents a new approach to the problem of analyzing high-level language code, augmented by arbitrary before and after timing constraints, to provide a valid static schedule. Our technique is based on instruction-level complier code scheduling and timing analysis, and can ensure the timing of control operations to within a single instruction clock cycle. Because the search space for a valid static schedule is very large, a novel adaptive genetic search algorithm was developed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.5
• /
• pp.1109-1114
• /
• 2009

The order to see how the deep cleansing change sebum and moisture condition by skin type, 20 persons with dry skin and oily skin were divided into two groups of scrub group and enzyme group and given the deep cleansing care, totaling 8 time. After 8 times of the deep cleansing care, the scrub group showed a valid change with oily skin while the enzyme group showed a valid change with dry skin. However, both groups did not have change a moisture with any skin types. The outcome from the questionnaire that had been done to find subjective feeling indicated that oil change resulted in a valid feeling whereas change of moisture and sensitivity were barely felt.

• Journal of Power Electronics
• /
• v.18 no.2
• /
• pp.511-521
• /
• 2018

Proportional capacitor current feedback active damping (CCFAD) has a limited valid damping region in the discrete time domain as (0, $f_s/6$. However, the resonance frequency ($f_r$) of an LCL-type filter is usually designed to be less than half the sampling frequency ($f_s$) with the symmetry regular sampling method. Therefore, ($f_s/6$, $f_s/2$) becomes an invalid damping region. This paper proposes an improved CCFAD method to extend the valid damping region from (0, $f_s/6$ to (0, $f_s/2$), which covers all of the possible resonance frequencies in the design procedure. The full-valid damping region is obtained and the stability margin of the system is analyzed in the discrete time domain with the Nyquist criterion. Results show that the system can operate stably with the proposed CCFAD method when the resonance frequency is in the region (0, $f_s/2$). The performances at the steady and dynamic state are enhanced by the selected feedback coefficient H and controller gain $K_p$. Finally, the feasibility and effectiveness of the proposed CCFAD method are verified by simulation and experimental results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.117-119
• /
• 1997

We consider the control design for nonlinear uncertain systems. The uncertainty is mismatched and possibly fast time-varying. Within the suitable range of the uncertainty the control is valid. No statistical information on uncertainty is imposed. Only the possible bound of the uncertain parameter is known and the control design is based on Lyapunov approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.2
• /
• pp.1-14
• /
• 2011

In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.117-126
• /
• 2005

The current text based XML document systems are editing text and don't perform syntax check. As a result, the validity of an edited XML document can't be decided it is well-formed or valid until it is parsed. This paper describes a design and implementation of the syntax-directed editing system for XML documents. Because this is tree-based system, it is easy to extend XML document. And this system is designed to validate XML documents in real-time, It is expected that this paper contributes XML related application developments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.5
• /
• pp.730-738
• /
• 1994

The major advantage of the short-term load forecasting technique using general exponential smoothing is high accuracy and operational simplicity, but it makes large forecasting error when the load changes repidly. The paper has presented new technique to improve those shortcomings, and according to forecasted the technique proved to be valid for two years. The structure of load model is time function which consists of daily-and temperature-deviation component. The average of standard percentage erro in daily forecasting for two years was 2.02%, and this forecasting technique has improved standard erro by 0.46%. As relative coefficient for daily and seasonal forecasting is 0.95 or more, this technique proved to be valid.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.294-304
• /
• 2011

Enhancing continuous queries over data streams with temporal functions and predicates enriches the expressive power of those queries. While traditional continuous queries retrieve only the values of attributes, temporal continuous queries retrieve the valid time intervals of those values as well. Correctly evaluating such queries requires the coalescing of adjacent timestamps for value-equivalent tuples prior to evaluating temporal functions and predicates. For many stream applications, the available computing resources may be too limited to produce exact query results. These limitations are commonly addressed through load shedding and produce approximated query results. There have been many load shedding mechanisms proposed so far, but for temporal continuous queries, the presence of coalescing makes theses existing methods unsuitable. In this paper, we propose a new accuracy metric and load shedding algorithm that are suitable for temporal query processing when memory is insufficient. The accuracy metric uses a combination of the Jaccard coefficient to measure the accuracy of attribute values and $\mathcal{PQI}$ interval orders to measure the accuracy of the valid time intervals in the approximate query result. The algorithm employs a greedy strategy combining two objectives reflecting the two accuracy metrics (i.e., value and interval). In the performance study, the proposed greedy algorithm outperforms a conventional random load shedding algorithm by up to an order of magnitude in its achieved accuracy.