No abstract uploaded!

We discuss a general parametrization for vertices of quantum graphs and show, in particular, how the 's and 'couplings at an n-edge vertex can be approximated by means of n+ 1 couplings of the type provided the latter are properly scaled.

In this paper we investigate the operator H=??(??) in L2 (R2), where> 0 and? is a closed C4 Jordan curve in R2. We obtain the asymptotic form of each eigenvalue of H as tends to in nity. We also get the asymptotic form of the number of negative eigenvalues of H in the strong coupling asymptotic regime. MSC: 35J10, 35P15

In this paper, we discuss some partitions of affine flag varieties. These partitions include as special cases the partition of affine flag variety into affine Deligne-Lusztig varieties and the affine analogue of the partition of flag varieties into $\cb_w (b) $ introduced by Lusztig in\cite {L1} as part of the definition of character sheaves.

This paper considers a proportional hazards model, which allows one to examine the extent to which covariates interact nonlinearly with an exposure variable, for analysis of lifetime data. A local partial-likelihood technique is proposed to estimate nonlinear interactions. Asymptotic normality of the proposed estimator is established. The baseline hazard function, the bias and the variance of the local likelihood estimator are consistently estimated. In addition, a one-step local partial-likelihood estimator is presented to facilitate the computation of the proposed procedure and is demonstrated to be as efficient as the fully iterated local partial-likelihood estimator. Furthermore, a penalized local likelihood estimator is proposed to select important risk variables in the model. Numerical examples are used to illustrate the effectiveness of the proposed procedures.

0. Introduction. Let Mn be a n-dimensional minimally immersed submanifold of M, Q> 1. Throughout this paper M is taken to be one of the simply connected space forms with curvature 1, 0, or-1, ie Mfn+ f sn+ f, Rn+ f, or Hn+ f. Given a point p EM, let rp (x) be the dis-tance function on M, we denote the restriction of rp to M as the extrinsic distance function on M. For any a> 0, we define the extrinsic ball cen-tered at p with radius a by

In this short survey paper, we shall discuss certain recent results in classical gravity. Our main attention will be restricted to two topics in which we have been involved; the positive mass conjecture and its extensions to the case with horizons, including the Penrose conjecture (Part I), and the interaction of gravity with other force fields and quantum-mechanical particles (Part II).

Let M be the interior of a compact 3-manifold with boundary, and let M be an ideal triangulation of M This paper describes necessary and sufficient conditions for the existence of angle structures, semi-angle structures and generalised angle structures on M respectively in terms of a generalised Euler characteristic function on the solution space of the normal surface theory of M This extends previous work of Kang and Rubinstein, and is itself generalised to a more general setting for 3-dimensional pseudo-manifolds.

MIFARE Classic is the world’s most widely deployed RFID (radio-frequency identification) technology. It was claimed to be cryptographically protected by the proprietary Crypto-1 stream cipher. However, it proved inadequate after weaknesses in the design and implementation of Crypto-1 and MIFARE Classic started surfacing since late 2007 [7, 8, 12–17]. Some operators of MIFARE Classic-based systems reacted by upgrading to more secure alternatives such as MIFARE DESFire. However, many (especially in Asia) opted to “patch” MIFARE Classic instead. Their risk analysis might have gone as follows: “The most serious threat comes from efficient card-only attacks, where the attacker only needs an off-the-shelf reader and a PC to tamper a target tag. All efficient card-only attacks depend on certain implementation flaws. Ergo, if we just fix these flaws, we can stop the most serious attacks without an expensive infrastructure upgrade.” One such prominent case is “EasyCard 2.0,” today accepted in Taiwan as a means of electronic payment not only in public transportation but also in convenient stores, drug stores, eateries, cafes, supermarkets, book stores, movie theaters, etc. Obviously, the whole “patching” approach is questionable because Crypto-1 is fundamentally a weak cipher. In support of the proposition, we present a new card-only attack based on state-of-the-art algebraic differential cryptanalytic techniques [1, 2]. Still using the same cheap reader as previous attacks, it takes 2–15 min of computation on a PC to recover a secret key of EasyCard 2.0 after 10–20 h of data collection. We hope the new attack makes our point sufficiently clear, and we urge that all MIFARE-Classic operators with important transactions such as electronic payment upgrade their systems to the more secure alternatives soon.

No abstract uploaded!