• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.5
• /
• pp.39-47
• /
• 2016

Nowadays, several welding processes are generally used to join parts together, and the materials are generally steel, aluminum, copper, stainless steel, and other difficult-to-weld materials. If a proper welding process is chosen, it is helpful for welding parts. However, there is no desirable technique for appropriately deciding on the welding process in the industry. Therefore, an appropriate method of selecting a welding process is needed for the novice worker in the industry. In this sense, a new analytic network process (ANP) technique is used for effective decision making in welding. By considering several criteria in ANP, a selection method is suggested to decide on the proper welding process. In the study, several criteria were considered for the proper welding of parts. By considering a matrix of prior interdependence effects among various welding processes, a decision-making method based on an ANP is accomplished using a weighting matrix, which is supposed to select an appropriate welding process. In addition, for appropriate decision criteria of the welding process, several factors, such as material, shape, precision, economics, and equipment, are used to accomplish the ANP algorithm. Moreover, the final weighting matrix is calculated following its ANP strategy. Furthermore, this decision-making technique is applied to both stainless razor spot joining and thick steel pipe joining. The results show its reliability and practicality, and the novice engineer and manager can use this technique to determine the best welding process.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.33-39
• /
• 2017

In mission-critical applications such as vehicular networks, distributed robotics, and other cyber-physical systems, the requirements for latency are more stringent than traditional applications. Among them, autonomous V2V communication is a rapidly emerging domain of applications with a few milliseconds' latency requirements. Today's systems utilizing 802.11p or LTE-direct standards are not primarily designed for ultra-low latency. Because the medium access function contributes to a significant portion of the total latency, it is necessary to modify Layer2 in order to solve the problem. Focusing on MAC layer, we developed a scalable and latency-guaranteed MAC by devising Autonomous TDMA (ATDMA) in which autonomous joining/leaving is allowed without scheduling by coordinator. We also evaluated the performance of the algorithm by comparing with the WAVE protocol.

• Korean Journal of Remote Sensing
• /
• v.27 no.3
• /
• pp.379-388
• /
• 2011

At present, GEOBIA (Geographic Object-based Image Analysis), heir of OBIA (Object-based Image Analysis), is regarded as an important methodology by object-oriented paradigm for remote sensing, dealing with geo-objects related to image segmentation and classification in the different view point of pixel-based processing. This also helps to directly link to GIS applications. Thus, GEOBIA software is on the booming. The main theme of this study is to look into the applicability of geo-spatial processing open source to GEOBIA. However, there is no few fully featured open source for GEOBIA which needs complicated schemes and algorithms, till It was carried out to implement a preliminary system for GEOBIA running an integrated and user-oriented environment. This work was performed by using various open sources such as OTB or PostgreSQL/PostGIS. Some points are different from the widely-used proprietary GEOBIA software. In this system, geo-objects are not file-based ones, but tightly linked with GIS layers in spatial database management system. The mean shift algorithm with parameters associated with spatial similarities or homogeneities is used for image segmentation. For classification process in this work, tree-based model of hierarchical network composing parent and child nodes is implemented by attribute join in the semi-automatic mode, unlike traditional image-based classification. Of course, this integrated GEOBIA system is on the progressing stage, and further works are necessary. It is expected that this approach helps to develop and to extend new applications such as urban mapping or change detection linked to GIS data sets using GEOBIA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.388-398
• /
• 2011

In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.585-596
• /
• 2007

XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.674-685
• /
• 2014

The Knowledge service system needs to infer a new knowledge from indicated knowledge to provide its effective service. Most of the Knowledge service system is expressed in terms of ontology. The volume of knowledge information in a real world is getting massive, so effective technique for massive data of ontology is drawing attention. This paper is to provide the method to infer massive data-ontology to the extent of RDFS, based on cloud computing environment, and evaluate its capability. RDFS inference suggested in this paper is focused on both the method applying MapReduce based on RDFS meta table, and the method of single use of cloud computing memory without using MapReduce under distributed file computing environment. Therefore, this paper explains basically the inference system structure of each technique, the meta table set-up according to RDFS inference rule, and the algorithm of inference strategy. In order to evaluate suggested method in this paper, we perform experiment with LUBM set which is formal data to evaluate ontology inference and search speed. In case LUBM6000, the RDFS inference technique based on meta table had required 13.75 minutes(inferring 1,042 triples per second) to conduct total inference, whereas the method applying the cloud computing memory had needed 7.24 minutes(inferring 1,979 triples per second) showing its speed twice faster.

• Korean Journal of Heritage: History & Science
• /
• v.57 no.1
• /
• pp.82-108
• /
• 2024

With the transition of archaeological recording method's transition from analog to digital, the 3D scanning technology has been actively adopted within the field. Research on the digital archaeological digital data gathered from 3D scanning and photogrammetry is continuously being conducted. However, due to cost and manpower issues, most buried cultural heritage organizations are hesitating to adopt such digital technology. This paper aims to present a digital recording method of relics utilizing open-source software and photogrammetry technology, which is believed to be the most efficient method among 3D scanning methods. The digital recording process of relics consists of three stages: acquiring a 3D model, creating a joining map with the edited 3D model, and creating an digital drawing. In order to enhance the accessibility, this method only utilizes open-source software throughout the entire process. The results of this study confirms that in terms of quantitative evaluation, the deviation of numerical measurement between the actual artifact and the 3D model was minimal. In addition, the results of quantitative quality analysis from the open-source software and the commercial software showed high similarity. However, the data processing time was overwhelmingly fast for commercial software, which is believed to be a result of high computational speed from the improved algorithm. In qualitative evaluation, some differences in mesh and texture quality occurred. In the 3D model generated by opensource software, following problems occurred: noise on the mesh surface, harsh surface of the mesh, and difficulty in confirming the production marks of relics and the expression of patterns. However, some of the open source software did generate the quality comparable to that of commercial software in quantitative and qualitative evaluations. Open-source software for editing 3D models was able to not only post-process, match, and merge the 3D model, but also scale adjustment, join surface production, and render image necessary for the actual measurement of relics. The final completed drawing was tracked by the CAD program, which is also an open-source software. In archaeological research, photogrammetry is very applicable to various processes, including excavation, writing reports, and research on numerical data from 3D models. With the breakthrough development of computer vision, the types of open-source software have been diversified and the performance has significantly improved. With the high accessibility to such digital technology, the acquisition of 3D model data in archaeology will be used as basic data for preservation and active research of cultural heritage.