• 대한전자공학회논문지
• /
• 제26권4호
• /
• pp.127-137
• /
• 1989

본 논문에서는 논리 설계 자동화를 위한 레지스터 전송 레벨의 하드웨어 흐름도와 하드웨어 기술언어 SDL-II (symbolic description language)를 각각 제안한다. SDL-II는 일반화된 FSM(finite state machine)의 동작 및 구조적 특성을 제안하는 하드웨어 흐름도로 표현하고 이의 각 기호에 1대 1 대응하며 제어부와 데이타 전송부를 함께 기술하도록 구문을 설정한다. 또한 여러가지 설계 요구조건을 하드웨어 흐름도로 표현하고 이를 SDL-II로 기술하여 본 논문의 유효성을 보인다.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.261-269
• /
• 2016

In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

• 로봇학회논문지
• /
• 제12권1호
• /
• pp.42-54
• /
• 2017

Using an inverse of the geometric Jacobian matrix is one of the most popular ways to control robot manipulators, because the Jacobian matrix contains the relationship between joint space velocities and operational space velocities. However, the control algorithm based on Jacobian matrix has algorithmic singularities: The robot manipulator becomes unstable when the Jacobian matrix loses rank. To solve this problem, various methods such as damped and filtered inverse have been proposed, but comparative studies to evaluate the performance of these algorithms are insufficient. Thus, this paper deals with a comparative analysis of six representative singularity avoidance algorithms: Damped Pseudo Inverse, Error Damped Pseudo Inverse, Scaled Jacobian Transpose, Selectively Damped Inverse, Filtered Inverse, and Task Transition Method. Especially, these algorithms are verified through computer simulations with a virtual model of a humanoid robot, THORMANG, in order to evaluate tracking error, computational time, and multiple task performance. With the experimental results, this paper contains a deep discussion about the effectiveness and limitations of each algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제7권2호
• /
• pp.245-254
• /
• 2012

In this study, we introduce a prototype-based classifier with feature selection that dwells upon the usage of a biologically inspired optimization technique of Particle Swarm Optimization (PSO). The design comprises two main phases. In the first phase, PSO selects P % of patterns to be treated as prototypes of c classes. During the second phase, the PSO is instrumental in the formation of a core set of features that constitute a collection of the most meaningful and highly discriminative coordinates of the original feature space. The proposed scheme of feature selection is developed in the wrapper mode with the performance evaluated with the aid of the nearest prototype classifier. The study offers a complete algorithmic framework and demonstrates the effectiveness (quality of solution) and efficiency (computing cost) of the approach when applied to a collection of selected data sets. We also include a comparative study which involves the usage of genetic algorithms (GAs). Numerical experiments show that a suitable selection of prototypes and a substantial reduction of the feature space could be accomplished and the classifier formed in this manner becomes characterized by low classification error. In addition, the advantage of the PSO is quantified in detail by running a number of experiments using Machine Learning datasets.

• Industrial Engineering and Management Systems
• /
• 제11권1호
• /
• pp.54-69
• /
• 2012

Chan and Qi (SCM 8/3 (2003) 209) developed an innovative measurement method that aggregates performance measures in a supply chain into an overall performance index. The method is useful and makes a significant contribution to supply chain management. Nevertheless, it can be cumbersome in computation due to its highly complex algorithmic fuzzy model. In aggregating the performance information, weights used by Chan and Qi-which aim to address the imprecision of human judgments-are incompatible with weights in additive models. Furthermore, the default assumption of linearity of its scoring procedure could lead to an inaccurate assessment of the overall performance. This paper addresses these limitations by developing an alternative measurement that takes care of the above. This research integrates three different approaches to multiple criteria decision analysis (MCDA)-the multiattribute value theory (MAVT), the swing weighting method and the eigenvector procedure-to develop a comprehensive assessment of supply chain performance. One case study is presented to demonstrate the measurement of the proposed method. The performance model used in the case study relies on the Supply Chain Operations Reference (SCOR) model level 1. With this measurement method, supply chain managers can easily benchmark the performance of the whole system, and then analyze the effectiveness and efficiency of the supply chain.

• 전기학회논문지
• /
• 제66권12호
• /
• pp.1899-1904
• /
• 2017

This paper presents a new one-time password approach generated based on $4{\times}4$ pattern schedule. It demonstrates generation of passkey from initial seed of random codes and mapping out in table pattern schedule which will produce a new form of OTP scheme in protecting information or data. The OTP-2FA has been recognized by many organizations as a landmark to authentication techniques. OTP is the solution to the shortcomings of the traditional user name/password authentication. With the application of OTP, some have benefited already while others have had second thoughts because of some considerations like cryptographic issue. This paper presents a new method of algorithmic approach based on table schedule (grid authentication). The generation of OTP will be based on the random parameters that will be mapped out in rows and columns allowing the user to form the XY values to get the appropriate values. The algorithm will capture the values and extract the predefined characters that produce the OTP codes. This scheme can work in any information verification system to enhance the security, trust and confidence of the user.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권2호
• /
• pp.83-94
• /
• 2003

