The Role of Radical Bridges in Polynuclear Single-Molecule Magnets

Employing radical bridges between anisotropic metal ions has been a viable route to achieve high-performance single-molecule magnets (SMMs). While the bridges have been mainly considered for their ability to promote exchange interactions, the crystal-field effect arising from them has not been taken into account explicitly. This lack of consideration may distort the understanding and limit the development of the entire family. To shed light on this aspect, herein we report a theoretical investigation of a series of N -radical-bridged diterbium complexes. It is found that while promoting strong exchange coupling between the terbium ions, the N -radical induces a crystal field that interferes destructively with that of the outer ligands, and thus reduces the overall SMM behavior. Based on the theoretical results, we conclude that the SMM behavior in this series could be further maximized if the crystal field of the outer ligands is designed to be collinear with that of the radical bridge. This conclusion can be generalized to all exchange-coupled SMMs.     

On a stochastic nonlinear equation in one-dimensional viscoelasticity

In this paper we discuss an initial-boundary value problem for a stochastic nonlinear equation arising in one-dimensional viscoelasticity. We propose to use a new direct method to obtain a solution. This method is expected to be applicable to a broad class of nonlinear stochastic partial differential equations.

     

Some formulae for the q-Bernoulli and Euler polynomials of higher order

The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).     

Wechselnde Bindungen in einem Zweikörpersystem mit trockener Reibung

Übersicht Betrachtet wird ein zwangserregtes Zweikörpersystem mit wechselnden Bindungen infolge trockener Reibung. Stationäre Bewegungen werden als Grenzfall instationärer Einschwingvorgänge berechnet. Abhängig von den Systemparametern ergeben sich drei typische Bewegungsformen. Ihnen entsprechen dauernde Haftzustände, wechselnde Haft-Gleitzustände oder dauernde Gleitzustände an der Berührfläche beider Körper.

---

Intermittant constraints in a two-body-system with dry friction

Summary An externally excited two-body-system with intermittant constraints due to dry friction is considered. Stationary motions are calculated as limit cases of instationary transients. Depending on the parameters of the system, three typical modes are of interest. These correspond to permanent sticking, slipstick behaviour, or to permanent slipping in the contact surface of the bodies, respectively.

     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fuzzy convex sets in median algebras

The fuzzification of convex sets in median algebras is considered, and some of their properties are investigated. A characterization of finite valued fuzzy convex set is given.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005