• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.150-156
• /
• 2022

As the 4th industrial revolution emerges, the implementation of smart factories are essential in the manufacturing industry. However, 80% of small and medium-sized enterprises that have introduced smart factories remain at the basic level. In addition, in root industries such as injection molding, PLC and HMI software are used to implement functions that simply show operation data aggregated by facilities in real time. This has limitations for managers to make decisions related to product production other than viewing data. This study presents a method for upgrading the level of smart factories to suit the reality of small and medium-sized enterprises. By monitoring the data collected from the facility, it is possible to determine whether there is an abnormal situation by proposing an appropriate algorithm for meaningful decision-making, and an alarm sounds when the process is out of control. In this study, the function of HMI has been expanded to check the failure frequency rate, facility time operation rate, average time between failures, and average time between failures based on facility operation signals. For the injection molding industry, an HMI prototype including the extended function proposed in this study was implemented. This is expected to provide a foundation for SMEs that do not have sufficient IT capabilities to advance to the middle level of smart factories without making large investments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.322-331
• /
• 2003

As the complexity of a 3D game is increased by various factors of the game scenario, it has a problem for controlling the interrelation of the game objects. Therefore, a game system has a necessity of the coordination of the responses of the game objects. Also, it is necessary to control the behaviors of animations of the game objects in terms of the game scenario. To produce realistic game simulations, a system has to include a structure for designing the interactions among the game objects. This paper presents a method that designs the dynamic control mechanism for the interaction of the game objects in the game scenario. For the method, we suggest a game agent system as a framework that is based on intelligent agents who can make decisions using specific rules. Game agent systems are used in order to manage environment data, to simulate the game objects, to control interactions among game objects, and to support visual authoring interface that ran define a various interrelations of the game objects. These techniques can process the autonomy level of the game objects and the associated collision avoidance method, etc. Also, it is possible to make the coherent decision-making ability of the game objects about a change of the scene. In this paper, the rule-based behavior control was designed to guide the simulation of the game objects. The rules are pre-defined by the user using visual interface for designing their interaction. The Agent State Decision Network, which is composed of the visual elements, is able to pass the information and infers the current state of the game objects. All of such methods can monitor and check a variation of motion state between game objects in real time. Finally, we present a validation of the control method together with a simple case-study example. In this paper, we design and implement the supervised classification systems for high resolution satellite images. The systems support various interfaces and statistical data of training samples so that we can select the most effective training data. In addition, the efficient extension of new classification algorithms and satellite image formats are applied easily through the modularized systems. The classifiers are considered the characteristics of spectral bands from the selected training data. They provide various supervised classification algorithms which include Parallelepiped, Minimum distance, Mahalanobis distance, Maximum likelihood and Fuzzy theory. We used IKONOS images for the input and verified the systems for the classification of high resolution satellite images.

• Resources Recycling
• /
• v.13 no.1
• /
• pp.47-53
• /
• 2004

As a basic study of the re-using molten converter slag as an ordinary portland cement by conversion process, molten slag and sintered CaO pellet was reacted each other. The dissolution rate of the sintered CaO pellet into the molten slag was measured and the changes of the reaction layer was also investigated. The converter slag reagent-grade $SiO_2$ added was melted and hold for 30 minutes in MgO crucible between $1350∼1500 ^{\circ}C$. Then sintered CaO pellet heated at the same temperature was dipped into the molten slag and hold for 10∼30 min. After the reaction, the crucible was cooled in air and the specimen was cut off to the horizontal direction of the crucible. The dissolution rate of CaO pellet was measured by the change of the radius of sintered CaO pellet and the interface layer was observed by SEM/EDX and XRD. The dissolution rate of sintered CaO pellet contacted with the slag of basicity 1 was 9.8 $\mu\textrm{m}$/min at $1350^{\circ}C$ and increased to 18.0 $\mu\textrm{m}$/min at $1500^{\circ}C$. The rate was slightly decreased to 7.6 $\mu\textrm{m}$/min at $1350^{\circ}C$ and 15.0 $\mu\textrm{m}$/min at $V^{\circ}C$ in the slag of basicity 2. The dissolution rate of CaO in converter slag was followed to the rule of Arrhenius' temperature dependency, and the apparent activation energy of the dissolution of CaO was 36 kcal/mole. In case of the slag basicity of 1, the thickness of $C_2$S layer was 64-118 $\mu\textrm{m}$ and the thickness of $C_3$S was 28∼90 $\mu\textrm{m}$ for 10∼30 minutes at $1500^{\circ}C$. And the thickness of the $C_3$S layer was 90∼120 $\mu\textrm{m}$ at the same conditions in the slag basicity of 2.

• Journal of Intelligence and Information Systems
• /
• v.16 no.3
• /
• pp.121-145
• /
• 2010

