• Journal of the Korean Association of Geographic Information Studies
• /
• v.18 no.3
• /
• pp.21-34
• /
• 2015

In this study, a reference model is constructed that provides architects or designers with sufficient information on the intelligent service facility that is essential for U-City space configuration, and for the support of enhanced design, as well as for planning activities. At the core of the reference model is comprehensive information about the intelligent service facility that plans the content of services, and the latest related information that is regularly updated. A plan is presented to take advantage of the database of list information systems in the Public Procurement Service that handles intelligent service facilities. We suggest a number of improvements by analyzing the current status of, and issues with, the goods information in the Public Procurement Service, and by conducting a simulation for the proper placement of CCTV. As the design of U-City plan has evolved from IT technology-based to smart space-based, reviews of limitations such as the lack of standards, information about the installation, and the placement of the intelligent service facility that provides U-service have been carried out. Due to the absence of relevant legislation and guidelines, however, planning activities, such as the appropriate placement of the intelligent service facility are difficult when considering efficient service provision. In addition, with the lack of information about IT technology and intelligent service facilities that can be provided to U-City planners and designers, there are a number of difficulties when establishing an optimal plan with respect to service level and budget. To solve these problems, this study presents a plan in conjunction with the goods information from the Public Procurement Service. The Public Procurement Service has already built an industry-related database of around 260,000 cases, which has been continually updated. It can be a very useful source of information about the intelligent service facility, the ever-changing U-City industry's core, and the relevant technologies. However, since providing this information is insufficient in the application process and, due to the constraints in the information disclosure process, there have been some issues in its application. Therefore, this study, by presenting an improvement plan for the linkage and application of the goods information in the Public Procurement Service, has significance for the provision of the basic framework for future U-City enhancement plans, and multi-departments' common utilization of the goods information in the Public Procurement Service.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.503-517
• /
• 2010

Service-oriented computing, the effective paradigm for developing service applications by using reusable services, becomes popular. In service-oriented computing, service consumer has no responsibility for managing services, just invokes services what service providers are producing. On the other hand, service providers should manage any resources and data for service consumers can use the service anytime and anywhere. However, it is hard service providers manage the quality of the services because an unspecified number of service consumers. Therefore, service scalability for providing services with higher quality of services specified in a service level agreement becomes a potential problem in service-oriented computing. There have been many researches for scalability in network, database, and distributed computing area. But a research about a definition of service scalability and metrics of measuring service scalability is still not mature in service engineering area. In this paper, we construct a service network which connects multiple service nodes, and integrate all the resources to manage it. And we also present a service scalability framework for managing service scalability by using a mechanism of service migration or replication. In section 3, we, firstly, present the structure of the scalability management framework and basic functionalities. In section 4, we propose scalability enhancement mechanism which is needed to release functionality of the framework. In section 5, we design and implement the framework by using proposed mechanism. In section 6, we demonstrate the result of our case study which dynamically manages services in multi-nodes environment by applying our framework. Through the case study, we show the applicability of our scalability management framework and mechanism.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.4 no.3
• /
• pp.31-40
• /
• 2001

Geography Information System is divided to many details fields such as Urban Information System, Land Information System, Military Information System etc. These detailed fields are connected each other and make National Geography Information System. Now Geography Information System is being used in many fields with Urban Information System. And information of all field is being constructed to network for share each other. Now Land Information System(LIS) is being constructed to two dimensional. But LIS can construct and utilize three dimensional geographic data by connecting Geography Information System and this effect will be greatest. Thus, the study of connecting cadastral map and digital terrain map must be continued. Through the study of connecting digital terrain map, the construction and analysis of three dimensional digital elevation model will be able to construct Land Information System effectively. To this study, the authors constructed integrated geographic data by uniting digital terrain map and cadastral map and constructed three dimensional digital elevation model. By connecting cadastral information database, the authors developed three dimensional Integrated Land Information System.

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.57-65
• /
• 2010

