• Asian Journal of Business Environment
• /
• 제9권1호
• /
• pp.21-28
• /
• 2019

Purpose - The purpose of this paper is to investigate the relationship between corporate social responsibility disclosure (CSRD) and investment-cash flow sensitivity, which is a surrogate for financing constraints. Research design, data, and methodology - Taking China's A-share listed companies between 2009 and 2016 as a sample, this paper empirically tests the relationship between CSRD and investment-cash flow sensitivity by Panel VAR model. By introducing the orthogonal impulse response function, this paper distinguishes the fundamental factors and financial ones that affect corporate investment behavior. Results - Findings indicate that: (1) investment-cash flow sensitivity of firms with low level of CSRD is significantly lower than that of firms with high level of CSRD; (2) the orthogonal impulse response of corporate investment to cash flow in firms with high level of CSRD is significantly different from zero, but it is not significant in firms with low level of CSRD; (3) for firms with low level of CSRD, 0.7% of corporate investment volatility can be explained by the change in cash flow, which is lower than that of firms with high level of CSRD (1.1%). Conclusions - Corporations disclosing more and higher quality CSRD are often those faced with financing constraints. Voluntary disclosure can help them alleviate information asymmetry and financing constraints.

• 말소리와 음성과학
• /
• 제1권2호
• /
• pp.129-140
• /
• 2009

The purpose of the present study is to investigate frequency related information and syllable structure constraints on Sino-Korean. Previous studies on Sino-Korean have mostly investigated the historical change of sounds and reviewed archaic features of Chinese language in Sino-Korean. Unfortunately, there is little study on the sounds of contemporary Sino-Korean in terms of syllable structure constraints. For the purpose of the present study, sounds of 7,742 Chinese characters used in Sino-Korean (7,795 syllables) were investigated and syllable matrices made based on the results of frequency related information. As a result, 483 syllable types were observed and the most frequently observed syllables were as follows: /ku/ (103) > /ki/ (100) > /ju/ (87) > /pi/ (86). Only 16 out of 19 consonants are used for Sino-Korean. /$t^{\ast}$/ and /$p^{\ast}$/ are never used in Sino-Korean and /kh, $s^{\ast}$, $k^{\ast}$/ occur only a few times (3, 2, 1 respectively). /k/ (17.5%) shows the highest frequency and /n, ${\eta}$, 1, tc, m/ occupied the next rankings. Among 20 vowel types, /a/ showed the highest frequency and /o, u, i, $j{\Lambda}$, ${\Lambda}$/ occupied the next rankings. Based on the syllable matrices, gaps were observed and classified into accidental or systematic ones. Onset and nucleus, nucleus and coda, onset and coda, and other syllable structure constraints of Sino-Korean were listed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권7호
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• 한국IT서비스학회지
• /
• 제10권3호
• /
• pp.49-59
• /
• 2011

A ship scheduling model is presented for the raw material transportation problem with yard storage constraints in a steel mill. The problem is formulated as 0, 1 mixed integer programming considering such constraints as loading port conditions, ship size and hold capacity, unloading conditions, and yard storage space. In addition, inventory related constraints including safety stock are taken into consideration to support the continuous operations of steel making process. The proposed model has been implemented and applied successfully to a real world problem, and its results show the improvement of performance compared to the traditional method. For example, the arrival dates of ships are determined satisfying the constraints. The total inventory level is minimized at the stock yard as a result. Also, the safety inventory level is always kept at the planning stage, and the standard deviation of total inventory level is reduced significantly. Further research is expected to develop efficient heuristics to have a better response time for even larger scale problems.

• 한국안전학회지
• /
• 제30권3호
• /
• pp.32-37
• /
• 2015

In the fields of plant layout optimization, the main goal is to minimize the construction cost including pipelines as satisfying all constraints such as safety and operating issues. However, what is the lacking of considerations in previous researches is to consider proper safety and maintenance spaces for a complex plant. Based on the mathematical programming, MILP(Mixed Integer Linear Programming) problems including various constraints can be formulated to find the optimal solution which is to achieve the best economic benefits. The objective function of this problem is the sum of piping cost, pumping cost and area cost. In general, many conventional optimization solvers are used to find a MILP problem. However, it is really hard to solve this problem due to complex inequality and equality constraints, since it is impossible to use the derivatives of objective functions and constraints. To resolve this problem, the PSO (Particle Swarm Optimization), which is one of the representative sampling approaches and does not need to use derivatives of equations, is employed to find the optimal solution considering various complex constraints in this study. The EO (Ethylene Oxide) plant is tested to verify the efficacy of the proposed method.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2006년도 하계학술대회
• /
• pp.382-389
• /
• 2006

