### 1 †

: 518() 13:3014:45

ֱ : Brian H. Bowditch (University of Southampton)

: W 1008 漼

: The geometry of the curve complex and hyperbolic 3-manifolds

:

The curve complex associated to a surface was introduced by Harvey around 1980. Its geometry is closely related to that of Teichmuller space. It has been used by various authors to study the mapping class groups and is central to the work of Minsky and his coworkers towards proving Thurston's ending lamination conjecture. We shall give a brief survey of some of this work, and explain how ideas from 3-manifold theory can be fed back into the study of surfaces.

### 2 †

: 616() 17:0018:00

ֱ : Raphael Hauser (Oxford University Computing Laboratory and Pembroke College Oxford)

: W 809 漼

: On the distribution of condition numbers for random polyhedral feasibility problems

:

The tail decay analysis of condition numbers yields an elegant unified way to investigate the average running time behaviour of interior-point methods for random conic feasibility problems. In this talk we present the best upper and lower bounds known for the case of Gaussian input matrices and polyhedral cones, and then we show that for more general input distributions there exists a simple natural parameter that determines the decay behaviour of the associated condition number.

### 3 †

: 617() 11:00am-12:00

ֱ : Ben Wang (JBoss Inc.)

: W10 1008 漼ܥ졼롼

: JBossCache with Fine-Grained Replication and a Use Case for Http Session Replication

:

JBossCache is an open-source replicated and transactional cache with optional persistence storage. One particular aspect of JBossCache is the use of AOP (aspect-oriented programming) to perform fine-grained field-level POJO replication (JBossCache-Aop). In addition to fine-grained capability, JBossCache-Aop also supports transparent object-oriented features such as: object graph, relationship, inheritance, and polymorphism in the replication level. As a result, JBossCache-Aop is particularly suited for http session replication implementation when a user-specified object has complex object graph and relationship that needs fine-grained replication constantly. This presentation will cover the introduction for JBossCache and JBossAop first. Then we will address details of JBossCache-Aop component for fine-grained replication. We will also look at examples of how object graph is handled in the replication layer. Finally, we will illustrate a use case to implement the latest JBoss/Tomcat http session replication using JBossCache.

### 4 †

: 624() 15:30-

ֱ : Kazimierz Goebel

: W 1008 漼

: An overview of the optimal retraction problem

:

Since 1983, it is known that for any Banach space $X$ of infinite dimension, the unit sphere $S$ is a lipschitzian retract of the unit ball $B$. It means that there exists a mapping $R: B \to S$ such that $R\vert _S = \mathrm{id}$ satisfying Lipschitz condition

$\displaystyle \Vert Rx - Ry\Vert \leq k \Vert x - y\Vert$

with sufficiently large'' Lipschitz constant $k$.

There are many partial results scattered in the literature telling how big this constant should be for particular classical Banach spaces.

However, the exact value of minimal possible $k$ remains unknown even for such spaces like $C[0, 1]$, $c_0$, $H$, $l^1$, $\dotsc$.

In this talk the general informations about the problem will be given together with some new examples.

### 5 †

: 627() 15:00-16:00

ֱ : Marc-Olivier Killijian (LAAS France)

: ۣļ

: Towards a Middleware for Mobile Systems Availability, Integrity and Confidentiality

:

We present the MoSAIC project whose goal is to explore dependability issues of mobile applications at the middleware level. This project is studying new fault tolerance and security mechanisms for mobile wireless devices in ambiant intelligence applications focusing on sparse self- organized networks, using mostly one-hop wireless communication. More specificaly, MoSAIC aims at providing a collaborative backup system for mobile devices relying on collaboration among peers to provide data backup and recovery. In the talk, after identifying the expected dependability properties for such a middleware service, we survey peer-to-peer collaborative backup systems from the litterature and identify mechanisms relevant to the mobile environment. We conclude on the specificities of this environment and identify future research directions.

### 6 †

: 726() 13:10-15:00

ֱ : Phil Papadopoulos (San Diego Supercomputer Center)

: W 809 漼

: Bandwidth to Burn

:

The Biomedical Informatics Research Network (BIRN)* is creating, extending, and deploying a production grid to enable groups of biomedical researchers to share complex and large-scale imaging data. We will describe the BIRN, its structure, overall Information Technology Structure and focus on how BIRN stretches networks.

OpTIputer* is a five Year research project the asks the fundamental question: "What happens to the design Of distributed systems and codes when network bandwidth becomes infinite?" BIRN and more specifically, 3-D tomographic reconstruction of microscope images, are critical application drivers for the development of OptIPuter. In this talk we will describe the evolving all-campus optIPuter fabric on the UCSD campus, the introduction of dense-wave division multiplexing within the network that interconnects 500+ nodes, and key issues that we are tackling within opTIputer to meet the performance needs of BIRN and other next-generation eScience applications. All labs on campus are connected at 10Gigbits with a private fiber infrastructure and these per-lab links are continually enhanced over the project lifetime. OptIPuter also extends beyond the campus border with a private 10gigabit network (Called the Cavewave) to the our major OptIPuter partner at the Electronics Visualization Lab at the University of Illinois, Chicago. In this talk, we will look at a variety of early performance measurements for both campus and national networks.

We will conclude with some thoughts on how immense bandwidth will have a profound effect on e-science as we know it. We are already seeing significants signs of this in BIRN and other projects.

