• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.970-974
• /
• 1993

This paper is concerned with an automatic generation of BOM (Bill Of Material) for a bicycle frame set using a knowledge based system. The major components module system includes : (1) Part information retrieval in CAD drawing, (2) BOM code generation rule, and (3) Database interface. The knowledge based system includes a rule base and a fact base. The fact base consists of basic, variant, and optional components of the standard BOMs of frame sets. The rule contains rules for generating new BOM code in case that the specified is not in the database. The system was implemented on a SUN workstation under Open Windows environments. AutoCAD for CAD drawing was also used.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.141-155
• /
• 2005

It is very important that sellers provide reasonable reserve prices for auction items in internet auction systems. Recently, an agent has been proposed to generate reserve prices automatically based on the case similarity of information retrieval theory and the moving average of time series analysis. However, one problem of the previous approaches is that the recent trend of auction prices is not well reflected on the generated reserve prices, because it simply provides the bid price of the most similar item or an average price of some similar items using the past auction data. In this paper. in order to overcome the problem. we propose a method that generates reserve prices based on the moving average. the exponential smoothing, and the least square of time series analysis. Through performance experiments. we show that the successful bid rate of the new method can be increased by preventing sellers from making unreasonable reserve prices compared with the previous methods.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.33-41
• /
• 2003

It is not easy to find desired information in the world wide web. In this research, we introduce a notion of concept network that is useful in finding information if it is used in search engines that are specialized in domains such as medicine, law or engineering. The concept network that we propose is a network in which nodes represent significant concepts in the domain, and links represent relationships between the concepts. We may use the concept network constructor as a preprocessor to speci-alized search engines. When user enters a target word to find information, our system generates and displays a concept network in which nodes are con-cepts that are closely related with the target word. By reviewing the network, user may confirm that the target word is properly selected for his intention, otherwise he may replace the target word with better ones discovered in the network. In this research, we propose a detailed method to construct concept net-work, implemented a prototypical system that constructs concept networks, and illustrate its usefulness by demonstrating a practical case.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.165-194
• /
• 1996

Data distribution is one of the most important steps in distributed database design. This paper proposes a methodology for distributing database by using a relational schema as an input. A design support system called DBDD (Database Distribution Design) is implemented within the framework of this methodology. The methodology consists of three phases such as (i) schema analysis, (ii) fragmentation, and (iii) allocation. In the schema analysis phase, all the table names are acquired from a global relational schema. In the fragmentation phase, fragments are generated according to transaction retrieval patterns. Furthermore, DBDD enhances the design quality by allocating fragments in a progressive manner. A real-life case is illustrated to demonstrate the practical usefulness of the DBDD.

• Journal of the Korean Institute of Gas
• /
• v.4 no.4 s.12
• /
• pp.58-64
• /
• 2000

Data compression and retrieval method are investigated for the effective utilization of measured process data. In this paper, a new data compression method, Clustering Compression(CC), which is based on the k-means clustering algorithm and piecewise linear approximation method is suggested. Case studies on industrial data set showed the superior performance of clustering based techniques compared to other conventional methods and showed that CC could handle the compression of multi-dimensional data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.374-378
• /
• 2000

in information retrieval, lack of positive examples is a main cause of poor performance. In this case most learning algorithms may not characteristics in the data to low recall. To solve the problem of unbalanced data, we propose a boosting method that uses linear perceptrons as weak learnrs. The perceptrons are trained on local data sets. The proposed algorithm is applied to text filtering problem for which only a small portion of positive examples is available. In the experiment on category crude of the Reuters-21578 document set, the boosting method achieved the recall of 80.8%, which is 37.2% improvement over multilayer with comparable precision.

• International Journal of Knowledge Content Development & Technology
• /
• v.3 no.1
• /
• pp.19-29
• /
• 2013

Insights from the recent wealth of popular books on neuroscience are offered to suggest a strengthening of theory in information science. Information theory has traditionally neglected the human dimension in favour of 'scientific' theory often derived from the Shannon-Weaver model. Neuroscientists argue in excitingly fresh ways from the evidence of case studies, non-intrusive experimentation and the measurements that can be obtained from technologies that include electroencephalography, positron emission tomography (PET), functional magnetic resonance imaging (fMRI), and magnetoencephalography (MEG). The way in which the findings of neuroscience intersect with ideas such as those of Kahneman on fast and slow thinking and Csikszentmihalyi on flow, is tentatively explored as lines of connection with information science. It is argued that the beginnings of a theoretical underpinning for current web-based information searching in relation to established information retrieval methods can be drawn from this.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.195-197
• /
• 1993

This raper describes a nev program designed as a part of the integrated software package for distribution system planning and operation. The program accesses electrical map databases which include both electrical and geographical information. Data retrieval, load flow analyses, and reconfiguration studies can be easily performed in highly interactive environment on graphics and pull down menus, case study results demonstrate the practical usefulness of the program at the real systems.

• Journal of Chest Surgery
• /
• v.45 no.5
• /
• pp.320-322
• /
• 2012

The percutaneous transcatheter closure of secundum atrial septal defect has recently become an increasingly widespread alternative to surgical closure in many centers. Although immediate, short, and intermediate term results of percutaneous transcatheter septal closure are promising, the procedure is not free from inherent complications that could be lethal. We report a case of device embolization necessitating emergent surgical retrieval.

• Language and Information
• /
• v.9 no.1
• /
• pp.69-92
• /
• 2005

Pattern recognition in cognitive agents is based on (i) the uninterpreted input data (e.g. parameter values) provided by the agent's hardware devices and (ii) and interpreted patterns (e.g. templates) provided by the agent's memory. Computationally, the task consists in finding the memory data corresponding best to the input data, for any given input. Once the best fitting memory data have been found, the input is recognized by applying to it the interpretation which happens to be stored with the memorized pattern. This paper presents a fast converging procedure which starts from a few initially recognized items and then analyzes the remainder of the input by systematically checking for items shown by memory to have been related to the initial items in previous encounters. In this way, known patterns are tried first, and only when they have been exhausted, an elementary exploration of the input is commenced. Efficiency is improved further by choosing the candidate to be tested next according to frequency.