• Steel and Composite Structures
• /
• v.44 no.1
• /
• pp.33-47
• /
• 2022

This paper presents a finite element model for predicting the monotonic behaviour of bolted endplate joints connecting steel-concrete composite walls and steel beams. The demountable Hollo-bolts are utilised to facilitate the quick installation and dismantling for replacement and reuse. In the developed model, material and geometric nonlinearities were included. The accuracy of the developed model was assessed by comparing the numerical results with previous experimental tests on hollow/composite column-to-steel beam joints that incorporated endplates and Hollo-bolts. In particular, the Hollo-bolts were modelled with the expanded sleeves involved, and different material properties of the Hollo-bolt shank and sleeves were considered based on the information provided by the manufacture. The developed models, therefore, can be applied in the present study to simulate the wall-to-beam joints with similar structural components and characteristics. Based on the validated model, the authors herein compared the behaviour of wall-to-beam joints of two commonly utilised composite walling systems (Case 1: flat steel plates with headed studs; Case 2: lipped channel section with partition plates). Considering the ease of manufacturing, onsite erection and the pertinent costs, composite walling system with flat steel plates and conventional headed studs (Case 1) was the focus of present study. Specifically, additional headed studs were pre-welded inside the front wall plates to enhance the joint performance. On this basis, a series of parametric studies were conducted to assess the influences of five design parameters on the behaviour of bolted endplate wall-to-beam joints. The initial stiffness, plastic moment capacity, as well as the rotational capacity of the composite wall-to-beam joints based on the numerical analysis were further compared with the current design provision.

• Journal of the Korean Society for Library and Information Science
• /
• v.57 no.3
• /
• pp.279-301
• /
• 2023

The data-driven research environment is rapidly changing. Accordingly, domestic university libraries are also preparing to establish and operate research data management services to support university researchers. This study was designed to propose a research data management service to support researchers in science and technology specialized university libraries. In order to propose the service, 11 universities specializing in science and technology were selected from overseas and domestic universities and their research data management services were analyzed. Key categories were derived from analysis results, research data management, electronic research notebooks, and RDM training. In particular, the 'research data management' category included DMP, data collection, data management, data preservation, data sharing and publishing, data reuse, infrastructure and tools. And it consists of RDM guides and policies. The results of this study will be helpful in introducing and operating research data management services in science and technology specialized university libraries.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.2
• /
• pp.113-130
• /
• 2004

Most multimedia data contain text to emphasize the meaning of the data, to present additional explanations about the situation, or to translate different languages. But, the left makes it difficult to reuse the images, and distorts not only the original images but also their meanings. Accordingly, this paper proposes a support vector machines (SVMs) and spatiotemporal restoration-based approach for automatic text detection and removal in video sequences. Given two consecutive frames, first, text regions in the current frame are detected by an SVM-based texture classifier Second, two stages are performed for the restoration of the regions occluded by the detected text regions: temporal restoration in consecutive frames and spatial restoration in the current frame. Utilizing text motion and background difference, an input video sequence is classified and a different temporal restoration scheme is applied to the sequence. Such a combination of temporal restoration and spatial restoration shows great potential for automatic detection and removal of objects of interest in various kinds of video sequences, and is applicable to many applications such as translation of captions and replacement of indirect advertisements in videos.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.154-165
• /
• 2001

A number of attempts to develop methods for measuring software effort have been focused on the area of software engineering and many models have also been suggested to estimate the effort of software projects. Almost all current models use algorithmic or statistical mechanisms, but the existing algorithmic effort estimation models have failed to produce accurate estimates. Furthermore, they are unable to reflect the rapidly changing technical environment of software development such as module reuse, 4GL, CASE tool, etc. In addition, these models do not consider the paradigm shift of software engineering and information systems(i.e., Object Oriented system, Client-Server architecture, Internet/Intranet based system etc.). Thus, a new approach to software effort estimation is needed. After reviewing and analyzing the problems of the current estimation models, we have developed a model and a system architecture that will improve estimation performance. In this paper, we have adopted a neural network model to overcome some drawbacks and to increase estimation performance. We will also address the efficient system architecture and estimation procedure by a similar case-based approach and finally suggest the heuristic search method to find the best estimate of target project through empirical experiments. According to our experiment with the optimally parsimonious neural network model the mean error rate was significantly reduced to 14.3%.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.12
• /
• pp.499-506
• /
• 2019

An intelligent robot should decide its behavior accordingly to the dynamic changes in the environment and user's requirements by evaluating options to choose the best one for the current situation. Many intelligent robot systems that use the Procedural Reasoning System (PRS) accomplishes such task management functions by defining the priority functions in the task model and evaluating the priority functions of the applicable tasks in the current situation. The priority functions, however, are defined locally inside of the plan, which exhibits limitation for the tasks for multi-domain services because global contexts for overall prioritization are hard to be expressed in the local priority functions. Furthermore, since the prioritization functions are not defined as an explicit module, reuse or extension of the them for general context is limited. In order to remove such limitations, we propose a policy-based meta-planning for general task management for multi-domain services, which provides the ability to explicitly define the utility of a task in the meta-planning process and thus the ability to evaluate task priorities for general context combining the modular priority functions. The ontological specification of the model also enhances the scalability of the policy model. In the experiments, adaptive behavior of a robot according to the policy model are confirmed by observing the appropriate tasks are selected in dynamic service environments.

