• Journal of Information Science Theory and Practice
• /
• 제1권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.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2004년도 추계학술대회
• /
• 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.

• Journal of Communications and Networks
• /
• 제7권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.

• 한국언어정보학회지:언어와정보
• /
• 제8권1호
• /
• pp.77-100
• /
• 2004

This paper aims to account for direct combination of an entity type noun with the verb HA- 'do' (ex. piano-rul ha- 'piano-ACC do') in Korean, based on Generative Lexicon Theory (Pustejovsky, 1995). The verb HA-'do' coerces some entity type nouns (e.g., pap 'boiled rice') into event type ones, by virtue of the qualia of the nouns. Typically, a telic-based type coercion supplies individual predication to the HA- construction and an agentive-based type coercion evokes a stage-level interpretation. Type coercion has certain constraints on the choice of qualia. We further point out that qualia cannot be a warehouse of pragmatic information. Qualia are composed of necessary information to explain the lattice structure of lexical meaning and co-occurrence constraints, distinct from accidental information. Finally, we seriously consider co-composition as an alternative to type coercion for the crucial operation of type shift.

• 한국언어정보학회지:언어와정보
• /
• 제18권2호
• /
• pp.1-29
• /
• 2014

Relativization is one of the common syntactic operations to merge two different clauses into a single information unit. This operation plays a pivotal role to structuralize multiple clauses cohesively as well as serves to specify the property an individual has within the context. That implies that relativization contributes to information structure of multiclausal sentences. In this context, this paper delves into information structure of relative clauses in English with an eye toward creation of a computational model from a standpoint of machine translation. The current work employs Head-driven Phrase Structure Grammar (HPSG, Pollard and Sag (1994)) as a theory of grammar and Minimal Recursion Semantics (MRS, Copestake et al. (2005) as a meaning representation system. Building upon these formalisms, this paper addresses how information structure of relative clauses can be represented and constrained. The current work makes use of Individual CONStraints (ICONS) for modeling relative clauses with respect to information structure. The current work also investigates which relative clause involves which information structure constraint. The present study argues that non-restrictive relative clauses impose a more specific constraint on information structure than restrictive relative clauses.

• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.686-692
• /
• 2006

This paper shows the calculation of 3D geometric information such as height, direction and distance under the constraints of a catadioptric camera system. The catadioptric camera system satisfies the single viewpoint constraints adopting hyperboloidal mirror. To calculate the 3D information with a single omni-directional image, the points are assumed to lie in perpendicular to the ground. The infinite plane is also detected as a circle from the structure of the mirror and camera. The analytic experiments verify the correctness of theory using real images taken in indoor environments like rooms or corridors. Thus, the experimental results show the applicability to calculate the 3D geometric information using single omni-directional images.

• 음성과학
• /
• 제10권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(5)
• /
• pp.23-26
• /
• 2000

Generally, the wheel-driven mobile robot systems, by their structural property, have nonholonomic constraints. These constraints are not integrable and cannot be written as time derivatives of some functions with respect to the generalized coordinates. Hence, nonlinear approaches are required to solve the problems. In this paper, the trajectory controller of wheeled mobile robot systems is suggested to guarantee its convergence to reference trajectory. Design procedure of the suggested trajectory controller is back-stepping scheme which was introduced recently in nonlinear control theory. The performance of the proposed trajectory controller is verified via computer simulation. In the simulation, the trajectory controller is applied to differentially driven robot system and car-like mobile robot system on the assumption that the trajectory planner be given.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• 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.

• Industrial Engineering and Management Systems
• /
• 제3권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.