• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.4
• /
• pp.26-32
• /
• 2016

An autonomous car(driverless car, self-driving car, robotic car) is a vehicle that is capable of sensing its environment and navigating without human input. Autonomous cars can detect surroundings using a variety of techniques such as radar, lidar, GPS, odometry, and computer vision. Advanced control systems interpret sensory information to identify appropriate navigation paths, as well as obstacles and relevant signage. Autonomous cars have control systems that are capable of analyzing sensory data to distinguish between different cars on the road, which is very useful in planning a path to the desired destination. An issue tree, also called a logic tree, is a graphical breakdown of a question that dissects it into its different components vertically and that progresses into details as it reads to the right.Issue trees are useful in problem solving to identify the root causes of a problem as well as to identify its potential solutions. They also provide a reference point to see how each piece fits into the whole picture of a problem. Using Issue-Tree menthods, transportation safety policies were developed with autonompus vehicle in mind.

• 대한공업교육학회지
• /
• v.33 no.2
• /
• pp.1-25
• /
• 2008

In this study, theory of school consulting for founding the development strategy of industrial high school was explored, consulting model and performing technique model was suggested, case of consulting of industrial high school performed by the model and performing technique suggested. Up to now, research field of school consulting was instruction and supervision consulting mostly, there was not much school management consulting. In this paper, a school consulting model for industrial high school was developed, which was five step such as entry, diagnosis, action planning, action, and termination. A case of consulting for C technical high school applied by the consulting model suggested was analyzed, it will be used any other consulting project of industrial high school. According to the 5 step school consulting model, analysis of the present state of C technical high school, survey research, SWOT analysis, Issue Tree, school assesment were performed. In order to set up a development strategy for C technical high school, a table of problem and improvement based on issue tree was made, and then a Pay-Off Matrix was made out. Finally, a development plan of short and mid- and long-term for C technical high school was constructed.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1024-1037
• /
• 2021

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+algorithms.

• Journal of Intelligence and Information Systems
• /
• v.24 no.3
• /
• pp.157-176
• /
• 2018

The purpose of this research is to develop a detection model for companies designated as administrative issue in KOSDAQ market using financial data. Administration issue designates the companies with high potential for delisting, which gives them time to overcome the reasons for the delisting under certain restrictions of the Korean stock market. It acts as an alarm to inform investors and market participants of which companies are likely to be delisted and warns them to make safe investments. Despite this importance, there are relatively few studies on administration issues prediction model in comparison with the lots of studies on bankruptcy prediction model. Therefore, this study develops and verifies the detection model of the companies designated as administrative issue using financial data of KOSDAQ companies. In this study, logistic regression and decision tree are proposed as the data mining models for detecting administrative issues. According to the results of the analysis, the logistic regression model predicted the companies designated as administrative issue using three variables - ROE(Earnings before tax), Cash flows/Shareholder's equity, and Asset turnover ratio, and its overall accuracy was 86% for the validation dataset. The decision tree (Classification and Regression Trees, CART) model applied the classification rules using Cash flows/Total assets and ROA(Net income), and the overall accuracy reached 87%. Implications of the financial indictors selected in our logistic regression and decision tree models are as follows. First, ROE(Earnings before tax) in the logistic detection model shows the profit and loss of the business segment that will continue without including the revenue and expenses of the discontinued business. Therefore, the weakening of the variable means that the competitiveness of the core business is weakened. If a large part of the profits is generated from one-off profit, it is very likely that the deterioration of business management is further intensified. As the ROE of a KOSDAQ company decreases significantly, it is highly likely that the company can be delisted. Second, cash flows to shareholder's equity represents that the firm's ability to generate cash flow under the condition that the financial condition of the subsidiary company is excluded. In other words, the weakening of the management capacity of the parent company, excluding the subsidiary's competence, can be a main reason for the increase of the possibility of administrative issue designation. Third, low asset turnover ratio means that current assets and non-current assets are ineffectively used by corporation, or that asset investment by corporation is excessive. If the asset turnover ratio of a KOSDAQ-listed company decreases, it is necessary to examine in detail corporate activities from various perspectives such as weakening sales or increasing or decreasing inventories of company. Cash flow / total assets, a variable selected by the decision tree detection model, is a key indicator of the company's cash condition and its ability to generate cash from operating activities. Cash flow indicates whether a firm can perform its main activities(maintaining its operating ability, repaying debts, paying dividends and making new investments) without relying on external financial resources. Therefore, if the index of the variable is negative(-), it indicates the possibility that a company has serious problems in business activities. If the cash flow from operating activities of a specific company is smaller than the net profit, it means that the net profit has not been cashed, indicating that there is a serious problem in managing the trade receivables and inventory assets of the company. Therefore, it can be understood that as the cash flows / total assets decrease, the probability of administrative issue designation and the probability of delisting are increased. In summary, the logistic regression-based detection model in this study was found to be affected by the company's financial activities including ROE(Earnings before tax). However, decision tree-based detection model predicts the designation based on the cash flows of the company.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.31-33
• /
• 2007

