• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1310-1323
• /
• 2008

Recently, many studies on automated generation of composite Web services have been done. Most of these works compose Web services by chaining their inputs and outputs, but do not consider the functional semantics. Therefore, they may construct unsatisfied composite services against users' intention. Futhermore, they have high time-complexity since every possible combinations of available services should be considered. To resolve these problems, this paper proposes a sophisticated composition method that explicitly specifies and uses the functional semantics of Web services. Specifically, A graph model is constructed to represent the functional semantics of Web services as well as the dependency among inputs and outputs. On the graph, we search core services which provide the requested function ality and additional services which transform between I/O types of the user request and the core services. Then, composite services are built from combinations of the discovered services. The proposed method improves the semantic correctness of composite services by the functional semantics of Web services, and reduces the time complexity by combinations of functionally related services.

• Korean Journal of Digital Imaging in Medicine
• /
• v.13 no.3
• /
• pp.111-115
• /
• 2011

PET/CT(Positron Emission Tomography/Computed Tomography) is an examination combining morphological and functional information in one examination. The purpose of this study is to see the lowest CT dose for attenuation correction in the PET/CT maintaining good image quality when considering CT scan dose to the patients. We injected $^{18}F$-FDG and water into the cylinder shaped phantom, and obtained emission images for 3 mins and transmission images(140 kVp, 8 sec, 10~200 mA for transmission images), and reconstructed the images to PET/CT images with Iterative method. Data(Maximum, Minimum, Average, Standard Deviation) were obtained by drawing a circular ROI(Region Of Interest) on each sphere in each image set with Image J program. And then described SD according to the CT and PEC/CT images as graphes. Through the graphes, we got the relationships of mA and quality of images. SDs according to CT graph were 16.25 at 10 mA, 7.26 at 50 mA, 5.5 at 100 mA, 4.29 at 150 mA, and 3.83 at 200 mA, i.e. the higer mA, the better image quality was presented. SDs according to PET/CT graph were 1823.2 at 10 mA, 1825.1 at 50 mA, 1828.4 at 100 mA, 1813.8 at 150 mA, and 1811.3 at 200 mA. Calculated SDs at PET/CT images were maintained. This means images quality is maintained having nothing to do with mA of high and low.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.105-113
• /
• 2000

The representation of a procedural program cannot be applied directly to object oriented program representation consisting of class, object, inheritance, and dynamic binding. Furthermore, preexisting program dependence represented the dependence among statements, but not among variables. That is, it could not solve the problem of which variables make an effect on given variables. Consequently, this study presents the method dependence model representing implementation level information including the dependence among variables in an object oriented program. I also propose implementation-based class testing technique based on the test adequacy criterion of an object-oriented program. Considering inter-data member dependences and a set of axioms for test data adequacy, it generates sequences of methods as test cases which satisfy a flow graph-based testing criterion. For a derived class testing, it considers inheritance relationship and the resuability of the testing information for its parent classes which verified the reduction of test cost through the experiment.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.418-429
• /
• 2001

Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.111-117
• /
• 2015

The exam scheduling problem has been classified as nondeterministic polynomial time-complete (NP-complete) problem because of the polynomial time algorithm to obtain the exact solution has been unknown yet. Gu${\acute{e}}$ret et al. tries to obtain the solution using linear programming with $O(m^4)$ time complexity for this problem. On the other hand, this paper suggests chromatic number algorithm with O(m) time complexity. The proposed algorithm converts the original data to incompatibility matrix for modules and graph firstly. Then, this algorithm packs the minimum degree vertex (module) and not adjacent vertex to this vertex into the bin $B_i$ with color $C_i$ in order to exam within minimum time period and meet the incompatibility constraints. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for exam scheduling problem, and gets the same solution with linear programming.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.847-851
• /
• 2011

Photovoltaic System is increasing install capacity based on environmental-friendly characteristics. It have been actively studied to improve the efficiency. In order to design highly efficient system, it is important to understand the output characteristics of solar panels. The single diode model can represent the physical characteristics of solar panel. But it needs complex process such as mutli-step measurement and numerical analysis to get the exact parameters. In this paper, The method for extracting characteristic parameters of the single diode model based on the I-V characteristic curves in the panel manufacturer's data-sheet is presented. To verify the proposed method, solar cell model constructed in simulink. Simulink model output compared with output graph in datasheet.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.6
• /
• pp.33-42
• /
• 2022

In the existing intelligent command control system study, the analysis results of the commander's battlefield situation questions are provided from knowledge-based situation data. Analysis reporters write these results in various expressions of natural language. However, it is important to analyze situations about information and intelligence according to context. Analyzing the battlefield situation using artificial intelligence is necessary. We propose a virtual dataset generation method based on battlefield simulation scenarios in order to provide a dataset necessary for the battlefield situation analysis based on artificial intelligence. Dataset is generated after identifying battlefield knowledge elements in scenarios. When a candidate hypothesis is created, a unit hypothesis is automatically created. By combining unit hypotheses, similar identification hypothesis combinations are generated. An aggregation hypothesis is generated by grouping candidate hypotheses. Dataset generator SW implementation demonstrates that the proposed method can be generated the virtual battlefield situation dataset.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.513-528
• /
• 1997

A sort sequence $S_n$ is a sequence of all unordered pairs of indices in $I_n\;=\;{1,\;2,v...,\;n}$. With a sort sequence Sn we assicuate a sorting algorithm ($AS_n$) to sort input set $X\;=\;{x_1,\;x_2,\;...,\;x_n}$ as follows. An execution of the algorithm performs pairwise comparisons of elements in the input set X as defined by the sort sequence $S_n$, except that the comparisons whose outcomes can be inferred from the outcomes of the previous comparisons are not performed. Let $X(S_n)$ denote the acverage number of comparisons required by the algorithm $AS_n$ assuming all input orderings are equally likely. Let $X^{\ast}(n)\;and\;X^{\circ}(n)$ denote the minimum and maximum value respectively of $X(S_n)$ over all sort sequences $S_n$. Exact determination of $X^{\ast}(n),\;X^{\circ}(n)$ and associated extremal sort sequenes seems difficult. Here, we obtain bounds on $X^{\ast}(n)\;and\;X^{\circ}(n)$.

• Advances in robotics research
• /
• v.1 no.2
• /
• pp.127-140
• /
• 2014

This work presents an IR-based system for parking assistance and obstacle detection in the automotive field that employs the Microsoft Kinect camera for fast 3D point cloud reconstruction. In contrast to previous research that attempts to explicitly identify obstacles, the proposed system aims to detect "reachable regions" of the environment, i.e., those regions where the vehicle can drive to from its current position. A user-friendly 2D traversability grid of cells is generated and used as a visual aid for parking assistance. Given a raw 3D point cloud, first each point is mapped into individual cells, then, the elevation information is used within a graph-based algorithm to label a given cell as traversable or non-traversable. Following this rationale, positive and negative obstacles, as well as unknown regions can be implicitly detected. Additionally, no flat-world assumption is required. Experimental results, obtained from the system in typical parking scenarios, are presented showing its effectiveness for scene interpretation and detection of several types of obstacle.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1482-1485
• /
• 2005

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD, inlining two dimensional DTD graph into flat feature values. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.