• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.129-134
• /
• 2004

XML is the new universal format for structured documents and data on the World Wide Web. As the Web becomes a major means of disseminating and sharing information and as the amount of XML data increases substantially, there are increased needs to manage and design such XML document in a novel yet efficient way. Moreover a demand of XML Schema(W3C XML Schema Spec.) that verifies XML document becomes increasing recently. However, XML Schema has a weak point for design because of its complication despite of various data and abundant expressiveness. Thus, it is difficult to design a complex document reflecting the usability, global and local facility and ability of expansion. This paper shows a simple way of modeling for XML document using a fundamental means for database design, the Entity-Relationship model. The design from the Entity-Relationship model to XML Schema can not be directly on account of discordance between the two models. So we present some algorithms to generate XML Schema from the Entity-Relationship model. The algorithms produce XML Schema codes using a hierarchical view representation. An important objective of this modeling is to preserve XML Schema's object-oriented concepts such as reusability, global and local ability. In addition to, implementation procedure and evaluation of the proposed design method are described.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.218-218
• /
• 2015

Urbanization and waterworks construction in natural watershed have been causing higher flood risks in lowland areas. Detention basins have become one of the most efficient fundamental instruments for storm water and environmental management at watershed scale. Nowadays, there are many studies coupled numerical methods of flood routing with optimization algorithms to investigate factors that impact on the efficiency of detention basins in flood reduction in a watershed, such as detention basin location, size, and cost and watershed characteristics. Although these couplings have been become more widespread but cumbersome computation and hydraulic data requirement still are their limitations. To tackle the procedure efforts due to numerical integration and data collection, simple approach is proposed to primarily estimate effects of detention basins. The approach basis is the linear system theory applied to the solution of hydrologic flood routing. The paper introduces an analytical method for estimating detention effects deriving by recent studies and innovatively analyses this equation on fractal perspective. Then, an optimization technique is performed by applying harmony search algorithms (HSA) to optimize efficiency of detention basins at watershed scale. The location and size of upstream detention basin are simultaneously obtained. Finally, the proposed methodology, practically applied for a real watershed in Kan river, Iran.

• International Journal of Computer Science & Network Security
• /
• v.22 no.8
• /
• pp.175-186
• /
• 2022

This research article develops an Arabic books' recommendation system, which is based on the content similarity that assists users to search for the right book and predict the appropriate and suitable books pertaining to their literary style. In fact, the system directs its users toward books, which can meet their needs from a large dataset of Information. Further, this system makes its predictions based on a set of data that is gathered from different books and converts it to vectors by using the TF-IDF system. After that, the recommendation algorithms such as the cosine similarity, the sequence matcher similarity, and the semantic similarity aggregate data to produce an efficient and effective recommendation. This approach is advantageous in recommending previously unrated books to users with unique interests. It is found to be proven from the obtained results that the results of the cosine similarity of the full content of books, the results of the sequence matcher similarity of Arabic titles of the books, and the results of the semantic similarity of English titles of the books are the best obtained results, and extremely close to the average of the result related to the human assigned/annotated similarity. Flask web application is developed with a simple interface to show the recommended Arabic books by using cosine similarity, sequence matcher similarity, and semantic similarity algorithms with all experiments that are conducted.

• Journal of Korean Society of Steel Construction
• /
• v.13 no.5
• /
• pp.577-586
• /
• 2001

The objective of this study is the development of sizing and system shape discrete optime design algorithm which is based on the genetic algorithms (GAs). The algorithm can perform both size and shape optimum designs of space trusses. The developed algorithm was implemented in a computer program. The algorithm is known to be very efficient for the discrete optimization The genetic process selects the next design points based on the survivability of the current design points The evolutionary process evaluates the survivability of the design points selected from the genetic process in the genetic process of the simple genetic algorithms there are three basic operators : reproduction cross-over and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying the algorithm to optimum design examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1029-1043
• /
• 2013

We introduce Approximate Message Passing (AMP) algorithm which is one of the efficient recovery algorithms in Compressive Sensing (CS) area. Recently, AMP algorithm has gained a lot of attention due to its good performance and yet simple structure. This paper provides not only a understanding of the AMP algorithm but its relationship with a classical (Sum-Product) Message Passing (MP) algorithm. Numerical experiments show that the AMP algorithm outperforms the classical MP algorithms in terms of time and phase transition.

• Journal of Korean Association for Spatial Structures
• /
• v.1 no.1 s.1
• /
• pp.125-134
• /
• 2001

The objective of this study is the development of size discrete optimum design algorithm which is based on the GAs(genetic algorithms). The algorithm can perform size discrete optimum designs of space trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of space trusses and the constraints are limite state design codes(1998) and displacements. The basic search method for the optimum design is the GAs. The algorithm is known to be very efficient for the discrete optimization. This study solves the problem by introducing the GAs. The GAs consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. In the genetic process of the simple GAs, there are three basic operators: reproduction, cross-over, and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying GAs to optimum design examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3120-3137
• /
• 2021

Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.631-644
• /
• 2002

In this paper efficient algorithms for content-based video retrieval using motion information are proposed, including temporal scale-invariant retrieval and temporal scale-absolute retrieval. In temporal scale-invariant video retrieval, the distance transformation is performed on each trail image in database. Then, from a given que교 trail the pixel values along the query trail are added in each distance image to compute the average distance between the trails of query image and database image, since the intensity of each pixel in distance image represents the distance from that pixel to the nearest edge pixel. For temporal scale-absolute retrieval, a new coding scheme referred to as Motion Retrieval Code is proposed. This code is designed to represent object motions in the human visual sense so that the retrieval performance can be improved. The proposed coding scheme can also achieve a fast matching, since the similarity between two motion vectors can be computed by simple bit operations. The efficiencies of the proposed methods are shown by experimental results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1258-1263
• /
• 1999

본 논문에서는 CRCW(Concurrent Read Concurrent Write)와 CREW(Concurrent Read Exclusive Write) PRAM(Parallel Random Access Machine) 모델에서 무방향성 그래프 G=(V, E)의 극대 매칭을 구하기 위해 간결한 랜덤 병렬 알고리즘을 제안한다. CRCW PRAM 모델에서 m개의 선을 가진 그래프에 대해, 제안된 매칭 알고리즘은 m개의 프로세서 상에서 {{{{ OMICRON (log m)의 기대 수행 시간을 가진다. 또한 CRCW 알고리즘을 CREW PRAM 모델에서 구현한 CREW 알고리즘은 OMICRON (log^2 m)의 기대 수행 시간을 가지지만,OMICRON (m/logm) 개의 프로세서만을 가지고 수행될 수 있다.Abstract This paper presents simple randomized parallel algorithms for finding a maximal matching in an undirected graph G=(V, E) for the CRCW and CREW PRAM models. The algorithm for the CRCW model has {{{{ OMICRON (log m) expected running time using m processors, where m is the number of edges in G We also show that the CRCW algorithm can be implemented on a CREW PRAM. The CREW algorithm runs in {{{{ OMICRON (log^2 m) expected time, but it requires only OMICRON (m / log m) processors.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.