• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.768-776
• /
• 2009

This paper analyses the message complexity of TDMA ad hoc MAC protocols. Since the network resource of ad hoc networks is limited due to the multiple interferences and the contention-based wireless channel, the scalability issue is one of the main research topics in developing ad hoc algorithms. Simulation demonstrates that SMACS protocol has the lowest message complexity, whereas TMMAC has the highest. In addition, it is found that since the effect of unicast dominates in the message complexity compared to other factors with an increasing number of nodes, Z-MAC tends to have the property of linearity, whereas BMA and TMMAC show exponential increases in their complexities.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.262-269
• /
• 2004

Ship structures are basically an assembly of plate elements and the load-carrying capacity or the ultimate strength is one of the most important criteria for safety assessment and economic design. Also, Structural elements making up ship plated structures do not work separately, resulting in high degree of redundancy and complexity, in contrast to those of steel framed structures. To enable the behavior of such structures to be analyzed, simplifications or idealizations must essentially be made considering the accuracy needed and the degree of complexity of the analysis to be used. On this study, to investigate effect of analysis range, the finite element method are used and their results are compared varying the analysis ranges. The model has been selected from bottom panels of large merchant ship structures. For FEA, three types of structural modeling are adopted in terms of the extent of the analysis. The purpose of the present study is to numerically calculate the characteristics of ultimate strength behavior according to the analysis ranges of stiffened panels subject to uniaxial compressive loads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1702-1721
• /
• 2019

A workflow process (or business process) management system helps to define, execute, monitor and manage workflow models deployed on a workflow-supported enterprise, and the system is compartmentalized into a modeling subsystem and an enacting subsystem, in general. The modeling subsystem's functionality is to discover and analyze workflow models via a theoretical modeling methodology like ICN, to graphically define them via a graphical representation notation like BPMN, and to systematically deploy those graphically defined models onto the enacting subsystem by transforming into their textual models represented by a standardized workflow process definition language like XPDL. Before deploying those defined workflow models, it is very important to inspect its syntactical correctness as well as its structural properness to minimize the loss of effectiveness and the depreciation of efficiency in managing the corresponding workflow models. In this paper, we are particularly interested in verifying very large-scale and massively parallel workflow models, and so we need a sophisticated analyzer to automatically analyze those specialized and complex styles of workflow models. One of the sophisticated analyzers devised in this paper is able to analyze not only the structural complexity but also the data-sequence complexity, especially. The structural complexity is based upon combinational usages of those control-structure constructs such as subprocesses, exclusive-OR, parallel-AND and iterative-LOOP primitives with preserving matched pairing and proper nesting properties, whereas the data-sequence complexity is based upon combinational usages of those relevant data repositories such as data definition sequences and data use sequences. Through the devised and implemented analyzer in this paper, we are able eventually to achieve the systematic verifications of the syntactical correctness as well as the effective validation of the structural properness on those complicate and large-scale styles of workflow models. As an experimental study, we apply the implemented analyzer to an exemplary large-scale and massively parallel workflow process model, the Large Bank Transaction Workflow Process Model, and show the structural complexity analysis results via a series of operational screens captured from the implemented analyzer.

• Journal of Korean Society for Quality Management
• /
• v.50 no.4
• /
• pp.777-792
• /
• 2022

Purpose: This paper investigates the effects of leader feedback on employee creative problem-solving behavior. It also explores the relevant conditions that maximize the above relationship from the psychological trait and task nature perspectives. Specifically we examine how employee feedback acceptance and task complexity moderate the relationship between leader's feedback behavior on follower creative problem-solving behavior. Finally the three-way interaction among leader's feedback behavior, employee feedback acceptance and task complexity is analyzed for the best conditions to maximize the positive effect of leader's feedback on creative problem solving behavior. Methods: This paper used a cross-sectional design with questionnaires administered to 411 employees working in Korean manufacturing and service firms. It applied a hierarchical regression analysis to test the hypothesized relationships including three-way interaction effect among leader's feedback behavior, follower feedback acceptance and task complexity on follower creative problem-solving behavior. Results: The empirical results of the paper indicated that the leader feedback behavior had enhanced employee creative problem-solving behavior. It was also found that follower feedback acceptance and task complexity positively moderated the relationship between leader's feedback and follower problem solving behavior. In addition, the test of three-way interaction effects also revealed that the higher the levels of both employee feedback acceptance and task complexity, the greater the positive effect of leader feedback behavior on employee creative problem solving behavior. Conclusion: This paper contributes to the leadership and creativity literatures by identifying the role of leader's behavior enhancing employee creative problem-solving behavior and the specific conditions strengthening the positive effect of leader feedback behavior on employee creative problem-solving behavior.