• Journal of Korean Medicine Rehabilitation
• /
• v.25 no.3
• /
• pp.65-79
• /
• 2015

Objectives The aim of this study is to identify the satisfaction of Korean medicine treatment by traffic accident. Methods This study was carried out 103 cases of traffic accident patients which had been treatment in Dongshin university Korean medicine hospital and Chung-Yeon Korean medicine hospital from June, 2014 to September, 2014. The survey used by preceding articles was accepted for assessment of the satisfaction degree of patients in this study. All data were coded by SPSS v18.0 and analyzed by descriptive maneuver, x2-test, T-test and correlation. Results According to the survey, 93.2% of patients included this study were hospitalized in the Korean medical hospital within 2 weeks from TA and 90.3% were satisfied with the current medical service. The answer that Korean medicine is superior to western medicine for TA treatment was the main reason for selecting Korean medical hospital. 46.6% of patients satisfied Acupuncture treatment and 29.1% of patients satisfied Korean physical treatment. There were no differences in the satisfaction degree with sex, age, education and occupation. The satisfaction degree of the current Korean medical service was significantly correlated with doctor's service, use the procedure and reuse intention. Conclusions We could see that the satisfaction of Korean medicine treatment is relatively high. The continuous and repetitive research is needed in order to improve the quality of Korean medicine hospital service and the satisfaction of patients by traffic accident.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.1-16
• /
• 2006

Recently, human based computing environment for supporting users to concentrate only user task without sensing other changes from users is being progressively researched and developed. But middleware deletes steream data processed for reducing process load of massive information from RFID sensor in this computing. So, this kind of middleware have problems when user demands probability or statistics needed for data warehousing or data mining and when user demands very important stream data repeatedly but already discarded in the middleware every former time. In this paper, we designs Sensor Middleware Architecture on Multi Level Spatial DBMS with Snapshot and manage repeatedly required stream datas to solve reusing problems of historical stream data in current middleware. This system uses disk databse that manages historical stream datas filtered in middleware for requiring services using historical stream information as data mining or data warehousing from user, and uses memory database that mamages highly reuseable data as a snapshot when stream data storaged in disk database has high reuse frequency from user. For the more, this system processes memory database management policy in a cycle to maintain high reusement and rapid service for users. Our paper system solves problems of repeated requirement of stream datas, or a policy decision service using historical stream data of current middleware. Also offers variant and rapid data services maintaining high data reusement of main memory snapshot datas.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.545-554
• /
• 2006

Although the current Web search engines provide tremendous information, it is hard to find right information among the huge information. Users need to spend extra time to filter out unnecessary information. In order to overcome the limit of current Web search engines, Semantic Web was developed to provide efficient search, integration, and reuse of information by structuring semantic information from Web resources. In this paper, an elementary education contents retrieval system using Semantic Web is proposed. The proposed system emphasizes history contents that have high relevancy among data. For construction of the proposed system, ontology is proposed first for elementary study contents and ontology for historical contents is proposed for easy access to those contents using semantic relation among them. Based on the ontology, the proposed system is designed and implemented. The proposed system has the following characteristics. First, the system provides various query formats in detail so that search results can be refined efficiently. Second, the system presents only semantically information connected with key words or including key words using study contents ontology. Finally, the proposed system can increase study effects by presenting various contents that are related with query by users.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.6-15
• /
• 2009

In this paper, a new 4-way search window is designed for the high-performance 2D PE architecture in H.264 Motion Estimation(ME) to improve the memory bandwidth. While existing 2D PE architectures reuse the overlapped data of adjacent search windows scanned in 1 or 3-way, the new window utilizes the overlapped data of adjacent search windows as well as adjacent multiple scanning (window) paths to enhance the reusage of retrieved search window data. In order to scan adjacent windows and multiple paths instead of single raster and zigzag scanning of adjacent windows, bidirectional row and column window scanning results in the 4-way(up. down, left, right) search window. The proposed 4-way search window could improve the reuse of overlapped window data to reduce the redundancy access factor by 3.1, though the 1/3-way search window redundantly requires $7.7{\sim}11$ times of data retrieval. Thus, the new 4-way search window scheme enhances the memory bandwidth by $70{\sim}58%$ compared with 1/3-way search window. The 2D PE architecture in H.264 ME for 4-way search window consists of $16{\times}16$ pe array. computing the absolute difference between current and reference frames, and $5{\times}16$ reusage array, storing the overlapped data of adjacent search windows and multiple scanning paths. The reference data could be loaded upward and downward into the new 2D PE depending on scanning direction, and the reusage array is combined with the pe array rotating left as well as right to utilize the overlapped data of adjacent multiple scan paths. In experiments, the new implementation of 4-way search window on Magnachip 0.18um could deal with the HD($1280{\times}720$) video of 1 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps at 149.25MHz.

• 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%.