Set Of Flags Research Articles

DEFINING PAG-IPAT: A MULTIMODAL SEMIOTIC ANALYSIS OF MAGUINDANAON’S HEALING RITUAL

Pag-ipat (ritual against disease) is a traditional healing ritual of the Maguindanaon people in the southern Philippines. Devoid of Islamic components, it is based on numerous ideas such as possession, invisible spirits, mythological history, and the offering of sacrifice. This study explores the signs and symbols incorporated in pagipat. Through a multimodal semiotic analysis, specifically ethnographic observation, this research determines the meanings conveyed by the semiotic resources used, expounds on how semiotic resources are orchestrated to communicate meaning, and rationalises the ideology expressed in the ritual performance. Findings reveal that the resources utilised in the performance of pag-ipat communicate gratitude and love, recognition, honour, appreciation, journey, generosity, kindness, recognition of their ancestor, invitation to the neighbours and the community, healing, enlightenment, freedom from darkness, identity marker, greediness, and life. Through the manner of installing the pandala (flags), the presence of the sambulayang (set of flags), the quantity of food, the quality of the cloth, the number of days spent in the ritual, the design of the food and clothing material, the dance movement of the medium, and the kulintang music produced by the performers, the healing rite manifests social standing and artistic skill of the performers. The practise of pag-ipat tells us that regardless of Maguindanaon’s observance of Islam as official religion, some believe in the existence of ancestral spirits, mythological entities, and spirit animals which has a significant impact on their beliefs and behaviour. Thus, ritual elements increase signification and meaning-making potentials in the discourse environment because of their iconicity, indexicality, and meaning-making potentiality.

Blood and CSF anti-neuronal antibodies testing in psychotic syndromes: a retrospective analysis from a tertiary psychiatric hospital.

A Consensus of Psychoimmunology Experts (Pollak et al., 2019) established a set of red flags and proposed diagnostic criteria for psychosis of autoimmune origin (AIP). Previous studies on AIP are limited by the scarcity of CSF analysis, preventing the valorization of blood anti-neuronal antibodies (Ab). The aims of this study are to determine the relative frequency and characterize AIP in a cohort of psychotic patients that underwent CSF workup. This work is a retrospective study in a tertiary psychiatric hospital. Clinical and paraclinical data were collected from medical records, and patients were classified according to Pollak et al. (2019) criteria. From 68 patients, ten (14.7%) had positive anti-neuronal antibodies (Ab): n = 5 in CSF and blood (n = 4 anti-NMDAr, n = 1 -GAD65), and n = 5 in blood only (n = 1 anti-GABAb, n = 1 -GAD65, n = 1 -SOX1, n = 1 -NMDAr, n = 1 -zic4). After 5- (2-10)-year follow-up, n = 6/68 (8.8%) had AIP diagnosis in context of autoimmune encephalitis (AE), and the remaining (n = 4/10, blood-only Ab) alternative diagnoses (n = 2 dementia, n = 1 schizophrenia, n = 1 intellectual disability). Ten of the 13 patients that fulfilled criteria for possible AIP were mimics, and only three AE had criteria for probable AIP. All AIP developed neurological manifestations (mostly cognitive dysfunction); EEG was usually abnormal (66.7%), and all had normal MRI. We found statistically significant associations between AIP/AE and systemic autoimmune disease, presentation with seizures and EEG abnormalities. All AE developed neurological symptoms alongside psychosis. Ab positivity occurred predominantly in AE but also in other neuropsychiatric disorders. Clinical suspicion based on the knowledge of the described presentations of established Ab is crucial in the psychotic patient approach.

Verif: A Weather-Prediction Verification Tool for Effective Product Development

Abstract Verif is an open-source tool for verifying weather predictions against a ground truth. It is suitable for a range of applications and designed for iterative product development involving fine-tuning of algorithms, comparing methods, and addressing scientific issues with the product. The tool generates verification plots based on user-supplied input files containing predictions and observations for multiple point-locations, forecast lead times, and forecast initialization times. It supports over 90 verification metrics and diagrams and can evaluate deterministic and probabilistic predictions. An extensive set of command-line flags control how the input data are aggregated, filtered, stratified, and visualized. The broad range of metrics and data manipulation options allows the user to gain insight from both summary scores and detailed time series of individual weather events. Verif is suitable for many applications, including assessing numerical weather prediction models, climate models, reanalyses, machine learning models, and even the fidelity of emerging observational sources. The tool has matured through long-term development at the Norwegian Meteorological Institute and the University of British Columbia. Verif comes with an extensive wiki page and example input files covering a wide range of prediction applications, allowing students and researchers interested in verification to get hands-on experience with real-life datasets. This article describes the functionality of Verif version 1.3 and shows how the tool can be used for effective product development.

