• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.145-161
• /
• 2014

Recently, many large organizations have multiple data sources (MDS') distributed over different branches of an interstate company. Local patterns analysis has become an effective strategy for MDS mining in national and international organizations. It consists of mining different datasets in order to obtain frequent patterns, which are forwarded to a centralized place for global pattern analysis. Various synthesizing models [2,3,4,5,6,7,8,26] have been proposed to build global patterns from the forwarded patterns. It is desired that the synthesized rules from such forwarded patterns must closely match with the mono-mining results (i.e., the results that would be obtained if all of the databases are put together and mining has been done). When the pattern is present in the site, but fails to satisfy the minimum support threshold value, it is not allowed to take part in the pattern synthesizing process. Therefore, this process can lose some interesting patterns, which can help the decider to make the right decision. In such situations we propose the application of a probabilistic model in the synthesizing process. An adequate choice for a probabilistic model can improve the quality of patterns that have been discovered. In this paper, we perform a comprehensive study on various probabilistic models that can be applied in the synthesizing process and we choose and improve one of them that works to ameliorate the synthesizing results. Finally, some experiments are presented in public database in order to improve the efficiency of our proposed synthesizing method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.692-703
• /
• 2004

Communication induced checkpointing (CIC) is one of the checkpointing techniques to provide fault tolerance for distributed systems. Independent checkpoints that each distributed process produces without coordination are likely to be useless. Useless checkpoints, which cannot belong to any consistent global checkpoint sets, induce nondeterminant rollback. To prevent the useless checkpoints, CIC forces processes to take additional checkpoints at proper moment. The number of those forced checkpoints is the main source of failure-free overhead in CIC. In this paper, we present two new CIC protocols which satisfy 'No Z-Cycle (NZC)'property. The proposed protocols reduce the number of forced checkpoints compared to the existing protocols with the drawback of the increase in message delay. Our simulation results with the synthetic data show that the proposed protocols have lower failure-free overhead than the existing protocols. Additionally, we show that the classical 'index-based checkpointing' protocols are inefficient in constructing the consistent global cut in distributed executions.

• Journal of Platform Technology
• /
• v.9 no.4
• /
• pp.10-31
• /
• 2021

The digital tax, recently referred to as the Google tax was finally agreed at the 31st General Assembly of the OECD (October 8, 2021) with full support by 136 countries and will take effect from 2023. The purpose of this study is to analyze the digital tax prepared by the OECD for global MNEs, and to suggest the impacts on the Korean industry and to present the Korean governmental countermeasures. As the first study, we analyzed the international agreement on digital tax. In results, we found that even if global MNEs do not set up a business operation in overseas countries, if sales and profits are generated, 25% of the excess profit is borne as tax (pillar 1), and when MNEs do business in all the countries, they are liable to at least a 15% tax (pillar 2). We think that countries around the world have prepared a minimum countermeasure to protect their companies in anticipation that global MNEs will easily encroach on their markets in the future. As the second study, in order to discover the reason why the MNEs are so strong, we investigated the trends of Google and B2B SaaS companies in details. In results, we discovered that the global MNEs establishes a digital platform partnership ecosystem that enables them to enter foreign markets easily and expand rapidly. In conclusion, as a countermeasure for the Republic of Korea, governmental policies were proposed at the corporate (startup nurturing), industry, and national level respectively.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.11
• /
• pp.1578-1583
• /
• 2013

In this paper, stochastic optimization algorithms of PSO (Particle Swarm Optimization) and APSO (Adaptive Particle Swam Optimization) are studied and compared. It is revealed that the APSO provides faster convergence and better search efficiency than the conventional PSO when they are adopted to find the global minimum of a two-dimensional function. The advantages of the APSO comes from the ability to control the inertia weight, and acceleration coefficients. To verify that the APSO is working better than the standard PSO, the design of a 10GHz microstrip patch as one of the elements of a high frequency array antenna is taken as a test-case and shows the optimized result with 5 iterations in the APSO and 28 iterations in th PSO.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.235-238
• /
• 1996

In this paper, a new optimization method which is a kind of random searching is presented. The proposed method is called RasVal which is an abbreviation of Random Search Method with Variable Seaxch Length and it can search for a global minimum based on the probability density functions of searching, which can be modified using informations on success or failure of the past searching in order to execute intensified and diversified searching. By applying the proposed method to a nonlinear crane control system which can be controlled by the Universal Learning Network with radial basis function(R.B.P.), it has been proved that RasVal is superior in performance to the commonly used back propagation learning algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.834-839
• /
• 2004

In this paper, we investigate the optimal base position and joint configuration of a planar wheeled mobile manipulator in terms of manipulability measure. Taking into account the level of coordination between a manipulator and a platform, both local and global optimization problems are considered. First, based on the kinematic models of a mobile manipulator, the manipulability measures are expressed along with the analysis of the configurational dependency. Second, the geometric symmetry of a mobile manipulator in view of manipulability measure is analyzed, and for some base positions, the best and worst joint configurations are determined, Third, with reverence to the maximum, minimum, and average manipulability measures, the optimal base positions are determined, and the percent improvements due to the base relocation are discussed considering the relative scales among the platform size, the wheel radius, and the link length.

• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.1
• /
• pp.47-56
• /
• 2004

The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.377-380
• /
• 2000

In this paper, a new adaptive linearizer architecture with the predistorter is proposed. In the M.Ghaderi's paper, two analog predistorters and an envelope detector are used. Analog circuits for the analog predistorter and the envelope detector can cause imperfection and inaccuracy of the system and make circuits more complex. To solve those problems, most of processes including the predistortion are made by the DSP. The RLS algorithm is applied so that the errors between power amplifier output signals through the postdistorters and predistorted input signals can be converged to the global minimum.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.37-44
• /
• 2017

Wireless sensor networks are composed of many wireless sensor nodes that are sensing the environments. These networks have many constraints that are resource constraints, wireless communication, self-construction, etc. But they have many applications that are monitoring environment, tracking the object, etc. In this paper, a mechanism of finding QoS Satisfied multi-path is proposed in wireless sensor networks. In order to satisfy the QoS requirement, the proposed mechanism extends the AODV protocol to find multiple paths from a source node to a destination node by using the additional AODV message types that are proposed. This mechanism will be used to support many QoS applications such as minimum delay time, the better reliability and the better throughput by using the QoS satisfied multi-path. Overheads of the proposed mechanism are evaluated using simulation, and it is showed that QoS satisfied multiple paths are found with a little more overhead than the AODV mechanism.