• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.725-730
• /
• 2000

Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.

• Journal of Information Science Theory and Practice
• /
• v.1 no.4
• /
• pp.67-75
• /
• 2013

This paper discusses awareness of institutional repositories and open access publishing among faculty members in Annamalai University, Tamil Nadu, India. The authors distributed 200 questionnaires among the faculty members in Annamalai University. Out of 200 questionnaires, 160 responses (80.00%) were received from faculty members. The respondents mentioned the motivating factors while using an institutional repository and indicated the benefits, constraints and strategies to develop open access in publications. It is evident from the table that more than 95% among the average of the faculty members confirm the benefits of open access in publications. 150 (93.75%) of faculty members have awareness, 6 (3.75%) have no idea and 4 (2.50%) state no opinion about awareness of institutional repository and open access publishing.

• Speech Sciences
• /
• v.10 no.3
• /
• pp.89-101
• /
• 2003

This paper investigates edge effects on the relationship between the underlying tonal sequence and its surface realization in the IP-final Accentual Phrase within the Optimality Theoretic framework. I will examine the way in which AP tones are aligned with their associated syllables in IP-final position. In Korean. Jun's (1996) 'see-saw effect' does not allow any two identical tones if they are marking a boundary of a prosodic group. A phonetic experiment conducted in this paper suggests that the 'see-saw effect' only apply to H boundary tones. Furthermore, it will be shown that the timing of tonal peaks is determined through the ranking of a set of violable constraints. The AP tonal realization is achieved through the access to the global intonation in a complicated way. In the course of discussion, pitch patterns in IP-medial Accentual Phrase will also be discussed.

• Language and Information
• /
• v.5 no.1
• /
• pp.55-71
• /
• 2001

One of the controversial issues in English locative inversion (LI) construction( e. g. Under the tree sat a woman) has been the functional status of preverbal PP and postverbal NP, i.e. whether they are a subject, a complement, or filer (topic) Based on the distributional parallelisms between the PP and NP on the one hand and an ordinary subject and filler on the other this paper proposes that the PP has a dual function as a subject and filler, while the NP also has some subject properties that the PP does not have These mixed functional properties are analyzed in the theory of HPSG expecially with the versions recently developed by Sag(1997) Manning and Sag(1999) and Ginzburg and Sag(to appear). This analysis claims that the LI construction needs to satisfy two general, independent constraints head-subject- phrase and head-filler-phrase. This position suggests that the English LI construction is an instance of the peripheral phenomena whose construction specific constraint is inherited from more general core constraints. (Dongseo University)

• Structural Engineering and Mechanics
• /
• v.14 no.2
• /
• pp.223-236
• /
• 2002

The main objective of the present paper is to address a formal procedure for orthotropic steel plates design. The theme of the proposed approach is to recast the design procedure into a mathematical programming model. The objective function to be optimized is the total weight of the structure. The total weight is function of its layout parameters and structural element design variables. Mean while the proposed approach takes into consideration the strength and rigidity criteria in addition to other dimensional constraints. A nonlinear programming model is developed which consists of a nonlinear objective function and a set of implicit/explicit nonlinear constraints. A transformation method is adopted for minimization strategy, where the primal model constrained problem is transformed into a sequence of unconstrained minimization models. The search strategy is based on the well-known Fletcher/Powell algorithm. The finite element technique is adopted for discretization and analysis strategies. Mindlin theory is selected to simulate the finite element model and a selective reduced integration scheme is exploited to avoid a shear lock problem.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.11a
• /
• pp.81-85
• /
• 2004

Companies adopted a program called Six Sigma, in order to make fundamental changes in the way the company operated to fulfill customers' expectations. Six Sigma reduces the occurrence of defects. This approach derives the overall process of selection the right projects based on their potential to improve performance metrics and selection and training the right people to get the business results. However, in the course of Six Sigma process steps, companies are in the face of problems. This study is to solve the problems using TP(Thinking Process) of TOC(Theory of Constraints). TOC is methodology for solving key problem in system which is called Constraints. Nowadays, its application is going to be wide and its concept is being implemented. In this paper, it is showed possibility of application TOC to Six Sigma.

• English Language & Literature Teaching
• /
• v.15 no.2
• /
• pp.51-70
• /
• 2009

This study focuses on the asymmetrical realization of homorganic nasal-obstruent stop clusters in English when they occur word medially and word finally. This uneven realization of NC clusters is not only controlled by the place of articulation of the cluster constituents but also by the agreement of voicing feature specifications of the cluster elements. We propose context-sensitive constraints, which are more specified versions than *NC (Pater, 1996, 1999, 2004). The result of the study reveals that homorganic NC clusters consisting of coronal place feature are faithfully realized word finally while they are constrained word medially. The deletion of voiceless post-nasal coronal stop should be considered a new language specific strategy to avoid *NC.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.234.2-234.2
• /
• 2012

As the accuracy in the measurement of cosmological parameters is ever-increasing in this era of precision cosmology, astrophysical constraints on high-redshift universe is also getting tighter. Three dimensional (3D) tomography of the high-redshift (z>~7) universe is expected to be made through the next-generation radio telescopes including various SKA pathfinders and SKA itself, which calls for extensive theoretical predictions. We present our new simulations of cosmic reionization covering the full dynamic range of radiation sources, and also the mock data for the (1) large-scale CMB polarization anisotropy for Planck mission, (2) small-scale, kinetic Sunyaev-Zel'dovich effect for South Pole Telescope project, and (3) 21-cm observations. We show that the new constraints on CMB from Planck will constrain the models of reionization significantly, which then should be tested by 3D tomography of high-redshift universe through the 21-cm observations by future radio telescopes.

• Journal of Communications and Networks
• /
• v.7 no.1
• /
• pp.87-92
• /
• 2005

This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and (equation omitted), respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to A. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2004

This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.