Abstract: With CMOS transistor technology scaling to the order of tens of nanometers, the inherent physical limitation of having only a few atoms comprise the entire transistor are beginning to surface.
Abstract: From a security perspective, in the current age where malware (malicious software) distribution is rampant, it is dangerous to execute programs downloaded from the internet.
Abstract: In this talk, we shall state central limit theorems for many local and global functionals of simplicial complexes built on various random point processes.
Abstract: Necessary and sufficient conditions on a function $f(p)$ are given for the existence of a simulation procedure to simulate a Bernoulli random variable with success probability $f(p)$ from
Abstract: An optimization problem is said to be fixed parameter tractable if there is some parameter k independent of the input size n, such that the problem can be solved in O(f(k).n^c) time, where c is a constant, and f is an arbitrary function
Abstract: In this talk, we will prove that the group of symmetries of a standard (3x3x3) Rubik's cube is isomorphic to (\mathbb{Z}_37 \times \mathbb{Z}_2^{11}) \rtimes ((A_8 \times A_{12}) \rtimes Z_2).
Abstract: With the proposition to install a large number of phasor measurement units (PMUs) in the future electric grid, it is essential to provide robust communications infrastructure for phasor data across the network.
Abstract: In this talk, we shall look at logics over words. It is known that first order logic (FO) with an order relation, <, defines exactly the set of all aperiodic regular languages.
Abstract: In the orienteering problem, we are given a metric space (the distances are supposed to represent travel times between the locations), a start vertex ("home") and a deadline B, and want to visit as many points as possible using a tour of
