• Title/Summary/Keyword: Function information

Search Result 14,394, Processing Time 0.037 seconds

Predictors of Sexual Desire, Arousal, Lubrication, Orgasm, Satisfaction, and Pain in Women with Gynecologic Cancer (부인암 여성의 성 욕구, 성 흥분, 질분비, 절정감, 성 만족도, 성교 통증에 대한 심리사회적 예측요인)

  • Chun, Na-Mi
    • Journal of Korean Academy of Nursing
    • /
    • v.40 no.1
    • /
    • pp.24-32
    • /
    • 2010
  • Purpose: This study was done to identify psychosocial factors that might be predictive of sexual desire, arousal, lubrication, orgasm, satisfaction, and pain in women with gynecologic cancer. Methods: Two hundred and twelve women with cervical, ovarian, or endometrial cancer completed questionnaires on the Female Sexual Function Index including sexual desire, arousal, lubrication, orgasm, satisfaction, and pain, and data on their psychosocial factors including body image, sexual attitude, sexual information, depression, and marital intimacy. Stepwise multivariable regression analysis was performed to explore psychosocial predictors of women’s sexual function domains. Results: Predictors were identified as sexual attitude, depression, sexual information, and body image for sexual desire; sexual information, depression, and sexual attitude for sexual arousal; sexual information, marital intimacy, and depression for lubrication; sexual information, marital intimacy, depression, and body image for orgasm; marital intimacy, sexual information, sexual attitude, and depression for satisfaction; sexual information, depression, and marital intimacy for pain. Conclusion: The results indicate that women’s sexual function needs to be approached to domains of female sexual function psychosocially as well as to general sexual function. These factors should be considered in future interventions to positively promote sexual function in women with gynecologic cancer.

Dynamic Pipe Hash Function (동적 파이프 해쉬 함수)

  • Kim, Hie-Do;Won, Dong-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.4
    • /
    • pp.47-52
    • /
    • 2007
  • In this paper, we proposed a constrution that creates Dynamic Pipe Hash Function with a pipe hash function. To increase security lever, dynamic hash function take and additional compression function. Proposed hash function based on the piped hash function. Our proposed Dynamic Pipe Hash Function is as secure against multicollision attack as an ideal hash function. And it have advantage for a number of reasons because of variable digest size. For example, in digital signature protocol, If a user requires increased security by selecting a large key size, useing a dynamic hash function in a protocol make implementation much easier when it is mandated that the size of the digest by increased.

Implementation of OFP initialization function in IMDC for FA-50 aircraft

  • You, Eun-Kyung;Bae, Chan-Gyu;Kim, Hyeock-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.2
    • /
    • pp.111-118
    • /
    • 2019
  • Recent trends in modern warfare are increasing in importance for air warfare, information warfare, and warfare. The technology of the weapon system software is rapidly developing, and the silent information war to hack it is still going on. Currently, the FA-50 aircraft has a function that can be initialized by a simple switch operation to protect the main military information in the event of an emergency. However, there are limitations in the existing Zeroize function, and this study was carried out to supplement this. First, we compare and analyze the memory structure of aircraft operating in our military, and examined the currently implemented Zeroize function. Second, we reviewed various methods to overcome the limitation of existing Zeroize function. Third, we implement the existing Zeroize function without additional manipulation. In this paper, we propose that the implementation of this feature will enable us to protect our military data more securely and suggest that we should continue to look for ways to enhance security for our technology in the future.

Estimating the Function Point for the Object Oriented Information Systems (객체지향 기반의 정보시스템 개발 프로젝트에서의 기능점수 예측 기법에 관한 연구)

  • Jeong, Seung-Ryul;Lee, Suk-Joon
    • The Journal of Information Systems
    • /
    • v.16 no.1
    • /
    • pp.111-133
    • /
    • 2007
  • The purpose of this study is to present a new function point estimation approach for the Object-Oriented information systems. In order to fulfill this purpose, we first review the literature on Function Point Analysis of IFPUG, Unified Modeling Language, and Unified Process. Then, we derive a method and rules for estimating Function Points based on Use Cases and Class Diagrams. To analyze the appropriateness of the proposed approach, we conduct the empirical testing. 143 use cases are collected from production, marketing, distribution, sales, and other areas from the Object-Oriented systems development projects. We compare our new approach with the existing methods that are usually used for traditional systems development projects. The results show that our proposed approach is more appropriate for the Object-Oriented environment.

  • PDF

