Gr\"obner-Shirshov bases for LL-algebras

In this paper, we firstly establish Composition-Diamond lemma for $\Omega$-algebras. We give a Gr\"{o}bner-Shirshov basis of the free $L$-algebra as a quotient algebra of a free $\Omega$-algebra, and then the normal form of the free $L$-algebra is obtained. We secondly establish Composition-Diamond lemma for $L$-algebras. As applications, we give Gr\"{o}bner-Shirshov bases of the free dialgebra and the free product of two $L$-algebras, and then we show four embedding theorems of $L$-algebras: 1) Every countably generated $L$-algebra can be embedded into a two-generated $L$-algebra. 2) Every $L$-algebra can be embedded into a simple $L$-algebra. 3) Every countably generated $L$-algebra over a countable field can be embedded into a simple two-generated $L$-algebra. 4) Three arbitrary $L$-algebras $A$, $B$, $C$ over a field $k$ can be embedded into a simple $L$-algebra generated by $B$ and $C$ if $|k|\leq \dim(B*C)$ and $|A|\leq|B*C|$, where $B*C$ is the free product of $B$ and $C$.Comment: 22 page

ConaCLIP: Exploring Distillation of Fully-Connected Knowledge Interaction Graph for Lightweight Text-Image Retrieval

Large-scale pre-trained text-image models with dual-encoder architectures (such as CLIP) are typically adopted for various vision-language applications, including text-image retrieval. However,these models are still less practical on edge devices or for real-time situations, due to the substantial indexing and inference time and the large consumption of computational resources. Although knowledge distillation techniques have been widely utilized for uni-modal model compression, how to expand them to the situation when the numbers of modalities and teachers/students are doubled has been rarely studied. In this paper, we conduct comprehensive experiments on this topic and propose the fully-Connected knowledge interaction graph (Cona) technique for cross-modal pre-training distillation. Based on our findings, the resulting ConaCLIP achieves SOTA performances on the widely-used Flickr30K and MSCOCO benchmarks under the lightweight setting. An industry application of our method on an e-commercial platform further demonstrates the significant effectiveness of ConaCLIP.Comment: ACL 2023 Industry Trac

Selection of Ovine Oocytes by Brilliant Cresyl Blue Staining

Sheep oocytes derived from the ovaries collected from the slaughterhouse are often used for research on in vitro embryo production, animal cloning, transgenesis, embryonic stem cells, and other embryo biotechnology aspects. Improving the in vitro culture efficiency of oocytes can provide more materials for similar studies. Generally, determination of oocyte quality is mostly based on the layers of cumulus cells and cytoplasm or cytoplasm uniformity and colors. This requires considerable experience to better identify oocyte quality because of the intense subjectivity involved (Gordon (2003), Madison et al. (1992) and De Loos et al. (1992)). BCB staining is a function of glucose-6-phosphate dehydrogenase (G6PD) activity, an enzyme synthesized in developing oocytes, which decreases in activity with maturation. Therefore, unstained oocytes (BCB−) are high in G6PD activity, while the less mature oocytes stains are deep blue (BCB+) due to insuffcient G6PD activity to decolorize the BCB dye

Anesthesia Services in the Time of COVID

Our hospital is a 400-bed Level-1 trauma center with 78 ICU beds serving the greater Louisville metropolitan area. The COVID-19 pandemic forced our hospital to re-evaluate our core business operations and to develop a coherent response to a fluid situation. Between March 15 and May 15, 2020, the University of Louisville Hospital admitted more than 100 COVID-19 inpatients, approximately 30 were admitted to the intensive care unit (ICU) and most required endotracheal intubation. The following review describes our Department of Anesthesiology & Perioperative Medicine foci, actions and rationale during the COVID-19 pandemic. While we hope not to experience another pandemic in the near future, this review may be a helpful starting point for preparing for future respiratory spread pandemics

FIRST: A Million-Entry Dataset for Text-Driven Fashion Synthesis and Design

Text-driven fashion synthesis and design is an extremely valuable part of artificial intelligence generative content(AIGC), which has the potential to propel a tremendous revolution in the traditional fashion industry. To advance the research on text-driven fashion synthesis and design, we introduce a new dataset comprising a million high-resolution fashion images with rich structured textual(FIRST) descriptions. In the FIRST, there is a wide range of attire categories and each image-paired textual description is organized at multiple hierarchical levels. Experiments on prevalent generative models trained over FISRT show the necessity of FIRST. We invite the community to further develop more intelligent fashion synthesis and design systems that make fashion design more creative and imaginative based on our dataset. The dataset will be released soon.Comment: 11 pages, 8 figure

Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments

Constructing key-agreement protocols in the random oracle model (ROM) is a viable method to assess the feasibility of developing public-key cryptography within Minicrypt. Unfortunately, as shown by Impagliazzo and Rudich (STOC 1989) and Barak and Mahmoody (Crypto 2009), such protocols can only guarantee limited security: any $\ell$-query protocol can be attacked by an $O(\ell^2)$-query adversary. This quadratic gap matches the key-agreement protocol proposed by Merkle (CACM 78), known as Merkle\u27s Puzzles. Besides query complexity, the communication complexity of key-agreement protocols in the ROM is also an interesting question in the realm of find-grained cryptography, even though only limited security is achievable. Haitner et al. (ITCS 2019) first observed that in Merkle\u27s Puzzles, to obtain secrecy against an eavesdropper with $O(\ell^2)$ queries, the honest parties must exchange $\Omega(\ell)$ bits. Therefore, they conjectured that high communication complexity is unavoidable, i.e., any $\ell$-query protocols with $c$ bits of communication could be attacked by an $O(c\cdot \ell)$-query adversary. This, if true, will suggest that Merkle\u27s Puzzle is also optimal regarding communication complexity. Building upon techniques from communication complexity, Haitner et al. (ITCS 2019) confirmed this conjecture for two types of key agreement protocols with certain natural properties. This work affirms the above conjecture for all non-adaptive protocols with perfect completeness. Our proof uses a novel idea called density increment argument. This method could be of independent interest as it differs from previous communication lower bounds techniques (and bypasses some technical barriers)