Comments on edge-to-edge matching and the equivalence of the invariant line, Delta g and Moire fringe approaches to the crystallographic features of precipitates

Three apparently distinct and different approaches have been proposed to account for the crystallographic features of diffusion-controlled precipitation. These three models are based on (a) an invariant line in the habit plane, (b) the parallelism of a pair of Deltags that are perpendicular to the habit plane and (c) the parallelism of a pair of Moire fringes that are in turn parallel to the habit plane. The purpose of the present paper is to show that these approaches are in fact absolutely equivalent and that when certain conditions are satisfied they are essentially the same as the recent edge-to-edge matching model put forward by the authors. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

On the equivalence of weighted Country-Product-Dummy (CPD) Method and the Rao-System for multilateral price comparisons

The country-product-dummy (CPD) method, originally proposed in Summers (1973), has recently been revisited in its weighted formulation to handle a variety of data related situations (Rao and Timmer, 2000, 2003; Heravi et al., 2001; Rao, 2001; Aten and Menezes, 2002; Heston and Aten, 2002; Deaton et al., 2004). The CPD method is also increasingly being used in the context of hedonic modelling instead of its original purpose of filling holes in Summers (1973). However, the CPD method is seen, among practitioners, as a black box due to its regression formulation. The main objective of the paper is to establish equivalence of purchasing power parities and international prices derived from the application of the weighted-CPD method with those arising out of the Rao-system for multilateral comparisons. A major implication of this result is that the weighted-CPD method would then be a natural method of aggregation at all levels of aggregation within the context of international comparisons.

The metaphysical equivalence of three and four dimensionalism

I argue that two competing accounts of persistence, three and four dimensionalism, are in fact metaphysically equivalent. I begin by clearly defining three and four dimensionalism, and then I show that the two theories are inter-translatable and equally simple. Through consideration of a number of different cases where intuitions about persistence are contradictory, I then go on to show that both theories describe these cases in the same manner. Further consideration of some empirical issues arising from the theory of special relativity lead me to conclude that the two theories are equally explanatory, and thus finally that they are metaphysically equivalent.

Equivalence of the Peleg, Pilosof and Singh-Kulshrestha models for water absorption in food

The similarity between the Peleg, Pilosof –Boquet–Batholomai and Singh–Kulshrestha models was investigated using the hydration behaviours of whey protein concentrate, wheat starch and whey protein isolate at 30 °C in 100% relative humidity. The three models were shown to be mathematically the same within experimental variations, and they yielded parameters that are related. The models, in their linear and original forms, were suitable (r2 > 0.98) in describing the sorption behaviours of the samples, and are sensitive to the length of the sorption segment used in the computation. The whey proteins absorbed more moisture than the wheat starch, and the isolate exhibited a higher sorptive ability than the concentrate.

Equivalence of physical and perceived speed in binocular rivalry

The relative dominance of gratings engaged in binocular rivalry can be influenced by their surroundings. One striking example occurs when surrounding motion is congruent with one but not the other grating (C. L. Paffen, S. F. te Pas, R. Kanai, M. J. van der Smagt, & F. A. Verstraten, 2004). However, such center-surround stimulus configurations can also modulate perceived speed, via a directionally tuned process (H. P. Norman, J. F. Norman, J. T. Todd, & D. T. Lindsey, 1996). We recorded rivalry for Gabor patches embedded in a drifting noise texture. Gratings whose directions opposed the background motion tended to dominate more, and vice versa, consistent with previous findings. Observers then matched the speed of a drifting noise-embedded Gabor to that of a Gabor surrounded by mean luminance. Surround motion produced substantial changes in perceived speed, by at least a factor of two for all observers. We then asked whether perceived speed could account for the contextual effects on dominance. We measured the effects of speed on rivalry dominance by changing the physical speeds of rivaling gratings, as determined by the matching data. We found the same pattern of dominance as for the context experiment, indicating that perceived and true speed influence rivalry in the same manner. We propose a Bayesian interpretation of the perceived speed illusion.

Effective knowledge transfer: a terminological perspective - Dismantling the jargon barrier to knowledge about computer security

