• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.425-441
• /
• 2013

In literature, several strong designated verifier signature (SDVS) schemes have been devised using elliptic curve bilinear pairing and map-topoint (MTP) hash function. The bilinear pairing requires a super-singular elliptic curve group having large number of elements and the relative computation cost of it is approximately two to three times higher than that of elliptic curve point multiplication, which indicates that bilinear pairing is an expensive operation. Moreover, the MTP function, which maps a user identity into an elliptic curve point, is more expensive than an elliptic curve scalar point multiplication. Hence, the SDVS schemes from bilinear pairing and MTP hash function are not efficient in real environments. Thus, a cost-efficient SDVS scheme using elliptic curve cryptography with pairingfree operation is proposed in this paper that instead of MTP hash function uses a general cryptographic hash function. The security analysis shows that our scheme is secure in the random oracle model with the hardness assumption of CDH problem. In addition, the formal security validation of the proposed scheme is done using AVISPA tool (Automated Validation of Internet Security Protocols and Applications) that demonstrated that our scheme is unforgeable against passive and active attacks. Our scheme also satisfies the different properties of an SDVS scheme including strongness, source hiding, non-transferability and unforgeability. The comparison of our scheme with others are given, which shows that it outperforms in terms of security, computation cost and bandwidth requirement.

• 한국정밀공학회지
• /
• 제14권12호
• /
• pp.24-29
• /
• 1997

Recently, Genetic Algorithm(GA), which is a stochastic direct search strategy that mimics the process of genetic evolution, is widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA is very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GA. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher porbability of convergence to global optimum compared to traditional techniques which take one-point search method. The methods consist of three genetics opera- tions named selection, crossover and mutation. In this study, a method of finding the omtimum size and topology of drilling machine is proposed by using the GA, For rapid converge to optimum, elitist survival model,roulette wheel selection with limited candidates, and multi-point shuffle cross-over method are adapted. And pseudo object function, which is the combined form of object function and penalty function, is used to include constraints into fitness function. GA shows good results of weight reducing effect and convergency in optimal design of drilling machine.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.409-412
• /
• 2002

The software complexity model makes an estimated of the product software. For a practice of software managed, need to guideline of the static analysis. Especially, Software complexity model introduced for the estimation of software quantity. In case of measurement the software matrices, its need for us to analysis of software qualify and products. In this paper, we represent that the analysis of function point, control structure and interface, volume matrices in various aspect of switching software. Others, their results utilized similar of project and system development.

• 정보처리학회논문지D
• /
• 제8D권3호
• /
• pp.241-246
• /
• 2001

소프트웨어공학에서 소프트웨어 측정분야는 30년 이상 수많은 연구가 있어 왔으나 아직까지 구체적인 소프트웨어 비용추정 모델이 없는 실정이다. 만약 소프트웨어 비용-개발노력을 측정하려면 소프트웨어 규모를 추정해야 한다. 많은 소프트웨어 척도가 개발되었지만 가장 일반적인 척도가 LOC(line of code)와 FPA(Function Point Analysis)이다. FPA는 소프트웨어 규모를 측정하는데 LOC를 사용할 때의 단점을 극복할 수 있는 기법이다. 본 논문은 FP와 기능 구성요소 형태들로 측정된 소프트웨어 규모로 소프트웨어 개발 노력을 추정하는 신경망 모델을 제안한다. 24개 소프트웨어 개발 프로젝트 사례연구를 통해 적합한 신경망 모델을 제시하였다. 또한, 희귀분석 모델과 신경망 모델을 비교하여 신경망 모델의 추정 정확성이 보다 좋음을 보였다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2002년도 춘계학술대회논문집
• /
• pp.980-985
• /
• 2002

Several tests are performed to evaluate road booming noise. Baseline test delivers the information of road noise characteristics. Coupling effect between structure and acoustics is obtained from the mode shapes and the natural frequencies by the modal test. Equivalent stiffness at joint areas between chassis and car-body system can be determined by the input point inertance test. Noise sensitivity of body mounting point of a chassis part can be obtained from the noise transfer function test with input point inertance test. Operational deflection shape makes us analyze the actual vibration modes of the chassis system under actual loading and find noise sources very easily. finally, the transfer function analysis is used to identify noise paths through the chassis system. However, all of the tests above mentioned must be performed to evaluate road booming noise. The objectives and the procedures of the tests are described in this paper. Also, the guideline for efficient road noise evaluation test can be found.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1994년도 추계학술대회 논문집 학회본부
• /
• pp.75-77
• /
• 1994

This paper presents a method of obtaining transmission network equivalents from the network's driving-point admittance characteristic. Proposed method is based on modal decomposition representation for the large-scale interconnected system. As a result, Norton-type of discrete-time filter model can be generated. It can reproduce the driving-point admittance characteristic of the network. Furthermore proposed model can be implemented into the EMTP in a direct manner. The simulation results with the full system representation and the developed equivalent system showed a good agreement.

• 정보처리학회논문지D
• /
• 제10D권7호
• /
• pp.1127-1136
• /
• 2003

소프트웨어 개발 초기에 개발비용, 소요 인력과 기간을 추정하는 것은 소프트웨어공학 분야의 주요한 요소이며, 어려운 문제이다. 소프트웨어 개발 소요 인력을 추정하기 위한 대부분의 모델들은 소프트웨어 요구사항 명세서로부터 측정된 기능점수를 이용하였다. 본 논문은 기능점수에 기반하여 프로젝트에 대한 가장 실제적이고 생산적인 팀 규모와 개발기간을 선택하는 지침으로 사용될 수 있는 정보를 제공하기 위해 생산성 척도와 비용 척도를 도입하였다. 소프트웨어 개발과 유지보수를 수행한 300개 프로젝트 데이터 집합을 2개의 서브 그룹인 개발 프로젝트와 유지보수 프로젝트로 분류하였다. 생산성과 비용 측도 기준에 의해 분석한 결과 작은 팀 규모와 최소한의 개발기간이 소요되었을 때, 프로젝트가 성공적으로 수행됨을 보였다. 또한, 연구 결과에 근거하여 기능점수 규모에 따른 개발팀의 규모와 개발기간을 추정할 수 있는 모델을 제안하였다. 본 제안 모델은 소프트웨어 규모에 따라 필요한 개발팀의 규모와 개발기간 평가 기준을 제공한다.

• 대한전기학회논문지
• /
• 제43권4호
• /
• pp.687-690
• /
• 1994

This paper presents a method of obtaining transmission network equivalents from the network's response to the pulse excitation signal. Proposed method is base on Prony signal analysis and jtransfer function identification technique. As a result Thevenin-type of discrete-time filter model can be generated. It can reproduce the driving point impedance characteristic of the network.

• 한국통신학회논문지
• /
• 제15권11호
• /
• pp.879-885
• /
• 1990

준정적 근사법을 적용하여 평탄한 단면(End cap)을 포함하는 회전체에 유기되는 전류에 대한 적분방정식을 유도하고 모멘트법을 이용해서 해석하였다. 수체해석시 기저함수로 Cubic B Spline 함수, 가중함수로 델타함수를 사용한 Point Matching Method를 사용하였다. 또한 끝단에 둥근타원체(Spheroidal end cap)를 갖는 경우 및 평탄한 단면을 갖는 원통주의 구조변수 변화에 따른 영향관계를 해석하였다.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제25권3호
• /
• pp.193-201
• /
• 2018

In this paper, we discuss central index oriented and slowly changing function based some growth properties of composite entire functions.