• Korean journal of communication and information
• /
• 제26권
• /
• pp.7-44
• /
• 2004

This paper proposed semiotic model to explain representation process of time in cinema. Limitations of cinematic narratology which explain representation process of time in cinema were indicated, then alternative explanations of Deleuzian philosophy of cinema were proposed. After discussion about articulations of cinematic code, Deleuzian concept of movement-image was suggested as semiotic minimal unit of cinema. In cinema, Movement-image is divided two different aspects ; "normal movement-image" and "abnormal movement-image". Therefore, two different semiotic representation process of time was reconstructed in accordance with Peircean semiosis theory. In this two different semiotic process, modern cinema emphasize the direct representation process of time with "abnormal movement-image". As Deleuze indicated, The "time-image" is presented in this semiotic process. The "time-image" makes it possible to consider "time itself" as philosophical fact which is laid between reality and cinema, This semiotic process more emphasizes pure expressionality than representationality. Deleuzian philosophical journey through cinema was started in this point.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1463-1466
• /
• 1987

The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

• Journal of the Korea Society for Simulation
• /
• 제33권1호
• /
• pp.19-26
• /
• 2024

The phase-type, PH, distribution is defined as the time to absorption into a terminal state in a continuous-time Markov chain. As the PH distribution includes family of exponential distributions, it has been widely used in stochastic models. Since the PH distribution is represented and generated by an initial probability vector and a generator matrix which is called the Markovian representation, we need to find a vector and a matrix that are consistent with given set of moments if we want simulate a PH distribution. In this paper, we propose an approach to simulate a PH distribution based on distribution function which can be obtained directly from moments. For the simulation of PH distribution of order 2, closed-form formula and streamlined procedures are given based on the Jordan decomposition and the minimal Laplace transform which is computationally more efficient than the moment matching methods for the Markovian representation. Our approach can be used more effectively than the Markovian representation in generating higher order PH distribution in queueing network simulation.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.689-701
• /
• 2021

The purpose of this paper is to optimize the number of source places required for the unique representation of the destination using the tools of graph theory. A subset S of vertices of a graph G is called a rational resolving set of G if for each pair u, v ∈ V - S, there is a vertex s ∈ S such that d(u/s) ≠ d(v/s), where d(x/s) denotes the mean of the distances from the vertex s to all those y ∈ N[x]. A rational resolving set is called minimal rational resolving set if no proper subset of it is a rational resolving set. In this paper we study varieties of minimal rational resolving sets defined on the basis of its complements and compute the minimum and maximum cardinality of such sets, respectively called as lower and upper rational metric dimensions for power of a path P_n analysing various possibilities.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• 제2권1호
• /
• pp.37-42
• /
• 2009

The digital filter is essential element in digital signal processing area. It needs a high computational burden caused by multiplying and adding. The multiplier in digital filter is a dominant element, which occupies an wide area at the field of VLSI design, needs high power-consuming and also decides critical path that affects to filter performance. In this paper we proposed the simultaneous transform method which is represented 2's complementary representation to CSD and MSD representation to solve a complexity problem and to improve a computational speed. The performance of proposed method was implemented in VHDL and applied to an digital filters, was evaluated the decreasing of critical path delay.

• Language and Information
• /
• 제20권1호
• /
• pp.25-49
• /
• 2016

Honorific forms express the speaker's social attitude to others and also indicate the social ranks and level of intimacy of the participants in the discourse. In a cross-linguistic perspective of grammar engineering, modelling honorification has been regarded as a key strategy for improving language processing applications. Using the HPSG and MRS formalism, this article provides a multilingual grammar model of honorification. The present study incorporates the honorific information into the Meaning Representation System (MRS) via Individual Constraints (ICONS), and then conducts an evaluation to see if the model contributes to semantics-based language processing.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.35-39
• /
• 2004

In a shipyard, there exist various critical decision making components pertaining to various production hindrances. The most prominent one is best-fit spatial arrangement for the minimal spatial occupancy with better pick-ability for the erection of the ship in the dock. During the present research, a concept have been conceived to evade the gap between the identification oj inter-relationships among a set of blocks to be included on a pre-erection area, and a detailed graphical layout of their positions, is called an Optimal Block Relationship Diagram A research has been performed on generation of optimal (or near Optimal) that is, with minimal scrap area. An effort has been made in the generation of optimal (or near-optimal) Optimal Block Relationship Diagram with the Goldberg's Genetic Algorithms with a representation and a set of operators are 'trained' specifically for this application. The expected result to date predicts very good solutions to test problems involving innumerable different blocks to place. The suggested algorithm could accept input from an erection sequence generator program which assists the user in defining the nature and strength of the relationships among blocks, and could produce input suitable for use in a detailed layout stage.

• MALSORI
• /
• 제50호
• /
• pp.51-69
• /
• 2004

In this paper, we present a one-pass semi-dynamic network decoding framework that inherits both advantages of fast decoding speed from static network decoders and memory efficiency from dynamic network decoders. Our method is based on the novel language model network representation that is essentially of finite state machine (FSM). The static network derived from the language model network [1][2] is partitioned into smaller subnetworks which are static by nature or self-structured. The whole network is dynamically managed so that those subnetworks required for decoding are cached in memory. The network is near-minimized by applying the tail-sharing algorithm. Our decoder is evaluated on the 25k-word Korean broadcast news transcription task. In case of the search network itself, the network is reduced by 73.4% from the tail-sharing algorithm. Compared with the equivalent static network decoder, the semi-dynamic network decoder has increased at most 6% in decoding time while it can be flexibly adapted to the various memory configurations, giving the minimal usage of 37.6% of the complete network size.

• Journal of the Korean Mathematical Society
• /
• 제50권1호
• /
• pp.61-80
• /
• 2013

In this paper, we study ${\alpha}$-completely positive maps between locally $C^*$-algebras. As a generalization of a completely positive map, an ${\alpha}$-completely positive map produces a Krein space with indefinite metric, which is useful for the study of massless or gauge fields. We construct a KSGNS type representation associated to an ${\alpha}$-completely positive map of a locally $C^*$-algebra on a Krein locally $C^*$-module. Using this construction, we establish the Radon-Nikod$\acute{y}$m type theorem for ${\alpha}$-completely positive maps on locally $C^*$-algebras. As an application, we study an extremal problem in the partially ordered cone of ${\alpha}$-completely positive maps on a locally $C^*$-algebra.

• Journal of Information Science Theory and Practice
• /
• 제10권2호
• /
• pp.45-73
• /
• 2022

The research in the literature review on Internet of Things (IoT) adoption from an individual consumer viewpoint is minimal and has not yet been fully investigated. Therefore, the objectives of this study are to analyze the growth of IoT in recent years and to conduct a weight analysis of the factors that affect acceptance intentions and real usage of IoT-enabled services. For the review, we analyzed 87 publications from 13 conferences and 54 journals published during the period 2014-2020 about consumer adoption of IoT. Following the study, we discovered an unprecedented increase in the number of articles published in the last seven years, which points to an emerging area with an enormous prospect. Furthermore, the weight analysis outcome was associated with the diagrammatic representation in this study. After that, this research developed a generalized consumer IoT adoption model based on the 12 best predictors derived from frequency count and weight analysis, which had the highest predictive power for calculating IoT adoption. This paper further acknowledges the study's theoretical and practical contributions, as well as its shortcomings, and proposes further research directions for future researchers.