• Journal of Digital Contents Society
• /
• v.18 no.6
• /
• pp.1041-1047
• /
• 2017

There are many methods for surveying the status of a road, and the use of unmanned aerial vehicle (UAV) photo is one such method. When the UAV images are too large to be processed and suspected to be redundant, a texture extraction technique is used to transform the data into a reduced set of feature representations. This is an important task in 3D simulation using UAV images because a huge amount of data can be inputted. This paper presents a texture extraction method from UAV images to obtain high-resolution images of bridges. The proposed method is in three steps: firstly, we use the 3D bridge model from the V-World database; secondly, textures are extracted from oriented UAV images; and finally, the extracted textures from each image are blended. The result of our study can be used to update V-World textures to a high-resolution image.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.53-56
• /
• 2015

In this paper, we want provide improved services with faster transmission, IEEE 802.11n was standardized. A-MPDU (Aggregation MAC Protocol Data UNIT) is a vital function of the IEEE 802.11n standard, which was proposed to improve transmission rate by reducing frame transmission overhead. In this paper, we show the problems of TCP retransmission with A-MPDU and propose a solution utilizing the property of TCP cumulative ACK. If the transmission of an MPDU subframe fails, A-MPDU mechanism allows selective re-transmission of failed MPDU subframe in the MAC layer. In TCP traffic transmission, however, a failed MPDU transmission causes TCP Duplicate ACK, which causes unnecessary TCP re-transmission. Furthermore, congestion control of TCP causes reduction in throughput. By supressing unnecessary duplicate ACKs the proposed mechanism reduces the overhead in transmitting redundant TCP ACKs, and transmitting only a HS-ACK with the highest sequence number. By using the RACK mechanism, through the simulation results, it was conrmed that the RACK mechanism increases up to 20% compared the conventional A-MPDU, at the same time, it tightly assures the fairness among TCP flows.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1566-1574
• /
• 2008

Researches of current information searching focus on providing personalized results as well as matching needed queries in an enormous amount of information. This paper aims at discovering hidden knowledge to provide personalized and inferred search results based on the ontology with categorized concepts and relations among data. The current searching occasionally presents too much redundant information or offers no matching results from large volumes of data. To lessen this disadvantages in the information searching, we propose an inference algorithm that supports associated and inferred searching through the Jess engine based on the OWL ontology constraints and knowledge expressed by SWRL with association rules. After constructing the personalized preference ontology for domains such as restaurants, gas stations, bakeries, and so on, it shows that new knowledge information generated from the ontology and the rules is provided with an example of the domain of gas stations.

• The Journal of Information Systems
• /
• v.13 no.1
• /
• pp.77-95
• /
• 2004

According to the increase of organizational complexity and the change of rapid information technology environment, many firms have shifted their information technology(IT) strategy from developing information systems in-house to purchasing application software such as Enterprise Resource Planning(ERP) Systems. Marketing and Sales functions within a Korean automotive part company include developing new assembly products, determining pricing, taking customer's orders, and shipping assembly products to customers. Marketing and Sales Information System(MSIS) in ERP system plays an important role in next Production Planning process. MSIS also makes management reporting and decision making faster and more uniform throughout an organization. MSIS promotes thinking about corporate goals, as opposed to thinking only about the goals of a single department or functional area. This paper intends to design and implement a MSIS in ERP systems for Korean automotive part company using object-oriented methodology In order to accomplish the implementation of MSIS in ERP system, we employed UML as its standard modeling language. In this study, four diagramming techniques such as use case diagram, sequence diagram, class diagram, component diagram among eight modeling techniques are used for analyzing hierarchical business process. In traditional marketing and sales function, a company with an unintegrated information system can have marketing and sales data that is data redundant or inaccurate. MSIS integrated in ERP system can solve the sales forecast problem, which minimizes the total costs of production, inventory, and transportation under constraints of production capacity. Also, the use of UML methodology makes S/W programmers shorten the phase of analysis and design in the implementation of MSIS system, and increase the reuse of software and the interoperability with corporate internal Information system.

