Academic literature on the topic 'Unicode character set'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Unicode character set.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Unicode character set"
1
SAYANJALI, Z., Z. AKHLAGHI, and B. KHOSRAVI. "ON THE REGULARITY OF CHARACTER DEGREE GRAPHS." Bulletin of the Australian Mathematical Society 100, no. 3 (2019): 428–33. http://dx.doi.org/10.1017/s0004972719000315.
Full textAbstract:
Let $G$ be a finite group and let $\text{Irr}(G)$ be the set of all irreducible complex characters of $G$. Let $\unicode[STIX]{x1D70C}(G)$ be the set of all prime divisors of character degrees of $G$. The character degree graph $\unicode[STIX]{x1D6E5}(G)$ associated to $G$ is a graph whose vertex set is $\unicode[STIX]{x1D70C}(G)$, and there is an edge between two distinct primes $p$ and $q$ if and only if $pq$ divides $\unicode[STIX]{x1D712}(1)$ for some $\unicode[STIX]{x1D712}\in \text{Irr}(G)$. We prove that $\unicode[STIX]{x1D6E5}(G)$ is $k$-regular for some natural number $k$ if and only if $\overline{\unicode[STIX]{x1D6E5}}(G)$ is a regular bipartite graph.
2
Coyle, Karen. "Unicode: The Universal Character Set Part 2: Unicode in Library Systems." Journal of Academic Librarianship 32, no. 1 (2006): 101–3. http://dx.doi.org/10.1016/j.acalib.2005.10.008.
Full text
3
EBRAHIMI, MAHDI. "CHARACTER GRAPHS WITH NONBIPARTITE HAMILTONIAN COMPLEMENT." Bulletin of the Australian Mathematical Society 102, no. 1 (2019): 91–95. http://dx.doi.org/10.1017/s0004972719001163.
Full textAbstract:
For a finite group $G$, let $\unicode[STIX]{x1D6E5}(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we obtain a necessary and sufficient condition which guarantees that the complement of the character graph $\unicode[STIX]{x1D6E5}(G)$ of a finite group $G$ is a nonbipartite Hamiltonian graph.
4
LIU, YANG. "PROJECTIVE CHARACTERS WITH PRIME POWER DEGREES." Bulletin of the Australian Mathematical Society 99, no. 1 (2018): 78–82. http://dx.doi.org/10.1017/s0004972718000825.
Full textAbstract:
We consider the relationship between structural information of a finite group $G$ and $\text{cd}_{\unicode[STIX]{x1D6FC}}(G)$, the set of all irreducible projective character degrees of $G$ with factor set $\unicode[STIX]{x1D6FC}$. We show that for nontrivial $\unicode[STIX]{x1D6FC}$, if all numbers in $\text{cd}_{\unicode[STIX]{x1D6FC}}(G)$ are prime powers, then $G$ is solvable. Our result is proved by classical character theory using the bijection between irreducible projective representations and irreducible constituents of induced representations in its representation group.
5
SPIGA, PABLO. "ON A CONJECTURE ON THE PERMUTATION CHARACTERS OF FINITE PRIMITIVE GROUPS." Bulletin of the Australian Mathematical Society 102, no. 1 (2019): 77–90. http://dx.doi.org/10.1017/s0004972719001060.
Full textAbstract:
Let $G$ be a finite group with two primitive permutation representations on the sets $\unicode[STIX]{x1D6FA}_{1}$ and $\unicode[STIX]{x1D6FA}_{2}$ and let $\unicode[STIX]{x1D70B}_{1}$ and $\unicode[STIX]{x1D70B}_{2}$ be the corresponding permutation characters. We consider the case in which the set of fixed-point-free elements of $G$ on $\unicode[STIX]{x1D6FA}_{1}$ coincides with the set of fixed-point-free elements of $G$ on $\unicode[STIX]{x1D6FA}_{2}$, that is, for every $g\in G$, $\unicode[STIX]{x1D70B}_{1}(g)=0$ if and only if $\unicode[STIX]{x1D70B}_{2}(g)=0$. We have conjectured in Spiga [‘Permutation characters and fixed-point-free elements in permutation groups’, J. Algebra299(1) (2006), 1–7] that under this hypothesis either $\unicode[STIX]{x1D70B}_{1}=\unicode[STIX]{x1D70B}_{2}$ or one of $\unicode[STIX]{x1D70B}_{1}-\unicode[STIX]{x1D70B}_{2}$ and $\unicode[STIX]{x1D70B}_{2}-\unicode[STIX]{x1D70B}_{1}$ is a genuine character. In this paper we give evidence towards the veracity of this conjecture when the socle of $G$ is a sporadic simple group or an alternating group. In particular, the conjecture is reduced to the case of almost simple groups of Lie type.
6
Bushnell, Colin J., and Guy Henniart. "Local Langlands correspondence and ramification for Carayol representations." Compositio Mathematica 155, no. 10 (2019): 1959–2038. http://dx.doi.org/10.1112/s0010437x19007449.
Full textAbstract:
Let $F$ be a non-Archimedean locally compact field of residual characteristic $p$ with Weil group ${\mathcal{W}}_{F}$. Let $\unicode[STIX]{x1D70E}$ be an irreducible smooth complex representation of ${\mathcal{W}}_{F}$, realized as the Langlands parameter of an irreducible cuspidal representation $\unicode[STIX]{x1D70B}$ of a general linear group over $F$. In an earlier paper we showed that the ramification structure of $\unicode[STIX]{x1D70E}$ is determined by the fine structure of the endo-class $\unicode[STIX]{x1D6E9}$ of the simple character contained in $\unicode[STIX]{x1D70B}$, in the sense of Bushnell and Kutzko. The connection is made via the Herbrand function $\unicode[STIX]{x1D6F9}_{\unicode[STIX]{x1D6E9}}$ of $\unicode[STIX]{x1D6E9}$. In this paper we concentrate on the fundamental Carayol case in which $\unicode[STIX]{x1D70E}$ is totally wildly ramified with Swan exponent not divisible by $p$. We show that, for such $\unicode[STIX]{x1D70E}$, the associated Herbrand function satisfies a certain functional equation, and that this property essentially characterizes this class of representations. We calculate $\unicode[STIX]{x1D6F9}_{\unicode[STIX]{x1D6E9}}$ explicitly, in terms of a classical Herbrand function arising naturally from the classification of simple characters. We describe exactly the class of functions arising as Herbrand functions $\unicode[STIX]{x1D6F9}_{\unicode[STIX]{x1D6EF}}$, as $\unicode[STIX]{x1D6EF}$ varies over the set of totally wild endo-classes of Carayol type. In a separate argument, we derive a complete description of the restriction of $\unicode[STIX]{x1D70E}$ to any ramification subgroup and hence a detailed interpretation of the Herbrand function. This gives concrete information concerning the Langlands correspondence.
7
Himstedt, Frank, Tung Le, and Kay Magaard. "On the characters of the Sylow -subgroups of untwisted Chevalley groups." LMS Journal of Computation and Mathematics 19, no. 2 (2016): 303–59. http://dx.doi.org/10.1112/s1461157016000401.
Full textAbstract:
Let$UY_{n}(q)$be a Sylow$p$-subgroup of an untwisted Chevalley group$Y_{n}(q)$of rank$n$defined over $\mathbb{F}_{q}$where$q$is a power of a prime$p$. We partition the set$\text{Irr}(UY_{n}(q))$of irreducible characters of$UY_{n}(q)$into families indexed by antichains of positive roots of the root system of type$Y_{n}$. We focus our attention on the families of characters of$UY_{n}(q)$which are indexed by antichains of length$1$. Then for each positive root$\unicode[STIX]{x1D6FC}$we establish a one-to-one correspondence between the minimal degree members of the family indexed by$\unicode[STIX]{x1D6FC}$and the linear characters of a certain subquotient$\overline{T}_{\unicode[STIX]{x1D6FC}}$of$UY_{n}(q)$. For$Y_{n}=A_{n}$our single root character construction recovers, among other things, the elementary supercharacters of these groups. Most importantly, though, this paper lays the groundwork for our classification of the elements of$\text{Irr}(UE_{i}(q))$,$6\leqslant i\leqslant 8$, and$\text{Irr}(UF_{4}(q))$.
8
Frei, Christopher, and Efthymios Sofos. "GENERALISED DIVISOR SUMS OF BINARY FORMS OVER NUMBER FIELDS." Journal of the Institute of Mathematics of Jussieu 19, no. 1 (2017): 137–73. http://dx.doi.org/10.1017/s1474748017000469.
Full textAbstract:
Estimating averages of Dirichlet convolutions $1\ast \unicode[STIX]{x1D712}$, for some real Dirichlet character $\unicode[STIX]{x1D712}$ of fixed modulus, over the sparse set of values of binary forms defined over $\mathbb{Z}$ has been the focus of extensive investigations in recent years, with spectacular applications to Manin’s conjecture for Châtelet surfaces. We introduce a far-reaching generalisation of this problem, in particular replacing $\unicode[STIX]{x1D712}$ by Jacobi symbols with both arguments having varying size, possibly tending to infinity. The main results of this paper provide asymptotic estimates and lower bounds of the expected order of magnitude for the corresponding averages. All of this is performed over arbitrary number fields by adapting a technique of Daniel specific to $1\ast 1$. This is the first time that divisor sums over values of binary forms are asymptotically evaluated over any number field other than $\mathbb{Q}$. Our work is a key step in the proof, given in subsequent work, of the lower bound predicted by Manin’s conjecture for all del Pezzo surfaces over all number fields, under mild assumptions on the Picard number.
9
Wenzel, Christoph, Tobias Gibis, Markus Kloker, and Ulrich Rist. "Self-similar compressible turbulent boundary layers with pressure gradients. Part 1. Direct numerical simulation and assessment of Morkovin’s hypothesis." Journal of Fluid Mechanics 880 (October 9, 2019): 239–83. http://dx.doi.org/10.1017/jfm.2019.670.
Full textAbstract:
A direct numerical simulation study of self-similar compressible flat-plate turbulent boundary layers (TBLs) with pressure gradients (PGs) has been performed for inflow Mach numbers of 0.5 and 2.0. All cases are computed with smooth PGs for both favourable and adverse PG distributions (FPG, APG) and thus are akin to experiments using a reflected-wave set-up. The equilibrium character allows for a systematic comparison between sub- and supersonic cases, enabling the isolation of pure PG effects from Mach-number effects and thus an investigation of the validity of common compressibility transformations for compressible PG TBLs. It turned out that the kinematic Rotta–Clauser parameter $\unicode[STIX]{x1D6FD}_{K}$ calculated using the incompressible form of the boundary-layer displacement thickness as length scale is the appropriate similarity parameter to compare both sub- and supersonic cases. Whereas the subsonic APG cases show trends known from incompressible flow, the interpretation of the supersonic PG cases is intricate. Both sub- and supersonic regions exist in the boundary layer, which counteract in their spatial evolution. The boundary-layer thickness $\unicode[STIX]{x1D6FF}_{99}$ and the skin-friction coefficient $c_{f}$, for instance, are therefore in a comparable range for all compressible APG cases. The evaluation of local non-dimensionalized total and turbulent shear stresses shows an almost identical behaviour for both sub- and supersonic cases characterized by similar $\unicode[STIX]{x1D6FD}_{K}$, which indicates the (approximate) validity of Morkovin’s scaling/hypothesis also for compressible PG TBLs. Likewise, the local non-dimensionalized distributions of the mean-flow pressure and the pressure fluctuations are virtually invariant to the local Mach number for same $\unicode[STIX]{x1D6FD}_{K}$-cases. In the inner layer, the van Driest transformation collapses compressible mean-flow data of the streamwise velocity component well into their nearly incompressible counterparts with the same $\unicode[STIX]{x1D6FD}_{K}$. However, noticeable differences can be observed in the wake region of the velocity profiles, depending on the strength of the PG. For both sub- and supersonic cases the recovery factor was found to be significantly decreased by APGs and increased by FPGs, but also to remain virtually constant in regions of approximated equilibrium.
10
Horn, Susanne, and Peter J. Schmid. "Prograde, retrograde, and oscillatory modes in rotating Rayleigh–Bénard convection." Journal of Fluid Mechanics 831 (October 13, 2017): 182–211. http://dx.doi.org/10.1017/jfm.2017.631.
Full textAbstract:
Rotating Rayleigh–Bénard convection is typified by a variety of regimes with very distinct flow morphologies that originate from several instability mechanisms. Here we present results from direct numerical simulations of three representative set-ups: first, a fluid with Prandtl number $Pr=6.4$, corresponding to water, in a cylinder with a diameter-to-height aspect ratio of $\unicode[STIX]{x1D6E4}=2$; second, a fluid with $Pr=0.8$, corresponding to $\text{SF}_{6}$ or air, confined in a slender cylinder with $\unicode[STIX]{x1D6E4}=0.5$; and third, the main focus of this paper, a fluid with $Pr=0.025$, corresponding to a liquid metal, in a cylinder with $\unicode[STIX]{x1D6E4}=1.87$. The obtained flow fields are analysed using the sparsity-promoting variant of the dynamic mode decomposition (DMD). By means of this technique, we extract the coherent structures that govern the dynamics of the flow, as well as their associated frequencies. In addition, we follow the temporal evolution of single modes and present a criterion to identify their direction of travel, i.e. whether they are precessing prograde or retrograde. We show that for moderate $Pr$ a few dynamic modes suffice to accurately describe the flow. For large aspect ratios, these are wall-localised waves that travel retrograde along the periphery of the cylinder. Their DMD frequencies agree with the predictions of linear stability theory. With increasing Rayleigh number $Ra$, the interior gradually fills with columnar vortices, and eventually a regular pattern of convective Taylor columns prevails. For small aspect ratios and close enough to onset, the dominant flow structures are body modes that can precess either prograde or retrograde. For $Pr=0.8$, DMD additionally unveiled the existence of so far unobserved low-amplitude oscillatory modes. Furthermore, we elucidate the multi-modal character of oscillatory convection in low-$Pr$ fluids. Generally, more dynamic modes must be retained to accurately approximate the flow. Close to onset, the flow is purely oscillatory and the DMD reveals that these high-frequency modes are a superposition of oscillatory columns and cylinder-scale inertial waves. We find that there are coexisting prograde and retrograde modes, as well as quasi-axisymmetric torsional modes. For higher $Ra$, the flow also becomes unstable to wall modes. These low-frequency modes can both coexist with the oscillatory modes, and also couple to them. However, the typical flow feature of rotating convection at moderate $Pr$, the quasi-steady Taylor vortices, is entirely absent in low-$Pr$ flows.
Dissertations / Theses on the topic "Unicode character set"
1
Mohammadzadeh, Hadi. "Improving Retrieval Accuracy in Main Content Extraction from HTML Web Documents." Doctoral thesis, Universitätsbibliothek Leipzig, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-130500.
Full textAbstract:
The rapid growth of text based information on the World Wide Web and various applications making use of this data motivates the need for efficient and effective methods to identify and separate the “main content” from the additional content items, such as navigation menus, advertisements, design elements or legal disclaimers. Firstly, in this thesis, we study, develop, and evaluate R2L, DANA, DANAg, and AdDANAg, a family of novel algorithms for extracting the main content of web documents. The main concept behind R2L, which also provided the initial idea and motivation for the other three algorithms, is to use well particularities of Right-to-Left languages for obtaining the main content of web pages. As the English character set and the Right-to-Left character set are encoded in different intervals of the Unicode character set, we can efficiently distinguish the Right-to-Left characters from the English ones in an HTML file. This enables the R2L approach to recognize areas of the HTML file with a high density of Right-to-Left characters and a low density of characters from the English character set. Having recognized these areas, R2L can successfully separate only the Right-to-Left characters. The first extension of the R2L, DANA, improves effectiveness of the baseline algorithm by employing an HTML parser in a post processing phase of R2L for extracting the main content from areas with a high density of Right-to-Left characters. DANAg is the second extension of the R2L and generalizes the idea of R2L to render it language independent. AdDANAg, the third extension of R2L, integrates a new preprocessing step to normalize the hyperlink tags. The presented approaches are analyzed under the aspects of efficiency and effectiveness. We compare them to several established main content extraction algorithms and show that we extend the state-of-the-art in terms of both, efficiency and effectiveness. Secondly, automatically extracting the headline of web articles has many applications. We develop and evaluate a content-based and language-independent approach, TitleFinder, for unsupervised extraction of the headline of web articles. The proposed method achieves high performance in terms of effectiveness and efficiency and outperforms approaches operating on structural and visual features<br>Das rasante Wachstum von textbasierten Informationen im World Wide Web und die Vielfalt der Anwendungen, die diese Daten nutzen, macht es notwendig, effiziente und effektive Methoden zu entwickeln, die den Hauptinhalt identifizieren und von den zusätzlichen Inhaltsobjekten wie z.B. Navigations-Menüs, Anzeigen, Design-Elementen oder Haftungsausschlüssen trennen. Zunächst untersuchen, entwickeln und evaluieren wir in dieser Arbeit R2L, DANA, DANAg und AdDANAg, eine Familie von neuartigen Algorithmen zum Extrahieren des Inhalts von Web-Dokumenten. Das grundlegende Konzept hinter R2L, das auch zur Entwicklung der drei weiteren Algorithmen führte, nutzt die Besonderheiten der Rechts-nach-links-Sprachen aus, um den Hauptinhalt von Webseiten zu extrahieren. Da der lateinische Zeichensatz und die Rechts-nach-links-Zeichensätze durch verschiedene Abschnitte des Unicode-Zeichensatzes kodiert werden, lassen sich die Rechts-nach-links-Zeichen leicht von den lateinischen Zeichen in einer HTML-Datei unterscheiden. Das erlaubt dem R2L-Ansatz, Bereiche mit einer hohen Dichte von Rechts-nach-links-Zeichen und wenigen lateinischen Zeichen aus einer HTML-Datei zu erkennen. Aus diesen Bereichen kann dann R2L die Rechts-nach-links-Zeichen extrahieren. Die erste Erweiterung, DANA, verbessert die Wirksamkeit des Baseline-Algorithmus durch die Verwendung eines HTML-Parsers in der Nachbearbeitungsphase des R2L-Algorithmus, um den Inhalt aus Bereichen mit einer hohen Dichte von Rechts-nach-links-Zeichen zu extrahieren. DANAg erweitert den Ansatz des R2L-Algorithmus, so dass eine Sprachunabhängigkeit erreicht wird. Die dritte Erweiterung, AdDANAg, integriert eine neue Vorverarbeitungsschritte, um u.a. die Weblinks zu normalisieren. Die vorgestellten Ansätze werden in Bezug auf Effizienz und Effektivität analysiert. Im Vergleich mit mehreren etablierten Hauptinhalt-Extraktions-Algorithmen zeigen wir, dass sie in diesen Punkten überlegen sind. Darüber hinaus findet die Extraktion der Überschriften aus Web-Artikeln vielfältige Anwendungen. Hierzu entwickeln wir mit TitleFinder einen sich nur auf den Textinhalt beziehenden und sprachabhängigen Ansatz. Das vorgestellte Verfahren ist in Bezug auf Effektivität und Effizienz besser als bekannte Ansätze, die auf strukturellen und visuellen Eigenschaften der HTML-Datei beruhen
Books on the topic "Unicode character set"
2
Gillam, Richard. Unicode demystified: A practical programmer's guide to the encoding standard. Addison-Wesley, 2003.
Find full text
4
Ngô, Thanh Nhàn. Manual, the Nôm Na coded character set: With Nôm Na Tó̂ng light true type font & Hán Nôm character knowledge-base : in accordance with Unicode 4.0, ISO/IEC 10646-1:2000 & Vietnamese national standards, TCVN 5712:1993 [VSCII], TCVN 5773:1993 [NSCII], TCVN 6056:1995 [NSCII]. Edited by Vietnamese Nôm Preservation Foundation. Nôm Na Group. Nôm Na Group, 2005.
Find full text
5
International Unicode Conference (9th 1996 San Jose, Calif.). Ninth International Unicode Conference, San Jose, CA, September 4-6, 1996: Proceedings. Unicode Consortium, 1996.
Find full text
6
Joan, Aliprand, and Unicode Consortium, eds. The Unicode standard. 4th ed. Addison-Wesley, 2003.
Find full text
7
Consortium, Unicode, ed. The Unicode standard: Worldwide character encoding. Addison-Wesley Pub., 1991.
Find full text
9
Consortium, The Unicode. Unicode Standard, Version 5.0, The (5th Edition). 5th ed. Addison-Wesley Professional, 2006.
Find full text
10
Everson, Michael, Davis Mark, The Unicode Consortium, et al. The Unicode Standard, Version 4.0. Addison-Wesley Professional, 2003.
Find full textBook chapters on the topic "Unicode character set"
1
Maher, Jennifer Helene. "Decoding What is Good in Code." In Human Rights and Ethics. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-6433-3.ch079.
Full textAbstract:
Programming benefits from universal standards that facilitate effective global transmission of information. The Unicode Standard, for example, is a character encoding system that aims to assign a unique number set to each letter, mark, and symbol in the world's various written systems, including Arabic, Korean, Cherokee, and even Cuneiform. As the quantity of these numerical encodings grow, the differences among the written systems of natural languages pose increasingly little consequence to the artificial languages of both programmers and machines. However, the instrumental, technical effects of Unicode must not be mistaken as its only effects. Recognized as a metaphysical object in its own right, Unicode, specifically, and code, generally, creates a protocol for the actualization of moral and political values. This chapter examines how Microsoft's inclusion and then deletion of the Unicode encodings U+5350 and U+534D in its Office Bookshelf Symbol 7 font illustrates how technically successful coding can be rhetorically buggy, meaning that it invokes competing ethical values that, in this case, involve free speech, anti-Semitism, and Western privilege.
Reports on the topic "Unicode character set"
1
Birnbaum, David J., Ralph Cleminson, Sebastian Kempgen, and Kiril Ribarov. White Paper on Character Set Standardization for Early Cyrillic Writing after Unicode 5.1. Otto-Friedrich-Universität, 2021. http://dx.doi.org/10.20378/irb-49898.
Full textAbstract:
The White Paper on Character Set Standardization for Early Cyrillic Writing after Unicode 5.1 emerged from discussions among the authors at the "Slovo" conference in Sofia in 2008. It is partially a response to documents published by the Serbian Academy of Arts and Sciences. It has been written for the benefit of medieval Slavic philologists.
2
Kempgen, Sebastian. RomanCyrillic Std v. 9 - Online Documentation. Otto-Friedrich-Universität, 2020. http://dx.doi.org/10.20378/irb-48951.
Full text