• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.55-68
• /
• 2008

One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form $P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m$, where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ complex matrices. Newton's method was introduced a useful tool for solving the equation P(X)=0. Here, we suggest an improved approach to solve each Newton step and consider how to incorporate line searches into Newton's method for solving the matrix polynomial. Finally, we give some numerical experiment to show that line searches reduce the number of iterations for convergence.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.1
• /
• pp.55-61
• /
• 2005

A Conjugate Gradient algorithm for unconstrained minimization is proposed which is invariant to a nonlinear scaling of a strictly convex quadratic function and which generates mutually conjugate directions for extended quadratic functions. It is derived for inexact line searches and for general functions. It compares favourably in numerical tests (over eight test functions and dimensionality up to 1000) with the Dixon (1975) algorithm on which this new algorithm is based.

• Journal of Information Technology Services
• /
• v.10 no.4
• /
• pp.259-268
• /
• 2011

A robot education system by emulation based on Web can be efficiently used for understanding concept of robot assembly practice and control mechanism of robot by control programming. It is important to predict the path of the line tracer robot which has to be decided by the robot. Shortest Path Algorithm is a well known algorithm which searches the most efficient path between the start node and the end node. There are two related typical algorithms. Dijkstra Algorithm searches the shortest path tree from a node to the rest of the other nodes. $A^*$ Algorithm searches the shortest paths among all nodes. The delay time caused by turning the direction of navigation for the line tracer robot at the crossroads can give big differences to the travel time of the robot. So we need an efficient path determine algorithm which can solve this problem. Thus, It is necessary to analyze the overhead of changing direction of robot at multi-linked node to determine the next direction for efficient routings. In this paper, we reflect the real delay time of directional changing from the real robot. A speed based Dijkstra algorithm is proposed and compared with the previous ones to analyze the performance.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.31-34
• /
• 2000

In this paper, we design an optimal path for multiple mobile robots. For this purpose, we propose a new method of path planning for multiple mobile robots in dynamic environment. First, every mobile robot searches a global path using a distance transform algorithm. Then we put subgoals at crooked path points and optimize them. And finally to obtain an optimal on-line local path, ever)r mobile robot searches a new path with static and dynamic obstacle avoidance.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.239-254
• /
• 2006

An efficient descent method for unconstrained optimization problems is line search method in which the step size is required to choose at each iteration after a descent direction is determined. There are many ways to choose the step sizes, such as the exact line search, Armijo line search, Goldstein line search, and Wolfe line search, etc. In this paper we propose a new inexact line search for a general descent method and establish some global convergence properties. This new line search has many advantages comparing with other similar inexact line searches. Moreover, we analyze the global convergence and local convergence rate of some special descent methods with the new line search. Preliminary numerical results show that the new line search is available and efficient in practical computation.

• IE interfaces
• /
• v.24 no.3
• /
• pp.241-247
• /
• 2011

This paper develops a mathematical model which searches an optimum lot size of a press line, and applies this model to the scheduling of the press line. This mathematical model is not a widely studied cost model but a model which considers the utilization of the press line under a lean production system. In this paper, the optimum lot size is a minimum lot size which does not exceed the total work time of the press line. A production volume and the priority of the production in the press line are adjusted using this optimum lot size. A mathematical model developed in this paper will allow determining the optimum lot size easily in case of variable production environments such as an introduction of a new product and a fluctuation of production volume of each item. Therefore, our model will make a better scheduling of the press line and will enhance the utilization of it.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.127-137
• /
• 1996

In this paper, an algorithm for on-line rightward japanese parsing is proposed. The ambiguity in on-line parsing is accumulated until the input is completely finished, since there is not a space between words in the japanese sentence. Thus the algorithm for morphological analysis, based on modified chart, is used in solving it. And the number of searching a word in dirctionary for morphological analysis is also a puzzling problem. The japanese sentence, consist of N characters, has logically its maximum number of N(N+1)/2 searches in the ordinary on-line analysis, which is nearly twice as many as normal off-line. In this paper, the matter is settled through the modification of dictionary format. In experiment, we can accomplish the rate of analysis which is nearly equal to that of off-line parsing. And it becomes clear that the longer a sentence is, the better an analysis efficiency is.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.469-471
• /
• 2005

