高阶模糊性现象的一种证实主义刻画——论确定性算子在模糊性研究中的角色

在对模糊性现象的研究中,以往的模糊性研究者不约而同地选择了确定性算子这个工具。一方面,不管是超赋值主义、多值主义、认知主义还是语境主义,在对边界情形和模糊边界的刻画中,都使用了确定性算子。另一方面,模糊性现象有两个重要特征:容忍直觉和高阶模糊性现象。这两个特征直接导致了模糊性研究中最为棘手的两个问题:基于容忍直觉的连锁悖论和高阶模糊性问题。由于对这两个问题的解决都离不开对边界情形和模糊边界的刻画,因此,对这两个问题的解决也离不开确定性算子。一旦我们对确定性算子D赋予了有认知内涵的证实角色,模糊性最棘手的两个问题——容忍悖论和高阶模糊性问题——都可以得到解决。

Improving performance of open-pit mine production scheduling problem under grade uncertainty by hybrid algorithms

One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term production scheduling(LTPS)of the open-pit mines.Deterministic and uncertainty-based approaches are identified as the main strategies,which have been widely used to cope with this problem.Within the last few years,many researchers have highly considered a new computational type,which is less costly,i.e.,meta-heuristic methods,so as to solve the mine design and production scheduling problem.Although the optimality of the final solution cannot be guaranteed,they are able to produce sufficiently good solutions with relatively less computational costs.In the present paper,two hybrid models between augmented Lagrangian relaxation(ALR)and a particle swarm optimization(PSO)and ALR and bat algorithm(BA)are suggested so that the LTPS problem is solved under the condition of grade uncertainty.It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence.Moreover,the Lagrangian coefficients are updated by using PSO and BA.The presented models have been compared with the outcomes of the ALR-genetic algorithm,the ALR-traditional sub-gradient method,and the conventional method without using the Lagrangian approach.The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution.Hence,it is more effectual than the conventional method.Furthermore,the time and cost of computation are diminished by the proposed hybrid strategies.The CPU time using the ALR-BA method is about 7.4%higher than the ALR-PSO approach.

Digital Signatures for e-Government - a Long-Term Security Architecture

The framework of digital signature based on qualified certificates and X. 509 architecture is known to have many security risks. Moreover, the fraud prevention mechanism is fragile and does not provide strong guarantees that can be necessary for flow of legal documents. Mediated signatures have been proposed as a mechanism to effectively disable signature cards. In this paper we propose further mechanisms that can be applied on top of mediated RSA, compatible with the standard format, but providing security guarantees even in the case when RSA becomes broken or the keys are compromised. The solution is immune tokleptographic attacks as only deterministic algorithms are used on user＇s side.

On some mathematical aspects of the Heisenberg relation

The Heisenberg commutation relation, QP P Q = ihI, is the most fundamental relation of quantum mechanics. Heisenberg's encoding of the ad-hoc quantum rules in this simple relation embodies the character-istic indeterminacy and uncertainty of quantum theory. Representations of the Heisenberg relation in various mathematical structures are discussed. In particular, after a discussion of unbounded operators affiliated with finite von Neumann algebras, especially, factors of Type Ⅱ1 , we answer the question of whether or not the Heisenberg relation can be realized with unbounded self-adjoint operators in the algebra of operators affiliated with a factor of type Ⅱ1 .