The research is concerned with the terminological problems that computer users experience when they try to formulate their knowledge needs and attempt to access information contained in computer manuals or online help systems while building up their knowledge. This is the recognised but unresolved problem of communication between the specialist and the layman. The initial hypothesis was that computer users, through their knowledge of language, have some prior knowledge of the subdomain of computing they are trying to come to terms with, and that language can be a facilitating mechanism, or an obstacle, in the development of that knowledge. Related to this is the supposition that users have a conceptual apparatus based on both theoretical knowledge and experience of the world, and of several domains of special reference related to the environment in which they operate. The theoretical argument was developed by exploring the relationship between knowledge and language, and considering the efficacy of terms as agents of special subject knowledge representation. Having charted in a systematic way the territory of knowledge sources and types, we were able to establish that there are many aspects of knowledge which cannot be represented by terms. This submission is important, as it leads to the realisation that significant elements of knowledge are being disregarded in retrieval systems because they are normally expressed by language elements which do not enjoy the status of terms. Furthermore, we introduced the notion of `linguistic ease of retrieval' as a challenge to more conventional thinking which focuses on retrieval results.

On the Equivalence of the Riemann-Liouville and the Caputo Fractional Order Derivatives in Modeling of Linear Viscoelastic Materials

Mathematics Subject Classification: 26A33

Representing Equivalence Problems for Combinatorial Objects

Methods for representing equivalence problems of various combinatorial objects as graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorial objects. Moreover, there already exist well tested algorithms for the graph isomorphism problem (nauty) and the binary matrix isomorphism problem as well (Q-Extension). ACM Computing Classification System (1998): F.2.1, G.4.

Equivalence Between K-functionals Based on Continuous Linear Transforms

2000 Mathematics Subject Classification: 46B70, 41A10, 41A25, 41A27, 41A35, 41A36, 42A10.

An Elementary Core Equivalence Theorem in a Countable Economy

We consider an infinite exchange economy with countably many traders, which can be regarded as a natural extension of finite exchange economies to an infinite one. In our countable economy the core defined in the traditional manner would be empty. To avoid this unwanted situation we have to strengthen the notion of “improves upon”. We will achieve this based on the idea that forming coalitions involve costs.

Solving satisfiability, *implication, and equivalence problems in database systems

Satisfiability, implication and equivalence problems are important and widely-encountered database problems that need to be efficiently and effectively solved. We provide a comprehensive and systematic study of these problems. We consider three popular types of arithmetic inequalities, (X op C), (X op Y), and (X op Y + C), where X and Y are attributes, C is a constant of the domain of X, and op $\in\ \{{<},\ {\le},\ {=},\ {\not=},\ {>},\ {\ge}\}.$ These inequalities are most frequently used in a database system, since the first type of inequalities represents $\theta$-join, the second type represents selection, and the third type is popular in deductive databases. We study the problems under the integer domain and the real domain, as well as under two different operator sets.^ Our results show that solutions under different domains and/or different operator sets are quite different. In this dissertation, we either report the first necessary and sufficient conditions as well as their efficient algorithms with complexity analysis, or provide improved algorithms. ^

On the Equivalence between Assumption-Based Argumentation and Logic Programming

Postprint

A Frequency-Dependent Equivalence Between Groove Gap Waveguide and Rectangular Waveguide

Recently gap waveguides have been shown as a potential alternative to conventional waveguides in the millimeter-wave band. Groove Gap Waveguide (GGW) has until now been studied though direct correspondence with rectangular waveguide with the same propagation channel dimensions. However there have been observed differences in the above cutoff propagation characteristics between these waveguide types. Furthermore, the behaviour of GGW below cutoff remains unknown. This work presents a discussion of below and above cutoff propagation characteristics, and introduces a simple model that explains observed GGW behavior and establishes its propagation characteristics.

Behavioral equivalence of hidden k-logics: an abstract algebraic approach

This work advances a research agenda which has as its main aim the application of Abstract Algebraic Logic (AAL) methods and tools to the specification and verification of software systems. It uses a generalization of the notion of an abstract deductive system to handle multi-sorted deductive systems which differentiate visible and hidden sorts. Two main results of the paper are obtained by generalizing properties of the Leibniz congruence — the central notion in AAL. In this paper we discuss a question we posed in [1] about the relationship between the behavioral equivalences of equivalent hidden logics. We also present a necessary and sufficient intrinsic condition for two hidden logics to be equivalent.