Near real-time generation of a country-level burned area database for Italy from Sentinel-2 data and active fire detections

The first national database of burned areas in Italy at 20 m spatial resolution is presented. It was generated in near real-time by processing, as soon as they were available, all the Sentinel-2 images covering the Italian territory throughout the fire seasons of years 2019–2021. An updated version of the AUTOmatic Burned Area Mapper (AUTOBAM), originally developed in a previous study, was used to produce the database. Active fire data and a feature extraction procedure were used by AUTOBAM to associate a set of quality flags to each burned area.The AUTOBAM product was evaluated by comparing it with reference polygons derived from ground surveys. Even the database derived from the European Forest Fire Information System (EFFIS) was compared to reference polygons to assess the utility of the AUTOBAM product with respect to an already existing one. Good results were obtained by AUTOBAM in terms of detection capability (the Correctness parameter) and overlap factor (both larger than 60%). However, quite high values of the commission error were obtained, especially in 2019. Through a per land cover analysis, it was found that this error mostly occurred in cultivated land. Excluding the latter target, the commission error was always less than 35%, the omission error was less than 27% and the Dice Coefficient was larger than 69%.

Flag codes: Distance vectors and cardinality bounds

Given Fq the finite field with q elements and an integer n⩾2, a flag is a sequence of nested subspaces of Fqn and a flag code is a nonempty set of flags. In this context, the distance between flags is the sum of the corresponding subspace distances. Hence, a given flag distance value might be obtained by many different combinations. To capture such a variability, in the paper at hand, we introduce the notion of distance vector as an algebraic object intrinsically associated to a flag code that encloses much more information than the distance parameter itself. Our study of the flag distance by using this new tool allows us to provide a fine description of the structure of flag codes as well as to derive bounds for their maximum possible size once the minimum distance and dimensions are fixed.

Attractive and repulsive training to address inter-task forgetting issues in continual learning

In continual learning over deep neural networks (DNNs), the rehearsal strategy, in which the previous exemplars are jointly trained with new samples, is commonly employed for the purpose of addressing catastrophic forgetting. Unfortunately, due to the memory limit, rehearsal-based techniques inevitably cause the class imbalance issue leading to a DNN biased toward new tasks having more samples. Existing works mostly focus on correcting such a bias in the fully connected layer or classifier. In this paper, we newly discover that class imbalance tends to make old classes even more highly correlated with their similar new classes in the feature space, which turns out to be the major reason behind catastrophic forgetting, called inter-task forgetting. To alleviate inter-task forgetting, we propose a novel class incremental learning method, called attractive &repulsive training (ART), which effectively captures the previous feature space into a set of class-wise flags, and thereby makes old and new similar classes less correlated in the new feature space. In our empirical study, our ART method is observed to be quite effective to improve the performance of the state-of-the-art methods by substantially mitigating inter-task forgetting. Our implementation is available at:https://github.com/bigdata-inha/ART/.

A Positive Formula for Type A Peterson Schubert Calculus

The Peterson variety is a special case of a nilpotent Hessenberg variety, a class of subvarieties of G/B that have appeared in the study of quantum cohomology, representation theory and combinatorics. In type A, the Peterson variety Y is a subvariety of $$Fl(n;{\mathbb {C}})$$ , the set of complete flags in $${\mathbb {C}}^n$$ , and comes equipped with an action by a one-dimensional torus subgroup S of a standard torus T that acts on $$Fl(n;{\mathbb {C}})$$ . Using the Peterson Schubert basis introduced in Harada and Tymoczko (Proc Lond Math Soc 103(1):40–72, 2011) and obtained by restricting a specific set of Schubert classes from $$H_T^*(Fl(n; {\mathbb {C}}))$$ to $$H_S^*(Y)$$ , we describe the product structure of the equivariant cohomology $$H_{S}^*(Y)$$ . In particular, we show that the product is manifestly positive in an appropriate sense by providing an explicit, positive, combinatorial formula for its structure constants. A key step in our proof requires a new combinatorial identity of binomial coefficients that generalizes Vandermonde’s identity, and merits independent interest.

