• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.39-49
• /
• 2004

An increasing number of distributed applications will be achieved with mobile technology. These applications face temporary loss of network connectivity when they move. They need to discover other hosts in an ad-hoc manner, and they are likely to have scarce resources including CPU speed, memory and battery power. Software engineers building mobile applications need to use a suitable middleware that resolves these problems and offers appropriate support for developing mobile applications. In this paper, we describe the meta-server building for middleware that addresses reflective context awareness and present usability with demonstration. Metadata is consist of user configuration, device configuration, user context, device context and dynamic image metadata. When middleware send a saving or retrieval request to meta-server, it returns messages to middleware after the verification of the request. This meta-server has the application for multimedia stream services with context awareness.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.6
• /
• pp.573-580
• /
• 2017

Precise stochastic modeling for GPS measurements is one of key factors in adjustment computations for GPS positioning. To analyze the GPS measurement errors, Minimum Norm Quadratic Unbiased Estimators(MINQUE) approach is used in this study to estimate the variance components for measurement types with short-baseline GPS positioning model. The results showed the magnitudes of measurement errors for C1, P2, L1, L2 are 22.3cm, 27.6cm, 2.5mm, 2.2mm, respectively. To reduce the memory usage and computational burden, variance components are also estimated on epoch-by-epoch basis. The results showed that there exists slight differences between the solutions. However, epoch-by-epoch analysis may also be used for most of GPS applications considering the magnitudes of the differences.

• Journal of Korean Society of Steel Construction
• /
• v.24 no.1
• /
• pp.47-58
• /
• 2012

Dynamic behaviors of a corrugated steel plate tunnel lining system are examined under wind loads due to passing vehicles. Applied wind loads are simulated by applying the time functions as a vehicle moves through the tunnel. Wind loads are described by the pressure and suction as a vehicle arrives and leaves target positions in the tunnel. The tunnel lining is modeled using the simplified shell elements that retain the characteristics of the corrugated shapes. The displacements of the tunnel lining are evaluated under various conditions regarding wind velocity and the passing vehicles. The responses are found to increase as the vehicle velocity and wind velocity increase. A maximum displacement of 25mm occurs when two vehicles are crossing at the speed of 120km/h. A row of vehicles running consecutively minimally affects the dynamic responses with less than 2.5% of the dynamic responses enlarged and attributed to one running vehicle. It should be noted that the dynamic responses of the tunnel lining should be considered when there is no shotcrete applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1231-1243
• /
• 1997

Digital satellite communication channels have nonlinearities with memory due to saturation characteristics of traveling wave tube amplifier in the satellite and transmitter/receiver linear filters. In this paper, we propose a network structure and a learning algorithm for complex pi-sigma network (CPSK) and exploit CPSN in the problem of equalization of nonlinear satellite channels. The proposed CPSN is a complex-valued extension of real-valued pi-sigma network that is a higher-order feedforward network with fast learning while greatly reducing network complexity by utilizing efficient form of polynomials for many input variables. The performance of the proposed CPSN is demonstrated by computer simulations on the equalization of complex-valued QPSK input symbols distorted by a nonlinear channel modeled as a Volterra series and additive noise. The results indicate that the CPSN shows good equalization performance, fast convergence, and less computations as compared to conventional higher-order models such as Volterra filters.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.471-478
• /
• 2013

This paper proposes a black-box based test case generation method for Simulink/Stateflow model utilizing the RRT algorithm which is a method to efficiently solve the path planning for complicated systems. The proposed method in the paper tries to solve the reachability problem with the RRT algorithm, which has to be solved for black-box based test case generations. A major problem of the RRT based test case generation algorithms is that the cost such as running time and required memory size is too much for complicated Stateflow model. The typical RRT algorithm expands rapidly-exploring random tree (RRT) in a single state space. But the proposed method expands it in dynamic state space based on the state of Simulink model, consequently reducing the cost. In the paper, a new definition of RRT state space, a distance measure and a test case generation algorithm are proposed. The performance of proposed method is verified through the experiment against Stateflow model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1329-1338
• /
• 2011

This paper proposes an algorithm and hardware architecture for a broadcast communication which has the worst bottleneck among multiprocessor using distributed memory architectures. In conventional systems, collective communication is converted into point-to-point communications by MPI library cell without considering the state of communication port of each processing node which represents the processing node is in busy state or free state. If conflicting point-to-point communication occurs during broadcast communication, the transmitting speed for broadcast communication is decreased. Thus, this paper proposed an algorithm which determines the order of point-to-point communications for broadcast communication according to the state of each processing node. According to the state of each processing node, the proposed algorithm decreases total broadcast communication time by transmitting message preferentially to the processing node with communication port in free state. The proposed MPI unit for broadcast communication is evaluated by modeling it with systemC. In addition, it achieved a highly improved performance for broadcast communication up to 78% with 16 nodes. This result shows the proposed algorithm is useful to improving total performance of MPSoC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.795-805
• /
• 2012

This paper proposes an algorithm and a hardware architecture for a broadcast communication which has the worst bottleneck among multiprocessor using distributed memory architectures. In conventional system, The pipelined broadcast algorithm is an algorithm which takes advantage of maximum bandwidth of communication bus. But unnecessary synchronization process are repeated, because the pipelined broadcast sends the data divided into many parts. In this paper, the MPI unit for pipeline chain algorithm based on circuit switching removing the redundancy of synchronization process was designed, the proposed architecture was evaluated by modeling it with systemC. Consequently, the performance of the proposed architecture was highly improved for broadcast communication up to 3.3 times that of systems using conventional pipelined broadcast algorithm, it can almost take advantage of the maximum bandwidth of transmission bus. Then, it was implemented with VerilogHDL, synthesized with TSMC 0.18um library and implemented into a chip. The area of synthesis results occupied 4,700 gates(2 input NAND gate) and utilization of total area is 2.4%. The proposed architecture achieves improvement in total performance of MPSoC occupying relatively small area.

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

Recently, embedded environment suffers a huge change, by growth of hardware and turning to be software-controlled. This has improved embedded software complexity. It also brought us the limit of the old development way to resolve the problem. Model-driven development is one solution to solve the limit common software development by previous way, and it became a one uses for embedded environment also. In this paper, we propose model based development approach for embedded software, witch consists of diagram editor and automatic code generator. The diagram editors are implemented by GMF, which include additional functions to solve memory restrictions and concurrent execution problems without OS environment to a automatic code generator. In order to verify the generated code, it will be tested in main control model of UAV by replacing existing module with generated one.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.39-47
• /
• 2000

Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.