Search

Models for text-to-image synthesis, such as DALL-E 2 and Stable Diffusion, have recently drawn a lot of interest from academia and the general public. These models are capable of producing high-quality images that depict a variety of concepts and styles when conditioned on textual descriptions. However, these models adopt cultural characteristics associated with specific Unicode scripts from their vast amount of training data, which may not be immediately apparent. We show that by simply inserting single non-Latin characters in the textual description, common models reflect cultural biases in their generated images. We analyze this behavior both qualitatively and quantitatively and identify a model's text encoder as the root cause of the phenomenon. Such behavior can be interpreted as a model feature, offering users a simple way to customize the image generation and reflect their own cultural background. Yet, malicious users or service providers may also try to intentionally bias the image generation. One goal might be to create racist stereotypes by replacing Latin characters with similarly-looking characters from non-Latin scripts, so-called homoglyphs. To mitigate such unnoticed script attacks, we propose a novel homoglyph unlearning method to fine-tune a text encoder, making it robust against homoglyph manipulations. [ABSTRACT FROM AUTHOR]

The cuneiform writing system holds a vast reservoir of ancient literature, encompassing over 3000 years of history. Originating around the mid-fourth millennium BCE and enduring until the late first millennium BCE, cuneiform writing spans various genres such as administrative, legal, medical, and scientific documents, among others. This article introduces a curated dataset, CuneiML, featuring 38,947 high-resolution 2D photos of Sumerian and Akkadian cuneiform tablets, accompanied by their cuneiform Unicode transcriptions, transliterations, lineart, and metadata. This dataset aims to support the development of machine learning tools for processing and analyzing Sumerian and Akkadian cuneiform artifacts - e.g. for automatically classifying genre, provenance, or period from unannotated tablet images. Thus, CuneiML is designed with consistency of format as a primary concern. Specifically, CuneiML is a result of meticulously preprocessing, segmenting, filtering, and re-transliterating data that is available online in the Cuneiform Digital Library Initiative (CDLI) collection. [ABSTRACT FROM AUTHOR]

The article discusses the effects of the use of unicodes in the MARC 21 records. Specifically, it tries to highlight the accommodation of the greatly expanded character repertoire that includes not only additional non-Roman scripts but many more Latin script characters. MARC 21 is flexible with respect to the structure of records containing multi-script data to accommodate different needs worldwide. MARC 21 has specified two record models designated as A and B. Model A is a record in the preferred script which can be augmented with specially designated fields holding other scripts and Model B is a record which can have data in any script in regular fields. Model A is largely used for the MARC 21 bibliographic records with Latin as the preferred script. Model B can be seen by libraries with devices capable of displaying Chinese, Japanese, and Korean. It is necessary for a Model A record encoded in Unicode with Latin to be the preferred script that the definition of the Latin script data content of regular fields should be controlled by the Script Names property of Unicode. Creating consistent records for MARC 21 interchange necessities the data content in Model A records with Latin as the preferred script should be controlled.

Unicode, a standard developed in 1991, defines a universal character set for encoding the characters in the scripts of the world's languages. Unicode implementation has been gaining momentum in recent years especially in the software and computer industry. Academic libraries with collections of materials in multiple languages will want to take advantage of Unicode for display and searching of materials in non-Latin scripts such as Arabic, Hebrew, and Chinese. The focus of this article is a review of Unicode and its incorporation in library systems. [ABSTRACT FROM AUTHOR]

Let S be a Noetherian scheme of finite dimension and denote by ρ ∈ [1, Gm]SHS the (additive inverse of the) morphism corresponding to -1 ∈ O× (S). Here SH}(S) denotes the motivic stable homotopy category. We show that the category obtained by inverting ρ in SH(S) is canonically equivalent to the (simplicial) local stable homotopy category of the site Srét, by which we mean the small real étale site of S, comprised of étale schemes over S with the real étale topology. One immediate application is that SH(R)[ρ-1] is equivalent to the classical stable homotopy category. In particular this computes all the stable homotopy sheaves of the ρ-local sphere (over R). As further applications we show that DA1(k,Z[1/2]) ~ DMW(k)[1/2] (improving a result of Ananyevskiy–Levine–Panin), reprove Röndigs’ result that πi(1|1/η,1/2]) = 0 for i = 1,2 and establish some new rigidity results. [ABSTRACT FROM AUTHOR]