• Anxiety and mood
• /
• v.18 no.2
• /
• pp.72-79
• /
• 2022

Objective : Any traumatic event can be a risk factor, for subsequent mental disorder. However, childhood trauma, especially in interpersonal nature, is associated with later development of complex symptom patterns. This study examined the role of dissociation as a mediator between childhood trauma and symptom complexity. Methods : A pooled data of 369 psychiatric outpatients at a university-affiliated hospital was analyzed for descriptive statistics, group differences, and bivariate correlation analysis to verify a structural model. The questionnaires included the Symptom Checklist-90-Revised, the Trauma History Screen, the Dissociative Experiences Scale-Taxon, the Beck Depression Inventory, the Beck Anxiety Inventory, and the Abbreviated PTSD checklist. Results : When other trauma variables were controlled, childhood interpersonal trauma had significant correlation with symptom complexity (r=0.155, p=0.003). Among the paths analyzed, that of childhood interpersonal trauma and dissociation showed the greatest impact on symptom complexity (b=9.34, t=5.75, p<0.001). Based on the significance of the indirect impact, the results suggest a complete mediation impact of dissociation on symptom complexity. Conclusion : This study validated that childhood interpersonal trauma impacts symptom complexity, through the sequential mediating impact of dissociation. Thus, clinicians should understand childhood interpersonal trauma, dissociation, and symptom patterns in a complex and interacting mode, and develop effective pertinent treatment strategies.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.179-186
• /
• 2008

In this paper we analyse the effects of Bayesian algorithm in teaming class imbalance problems and compare the performance evaluation methods. The teaming performance of the Bayesian algorithm is evaluated over the class imbalance problems generated by priori data distribution, imbalance data rate and discrimination complexity. The experimental results are calculated by the AUC(Area Under the Curve) values of both ROC(Receiver Operator Characteristic) and PR(Precision-Recall) evaluation measures and compared according to imbalance data rate and discrimination complexity. In comparison and analysis, the Bayesian algorithm suffers from the imbalance rate, as the same result in the reported researches, and the data overlapping caused by discrimination complexity is the another factor that hampers the learning performance. As the discrimination complexity and class imbalance rate of the problems increase, the learning performance of the AUC of a PR measure is much more variant than that of the AUC of a ROC measure. But the performances of both measures are similar with the low discrimination complexity and class imbalance rate of the problems. The experimental results show 4hat the AUC of a PR measure is more proper in evaluating the learning of class imbalance problem and furthermore gets the benefit in designing the optimal learning model considering a misclassification cost.

• Nuclear Engineering and Technology
• /
• v.45 no.2
• /
• pp.151-164
• /
• 2013

