קולוקוויום וסמינרים

כדי להצטרף לרשימת תפוצה של קולוקוויום מדעי המחשב, אנא בקר בדף מנויים של הרשימה.


Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.

Academic Calendar at Technion site.

קולוקוויום וסמינרים בקרוב

  • A Two-Stage Masked LM Method for Term Set Expansion

    דובר:
    גיא קושלביץ, הרצאה סמינריונית למגיסטר
    תאריך:
    יום חמישי, 1.10.2020, 11:30
    מקום:
    הרצאה באמצעות זום: https://technion.zoom.us/j/98063183973
    מנחה:
    Prof. Shaul Markovitch

    We tackle the task of Term Set Expansion (TSE): given a small seed set of example terms from a semantic class, finding more members of that class. The task is of great practical utility, and also of theoretical utility as it requires generalization from few examples. Previous approaches to the TSE task can be characterized as either distributional or pattern-based. We harness the power of neural masked language models (MLM) and propose a novel TSE algorithm, which combines the pattern-based and distributional approaches. Due to the small size of the seed set, fine-tuning methods are not effective, calling for more creative use of the MLM. The gist of the idea is to use the MLM to first mine for informative patterns with respect to the seed set, and then to obtain more members of the seed class by generalizing these patterns. Our method outperforms state-of-the-art TSE algorithms.

  • Age-aware Fairness in Blockchain Transaction Ordering

    דובר:
    יעקב סוקוליק;, הרצאה סמינריונית למגיסטר
    תאריך:
    יום שלישי, 13.10.2020, 15:30
    מקום:
    הרצאה באמצעות זום: https://technion.zoom.us/j/99311227766
    מנחה:
    Prof. Ori Rottenstreich

    In blockchain applications, transaction latency is a key factor in the quality of service (QoS). Each application that uses the blockchain network has the motivation to reduce the latency for its own transactions. The block proposer selects which pending transaction to include in the proposed block and would like to prioritize its own application transactions over those of other applications. To maintain fairness, a block proposer can be asked to select the transactions randomly among pending transactions it is aware of. The random selection might imply high variance of the latency such that some transactions wait a long time before included in the chain. We present an alternative, age-aware approach towards fairness so that transaction priority is increased upon observing a large waiting time. It can be challenging to validate some transaction age since the age of a transaction is not absolute and a node might present its transactions as older to obtain priority. We consider various network restrictions on transaction propagation and explain how to enhance fairness in each one of them. In a general case, we present usage of declaration schemes in which a node efficiently declares its pending transactions providing the ability to validate transaction age. We demonstrate the advantages of our approach in reducing the tail latency on Ethereum and synthetic data.