We investigate surjective solutions of the functional equation $$\begin{eqnarray}\displaystyle \{\Vert f(x)+f(y)\Vert ,\Vert f(x)-f(y)\Vert \}=\{\Vert x+y\Vert ,\Vert x-y\Vert \}\quad (x,y\in X), & & \displaystyle \nonumber\end{eqnarray}$$ where $f:X\rightarrow Y$ is a map between two real ${\mathcal{L}}^{\infty }(\unicode[STIX]{x1D6E4})$-type spaces. We show that all such solutions are phase equivalent to real linear isometries. This can be considered as an extension of Wigner’s theorem on symmetry for real ${\mathcal{L}}^{\infty }(\unicode[STIX]{x1D6E4})$-type spaces. [ABSTRACT FROM AUTHOR]

Text documents are the unavoidable form of information communication among humans, research papers on text hiding techniques are less in contrast to other cover object’s techniques. This is due to that text documents have relatively less number of features (less redundant), that can be used to hide data in comparison with other cover object types (image, audio, and video). In this paper, text hiding (Text-in-Text data hiding), algorithms is proposed and then coded in Matlab (m-files) form. The algorithm represents a new technique. It has many advantages over other existing text-in-text hiding techniques. These advantages include the usage of Arabic or Arabic-English mixed for both the secret and cover text with the aids of two of the nonprinting Unicode characters. Also applying new hiding rules concerning Arabic writing system. The cover text classified into groups of Arabic letters each with specific features and thus hiding text between letters from these groups must be controlled by these new text hiding rules. Matlab programs for embedding and extracting the secret text, according to the new approach, are tested and the outputs have been found very satisfying. Both secret and cover text have the same original format and text configuration. [ABSTRACT FROM AUTHOR]

Data compressions for different world languages including Indian languages are in high need and demand. Tamil language is one of the longest-surviving classical languages in the world. Usage of Tamil language for communication and storage was increased due to the digitization of government documents and orders. Lossless text compression process for Tamil language document involves substituting an ASCII character in place of Unicode Tamil characters, since the size of an ASCII character is one byte where as a Unicode character size range between 1 byte to 4 bytes depends on the encoding file storage type. The decompression process involves the reverse of compression technique (i.e) replacing ASCII characters with Unicode characters. This paper describes about the architecture of compression and decompression process for Tamil text documents. [ABSTRACT FROM AUTHOR]

The article discusses the use of Unicodes, which comprises of a universal character set to represent all languages on computers, by libraries. The machine readable cataloging (MARC) record provides for a range of accented characters through an available 256 bytes for character expression. New methods were added to the MARC record and the cataloging systems that permitted libraries to encode some non-Latin-based alphabetic languages. Unicodes have allowed the transformation of library catalogs into truly multi-lingual databases. Currently, the scripts available to catalogers are those available in the MARC 21 character set, MARC-8. But, there have been proposals to convert catalog records from MARC-8 to Unicode, disproving concerns on the cost and complexity of pursuing such a process.

The article presents information about unicode, which are known to be the universal character set. Computers have become an indispensable part of one's life. Until recently, the outdated key character set standard, ASCII was in use. This character set has numerous limitations such as because of its constraint to include only seven of the eight bits in the byte, there is no room in ASCII to expand beyond the characters needed for the English language. Thus, in order to respond to the needs of international customer base, unicode character set is developed. The universal character set has numerous advantage because of the large number of characters that these languages share due to their common origins. These codes have found out a new way to encode languages for computer manipulation. These encoding allows over one million characters to be defined. Such codes covers not only currently used languages but also ancient languages that are studied by historians and scholars. These single character set have many advantages for all languages are particularly evident in libraries where works occur in different scripts.

