• Journal of Digital Convergence
• /
• v.7 no.4
• /
• pp.169-180
• /
• 2009

IT governance implies a system in which all stakeholders with a given organization, including the board, internal customers, and related areas such as finance provide the necessary input into their decision-making process. However, the concepts of IT governance are broad and ambiguous, so IT governance is eventually needed multi-criteria decision making. This paper presents a hierarchical structure to better understand the relationship between control structure and the complexity of collective behavior with respect to IT governance and proposes a corresponding fuzzy model for analyzing IT governance complexity based on an extensive literature review. The results of this study are expected to provide a clearer understanding of how the concerns of IT governance behave and how they interact and form the collective behavior of the entire system.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.564-571
• /
• 2014

Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.7
• /
• pp.705-710
• /
• 2011

In this paper, we proposed the low computational complexity soft-decision e-BCH decoding algorithm based on the Chase algorithm. In order to make the test patterns, it is necessary to re-order the least reliable received symbols. In the process of ordering and finding optimal decoding symbols, high computational complexity is required. Therefore, this paper proposes the method of low computational complexity algorithm for soft-decision e-BCH decoding process.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.29-40
• /
• 2000

Process planning (selection and ordering of processes) and material selection for product manufacturing are two key things determined before taking full-scale manufacturing. Knowledge on product design. material characteristics, processes, time and cost all-together are mutually related and should be considered concurrently. Due to the complexity of problem, human experts have got only one of the feasilbe solutions with their field knowledge and experiences. We propose a hierarchical expert system framework of knowledge representation and reasoning in order to overcome the complexity. Manufacturing processes have inherently hierarchical relationships, from top level processes to bottom level operation processes. Process plan of one level is posted in process blackboard and used for lower level process planning. Process information on blackboard is also used to adjust the process plan in order to resolve the dead-end or inconsistency situation during reasoning. Decision variables for process, material, tool, time and cost are represented as object frames, and their relationships are represented as constraints and rules. Constraints are for relationship among variables such as compatibility, numerical inequality etc. Rules are for causal relationships among variables to reflect human expert\`s knowledge such as process precedence. CRSP(Constraint and Rule Satisfaction Problem) approach is adopted in order to obtain solution to satisfy both constraints and rules. The trade-off procedure gives user chances to see the impact of change of important variables such as material, cost, time and helps to determine the preferred solution. We developed the prototype system using visual C++ MFC, UNIK, and UNlK-CRSP on PC.

• 한국생물공학회:학술대회논문집
• /
• 2003.04a
• /
• pp.501-504
• /
• 2003

A novel prepurification method was developed aiming at increasing yield and purity, also reducing solvent usage for purification of paclitaxel. This method was a simple and efficient procedure, for the isolation and prepurification of paclitaxel from the biomass of Taxus chinensis, consisting of micelle formation, followed by two steps of precipitation. The use of a micelle and precipitation in the prepurification process allows for rapid separation of paclitaxel from interfering compounds and dramatically reduces solvent usage compared to alternative methodologies. This prepurification process serves to minimize the size and complexity of the HPLC operations for paclitaxel purification. This process is readily scalable to a pilot plant and eventually to a production environment where multikilogram quantities of material are expected to be produced. As much as possible, the process has been optimized to minimize solvent usage, complexity, and operating costs.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.4
• /
• pp.97-103
• /
• 1997

Designing a feedback controller requires a dynamic model of the process to be controlled. But the GMA welding process models have not been fully developed for many reasons such as complexity of the welding process and lack of reliable sensors. Because of the complexity of the welding system, we obtained a dynamic model for control using system identification routines, rather than derived a model from fundamental physical laws. The controller was designed based on the experimentally derived linear dynamic model of the welding process. In order to demonstrate application of the designed controller, the simulation was carried out.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.541-552
• /
• 2016

This paper introduces the new notions of conjunctive and complement choices in process algebra, which reduce both process and system complexities significantly for distributed mobile real-time system during specification and analysis phases. The complement choice implies that two processes make cohesive choices for their synchronous partners at their own choice operations. The conjunctive choice implies choice dependency among consecutive choice operations in a process. The conjunctive choice reduces process complexity exponentially by the degree of the consecutive choice operations. The complement choice also reduces system complexity exponentially by the degree of the synchronous choice operations. Consequently, the reduction method makes the specification and analysis of the systems much easier since the complexity is reduced significantly. This notion is implemented in a process algebra, called ${\delta}$-Calculus. The efficiency and effectiveness are demonstrated with an example in a tool for the algebra, called SAVE, which is developed on ADOxx platform.

• Journal of the Society of Naval Architects of Korea
• /
• v.56 no.1
• /
• pp.1-10
• /
• 2019

Naval ship design and related other activities can be characterized by the complexity of the interactions among products, activities, and disciplines. Such complexities often result in inferior designs, cost overrun, and late-delivery. Hence there exist tremendous interests in both improving the design process itself and optimizing the interactions among design activities. This paper looks at the complexity of designing naval ships thereby leading to the innovation of current ship design practices using design structure matrix. It can be used to induce the optimal ordering of design activities as well as identify sources of complexities. The method presented here identifies coupled design activities useful for reducing the complexity of naval ship design as well as optimally reordering design activities. This paper recommends the use of design structure matrix method suitable for numerically optimizing the concept design process of naval ship, and reducing cost and time required in designing naval ships by modeling and analyzing the design activities and engineering tasks, defined in systems engineering planning documents.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1238-1242
• /
• 2011

An efficient architecture for the reduction of complexity in forward quantization of H.264/AVC is presented in this paper. Since the multiplication operation in forward quantization plays crucial role in complexity of algorithm. More efficient quantization architecture with simplified high speed multiplier is proposed. It uses the modification of the quantization operation and the high speed multiplier is applied for simplification of quantization process.