Complex structure formation and fast focusing of light inside or through turbid media is a challenging task due to refractive index heterogeneity, random light scattering and speckle noise formation. Here, we have proposed a weighted-mutation assiste...
We present the Benchmark of Information Retrieval (IR) tasks with Complex Objectives (BIRCO). BIRCO evaluates the ability of IR systems to retrieve documents given multi-faceted user objectives. The benchmark's complexity and compact size make it sui...
Mathematical ideas and approaches common in complexity-related fields have been fruitfully applied in experimental high energy physics also. We briefly review some of the cross-pollination that is occurring....
In this paper, we address a bicriteria network design problem that arises from practical applications in urban and rural public transportation planning. We establish the problem's complexity and demonstrate inapproximability results, highlighting the...
The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it po...
We define the surface complex for $3$-manifolds and embark on a case study in the arena of Seifert fibered spaces. The base orbifold of a Seifert fibered space captures some of the topology of the Seifert fibered space, so, not surprisingly, the surf...
The Raven Rock Mountain Complex (RRMC), also known as Site R and simply The Rock, is a U.S. military installation with an underground nuclear bunker near
hello. I came to the realisation today that I have a saviour complex. I think I am morally superior than others. I was bullied, left out and treated like shit when I was a teen. As a young adult who...
Financial markets are well known examples of multi-fractal complex systems that have garnered much interest in their characterization through complex network theory. The recent studies have used correlation based distance metrics for defining and ana...
Networks are essential for analyzing complex systems. However, their growing size necessitates backbone extraction techniques aimed at reducing their size while retaining critical features. In practice, selecting, implementing, and evaluating the mos...
In one complex variable it is well known that if we consider the family of all holomorphic functions on the unit disc that fix the origin and with first derivative equal to 1 at the origin, then there exists a constant $ρ$, independent of the functi...
For more than two decades the Tevatron proton-antiproton collider was the centerpiece of the world's high energy physics program. The collider was arguably one of the most complex research instruments ever to reach the operation stage and is widely r...
Today's programmers can choose from an exceptional range of programming languages, each with its own traits, purpose, and complexity. A key aspect of a language's complexity is how hard it is to compile programs in the language. While most programmer...
We prove that the restricted normal holonomy group of a Kähler submanifold of the complex hyperbolic space $\mathbb{C}H^{n}$ is always transitive, provided the index of relative nullity is zero. This contrasts with the case of $\mathbb{C}P^{n}$, whe...
We investigate Cousin (bi-)complexes in the setting of motives. Over essentially smooth local schemes, the columns of the Cousin bicomplex with coefficients in any stable motivic homotopy type are shown to be acyclic. On the other hand, we also const...
In this thesis, the class of modules whose Cousin complexes have finitely generated cohomologies are studied as a subclass of modules which have uniform local cohomological annihilators and it is shown that these two classes coincide over local rings...
I got a notice via email a while back that the Apartment complex where I live in Denver was going to be installing "SmartHome" devices in my apartment. I didn't respond because I assumed I would have ...
A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a given simp...
These are notes from a basic course in Several Complex Variables...
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about presentations of so...