The main goal of the paper is to present a logic synthesis strategy dedicated to an LUT-based FPGA. New elements of the proposed synthesis strategy include: an original method of function decomposition, non-disjoint decomposition and technology mapping dedicated to configurability of logic blocks. The aim of all of the proposed synthesis approaches is the sharing of appropriately configured logic blocks. Innovation of the methods is based on the way of searching decomposition, which relies on multiple cutting of an MTBDD diagram describing a multi-output function. The essence of the proposed algorithms rests on the method of unicoding dedicated to sharing resources, searching non-disjoint decomposition on the basis of the partition of root tables and choosing the levels of diagram cutting that will guarantee the best mapping to complex logic blocks. The methods mentioned above were implemented in the MultiDec tool. The efficiency of the analyzed methods was experimentally confirmed by comparing the synthesis results with both academic and commercial tools. [ABSTRACT FROM AUTHOR]

The jsre regular expression library was designed to provide fast matching of complex expressions over large input streams using user-selectable character encodings. An established design approach was used: a simulated non-deterministic automaton (NFA) implemented as a virtual machine, avoiding exponential cost functions in either space or time. A deterministic automaton (DFA) was chosen as a general dispatching mechanism for Unicode character classes, and this also provided the opportunity to use compact DFAs in various optimization strategies. The result was the development of a regular expression Preview which provides a summary of all the matches possible from a given point in a regular expression in a form that can be implemented as a compact DFA and can be used to further improve the performance of the standard NFA simulation algorithm. This paper formally defines a preview and describes and evaluates several optimizations using this construct. They provide significant speed improvements accrued from fast scanning of anchor positions, avoiding retesting of repeated strings in unanchored searches and efficient searching of multiple alternate expressions which in the case of keyword searching has a time complexity which is logarithmic in the number of words to be searched. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The rapid growth of social media like twitter, Facebook, WhatsApp, messenger etc. has increased the availability of unstructured data (texts, images, videos) amount on internet. These texts are different from traditional text. The text written on social media are called Social Media Text. In India more than 50% comments on social media are written in Indian Languages using Unicode and Phonetic typing. The Pre- processing of these texts for application of Natural Language Processing (NLP) is a challenging task. This paper will help the researchers to understand the concept of code mixing, social media text, code mixed text and various challenges of social media text. [ABSTRACT FROM AUTHOR]

This paper presents a steganographic approach utilizing Unicode space and Zero-Width Characters. The existing techniques are less robust, not sensitive against steg-analysis and attain low hiding capacity. The proposed technique outperforms the limitations in existing approaches. It tenders high hidden capacity by using lose-less compression algorithm and embedding 4 bits per space using any version of MS Word file as a stego carrier. Moreover, robustness is highly improved by adding multi-layers of security and sensitivity has been created with addition of SHA-1 algorithm. The experimental results verify that the proposed scheme has increased the capacity 4 times and creates 4 times smaller stego-text as compared to existing Unispach method. Moreover, the transparency has not been affected which shows that our approach is best suitable for large messages when high security is required. [ABSTRACT FROM AUTHOR]

We prove that for any prime number $p\geqslant 3$, there exists a positive number $\unicode[STIX]{x1D705}_{p}$ such that $\unicode[STIX]{x1D712}({\mathcal{O}}_{X})\geqslant \unicode[STIX]{x1D705}_{p}c_{1}^{2}$ holds true for all algebraic surfaces $X$ of general type in characteristic $p$. In particular, $\unicode[STIX]{x1D712}({\mathcal{O}}_{X})>0$. This answers a question of Shepherd-Barron when $p\geqslant 3$. [ABSTRACT FROM PUBLISHER]

This paper is intended to help Slavicists dealing with multilingual text. It presents an account of the experience gained while working on the SlaVaComp project. The main concern of the paper are problems of multilingual text processing specifically the use of characters in entering Greek and Church Slavonic texts into the computer. It also broaches the most common problems encountered when using Unicode characters. Finally, the paper discusses select text processing technologies based on the WYSIWYG principle which can be employed to represent medieval manuscripts correctly by means of Unicode. [ABSTRACT FROM AUTHOR]

