• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.85-89
• /
• 2010

Most images are composed as union of the various objects which can describe meaning respectively. Unlike human perception, The general computer systems used for image processing analyze images based on low level features like color, texture and shape. The semantic gap between low level image features and the richness of user semantic knowledges can bring about unsatisfactory classification results from user expectation. In order to deal with this problem, we propose a semantic cue based image classification method using salient points from object of interest. Salient points are used to extract low level features from images and to link high level semantic concepts, and they represent distinct semantic information. The proposed algorithm can reduce semantic gap using salient points modeling which are used for image classification like human perception. and also it can improve classification accuracy of natural images according to their semantic concept relative to certain object information by using salient points. The experimental result shows both a high efficiency of the proposed methods and a good performance.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2505-2513
• /
• 1996

This paper presents the analysis of the impedance characteristic of the strip type waveguide mount backed by the dielectric substrate using mode the matching and induced EMF method. The part of the waveguide containing the dielectric substrate is modeled as waveguide partially filled with the dielectric, and a hybrid mode analysis has been conducted for the structure. The electromagnetic scattering problem by the dielectric substrate is solved by the mode matching method using the calculated modal function. The input impedance seen at the mount gap is calculated by the induced EMF method using the calculated results. the calculated results thus obtained has been verified through comparison with the results by other numerical methods. The effect of some structure parameters such as the width of the substrate and the gap size on the mount impedance is investigated.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.3 no.4
• /
• pp.195-203
• /
• 2008

As South Korea is becoming the aging society and the relation between information and daily living getting very close, the information alienation of the old population could lead to a social problem. This paper analyzes the cause of the information gap observed from the old population of South Korea and advanced countries during the transition period to the digital economy era.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.485-494
• /
• 2008

Huge amounts of various web items such as keywords, images, and web pages are being made widely available on the Web. The popularities of such web items continuously change over time, and mining temporal patterns in popularities of web items is an important problem that is useful for several web applications. For example, the temporal patterns in popularities of search keywords help web search enterprises predict future popular keywords, enabling them to make price decisions when marketing search keywords to advertisers. However, presence of millions of web items makes it difficult to scale up previous techniques for this problem. This paper proposes an efficient method for mining temporal patterns in popularities of web items. We treat the popularities of web items as time-series, and propose gapmeasure to quantify the similarity between the popularities of two web items. To reduce the computation overhead for this measure, an efficient method using the Fast Fourier Transform (FFT) is presented. We assume that the popularities of web items are not necessarily following any probabilistic distribution or periodic. For finding clusters of web items with similar popularity trends, we propose to use a density-based clustering algorithm based on the gap measure. Our experiments using the popularity trends of search keywords obtained from the Google Trends web site illustrate the scalability and usefulness of the proposed approach in real-world applications.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.21-45
• /
• 2003

Various organizational factors effect successful implementation of IT enabled business transformation. Among them, the most critical success factor is deemed to overcoming change management problem. Lots of studies have been made on implementation methodologies and business process formalizations to encourage organizational members to accept new business process changes. However, the logic of process redesign still depends on qualitative problem solving techniques mostly depending on basically human intuition such as brainstorming, cause-and-effect analysis, and so on. In this paper, we develop algorithmic procedure applicable to designing various business process changes such as process automation, business process resequencing, and more radical process integration. The framework is employed from dynamic programming approach in the literature, which is based on the decision making paradigm of organizations to abstract business processes as quantitative decision models. As such, our research can fill the gap of limited development of theory based analytic methodologies for business process design, by providing objective rationale to reach the consensus among the organizational members including senior management.

• Journal of Information Technology Services
• /
• v.10 no.1
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4527-4547
• /
• 2018

Signcryption is a cryptographic primitive that provides authentication (signing) and confidentiality (encrypting) simultaneously at a lower computational cost and communication overhead. With the proposition of certificateless public key cryptography (CLPKC), certificateless signcryption (CLSC) scheme has gradually become a research hotspot and attracted extensive attentions. However, many of previous CLSC schemes are constructed based on time-consuming pairing operation, which is impractical for mobile devices with limited computation ability and battery capacity. Although researchers have proposed pairing-free CLSC schemes to solve the issue of efficiency, many of them are in fact still insecure. Therefore, the challenging problem is to keep the balance between efficiency and security in CLSC schemes. In this paper, several existing CLSC schemes are cryptanalyzed and a new CLSC scheme without pairing based on elliptic curve cryptosystem (ECC) is presented. The proposed CLSC scheme is provably secure against indistinguishability under adaptive chosen-ciphertext attack (IND-CCA2) and existential unforgeability under adaptive chosen-message attack (EUF-CMA) resting on Gap Diffie-Hellman (GDH) assumption and discrete logarithm problem in the random oracle model. Furthermore, the proposed scheme resists the ephemeral secret leakage (ESL) attack, public key replacement (PKR) attack, malicious but passive KGC (MPK) attack, and presents efficient computational overhead compared with the existing related CLSC schemes.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.415-423
• /
• 2009

Because of the fast changing car design and increasing facilities, manufacturing process of cars is getting more complex now a days. Particularly, car manufacturing system that consist of automated devices, applies various simulation techniques to validate device motion and detect collision. To cope with this problem, traditional manufacturing system deployed test-run with the real devices. However, increased computing power in a contemporary manufacturing system changes it into realistic 3D simulation environment. Similarly, managed device data that was generated using 2D traditionally, can be converted to 3D realistic simulation. The existing problem with 3D simulation is disjoint data interaction between different work stations. Consequently, JIGs, fixing the car part accurately, are changed according to fixing position on the part or a part shape properties. In practice, the 3D JIG data has to be managed according to kinematic information, but not of its features. However, generating kinematic information to the 3D model repeatedly according to frequent change in part is not explained in current literatures. To fill this knowledge gap, this paper suggests an improving method of rendering 3D JIG kinematics information to simulation model. Thereafter, it shows the result of implementation.

• Journal of Digital Convergence
• /
• v.16 no.11
• /
• pp.29-36
• /
• 2018

As the digital informatization society deepens, the digital divide of the information - underprivileged becomes increasingly serious social problem. In this study, we analyzed the relationship between digital informatization capacity and satisfaction level of leisure activity in low - income class. For the analysis, we analyzed the relationship between digital informatization level and leisure satisfaction level of the low income class based on the results of the digital information gap survey in 2017. As a result, it was found that there was a positive relationship between digital access and leisure activity satisfaction, such as having a wired / wireless information device at low socioeconomic level and availability of Internet access at all times. Second, digital information capacity level and leisure satisfaction level such as PC usage ability and mobile digital device utilization ability have positive (+) relationship. Third, the level of digital information utilization, such as the use of fixed and mobile Internet, also showed a positive (+) relationship with the leisure satisfaction level of the low income class. This suggests that it is necessary to provide various supports to resolve the digital divide between the low income class and the general public.