• Title/Summary/Keyword: Notion

Search Result 2,258, Processing Time 0.03 seconds

AUTO-CORRELATIONS AND BOUNDS ON THE NONLINEARITY OF VECTOR BOOLEAN FUNCTIONS

  • Kim, Wansoon;Park, Junseok
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.17 no.1
    • /
    • pp.47-56
    • /
    • 2004
  • The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

  • PDF

ATTRACTORS OF LOCAL SEMIFLOWS ON TOPOLOGICAL SPACES

  • Li, Desheng;Wang, Jintao;Xiong, Youbing
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.773-791
    • /
    • 2017
  • In this paper we introduce a notion of an attractor for local semiflows on topological spaces, which in some cases seems to be more suitable than the existing ones in the literature. Based on this notion we develop a basic attractor theory on topological spaces under appropriate separation axioms. First, we discuss fundamental properties of attractors such as maximality and stability and establish some existence results. Then, we give a converse Lyapunov theorem. Finally, the Morse decomposition of attractors is also addressed.

Features of an Error Correction Memory to Enhance Technical Texts Authoring in LELIE

  • SAINT-DIZIER, Patrick
    • International Journal of Knowledge Content Development & Technology
    • /
    • v.5 no.2
    • /
    • pp.75-101
    • /
    • 2015
  • In this paper, we investigate the notion of error correction memory applied to technical texts. The main purpose is to introduce flexibility and context sensitivity in the detection and the correction of errors related to Constrained Natural Language (CNL) principles. This is realized by enhancing error detection paired with relatively generic correction patterns and contextual correction recommendations. Patterns are induced from previous corrections made by technical writers for a given type of text. The impact of such an error correction memory is also investigated from the point of view of the technical writer's cognitive activity. The notion of error correction memory is developed within the framework of the LELIE project an experiment is carried out on the case of fuzzy lexical items and negation, which are both major problems in technical writing. Language processing and knowledge representation aspects are developed together with evaluation directions.

SMOOTHLY PERFECT 8-CONNECTED CONTOUR AND ITS CODING TECHNIQUE (평활한 완전 8방향 윤곽선과 이의 부호화 기법)

  • 조성호;김인철;이상욱
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06a
    • /
    • pp.195-198
    • /
    • 1996
  • In this paper, we introduce the notion of the smoothly perfect 8-connected (SP8C) contour and propose a coding technique for the SP8C contours. Based on the contour simplification using the majority filter proposed by Gu[6], SP8C contours are extracted on the contour lattice from the segmented image. By noting that, unlike the perfect 8-connected contours, the SP8C contours are restricted to travel in only 3 different directions along the contours, we also propose two techniques for encoding the SP8C contours. The one is the modified version of the neighbouring direction segment coding by Kandeko[2], while the other is to employ the notion of the entropy coding. From the comparison in terms of the entropy, it is shown that the proposed SP8C contours require les bits in encoding the diagonal contours than the 4-connected contours employed by Gu. And computer simulations reveal that the contours can be efficiently encoded by the proposed technique.

  • PDF

On a notion of sensor modeling in multisensor data fusion

  • Kim, W.J.;Ko, J.H.;Chung, M.J.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10b
    • /
    • pp.1597-1600
    • /
    • 1991
  • In this paper, we describe a notion of sensor modeling method in multisensor data fusion using fuzzy set theory. Each sensor module is characterized by its fuzzy constraints to specific features of environment. These sensor fuzzy constraints can be imposed on multisensory data to verify their degree of truth and compatibility toward the final decision making. In comparison with other sensor modeling methods, such as probabilistic models or rule-based models, the proposed method is very simple and can be easily implemented in intelligent robot systems.

  • PDF