For 30 years, Internet email addresses have used the format user@example.com, with the character set A-Z, 0-9, ., and -. Gradually mail has been extended to support bæ, löffel, and 中国 in most places, but not in addresses. Now Email Address Internationalization (EAI) work has added support for unicode in addresses, simplifying syntax simultaneously. (To ensure that characters display correctly, please read the PDF version of this article.) [ABSTRACT FROM AUTHOR]

Recent researches regarding information hiding is mostly concentrating on Linguistic steganography. The Steganography is the art and science of hiding a message inside another message without drawing any suspicion to the others so that the message can only be detected by its intended recipient. Now days, concentration is made on local language encryption based steganography to provide high security for the secret information sharing. In this paper, a method to steganography is proposed with an Indian local language, Malayalam. The proposed method consists of a custom Unicode based technique with embedding based on indexing, i.e. the original message is encoded to a Malayalam text with custom UNICODE values generated for the Malayalam text. After that an embedding algorithm will be designed to mix the encoded original message with the Malayalam text. The experimental study was done to evaluate the efficiency of the proposed approach. The comparison study of the proposed method against an existing method revealed that, the proposed steganography methods is more precise in the encoding process and balanced in the decoding process. The proposed method achieved a precision rate of .95 and decoding rate of .81. [ABSTRACT FROM AUTHOR]

Steganography means how to hide secret information in a cover media, so that other individuals fail to realize their existence. Due to the lack of data redundancy in the text file in comparison with other carrier files, text steganography is a difficult problem to solve. In this paper, we proposed a new promised steganographic algorithm for Arabic text based on features of Arabic text. The focus is on more secure algorithm and high capacity of the carrier. Our extensive experiments using the proposed algorithm resulted in a high capacity of the carrier media. The embedding capacity rate ratio of the proposed algorithm is high. In addition, our algorithm can resist traditional attacking methods since it makes the changes in carrier text as minimum as possible. [ABSTRACT FROM AUTHOR]

A writing system as a set of visible used to represent units of language in a systematic way. Egyptian hieroglyphs were a formal writing system used by the ancient Egyptians that combined logographic and alphabetic elements. In serious music textbook editor programs there is a trouble in writing documents which include Egyptian hieroglyph symbols which take more than two bytes, because there is no way to embed these symbolization in a particular document. In this paper, a special text editor designed for ancient Egyptian hieroglyph writing system which power comprehension the Egyptian hieroglyph symbols using Unicode standard, and the basic operations of a classical text editor such as operations of file manipulation (load and save), select font size, type, and color, the operations of copy, paste, cut, select all, etc. as well as print the final document. Besides this, hieroglyphic numbers were represented in this editor. More facilities, flexibility, simplicity and benefits can be gotten using these editors especially for historic research worker which they interested authors in the ancient civilization. This editor designed in Visual Basic.Net. [ABSTRACT FROM AUTHOR]

Modern web applications often suffer from command injection attacks. Even when equipped with sanitization code, many systems can be penetrated due to software bugs. It is desirable to automatically discover such vulnerabilities, given the bytecode of a web application. One approach would be symbolically executing the target system and constructing constraints for matching path conditions and attack patterns. Solving these constraints yields an attack signature, based on which, the attack process can be replayed. Constraint solving is the key to symbolic execution. For web applications, string constraints receive most of the attention because web applications are essentially text processing programs. We present simple linear string equation (SISE), a decidable fragment of the general string constraint system. SISE models a collection of regular replacement operations (such as the greedy, reluctant, declarative, and finite replacement), which are frequently used by text processing programs. Various automata techniques are proposed for simulating procedural semantics such as left-most matching. By composing atomic transducers of a SISE, we show that a recursive algorithm can be used to compute the solution pool, which contains the value range of each variable in concrete solutions. Then a concrete variable solution can be synthesized from a solution pool. To accelerate solver performance, a symbolic representation of finite state transducer is developed. This allows the constraint solver to support a 16-bit Unicode alphabet in practice. The algorithm is implemented in a Java constraint solver called SUSHI. We compare the applicability and performance of SUSHI with Kaluza, a bounded string solver. [ABSTRACT FROM AUTHOR]

The article discusses several Ada programming language Gems taken from the AdaCore Gem of the Week series. It describes the Gem#144 which is concerned with the concepts behind Unicode and encoding. It mentions the three series of Gems which describes three aspects, Static_Predicate, Dynamic_Predicate and Type_Invariant, that can be used in specifying invariant properties of types and subtypes.