상황 인식 서비스가 발전하고 있는 요즘, 공간 인식 접근 제어 시스템에 높은 보안을 요구하고 있다. 이에 공간 역할의 사용자 할당, 권한의 할당, 역할 스키마와 역할 인스턴스, 공간 역할 계층, 그리고 공간제약을 제공하는 GEO-RBAC은 공간 인식 서비스에 적합한 접근 제어 모델이다. 하지만 GEO-RBAC은 공간 인식 환경에 필요한 시간 제약을 고려하지 않는 단점이 있다. 따라서 본 논문에서는 시간 제약의 개념을 사용하여 효과적인 접근제어 모델을 제시한 GTRBAC의 시간과 기간 제약 개념을 고려하여 GEO-RBAC의 유연성을 높이고 다양한 경우에도 효과적인 접근제어를 할 수 있도록 시간 제약을 고려한 GEO-RBAC 모델을 제안한다.

• Journal of Power Electronics
• /
• 제18권4호
• /
• pp.1111-1126
• /
• 2018

In modern power systems, distributed generators (DGs) result in high stress on system frequency stability. Apart from the intermittent nature of DGs, most DGs do not contribute inertia or damping to systems. As a result, a new control method referred to as a virtual synchronous machine (VSM) has been proposed, which brought new characteristics to inverters such as synchronous machines (SM). DGs employing an energy storage system (ESS) provide inertia and damping through VSM control. Meanwhile, energy storage presents some physical constraints in the VSM implementation level. In this paper, a VSM mathematical model is built and analyzed. The dynamic responses of the output active power are presented when a step change in the frequency occurs. The influences of the inertia constant, damping factor and operating point on the ESS volume margins are investigated. In addition, physical constraints are proposed based on these analyses. The proposed physical constraints are simulated using PSCAD/EMTDC software and tested through RTDS experiment. Both simulation and RTDS test results verify the analysis.

• 전기학회논문지
• /
• 제57권1호
• /
• pp.34-39
• /
• 2008

Nash Equilibrium(NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. Congestion on a transmission line makes it difficult to compute the NE due to causing a mixed strategy. In order to compute the NE of a multi-player game, some heuristics are proposed with concepts of a key player and power transfer distribution factor in other studies. However, generation capacity constraints are not considered and make it more difficult to compute the NE in the heuristics approach. This paper addresses an effect of generation capacity limits on the NE, and suggest a solution technique for the mixed strategy NE including generation capacity constraints as two heuristic rules. It is reported in this paper that a role of the key player who controls congestion in a NE can be transferred to other player depending on the generation capacity of the key player. The suggested heuristic rules are verified to compute the mixed strategy NE with a consideration of generation capacity constraints, and the effect of the generation constraints on the mixed strategy NE is analyzed in simulations of IEEE 30 bus systems.

• 인터넷정보학회논문지
• /
• 제5권5호
• /
• pp.129-138
• /
• 2004

스위치 노드(switch node)로 구성된 네트워크에서 멀티캐스팅을 위한 트리를 구성하는 것은 NP-complete로 알려진 스타이너 트리 문제(Stainer free problem)로 정형화된다. 현재의 멀티캐스트를 요구하는 서비스들은 대개 대용량의 멀티미디어 데이터를 요구하게 된다. 이러한 서비스들은 텍스트 기반의 서비스에 비해 서비스의 질(Quality of Service)이 아주 중요한 요소가 되고, QoS는 전송에 소요되는 시간에 매우 민감하게 반응한다. 단일 제약을 갖는 멀티캐스트 트리 문제에 적용되는 휴리스틱은 이미 많이 연구되었으나, 노드 연결도 제한과 평균 흡수를 고려하는 다중 제약이 있는 멀티캐스트 트리 문제에 적용되는 휴리스틱에 대한 연구는 없었다. 본 논문에서는 다중 제약을 만족하는 효율적인 멀티캐스트 트리 문제에 적용 가능한 알고리즘을 제안하고, 실험을 통하여 성능을 평가하였다.

• 한국건설관리학회논문집
• /
• 제10권1호
• /
• pp.36-44
• /
• 2009

건설공사 한 프로젝트의 전체공기는 개별 작업들이 수행된 날짜의 합이라 할 수 있다. 개별 작업들에서 지연이 발생할 경우 전체 공기 또한 늦어지기 마련이다. 이러한 개별 작업의 계획상에서 작업이 수행될 확률을 높인다면 프로젝트의 공기달성 확률 또한 높아지게 될 것이다. 따라서, 계획상의 작업 실행여부 확인을 위하여 건설 생산프로세스에서 각 작업의 수행 저해하는 제약요인을 도출하여 작업여건분석의 실시를 통해 저해요인의 사전 제거와 작업간의 상호의존성을 파악으로 작성된 개별 작업계획들의 실행 가능성 확인함으로써 공사전체의 공기지연을 방지하는 체계를 구축하고자 한다.