BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//5.981//EN
TZID:Asia/Jerusalem
X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT
UID:29@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20200209T143000
DTEND;TZID=Asia/Jerusalem:20200209T153000
DTSTAMP:20201124T121630Z
URL:https://web.iem.technion.ac.il/site/iemevents/prediction-of-human-indi
vidual-behavior/
SUMMARY:Prediction of human individual behavior [ \n Graduate Student S
eminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Meghan Mergui\n Advisors: Tamir Hazan and Ori Plonsky\n
Where: Bloomfield 527 From:\nTechnion\nAbstract:\n\nPrediction of individ
ual human behavior is a fundamental task in many domains. For example\, fi
rms may want to offer individually tailored promotions to consumers. Our r
esearch aims to give better predictions of individual choice behavior\, fo
cusing on predicting choice behavior in simple abstract economic games. A
recent prediction tournament (CPC18) challenged researchers to predict beh
avior in such games\, in two competition tracks. In the first track\, the
challenge was to predict the average aggregate behavior of people in a new
game\, and in the second track\, the challenge was to predict the behavio
r of individual decision makers in familiar games. The results of CPC18 sh
owed impressive predictive performance in the first track\, when predictin
g the average agent’s behavior\, specifically using a combination of mac
hine learning and a psychological model. However\, when predicting individ
uals’ choice behavior\, the best prediction model was a naïve baseline
that predicts that each individual behaves the same as the “average agen
t” in the training set. Using deep learning models\, and by leveraging t
he success of the models designed for prediction of the average agent\, we
try to make an advancement in this task. Can we extract knowledge about i
ndividual behavior that goes beyond what is known about the population? Ca
n we learn psychological parameters of individuals from previous behavior
of those individuals? Can we use learnt psychological parameters to improv
e prediction on the individuals' future choice behavior?
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:6@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20200818T110000
DTEND;TZID=Asia/Jerusalem:20200818T120000
DTSTAMP:20200817T112458Z
URL:https://web.iem.technion.ac.il/site/iemevents/strategic-information-re
trieval-the-mediator-and-agent-perspectives/
SUMMARY:Strategic information retrieval - the mediator and agent perspectiv
es [ \n Graduate Student Seminar\n \n ]
DESCRIPTION:By: PhD Gregory Goren\n Advisors: Prof. Oren Kurland and Prof.
Moshe Tennenholtz\n Where: https://technion.zoom. us/j/3800541616 From:\n\
nIn the Web retrieval setting\, many document authors are "ranking-incenti
vized". That is\, they are interested in having their documents highly ran
ked for some queries by search engines. To this end\, they often respond t
o rankings by introducing modifications to their documents (a.k.a.\, searc
h engine optimization). Hence\, the retrieval setting is competitive.\nA s
earch engine can be considered as a mediator. It connects users with infor
mation needs (which are represented via queries) and document authors (age
nts) whose pages might satisfy the information needs of the users. This bo
dy of work tackles both the mediator perspective and the agent perspective
in the competitive retrieval setting. We show an extensive analysis of th
e robustness of ranking functions to adversarial document manipulations. I
n addition\, we devise an automatic model for ranking-incentivized\, quali
ty preserving document manipulations. Finally\, we present an empirical an
alysis of the possibility of an herding effect in a competitive search set
ting. That is to say\, the agents are choosing similar strategies without
an explicit centralized direction.
CATEGORIES:Graduate Student Seminar
END:VEVENT
BEGIN:VEVENT
UID:15@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20200818T120000
DTEND;TZID=Asia/Jerusalem:20200818T130000
DTSTAMP:20201109T060732Z
URL:https://web.iem.technion.ac.il/site/iemevents/cluster-based-document-r
etrieval-with-multiple-queries/
SUMMARY:Cluster-Based Document Retrieval with Multiple Queries [ \n Gra
duate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Kfir Bernstein\n Advisors: Oren Kurland\n Where: Zoom F
rom:\nTechnion\nThe merits of using multiple queries representing the same
information need to improve retrieval effectiveness have recently been
demonstrated in several studies. In this paper we present the first stud
y of utilizing multiple queries in cluster-based document retrieval\; tha
t is\, using information induced from clusters of similar documents to ra
nk documents. Specifically\, we propose a conceptual framework of retriev
al templates that can adapt cluster-based document retrieval methods\, or
iginally devised for a single query\, to leverage multiple queries. The ad
aptations operate at the query\, document list and similarity-estimate le
vels. Retrieval methods are instantiated from the templates by selecting\,
for example\, the clustering algorithm and the cluster-based retrieval m
ethod. Empirical evaluation attests to the merits of the retrieval templa
tes with respect to very strong baselines: state-of-the-art cluster-based
retrieval with a single query and highly effective fusion of document li
sts retrieved for multiple queries. In addition\, we present findings abo
ut the impact of the effectiveness of queries used to represent an inform
ation need on (i) cluster hypothesis test results\, (ii) percentage of re
levant documents in clusters of similar documents\, and (iii) effectivene
ss of state-of-the-art cluster-based retrieval methods.\n\nJoint work wit
h Dr. Fiana Raiber (Yahoo Research) and Prof. J. Shane Culpepper (RMIT)
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:60@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20200915T110000
DTEND;TZID=Asia/Jerusalem:20200915T120000
DTSTAMP:20210224T094649Z
URL:https://web.iem.technion.ac.il/site/iemevents/online-distributionally-
robust-optimization/
SUMMARY:Online Distributionally Robust Optimization [ \n Graduate Stude
nt Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Ido Yerenburg\n Advisors: Dr. Shimrit Shtern\n Where:
ZOOM From:\nTechnion\nAbstract:\n\nWe are interested in exploring stocha
stic optimization problems where the distribution of the uncertainty is un
known but random data from the distibution is continuously becoming avaial
ble. When the entire data is available in advance it is known that Sample
Average Approximation (SAA) tends to overfit the data\, and recently data-
driven distributionally robust optimization (DRO) approaches have been sug
gested as an alternative. We focus on one such DRO with ambiguity set base
d on the Wasserstein metric (WDRO)\, which is known to provide finite-samp
le guarantees but becomes more computationally demanding the more data poi
nts exists. Thus\, we explore extending the use of online methods\, such a
s online gradient descent and online mirror descent\, used to approximate
SAA to the DRO setting under assumptions of both bounded and unbounded but
light tailed distributions. We show that this online version of the WDRO
converges to the true stochatic problem almost surely and maintains some o
f WDRO probabilistic guarantees. In addition\, we show numeric results dem
onstrating the benefits and disadvantages of using online-DRO compared to
online-SAA and the offline versions of both algorithms.\n\nZOOM Link\n\nht
tps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:9@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20201101T143000
DTEND;TZID=Asia/Jerusalem:20201101T153000
DTSTAMP:20201109T060808Z
URL:https://web.iem.technion.ac.il/site/iemevents/competition-among-contes
ts-a-safety-level-analysis/
SUMMARY:“Competition Among Contests: a Safety Level Analysis" [ \n Gr
aduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: Omer Shiran-Shvarzbard\n Advisors: Ron Lavi\n Where: Zoom
From:\nTechnion\nAbstract:\nWe study a competition among two contests\, w
here each contest designer aims to attract as much effort as possible. Suc
h a competition exists in reality\, e.g.\, in crowd-sourcing websites. Our
results are phrased in terms of the ``relative prize power'' of a contest
\, which is the ratio of the total prize offered by this contest designer
relative to the sum of total prizes of the two contests. When contestants
have a quasi-linear utility function that captures both a risk-aversion ef
fect and a cost of effort\, we show that a simple contest attracts a total
effort which approaches the relative prize power of the contest designer
assuming a large number of contestants. This holds regardless of the conte
st policy of the opponent\, hence providing a ``safety level'' which is a
robust notion similar in spirit to the max-min solution concept.\n\nSemina
r Zoom Link
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:14@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20201108T143000
DTEND;TZID=Asia/Jerusalem:20201108T153000
DTSTAMP:20201109T060912Z
URL:https://web.iem.technion.ac.il/site/iemevents/waiting-time-prediction-
in-queueing-systems-via-learning-models/
SUMMARY:Waiting Time Prediction in Queueing Systems via Learning Models [ \
n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Elisheva Chocron\n Advisors: Paul Feigin\, Izack Cohen
\n Where: Zoom From:\nTechnion\nAbstract\n\nWe research approaches for pr
edicting waiting times of customers within service systems. Our focus is o
n call centers in which accurate waiting time predictions may enable impro
ved work-force management and lead to increased customer satisfaction.\n\n
Standard approaches for design and management of service systems that incl
ude customers\, servers and queues rely on Queueing Theory (QT). In partic
ular\, QT is often used for predicting waiting times which is the focus of
this work.\n\nQT is often criticized since its formulas are based on fund
amental assumptions regarding the model describing a given system — assu
mptions which are usually violated.\n\nTo overcome this issue\, we hypothe
size that additional external characteristics (“features”) may be requ
ired in order to provide an accurate prediction of the waiting time for ma
ny real-life systems. We further hypothesize that a Machine Learning (ML)
model incorporating those characteristics will improve the performance of
waiting time predictions. Consequently\, in this research we explore the u
se of ML-based algorithms for waiting time prediction and investigate to w
hat extent they overcome the limits of QT methods which are typically base
d on “simple model” assumptions. In a series of experiments\, we use m
ultiple ML- and QT-based models to predict the waiting times of customers
within simple (“synthetic”) and real-life call centers.\n\nWe analyze
the performance of the different models\, in order to determine for which
methods and under what conditions ML performance compares favorably with Q
T performance.\n\nSeminar Zoom Link
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:22@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20201115T143000
DTEND;TZID=Asia/Jerusalem:20201115T153000
DTSTAMP:20201109T061019Z
URL:https://web.iem.technion.ac.il/site/iemevents/self-stabilizing-algorit
hms-in-the-stone-age-model/
SUMMARY:Self-Stabilizing Algorithms in the Stone Age Model [ \n Graduat
e Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: Eyal Keren\n Advisors: Yuval Emek\n Where: Zoom From:\nTe
chnion\nAbstract:\n\nIntroduced by Emek and Wattenhofer (PODC 2013)\, the
\\emph{stone age (SA)} model suggests an abstraction for network algorithm
s distributed over randomized finite state machines.\n\nRecent works demon
strate that the weak computational environment provided by the SA model is
sufficient for efficient solutions to some core problems in distributed c
omputing\, but they do so under the (somewhat unrealistic) assumption of f
ault free computations.\nIn this talk\, we initiate the study of \\emph{s
elf-stabilizing} SA algorithms that are guaranteed to recover from any com
bination of transient faults.\nSpecifically\, we develop efficient self-st
abilizing SA algorithms for the \\emph{leader election} and \\emph{maximal
independent set} problems in bounded diameter graphs.\nThese algorithms r
ely on a novel self-stabilizing \\emph{synchronizer} for SA algorithms ope
rating in such graphs.\n\nSeminar Zoom Link
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:33@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210110T143000
DTEND;TZID=Asia/Jerusalem:20210110T153000
DTSTAMP:20201230T091933Z
URL:https://web.iem.technion.ac.il/site/iemevents/eptas-for-load-balancing
-problem-on-parallel-machines-with-a-non-renewable-resource/
SUMMARY:EPTAS for Load Balancing Problem on Parallel Machines with a Non-re
newable Resource [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Jaykrishnan G.\n Advisors: Prof. Asaf Levin \n Wher
e: Zoom From:\nTechnion\nAbstract\n\nThe problem considered is the non-pr
eemeptive scheduling of ‘n’ independent jobs that consume a resource (
which is non-renewable and replenished regularly) on ‘m’ parallel mach
ines. The input defines the speed of machines\, size of jobs\, the quantit
y of resource required by the jobs\, and the replenished quantities and re
plenishment dates of the resource. Every job can be processed only after t
he required quantity of the resource is allocated to the job. The objectiv
e function is the minimization of the convex combination of the makespan a
nd an objective that is equivalent to the lp-norm of the vector of loads o
f the machines.\n\nA polynomial time approximation scheme (PTAS) for a giv
en problem is a family of approximation algorithms such that the family ha
s a (1+ε)-approximation algorithm for any ε>\;0. An efficient polynomi
al time approximation scheme (EPTAS) is a PTAS whose time complexity is up
per bounded by the form f(1/ε) ⋅ poly(n) where ‘f’ is some computab
le (not necessarily polynomial) function and poly(n) is a polynomial of th
e length of the (binary) encoding of the input. We establish the existence
of an EPTAS for the problem. The EPTAS will first apply rounding steps to
structure the input. We characterize structural properties of near optima
l solutions and use it to formulate a Mixed-integer linear program (MILP)
with a constant number of integer variables. Based on the optimal solution
of this MILP\, a feasible solution for the scheduling problem will be com
puted and we show that this solution approximates the optimal solution by
a factor of (1+ ε).\n\nZoom link
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:47@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210117T143000
DTEND;TZID=Asia/Jerusalem:20210117T153000
DTSTAMP:20210110T094635Z
URL:https://web.iem.technion.ac.il/site/iemevents/queueing-inference-for-p
rocess-performance-analysis-with-missing-life-cycle-data/
SUMMARY:Queueing Inference for Process Performance Analysis with Missing Li
fe-Cycle Data [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Guy Berkenstadt\n Advisors: Prof. Avigdor Gal\n Where
: Zoom link From:\nTechnion\nAbstract:\n\nMeasuring key performance indica
tors\, such as queue lengths and waiting times\, using event logs serve fo
r improvement of resource-driven business processes. However\, existing te
chniques assume the availability of complete life cycle information\, incl
uding the time a case was scheduled for execution (aka arrival times). Yet
\, in practice\, such information may be missing for a large portion of th
e recorded cases.\n\nIn this talk\, I will propose a methodology to addres
s missing life-cycle data by incorporating predicted information in busine
ss processes performance analysis. The approach builds upon techniques fro
m queueing theory and leverages supervised learning to accurately predict
performance indicators based on an event log with missing data. I will als
o present experimental results to demonstrate the effectiveness of the app
roach on synthetic and real-world data.\n\nZoom link\n\n \;\n\nhttps:/
/technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:45@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210124T143000
DTEND;TZID=Asia/Jerusalem:20210124T153000
DTSTAMP:20210105T124457Z
URL:https://web.iem.technion.ac.il/site/iemevents/married-women-labor-supp
ly-and-differences-between-ethnic-groups-in-israel/
SUMMARY:Married Women Labor Supply\, and Differences Between Ethnic Groups
in Israel. [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Sabaa Jabali-Serhan \n Advisors: Doctor Jacob Schwart
z and Professor (emeritus) Benjamin Bental\n Where: Zoom From:\nTechnion\n
Abstract:\n\nThis study proposes empirically examines what affects married
women labor supply in Israel\, focusing on the differences between the be
havior of Arab and Jewish married women. The major contribution of this re
search is that unlike most other studies\, which examine the participation
decision\, i.e. whether to enter the labor market or not\, I examine the
effect of individual and familial factors on hours supplied over the years
. Using the PUF version of the cross-sectional Israeli Income Surveys for
the 1997 to 2011 time period\, the results show that the expected monthly
hours supplied of married Arab and Jewish women are positively and signifi
cantly affected by additional education years\, are concave with age\, are
negatively and significantly affected by children aged 0-14\, and negligi
bly affected by other sources of income. These findings are similar to the
existing in literature. However\, there are major differences in the esti
mated coefficients for Arab and Jewish married women. For Arab women\, the
re is high volatility in the estimated explanatory variables over the vari
ous surveys. In addition\, the study adopts a pseudo panel approach to est
imate the elasticities of monthly hours of work with respect of wages\, cr
oss wages and income. The estimated wage elasticity for Arab and Jewish ma
rried women during the sample years is almost identical. One percent chang
e in the wage raises Arab married women expected monthly hours by 0.59% an
d that of Jewish married women by 0.60%. Furthermore\, the estimated elast
icities are larger for better educated women both for Arab and Jewish marr
ied women.\n\nZoom\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:53@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210124T160000
DTEND;TZID=Asia/Jerusalem:20210124T170000
DTSTAMP:20210114T185342Z
URL:https://web.iem.technion.ac.il/site/iemevents/the-effect-of-national-s
ecurity-events-on-life-satisfaction-of-different-section-of-the-israeli-so
ciety/
SUMMARY:The effect of national security events on life satisfaction of diff
erent section of the Israeli society [ \n Graduate Student Seminar\n
Seminars\n \n ]
DESCRIPTION:By: M.Sc Dana Masharka\n Advisors: Prof. Bar-Ilan Avner\, Dr. A
iche Avishay\n Where: ZOOM From:\nTechnion\nAbstract:\n\nThe goal of this
research is to study factors affecting life satisfaction and financial sat
isfaction of Israeli citizens. In particular\, the 2006 Lebanon war and th
e 2014 Israel-Gaza conflict and their impact on Jews and Arabs. To do this
\, Israel's annual Social Survey of the Central Bureau of Statistics for t
he years 2005-2008 and 2012-2016 has been analyzed.\nThe main statistical
methods used are the Ordered Probit model\, quadratic discriminant analysi
s (QDA) model\, and Tree-based model. In most previous studies of happines
s\, the methods used are Logit\, Linear regression\, and Ordered Probit. T
he Ordered Probit used here to estimate the effect of various variables on
life and financial satisfaction. An innovative contribution of this thesi
s is to test the prediction power of these variables by QDA and Tree-Based
models.\nSome results are similar to those found in previous research. We
find that financial/apartment/family relationship satisfaction\, health\,
and optimism have a great positive effect on life satisfaction. Lonelines
s hurts life satisfaction\, and family size has a positive effect on both
life and financial satisfaction. It seems that orthodox Jews are happier t
han any other religious intensity. Age has a U-shaped effect both on life
and financial satisfaction. For financial satisfaction\, work and income s
atisfaction have a significant positive effect\, and income increases fina
ncial satisfaction. Job security has a positive effect on financial satisf
action too. There is a difference in satisfaction’ especially financiall
y\, for individuals who vary in religiosity. Arabs are more financially sa
tisfied than Jews\, and Orthodox are more satisfied with financial and lif
e than any other religious intensity.\nWe find that geographic area and se
rving in IDF affected satisfaction in the 2006 Lebanon war\, but not in 20
14. For both security events\, the financial satisfaction affecting life s
atisfaction decreased in the year of the war. For the 2014 Israel-Gaza con
flict\, the variables feeling safe\, Arab\, and loneliness have the bigges
t effect. For financial satisfaction\, the income satisfaction is the lowe
st in the years of the military conflicts\, and interestingly the variable
Arabs has the smallest effect on financial satisfaction in the years of t
he security events.\n\nZoom Link\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:50@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210127T150000
DTEND;TZID=Asia/Jerusalem:20210127T160000
DTSTAMP:20210112T190118Z
URL:https://web.iem.technion.ac.il/site/iemevents/shared-micro-depot-netwo
rk/
SUMMARY:Shared micro-depot network [ \n Graduate Student Seminar\n
Seminars\n \n ]
DESCRIPTION:By: MSc Leonardo N. Rosenberg\n Advisors: Prof. Yale T. Herer\n
Where: ZOOM From:\n\nAbstract:\n\nLast-mile logistics is both a source an
d cause of problems in urban areas\, especially problems related to traffi
c congestion\, unsustainable delivery modes\, and limited parking availabi
lity. In this context\, multiple sustainable logistics solutions have been
proposed. One of them is micro-depots (MDs)\, which can function as a con
solidation center and a collection-and-delivery point. During the EIT Urba
n Mobility-funded project S.M.U.D. (Shared Micro-depots for Urban pickup a
nd Delivery)\, the concept of a shared MD network with parcel lockers was
developed. Such networks enable multiple logistics service providers (LSPs
) and/or business partners to use an MD while minimizing their individual
costs and optimizing the use of urban space. We present case studies of su
ch shared MD networks operating in the cities of Helsinki (FI) and Helmond
(NL). We provide a framework for auxiliary businesses that can exploit th
e existing MD structure to offer services to the surrounding population. T
he case studies highlight the complexity of implementing such a solution\;
it requires stakeholders’ involvement and collaboration. We modeled the
distance traveled using the shared MD network with different distribution
policies\, with or without an urban consolidation center located in the s
uburban area\, and compared the results of the cities involved in the proj
ect with the traditional modus operandi. Our results show that cargo bikes
can perform most of the distance traveled in the system\, reaching up to
80% of the total. The implementation of this network also can reduce subur
ban distance traveled by 60%.\n\n \;\n\nZoom Link: https://technion.zo
om.us/j/3800541616\n\n \;\n\n \;
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:56@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210210T143000
DTEND;TZID=Asia/Jerusalem:20210210T153000
DTSTAMP:20210131T152935Z
URL:https://web.iem.technion.ac.il/site/iemevents/competition-affirmative-
action-and-sabotage-negative-characteristics-in-contest-design-observed-in
-horse-racing-in-the-united-kingdom-in-2019/
SUMMARY:Competition: Affirmative Action and Sabotage. Negative Characteris
tics in Contest Design Observed in Horse Racing in the United Kingdom in 2
019 [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: MS.C Ilan Rosenberg\n Advisors: Prof. Todd Kaplan\n Where:
ZOOM From:\nTechnion\nAbstract:\nAffirmative action is a policy designed t
o balance opportunities and create open conditions for competition. Althou
gh such policies usually seek to support certain demographic groups\, comm
only referred to as "minorities" or "weakened groups"\, they are also appl
ied in sports\, political campaigns\, rent seeking contests and more. Whil
e the goal of affirmative action is to improve and equalize opportunities\
, the literature shows that not having such policies leaves too much asymm
etry among players. This asymmetry causes incentive problems\, resulting i
n reduced levels of the general effort due to the "despair effect"\, where
weaker players have low expectations and not willing to invest effort and
stronger players feel no need to invest effort.\nIn such cases\, a contes
t designer might consider implementing an affirmative action policy\, whet
her by weakening the strong players (handicapping) or by strengthening the
weaker players (head start). This work examines whether affirmative actio
n\, designed to reduce the gaps in the competitive world\, might by trying
to encourage effort might actually\, motivate contestants to sabotage oth
er contestants.\nUsing a natural experiment\, with data from horse racing
in the United Kingdom in 2019\, I demonstrate how affirmative actions that
handicap favorite horses\, results in a more balanced playing field by gi
ving weaker horses higher winning probabilities. I also demonstrate that c
ases of sabotage and negative behavior between riders\, are more prevalent
in such races. Sabotage by the leading jockeys\, improves their position
by an average of 0.98 placings. I also show that stronger riders (the top
5% of UK jockeys)\, are in general 4.4 times more involved in cases of int
erference between riders than regular jockeys.\n\n \;\n\nZoom Link\n\n
https://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:58@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210214T153000
DTEND;TZID=Asia/Jerusalem:20210214T163000
DTSTAMP:20210207T102858Z
URL:https://web.iem.technion.ac.il/site/iemevents/a-steiner-tree-perspecti
ve-on-topical-crawling/
SUMMARY:A Steiner Tree Perspective on Topical Crawling [ \n Graduate St
udent Seminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Avihay Levi\n Advisors: Prof. Carmel Domshlak\n Where:
ZOOM From:\nTechnion\nAbstract:\n\nTopical\, also known as vertical\, sea
rch engines specialize in retrieval of information restricted to a certain
subject of information needs. The essential component of such a topical s
earch engine is a topical crawler\, a software agent that navigates the We
b in search for documents fitting the scope of its search engine. The comm
on approach to topical crawling appears to be best-first search over the d
igraph forming the Web\, prioritizing the links in its search queue by the
lexical similarity between the representation of the document embedding t
he link and the representation of the topic. In our work\, we re-examine t
his approach to topical crawling. First\, we show that the optimal footpri
nt of the topical crawling process constitutes a minimum directed Steiner
tree of the Web digraph\, with the on-topic documents being Steiner termin
als. Second\, having this "Steiner optimality" in mind\, we formalize a no
vel best-first approach that prioritizes search directions based on a Baye
sian inference model that continuously updates its estimates given evidenc
e collected during crawling. Our empirical comparative evaluation on real-
world large snapshots of the Web shows that the proposed approach substant
ially outperforms the standard technique for best-first topical crawling.\
n\nZoom Link\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:59@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210224T143000
DTEND;TZID=Asia/Jerusalem:20210224T153000
DTSTAMP:20210221T123120Z
URL:https://web.iem.technion.ac.il/site/iemevents/expansion-and-generaliza
tion-of-the-literature-on-the-risk-averse-newsvendor-problem-by-integratin
g-finance-results-with-the-risk-averse-newsvendor-problem/
SUMMARY:Expansion and generalization of the literature on the risk averse n
ewsvendor problem by integrating finance results with the risk-averse news
vendor problem [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Gad Gal (Gadi) Ezer\n Advisors: Professor Yale T. Here
r \n Where: ZOOM From:\nTechnion\nAbstract:\nGlobalization and e-commerce
have led to increased levels of competition and steadily shorter product
life cycles. The newsvendor (NV) model is classically used for inventory m
anagement of short life-cycle product. It contends with demand uncertainty
that leads to uncertain performances\, as a result risk emerges under whi
ch decision are made. While decision makers tend to avoid risk for high pr
ofit products (e.g.\, new products)\, the traditional solution of the NV p
roblem ignores the underlying risk. Mean-variance (MV) analysis is a funda
mental theory of risk management in finance.MV analysis is notable for bei
ng implementable and providing good recommendations even without knowing t
he utility function. Inspired by the Modern Portfolio Theory (MPT) we inve
stigate the set of efficient solutions (i.e.\, efficient frontier) of the
NV problem\, using the MV analysis methodology with a modification to avoi
d its pitfall.\nWe focus on the special case of uniformly distributed dema
nd where identical locations are independent such that their decisions do
not affect their demands. While MPT uses diversification to create an effi
cient frontier\, we show that the efficient frontier of the NV problem exi
sts also for a single location. Defining a combination of multiple locatio
ns’ strategies as a portfolio\, we show that the efficient frontier of t
he multilocation NV problem\, includes only efficient strategies of the in
dividual problems. Moreover\, when the efficient frontier of the individua
l problems is convex\, a portfolio is efficient if and only if it includes
identical efficient strategies of the individual problems.\nMature produc
ts’ demands are often stabilized such that their profit fluctuation is n
egligible and so we consider location’s choice to solely sell it\, as a
risk-free strategy. New products have a higher expected profit\, but conta
in uncertainty in their demand. MPT showed that the set of all combination
s of fractions between a risk-free strategy and a specific efficient portf
olio (i.e.\, the market portfolio)\, results in superior efficient frontie
r. Capital Asset Pricing Model (CAPM) set a criterion to make decision abo
ut adding products to an existing efficient portfolio. While both MPT and
CAPM focus is adding products to an existing efficient portfolio\, we inve
stigate the effect of replacing locations’ strategies with risk-free str
ategies—within an existing portfolio. We demonstrate that we can gain la
rge reduction in risk by sacrificing only a small amount of the expected p
rofit.\n\nZOOM LINK\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:61@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210404T143000
DTEND;TZID=Asia/Jerusalem:20210404T153000
DTSTAMP:20210304T130214Z
URL:https://web.iem.technion.ac.il/site/iemevents/opm-model-based-iot-and-
internet-of-robotic-things/
SUMMARY:OPM Model-Based IoT and Internet of Robotic Things [ \n Graduat
e Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: PhD Hanan Kohen\n Advisors: Prof. Dov Dori\n Where: Zoom Fr
om:\nTechnion\nThe realization that models can and should become the centr
al artifact in engineered systems’ lifecycles has been gaining momentum
in recent years\, giving rise to model-based systems engineering (MBSE) as
an evolving SE field. Conceptual modeling at the system level precedes ma
thematical\, physical\, geometrical\, and detailed disciplinary modeling a
nd design. Object-Process Methodology (OPM) ISO 19450 is a conceptual and
quantitative executable MBSE modeling language and methodology.\nThe Inter
net of Things (IoT) capitalizes on the Internet to ubiquitously enable inf
ormation exchange among daily physical objects that are integrated into co
mplex interconnected networks\, providing for improved resource utilizatio
n and other benefits to humanity. Within the conceptual framework of IoT\,
the Internet of Robotic Things (IoRT) concerns the integration of humans
and autonomous agents. i.e.\, robots. The main function of IoRT applicatio
ns is monitoring robot states and processes and coordinating multiple robo
ts. As the IoT and IoRT continue to penetrate into homes and businesses\,
and into national and global infrastructures\, there is a growing need for
effective development methodologies and tools that account for performanc
e\, security\, safety\, cost and the environment.\nIn this research\, we h
arness OPM and its modeling software environment OPCloud to develop IoT an
d IoRT systems from the very early stages of concept development through a
rchitecting\, all the way to detailed design\, optimization\, simulating\,
deployment and prototyping. Using an MBSE approach\, aspects of interest\
, such as security or cost can be modeled and analyzed explicitly\, enabli
ng trade-space exploration and Pareto front optimization with respect to t
hese aspects.\n\n \;\n\nZoom Link\n\nhttps://technion.zoom.us/j/380054
1616
ATTACH;FMTTYPE=image/jpeg:https://web.iem.technion.ac.il/site/wp-content/u
ploads/2019/12/Hanan-2.png
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:62@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210411T143000
DTEND;TZID=Asia/Jerusalem:20210411T153000
DTSTAMP:20210404T103344Z
URL:https://web.iem.technion.ac.il/site/iemevents/analysis-of-ecommerce-be
st-seller-lists/
SUMMARY:Analysis of eCommerce best seller lists [ \n Graduate Student S
eminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Lital Kuchy\n Advisors: Prof. Oren Kurland\n Where: ZO
OM From:\nTechnion\nAbstract: \nOnline shopping is one of the fastest gr
owing markets of the 21st century. Today we can buy almost everything onli
ne\, from groceries to house furniture. \nAs the market grows\, more and
more manufacturers offer their goods online. If one is looking to buy a sm
art watch for example\, a simple search on Amazon.com alone\, \none of
the largest e-commerce sites in the world\, would result in over 3000 diff
erent options. Such information overload makes it impossible for the custo
mer to manually evaluate all options. \nTo help the customer make a purch
ase decision\, many eCommerce sites offer different product ranking option
s.\nIn this work\, we analyze different aspects of best seller ranked list
s.\nJoint work with Dr. David Carmel\n \;\n\nZoom Link\nhttps://techni
on.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:65@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210418T143000
DTEND;TZID=Asia/Jerusalem:20210418T153000
DTSTAMP:20210407T082539Z
URL:https://web.iem.technion.ac.il/site/iemevents/studying-ranking-incenti
vized-web-dynamics/
SUMMARY:Studying Ranking-Incentivized Web Dynamics [ \n Graduate Studen
t Seminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Ziv Vasilisky\n Advisors: Prof. Oren Kurland\, Prof. Mo
she Tennenholtz \n Where: ZOOM From:\nTechnion\nAbstract:\nThe ranking inc
entives of many authors of Web pages play an important role in the Web dyn
amics. That is\, authors who opt to have their pages highly ranked for que
ries of interest often respond to rankings for these queries by manipulati
ng their pages\; the goal is to improve the pages' future rankings. Variou
s theoretical aspects of this dynamics have recently been studied using ga
me theory. However\, empirical analysis of the dynamics is highly constrai
ned due to lack of publicly available datasets. We present an initial such
dataset that is based on TREC's ClueWeb09 dataset. Specifically\, we used
the WayBack Machine of the Internet Archive to build a document collectio
n that contains past snapshots of ClueWeb documents which are highly ranke
d by some initial search performed for ClueWeb queries. Temporal analysis
of document changes in this dataset reveals that findings recently present
ed for small-scale controlled ranking competitions between documents' auth
ors also hold for Web data. Specifically\, documents' authors tend to mimi
c the content of documents that were highly ranked in the past\, and this
practice can result in improved ranking.\n\nZoom Link\n\nhttps://technion.
zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:66@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210425T143000
DTEND;TZID=Asia/Jerusalem:20210425T153000
DTSTAMP:20210412T081245Z
URL:https://web.iem.technion.ac.il/site/iemevents/behavioral-study-of-bidd
ing-on-peer-reviews/
SUMMARY:Behavioral study of bidding on peer reviews [ \n Graduate Stude
nt Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Inbal Rozencweig \n Advisors: Reshef Meir\n Where: ZO
OM From:\nTechnion\nAbstract:\n\nPeer review is an essential step to ensur
e the quality of papers accepted to large conferences. In our work\, we wi
ll examine the different behaviors of reviewers in the bidding stage\, whe
re our main focuses will be on how reviewer's behavior is affected by pape
r's display order\, reviewers preference\, and 'points' associated with ea
ch paper that ostensibly reflects his demand\; the higher the 'points'\, t
he higher the chance to get the paper. Our empirical methodology consisted
of a bidding platform\, where reviewers bid on a set of papers from a lar
ge list of submitted papers.\n\nWe implemented a paper review bidding syst
em where we conducted a series of controlled lab experiments. In each expe
riment\, we isolated one variable and examined how it affects reviewers' b
ehavior in three key parameters - order bias\, price bias\, and private pr
eference bias. We found that presenting a score for each paper significant
ly changes the behavior of reviewers and incentivized them to choose paper
s with a higher score\, i.e. papers with a higher chance of getting. Also\
, we found that there is a bias in selecting papers that are displayed at
the top of the list\, and that reviewers choose papers that match their de
clared preferences. Finally\, we fitted a regression model for the results
of each experiment which presents the factors influencing the behavior of
the reviewers and enables prediction about future bids.\n\n \;\n\nZoo
m Link\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:69@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210502T143000
DTEND;TZID=Asia/Jerusalem:20210502T153000
DTSTAMP:20210418T064518Z
URL:https://web.iem.technion.ac.il/site/iemevents/bilevel-optimization-pro
blems-methodology-and-first-order-methods-for-solving-convex-non-smooth-an
d-non-strongly-convex-problems/
SUMMARY:Bilevel optimization problems- methodology and first-order methods
for solving convex non-smooth and non-strongly convex problems. [ \n G
raduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Lior Doron\n Advisors: Dr. Shimrit Shtern\n Where: ZO
OM From:\nTechnion\nAbstract:\nSimple bilevel problems are optimization pr
oblems in which we want to find an optimal solution to an inner problem th
at minimizes an outer objective function. Such problems appear in many mac
hine learning and signal processing applications as a way to eliminate und
esirable solutions. However\, since these problems do not satisfy regulari
ty conditions\, they are often hard to solve exactly and are usually solve
d via regularization (e.g LASSO and ridge regression). In the past few yea
rs\, several algorithms were proposed to solve these bilevel problems dire
ctly and provide a rate for obtaining feasibility\, assuming that the oute
r function is strongly convex. In our work\, we suggest a new approach tha
t is designed for bilevel problems with simple outer functions\, such as t
he l1 norm\, which are not required to be either smooth or strongly convex
. In our new Iterative Approximation and Level-set Expansion (ITALEX) appr
oach\, we alternate between expanding the level-set of the outer function
and approximately optimizing the inner function over this level- set. ITAL
EX guarantees that at each iteration of the algorithm the outer objective
function is super-optimal\, a property that is not known for other bilevel
algorithms. We show that optimizing the inner function through first-orde
r schemes such as proximal gradient and generalized conditional gradient r
esults in a feasibility convergence rate of O(1/k)\, which is a rate only
shown to be obtained for a smooth strongly convex outer functions. Assumin
g more restrictive settings which still holds for important cases (like Ba
sis Pursuit)\, it results a convergence rate of O(1/k^2).\n\nZoom Link\n\n
https://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:71@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210509T143000
DTEND;TZID=Asia/Jerusalem:20210509T153000
DTSTAMP:20210505T080148Z
URL:https://web.iem.technion.ac.il/site/iemevents/digital-screen-effect-on
-behavior-and-decision-making-insights-from-the-restaurant-industry/
SUMMARY:Digital Screen Effect on Behavior and Decision Making\, Insights fr
om the Restaurant Industry [ \n Graduate Student Seminar\n Seminar
s\n \n ]
DESCRIPTION:By: M.Sc. Gal Hirsh Ben-Mellech\n Advisors: Prof. Doron Kliger
and Dr. Benjamin Bachi \n Where: ZOOM From:\nTechnion\nAbstract:\nThe digi
tal transformation has gained prominence in recent years. The world as we
know it is changing\, and it has become substantial to develop an in-depth
understanding of the digitization effects on individuals' decision-making
and behavior. In our study\, we examine how the digital screen affects an
individual's decision-making while focusing on the restaurant industry. B
y conducting a field experiment that we divided into two sub-experiments\,
we defined several interventions\; Utilizing a digital-order cart and sec
tioning the dessert menu into categories. We demonstrate that customers te
nd to order more when they use a digital cart. Furthermore\, customers who
have used the digital cart tend to make fewer changes to their order. How
ever\, we were unable to show that the digital cart affects an individual'
s ordering standard dishes. In addition\, we were unable to infer a clear
conclusion and significance about the effect of sectioning the dessert men
u into categories on individual decision-making in terms of order size and
standard order. There is a place for further research in this interventio
n.\n\n \;\n\nWe completed our experiment before the outbreak of the CO
VID-19 pandemic\, and in light of the widespread use of digital tools in t
his period\, we suggest to continue studying this field extensively.\n\n&n
bsp\;\n\nZoom Link\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:72@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210523T143000
DTEND;TZID=Asia/Jerusalem:20210523T153000
DTSTAMP:20210509T065050Z
URL:https://web.iem.technion.ac.il/site/iemevents/walking-direction-estima
tion-using-accelerometer-and-magnetic-sensors-a-deep-network-based-framewo
rk/
SUMMARY:Walking Direction Estimation using Accelerometer and Magnetic Senso
rs: a Deep Network-Based Framework [ \n Graduate Student Seminar\n
Seminars\n \n ]
DESCRIPTION:By: M.Sc. Adi Manos\n Advisors: Prof. Tamir Hazan and Prof. Itz
ik Klein\n Where: ZOOM From:\nTechnion\nAbstract:\n\nSmartphone-based iner
tial and magnetic sensors can be the basis for pedestrian navigation\, whe
never external positioning signals are limited or unavailable. Such naviga
tion solutions are typically accomplished by a practice known as pedestria
n dead reckoning\, wherein step length and heading angle are estimated to
form the horizontal trajectory of the user. One of the main challenges in
these methods is the unknown angular misalignment between walking directio
n and device orientation\, which imposes great difficulty in estimating th
e pedestrian's true heading.\nIn this work\, based on accelerometer and ma
gnetic sensors\, a new framework is established to estimate the user's hea
ding. It comprises a novel deep network architecture\, where temporal conv
olutions and multi-scale attention layers are trained to extract the walki
ng direction vector in the sensors' coordinate frame\, by using accelerati
on signals in a rotation-invariant manner. On top of that\, a unique geome
tric model is derived\, in which gravity and geomagnetic measurements are
combined with the estimated motion vector\, for calculating the pedestrian
's heading angle in the north and east coordinates. The proposed model is
trained and validated\, in a user-dependent approach\, through extensive e
xperiments of natural walking activity with commercial smartphones.\n\n&nb
sp\;\n\nZoom Link\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:78@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210606T133000
DTEND;TZID=Asia/Jerusalem:20210606T143000
DTSTAMP:20210601T202516Z
URL:https://web.iem.technion.ac.il/site/iemevents/incorporating-system-dyn
amics-into-opm-for-improved-model-analysis/
SUMMARY:Incorporating System Dynamics into OPM for Improved Model Analysis
[ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Keren-Or Rosenbaum\n Advisors: Prof. Dov Dori\n Where:
ZOOM From:\nTechnion\nAbstract:\n\n\n\nThe digital transformation that has
been shifting the world has urged policymakers to look for tools that mod
el this highly complex web of systems in a structured and easily understan
dable way to assist in designing better operating policies and guide effec
tive change. System Dynamics\, SysD (Forrester\, 1971)\, is a recognize
d method for modeling and predicting the dynamic behavior of complex syste
ms. In this research\, we devise a way to convert SysD models into mod
els in Object-Process Methodology (OPM\, ISO 19450)\, a conceptual and com
putational modeling language and model-based systems engineering method
ology. Using a real case study from the COVID-19 pandemic in Chile and oth
er SysD models of disease spreading and patient caring\, we have concluded
that a fully automated conversion is not possible\, because the SysD mode
ls contain implicit entities and assumptions that require the active invo
lvement of a human modeler to interpret the SysD model for creating an
elaborated OPM model. Yet\, we found a set of SysD constructs that can be
systematically converted into OPM constructs\, and these help modelers tra
nslate SysD models and evolve them into high-quality executable OPM models
that are both qualitative and quantitative.\n\n\nZoom Link\nhttps://techn
ion.zoom.us/j/3800541616\n\n\n
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:77@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210606T143000
DTEND;TZID=Asia/Jerusalem:20210606T153000
DTSTAMP:20210530T115816Z
URL:https://web.iem.technion.ac.il/site/iemevents/search-for-knowledge-gro
unded-responses-in-retrieval-based-chatbots/
SUMMARY:Search for Knowledge-Grounded Responses in Retrieval-Based Chatbots
[ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: MSc Itay Harel\n Advisors: Prof. Oren Kurland\n Where: ZOOM
From:\nTechnion\nAbstract:\n\nBuilding a conversational system is conside
red a hardcore research problem. To have such a system is a research inter
est as well as commercial interest of E-commerce companies especially nowa
days\, in the big data era. Most of the advanced models\, mainly in the fi
eld of Deep Neural Networks\, focus on response generation but still suffe
r from generic responses. In this work\, we present novel methods for sear
ching knowledge-grounded responses. Empirical evaluation demonstrates the
effectiveness of these methods.\n\n \;\n\nZoom Link:\nhttps://technion
.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:82@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210613T143000
DTEND;TZID=Asia/Jerusalem:20210613T153000
DTSTAMP:20210611T032027Z
URL:https://web.iem.technion.ac.il/site/iemevents/symbols-in-support-of-de
pth-and-distance-estimation-implications-to-ar-displays/
SUMMARY:Symbols in support of depth and distance estimation: Implications t
o AR Displays [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Carmel Zolkov\n Advisors: Prof. Avi Parush\n Where: Z
OOM From:\nTechnion\nAbstract:\n\nThere is a need of technologies that cou
ld support detection and identification of elements and objects in the env
ironment\, and facilitate spatial orientation in a complex and critical si
tuation and environments. Specifically\, when it comes to navigation and o
rientation\, there is a need to estimate depth and distances. In this rese
arch\, we focused on symbols that can be used in augmented reality display
s to support distance and depth estimation\, in order to establish spatial
orientation in different situations.\n\n \;\n\nThe research approach
was based on the development of realistic scenarios in a virtual reality u
rban environment and simulating AR displays\, in which participant perform
ed depth and distance estimation tasks in different spatial configurations
of buildings.\n\nThe main objectives of our research were:\n\n· Develop
and test symbols that best convey depth and distance in support of orienta
tion.\n\n· Define\, using psychophysical methods\, the behavior of symbol
s.\n\n· Test the effectiveness of the symbols in conveying distance in a
more cluttered urban environment\, by adding a symbol to the target\, whil
e the targets were static or dynamic\, and occluded or not.\n\nOur main re
sults indicate that people can adjust geometric parameters of a symbol (e.
g. length of a line or diameter of a circle) to express the distance they
estimated\, and that a linear function could well fit the relations betwee
n estimated distance and adjusted parameter of the symbol.\n\nWe also disc
overed that when estimating distances to elements in an environment presen
ted on a 2D display\, there is a consistent underestimation of distances\,
as well as increasing variation in the estimations\, as a function of the
real distance.\n\nWe tested the effectiveness of a progressive bar and a
circle as symbols\, and discovered that the use of the symbol’s psychoph
ysical functions does improve the accuracy of distance estimation. Specifi
cally\, accuracy of distance estimation improved with significant diminish
ing of the underestimation as a function of the distance\, that accuracy w
as better with non-occluded targets\, and specifically with a moving targe
t.\n\nThe findings are discussed in terms of their theoretical and practic
al implications.\n\nZoom Link\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:79@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210613T153000
DTEND;TZID=Asia/Jerusalem:20210613T163000
DTSTAMP:20210603T074851Z
URL:https://web.iem.technion.ac.il/site/iemevents/the-reactive-hidden-mark
ov-model-real-time-estimation-of-customer-satisfaction-in-contact-centers/
SUMMARY:The Reactive Hidden Markov Model: Real-Time Estimation of Customer
Satisfaction in Contact Centers [ \n Graduate Student Seminar\n Se
minars\n \n ]
DESCRIPTION:By: M.Sc. Lior Tony Landa \n Advisors: Prof. Galit Yom-Tov \n
Where: ZOOM From:\nTechnion\nAbstract:\n\nCustomer satisfaction is a key p
erformance indicator\, usually measured and analyzed using retrospective s
urveys. Retrospective analysis\, however\, offers limited value since the
organization cannot use it to address problems as they arise. Rather than
waiting for a conversation to end\, we are creating prediction models that
estimate customer satisfaction in real-time.\n\nWe utilize technical deve
lopments in sentiment analysis tools as well as previous observations show
ing that customer sentiment during a conversation correlates with retrospe
ctive customer satisfaction ratings. Considering that real-time customer s
atisfaction is unknown\, we develop unsupervised learning classification m
odels\, based on hidden Markov models (HMMs) and sentiment analysis\, to c
ategorize the customer state at time t into some arbitrary state space. Th
ese states are then mapped to customer satisfaction scores using retrospec
tive prediction models of customer satisfaction.\n\nWe study two types of
HMMs. In addition to the classical HMM proposed by Baum (1966)\, we develo
p a new reactive-HMM that takes into account the agent reactions to custom
er behavior. We find that the reactive-HMM is more accurate at predicting
customer satisfaction in retrospect and hence is recommended for real-time
prediction.\n\nThis is joint work with Antonio Castellanos\, Yair Goldber
g\, and Galit Yom-Tov.\n\nZoom Link\n\nhttps://technion.zoom.us/j/38005416
16
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:86@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210620T143000
DTEND;TZID=Asia/Jerusalem:20210620T153000
DTSTAMP:20210614T111922Z
URL:https://web.iem.technion.ac.il/site/iemevents/learning-to-estimate-sea
rch-progress-using-sequences-of-states/
SUMMARY:Learning to Estimate Search Progress Using Sequences of States [ \n
Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Matan Sudry \n Advisors: DR. Erez Karpas\n Where: ZOOM
From:\nTechnion\nAbstract:\nMany problems of interest can be solved using
heuristic search algorithms. When solving a heuristic search problem\, we
are often interested in estimating search progress\, that is\, how much l
onger until we have a solution. Previous work on search progress estimatio
n derived formulas based on some relevant features that can be observed fr
om the behavior of the search algorithm. In this paper\, rather than manua
lly deriving such formulas we leverage machine learning to automatically l
earn more accurate search progress predictors. We train a Long Short-Term
Memory (LSTM) network\, which takes as input sequences of states expanded
by the search algorithm\, and predicts how far along with the search we ar
e. Importantly\, our approach still treats the search algorithm as a black
box and does not look into the contents of search states. An empirical ev
aluation shows our technique outperforms previous search progress estimati
on techniques.\n\n \;\n\nZoom Link\n\nhttps://technion.zoom.us/j/38005
41616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:85@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210627T143000
DTEND;TZID=Asia/Jerusalem:20210627T153000
DTSTAMP:20210614T052241Z
URL:https://web.iem.technion.ac.il/site/iemevents/robust-learning-in-netwo
rks/
SUMMARY:Robust learning in networks [ \n Graduate Student Seminar\n
Seminars\n \n ]
DESCRIPTION:By: PhD Segev Shlomov\n Advisors: Prof. Yakov Babichenko\n Wher
e: ZOOM From:\nTechnion\nAbstract:\n\nWe introduce the class of virtually
additive non-Bayesian learning heuristics to aggregating beliefs in social
networks. A virtually additive heuristic is characterized by a single fun
ction that maps a belief to a real number that represents the virtual beli
ef. To aggregate beliefs\, an agent simply sums up all the virtual beliefs
of his neighbors to obtain his new virtual belief.\nThis class of heurist
ics determines whether robust learning\, by any naive heuristic\, is possi
ble. That is\, we show that in a canonical setting with a binary state and
conditionally i.i.d. signals whenever it is possible to naively learn the
state robustly it is also possible to do so with a virtually additive heu
ristic.\nWe also extend our results to achieve network-robust learning wit
h dynamics that are based on local weights adjustments that agents assigne
d to each other in the network. These adjustments are based on the famous
Sinkhorn-Knopp matrix scaling algorithm.\n\n \;\n\nZoom Link\n\n \
;\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:94@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210711T143000
DTEND;TZID=Asia/Jerusalem:20210711T153000
DTSTAMP:20210707T074420Z
URL:https://web.iem.technion.ac.il/site/iemevents/flexible-entity-resoluti
on-for-multiple-intents/
SUMMARY:Flexible Entity Resolution for Multiple Intents [ \n Graduate S
tudent Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Bar Genossar\n Advisors: Prof. Avigdor Gal\n Where: ZO
OM From:\nTechnion\nAbstract: Entity resolution (ER)\, a longstanding pro
blem of data cleaning and integration\, aims at identifying different data
records that represent the same real-world entity. Existing approaches tr
eat ER focus only on finding perfectly matched records and separating the
corresponding from non-corresponding ones. However\, in real-world scenari
os\, where ER is part of a more general data project\, downstream applicat
ions may not only require resolution of records that refer to the same ent
ity but may also seek to match records that share different levels of comm
onality\, relating\, for example\, to various granularity levels of the re
solution. In what follows\, we introduce the problem of multiple intents e
ntity resolution (MIER)\, an extension to the universal (single intent) ER
task. As a solution\, we propose FlexER\, utilizing contemporary solution
s to universal ER tasks to solve multiple intents entity resolution. FlexE
R addresses the problem as multi-label classification and combines intent-
based representations of record pairs using a graph convolutional network
(GCN) to improve the outcome to multiple resolution problems. A large-scal
e empirical evaluation introduces a new benchmark and\, using also three w
ell-known benchmarks\, shows that FlexER effectively solves the MIER probl
em and outperforms the state-of-the-art for a universal ER.\n\nZoom Link\n
\nhttps://technion.zoom.us/j/3800541616\n\n \;\n\n \;
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:111@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210808T143000
DTEND;TZID=Asia/Jerusalem:20210808T153000
DTSTAMP:20210804T055833Z
URL:https://web.iem.technion.ac.il/site/iemevents/interactive-reinforcemen
t-learning-with-dynamic-query-cost-2/
SUMMARY:Interactive Reinforcement Learning with Dynamic Query Cost [ \n
Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Sveta Bikulov\n Advisors: Ofra Amir\n Where: ZOOM From
:\nTechnion\nAbstract:\n\nPeople increasingly interact with intelligent ag
ents. Some of these agents\, e.g. social robots\, need to adapt and person
alize to the person they interact with. To achieve this\, the agent should
be able to receive feedback about its actions and learn the users' prefer
ences. However\, people do not always provide such feedback. A possible ap
proach would be for the agent to ask the user for feedback for each action
it executes\, but this is not desirable since it might irritate the user.
Therefore\, the agent needs to decide when to ask for feedback\, taking i
nto consideration the costs and benefits of doing so. As an attempt to sol
ve this problem\, we formalize the problem of interactive Multi-Armed Band
its with dynamic query cost\, layout key challenges\, and analyze possible
solutions of existing methods to solve this problem. The project is done
in collaboration with Intuition Robotics.\n\nZoom Link\n\nhttps://technion
.zoom.us/j/3800541616\n\n \;\n\n \;
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:110@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210810T143000
DTEND;TZID=Asia/Jerusalem:20210810T153000
DTSTAMP:20210727T050901Z
URL:https://web.iem.technion.ac.il/site/iemevents/frank-wolfe-with-a-neare
st-extreme-point-oracle/
SUMMARY:Frank-Wolfe with a Nearest Extreme Point Oracle [ \n Graduate S
tudent Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Noam Wolf\n Advisors: Dan Garber\n Where: ZOOM From:\n
Technion\nAbstract:\n\nWe consider variants of the classical Frank-Wolfe a
lgorithm for constrained smooth convex minimization\, that instead of acce
ss to the standard oracle for minimizing a linear function over the feasib
le set\, have access to an oracle that can find an extreme point of the fe
asible set that is closest in Euclidean distance to a given vector. We fir
st show that for many feasible sets of interest\, such an oracle can be im
plemented with the same complexity as the standard linear optimization ora
cle. We then show that with such an oracle we can design new Frank-Wolfe v
ariants which enjoy significantly improved complexity bounds in case the s
et of optimal solutions lies in the convex hull of a subset of extreme poi
nts with small diameter (e.g.\, a low-dimensional face of a polytope). In
particular\, for many 0-1 polytopes\, under quadratic growth and strict co
mplementarity conditions\, we obtain the first linearly convergent variant
with rate that depends only on the dimension of the optimal face and not
on the ambient dimension.\n\nZoom Link\n\nhttps://technion.zoom.us/j/38005
41616\n\n \;\n\n \;
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:112@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210919T143000
DTEND;TZID=Asia/Jerusalem:20210919T153000
DTSTAMP:20210914T051318Z
URL:https://web.iem.technion.ac.il/site/iemevents/testing-hypotheses-on-a-
tree-with-fdr-control-for-the-highest-resolution-discoveries/
SUMMARY:Testing hypotheses on a tree with FDR control for the highest resol
ution discoveries [ \n Graduate Student Seminar\n Seminars\n \n
]
DESCRIPTION:By: M.Sc. Pnina Aizenberg\n Advisors: DR. Marina Bogomolov\n Wh
ere: ZOOM From:\nTechnion\nAbstract:\nSeveral applications require testing
a large number of statistical hypotheses with hierarchical tree structure
\, where the child hypotheses are more specific than their parent hypothes
es. In such cases\, rejection of a child hypothesis makes the rejection of
all its ancestor hypotheses redundant\, therefore it is natural to focus
on the highest resolution discoveries\, i.e. the outer nodes\, defined as
the discovered nodes that are not ancestors of other discoveries.\n\nWe pr
opose a hierarchical method for testing trees of hypotheses with outer nod
es false discovery rate (FDR) control\, which exploits the logical relatio
nships between the hypotheses in the tree. Our theoretical and numerical r
esults address separately testing trees of hypotheses which are induced by
hierarchical clustering of explanatory variables in a linear regression m
odel\, where the clustering is based on the correlations between the varia
bles. In this setting\, the method identifies the smallest clusters with e
vidence for containing important variables\, while controlling for the exp
ected proportion of discovered clusters with no important variables.\n\nOu
r method is compared to several competitors in a simulation study\, and is
shown to be more powerful in several settings. We illustrate the applicat
ion of the method for hierarchical variable selection on real data\, and s
how that in some cases it leads to more specific discoveries than its comp
etitors.\n\n \;\n\nZoom Link\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:114@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20210930T143000
DTEND;TZID=Asia/Jerusalem:20210930T153000
DTSTAMP:20210922T073835Z
URL:https://web.iem.technion.ac.il/site/iemevents/adaptive-methods-for-tes
ting-hypotheses-with-group-structure-while-simultaneously-controlling-seve
ral-error-rates/
SUMMARY:Adaptive methods for testing hypotheses with group structure while
simultaneously controlling several error rates [ \n Graduate Student S
eminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Ido Griness\n Advisors: Dr. Marina Bogomolov\n Where
: ZOOM From:\nTechnion\nAbstract:\nIn many statistical applications a larg
e set of hypotheses is tested\, and the hypotheses can be naturally classi
fied into groups based on different criteria\, defined by the characterist
ics of the problem. Examples of such applications include brain imaging\,
microbiome\, and genome-wide association studies. In such settings\, it ma
y be of interest to identify groups containing signals\, for each partitio
n into groups\, with control over false discoveries. This goal was address
ed by Barber and Ramdas (2016) and Ramdas\, Barber\, Wainwright\, and Jord
an (2019) who developed the p-filter method for controlling the group-leve
l false discovery rate (FDR)\, simultaneously for all partitions.\n\nWe ad
dress the same goal\, and aim to improve the power of the p-filter method
by capturing the group structure of the hypotheses using adaptive weights.
We prove that the modified method controls the group-level FDR for each p
artition into groups under independence\, and show by simulations that it
seems to retain the control under certain forms of positive dependence. Ou
r simulation study shows that the proposed modification improves the power
of the method significantly in the settings where the signals are concent
rated within groups\, and does not result in a power loss in less favorabl
e settings. We compare the performance of the modified method to that of t
he original p-filter on real brain imaging data\, where the hypotheses are
grouped with respect to two criteria.\n\n\nLink to Zoom\n\nhttps://techni
on.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:116@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20211017T143000
DTEND;TZID=Asia/Jerusalem:20211017T153000
DTSTAMP:20211005T053831Z
URL:https://web.iem.technion.ac.il/site/iemevents/learning-discrete-struct
ured-variational-auto-encoder-using-natural-evolution-strategies/
SUMMARY:Learning Discrete Structured Variational Auto-Encoder using Natural
Evolution Strategies [ \n Graduate Student Seminar\n Seminars\n
\n ]
DESCRIPTION:By: MSc. Alon Berliner\n Advisors: Prof. Tamir Hazan\n Where: Z
OOM From:\nTechnion\nAbstract:\n\nDiscrete variational auto-encoders (VAEs
) are able to represent semantic latent spaces in generative learning. In
many real-life settings\, the discrete latent space consists of high-dimen
sional structures\, and propagating gradients through the relevant structu
res often requires enumerating over exponentialy many structures. Recently
\, various approaches were devised to propagate approximated gradients wit
hout enumerating over the space of possible structures. In this work\, we
use Natural Evolution Strategies (NES)\, a class of gradient-free black-bo
x optimization algorithms\, to learn discrete VAEs. NES algorithms are com
putationally appealing as they estimate gradients with forward pass evalua
tions only\, thus they do not require to propagate gradients through their
discrete structures. We demonstrate empirically that optimizing discrete
structured VAEs using NES is as effective as gradient-based approximations
. Lastly\, we prove NES converges for non-Lipschitz functions as appear in
discrete structured VAEs.\n\n \;\n\nZoom Link\n\nhttps://technion.zo
om.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:124@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20211024T143000
DTEND;TZID=Asia/Jerusalem:20211024T153000
DTSTAMP:20211021T073312Z
URL:https://web.iem.technion.ac.il/site/iemevents/wisdom-of-the-crowds-sem
i-strong-form-efficiency-in-prediction-markets/
SUMMARY:Wisdom of the Crowds: Semi-Strong Form Efficiency in Prediction Mar
kets [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M. Sc. Yosef Mentzer \n Advisors: Prof. Doron Kliger \n W
here: ZOOM From:\nTechnion\nAbstract:\n\nAccording to the Efficient Market
Hypothesis (EMH)\, prices fully reflect all relevant information at any p
oint in time. Much of the EMH theoretical and empirical basis has been cha
llenged\, researchers have been turning to theories including models of hu
man psychology\, and the field of behavioral finance emerged. In the last
decade\, due to some of its convenient features\, prediction markets have
been progressively employed by researchers as a test setting for the EMH a
nd for behavioral finance hypotheses.\n\nI gather historical data on predi
ction markets of soccer match results from an online betting exchange and
train a machine learning prediction model for the dynamics of prices assoc
iated with the team that scores a goal. I then devise an investment strate
gy based on the model's predictions and perform a Monte Carlo simulation t
o compare the returns of a naïve portfolio based on all goals with the re
turns of a portfolio based on the investment strategy. The results allow m
e to shed light on semi-strong form efficiency of the prediction market in
the minutes following a goal.\n\n \;\n\nZoom Link\n\nhttps://technion
.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:125@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20211107T143000
DTEND;TZID=Asia/Jerusalem:20211107T153000
DTSTAMP:20211028T055843Z
URL:https://web.iem.technion.ac.il/site/iemevents/a-theoretical-and-empiri
cal-study-of-the-weighted-completion-time-minimization-problem-with-capaci
tated-parallel-machines/
SUMMARY:A theoretical and empirical study of the weighted completion time m
inimization problem with capacitated parallel machines [ \n Graduate S
tudent Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc Iyar Zaks\n Advisors: Izack Cohen\n Where: ZOOM From:\
nTechnion\nThe weighted completion time minimization problem for capacitat
ed parallel machines is a fundamental problem in modern cloud computing en
vironments. Because of the problem’s NP-hardness\, we study heuristic ap
proaches with provable approximation guarantees. Via a numerical study and
a developed mixed integer linear program of the problem\, we demonstrate
the performance of the suggested algorithm with respect to the optimal sol
utions and other alternative scheduling methods.\n\nZoom Link\n\nhttps://t
echnion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:132@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20211114T143000
DTEND;TZID=Asia/Jerusalem:20211114T153000
DTSTAMP:20211111T063911Z
URL:https://web.iem.technion.ac.il/site/iemevents/canonical-correlation-an
alysis-for-multi-trait-gwas/
SUMMARY:Canonical Correlation Analysis for Multi-Trait GWAS [ \n Gradua
te Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Lior Landau\n Advisors: Or Zuk and Marina Bogomolov \
n Where: ZOOM From:\nTechnion\nAbstract:\n\n \;\n\nIn this work\, we f
ocus on multi-trait GWAS with polygenic correlated traits. We present a ne
w method and software for detecting single nucleotide polymorphisms (SNPs)
that are associated with at least one trait by testing the association of
SNPs with data-dependent linear combinations of traits. Our method contro
ls the expectation of the proportion of discovered SNPs that are not corre
lated with any phenotype (FDR)\, and exploits the genetic and phenotypic c
orrelations in order to gain power for detecting SNPs associated with mult
iple phenotypes. The method operates by combining known ideas: first\, ide
ntify the most correlated linear combinations of phenotypes and SNPs based
on Canonical Correlation Analysis (CCA). Then\, aggregate for each SNP th
e association signal from the multiple linear trait combinations using a w
eighted Simes approach.\nWe tested several types of scenarios to check our
method's strength and robustness in a simulation study. We demonstrate th
at our proposed method controls the FDR and increases statistical power ov
er methods that are variations of ours as well as over known methods from
the literature. The proposed method was evaluated on the UK Biobank datase
t consisting of 800\,000 SNPs measured over 500\,000 individuals. This ana
lysis allowed us to identify SNPs that were associated with several phenot
ypes. Our approach discovered the highest number of significant SNPs both
when tested for associations with lipid-related phenotypes as well as with
BMI-related phenotypes.\n\n \;\n\nZoom Link\n\nhttps://technion.zoom.
us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:134@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20211121T143000
DTEND;TZID=Asia/Jerusalem:20211121T153000
DTSTAMP:20211117T120420Z
URL:https://web.iem.technion.ac.il/site/iemevents/automated-repair-of-neur
al-networks/
SUMMARY:Automated Repair of Neural Networks [ \n Graduate Student Semin
ar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Dor Cohen\n Advisors: Prof. Ofer Strichman\n Where:
ZOOM From:\nTechnion\nAbstract:\n\n \;\n\nOver the last decade\, artif
icial Neural Networks (NNs) have been widely used in many applications inc
luding safety-critical ones\, such as autonomous systems. Hence\, it is hi
ghly important to provide guarantees that such systems work correctly. In
this work\, we exploit methods from the field of formal verification\, to
produce a correct system from a given specification. Specifically\, we int
roduce a framework for repairing an unsafe NN w.r.t. safety properties. Fu
rther\, we perform extensive experiments to demonstrate the capabilities o
f our proposed framework for generating correct NNs. To prove our method's
effectiveness\, we compare it to a naive baseline. Lastly\, we provide an
algorithm to automatically repair NNs given safety requirements.\n\n
\;\n\nZoom Link\n\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:140@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20211212T143000
DTEND;TZID=Asia/Jerusalem:20211212T143000
DTSTAMP:20211206T055421Z
URL:https://web.iem.technion.ac.il/site/iemevents/pipe-tightness-testing-i
n-fuel-storage-facilities/
SUMMARY:Pipe tightness testing in fuel storage facilities [ \n Graduate
Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M. Sc Arkadiy Haikin \n Advisors: Dr. Yefim Haim Michlin a
nd Prof. Eitan Naveh \n Where: ZOOM From:\nTechnion\nAbstract:\nThe piping
tightness tests used today in Israel are performed according to an outdat
ed API standard intended for underground piping only. Also\, as opposed to
the latest guidelines from the US Environmental Protection Agency - EPA\,
the standard defines that the pressure at the end of the test should not
be lower than a certain threshold and does not define absolute permissible
leak rate values.\nIn order to assess the detection capacity of a static
pressure test according to a standard and analyze ways to improve it\, a q
uantitative model was developed. The model takes into account various vari
ables\, including: test pressure\, gas-liquid proportion in the pipe and t
he temperature difference uncertainty between the begging and the end of t
he test.\nDuring the analysis it was found that in case of static pressure
test\, the proportion of the gases in the pipe has a significant effect o
n the detection capacity. Therefore\, a test procedure was proposed that p
rovides an estimate of the gas proportions in the pipe before the test is
performed. A short static pressure employed was found to provide a relativ
ely high detection capacity in the case of underground piping at low test
pressures only. It turned out that\, in order to meet the detection capaci
ty recommended by the EPA\, the pressure drop threshold must be lowered at
the end of the test.\nThe possibility of increasing test duration 24 hour
s was also examined\, it was found that the detection capacity can be sign
ificantly improved\, however there is a maximum pressure limit in the pipe
due to fluctuations in temperature during the test. Therefore\, a 24 hour
static pressure test is suitable for pipes that are mostly underground\,
so the average temperature in them varies very little.\nIn order to provid
e an excess pressure increase solution\, the possibility of maintaining a
constant pressure during the test was examined by addition and draining th
e test liquid from the pipe to a balanced reservoir. It was found that 24
hour test at constant pressure provides a very high detection capacity\, w
ithout the need to estimate the proportion of gases in the pipe. Moreover\
, the test is suitable for a wide range of pressures and above all is suit
able for piping with varying degree of exposure to environment. Finally\,
a conceptual design of a relatively simple test system for performance of
constant and controlled pressure test\, was presented.\n\n \;\n\nZoom
Link\nhttps://technion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:157@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20220109T143000
DTEND;TZID=Asia/Jerusalem:20220109T153000
DTSTAMP:20220104T065910Z
URL:https://web.iem.technion.ac.il/site/iemevents/conformance-checking-ove
r-stochastically-known-logs/
SUMMARY:Conformance Checking over Stochastically Known Logs [ \n Gradua
te Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Eli Bogdanov\n Advisors: Dr. Izack Cohen and Prof. Av
igdor Gal\n Where: ZOOM From:\nTechnion\nAbstract:\n\nProcess mining facil
itates data-driven process modeling\, analysis and optimization by applyin
g techniques from Data Science\, Information Systems and Operations Manage
ment disciplines. The three main process mining tasks are: process discove
ry\, conformance checking and process enhancement. The data for these task
s is often stored in the form of event logs and collections of traces wher
e each trace is a sequence of events and activities that were created foll
owing a specific process realization. Some of these data are uncertain for
a variety of reasons. Data uncertainty may be attributed to technical rea
sons' such as sensor inaccuracies\, the use of probabilistic data classifi
cation models\, data quality reduction during processing and low quality o
f data capturing devices. We focus on process mining with uncertain event
data when the probability distribution functions of the event data are kno
wn. In this paper we propose a new algorithm for conformance checking in s
uch a setting\, characterize and mathematically define the building bloc
ks for stochastic conformance checking and conducting experiments in order
to evaluate our approach.\n\n \;\n\nZoom Link\n\nhttps://technion.zoo
m.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:158@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20220116T143000
DTEND;TZID=Asia/Jerusalem:20220116T153000
DTSTAMP:20220105T114452Z
URL:https://web.iem.technion.ac.il/site/iemevents/inventory-optimization-i
n-omni-channel-fulfilment-model/
SUMMARY:Inventory optimization in Omni-channel fulfilment model [ \n Gr
aduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Hagai Rettig\n Advisors: Prof. Yale Herer\n Where: ZO
OM From:\nTechnion\nAbstract:\n\nWe study a model of a supply chain chain
network\, combining traditional Brick &\; Mortar (B&\;M) stores with
collocated click &\; collect points. These points are supplied by eith
er a dark store or B&\;M store itself. For this model we investigate se
tting the optimal inventory at the beginning of every period at each B&
\;M store and the dark store. We also investigate the optimal fulfilment p
olicy when customer demand is revealed. We first find the optimal fulfilme
nt policy and then formulate the problem as a two stage stochastic problem
with recourse. We find the optimal inventory levels using Infinitesimal P
erturbation Analysis.\n\n \;\n\nZoom Link\n\nhttps://technion.zoom.us/
j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:163@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20220117T113000
DTEND;TZID=Asia/Jerusalem:20220117T123000
DTSTAMP:20220110T064342Z
URL:https://web.iem.technion.ac.il/site/iemevents/a-first-order-method-for
-solving-non-differentiable-and-non-strongly-convex-bilevel-optimization/
SUMMARY:A First Order Method for Solving Non-Differentiable and Non-strongl
y convex Bilevel Optimization [ \n Graduate Student Seminar\n Semi
nars\n \n ]
DESCRIPTION:By: M.Sc. Roey Merchav\n Advisors: Prof. Shoam Sabach\n Where:
ZOOM From:\nTechnion\nAbstrasct:\n\nBi-level optimization problems seek t
o find a minimizer of an outer objective function constrained to the minim
izers set of an inner optimization problem. These problems\, both in the c
onvex and non-convex settings\, have diverse applications in the fields of
machine learning\, signal processing and many more. Since these problems
inherently don't satisfy Slater's condition\, exact solutions are mostly d
ifficult to find. Consequently\, existing algorithms only focus on approxi
mating them. Most algorithms for bi-level optimization problems are based
on regularization techniques\, which regularize the outer objective functi
on with the inner objective function in a certain way. Moreover\, in the c
onvex setting\, all the proposed algorithms provide (if any) a convergence
rate result only in terms of the inner objective function\, but only unde
r restrictive assumptions such as the outer objective function is smooth a
nd/or strongly convex (except a very recent work that propose a very compl
icated algorithm).\n\nIn this thesis\, we propose the Bi-Sub-Gradient (Bi-
SG) method\, which is a generalization of the classical sub-gradient metho
d to the setting of bi-level optimization problems. This is a first-order
method that is very easy to implement in the sense that it requires only a
computation of the associated proximal mapping or a sub-gradient of the o
uter objective function\, in addition to a proximal gradient step on the i
nner optimization problem (a step that is shared by many algorithms). We s
how\, under very mild assumptions\, that Bi-SG tackles bi-level optimizati
on problems and achieves several theoretical guarantees. First\, Bi-SG enj
oys sub-linear rates both in terms of the inner and outer objective functi
ons. Moreover\, if the outer objective function is additionally strongly c
onvex (could be still non-smooth)\, the outer rate can be improved to a li
near rate. Last\, we prove that the distance of the generated sequence to
the set of optimal solutions of the bi-level problem converges to zero.\n\
nIt should be noted that our mild assumptions do not include any different
iablity of the outer objective function nor its strong convexity. For inst
ance\, any smooth or Lipschitz continuous outer objective function satisfi
es the needed assumptions. Finally\, we demonstrate Bi-SG's performances i
n an extensive numerical comparison.\n\n \;\n\nZoom Link\n\nhttps://te
chnion.zoom.us/j/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:164@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20220120T103000
DTEND;TZID=Asia/Jerusalem:20220120T113000
DTSTAMP:20220112T074447Z
URL:https://web.iem.technion.ac.il/site/iemevents/open-surgery-tool-classi
fication-and-hand-utilization-using-a-multi-camera-system/
SUMMARY:Open surgery tool classification and hand utilization using a multi
-camera system [ \n Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: M.Sc. Kristina Basiev\n Advisors: Prof. Shlomi Laufer\n Whe
re: ZOOM From:\nTechnion\nAbstract:\n\nThe goal of this work is to use mul
ti-camera video to classify open surgery tools as well as identify which
tool is held in each hand. Multi-camera systems help prevent occlusions i
n open surgery video data. Furthermore\, combining multiple views such as
a Top-view camera covering the full operative field and a Close-up camera
focusing on hand motion and anatomy\, may provide a more comprehensive v
iew of the surgical workflow. However\, multi-camera data fusion poses a
new challenge: a tool may be visible in one camera and not the other. Thu
s\, we defined the global ground truth as the tools being used regardless
their visibility. Therefore\, tools that are out of the image should be
remembered for extensive periods of time while the system responds quic
kly to changes visible in the video.\n\nZoom Link\n\nhttps://technion.zoom
.us/j/3800541616\n\n \;
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VEVENT
UID:165@web.iem.technion.ac.il
DTSTART;TZID=Asia/Jerusalem:20220123T143000
DTEND;TZID=Asia/Jerusalem:20220123T143000
DTSTAMP:20220116T095310Z
URL:https://web.iem.technion.ac.il/site/iemevents/using-sub-document-units
-for-document-and-passage-retrieval/
SUMMARY:Using Sub Document Units for Document and Passage Retrieval [ \n
Graduate Student Seminar\n Seminars\n \n ]
DESCRIPTION:By: Ph.D. Eilon Sheetrit\n Advisors: Prof. Oren Kurland\n Where
: ZOOM From:\nTechnion\nAbstract:\nThe ease of finding and retrieving info
rmation has become an integral part in our lives. With the growing surge o
f data\, search engines facilitate the task of finding the relevant inform
ation pertaining to a need in large collections. Yet\, searching massive v
olumes of diverse textual documents in order to satisfy a specific informa
tion need of a user is extremely challenging.\n\nThe retrieved units in co
mmercial search engines\, as is the case for enterprise engines\, are full
\ndocuments\; i.e.\, documents in a corpus are ranked by their presumed re
levance to the information need expressed by a query. Relevant documents c
an contain much non-relevant information\; specifically\, only a short pas
sage with relevant information suffices to deem the entire document releva
nt. This fact has motivated work on passage retrieval and passage-based do
cument retrieval. In the former\, a.k.a\, focused retrieval\, the retrieve
d units are passages\, and in the latter\, the retrieved units are documen
ts but passage-level information is used for document ranking.\n\nIn this
thesis\, we first present a suite of novel document retrieval methods that
are based on learning document ranking function using an effective passag
e ranking. We then explore the use of inter-passage similarities to improv
e the effectiveness of the retrieved list of passages. To lay theoretical
grounds for the use of inter-passage similarities\, we propose a novel set
of cluster hypothesis tests for passages. Finally\, we examine and analyz
e the use of true relevance feedback at the token level on the retrieval p
erformance of document ranking.\n\nZoom Link\n\nhttps://technion.zoom.us/j
/3800541616
CATEGORIES:Graduate Student Seminar,Seminars
END:VEVENT
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
X-LIC-LOCATION:Asia/Jerusalem
BEGIN:STANDARD
DTSTART:20191027T010000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20200327T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20201025T010000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20210326T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20211031T010000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
END:STANDARD
END:VTIMEZONE
END:VCALENDAR