Dalian University of Technology and Inha University The 4 Joint Workshop in Mathematics and Software

ruralrompΛογισμικό & κατασκευή λογ/κού

2 Δεκ 2013 (πριν από 3 χρόνια και 9 μήνες)

72 εμφανίσεις






Dalian Univ
ersity
of Tech
nology

and Inha University

The

4
th

Joint Workshop in Mathematics and Software






Date:


Nov 22

25
,
201
2


Hosted by
: School of Mathematical Sciences and School of Software

Technology
, Dalian
University of Technology


Invited

Sp
eakers

from
Inha University,
Korea:



Professor Sang

Tae
JEONG
, Department of Mathematics, Inha University



Professor Hyeon

B
ae
KANG

Department of Mathematics, Inha University



Professor Do

Wan
KIM
, Department of Mathematics, Inha University



Professor
Yoon

W
eon
LEE
, Department of Mathematics, Inha University



Professor
Yong

J
in
SONG
, Department of Mathematics, Inha University



Professor

Y
k
Kwon
YIE
, Department of Mathematics, Inha University



Professor Dae

Hun
NYANG
, Department of computer Science, Inha University



Professor In Kyu P
ARK

School of Information and Communication Engineering
, Inha
University


Scientific Committee:

Ren

H
ong W
ANG
,

Chair, Dalian University of Technology

Yu

F
eng L
U
, Dalian University of Technology

Bo Y
U
,
Dalian University of Technology


Zhong

X
uan L
UO
,
Dalian University of Technology


Yong

J
in S
ONG
,
Inha

University

Hyeon

B
ae K
ANG
,
Inha

University


Organizing Commit
tee:

Zheng

G
uo J
IN
, Chair,
Dalian University of Technology


Feng

C
hun L
EI
,
Dalian University of Technology


He J
IANG
,
Dalian University of Technology


Hua

D
ong Y
U
, Dalian University of Technology

Jian

K
ui Z
HANG
, Dalian University of Technology

You

F
a H
AN
,

Liaon
ing Normal University


Supported in part by:

International Office, Dalian University of Technology;

School of Mathematical Sciences, Dalian University of Technology;

School of Software

Technologe
, Dalian University of Technology




Program



Time T
able

Nov
ember

23
,
Friday


Place:
Conference Room
in Library

图书馆
多功能厅

,

Main Campus

T
im
e

S
peaker

C
hairman

9
:
0
0

9
:
1
0 AM

Opening Cer
e
mony

9:10

9:40 AM

Hyeon

B
ae KANG

Bo YU

9:40

10:10 AM

Feng

Q
uan LI

10:10

10:30 AM

T
aking P
hotos

Coffee and Tea T
ime

10:30

11:00 AM

Do

Wan K
IM

Yong

J
in S
ONG

11:00

11:30 AM

Song

X
in

LIANG

11:30

12:00 AM

Yoon

W
eon L
EE

12:00

1:30

Lunch Time

1:30

2:00 PM

Yong

J
in S
ONG

Feng

C
hun L
EI

2:00

2:30 PM

Xi

M
in LIU

2:30

2:50 PM

Coffee and Tea
T
ime

2:50

3:
2
0 PM

Yk
Kwon Y
IE

Hyeon

B
ae K
ANG

3:
2
0

3:
5
0 PM

Li

W
ei ZHANG

3
:
5
0

4
:
1
0 PM

Coffee an
d Tea
T
ime

4:
1
0

4:
4
0 PM

Sang

Tae JEONG

Li

W
ei Z
HANG

4:
4
0

5:
1
0 PM

Ji

Z
hu N
AN

6:00

8:00 PM

Banquet




Nov
ember

2
4
, S
atur
day Mor
n
ing

Place:
Lecture Hall, Software Campus

T
ime

S
peaker

chairman

9:10

9:40 AM

In

Kyu P
ARK

Zhong

X
uan LUO

9:40

10:10 AM

Guo

W
ei WU

10:10

10:30 AM

Coffee and Tea T
ime

10:30

11:00 AM

Xin HAN

In

Kyu PARK

11:00

11:30 AM

Dae

Hun N
YANG

11:30

12:00 AM

He JIANG

12:00

1:0
0

Lunch Time



November 2
4
, S
atur
day
Afternoon

1:00

5:
3
0 PM
:
Local
Sight Seeings

6:00

8:00 PM
:
Dinner









Schedule

Nov
ember

22
,
Thursday
:
Arriving


Nov
ember

23
,
Friday

Place:
Conference Room in Library

图书馆
多功能厅

,

Main Campus



9:0
0

9
:
1
0

AM Opening


Cer
e
mony



9:
1
0

