• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.59-67
• /
• 2012

As industrial software domain is recognizing with one of areas producing high added values, almost software company is running around in securing skilled workers. However, the hiring of software engineers without the consideration of long-term business goals can be caused the lack of manpower again. Also if there is no strategic workforce management plan, it is impossible to gain high performance despite many software engineers have been employed. One of ways to empower the software development capability, this paper identifies the software job functions in detail and proposes how to define the competency profile for the job function. We also propose the career path management scheme using the profile. The proposed workforce management approach which is based on the competency profile, enables to keep the appropriate size of human resources, and to achieve the business performance of software organization.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.109-124
• /
• 2003

Although most commercial relational DBMSs Provide a graphical query language for the user friendly interfaces of the databases, few research has been done for graphical query languages in object databases. Expressing complex query conditions in a concise and intuitive way has been an important issue in the design of graphical query languages. Since the object data model and object query languages are more complex than those of the relational ones, the graphical object query language should have a concise and intuitive representation method. We propose a graphical object query language called GOQL (Graphical Object Query Language) for object databases. By employing simple graphical notations, advanced features of the object queries such as path expressions including set attributes, quantifiers, and/or methods can be represented in a simple graphical notation. GOQL has an excellent expressive power compared with previous graphical object query languages. We show that path expressions in XSQL(1,2) can be represented by the simple graphical notations in GOQL. We also propose an algorithm that translates a graphical query in GOQL into the textual object query with the same semantics. We finally describe implementation results of GOQL in the Internet environments.

• Nuclear Engineering and Technology
• /
• v.55 no.8
• /
• pp.3030-3038
• /
• 2023

Nowadays, mobile robots have been used to search for uncontrolled radioactive source in indoor environments to avoid radiation exposure for technicians. However, in the indoor environments, especially in the presence of obstacles, how to make the robots with limited sensing capabilities automatically search for the radioactive source remains a major challenge. Also, the source search efficiency of robots needs to be further improved to meet practical scenarios such as limited exploration time. This paper proposes an automatic source search strategy, abbreviated as ACA: the location of source is estimated by a convolutional neural network (CNN), and the path is planned by the A-star algorithm. First, the search area is represented as an occupancy grid map. Then, the radiation dose distribution of the radioactive source in the occupancy grid map is obtained by Monte Carlo (MC) method simulation, and multiple sets of radiation data are collected through the eight neighborhood self-avoiding random walk (ENSAW) algorithm as the radiation data set. Further, the radiation data set is fed into the designed CNN architecture to train the network model in advance. When the searcher enters the search area where the radioactive source exists, the location of source is estimated by the network model and the search path is planned by the A-star algorithm, and this process is iterated continuously until the searcher reaches the location of radioactive source. The experimental results show that the average number of radiometric measurements and the average number of moving steps of the ACA algorithm are only 2.1% and 33.2% of those of the gradient search (GS) algorithm in the indoor environment without obstacles. In the indoor environment shielded by concrete walls, the GS algorithm fails to search for the source, while the ACA algorithm successfully searches for the source with fewer moving steps and sparse radiometric data.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.228-231
• /
• 1999

This paper describes the design and implementation of an application specific instruction-set processor developed for embedded DSP applications. The instruction-set has an uniform size of 16 bits, and supports 3 types of instructions: Primitive, Complex, and Specific. To reduce code size and cycle count we introduce complex instructions that can be selected according to the application under consideration, which leads to 50% code size reduction maximally. The processor has two independent data memories to double the data throughput and the address space. The processor is synthesized by 0.6$\mu$m single-poly double-metal technology. Critical path simulation shows that the maximum frequency is 110MHz and total gate count is 132, 000.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.809-813
• /
• 2000

In this study, screw machining system by use of a rotational tool such as an end-mill or a face cutter with Y axis off-set on a CNC turing center was developed for quick machining. In this system, It was possible to use different tools for different processes, and by off-setting the tool in Y direction by calculated amount it was possible to avoid tool interference problem which could occur within the central area at the end of a tool. In addition, machining a screw with a helix of up to 3 different leads combined and with tapered minor diameter was possible.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• Journal of the Korean Society for Railway
• /
• v.7 no.4
• /
• pp.326-331
• /
• 2004

A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.225-232
• /
• 2011

Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.420-428
• /
• 2003

XML is a data-oriented language to represent all types of documents including web documents. By means of the advent of XML-based document generation tools and grow of proprietary XML documents using those tools and translation from legacy data to XML documents at an accelerating pace, we have been gotten a large amount of differently-structured XML documents. Therefore, it is more and more important to retrieve the right documents from the document set. But, previous works on XML have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. And, researches that supported the structural difference did not efficiently process path queries on the document set. To resolve the problem, we suggested a new inverted index mechanism using RDBMS and proved it outperformed the previous works. And especially, as it showed the higher efficiency in indirect containment relationship, we argues that the index structure is fit for the differently-structured XML document set.

• Structural Engineering and Mechanics
• /
• v.63 no.3
• /
• pp.329-345
• /
• 2017

This paper devoted to study dynamic interaction between crack and inclusion or void by developing the eXtended Finite Element Methods (XFEM). A novel XFEM approximation is presented for these structures containing multi discontinuities (void, inclusion, and crack). The level set methods are used so that elements that include a crack segment, the boundary of a void, or the boundary of an inclusion are not required to conform to discontinuous edges. The investigation covers the effects of a single circular or elliptical void / stiff inclusion, and multi stiff inclusions on the crack propagation path under dynamic loads. Both the void and the inclusion have a significant effect on the dynamic crack propagation path. The crack initially curves towards into the void, then, the crack moves round the void and propagates away the void. If a large void lies in front of crack tip, the crack may propagate into the void. If an enough small void lies in front of crack tip, the void may have a slight or no influence on the crack propagation path. For a stiff inclusion, the crack initially propagates away the inclusion, then, after the crack moves round the inclusion, it starts to propagate along its original path. As ${\delta}$ (the ratio of the elastic modulus of the inclusion to that of the matrix) increases, a larger curvature of the crack path deflection can be observed. However, as ${\delta}$ increases from 2 to 10, the curvature has an evident increase. By comparison, the curvature has a slight increase, as ${\delta}$ increases from 10 to 1000.