athesis;science Ph.D.candi

与研究生教育学会“十一五”课程(06CC017)0技术与创新管理Technology and Innovation Management72-74B82-057F101;1;A;F;F101_     

‘<Emphasis Type="Italic">if p then q</Emphasis>’ . . . and all that: Logical Elements in Reasoning and Discourse

In this paper we explore differences in use of the so-called ‘logical’ elements of language such as quantifiers and conditionals, and use this to explain differences in performance in reasoning tasks across subject groups with different educational backgrounds. It is argued that quantified sentences are difficult natural bases for reasoning, and hence more prone to elicit variation in reasoning behaviour, because they are chiefly used with a pre-determined domain in everyday speech. By contrast, it is argued that conditional sentences form natural premises because of the function they serve in everyday speech. Implications of this for the role of logic in modelling human reasoning behaviour are briefly considered.     

Corrigendum to “Note on covering monotone orthogonal polygons” [Inf. Process. Lett. 104(6) (2007) 220–227]

Recently, a gap in Step 4 of Algorithm Sweep3 (and thus in Step 4 of Algorithm Minimum-Guard-Cover) presented in our paper entitled “Note on covering monotone orthogonal polygons with star-shaped polygons”, which appeared in Information Processing Letters 104(6), pp. 220–227 (2007), was pointed out by Leonidas Palios. In this corrigendum, we fix this gap and update the correctness proof in accordance with the new version of the algorithm.     

Erratum to “Solving the multi-buyer joint replenishment problem with the RAND method” [Comput. Indus. Eng. 46 (2004) 755–762]

A heuristic called RAND was used by Q. Li [Li, Q., 2004. Solving the multi-buyer joint replenishment problem with the RAND method. Computers & Industrial Engineering, 46, 755–762] to solve the multi-buyer joint replenishment problem. In this paper, errors made in the proposed RAND procedure of Q. Li (2004) are rectified. Furthermore, modifications to the proposed RAND procedure are also given.     

Erratum to “Finding the most efficient DMUs in DEA: An improved integrated model” [Comput. Indus. Eng. 52 (2007) 71–77]

There are two errors existing in “Finding the most efficient DMUs in DEA: An improved integrated model” (Amin & Toloo, 2007), one exists in the process of proving the theorem that “Theorem:model (3) is feasible (p. 75)”, while the other is that model (3) and model (4) are incorrectly built.     

Corrigendum to “Uniform constant-depth threshold circuits for division and iterated multiplication” [J. Comput. System Sci. 65 (4) (2002) 695–716]

In this corrigendum, we retract part of our Corollary 6.6, which was presented as an immediate and obvious consequence of our main theorem, which showed that division lies in Dlogtime-uniform TC⁰${\mathrm{TC}}^0$.     

Comments on “An improved model for vehicle routing problem with time constraint based on genetic algorithm” [Comput. Ind. Eng. 42 (2002) 361–369]

An improved model for vehicle routing problem proposed by Heung-Suk Hwang (2002) was recently published in Computer & Industrial Engineering Journal to solve the time constraint vehicle routing problem based on improved genetic algorithm. In this work, comments are given to the published paper of Heung-Suk Hwang (2002). And they centralize on the example of improved mutation operator and the problem formulation. The suggested modifications are also provided in this work.