9
:
4
0 AM

Speaker
:
Hyeon

B
ae KANG


Title:

Generalized Polarization Tensors for Imaging and Cloaking



9
:
4
0

10:
1
0 AM

Speaker
:
Feng

Q
uan LI

Title:

The fast diffusion equation with integrable dat
a

with respect to the distance to the boundary



10:
1
0

1
0
:
3
0 AM,
Taking photos,
Coffee and Tea time



1
0
:
3
0

11:
0
0 AM

Speaker
:

Do

Wan K
IM


Title:

Immersed Boundary Method Using Meshfree Discrete Forcing



11:00

11:30 AM

Speaker
:

Song

X
in LIANG

Title:

Root classif
ications of real parametric polynomials




1
1
:30

1
2
:00 AM

Speaker
:

Yoon

W
eon L
EE


Title:

Gluing formula of the Refined analytic torsion





12:00

1:30
Lunch Time




1:30

2:00 PM

Speaker
:
Yong

J
in S
ONG


Title:

The generalized braid groups and their imbedding in
the mapping class groups



2:00

2:30 PM

Speaker
:
Xi

M
in LIU



Title:

Nonsmoothable $
\
mathbb{Z}_3$
-
actions on

spin 4
-
manifolds




2:30

2:50 PM,
Coffee and Tea time



2:50

3:20 PM

Speaker
:
Yk
Kwon YIE

Title

Computing square roots in characteristic two



3:20

3:50 P
M

Speaker
: Li

W
ei Z
HANG



Title

A Smooth Monte Carlo Approach

to Joint Chance Constrained Programs



3:50

4:10 PM,
Coffee and Tea time



4:10

4:40 PM

Speaker
:
Sang

Tae JEONG

T
itle:

Characterization of ergodicity of
I
-
adic maps on the power series ring in

one variable over the
binary field using digit derivatives




4:40

5:10 PM

Speaker
:
Ji

Z
hu NAN


Title

Augmentation Quotients of Some Classical Groups




6:00

8:00 PM Banquet








November

24
, Saturday Morning

Place:
Lecture Hall, Software Campus




9:
1
0

9
:
4
0 AM

Speaker
:
In

Kyu PARK


Title:


MRF optimization using massive parallel processing on GPU



9
:
4
0

10:
1
0 AM

Speaker
:
Guo

W
ei WU

Title:


Guaranteeing Fault Tolerant Requirement Load Balancing Scheme Based on VM Migration




10:
1
0

1
0
:
3
0 AM,
Coffee and Tea tim
e




1
0
:
3
0

11:
0
0 AM

Speaker
:
Xin HAN

Title
:
Online Minimum Makespan Scheduling with a Buffer



11:
0
0

1
1
:
3
0

Speaker
:
Dae

Hun NYANG

Title
:
Anonymous Authentication and Session Binding



11:
3
0

1
2:0
0

Speaker
:

He JIANG

Title
:
Mining Bug Repositories




12:00

1:00
Lunch Time


November 2
4
, Saturday Afternoon




1:00

5:
3
0 PM Free time (Local sight seeing)



6
:
0
0

8:00 PM
Dinner


November 25
,
Sun
day
:
Departure












ABSTRACTS

Sang

Tae

J
EONG

(
Department

of

Mathematics,
Inha University,
Number Theory)

Title:
Charac
terization of ergodicity of
I
-
adic maps on the power series ring

in one variable over the
binary field using digit derivatives

Abstract:

In this talk, we will introduce the ergodic theory of
I
-
adic dynamical systems and then discuss
the parallel theory f
or function fields and present another characterization of ergodicity of
I
-
adic maps
on

F_2[[x]] in terms of the expansion of digit derivatives.


Hyeon

B
ae

K
ANG

(
Department

of

Mathematics,
Inha University
, Inverse Problems, Applied

Mathematics)

Title:

G
eneralized Polarization Tensors for Imaging and Cloaking


Do

Wan

K
IM

(
Department

of

Mathematics,
Inha University
, Applied Mathematics)

Title:

Immers
ed Boundary Method Using Meshfree Discrete Forcing

Abstract:

This talk contains three issues. We first

consi
der the immersed boundary

method (IBM) for
solving fluid
-
structure interaction. It becomes one of

leading computational methods in fluid
mechanics. Second, we focus on an implementation of

discrete forcing in

IBM which is a state
-
of
-
the
-
art method recentl
y. Third, we consider

the meshfree method

to approximate

the velocity and pressure

of

the flow. Combining all together,

a new method can be

developed for solving flow problems without
employing the staggered

type of discretization.


Yoon

W
eon

L
EE

(
Departme
nt

of

Mathematics,
Inha University,

Topology and Analysis)