A key input for the assessment of Human Error Probabilities (HEPs) with Human Reliability Analysis (HRA) methods is the evaluation of the factors influencing the human performance (often referred to as Performance Shaping Factors, PSFs). In general, the definition of these factors and the supporting guidance are such that their evaluation involves significant subjectivity. This affects the repeatability of HRA results as well as the collection of HRA data for model construction and verification. In this context, the present paper considers the TAsk COMplexity (TACOM) measure, developed by one of the authors to quantify the complexity of procedure-guided tasks (by the operating crew of nuclear power plants in emergency situations), and evaluates its use to represent (objectively and quantitatively) task complexity issues relevant to HRA methods. In particular, TACOM scores are calculated for five Human Failure Events (HFEs) for which empirical evidence on the HEPs (albeit with large uncertainty) and influencing factors are available - from the International HRA Empirical Study. The empirical evaluation has shown promising results. The TACOM score increases as the empirical HEP of the selected HFEs increases. Except for one case, TACOM scores are well distinguished if related to different difficulty categories (e.g., "easy" vs. "somewhat difficult"), while values corresponding to tasks within the same category are very close. Despite some important limitations related to the small number of HFEs investigated and the large uncertainty in their HEPs, this paper presents one of few attempts to empirically study the effect of a performance shaping factor on the human error probability. This type of study is important to enhance the empirical basis of HRA methods, to make sure that 1) the definitions of the PSFs cover the influences important for HRA (i.e., influencing the error probability), and 2) the quantitative relationships among PSFs and error probability are adequately represented.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.455-462
• /
• 2010

We investigate the worst case complexity regarding the number of comparisons for a simple and stable merging algorithm. The complexity analysis shows that the algorithm performs O(mlog(n/m)) comparisons for two sequences of sizes m and n $m{\leq}n$. So, according to the lower bound for merging $\Omega$(mlog(n/m)), the algorithm is asymptotically optimal regarding the number of comparisons. For proving the worst case complexity we divide the domain of all inputs into two disjoint cases. For either of these cases we will extract a special subcase and prove the asymptotic optimality for these two subcases. Using this knowledge for special cases we will prove the optimality for all remaining cases. By using this approach we give a transparent solution for the hardly tractable problem of delivering a clean complexity analysis for the algorithm.

• Architectural research
• /
• v.21 no.3
• /
• pp.59-67
• /
• 2019

Although many stadiums around the world have incorporated various profitable facilities, many are making conventional and cursory decisions without deep consideration of the interrelationships of different programs. This paper investigates cases in which new programs such as a hotel, a youth hostel, and a dormitory have been introduced into stadiums, showing different results. In the first part of this paper, the theoretical precedents of program combination are studied. Although Bernard Tschumi's notion of the combination of different programs presented its prophetic probability, this paper discern different approaches addressing program mixture, engendering eventually a productive modification of his notion based on the empirical observation of the cases. This paper classifies the manner of programmatic combination into complexity and hybridity, arguing that the latter transforms the spaces and gives rise to unexpected synergy, while the former merely assembles different programs. The second part compares the spaces of complexity and hybridity in stadiums. Through the plan and the section analysis of the spatial structure and the interrelationship of programs, this section reveals how the two different ways of the program combinations have had different results. In hybrid stadiums, programs are not simply gathered, but directly connected and intertwined. In the third part, the nature of the spatial transformation in the hybrid space is researched in detail. In the hybrid stadiums, the collision of the different programs changes the conception of the programs themselves and their related spaces. Hotels and stadiums are not what they once were, provoking unanticipated situations. These transformed spaces not only suggest a method of reutilizing of disused urban spaces, but also of meaningful and communicative program mixture, diversifying and vitalizing a city, not isolated islands of discrepancy. The ultimate purpose of this paper is clarifying the programmatic hybrid paradigm, surpassing complexity through the analysis of the stadium cases and illuminating the manner by which the hybridity breaks the typical tie between the program and space, to cause transformed situations.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1055-1062
• /
• 2022

In order to use the Massive MIMO (Multi Input Multi Output) technology using the massive array antenna, it is essential to know the angle of arrival (AOA) of the signal. When using a massive array antenna, the existing AOA estimation algorithm has excellent estimation performance, but also has a disadvantage in that computational complexity increases in proportion to the number of antenna elements. To solve this problem, a cascade AOA estimation algorithm has been proposed and the performance of a single-shaped (non)massive array antenna has been proven through a number of papers. However, the computational complexity of the cascade AOA estimation algorithm to which single and double rim array antennas are applied has not been compared. In this paper, we compare and analyze the computational complexity for AOA estimation when single and double rim array antennas are applied to the cascade AOA estimation algorithm.