• Asia pacific journal of information systems
• /
• v.5 no.1
• /
• pp.186-218
• /
• 1995

The necessity of installing well adaptable Information Systems are required day by day in all the fields of business management. This paper provides an Information System development for enhancing competitive power of the small and medium-sized firms in Korea. Recent growing Information Technology leads to constructing invisibly some new adaptable Information Systems in accordance with the business size, level, capacity and requirements. Even though some advanced companies and big enterprises are already operating their own appropriate Information Systems so as to get their remarkable productivity at a moment. The rest of those small firms are still trying to find out some proper systems fitting their own business in very poor situations. The basic requirements of the points of views by mail questionaired and interviewed from 1292 small and medium-sized manufacturing firms reflected on this Information System development. As a result, the study introduces some economically efficient, convinient, flexible and useful applied Information Systems with simple methods.

• Proceeding of Spring/Autumn Annual Conference of KHA
• /
• 2008.04a
• /
• pp.166-170
• /
• 2008

The elder population is growing rapidly in Korea nowadays. Therefore, a demand for adaptable installation standard of residential space for the elderly is increasing with growth of the elder population. This study analyzed actual state by interviewing manager, surveying actual measurement and using draft of Elderly nursing facility which is for senile patients. As a result of the survey for size and facilities, facilities for elderly safety, accommodation per a person and room size per a person are below to standard. Therefore, establishing adaptable design standard is needed which is to make safe and fresh living environment for the elderly.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.5
• /
• pp.151-166
• /
• 2006

To solve the traffic problems of small cities like Chung Ju City, electronic communications equipment and the introduction of advanced technologies are being used or promoted. Other local areas with developed systems in place are being investigated for applicability. Systems like these will be introduced. This system will embody an organized, efficient transportation and safety system within this study At the moment, to solve the problem of reoccurring traffic in small towns in our country, we must develop an ITS service. We are now in the process of selecting and establishing the most adaptable ITS service to a small city For this purpose, we have studied existing records; taken a poll of the citizens of Chung Ju; examined present traffic conditions, examined road capacities; and reviewed available means of transportation. To accomplish the purpose of a thesis like this, we will research and analyze developed nations' and domestic cities' existing systems, construction and operation. We are in the process of building an ITS System which is the most adaptable to a small city like Chung Ju.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

• Proceeding of KASS Symposium
• /
• 2006.05a
• /
• pp.175-181
• /
• 2006

This paper presents an efficient reanalysis algorithm, named PRAS (Partial Reanalysis algorithm using Adaptable Substructuring), for the partially changed structures. The algorithm recalculates directly any displacement or member force under consideration in real time without a full reanalysis in spite of local changes in member stiffness or connectivity. The key procedures consists of 1) partitioning the whole structure into the changed part and the unchanged part, 2) condensing the internal degrees of freedom and forming the unchanged part substructure, 3) assembling and solving the new stiffness matrix from the unchanged part substructure and the changed members.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.249-252
• /
• 2008

This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator has an exact information on the station status, it is possible to efficiently perform polling. In this thesis, we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.

• Journal of Information Processing Systems
• /
• v.4 no.1
• /
• pp.17-26
• /
• 2008

This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the supervised learning algorithms adaptable to string vectors for text categorization.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.449-456
• /
• 2009

Image processing has been applied to steel bridge defect recognition since 1990s. Compare to human visual inspection, image processing provides a more objective and accurate way of assessment. Since shade and shadow may sometimes occur when taking bridge coating images, non-uniform illumination problems should be considered. By means of color image processing, this paper aims to mitigate the illumination effect for bridge coating assessment. Furthermore, the adaptable ellipse method (AEM) is proposed to recognize mild rust colors. Finally, AEM will be compared to the K-Means algorithm, a popular recognition method, to show its advantage.

• Journal of Wetlands Research
• /
• v.17 no.3
• /
• pp.273-282
• /
• 2015

This study suggested the adaptable plant species according to the change of warmth index (WI) through the Representative Concentration Pathway (RCP) 4.5 & 8.5 climate change scenarios from 2010 to 2099 in Seoul areas. From the scenario analysis results, we expected to change from the cool temperate souther forest zone to the warm temperate forest zone. We found the following adaptable 27 plant species: 6 species in the tree layer, Quercus serrata, Q. variabilis, Pinus densiflora, Q. acutissima, Styrax japonica and P. thunbergii etc.; 7 species in the shrub layer, Ligustrum obtusifolium, Lespedeza maximowiczii, Rhus trichocarpa, Callicarpa japonica, Rubus crataegifolius, Rosa multiflora, and Zanthoxylum piperitum etc.; 3 species in the herb layer, Oplismenus undulatifolius, Pteridium aquilinum var. latiusculum, and Commelina communis ect;, 11 species in the vine plants Smilax china, Cocculus trilobus, Parthenocissus tricuspidata, Lonicera japonica, Paederia scandens, Celastrus orbiculatus, Clematis apiifolia, Rubus parvifolius, Dioscorea batatas, Hydrangea serrata for. acuminata, Zelkova serrata etc.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.285-292
• /
• 2007

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.