The PEP-N project is a proposed new e+e− collider at SLAC to operate in the center of mass energy range of 1.0 GeV to 3.1 GeV. PEP-N consists of a new Very Low Energy electron Ring VLER (< 800 MeV) to collide with the PEP-II e+ Low Energy Ring LER (3.1 GeV) parasitically to PEP-II operation for BaBar. Since the e+ ring has a fixed energy, the very low energy ring needs an energy range of 100 Me...

In order to investigate the single-beam vertical beam-size blow-up observed[1] in the KEKB 3.5 GeV positron ring (LER), we performed beam-size observations using a highspeed gated camera capable of recording the image of a single bunch in the ring. Using this technique, we measured the beam-size dependence on bunch position along a train, and studied the onset of blow-up under various condition...

We have performed 3D PIC simulations for PEP-II, SuperKEKB and KEKB parameters by using SLAC[1], LBL[3] and KEK[2] code. Input parameters for PEP-II, SuperKEKB and KEKB are listed in table 1, 2, 3, respectively. The simulation results are shown in Fig. 1, 2, 3 and 4. These results are in reasonable agreement. For PEP-II parameter at the LER horizontal tune of 0.5125, Luminosity by KEK code is s...

Merging of Label Switched Paths (LSPs) saves label space and reduces processing time in routers. We introduce two distributed merging algorithms for online LSP merging.

Comparing process models and matching similar activities has recently emerged as a research area of business process management. However, the problem is fundamentally hard when considering realistic scenarios: e.g., there is a huge variety of terms and various options for the grammatical structure of activity labels exist. While prior research has established important conceptual foundations, r...

We propose a new local community detection algorithm, which finds communities by identifying borderlines between them using boundary nodes. We apply a modified version of label propagation for community detection that uses the number of common neighbors for deciding community label of each node. Our algorithm is fast and finds communities accurately. It outperforms other algorithms especially w...

Various applications of MPLS make use of label stacks with multiple entries. In some cases, it is possible to replace the top label of the stack with an IP-based encapsulation, thereby enabling the application to run over networks that do not have MPLS enabled in their core routers. This document specifies two IP-based encapsulations: MPLS-in-IP and MPLS-in-GRE (Generic Routing Encapsulation). ...

In hierarchical-design experiments researchers need to test for nested effects, but sometimes parametric assumptions are violated. We show that the Kruskal-Wallis (K-W) rank test can be extended to test for such effects. Let B = b1 . . . bh be the tested effect, and A = a1 . . . ag be the effect immediately above it in the hierarchy. If one calculates separate K-W statistics for the effect B at...

The goal of traditional multi-instance learning (MIL) is to predict the labels of the bags, whereas in many real applications, it is desirable to get the instance labels, especially the labels of key instances that trigger the bag labels, in addition to getting bag labels. Such a problem has been largely unexplored before. In this paper, we formulate the Key Instance Detection (KID) problem, an...

We present a full-3D statistical analysis of line edge roughness (LER) in sub0.1 μm MOSFETs. The modelling approach for line edges and the parameters used in the analysis take into account the statistical nature of the roughness. The results indicate that intrinsic fluctuations in MOSFETs due to LER become comparable in size to random dopant effects and can seriously inhibit scaling below 50 nm.