• Title/Summary/Keyword: abstract

Search Result 7,142, Processing Time 0.041 seconds

Implementation and Evaluation of Path-Finding Algorithm using Abstract Graphs (추상 그래프를 활용한 경로 탐색 알고리즘의 구현 및 성능 평가)

  • Kim, Ji-Soo;Lee, Ji-wan;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.245-248
    • /
    • 2009
  • Recently, Many studies have been progressing to path-finding with dynamic information on the Terminal Based Navigation System(TBNS). However, the most of existing algorithms are based on $A{\ast}$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, two abstract graph(AG) that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. The abstract graph is a simple graph of real road network. The method of using the abstract graph is proposed for reducing dependency of heuristic and exploring cost. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost but $AG^C$ has worse performance than $AG^H$ exploring cost.

  • PDF

Improving Execution Models of Logic Programs by Two-phase Abstract Interpretation

  • Chang, Byeong-Mo;Choe, Kwang-Moo;Giacobazzi, Roberto
    • ETRI Journal
    • /
    • v.16 no.4
    • /
    • pp.27-47
    • /
    • 1995
  • This paper improves top-down execution models of logic programs based on a two-phase abstract interpretation which consists of a bottom-up analysis followed by a top-down one. The two-phase analysis provides an approximation of all (possibly non-ground) success patterns of clauses relevant to a query. It is specialized by considering Sato and Tamaki’s depth k abstraction as abstract function. By the ability of the analysis to approximate possibly non-ground success patterns of clauses relevant to a query, it can be statically determined whether some subgoals will fail during execution and some succeeding subgoals do not participate in success patterns of program clauses relevant to a given query. These properties are utilized to improve execution models. This approach can be easily applied to any top-down (parallel) execution models. As instances, it is shown to be applicable to linear execution model and AND/OR Process Model.

  • PDF

A Study on Affordance by Abstract Form in Product Design (제품디자인에 있어서 추상적 형태에 의한 어포던스에 관한 연구)

  • Kim, Young Ho
    • Journal of the Korea Furniture Society
    • /
    • v.28 no.4
    • /
    • pp.362-370
    • /
    • 2017
  • To improve usability and recognition of product, the term, Affordance, started to be known in the design world by US recognitive psychologist, Donald A. Norman, has the meaning of providing, Act inducement, Act motivation, Expectancy or what environment provides, etc., thus as one of Mental Model, providing ever more importance not only to the everyday life goods but to the time like these days when products for information overflow. Particularly, this study is oriented toward providing basic study framework on Affordance-like approach in pursuing psychological approach in design for changing the limitless phenomena involved in environment and human body and further for inquiring into source of idea from abstract form hint latent in act and further from the act conducted everyday while peoples are unconscious.

A Technique to Apply Inlining for Code Obfuscation based on Genetic Algorithm (유전 알고리즘에 기반한 코드 난독화를 위한 인라인 적용 기법)

  • Kim, Jung-Il;Lee, Eun-Joo
    • Journal of Information Technology Services
    • /
    • v.10 no.3
    • /
    • pp.167-177
    • /
    • 2011
  • Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

Design of a Remote Control Application Using Mobile Phone with WPAN Platform

  • Lee, Tae-Yang;Kim, In-Hwan;Lee, Yang-Sun;Song, Young-Ho;Jeong, Gu-Mn
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.884-889
    • /
    • 2010
  • In this paper, we design a mobile phone based remote control system for PC using SKT WPAN platform and compare the presented platform with that of Windows Mobile. The usability of WPAN is one of the main issues which should be considered for the ubiquitous services. For easy development and easy use of the WPAN applications, SKT WPAN platform provides abstract WPAN APIs and WPAN Application Manager for ubiquitous services. In this paper, we implement a remote control application using the WPAN platform and show the validity of the platform comparing with other platforms. In the implemented application, we use WPAN abstract APIs on the mobile phone side and a general Bluetooth APIs on the PC for a connection between phone and PC. Through the implementation and comparison, we show that the WPAN application can be easily developed with WPAN platform.

