• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.201-208
• /
• 2010

We propose a new notion of metered signatures. Metered signature is an extension of k-times signatures in which a signer can generate only k signatures. However, the restriction of metered signatures can be more elaborate: It can be used k-times every day or to preserve the order of signed messages in some applications. Any violation of this regulation reveals a secret key or the signature on a predetermined message. The applications includes proxy signatures, limited free downloads, and the rating web site. We give two instances of metered signatures: One is based on the computational Diffie-Hellman problem (CDHP) using a bilinear map and the other is based on the RSA problem. In both schemes, the signature and certificate size and the verification cost are constant with respect to k. Further, we show that the proposed metered signatures admit batch verification of many signatures almost at one verification cost with small security loss.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• Journal of Educational Research in Mathematics
• /
• v.11 no.2
• /
• pp.385-402
• /
• 2001

The purpose of this study is to conceptualize 'proof' school mathematics. We based on the assumption the following. (a) There are several different roles of 'proof' : verification, explanation, systematization, discovery, communication (b) Accepted criteria for the validity and rigor of a mathematical 'proof' is decided by negotiation of school mathematics community. (c) There are dynamic relations between mathematical proof and empirical theory. We need to rethink the nature of mathematical proof and give appropriate consideration to the different types of proof related to the cognitive development of the notion of proof. 'proof' in school mathematics should be conceptualized in the broader, psychological sense of justification rather than in the narrow sense of deductive, formal proof 'proof' has not been taught in elementary mathematics, traditionally, Most students have had little exposure to the ideas of proof before the geometry. However, 'proof' cannot simply be taught in a single unit. Rather, proof must be a consistent part of students' mathematical experience in all grades, in all mathematics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.7-12
• /
• 2009

The new approach was proposed which uses feature extraction based on fuzzy integral in the process of face verification using morphological shape decomposition. The centre of area was used with image pixels related with structure element and its weight in an attempt to consider neighborhood information. Therefore the morphological operators were defined for feature extraction. And then the number of decomposition images were more about 4 times than the conventional. Finally in the simulations with the extractions for face verification it was proved that the approach in this paper was even more good than the conventional in stability of feature extraction and threshold value.

• The Mathematical Education
• /
• v.17 no.2
• /
• pp.1-13
• /
• 1979

This study aimed at studying the sequence of the Figure Transformation Learning, inquiring relationship among these transformations and then researching whether there is the difference of the learning ability or not between by teaching them as it is independent and by teaching them as it is contains. (Hypothesis 1) It may be more effective to teach The Sequence of Transformation Learning by beginning with peculiar field, ending with general field than vice versa At the result of verification-C $R_{M}$=2.59, 0.005$R_{M}$=5.19, p<0.005-significant difference appeared. It is proved more effective to teach the Figure Transformation Learning the way it contains than the way it is independent. Synthesizing two hypothesises of the above, the conclusion is following The Figure Transformation Learning should be taught by beginning with peculiar field. ending with general field (congruent transformationlongrightarrowsimilar transformationlongrightarrowprojective transformationlongrightarrowtopological transformation). To teach it the way it contains is more effective.ive.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1051-1069
• /
• 2016

Combining the concept of self-certified public key and message recovery, Li-Zhang-Zhu (LZZ) gives the proxy signature scheme with message recovery using self-certified public key. The security of the proposed scheme is based on the discrete logarithm problem (DLP) and one-way hash function (OWHF). Their scheme accomplishes the tasks of public key verification, proxy signature verification, and message recovery in a logically single step. In addition, their scheme satisfies all properties of strong proxy signature and does not use secure channel in the communication between the original signer and the proxy signer. In this paper, it is shown that in their signature scheme a malicious signer can cheat the system authority (SA), by obtaining a proxy signature key without the permission of the original signer. At the same time malicious original signer can also cheat the SA, he can also obtain a proxy signature key without the permission of the proxy signer. An improved signature scheme is being proposed, which involves the remedial measures to get rid of security flaws of the LZZ et al.'s. The security and performance analysis shows that the proposed signature scheme is maintaining higher level of security, with little bit of computational complexity.