A Pre-Activation, Golden IC Free, Hardware Trojan Detection Approach

The increasing concern about the security and reliability of abroad manufactured integrated circuits (ICs) has attracted academia and industries to develop hardware Trojan (HT) detection approaches. This article presents an efficient integrated HT detection technique based on evaluating changes in the integrated parasitic capacitors. The HT detection circuit consists of a capacitively coupled, low-power, low-noise, operational transconductance amplifier (OTA), which can detect capacitance fluctuations in the range of 10 aF. The HT detection circuit consumes <inline-formula> <tex-math notation="LaTeX">$5.88~\mu \text {W}$ </tex-math></inline-formula> from 1.8-V power supply in 180-nm CMOS technology. The detection method is based on clustering the IC and monitoring each cluster&#x2019;s flag. The flag set circuit is designed to sense parasitic capacitance and change its status based on it. The proposed technique can detect the HT circuit before the activation of the IC. Moreover, this technique shows very promising results in detecting HTs with zero-delay effect, which is a challenging issue in the conventional delay-based side-channel signal analysis method. More significantly, the proposed method does not require a golden IC for HT detection and can detect the HT using simulation-based data. The proposed method creates a recognizable difference detection signal between the capacitive behavior of an infected and a pure IC. This results in a high confidence level in the proposed detection method. The proposed idea is implemented on ISCAS&#x2019;85 benchmark circuits, and the detection outcomes and the statistical simulations are presented.

Partial Duality of Hypermaps

We introduce partial duality of hypermaps, which include the classical Euler–Poincaré duality as a particular case. Combinatorially, hypermaps may be described in one of three ways: as three involutions on the set of flags (bi-rotation system or \(\tau \)-model), or as three permutations on the set of half-edges (rotation system or \(\sigma \)-model in orientable case), or as edge 3-coloured graphs. We express partial duality in each of these models. We give a formula for the genus change under partial duality.

Optimization on flag manifolds

A flag is a sequence of nested subspaces. Flags are ubiquitous in numerical analysis, arising in finite elements, multigrid, spectral, and pseudospectral methods for numerical pde; they arise in the form of Krylov subspaces in matrix computations, and as multiresolution analysis in wavelets constructions. They are common in statistics too—principal component, canonical correlation, and correspondence analyses may all be viewed as methods for extracting flags from a data set. The main goal of this article is to develop the tools needed for optimizing over a set of flags, which is a smooth manifold called the flag manifold, and it contains the Grassmannian as the simplest special case. We will derive closed-form analytic expressions for various differential geometric objects required for Riemannian optimization algorithms on the flag manifold; introducing various systems of extrinsic coordinates that allow us to parameterize points, metrics, tangent spaces, geodesics, distances, parallel transports, gradients, Hessians in terms of matrices and matrix operations; and thereby permitting us to formulate steepest descent, conjugate gradient, and Newton algorithms on the flag manifold using only standard numerical linear algebra.

Self-organizing mappings on the flag manifold with applications to hyper-spectral image data analysis

A flag is a nested sequence of vector spaces. The type of the flag encodes the sequence of dimensions of the vector spaces making up the flag. A flag manifold is a manifold whose points parameterize all flags of a fixed type in a fixed vector space. This paper provides the mathematical framework necessary for implementing self-organizing mappings on flag manifolds. Flags arise implicitly in many data analysis contexts including wavelet, Fourier, and singular value decompositions. The proposed geometric framework in this paper enables the computation of distances between flags, the computation of geodesics between flags, and the ability to move one flag a prescribed distance in the direction of another flag. Using these operations as building blocks, we implement the SOM algorithm on a flag manifold. The basic algorithm is applied to the problem of parameterizing a set of flags of a fixed type.

M42. INDEPENDENT REVIEW &amp; MONITORING IMPROVES QUALITY OF PANSS DATA IN GLOBAL CLINICAL TRIALS