BIRN is funded by the U.S. National Institutes of Health and integrates science teams across more than 20 institutions to share and federate 3-dimensional medical image data. BIRN uses a top-down deployment strategy with careful attention to data privacy, integration and data transfer performance. BIRN Science team test beds include multi-scale, analysis of mouse neuro anatomy (the Mouse BIRN), morphometric comparisons of human brains (the Morph BIRN.

OptIPuter is five year information technology research (ITR) grant through the United States National Science Foundation. Half a dozen partner institutions make up a large interdisciplinary team. The IP in Optiputer stands for Internet Protocol with a nod that optiputer retains the use of IP as a basic interoperability protocol, but may choose other higher-level protocols.

### 7 †

: 729() 13:20-14:50

ֱ : Ϻ ()

: W 809 漼

: §դʬ󵢤Υѥȥåץߥ󥰤ˤʬѥο

:

ʬϤŪѿXȱѿYŪʴط򵭽Ҥ뤳ȤǤ. ǾˡˤʬϤϾʿѴؿοԤ, ʣξʬؿꤹ뤳Ȥˤ, XYΤܺ٤ʴط򵭽Ҥ뤳ȤǤ. ʬؿο̤Ȥʬ(Quantile Regression)ȸƤФΤƤ¿δϢ椬ʤƤ. ֱܹǤ󼡤§դΥΥѥȥåʬ󵢤ˤĤƹͻ. ο̤ϥݡȥ٥ȥޥʬǸ褦󼡷ײ˵夵. ʣξʬ(㤨, q = 0.1, 0.2, ..., 0.9 ʬ)ꤹˤϤ줾Ф󼡷ײɬפ,絬ϤФƤʷ׻֤ɬפȤ. ֱܹǤϾ嵭ʬ󵢤򤹤٤Ƥʬ 0 < q < 1 ˴ؤƷ׻륢르ꥺҲ𤹤. ʬqѥ᡼Ȥѥȥåץߥ󥰤ˤ, 嵭󼡷ײѿq˴ؤƶʬǤ뤳Ȥ򼨤. ѤȤ٤Ƥʬ˴ؤ̤β®˷׻Ǥ. ޤ, ܥ르ꥺϾʬP(Y|X)Τ٤ƤʬꤷƤ뤳ȤP(Y|X)ΥΥѥȥå̤ȤߤʤȤǤ. ܥ르ꥺ, P(Y|X) ʬ۴ؿʬؿȤ, ̩ٴؿʬؿȤɽ롥

### 8 †

: 1118() 16:30-17:30

ֱ : ƣ ()

: W809

: Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm

:

Bertsimas&Popescu(2002) ϡ񻺤μΨ˴ؤ n ĤΥ⡼ȤͿƤȤˡλ񻺤򸶻񻺤Ȥ衼ԥ󡦥롦ץΥȤʾ꤬ͤȾͷײSDPˤȤ꼰Ǥ뤳Ȥ򼨤ܸǤ꼰򥿥Ȥʲͤ˳ĥȾͷײȤƤ꼰ͿƱˡ줿SDP򤯤ڽʿ̤Ѥñʥ르ꥺҲ𤹤롣⡼Ȥο6,7٤ǤС르ꥺǸΨŪ˷׻Ǥ뤳Ȥ׻̤ˤäƼ

### 9 †

: 12 7() 14:00 - 15:00

ֱ : ¼ (ı)

: W1008

: Υ̲ϤѤޥå󥰥ǥ

:

Gale-Shapleyˤ뺧ǥShapley-Shubikˤǥ줷ǥƤˤΥ̲Ϥ濴Ū餺Υ̴ؿѤ뤳Ȥǳĥ롥Τ褦ʳĥˤäƤ pairwise-stable outcome¸ߤݾڤ뤳Ȥ̤Ǥ롥

### 10 †

: 12 7() 16:00 - 17:00

ֱ : ë δ ()

: W1008

: ˡȥǡ

:

ֱܹǤ, ˡȥǡϤ˴ϢʲΣĤˤĤƾҲ𤹤.

1. ˡȳΨŪץ󥰤ˤХȺŬӺˡˤ Хǽ

2. ﲼǤ log det ؿŤդº粽Τμˡ르ꥺȤΥեǥ, ̩ٴؿؤα

### 11 †

: 1 25() 13:20-14:50

ֱ : Chunwei Song (Peking University칩)

: W1008

: Higher Catalan and Schrder Theories in Lattice Path Combinatorics

:

While classical Catalan and Schrder theories have both been extensively studied, people have just begun to investigate higher dimensional versions (see, for instance, the 1991 paper of Hilton and Pedersen, and the 1996 paper of Garsia and Haiman). In this talk we introduce two more general cases: Permutation paths, which are counted by n!, having Dyck paths as a subset; m- Schrder paths, which reduce to the ordinary Schrder paths when m=1, and we derive the number of such paths. We prove that a natural bijection between the symmetric group and Permutation paths that exchanges inversion and area statistics simultaneously maps 312- avoiding permutations to Dyck paths. Hoping to generalize classical q-analogue results of the ordinary Catalan and Schrder numbers, such as in the works of Frlinger/Hofbauer, Cigler, and Bonin/Shapiro/Simion, we obtain a q-identity on m-Schrder paths which would welcome a combinatorial interpretation.