• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.265-270
• /
• 2019

The technology to locate an individual has enabled various services, its utilization has increased. There were constraints such as the use of separate expensive equipment or the installation of specific devices on a facility, with most of the location technology studies focusing on the accuracy of location verification. These constraints can result in accuracy within a few tens of centimeters, but they are not technology that can be applied to a user's location in real-time in daily life. Therefore, this paper aims to track the locations of smartphones only using the basic components of smartphones. Based on smartphone sensor data, localization accuracy that can be used for verification of the users' locations is aimed at. Accelerometers, Wifi radio maps, and GPS sensor information are utilized to implement it. In forging the radio map, signal maps were built at each vertex based on the graph data structure This approach reduces traditional map-building efforts at the offline phase. Accelerometer data were made to determine the user's moving status, and the collected sensor data were fused using particle filters. Experiments have shown that the average user's location error is about 3.7 meters, which makes it reasonable for providing location-based services in everyday life.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1434-1441
• /
• 1999

This paper presents an equivalent circuit of the hairpin line filter for accurate analysis and design. Its validity was verified by computer simulations and filter design experiments. Though the various design equations for a hairpin line filter have been proposed, there has not been a practically simplified equivalent circuit because it is hard to effectively represent interconnection effects between non-adjacent elements. In this paper, all the open ports of the hairpin line filter circuit are changed to the short ports using circuit duality, and the resulting circuits are transformed to graph model. The further simplified circuit model is obtained from boundary conditions, and then the final equivalent circuit of the hairpin line filter is derived in a dual structure of the filter.

• The Journal of Society for e-Business Studies
• /
• v.2 no.1
• /
• pp.21-37
• /
• 1997

As the complexity in design and manufacturing activities of distributed virtual enterprises rapidly increases, the issue of process management becomes more critical to shorten the time-to-market, reduce the manufacturing cost and improve the product quality. This paper proposes a unified framework to manage design and manufacturing processes in a distributed environment. We present a methodology which utilizes process flow graphs to depict the hierarchical structure of workflows and process grammars to represent various design processes and design tools. To implement the proposed concept, we develop a process management system which mainly consists of a cockpit and manager programs, and we finally address a preliminary implementation procedure based on the Object Modeling Technique. Since the proposed framework can be a formal approach to the process management by providing formalism, parallelism, reusability, and flexibility, it can be effectively applied to further application domains of distributed virtual enterprises.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.245-252
• /
• 2014

Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. But, the ordinary users don't know well the complex formal query language and schema of the knowledge base. So, the system should interpret the meaning of user's keywords. In this paper, we describe a user query interpretation system for the semantic retrieval of multimedia contents. Our system is ontological knowledge base-driven in the sense that the interpretation process is integrated into a unified structure around a knowledge base, which is built on domain ontologies.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1262-1272
• /
• 1996

Pure functional languages have the referential transparency feature sothat all objects cannot be updated destuctively. Once an aggregated data structure such as array is updated, both the original and newly updated array must be preserved to maintain reverential transparency. Thus, it is required to develop an efficient mechanism with which can reduce the maintenance cost while maintaining referential transparency for whole data. This study is to suggest a functional array to solve the problem, and them test it. For that, the proposed mechanism was implemented on a combinator graph reduction machine. The result shows that proposed mechanism reduces traversal time for array operations. Also, updating all versions and accessing the recent version are achieved in constant time without reconstruction of updated data in execution time.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.329-334
• /
• 2002

For the testability, this paper proposed the algorithm at autonomous synthesis which includes the data path structure as the self testing as possible on high level synthesis method when VHDL, coding is used in the system design area. In the proposed algorithm of this paper, MUXs and registers are assigned to the data path of designed system. And the designed data path could be mapped the H/W specification of described VHDL coding to the testable library. As a results, it was mapped H/W to the assign algorithm that is minimized MUX and the registers in collision graph.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.12
• /
• pp.2952-2962
• /
• 2000

The design of experiment(DOE) is getting more attention in the engineering community since it is easy to understand and apply. Recently, engineering designers are adopting DOE with orthogonal arrays when they want to design products in a discrete design space. In this research, a design flow with orthogonal arrays is defined for structural design according to the general DOE. The design problem is defined as a general structural optimization problem. Sensitivity information is evaluated by the analysis of variance(ANOVA), and an optimum design is determined from analysis of means(ANOM). Interactions between design variables are investigated to achieve additivity which should be valid in DOE. When strong interactions exit, a method is proposed. Some methods to consider the problem are suggested.

• Nuclear Engineering and Technology
• /
• v.44 no.7
• /
• pp.755-766
• /
• 2012

A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since its memory consumption is very high. Recently, in order to solve a large reliability problem within limited computational resources, Jung presented an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. In this paper, it is first identified that Jung's BDD truncation algorithm can be improved for a more practical use. Then, a more efficient truncation algorithm is proposed in this paper, which can generate truncated BDD with smaller size and approximate TEP with smaller truncation error. Empirical results showed this new algorithm uses slightly less running time and slightly more storage usage than Jung's algorithm. It was also found, that designing a truncation algorithm with ideal features for every possible fault tree is very difficult, if not impossible. The so-called ideal features of this paper would be that with the decrease of truncation limits, the size of truncated BDD converges to the size of exact BDD, but should never be larger than exact BDD.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.1
• /
• pp.29-39
• /
• 2003

In this paper we proposed dynamic adaptive model based on discrete probabilistic distribution functions and user's profile for web media systems(web based hypermedia systems). The model represented that the application domain is modelled using a weighted direct graph and the user's behaviour is modelled using a probabilistic approach that dynamically constructs a discrete probability distribution functions. The proposed probabilistic interpretation of the web media structure is used to characterize latent properties of the user's behaviour, which can be captured by tracking user's browsing activity. Using that distribution the system attempts to assign the user to the best profile that fits user's expectations.

• KIISE Transactions on Computing Practices
• /
• v.22 no.12
• /
• pp.654-662
• /
• 2016

With the advent of autonomous cars, we explored the problems which will soon arise while parking in car parks. These include structure of parking lot suitable for autonomous cars, finding the closest parking slot available, and navigation to the location. We provide an initial solution, wherein we use a central server and the graph of the parking lot to guide cars to the closest parking slots available. Our experiments have shown that the proposed method is effective for the controlled parking for self-driving cars.