BackgroundThe Positive and Negative Syndrome Scale (PANSS) (1) is the most widely used endpoint for measuring change in schizophrenia clinical trials. A set of flags have been developed by ISCTM expert working group to identify potential scoring errors in PANSS assessments (2). Measures have been taken by sponsors (pharmaceutical industry) with the goal of increasing scoring reliability and data quality, such as the use of Independent Review (IRev). We evaluated changes in data quality when site raters stop being recorded and monitored via IRev by comparing two studies with the same cohort of raters, one with independent review and one without.MethodsData from PANSS assessments in two global multisite schizophrenia clinical trials were analyzed. We selected data from raters participating in both studies (which run concurrently for a significant period of time). Raters were rigorously trained on administration and scoring conventions and certified prior to the study through demonstration of adequate interrater reliability. In addition to these steps, raters in study A were required to audio record all PANSS assessments with a selected subset of visits being subject to IRev. PANSS assessments in study B were neither recorded nor monitored via IRev. Data quality after study completion was examined by calculating the frequency of anomalous data patterns identified as “high” (very probable or definite error) by the ISCTM Working Group in both studies. Additionally, we examined the percentage of assessments with lower than expected PANSS interview duration as captured via an eCOA platform.ResultsThere were 9441 eCOA PANSS assessments in study A and 6178 in study B included in this analysis. The proportions of flags that represented highly probable/definite error differed significantly between the studies (9% vs 18% for Study A and B, respectively, p<.01). The most significant differences in ISCTM flags were related to overly consistent scoring patterns (27 or more items scored identically to the prior visit) occurring with higher frequency in study B. Additionally, study B also had a significantly higher frequency of assessments flagged for low interview duration (< 15 minutes) (1% vs 4% for Study A and B, respectively, p<.01).DiscussionInitial rater training is necessary but not sufficient to ensure adequate data quality in schizophrenia trials. Implementation of additional in-study oversight through Independent Review or similar methods reduces the probability of data error in PANSS assessments, including the appearance of improbable rating patterns and decreased time spent interviewing study subjects. One potential limitation is that study A is a double-blind study whereas study B is an open label extension of study A.

UMMAP: a statistical analysis software package for molecular modelling

ABSTRACTUniversal Molecular Modelling Analysis Package (UMMAP) is a software package designed to provide a command line driven analysis suite for particle-based simulation codes. It is developed to work closely alongside the mesoscale dissipative particle dynamics software embedded in DL_MESO, and the molecular dynamics codes NAMD and LAMMPS. UMMAP is designed to be extendable to other modelling software. UMMAP is targeted at users working in the computational soft matter field and those looking for an ‘all-in-one’ analytical software package. It offers a unique mix of analytical tools, from widely used geometrical analyses (e.g. bond and angles distributions, structure factor, radial distributions and density profiles), to specific solutions for the soft matter community (e.g. polymer statistics, critical micelle concentration and cluster/micelle shape analyses). It provides the possibility, for a more expert user, to build in additional bespoke analyses, whilst benefiting from UMMAP's core functionality. It is very flexible in the way it reads and analyses the trajectory, allowing for several tools to be used at the same time via a single command line input. A rational set of software flags and detailed error messages render UMMAP ergonomic and user friendly while output integrity is ensured by storing manifest files to prevent the storage of unrelated material.

A new method to search for per- and polyfluoroalkyl substances (PFASs) by linking fragmentation flags with their molecular ions by drift time using ion mobility spectrometry

Per- and polyfluoroalkyl substances (PFASs) are a group of anthropogenic organic fluorinated compounds that have been detected widely. To discover unknown PFASs, previous researchers have applied high-resolution mass spectrometer using fragmentation flagging approach with common fragment ion at the same retention time as the flags. However, it was difficult to search for their molecular ion from co-eluting peaks in the full-scan spectrum at a specific retention time. Here, we attempted to utilize drift time acquired by ion mobility spectrometry for making linkages between fragment ions and their molecular ions. For validating the process, standard solution spiked with PFASs were analyzed by liquid chromatography/ion mobility – quadrupole time-of-flight mass spectrometry (LC/IM-QTOF-MS). Fluorinated fragment ions (fragmentation flags) were categorized into three classes: Class 1 (120 types of [CxFy]−), Class 2 (123 types of [CxFyO]−), Class 3 (131 types of [CxFyO3S]−) and all overlapping fragmentation flags detected at an identical retention time were bundled together as a “flag set”. Injecting standard mixed solution of 20 types of PFASs resulted in picking up 20 flag sets by fragmentation flagging. All the fragmentation flags were detected within a designated range of drift time, and their molecular ion was confirmed as a PFAS spiked in the standard solution even when co-eluting compounds were found at almost same retention time. This method was applied to a household fire extinguisher liquid, resulting in finding out nine molecular ions. Therefore, the new linking method achieved rapid searching for the prospective molecular ions using LC/IM-QTOF-MS.

