N3N^3 entropy of M5 branes from dielectric effect

We observe that the $N^3$ entropy behavior of near-extermal M5 branes can be reproduced from SYM side with the role of Myers' terms. We start by generalizing the Klebanov-Tseytlin (KT) supergravity solution that displays the $N^3$ entropy behavior. The new feature of the general solution is visibility of the "internal" degrees of the M5 branes, i.e., the M0 branes and the M2 branes. With the rationale provided by the supergravity analysis, we consider a D0 brane quantum mechanical setup with Myers' terms. Using localization technique, we show that the leading $N^3$ behavior of the free energy comes from the "classical contribution" with the rest sub-leading.Comment: latex, 21 pages, missing figure adde

An artefact repository to support distributed software engineering

The Open Source Component Artefact Repository (OSCAR) system is a component of the GENESIS platform designed to non-invasively inter-operate with work-flow management systems, development tools and existing repository systems to support a distributed software engineering team working collaboratively. Every artefact possesses a collection of associated meta-data, both standard and domain-specific presented as an XML document. Within OSCAR, artefacts are made aware of changes to related artefacts using notifications, allowing them to modify their own meta-data actively in contrast to other software repositories where users must perform all and any modifications, however trivial. This recording of events, including user interactions provides a complete picture of an artefact's life from creation to (eventual) retirement with the intention of supporting collaboration both amongst the members of the software engineering team and agents acting on their behalf

Enhancing and applying Daitch-Mokotoff Soundex Algorithm on ethnic names

The study examines how the Daitch-Mokotoff Soundex Algorithm can handle names from different cultures, such as Nigerian, Hindu, and Urdu. It shows how the algorithm helps compare and search names, even with language barriers. The paper explains how modifying the algorithm works well with diverse name structures and pronunciations. Thorough research and practical applications make this study valuable, bridging the gap between the algorithm and these distinct cultures. It reveals this powerful tool's potential in improving name-matching precision. The study evaluates the algorithm's performance and accuracy in detail. It contributes significantly to the discourse on multicultural data processing algorithms. The study offers insights into the algorithm's adaptability to various languages and phonetic systems. Ultimately, it showcases the Daitch-Mokotoff Soundex Algorithm as a powerful tool in the multicultural digital era

Using Links to prototype a Database Wiki

Both relational databases and wikis have strengths that make them attractive for use in collaborative applications. In the last decade, database-backed Web applications have been used extensively to develop valuable shared biological references called curated databases. Databases offer many advantages such as scalability, query optimization and concurrency control, but are not easy to use and lack other features needed for collaboration. Wikis have become very popular for early-stage biocuration projects because they are easy to use, encourage sharing and collaboration, and provide built-in support for archiving, history-tracking and annotation. However, curation projects often outgrow the limited capabilities of wikis for structuring and efficiently querying data at scale, necessitating a painful phase transition to a database-backed Web application. We perceive a need for a new class of general-purpose system, which we call a Database Wiki, that combines flexible wiki-like support for collaboration with robust database-like capabilities for structuring and querying data. This paper presents DBWiki, a design prototype for such a system written in the Web programming language Links. We present the architecture, typical use, and wiki markup language design for DBWiki and discuss features of Links that provided unique advantages for rapid Web/database application prototyping

FlashProfile: A Framework for Synthesizing Data Profiles

We address the problem of learning a syntactic profile for a collection of strings, i.e. a set of regex-like patterns that succinctly describe the syntactic variations in the strings. Real-world datasets, typically curated from multiple sources, often contain data in various syntactic formats. Thus, any data processing task is preceded by the critical step of data format identification. However, manual inspection of data to identify the different formats is infeasible in standard big-data scenarios. Prior techniques are restricted to a small set of pre-defined patterns (e.g. digits, letters, words, etc.), and provide no control over granularity of profiles. We define syntactic profiling as a problem of clustering strings based on syntactic similarity, followed by identifying patterns that succinctly describe each cluster. We present a technique for synthesizing such profiles over a given language of patterns, that also allows for interactive refinement by requesting a desired number of clusters. Using a state-of-the-art inductive synthesis framework, PROSE, we have implemented our technique as FlashProfile. Across $153$ tasks over $75$ large real datasets, we observe a median profiling time of only $\sim\,0.7\,$s. Furthermore, we show that access to syntactic profiles may allow for more accurate synthesis of programs, i.e. using fewer examples, in programming-by-example (PBE) workflows such as FlashFill.Comment: 28 pages, SPLASH (OOPSLA) 201