Devising an efficient one-pass frequent pattern mining algorithm has been an issue in data mining research in recent past. Pattern growth algorithms like FP-Growth which are found more efficient than candidate generation and test algorithms still require two database scans. Moreover, FP-growth approach requires rebuilding the base-tree while mining with different support counts. In this paper we propose an item-based tree, called I-Tree that not only efficiently mines frequent patterns with single database scan but also provides multiple mining scopes with multiple support thresholds. The 'build-once-mine-many' property of I-Tree allows it to construct the tree only once and perform mining operation several times with the variation of support count values.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.787-790
• /
• 2017

Data quality is the main issue in the classification problems; generally, the presence of noisy instances in the training dataset will not lead to robust classification performance. Such instances may cause the generated decision tree to suffer from over-fitting and its accuracy may decrease. Decision trees are useful, efficient, and commonly used for solving various real world classification problems in data mining. In this paper, we introduce a preprocessing technique to improve the classification accuracy rates of the C4.5 decision tree algorithm. In the proposed preprocessing method, we applied the naive Bayes classifier to remove the noisy instances from the training dataset. We applied our proposed method to a real e-commerce sales dataset to test the performance of the proposed algorithm against the existing C4.5 decision tree classifier. As the experimental results, the proposed method improved the classification accuracy by 8.5% and 14.32% using training dataset and 10-fold crossvalidation, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.16-18
• /
• 2001

Despite extensive research on R-trees, most of the proposed schemes have not been integrated into existing DBMS due to the lack of protocol to provide consistency in concurrent environment. R-link tree is an acceptable data structure to deal with this issue., but still not enough. In this paper, we focus on a simplified predicate locking mechanism based on R-link tree for concurrency control and phantom protection. An in-memory operation control list (OCList) used to suspend some conflicting operations is designed here. The main features of this approach are (1) it can be implemented easily and do not need any extra information. (2) Only-one-lock is held when descending R-tree even when node split happens, while lock-coupling scheme is performed when ascending. No deadlocks are possible. (3) Searches and insertions are not unnecessarily restricted. (4) Insert and Delete phantom in R-link tree are avoid through beforehand predication.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.13 no.3
• /
• pp.114-127
• /
• 2010

This study aimed at reviewing the case examples of environmental assessment of development projects within management zones, identifying problems and improvement opportunities and suggesting the direction of environmental assessment for management zones that are increasingly segmented Findings showed that first, the assessment of environment soundness in management zones must incorporate the national land environmental map and wide-area ecological axes established by the Ministry of Environment. Second, regarding development activities in management zones, rather than an issue of simply destroying natural environment in a development site itself during a development period, an issue of permanently isolating ecosystems from surrounding areas in a mid/long-term perspective and continually polluting water in mid-stream/upstream regions where sites are located must be considered. Third, in the case of development projects with vast areas, existing plant communities will be disturbed and the naturalness of vegetation will gradually decline due to foreign tree species introduced for landscape architecture. Therefore, creating buffer forests at forest boundaries and planting native tree species that are same as nearby tree species must be examined. Last but not least, when assessing the environmental soundness of management zones, it would be crucial to comprehensively review the environmental, social and locational features of management zones, including surrounding areas, and set the direction of environmental assessment accordingly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3219-3236
• /
• 2012

A tree routing structure is often adopted for many-to-one data gathering and aggregation in sensor networks. For real-time scenarios, considering lossy wireless links, it is an important issue how to construct a maximum-lifetime data gathering tree with delay constraint. In this work, we study the problem of lifetime-preserving and delay-constrained tree construction in unreliable sensor networks. We prove that the problem is NP-complete. A greedy approximation algorithm is proposed. We use expected transmissions count (ETX) as the link quality indicator, as well as a measure of delay. Our algorithm starts from an arbitrary least ETX tree, and iteratively adjusts the hierarchy of the tree to reduce the load on bottleneck nodes by pruning and grafting its sub-tree. The complexity of the proposed algorithm is $O(N^4)$. Finally, extensive simulations are carried out to verify our approach. Simulation results show that our algorithm provides longer lifetime in various situations compared to existing data gathering schemes.