Tuning synthesis flags to optimize implementation goals: Performance and robustness of the LEON3 processor as a case study

The steady growth in complexity of FPGAs has led designers to rely more and more on manufacturers’ and third parties’ design tools to meet their implementation goals. However, as modern synthesis tools provide a myriad of different optimization flags, whose contribution towards each implementation goal is not clearly accounted for, designers just make use of a handful of those flags. This paper addresses the challenging problem of determining the best configuration of available synthesis flags to optimize the designer’s implementation goals. First, fractional factorial design is used to reduce the whole design space. Resulting configurations are implemented to estimate the actual impact, and statistical significance, of each considered synthesis flag. After that, multiple regression analysis techniques predict the expected outcome for each possible combination of these flags. Finally, multiple-criteria decision making techniques enable the selection of the best set of synthesis flags according to explicitly defined implementation goals.

Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks

A graph Γ is called G-symmetric if it admits G as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of G-symmetric graphs Γ with V(Γ) admitting a nontrivial G-invariant partition B such that there is exactly one edge of Γ between any two distinct blocks of B. This is achieved by giving a classification of (G,2)-point-transitive and G-block-transitive designs D together with G-orbits Ω on the flag set of D such that Gσ,L is transitive on L∖{σ} and L∩N={σ} for distinct (σ,L),(σ,N)∈Ω, where Gσ,L is the setwise stabilizer of L in the stabilizer Gσ of σ in G. Along the way we determine all imprimitive blocks of Gσ on V∖{σ} for every 2-transitive group G on a set V, where σ∈V.

Symmetric sums of squares over k-subset hypercubes

We consider the problem of finding sum of squares (sos) expressions to establish the non-negativity of a symmetric polynomial over a discrete hypercube whose coordinates are indexed by the k-element subsets of [n]. For simplicity, we focus on the case $$k=2$$ , but our results extend naturally to all values of $$k \ge 2$$ . We develop a variant of the Gatermann–Parrilo symmetry-reduction method tailored to our setting that allows for several simplifications and a connection to flag algebras. We show that every symmetric polynomial that has a sos expression of a fixed degree also has a succinct sos expression whose size depends only on the degree and not on the number of variables. Our method bypasses much of the technical difficulties needed to apply the Gatermann–Parrilo method, and offers flexibility in obtaining succinct sos expressions that are combinatorially meaningful. As a byproduct of our results, we arrive at a natural representation-theoretic justification for the concept of flags as introduced by Razborov in his flag algebra calculus. Furthermore, this connection exposes a family of non-negative polynomials that cannot be certified with any fixed set of flags, answering a question of Razborov in the context of our finite setting.

From Furs to Farms: The Transformation of the Mississippi Valley, 1762–1825 by John Reda

