防紫外线伞ATR-OMNI采样器的FTIR分析

本实验使用OMNI采样器，直接对伞面内外进行单反射ATR的分析，快速、简便、不破坏样品，得到分辨率很好的红外图谱，再配合红外谱库的谱图检索，可以分别得到匹配率95％以上的尼龙－6和聚酯型聚氨酯的分析结果。     

Reasoning about proof and knowledge

In previous work [15], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from Gödel's interpretation of IPC in S4, our modal systems contain IPC in the way established in [13]. The modal operator can be viewed as a predicate for intuitionistic truth, i.e. proof. Epistemic principles are partially adopted from Intuitionistic Epistemic Logic IEL [4]. In the present paper, we show that the S5-style systems of our hierarchy correspond to an extended Brouwer–Heyting–Kolmogorov interpretation and are complete w.r.t. a relational semantics based on intuitionistic general frames. In this sense, our S5-style logics are adequate and complete systems for the reasoning about proof combined with belief or knowledge. The proposed relational semantics is a uniform framework in which also IEL can be modeled. Verification-based intuitionistic knowledge formalized in IEL turns out to be a special case of the kind of knowledge described by our S5-style systems.     

Correctness proof of an in-place permutation

The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements belonging to a permutation cycle. A suitable assertion is constructed from which the correctness can be deduced after completion of the algorithm.An in-place rectangular matrix transposition algorithm is given as an example.     

On an optimal robust digital image watermarking based on SVD using differential evolution algorithm

It is shown that the optimal robust digital image watermarking based on singular value decomposition using differential evolution algorithm proposed by Veysel Aslantas [Opt. Commun. 282(5):769-777 (2009)] has a serious fundamental flaw and should not be used for proof of ownership application.     

Uniform asymptotic regularity for Mann iterates

In Numer. Funct. Anal. Optim. 22 (2001) 641-656, we obtained an effective quantitative analysis of a theorem due to Borwein, Reich, and Shafrir on the asymptotic behavior of general Krasnoselski-Mann iterations for nonexpansive self-mappings of convex sets C in arbitrary normed spaces. We used this result to obtain a new strong uniform version of Ishikawa's theorem for bounded C. In this paper we give a qualitative improvement of our result in the unbounded case and prove the uniformity result for the bounded case under the weaker assumption that C contains a point x whose Krasnoselski-Mann iteration (x_k) is bounded. We also consider more general iterations for which asymptotic regularity is known only for uniformly convex spaces (Groetsch). We give uniform effective bounds for (an extension of) Groetsch's theorem which generalize previous results by Kirk, Martinez-Yanez, and the author.     

Normal forms for fuzzy logics: a proof-theoretic approach

A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to a number of prominent fuzzy logics using hypersequent rules adapted from calculi defined in the literature. In particular, a normal form with simple McNaughton functions as literals is generated for ?ukasiewicz logic, and normal forms with simple implicational formulas as literals are obtained for Gödel logic, Product logic, and Cancellative hoop logic.     

Eliminating counterexamples: A Grade 8 student’s learning trajectory for contrapositive proving

This study uses a teaching experiment and retrospective analysis to develop a learning trajectory for improving a Grade 8 student’s ability to construct, critique, and validate contrapositive arguments. The study is predicated on the hypothesis that adolescents perform poorly on contrapositive reasoning tasks because they lack sufficient ways of justifying contrapositive argumentation as a viable mode of argumentation. By studying a student’s actions and comments as she develops, critiques, and validates not-the-conclusion-implies-the-conditions-are-impossible arguments for conditional claims, a promising learning trajectory for contrapositive argumentation is developed. The student’s learning trajectory demonstrates how a conception of contrapositive proving as eliminating counterexamples can be useful in developing, critiquing, and validating contrapositive arguments.     

Prospective elementary teachers’ claiming in responses to false generalizations

When faced with a false generalization and a counterexample, what types of claims do prospective K-8 teachers make, and what factors influence the type and prudence of their claims relative to the data, observations, and arguments reported? This article addresses that question. Responses to refutation tasks and cognitive interviews were used to explore claiming. It was found that prospective K-8 teachers’ claiming can be influenced by knowledge of argumentation; knowledge and use of the mathematical practice of exception barring; perceptions of the task; use of natural language; knowledge of, use of, and skill with the mathematics register; and abilities to technically handle data or conceptual insights. A distinction between technical handlings for developing claims and technical handlings for supporting claims was made. It was found that prudent claims can arise from arguer-developed representations that afford conceptual insights, even when searching for support for a different claim.     

Convergence analysis and performance of the extended artificial physics optimization algorithm

This paper presents extended artificial physics optimization (EAPO), a population-based, stochastic, evolutionary algorithm (EA) for multidimensional search and optimization. EAPO extends the physicomimetics-based Artificial Physics Optimization (APO) algorithm by including each individual’s best fitness history. Including the history improves EAPO’s search capability compared to APO. EAPO and APO invoke a gravitational metaphor in which the force of gravity may be attractive or repulsive, the aggregate effect of which is to move individuals toward local and global optima. A proof of convergence is presented that reveals the conditions under which EAPO is guaranteed to converge. Discrete-time linear system theory is used to develop a second-order difference equation for an individual’s stochastic position vector as a function of time step. Stable solutions require eigenvalues inside the unit circle, leading to explicit convergence criteria relating the run parameters {m_i, w, G}. EAPO is tested against several benchmark functions with excellent results. The algorithm converges more quickly than APO and with better diversity.