This paper examines the technologies that enable the representation of Hebrew on websites. Hebrew is written from right to left and in non-Latin characters, issues shared by a number of languages which seem to be converging on a shared solution-Unicode. Regarding the case of Hebrew, I show how competing solutions have given way to one dominant technology. I link processes in the Israeli context with broader questions about the 'multilingual Internet,' asking whether the commonly accepted solution for representing non-Latin texts on computer screens is an instance of cultural imperialism and convergence around a western artifact. It is argued that while minority languages are given an online voice by Unicode, the context is still one of western power. [ABSTRACT FROM AUTHOR]

Security in a networked environment, especially in cloud computing, is the hottest field that is attracting several research communities. Storage of data and security using standard cryptographic algorithms has become an important topic of discussion and research. Cloud computing moves the software and databases to data centers that are not trustworthy. Also, cloud storage faces many new security challenges that need more attention. The major threats of data security in cloud storage arise out of scheduling the computing resources using network, storage and retrieval of data. In this paper, we suggest a framework that enhances data security in the cloud storage system. We use Unicode, colors and private keys to develop a new and simple method that ensures secure storage of data in the cloud. [ABSTRACT FROM AUTHOR]

We have developed EyeMap, a freely available software system for visualizing and analyzing eye movement data specifically in the area of reading research. As compared with similar systems, including commercial ones, EyeMap has more advanced features for text stimulus presentation, interest area extraction, eye movement data visualization, and experimental variable calculation. It is unique in supporting binocular data analysis for unicode, proportional, and nonproportional fonts and spaced and unspaced scripts. Consequently, it is well suited for research on a wide range of writing systems. To date, it has been used with English, German, Thai, Korean, and Chinese. EyeMap is platform independent and can also work on mobile devices. An important contribution of the EyeMap project is a device-independent XML data format for describing data from a wide range of reading experiments. An online version of EyeMap allows researchers to analyze and visualize reading data through a standard Web browser. This facility could, for example, serve as a front-end for online eye movement data corpora. [ABSTRACT FROM AUTHOR]

Unicode is a critical enabling technology for developers who want to internationalize applications for global environments. Unicode assigns a unique number for every character, irrespective of what the platform, or the program, or the language is. The Unicode Standard has been adopted in the industry by Apple, HP, IBM, Microsoft, Oracle, SAP, Sun, Sybase, and many others. Unicode is required by modern standards such as XML, Java and WML, and is the official way to implement ISO/IEC 10646. It is supported in many operating systems, all modern browsers, and many other products. The emergence of the Unicode standard, and the availability of tools supporting it, is among the most significant recent global software technology advances. Each available format of UTF-8, UTF-16 and UTF-32 has its own pros and cons. The comparison of the following three formats is discussed in this paper. [ABSTRACT FROM AUTHOR]

The Chymistry of Isaac Newton project, an online scholarly edition of Newton's alchemical manuscripts, has engaged in a process to include a number of core alchemical symbols into the Unicode standard, a standard for digital representation of characters and symbols from the world's languages, scripts, and writing systems. Our article explores the relationship between information technology standardization and humanities research. We discuss Newton's engagement with alchemy and explore the graphic dimensions of alchemical discourse. We illustrate this discussion with examples of Newton's use of alchemical symbols. We examine Unicode itself, particularly a core Unicode principle distinguishing between the abstract character and the image or glyph of the character, and we discuss the tensions between this core principle and the representation of graphic, symbolic, and pictorial discourse. We describe our experience with the Unicode proposal process and illustrate again—this time with an organizational scheme for the symbols—how the technical standardization process forced a reexamination of our historical materials. Our conclusions reemphasize the potential for mutually beneficial relationships between certain types of information technology standardization and humanities research and suggest that study of the graphic qualities of alchemical discourse, especially in light of competing theories of text represented by standards like Unicode, may contribute to our understanding of the increasingly graphic, iconic, and pictorial nature of information and communication. [ABSTRACT FROM AUTHOR]