• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.266-276
• /
• 2013

LSB-based steganography is a simple and well known information hiding technique. In most LSB based techniques, a secret message is embedded into a specific position of LSB in the cover pixels. On the other hand, the main threat of LSB-based steganography is steganalysis. This paper proposes an asynchronous-cellular-automata(ACA)-based steganographic method, where secret bits are embedded into the selected position inside the cover pixel by ACA rule 51 and a secret key. As a result, it is very difficult for malicious users to retrieve a secret message from a cover image without knowing the secret key, even if the extraction algorithm is known. In addition, another layer of security is provided by almost random (rule-based) selection of a cover pixel for embedding using ACA and a different secret key. Finally, the experimental results show that the proposed method can be secured against the well-known steganalysis RS-attack.

• Proceedings of the Microbiological Society of Korea Conference
• /
• 2005.05a
• /
• pp.132-134
• /
• 2005

The CC chemokine, monocyte chemoattractant protein-1 (MCP-1), plays a crucial role in the initiation of atherosclerosis and has direct effects that promote angiogenesis. To develop a specific inhibitor for MCP-1-induced angiogenesis, we performed in vitro selection employing phage display random peptide libraries. Most of the selected peptides were found to be homologous to the second extracellular loops of CCR2 and CCR3. We synthesized the peptide encoding the homologous sequences of the receptors and tested its effect on the MCP-1 induced angiogenesis. Surface Plasmon Resonance measurements demonstrated specific binding of the peptide to MCP-1 but not to the other homologous protein, MCP-3. Flow cytometry revealed that the peptide inhibited the MCP-1 binding to THP-1 monocytes. Moreover, CAM and rat aortic ring assays showed that the peptide inhibited MCP-1 induced angiogenesis. Our observations indicate that the MCP-1-binding peptide exerts its anti-angiogenic effect by interfering with the interaction between MCP-1 and its receptor.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.773-774
• /
• 2005

The knapsack problem (KP) is one of the traditional optimization problems. Specially, multiconstrained knapsack problem (MKP) is well-known NP-hard problem. Many heuristic algorithms and evolutionary algorithms have tackled this problem and shown good performance. This paper presents a novel genetic algorithm for the multiconstrained knapsack problem. The proposed algorithm is called 'Adaptive Link Adjustment'. It is based on integer random key representation and uses additional ${\alpha}$ and ${\beta}$-process as well as selection, crossover and mutation. The experiment results show that it can be archive good performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.1 s.94
• /
• pp.116-124
• /
• 1999

In most conventional design optimization of dynamic system, design sensitivities are utilized. However, design sensitivities based optimization method has numbers of drawback. First, computing design sensitivities for dynamic system is mathematically difficult, and almost impossible for many complex problems as well. Second, local optimum is obtained. On the other hand, Genetic Algorithm is the search technique based on the performance of system, not on the design sensitivities. It is the search algorithm based on the mechanics of natural selection and natural genetics. GA search, differing from conventional search techniques, starts with an initial set of random solutions called a population. Each individual in the population is called a chromosome, representing a solution to the problem at hand. The chromosomes evolve through successive iterations, called generations. As the generation is repeated, the fitness values of chromosomes were maximized, and design parameters converge to the optimal. In this study, Genetic Algorithm is applied to the actual dynamic optimization problems, to determine the optimal design parameters of the dynamic system.

• IE interfaces
• /
• v.25 no.3
• /
• pp.309-318
• /
• 2012

Forecasting probability or likelihood of technology development success has been a crucial factor for critical decisions in technology management such as R&D project selection and go or no-go decision of new product development (NPD) projects. This paper proposes an analytic network process (ANP) approach to forecasting of technology development success. Reviewing literature on factors affecting technology development success has constructed the ANP model composed of four criteria clusters : R&D characteristics, R&D competency, technological characteristics, and technological environment. An alternative cluster comprised of two elements, success and failure is also included in the model. The working of the proposed approach is provided with the help of a case study example of MRAM (magnetic random access memory) technology.

• Asian Journal of Business Environment
• /
• v.6 no.1
• /
• pp.25-30
• /
• 2016

Purpose - The study aims to examine the students' perspective (stream wise) of parameters affecting the undergraduate engineering education system present in a private technical institution in NCR, Haryana, India. Research design, data, and methodology - It is a descriptive type of research in nature. Questionnaire Based Survey has been used to collect the data. The sample size for the study is 500 comprising of the students respondents. The sample has been taken randomly and the questionnaire was filled by the students (pursuing B. Tech) chosen on the random basis from a private technical educational institution in NCR, Haryana, India. For data analysis and conclusion of the results of the survey, statistical tool like F test was performed with the help of high quality software; SPSS. Conclusion - Analysis of variance revealed statistically no difference between the mean number of the groups (stream wise) for the parameters "Selection", "Academic Excellence", "Infrastructure", "Personality Development and Industry Exposure" and "Management and Administration". While Analysis of variance revealed statistically difference between the mean numbers of the groups for the parameter "Placements".

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.384-389
• /
• 2012

In this paper, we examine the problems of the low energy adaptive clustering hierarchy (LEACH) protocol and present ideas for improvement by selecting the cluster head node. The main problem with LEACH lies in the random selection of cluster heads. There exists a probability that the formed cluster heads are unbalanced and may remain in one part of the network, which makes some part of the network unreachable. In this paper, we present a new version of the LEACH protocol called the improved LEACH (ILEACH) protocol, which a cluster head is selected based on its ratio between the current energy level and an initial energy level, and multiplies by the root square of its number of neighbor nodes. The simulation results show that the proposed ILEACH increases the energy efficiency and network lifetime.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.249-251
• /
• 2005

In this paper, an algorithm of path planning and obstacle avoidance for mobile robot is proposed. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors. By processing assigned numbers all regions are covered and then the path from start to destination is selected by these numbers. The RAS has an advantage of fast planning because of simple operations. This implies that new path selection may be possible within a short time and helps a robot to avoid obstacles in any direction. The algorithm can be applied to unknown environments. When moving obstacles appear, a mobile robot avoids obstacles reactively. then new path is selected by RAS.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.481-488
• /
• 2007

The k-means algorithm is well known for its efficiency in clustering large data sets. However, working only on numeric values prohibits it from being used to cluster real world data containing categorical values. The k-modes algorithm is to extend the k-means paradigm to categorical domains. The algorithm requires a pre-setting or random selection of initial points (modes) of the clusters. This paper improved the problem of k-modes algorithm, using the Max-Min method that is a kind of methods to decide initial values in k-means algorithm. we introduce new similarity measures to deal with using the categorical data for clustering. We show that the mushroom data sets and soybean data sets tested with the proposed algorithm has shown a good performance for the two aspects(accuracy, run time).

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.84-86
• /
• 2001

A new navigation method is developed and implemented for mobile robot. The mobile robot navigation problem has traditionally been decomposed into the path planning and path following. Unlike tracking-based system, which minimize intercept time and moved mobile robot distance for optimal rendezvous point selection. To research of random moving object uses algorithm of Adaptive Control using Auto-regressive Model. A fine motion tracking object's trajectory is predicted of Auto-regressive Algorithm. Thus, the mobile robot can travel faster than the target wi thin the robot's workspace. The can select optimal rendezvous point of various intercept time.