In this paper, we present a universal steganalysis scheme. The proposed method extract features of two types. First feature set is extracted from histogram characteristic of the wavelet subbands. Second feature set is determined by statistical moments of wavelet characteristic functions. 3-level wavelet decomposition is performed for stego image and cover image using the Haar wavelet basis. We extract one features from 9 high frequency subbands of 12 subbands. The number of second features is 39. We use total 48 features for steganalysis. Multi layer perceptron(MLP) is applied as classifier to distinguish between cover images and stego images. To evaluate the proposed steganalysis method, we use the CorelDraw image database. We test the performance of our proposed steganalysis method over LSB method, spread spectrum data hiding method, blind spread spectrum data hiding method and F5 data hiding method. The proposed method outperforms the previous methods in sensitivity, specificity, error rate and area under ROC curve, etc.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.2
• /
• pp.157-165
• /
• 2005

The purpose of this study is to examine the relationship between land use patterns of riparian zones and water quality in the Geumho River watershed. A GIS database included digital land use maps (1:25,000), stream network extracted from digital topographic maps (1:5,000) and riparian zones maps by multi-buffering method. Pearson's correlation analysis was used to explain the relationship between the environmental conditions of a 30 meter buffer strip on each side and water quality. According to the result of investigation of riparian-level land use patterns, sub-watersheds on the lower Geumho River including Daegu metropolitan city were mainly developed as urban area such as residential, commercial and industrial ones, while sub-watersheds on the middle Geumho River and the main course of Nakdong River, agricultural ones such as a paddy, a dry field and an orchard. Meanwhile, the area-rate of riparian forests which play an important role in filtering nitrogen, phosphorus and sediment was estimated below the average 16%. The proportion of urban area in a 30 meter riparian bufferstrip had a negative correlation with water quality in each sub-watershed. But the proportion of forest area had a positive correlation with water quality. Henceforth, it is necessary to establish landscape planning for preparing and restoring the riparian buffer zones, concerning land form, soil type, the present land use pattern and economic aspects.

• Journal of the Korea Concrete Institute
• /
• v.27 no.4
• /
• pp.331-341
• /
• 2015

The main purpose of this study is reducing the cost and effort for characterization of tensile strength of fiber reinforced concrete, in order to use in structural design. For this purpose, in this study, test for fiber reinforced concrete was carried out. Because fiber reinforced concrete is consisted of diverse material, it is hard to define the correlation between mix proportions and strength. Therefore, compressive strength test and tensile strength test were carried out for the range of smaller than 100 MPa of compressive strength and 0.25~1% of steel fiber volume fraction. as a results of test, two types of tensile strength were highly affected by compressive strength of concrete. However, increase rate of tensile strength was decreased with increase of compressive strength. Increase rate of tensile strength was decreased with increase of fiber volume fraction. Database was constructed using previous research data. Because estimation equations for tensile strength of fiber reinforced concrete should be multiple variable function, linear regression is hard to apply. Therefore, in this study, we decided to use the ANN(Artificial Neural Network). ANN was constructed using multiple layer perceptron architecture. Sigmoid function was used as transfer function and back propagation training method was used. As a results of prediction using artificial neural network, predicted values of test data and previous research which was randomly selected were well agreed with each other. And the main effective parameters are water-cement ratio and fiber volume fraction.

• Korean Journal of Construction Engineering and Management
• /
• v.10 no.4
• /
• pp.87-100
• /
• 2009

The quality of early cost estimates is critical to the feasibility analysis and budget allocation decisions for public capital projects. Various researches have been attempted to develop cost prediction models in the early stage of a construction project. However, existing studies are limited on its applicability to actual projects because they focus primarily on a specific phase as well as utilize restricted information while the amount of information collectable differs from one another along with the project stages. This research aims to develop two-staged cost estimation model for the schematic planning and preliminary design process of a construction projects, considering the available information of each phase. In the schematic planning stage where outlined information of a project is only available, the Case-Based Reasoning model is used for easy and rapid elicitation of a project cost based on the extensive database of more than 90 actual highway construction projects. Then, the representing quantity-based model is proposed for the preliminary design stage where more information on the quantities and unit costs are collectable based on the alternative routes and cross-sections of a highway project. Real case studies are used to demonstrate and validate the benefits of the proposed approach. Through the two-stage cost estimation system, users are able to hold a timely prospect to presume the final cost within the budge such that feasibility study as well as budget allocation decisions are made on effectively and competitively.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.127-136
• /
• 2009

This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.755-768
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new hash join methods with load balancing capabilities. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets adaptively via a frequency distribution. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join processing without staying on disks. Unless the pipelining execution of multiple hash joins includes some load balancing mechanisms, the skew effect can severely deteriorate system performance. In this paper, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.