SVC with Modified Hinge Loss Function

  • Lee, Sang-Bock
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.905-912
    • /
    • 2006
  • Support vector classification(SVC) provides more complete description of the linear and nonlinear relationships between input vectors and classifiers. In this paper we propose to solve the optimization problem of SVC with a modified hinge loss function, which enables to use an iterative reweighted least squares(IRWLS) procedure. We also introduce the approximate cross validation function to select the hyperparameters which affect the performance of SVC. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.

  • PDF

Design of Generalized Fluctuation Function for Reversible Data Hiding in Encrypted Image (암호화된 영상의 가역적 데이터 은닉을 위한 일반화된 섭동 함수 설계)

  • Kim, Young-Hun;Lim, Dae-Woon;Kim, Young-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1329-1340
    • /
    • 2016
  • Recently, Zhang proposed a scheme to hide information in encrypted images using synchronous stream ciphers. After the receiver decrypts the encrypted image and extracts data by calculating the spatial correlation property value using the fluctuation function which is designed to calculate spacial correlation between adjacent pixels in a decrypted image. Then, Hong improved the Zhang's data hiding scheme by introducing the side match technique. In this paper, a novel fluctuation function is proposed to reduce the recovery errors which arise during extracting hidden data. Then, we also demonstrated that the proposed fluctuation function outperforms the previous functions through computer simulations for sample images.

AIT: A method for operating system kernel function call graph generation with a virtualization technique

  • Jiao, Longlong;Luo, Senlin;Liu, Wangtong;Pan, Limin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2084-2100
    • /
    • 2020
  • Operating system (OS) kernel function call graphs have been widely used in OS analysis and defense. However, most existing methods and tools for generating function call graphs are designed for application programs, and cannot be used for generating OS kernel function call graphs. This paper proposes a virtualization-based call graph generation method called Acquire in Trap (AIT). When target kernel functions are called, AIT dynamically initiates a system trap with the help of a virtualization technique. It then analyzes and records the calling relationships for trap handling by traversing the kernel stacks and the code space. Our experimental results show that the proposed method is feasible for both Linux and Windows OSs, including 32 and 64-bit versions, with high recall and precision rates. AIT is independent of the source code, compiler and OS kernel architecture, and is a universal method for generating OS kernel function call graphs.

Extraction Scheme of Function Information in Stripped Binaries using LSTM (스트립된 바이너리에서 LSTM을 이용한 함수정보 추출 기법)

  • Chang, Duhyeuk;Kim, Seon-Min;Heo, Junyoung
    • Journal of Software Assessment and Valuation
    • /
    • v.17 no.2
    • /
    • pp.39-46
    • /
    • 2021
  • To analyze and defend malware codes, reverse engineering is used as identify function location information. However, the stripped binary is not easy to find information such as function location because function symbol information is removed. To solve this problem, there are various binary analysis tools such as BAP and BitBlaze IDA Pro, but they are based on heuristics method, so they do not perform well in general. In this paper, we propose a technique to extract function information using LSTM-based models by applying algorithms of N-byte method that is extracted binaries corresponding to reverse assembling instruments in a recursive descent method. Through experiments, the proposed techniques were superior to the existing techniques in terms of time and accuracy.

Reliability and ratio in exponentiated complementary power function distribution

  • Moon, Yeung-Gil;Lee, Chang-Soo;Ryu, Se-Gi
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.5
    • /
    • pp.955-960
    • /
    • 2009
  • As we shall dene an exponentiated complementary power function distribution, we shall consider moments, hazard rate, and inference for parameter in the distribution. And we shall consider an inference of the reliability and distributions for the quotient and the ratio in two independent exponentiated complementary power function random variables.

  • PDF

On the Support Vector Machine with the kernel of the q-normal distribution

  • Joguchi, Hirofumi;Tanaka, Masaru
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.983-986
    • /
    • 2002
  • Support Vector Machine (SVM) is one of the methods of pattern recognition that separate input data using hyperplane. This method has high capability of pattern recognition by using the technique, which says kernel trick, and the Radial basis function (RBF) kernel is usually used as a kernel function in kernel trick. In this paper we propose using the q-normal distribution to the kernel function, instead of conventional RBF, and compare two types of the kernel function.

  • PDF