Title:

Gluing formula of the Refined analytic torsion

Abstract:

The refined analytic torsion was introduced by M. Braverman and T. Kappeler in 2000

s on an odd dimensional closed Riemannian manifol
d with a flat bundle as an analytic analogue of the re
fined combinatorial torsion introduced by M. Farber and V. Turaev. The refined analytic torsion is a globa
l spectral invariant defined by the spectrum of the odd signature operator. When the odd
signatu
re opera
tor is self
adjoint and invertible, the refined analytic torsion is a complex number
, whose modulus part is t
he Ray
Singer analytic torsion and the phase part is the eta invariant. In this talk, we discuss the boundary

value problem and the gluing fo
rmula of the refined analytic torsion when the odd signature operator is

self
-
adjoint and all the cohomologies vanish.



Dae

Hun

N
YANG

(Department

of

Computer Science,
Inha University,
Computer security, Cryptology)

Title:
Anonymous Authentication and Sess
ion Binding


Abstract
:
In this paper we propose anonymity
-
based authentication and key agreement protocols where
no participant's identity is revealed. The proposed protocols guarantee that a verifii er can con firm that
an anonymous participant

has not tu
rned over a session to another anonymous participant while

connecting to the veri er and also a session hijacking does not happen.

Our approach is to use an
anonymous signature scheme with a signer
-
controlled yet partially enforced linkability. We formally

prove that the constructed protocols are secure.


In

Kyu

P
ARK

(
School of Information and Com
m
unication

Engineering
,
Inha University)

Title:
MRF optimization using massive parallel processing on GPU

Abstract:

MRF (Markov random field) optimization is wide
ly used in many areas in computer vision
and image processing since it effectively minimizes the cost function defined on a graphical model.
Graph cut and belief propagation are the most popularly used techniques to this end. However, it usually
takes long

time in computation and convergence which hinders using it in real time applications. In this
talk, I will introduce how MRF (Markov random field) optimization techniques can be modeled and
implemented on a massive parallel processing framework on GPU (gr
aphics processing units). The
impact is exemplified by a well
-
known application, i.e. binocular stereo matching.


Yong

J
in

S
ONG

(
Department

of

Mathematics,
Inha University
, Topology)

Title:
The generalized braid groups and their imbedding in the mapping cl
ass groups



Abstract:

The braid group embeds in the mapping class groups in various ways. Some imbedding are
geometric, on the other hand, some are not. We extend these imbeddings to the generalized braid groups
and determine whether they are geometric or n
ot. We use some
categorical
delooping technique.


Yk

Kwon

Y
IE

(
Department

of

Mathematics,
Inha University
, Algebraic Geometry and Cryptology)

Title:

Computing square roots in characteristic two

Abstract:

I will discuss a few ways of computing square roots
in finite fields of characteristic two and
compare their efficiency. I will also discuss decoding of Goppa codes in which computing square roots is
a critical step.


Li

W
ei

ZH
ANG

(
School of Mathematical Science
s
, DUT
,
)

Title
:
A Smooth Monte Carlo Approach

to Joint Chance Constrained Programs

Abstract
:
We study joint chance constrained programs (JCCPs). JCCPs are often non
-
convex and

non
-
smooth, and thus are generally challenging to solve. In this paper, we propose a logarithm
-
sum
-
exponential smoothing tech
nique to approximate a joint chance constraint by the difference

of two
smooth convex functions and use a sequential convex approximation algorithm, coupled

with a Monte
Carlo method, to solve the approximation. We call our approach a smooth Monte

Carlo app
roach. We
show that our approach is capable of handling both smooth and non
-
smooth JCCPs where the random
variables can be either continuous or discrete or mixed. The

numerical experiments further confirm our

ndings.


This is a joint work with
Zhaolin Hu

a
t
School of Economics and Management, Tongji University

and
L. Jeff Hong

at
Department of Industrial Engineering and Logistics

Management
,
The Hong Kong
University of Science and Technology
.


Xi

M
in
L
IU

(
School of Mathematical Science
s
, DUT
, Topology
)

Titl
e:

Nonsmoothable $
\
mathbb{Z}_3$
-
actions on

spin 4
-
manifolds

Abstract
:
In this talk, by considering the Kirby
-
Siebenmann invariant and the Rochlin


Invariant,


we
constructed some nonsmoothable $
\
mathbb{Z}_3$
-
action on spin 4
-
manifolds.


Ji Zhu
N
AN

(
School
of Mathematical Science
s
, DUT
, Algebra
)

Title:

Augmentation Quotients of Some Classical Groups

Abstract

Let $K$ be a finite field, let $G$ be the general linear group