Reviewed by: From Furs to Farms: The Transformation of the Mississippi Valley, 1762–1825 by John Reda Stephen Aron (bio) From Furs to Farms: The Transformation of the Mississippi Valley, 1762–1825. By John Reda. (DeKalb: Northern Illinois University Press, 2016. Pp. xiii, 201. $38.00 cloth) Truth in titling is an undervalued asset for academic histories. Typically, readers must wait for the post-colon part of the title to find out what the book or article is about. Not so, John Reda’s new volume, which announces its trajectory in its main title. From Furs to Farms is about just that, about how, in the last decades of the eighteenth century and the opening quarter of the nineteenth, agriculture supplanted trade in animal pelts as the principal economic activity in the middle Mississippi Valley. As nicely elucidated by Reda, the transformation of the Mississippi Valley from furs to farms was not so simple and straightforward, however. First, there is the region on which he focuses. In the 1760s, its imperial claimants, Spain, France, and England, designated it “the Illinois Country” and/or “Upper Louisiana.” By the 1820s, it came to be divided into the states of Illinois and Missouri. Along the way, “a person born in colonial Cahokia in the early 1760s (who never relocated) would have lived by the age of sixty under the sovereignty of France, Great Britain, Virginia, the Northwest Territory, Indiana [End Page 281] Territory, Illinois Territory, and finally, the state of Illinois. For someone living just across the river in St. Louis the succession during the same period would have been from France to Spain, back to France (however briefly), and then the District of Louisiana, the Missouri Territory, and finally, the state of Missouri” (p. 146). Yet for the region’s residents, who included diverse Indians, Africans, and Europeans, it was even more complicated than this shifting set of flags suggests. For Reda maintains that while “officials in far-off capitals continued to treat the Mississippi valley as if it were a pawn in an imperial chess game, those living there had repeatedly demonstrated the ability to thwart external attempts to convert the titular sovereignty acquired by treaty into effective sovereignty” (p. 41). Much of Reda’s story hinges on the distinction between titular and effective sovereignty, on the efforts of colonial and national officials to turn the former into the latter, and on the determination of occupants, both Natives and newcomers (a grouping that also included Indian refugees from the east), to contest, contain, and control the process by which imperial claims became more than lines drawn on not particularly meaningful maps. Ultimately, the United States succeeded where imperial predecessors failed “by offering white settlers a combination of physical protection, secure property rights, and white supremacy in exchange for their loyalty” (p. 3). But that did not happen overnight with the stroke of pens signed to treaties made in distant places. It was also not, in Reda’s telling, inevitable. To the contrary, Reda emphasizes that there was nothing manifestly destined about the assertion of authority by the United States in the middle Mississippi Valley. Moreover, understanding what happened and how it happened requires that we move beyond the “east to west sweep” that has long served to narrate the expansion of the United States. Instead, Reda insists that the passage from furs to farms “must be viewed from local perspectives . . . to understand the context” and the contest that wrought the transformation of the Illinois Country/ Upper Louisiana into the states of Illinois and Missouri (p. 146). These perspectives are now largely familiar to and accepted by [End Page 282] scholars, but they are buttressed well by Reda’s book. By spotlighting the local and by looking beyond the boundaries that are to the boundaries that were, From Furs to Farms offers a worthy model for future studies of early American places. Stephen Aron STEPHEN ARON is a professor and Robert N. Burr Department Chair at UCLA. His most recent book is The American West: A Very Short Introduction (2014). Copyright © 2017 Kentucky Historical Society

Accessible proof of standard monomial basis for coordinatization of Schubert sets of flags

The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the flag manifold) can be projectively coordinatized using products of minors of a matrix. These products are indexed by tableaux on a Young diagram. A basis of “standard monomials” for the vector space generated by such projective coordinates over the entire flag manifold has long been known. A Schubert variety is a subset of flags specified by a permutation. Lakshmibai, Musili, and Seshadri gave a standard monomial basis for the smaller vector space generated by the projective coordinates restricted to a Schubert variety. Reiner and Shimozono made this theory more explicit by giving a straightening algorithm for the products of the minors in terms of the right key of a Young tableau. Since then, Willis introduced scanning tableaux as a more direct way to obtain right keys. This paper uses scanning tableaux to give more-direct proofs of the spanning and the linear independence of the standard monomials. In the appendix it is noted that this basis is a weight basis for the dual of a Demazure module for a Borel subgroup of GLn. This paper contains a complete proof that the characters of these modules (the key polynomials) can be expressed as the sums of the weights for the tableaux used to index the standard monomial bases.

Accessible proof of standard monomial basis for coordinatization of Schubert sets of flags

The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the flag manifold) can be projectively coordinatized using products of minors of a matrix. These products are indexed by tableaux on a Young diagram. A basis of "standard monomials" for the vector space generated by such projective coordinates over the entire flag manifold has long been known. A Schubert variety is a subset of flags specified by a permutation. Lakshmibai, Musili, and Seshadri gave a standard monomial basis for the smaller vector space generated by the projective coordinates restricted to a Schubert variety. Reiner and Shimozono made this theory more explicit by giving a straightening algorithm for the products of the minors in terms of the right key of a Young tableau. Since then, Willis introduced scanning tableaux as a more direct way to obtain right keys. This paper uses scanning tableaux to give more-direct proofs of the spanning and the linear independence of the standard monomials. In the appendix it is noted that this basis is a weight basis for the dual of a Demazure module for a Borel subgroup of GL(n). This paper contains a complete proof that the characters of these modules (the key polynomials) can be expressed as the sums of the weights for the tableaux used to index the standard monomial bases.