Paper searches Neighbor Discovery Protocol's IPv6 address AutoConfiguration function that is IPv6's point technology. Also, I study plan to apply Router Advertisement function to Router. Router is formed whole system by Routing Process Card that do manager and Line Card that take charge of Packet Forwarding. Present plan that embody Router Advertisement function to Line Card.

• Journal of Intelligence and Information Systems
• /
• v.21 no.3
• /
• pp.117-129
• /
• 2015

As the Internet becomes ubiquitous, a large volume of information is posted on the Internet with exponential growth every day. Accordingly, it is not unusual that investors in stock markets gather and compile firm-specific or market-wide information through online searches. Importantly, it becomes easier for investors to acquire value-relevant information for their investment decision with the help of powerful search tools on the Internet. Our study examines whether or not the Internet helps investors assess a firm's value better by using firm-level data over long periods spanning from January 2004 to December 2013. To this end, we construct weekly-based search volume for information technology (IT) services firms on the Internet. We limit our focus to IT firms since they are often equipped with intangible assets and relatively less recognized to the public which makes them hard-to measure. To obtain the information on those firms, investors are more likely to consult the Internet and use the information to appreciate the firms more accurately and eventually improve their investment decisions. Prior studies have shown that changes in search volumes can reflect the various aspects of the complex human behaviors and forecast near-term values of economic indicators, including automobile sales, unemployment claims, and etc. Moreover, search volume of firm names or stock ticker symbols has been used as a direct proxy of individual investors' attention in financial markets since, different from indirect measures such as turnover and extreme returns, they can reveal and quantify the interest of investors in an objective way. Following this line of research, this study aims to gauge whether the information retrieved from the Internet is value relevant in assessing a firm. We also use search volume for analysis but, distinguished from prior studies, explore its impact on return comovements with market returns. Given that a firm's returns tend to comove with market returns excessively when investors are less informed about the firm, we empirically test the value of information by examining the association between Internet searches and the extent to which a firm's returns comove. Our results show that Internet searches are negatively associated with return comovements as expected. When sample is split by the size of firms, the impact of Internet searches on return comovements is shown to be greater for large firms than small ones. Interestingly, we find a greater impact of Internet searches on return comovements for years from 2009 to 2013 than earlier years possibly due to more aggressive and informative exploit of Internet searches in obtaining financial information. We also complement our analyses by examining the association between return volatility and Internet search volumes. If Internet searches capture investors' attention associated with a change in firm-specific fundamentals such as new product releases, stock splits and so on, a firm's return volatility is likely to increase while search results can provide value-relevant information to investors. Our results suggest that in general, an increase in the volume of Internet searches is not positively associated with return volatility. However, we find a positive association between Internet searches and return volatility when the sample is limited to larger firms. A stronger result from larger firms implies that investors still pay less attention to the information obtained from Internet searches for small firms while the information is value relevant in assessing stock values. However, we do find any systematic differences in the magnitude of Internet searches impact on return volatility by time periods. Taken together, our results shed new light on the value of information searched from the Internet in assessing stock values. Given the informational role of the Internet in stock markets, we believe the results would guide investors to exploit Internet search tools to be better informed, as a result improving their investment decisions.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.417-420
• /
• 1998

A heuristic sweeping algorithm for an autonomous smearing robot which executes the area filling task is proposed. This algorithm searches tracking points with the obstacle andenvironment wall while the robot tracking whole workspace, and finds sequential tracking line by sequentally connecting the tracking points in such a way that (1) the line should be never crossed, (2) the total tracking points should be is linked as short as possible, and (3) the tracking link should be cross over the obstacle in the work-space. If the line pass through the obstacle, hierarchical collision free algorithm proposed is implied. The proposed algorithm consists of (1) collision detection procedure, (2) obstacle map making procedures, (3) tracking points generation procedures for subgosls, (4) tracking points scanning procedures, and (5) obstacle avoidance procedure.