University timetabling depending on the educational environments of universities is an NP-hard problem that the amount of computation required to find solutions increases exponentially with the problem size. For many years, there have been lots of studies on university timetabling from the necessity of automatic timetable generation for students' convenience and effective lesson, and for the effective allocation of subjects, lecturers, and classrooms. Timetables are classified into a course timetable and an examination timetable. This study focuses on the former. In general, a course timetable for liberal arts is scheduled by the office of academic affairs and a course timetable for major subjects is scheduled by each department of a university. We found several problems from the analysis of current course timetabling in departments. First, it is time-consuming and inefficient for each department to do the routine and repetitive timetabling work manually. Second, many classes are concentrated into several time slots in a timetable. This tendency decreases the effectiveness of students' classes. Third, several major subjects might overlap some required subjects in liberal arts at the same time slots in the timetable. In this case, it is required that students should choose only one from the overlapped subjects. Fourth, many subjects are lectured by same lecturers every year and most of lecturers prefer the same time slots for the subjects compared with last year. This means that it will be helpful if departments reuse the previous timetables. To solve such problems and support the effective course timetabling in each department, this study proposes a university timetabling support system based on two phases. In the first phase, each department generates a timetable template from the most similar timetable case, which is based on case-based reasoning. In the second phase, the department schedules a timetable with the help of interactive user interface under the timetabling criteria, which is based on rule-based approach. This study provides the illustrations of Hanshin University. We classified timetabling criteria into intrinsic and extrinsic criteria. In intrinsic criteria, there are three criteria related to lecturer, class, and classroom which are all hard constraints. In extrinsic criteria, there are four criteria related to 'the numbers of lesson hours' by the lecturer, 'prohibition of lecture allocation to specific day-hours' for committee members, 'the number of subjects in the same day-hour,' and 'the use of common classrooms.' In 'the numbers of lesson hours' by the lecturer, there are three kinds of criteria : 'minimum number of lesson hours per week,' 'maximum number of lesson hours per week,' 'maximum number of lesson hours per day.' Extrinsic criteria are also all hard constraints except for 'minimum number of lesson hours per week' considered as a soft constraint. In addition, we proposed two indices for measuring similarities between subjects of current semester and subjects of the previous timetables, and for evaluating distribution degrees of a scheduled timetable. Similarity is measured by comparison of two attributes-subject name and its lecturer-between current semester and a previous semester. The index of distribution degree, based on information entropy, indicates a distribution of subjects in the timetable. To show this study's viability, we implemented a prototype system and performed experiments with the real data of Hanshin University. Average similarity from the most similar cases of all departments was estimated as 41.72%. It means that a timetable template generated from the most similar case will be helpful. Through sensitivity analysis, the result shows that distribution degree will increase if we set 'the number of subjects in the same day-hour' to more than 90%.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.981-985
• /
• 2004

In this paper we designed the motor control IP Core and evaluate its quality from the viewpoint of IP reuse. The most attractive merit of this methodology, so called IP-based hardware design, is hardware reuse. Although various vendors designed hardware with the same specification and got the same functional results, all that IPs is not the same quality in the reuse aspect. As tremendous calls for SoC have been increased, associated research about IP quality standard, VSIA(Virtual Socket Interface Alliance) and STARC(Semiconductor Technology Academic Research Center), has been doing best to make the IP quality evaluation system. And they made what conforms to objective IP design standard. We suggest the methodology to evaluate our own designed motor control IP quality with this standard. To attain our goal, we designed motor control IP that could control the motor velocity and position with feedback compensation algorithm. This controller has some IP blocks : digital filter, quadrature decoder, position counter, motion compensator, and PWM generator. Each block's functionality was verified by simulator ModelSim and then its quality was evaluated. To evaluate the core, We use Vnavigator for lint test and ModelSim for coverage check. During lint process, We adapted the OpenMORE's rule based on RMM (Reuse Methodology Manual) and it could tell us our IP's quality in a manner of the scored value form. If it is high, its quality is also high, and vice versa. During coverage check ModelSim-SE is used for verifying how our test circuits cover designs. This objective methods using well-defined commercial coverage metrics could perform a quantitative analysis of simulation completeness. In this manner, We evaluated the designed motor control IP's quality from the viewpoint of reuse. This methodology will save the time and cost in designing SoC that should integrate various IPs. In addition to this, It can be the guide for comparing the equally specified IP's quality. After all, we are continuously looking forward to enhancing our motor control IP in the aspect of not only functional perfection but also IP reuse to prepare for the SoC-Compliant motor control IP design.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.119-132
• /
• 2009

Owing to the GIS technology, a vast volume of spatial data has been accumulated, thereby incurring the necessity of spatial data mining techniques. In this paper, we propose a new spatial data mining system named SD-Miner. SD-Miner consists of three parts: a graphical user interface for inputs and outputs, a data mining module that processes spatial mining functionalities, a data storage model that stores and manages spatial as well as non-spatial data by using a DBMS. In particular, the data mining module provides major data mining functionalities such as spatial clustering, spatial classification, spatial characterization, and spatio-temporal association rule mining. SD-Miner has own characteristics: (1) It supports users to perform non-spatial data mining functionalities as well as spatial data mining functionalities intuitively and effectively; (2) It provides users with spatial data mining functions as a form of libraries, thereby making applications conveniently use those functions. (3) It inputs parameters for mining as a form of database tables to increase flexibility. In order to verify the practicality of our SD-Miner developed, we present meaningful results obtained by performing spatial data mining with real-world spatial data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1657-1670
• /
• 2013