• Convergence Security Journal
• /
• v.20 no.2
• /
• pp.59-68
• /
• 2020

In January 2020, the National Assembly passed the revisions of three bills which ease regulations on the use of personal information. The revised laws include the launch of an independent supervisory body, the arrangement of redundant regulations, and regulations for the development of the data economy. This paper analyzes the content and meaning of each law of the Three Revised Bills that Ease Regulations on the Use of Personal Information. And the future challenges outline three aspects: the establishment of a system to ensure the right to informational self-determination of privacy concerns, the establishment of a certification system and the presentation of reasonable guidelines, and the expectation of professional performance by the Personal Information Protection Commission.

• Journal of Internet Computing and Services
• /
• v.15 no.1
• /
• pp.63-71
• /
• 2014

Currently many non-traditional application areas such as artificial intelligence and web databases require advanced modeling power than the existing relational data model. In those application areas, object-oriented database (OODB) is better data model since an OODB can providemodeling power as grouping similar objects into class, and organizing all classes into a hierarchy where a subclass inherits all definitions from its superclasses. The purpose of this paper is to develop an OODB concurrency control scheme dealing with multiple inheritance. The proposed scheme, called Multiple Inheritance Implicit Locking (MIIL), is based on so-called implicit locking. In the proposed scheme, we eliminate redundant locks that are necessary in the existing implicit locking scheme. Intention locks are required as the existing implicit locking scheme. In this paper, it is shown that MIIL has less locking overhead than implicit locking does. We use only OODB inheritance hierarchies, single inheritance and multiple inheritance so that no additional overhead is necessary for reducing locking overhead.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.691-700
• /
• 2000

The standard volume ray-tracing, optimized with octree, needs to repeatedly traverse hierarchical structures for each ray that often leads to redundant computations. It also employs the expensive 3D interpolation for producing high quality images. In this paper, we present a new ray-casting method that efficiently computes shaded colors and opacities at resampling points by traversing octree only once. This method traverses volume data in object-order, finds resampling points on slices incrementally, and performs resampling based on 2D interpolation. While the early ray-termination, which is one of the most effective optimization techniques, is not easily combined with object-order methods, we solved this problem using a dynamic data structure in image space. Considering that our new method is easy to implement, and need little additional memory, it will be used as very effective volume method that fills the performance gap between ray-casting and shear-warping.

• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.105-120
• /
• 1997

One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.1-7
• /
• 2014

WireWireless sensor networks(WSNs) are generally comprised of densely deployed sensor nodes, which causes highly redundant sensor data transmission and energy waste. Many studies have focused on energy saving in WSNs. However, delay problem also should be taken into consideration for mission-critical applications. In this paper, we propose a BISA (Bio-Inspired Scheduling Algorithm) to reduce the energy consumption and delay for WSNs inspired by biological systems. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission. Through simulations, we observe that the BISA archives energy efficiency and delay guarantees.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.129-142
• /
• 2004

As the Internet gets faster, the demand for high-speed routers that are capable of forwarding more than giga bits of data per second keeps increasing. In the previous research, Bitmap Trie algorithm was developed to rapidly execute LPM(longest prefix matching) process which is Well known as the Severe performance bottleneck. In this paper, we introduce a novel algorithm that drastically enhanced the performance of Bitmap. Trie algorithm by applying three techniques. First, a new table called the Count Table was devised. Owing to this table, we successfully eliminated shift operations that was the main cause of performance degradation in Bitmap Trie algorithm. Second, memory utilization was improved by removing redundant forwarding information from the Transfer Table. Lastly. the range of prefix lookup was diversified to optimize data accesses. On the other hand, the processing delays were classified into three categories according to their causes. They were, then, measured through the execution-driven simulation that provides the higher quality of the results than any other simulation techniques. We tried to assure the reliability of the experimental results by comparing with those that collected from the real system. Finally the Enhanced Bitmap Trie algorithm reduced 82% of time spent in previous algorithm.