• IE interfaces
• /
• v.22 no.2
• /
• pp.116-125
• /
• 2009

We revisit the assembly block storage location assignment problem (ABSLAP) at a shipyard, in order to compensate for the deficiency in performance verification of the heuristic ABSLAP algorithm developed by the previous study. In this paper, we formulate a mathematical programming model of the ABSLAP, refine elaborately the heuristic ABSLAP algorithm, and show the performance of the developed mathematical programming model and the revised heuristic ABSLAP algorithm. In addition, we explain simulation experiments conducted using the revised heuristic ABSLAP algorithm to investigate the influences of block stockyard layouts and production schedule instability on the block stockyard operations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.375-378
• /
• 2005

Voice Coil Motor is used linear motion actuator system that require precision positioning control. In order to control precision positioning of voice coil motor, Mathematical model of voice coil motor is needed. Mathematical model is obtained by combining voice coil motor's equation of motion with the equation of circuit and characteristic of voice coil motor. The induced model can predict output displacement according to duty ratio and amplitude. The model is verified by experimental test. Simulated results have tracking errors of less than 10 percent of experimental results.

• Education of Primary School Mathematics
• /
• v.7 no.2
• /
• pp.85-99
• /
• 2003

In this paper, firstly examined various proofs types that cover informal empirical justifications by Balacheff, Miyazaki, and Harel ＆ Sowder and Tall. Using these theoretical frameworks, justification activities by 5th graders were analyzed and several conclusions were drawn as follow: 1) Children in 5th grade could justify using various proofs types and method ranged from external proofs schemes by Harel & Sowder to thought experiment by Balacheff This implies that children in elementary school can justify various mathematical statements of ideas for themselves. To improve children's proving abilities, rich experience for justifying should be provided. 2) Activities that make conjectures from cases then justify should be given to students in order to develop a sense of necessity of formal proof. 3) Children have to understand the meaning and usage of mathematical symbol to advance to formal deductive proofs. 4) New theoretical framework is needed to be established to provide a framework for research on elementary school children's justification activities. Research on proof mainly focused on the type of proof in terms of reasoning and activities involved. But proof types are also influenced by the tasks given. In elementary school, tasks that require physical activities or examples are provided. To develop students'various proof types, tasks that require various justification methods should be provided. 5) Children's justification type were influenced not only by development level but also by the concept they had. 6) Justification activities provide useful situation that assess students'mathematical understanding. 7) Teachers understanding toward role of proof(verification, explanation, communication, discovery, systematization) should be the starting point of proof activities.

• Current Optics and Photonics
• /
• v.6 no.1
• /
• pp.69-78
• /
• 2022

A high-resolution camera is a precise optical system. Its vibrations during transportation and launch, together with changes in temperature and gravity field in orbit, lead to different degrees of defocus of the camera. Thermal refocusing is one of the solutions to the problems related to in-orbit defocusing, but there are few relevant thermal refocusing mathematical models for systematic analysis and research. Therefore, to further research thermal refocusing systems by using the development of a high-resolution micro-nano satellite (CX6-02) super-resolution camera as an example, we established a thermal refocusing mathematical model based on the thermal elasticity theory on the basis of the secondary mirror position. The detailed design of the thermal refocusing system was carried out under the guidance of the mathematical model. Through optical-mechanical-thermal integration analysis and Zernike polynomial calculation, we found that the data error obtained was about 1%, and deformation in the secondary mirror surface conformed to the optical index, indicating the accuracy and reliability of the thermal refocusing mathematical model. In the final ground test, the thermal vacuum experimental verification data and in-orbit imaging results showed that the thermal refocusing system is consistent with the experimental data, and the performance is stable, which provides theoretical and technical support for the future development of a thermal refocusing space camera.