(the

special linear group, the
unitary group, the symplectic group and

the orthogonal group, etc.) over $K$, and let $ZG$ be the
integral

group ring and $
\
triangle(G)$ the augmentati
on ideal of $ZG$. In

this paper, we discuss the
consecutive quotients

$Q_{n}(G)=
\
triangle^{n}(G)/
\
triangle^{n+1}(G)$ of the classical

group over finite
fields and completely determine the structure of

such consecutive quotient groups.


Feng Quan
L
I

(
School

of Mathematical Science
s
, DUT
, Applied mathematics
)

Title:

The fast diffusion equation with integrable data

with respect to the distance to the boundary

Abstract
:
In this paper, we study the existence, uniqueness

and regularity of very weak solutions to t
he
following fast diffusion

equations with integrable data with respect to the distance to the

boundary.

$$

(P)
\

\
left
\
{

\
begin{array}{ll}

\
frac{
\
partial{u}}{
\
partial{t}}
-
\
Delta(|u|^{m
-
1}u) =f &
\
mbox{in } Q,
\
\

u=0 &
\
mbox{on }
\
Sigma,
\
\

u(x,0)=u_0 &
\
mbox
{in }
\
Omega,

\
end{array}

\
right.

$$

where $
\
Omega$ is a bounded open subset of

$R^N(N
\
ge 2)$ with smooth boundary $
\
partial
\
Omega$ and $T>0$, $Q=
\
Omega
\
times(0,T)$, $
\
Sigma$ denotes the lateral surface of $Q$, $f
\
in

L^1(Q,
\
delta)$, $u_0
\
in L^1(
\
Omega,
\
delta)$, $
\
delta(x)=
\
mbox

{distance}(x,
\
partial
\
Omega), 1
-
\
frac{2}{N+1}<m<1$.







Song

X
in
L
IANG


(
School of Mathematical Science
s
, DUT
, Computing mathematics
)

Title

Root classifications of real parametric polynomial
s

Abstract:
Given a polynomial p(x) with real parametric coefficients, the complete root classification of

p(x) is a collection of all the possible root classifications, together with the corresponding conditions on

the parametric coefficients. In this ta
lk, an effective algorithm for computing the complete root

classification of a real parametric polynomial is given, and the case of quartic polynomials is investigated
thoroughly.


Xin
H
AN

(School of Software

Technologe
,
DUT,
Algorithm)

Title:
Online Min
imum Makespan Scheduling with a Buffer

Abstract:

In this
talk

we study an online minimum makespan scheduling problem with a reordering
buffer.

We obtain the following results, which improve on work from FOCS 2008:i) for m identical
machines, we give a 1.5
-
competitive online algorithm with a buffer of size 1.5m, which is better than the
previous best result : 1.5
-
competitive algorithm with a buffer of size 1.6197m; ii) for three identical
machines, to give an optimal online algorithm we reduce the size of th
e buffer from nine to six; iii) for m
uniform machines, using a buffer of size m, we improve the competitive ratio from 2+
\
epsilon to 2
-
1/m+
\
epsilon, where
\
epsilon >0 is sufficiently small.


Guo

W
ei

W
U

(School of Software

Technologe
,

DUT,
Pervasive Comput
ing and Embedded Systems
)

Title:

Guaranteeing Fault Tolerant Requirement Load Balancing Scheme Based on VM Migration

Abstract:


Virtualization technology is an important issue in the datacenter of the cloud

computing,
and virtual machine (VM) migration pla
ys a key role in the load

balancing among the hosts of the
datacenter. However the exiting load balancing

schemes based on VM migration have significant
influence on the fault
-
tolerant

level of the services in the datacenter, and thus the reliability of th
e
services will

be reduced. To guarantee the reliability of the services, a novel guaranteeing fault

tolerant
requirement load balancing scheme (GFTLBS) is proposed. It migrates

the VMs to balance the load
without violating the fault
-
tolerant requirement o
f all

services. The simulation demonstrates that the
scheme can guarantee the fault
-
tolerant requirements of all services while balancing the load by
migrating VM

among all the hosts in the datacenter.


He

J
IANG

(
School of Software

Technologe
,

Computationa
l Intelligence and Software Engineering)

Title:

Mining Bug Repositories

Abstract:

Software bug repositories are large
-
scale databases in software development and

maintenance.
The goal of

mining bug repositories is to solve software problems around bug repo
sitories by mining bug

data.
In this talk, we first present the main process of mining software repositories. Then, we present
some recent results in this area, including semi
-
supervised bug triage, developer
prioritization
, and
r
equirements repository tra
nsfer
. In addition, we also discuss the future work of mining software
repositories.