The increase in the number of music files in smart phone and MP3 player makes it difficult to find the music files which people want. So, Query-by-Singing/Humming (QbSH) systems have been developed to retrieve music from a user's humming or singing without having to know detailed information about the title or singer of song. Most previous researches on QbSH have been conducted using musical instrument digital interface (MIDI) files as reference songs. However, the production of MIDI files is a time-consuming process. In addition, more and more music files are newly published with the development of music market. Consequently, the method of using the more common MPEG-1 audio layer 3 (MP3) files for reference songs is considered as an alternative. However, there is little previous research on QbSH with MP3 files because an MP3 file has a different waveform due to background music and multiple (polyphonic) melodies compared to the humming/singing query. To overcome these problems, we propose a new QbSH method using MP3 files on mobile device. This research is novel in four ways. First, this is the first research on QbSH using MP3 files as reference songs. Second, the start and end positions on the MP3 file to be matched are estimated by using multi-layered perceptron (MLP) prior to performing the matching with humming/singing query file. Third, for more accurate results, four MLPs are used, which produce the start and end positions for dynamic time warping (DTW) matching algorithm, and those for chroma-based DTW algorithm, respectively. Fourth, two matching scores by the DTW and chroma-based DTW algorithms are combined by using PRODUCT rule, through which a higher matching accuracy is obtained. Experimental results with AFA MP3 database show that the accuracy (Top 1 accuracy of 98%, with an MRR of 0.989) of the proposed method is much higher than that of other methods. We also showed the effectiveness of the proposed system on consumer mobile device.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.147-156
• /
• 2005

CGI is a standard interface rule between web server and gateway devised for the gateway's standard output to replace a static web document in UNIX environment. So, it is common to use standard I/O statements provided by the programming language for the CGI gateway. But the standard I/O mechanism is one of buffer strategies that are designed transparently to operating system and optimized for generic cases. This means that it nay be useful to apply another optimization to the standard I/O environment in CGI gateway. In this paper, we introduced standard output method and file output method as the two output optimization areas for CGI gateways written in C language in the UNIX/LINUX systems, and applied the proposed methods of each area to Debian LINUX, IBM AIX, SUN Solaris, Digital UNIX respectively. Then we analyzed the effect of them focused on execution time. The results were different from operating system to operating system. Compared to normal situation, the best case of standard output area showed about $10{\%}$ improvement and the worst case showed $60{\%}$ degradation in file output area where some performance improvements were expected.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.77-84
• /
• 2012

Face classification has wide applications in intelligent video surveillance, content retrieval, robot vision, and human-machine interface. Pose and expression changes, and arbitrary illumination are typical problems for face recognition. When the face is captured at a distance, the image quality is often degraded by blurring and noise corruption. This paper investigates the efficacy of multi-classifier decision level fusion for face classification based on the photon-counting linear discriminant analysis with two different cost functions: Euclidean distance and negative normalized correlation. Decision level fusion comprises three stages: cost normalization, cost validation, and fusion rules. First, the costs are normalized into the uniform range and then, candidate costs are selected during validation. Three fusion rules are employed: minimum, average, and majority-voting rules. In the experiments, unfocusing and motion blurs are rendered to simulate the effects of the long distance environments. It will be shown that the decision-level fusion scheme provides better results than the single classifier.

• Journal of Korea Foundry Society
• /
• v.11 no.6
• /
• pp.475-481
• /
• 1991

In this study the fabrication technology and mechanical properties of AC8A/$Al_2O_3$ Composites by squeeze casting process were investigated to develope for application as the piston materials that require good friction, wear resistance, and thermal stability. AC8A/$Al_2O_3$ composistes without a porosity and the break of preform were fabricated at the melt temperature of $740^{\circ}C$, the preform temperature of $500^{\circ}C$, and mold temperature of $400^{\circ}C$ under the applied pressure of $1200kg/cm^2$ as the results of the observation of microstructures. As the results of this study, the tensile strength of AC8A/$Al_2O_3$ composites was not increased linearly with $Al_2O_3$ volume fraction and so it seemed not to agree with the rule of mixture, which had been used often in metal matrix composite. Also the tensile strength after thermal fatigue test was little different from that before the test. Consequently it was thought that AC8A/$Al_2O_3$ composites fabricated under our experimental conditions had a good thermal stability and subsequently a good interface bonding. Wear rate(i.e., volume loss per unit sliding distance) of AC8A/$Al_2O_3$ composites was decreased with $Al_2O_3$ volume fraction and the sliding speed at both room temperature and $250^{\circ}C$ and so there was a good correlation between wear rate and hardness. Also the wear rate of AC/8A20% $Al_2O_3$ composities was obtained the value of $1.65cm^3/cm$ at sliding speed of 1.14m/sec as compared with about $3.0\;{\times}10^{-8}cm^3/cm$ hyereutectie Al-Si alloy(Al-16%Si-2%Cu-1%Fe-1%Ni), which applied presently for piston materials. The wear behavior of $Al_2O_3$ composites was observed to a type of abrasive wear by the SEM view of wear surface.