Let K be a nonempty closed convex subset of a real Hilbert space H. Approximation solvability of a system of nonlinear variational inequality (SNVI) problems, based on the convergence of projection methods, is given as follows: find elements $x^*,\;y^*{\in}H$ such that $g(x^*),\;g(y^*){\in}K$ and $$<\;{\rho}T(y^*)+g(x^*)-g(y^*),\;g(x)-g(x^*)\;{\geq}\;0\;{\forall}\;g(x){\in}K\;and\;for\;{\rho}>0$$ $$<\;{\eta}T(x^*)+g(y^*)-g(x^*),\;g(x)-g(y^*)\;{\geq}\;0\;{\forall}g(x){\in}K\;and\;for\;{\eta}>0,$$ where T: $H\;{\rightarrow}\;H$ is a relaxed $g-{\gamma}-r-cocoercive$ and $g-{\mu}-Lipschitz$ continuous nonlinear mapping on H and g: $H{\rightarrow}\;H$ is any mapping on H. In recent years general variational inequalities and their algorithmic have assumed a central role in the theory of variational methods. This two-step system for nonlinear variational inequalities offers a great promise and more new challenges to the existing theory of general variational inequalities in terms of applications to problems arising from other closely related fields, such as complementarity problems, control and optimizations, and mathematical programming.

• Archives of Plastic Surgery
• /
• 제48권4호
• /
• pp.404-409
• /
• 2021

Background To date, there are no consensus guidelines for management of lymphatic leak in groin vascular reconstruction patients. The goal of this study is to review the relevant literature to determine alternatives for treatment and to design an evidence-based algorithm to minimize cost and morbidity and maximize efficacy. Methods A systematic review of the literature was conducted per Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) protocol. Two independent reviewers applied agreed-upon inclusion and exclusion criteria to eligible records. Studies that included patients who underwent groin dissection for oncologic diagnoses and level 5 data were excluded. Interventions were then categorized by efficacy using predetermined criteria. Results Our search yielded 333 records, of which eight studies were included. In four studies, the success of lymphatic ligation ranged from 75% to 100%, with average days to resolution ranging from 0 to 9. Conservative management in the form of elevation, compression, and bedrest may prolong time to resolution of lymphatic leak (14-24 days) and therefore cost. Conclusions The majority of patients should be offered early operative intervention in the form of lymphatic ligation with or without a primary muscle flap. If the patient is not an operative candidate, a trial of conservative management should be attempted before other nonsurgical interventions.

• International Journal of Computer Science & Network Security
• /
• 제21권12spc호
• /
• pp.556-564
• /
• 2021

Numerous spatial and transform-domain-based conventional denoising algorithms struggle to keep critical and minute structural features of the image, especially at high noise levels. Although neural network approaches are effective, they are not always reliable since they demand a large quantity of training data, are computationally complicated, and take a long time to construct the model. A new framework of enhanced hybrid filtering is developed for denoising color images tainted by additive white Gaussian Noise with the goal of reducing algorithmic complexity and improving performance. In the first stage of the proposed approach, the noisy image is refined using a high-dimensional non-local means filter based on Principal Component Analysis, followed by the extraction of the method noise. The wavelet transform and SURE Shrink techniques are used to further culture this method noise. The final denoised image is created by combining the results of these two steps. Experiments were carried out on a set of standard color images corrupted by Gaussian noise with multiple standard deviations. Comparative analysis of empirical outcome indicates that the proposed method outperforms leading-edge denoising strategies in terms of consistency and performance while maintaining the visual quality. This algorithm ensures homogeneous noise reduction, which is almost independent of noise variations. The power of both the spatial and transform domains is harnessed in this multi realm consolidation technique. Rather than processing individual colors, it works directly on the multispectral image. Uses minimal resources and produces superior quality output in the optimal execution time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.4108-4122
• /
• 2019

Workflow process mining is becoming a more and more valuable activity in workflow-supported enterprises, and through which it is possible to achieve the high levels of qualitative business goals in terms of improving the effectiveness and efficiency of the workflow-supported information systems, increasing their operational performances, reducing their completion times with minimizing redundancy times, and saving their managerial costs. One of the critical challenges in the workflow process mining activity is to devise a reasonable approach to discover and recognize the bottleneck points of workflow process models from their enactment event histories. We have intuitively realized the fact that the iterative process pattern of redo-activities ought to have the high possibility of becoming a bottleneck point of a workflow process model. Hence, we, in this paper, propose an algorithmic approach and its implementation to discover the redo-activities and their performers' involvements patterns from workflow process enactment event logs. Additionally, we carry out a series of experimental analyses by applying the implemented algorithm to four datasets of workflow process enactment event logs released from the BPI Challenges. Finally, those discovered redo-activities and their performers' involvements patterns are visualized in a graphical form of information control nets as well as a tabular form of the involvement percentages, respectively.