On the Organization of Object-Oriented Model Bases for Structured Modeling (구조적 모델링을 위한 객체지향적 모델베이스 조직화)

  • 정대율
    • The Journal of Information Systems
    • /
    • v.5
    • /
    • pp.149-173
    • /
    • 1996
  • This paper focus on the development of object-oriented model bases for Structured Modeling. For the model base organization, object modeling techniques and model typing concept which is similar to data typing concept are used. Structured modeling formalizes the notion of a definitional system as a way of dscribing models. From the object-oriented concept, a structured model can be represented as follows. Each group of similar elements(genus) is represented by a composite class. Other type of genera can be represented in a similar manner. This hierarchical class composition gives rise to an acyclic class-composition graph which corresponds with the genus graph of structured model. Nodes in this graph are instantiated to represent the elemental graph for a specific model. Taking this class composition process one step further, we aggregate the classes into higher-level composite classes which would correspond to the structured modeling notion of a module. Finally, the model itself is then represented by a composite class having attributes each of whose domain is a composite class representing one of the modules. The resulting class-composition graph represent the modular tree of the structured.

  • PDF

A Situation Semantic Account of English Embedded Tense (상황의미론에 기초한 영어 내포 시제 연구: 태도문을 중심으로)

  • 조영순
    • Language and Information
    • /
    • v.4 no.2
    • /
    • pp.27-40
    • /
    • 2000
  • The purpose of this paper is to propose a way of analyzing English embedded tense in terms of temporal per- spective time. To this end, the notion of temporal perspective time and Cooper and Ginzburg's(1996) attitude account are employed. Temporal perspective time is used to define the tense and to capture the anaphoric property of embedded tense,: the embedded temporal perspective time draws the embedding event time by anaphora. The ambiguity in the sequence of tense construction is described in terms of the attitude tense constraint reflecting the anaphoric property and two definitions of the past tense. The double access property in the present-under-past construction is described in terms of the constraint, the notion of eventuality, and the situation theoretic existential quantifier.

  • PDF

Implicit Adjuncts : The Cases of Degree Modifiers in Japanese and English

  • Ikeya, Akira;Ikawa, Hisako
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2002.02a
    • /
    • pp.92-102
    • /
    • 2002
  • The issue of adjuncts has long been a neglected field of linguistic study whether it be syntactic or semantic. It is only in Pustejovsky (1995) that we find a brief mention of adjuncts. In addition to what the author calls true arguments, default arguments, and shadow arguments, he sets up a class of true adjuncts citing the following sentence, Mary drove down to new York on Tuesday. We will take up a small lexical item sugiru in Japanese, and we will argue that we should posit the notion of implicit adjuncts in describing the properties with the small Japanese lexical item sugiru. Throughout the discussions that follow we will demonstrate how the notion is independently motivated irrespective of what linguistic theory we are going to adopt.

  • PDF

On Curvature-Adapted and Proper Complex Equifocal Sub-manifolds

  • Koike, Naoyuki
    • Kyungpook Mathematical Journal
    • /
    • v.50 no.4
    • /
    • pp.509-536
    • /
    • 2010
  • In this paper, we investigate curvature-adapted and proper complex equifocal submanifolds in a symmetric space of non-compact type. The class of these submanifolds contains principal orbits of Hermann type actions as homogeneous examples and is included by that of curvature-adapted and isoparametric submanifolds with flat section. First we introduce the notion of a focal point of non-Euclidean type on the ideal boundary for a submanifold in a Hadamard manifold and give the equivalent condition for a curvature-adapted and complex equifocal submanifold to be proper complex equifocal in terms of this notion. Next we show that the complex Coxeter group associated with a curvature-adapted and proper complex equifocal submanifold is the same type group as one associated with a principal orbit of a Hermann type action and evaluate from above the number of distinct principal curvatures of the submanifold.

위험보정 할인율을 이용한 실물옵션가치 결정

  • Kim, Gyu-Tae;Hwang, Hak-Jin;Jeong, Su-Hui
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.742-745
    • /
    • 2004
  • Most of options pricing theory including Black and Scholes continuous model and Cox, Ross, and Rubinstein(CRR)'s binomial lattice model were developed based on the notion that continually revised risk-free hedges involving options and stock should earn the risk-free interest rate. This notion is valid with the assumption that the investor's attitude toward risk is neutral. In reality, this assumption may be frequently violated. Therefore, Hodder, Mello, and Sick proposed the way to value real options using the risk-adjusted interest rate. However, they did not show how to derive the mathematical expression for it. In this paper, we will clearly present how to obtain the mathematical expression for the risk-adjusted interest rate for real options and demonstrate two numerical examples to show its applicability.

  • PDF