• The Journal of Korean Society for School & Community Health Education
• /
• v.12 no.3
• /
• pp.1-15
• /
• 2011

Objectives: We describe the development of a smoking and drinking prevention program for adolescents, using intervention mapping. Methods: The study sample consisted of 1,000 high school second-grade students from 6 high schools in Seoul. The PRECEDE model was applied for the needs assessment. We carried out a social diagnosis by assessing the factors such as the quality of life, happiness level, and satisfaction with school life; an epidemiological diagnosis on the perceived health status, stress levels, and priority of health issues; a behavioral diagnosis on the smoking and drinking rate and the intention to smoke and drink; and an educational diagnosis on knowledge, beliefs, attitudes, self-efficacy, outcome expectations, social norms and life skills. Results: The development process included a needs assessment, identifying factors that influence smoking and drinking among adolescents. Intention, knowledge, perceived norms, perceived benefit, perceived cost, perceived susceptibility, self-efficacy, and life skills were identified as determinants. Three performance objectives were formulated to describe what an individual needs to do in order to avoid smoking and drinking. Subsequently, we constructed an intervention matrix by crossing the performance objectives with the selected determinants. Each cell describes the learning objectives of the smoking and drinking prevention program. The program used methods from the transtheoretical model, such as consciousness raising, outcome expectations, self-reevaluation, self-liberation, counterconditioning, environmental reevaluation, and stimulus control. The program deals with the effects of smoking and drinking, self-improvement, decision making, understanding advertisements, communication skills, social relationships, and assertiveness. Conclusions: By using the process of intervention mapping, the program developer was able to ensure a systematical incorporation of empirical and new data and theories to guide the intervention design. Programs targeting other health-related behavior and other methods or strategies can also be developed using this intervention mapping process.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.709-730
• /
• 2022

We consider the nonlinear matrix equation (NMEs) of the form 𝓤 = 𝓠 + Σ^k_i=1 𝓐^*_iℏ(𝓤)𝓐_i, where 𝓠 is n × n Hermitian positive definite matrices (HPDS), 𝓐₁, 𝓐₂, . . . , 𝓐_m are n × n matrices, and ~ is a nonlinear self-mappings of the set of all Hermitian matrices which are continuous in the trace norm. We discuss a sufficient condition ensuring the existence of a unique positive definite solution of a given NME and demonstrate this sufficient condition for a NME 𝓤 = 𝓠 + 𝓐^*₁(𝓤²/900)𝓐₁ + 𝓐^*₂(𝓤²/900)𝓐₂ + 𝓐^*₃(𝓤²/900)𝓐₃. In order to do this, we define 𝓕𝓖_w-contractive conditions and derive fixed points results based on aforesaid contractive condition for a mapping in extended Branciari b-metric distance followed by two suitable examples. In addition, we introduce weak well-posed property, weak limit shadowing property and generalized Ulam-Hyers stability in the underlying space and related results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.23 no.6 s.165
• /
• pp.1018-1025
• /
• 1999

For the effective analysis of two dimensional plane problems with geometrical discontinuities, singular finite element has been proposed. The element matrix equation was formulated on the basis of hybrid variational principle and Trefftz function sets derived consistently from the complex theory of plane elasticity by introducing a conformal mapping function. In order to suggest the accuracy characteristics of the proposed singular finite element, typical plane problems were analyzed and these results were compared with exact solutions. The singular finite element gives the comparatively exact values of stress concentration factors or stress intensity factors and can be effectively used for the analysis of mechanical structures containing various geometrical discontinuities.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.101.1-101
• /
• 2001

This paper describes a grid mapping for a vision based mobile robot in uncertain indoor environment. The map building is a prerequisite for navigation of a mobile robot and the problem of feature correspondence across two images is well known to be of crucial Importance for vision-based mapping We use a stereo matching algorithm obtained by singular value decomposition of an appropriate correspondence strength matrix. This new correspondence strength means a correlation weight for some local measurements to quantify similarity between features. The visual range data from the reconstructed disparity image form an occupancy grid representation. The occupancy map is a grid-based map in which each cell has some value indicating the probability at that location ...

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.652-653
• /
• 2014

This paper present a method of GRM constant generation using cell [fi] which is generated over karnaugh map. The proposed method is as following. First od all, we select the arbitrary cell over karnaugh map. Next we arithmetic operate the selected cell with single variable transformation matrix, and mapping into karnaugh map its result. Although we discuss the new GRM generation method applied to polarity circulation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.430-436
• /
• 2014

Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.443-456
• /
• 2005

Let G be a Lie group, let L(G) be its Lie algebra, and let exp : $L(G){\rightarrow}G$ denote the exponential mapping. For $S{\subseteq}G$, we define the tangent set of S by $L(S)\;=\;\{X\;{\in}\;L(G)\;:\;exp(tX)\;\in\;S\;for\;all\;t\;{\geq}\;0\}$. We say that a semigroup S is strictly infinitesimally generated if S is the same as the semigroup generated by exp(L(S)). We find a tangent set of the semigroup of all non-singular totally positive matrices and show that the semigroup is strictly infinitesimally generated by the tangent set of the semigroup. This generalizes the familiar relationships between connected Lie subgroups of G and their Lie algebras

• Journal of Ocean Engineering and Technology
• /
• v.28 no.4
• /
• pp.363-369
• /
• 2014

In this paper, a practical controller for a group of USVs is proposed in order to avoid matrix inversion problems in computation. Using nonlinear mapping, a formation composed of nonholonomic agents can be stabilized even when the formation is stationary. Since there is no matrix inversion in computing the control law, the computation complexity can be resolved. A controller for stabilizing the formation errors in the presence of model uncertainty is considered using the Lyapunov redesign method. The asymptotic stability of the formation errors is shown. It is also shown that the proposed controller can be applied to guide a formation to a different shape without modification.