ON THE CAUCHY PROBLEM FOR SOME ABSTRACT NONLINEAR DIFFERENTIAL EQUATIONS

  • Hamza A.S. Abujabal;Mahmoud M. El-Boral
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.2
    • /
    • pp.279-290
    • /
    • 1996
  • In the present paper we study the Cauchy problem in a Banach space E for an abstract nonlinear differential equation of form $$\frac{d^2u}{dt^2}=-A{\frac{du}{dt}}+B(t)u+f(t, W)$$ where W=($A_1$(t)u, A_2(t)u)..., A_{\nu}(t)u), A_{i}(t),\;i=1,2,...{\nu}$,(B(t), t{\in}I$=[0, b]) are families of closed operators defined on dense sets in E into E, f is a given abstract nonlinear function on $I{\times}E^{\nu}$ into E and -A is a closed linar operator defined on dense set in e into E which generates a semi-group. Further the existence and uniqueness of the solution of the considered Cauchy problem is studied for a wide class of the families ($A_{i}$(t), i =1.2...${\nu}$), (B(t), $t{\in}I$) An application and some properties are also given for the theory of partial diferential equations.

CHANGE OF SCALE FORMULAS FOR CONDITIONAL WIENER INTEGRALS AS INTEGRAL TRANSFORMS OVER WIENER PATHS IN ABSTRACT WIENER SPACE

  • Cho, Dong-Hyun
    • Communications of the Korean Mathematical Society
    • /
    • v.22 no.1
    • /
    • pp.91-109
    • /
    • 2007
  • In this paper, we derive a change of scale formula for conditional Wiener integrals, as integral transforms, of possibly unbounded functions over Wiener paths in abstract Wiener space. In fact, we derive the change of scale formula for the product of the functions in a Banach algebra which is equivalent to both the Fresnel class and the space of measures of bounded variation over a real separable Hilbert space, and the $L_p-type$cylinder functions over Wiener paths in abstract Wiener space. As an application of the result, we obtain a change of scale formula for the conditional analytic Fourier-Feynman transform of the product of the functions.

A Comparative Analysis on the Methods of Quantifying Damages - Focused on the CISG - (손해배상액(損害賠償額) 산정방식(算定方式)에 관한 비교연구(比較硏究) - CISG를 중심으로 -)

  • Bae, Jun-Il
    • THE INTERNATIONAL COMMERCE & LAW REVIEW
    • /
    • v.16
    • /
    • pp.59-81
    • /
    • 2001
  • There are two methods of quantifying the damages when the contract is avoided. One is 'concret' assessment, the other is 'abstract' assessment. The former looks to the actual cost incurred by the aggrieved party in concluding a contract for the substitute transaction, while the latter is based on the market price. The concrete method of assessment forms the starting point in the Civil Law systems. In the Common Law systems, it is likewise available. The aggrieved party is entitled to recover the difference between the cost of cover or (as the case may be) the proceeds of resale and the contract price. Both systems also recognize the abstract method of assessment. If the aggrieved party does not resell or cover, damages are equal to the difference between the price fixed by the contract and the market price. The CISG and the UNIDROIT Principles recognize expressly both concrete and abstract methods. Under the relevant articles, the aggrieved party can recover the damages assessed by one of the methods as well as any further damages such as loss of profit, incidental and consequential damages.

  • PDF

ABSTRACT RELATIVE FOURIER TRANSFORMS OVER CANONICAL HOMOGENEOUS SPACES OF SEMI-DIRECT PRODUCT GROUPS WITH ABELIAN NORMAL FACTOR

  • Farashahi, Arash Ghaani
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.117-139
    • /
    • 2017
  • This paper presents a systematic study for theoretical aspects of a unified approach to the abstract relative Fourier transforms over canonical homogeneous spaces of semi-direct product groups with Abelian normal factor. Let H be a locally compact group, K be a locally compact Abelian (LCA) group, and ${\theta}:H{\rightarrow}Aut(K)$ be a continuous homomorphism. Let $G_{\theta}=H{\ltimes}_{\theta}K$ be the semi-direct product of H and K with respect to ${\theta}$ and $G_{\theta}/H$ be the canonical homogeneous space (left coset space) of $G_{\theta}$. We introduce the notions of relative dual homogeneous space and also abstract relative Fourier transform over $G_{\theta}/H$. Then we study theoretical properties of this approach.

Classification of Abstract Images using Digital Chromosome (디지털 유전자를 사용하는 추상 이미지의 분류)

  • Seo, Dongsu;Lee, Hyeli
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.870-874
    • /
    • 2009
  • Genetic algorithms can be effectively used when generating abstract images in an automatic way. However, managing huge number of automatically generated images has been problematic without sufficient managing mechanisms. This paper presents effective classification scheme for the abstract Affine images using form, emotion and color facets, and implements image databases.

  • PDF