• The Journal of the Acoustical Society of Korea
• /
• v.19 no.5
• /
• pp.79-83
• /
• 2000

When passband ripple α/sub p/ and stopband attenuation α/sub s/ at the w/sub s/ where the stopband begins are specified in filter design, △α/sub s/ usually exceeds the specification by △α/sub s/ due to the necessity that the order n of the filter function be an integer. In this paper, we apply a trade-off method to remove the excess stopband attenuation △α/sub s/ for reducing the value of pole-Q and improving the characteristics of the Chebyshev filter function. We also apply the trade-off method of pole-Q reduction to the modified Chebyshev function, and then the 4 types of function have been analyzed to compare in frequency and time domain characteristics. The trade-off method reduces the pole-Q which influences the filter characteristics to maximum 49.6% without increase of the order n. Thus implies that they have the improved characteristics such as the reduced passband ripple and flatter delay characteristics as compared Chebyshev filter function before trade-off. And the unit step response shows shorter delay time and settling time in time domain performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1085-1092
• /
• 2012

Mobile communication systems define user state transition mechanisms in order to manage radio resources and battery power efficiently. In the state transition mechanism, a state with a higher energy consumption inherently offers a shorter access delay, so there is a tradeoff between the energy and delay performances. In this paper, we analyze the user state transition mechanism of UMTS by considering the bursty traffic attributes of mobile applications. We perform a numerical evaluation for both the energy consumption and the activation delay by Markov modeling of the state transition mechanism, and investigate their tradeoff relationship as functions of operational parameters. The resulting energy-delay tradeoff curves clearly show an achievable performance bound of the user state transition mechanism and also offer an optimal operation strategy to minimize the energy consumption while guaranteeing the delay requirement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1080-1086
• /
• 2014

In this paper, we analyze the tradeoff performance of a consensus algorithm when it is applied to the CSMA/CA-based distributed wireless network. The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the transmission delay on the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff relationship between these two performances and so there exists an optimal number of cooperating neighbors that minimizes the consensus time. The result for the optimal number of neighbors according to the number of nodes that participate in the consensus shows that it is optimal for all nodes to cooperate together in the small-scale network but it is optimal to limit the number of neighbors to a fixed value in the large-scale network with nodes greater than a certain value.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.18 no.4
• /
• pp.117-129
• /
• 2023

Organizations must seek change in order to adapt to environmental changes and achieve better performance. However, despite this obvious statement, empirical analysis has been almost non-existent due to the difficulty of manipulating organizational performance or change. In this study, we overcame these limitations and analyzed the causes and effects of organizational change by assuming a professional sports team as a venture company, which is relatively easy to objectively measure and evaluate organizational change or performance. We systematically collected and preprocessed traditional and advanced metrics of National Basketball Association (NBA) statistics along with preprocessed trade data from eight years of regular seasons (2014~2015-2021~2022) to analyze our research model. Assessment of process macro model 7 derives the following empirical result. The results of the empirical analysis depict that NBA teams with low organizational performance in the previous season are more likely to make organizational changes through player trades to improve performance. Into the bargain player trades mediate the static relationship between the winning percentage in the previous season and the winning percentage in the current season. However, the indirect effect of a team's previous season's performance on player trades appears to vary depending on the current situations and context of each NBA team. Teams that made the playoffs in the previous season tend to make fewer trades than teams that did not and the previous season's performance is highly correlated with the current season's performance. On the other hand, teams that did not make the playoffs in the previous season tend to make a relatively larger amount of player trades in total, and the mediating effect of trades vanishes in this case. In other words, teams that did not make the playoffs in the previous season experience a larger change in performance due to trades than teams that made the playoffs, even if they achieved the same winning percentage. This empirical analysis of the inverse relationship between organizational change and the performance of professional sports teams has both theoretical and practical implications in the field of sports industry and management by analyzing the fundamentals of organizational change and the performance of professional sports teams.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.791-800
• /
• 2009

Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.779-781
• /
• 2010

Trench D-MOS(double-diffusion MOS)는 기존의 D-MOS를 대체한 것으로 전체 전류의 길이를 짧게 함으로써 온전압강하가 낮아지게 된다. 따라서 소자가 턴-온시에 전력소모가 작게 되며, 온저항과 트레이드 오프관계인 턴-오프 특성도 그다지 나빠지지 않아 트레이드 오프 특성도 개선되어지는 장점이 있다. 본 논문은 MicoroTec 시뮬레이션을 이용하여 Trench D-MOS의 산화벽을 다르게하여 전류-전압 특성을 연구하였다.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.3010-3012
• /
• 2005

Orthogonal frequency division multiplexing (OFDM) 시스템은 높은 peak-to-average power ratio(PAR) 문제를 가진다. 일반적으로, partial transmit sequence(PTS) 기법을 이용하여 최적의 PAR 감소 성능을 얻기 위해서는 나눈 부블록의 수와 위상 요소 (rotation factor)에 관한 모든 탐색을 해야 한다. 나눈 부블록 수와 factor 수가 많을수록 PAR 감소 성능은 그 만큼 증가하지만, 그에 비례하여 복잡성과 계산량 또한 지수적으로 증가하여 송신기에서의 시간지연과 전력소비를 초래한다. 따라서, PAR 감소 성능을 낮추면서 복잡성 또한 줄일 수 있는 방법이 요구된다. 하지만, 성능과 계산의 복잡성 사이에는 트레이드오프가 존재하여, 두가지를 동시에 줄이는 것은 매우 어렵다. 본 논문에서는, 성능과 복잡성 사이의 최적의 트레이드오프에 대해 분석하고, 제안한 PTS 기법의 성능을 기존의 복잡한 PTS 기법과 비교한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.3-4
• /
• 2017

DRAM, HDD의 성장세가 둔화되면서 NVM이 그 대안으로 떠오르고 있다. Xpoint, Z-SSD등 여러 고성능 NVM이 발표되고 있으며 DRAM의 성능을 목표로 하고 있다. 본 논문에서는 DRAM 수준의 고성능 NVM이 상용화 될 때 어느 정도의 성능과 가격지표를 보일 것이며 이에 대한 가격과 저장공간의 트레이드오프는 어느 정도일지 알아보기 위해 실험을 진행하였다. RAM disk로 NVM환경을 시뮬레이션 하였고 SSD, HDD 간 I/O 성능을 측정하였다. NVM과 SSD는 70배에서 200배, NVM과 디스크는 98배에서 3000배 이상 차이가 있음을 확인했다. 이 결과를 바탕으로 RAM disk와 SSD 가격지표를 조사하여 IOPS/$를 도출해 보았고 NVM이 7배의 IOPS/$를 가지지만 SSD가 18배의 GB/$를 가지는 것을 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.323-325
• /
• 2014

The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the information sharing delay in the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff between these two performances according to node's coverage. In this paper, we present a method of coverage control that minimizes consensus time according to network scale.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.81-87
• /
• 1999

This paper discusses a bicriterion approach to sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach, which produces an efficient flintier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the m allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.