Insertion Rules Research Articles

Looking for default vocabulary insertion rules: Diachronic morphosyntax of the Japanese addressee-honorification system

As opposed to syntactic operations (such as Merge), morphology has been seen as the source of language variation. But few attempts have been made in the field of Distributed Morphology to explicitly and formally identify the role of postsyntactic rules in language change. By analyzing the change in the Japanese addressee-honorification system (Yamada 2019c), this paper proposes that the emergence of the new grammar — which seems to be an instance of a microparametric change in the Agree operation (Kayne 2000; 2005; Biberauer & Roberts 2012; Barbiers 2013) — is, in fact, explained as a morphological reanalysis: the reanalysis is caused by overgeneralization of vocabulary insertion rules resulting from abductive reasoning in pursuit of default rules. It is also suggested from a quantitative corpus survey using Time Series Analysis (the Dynamic Generalized Linear Mixed Effects Model) that the reanalysis is facilitated particularly in the configuration where the addressee-honorific marking is immediately followed by a sentence-final particle.

Preposition Allomorphy in Calabrian Greek (Greko) and Standard Modern Greek and Its Theoretical Implications

The article argues that the alternation between the prepositions asce ‘from’ and an ‘from’ in the south Italian Greek variety Greko and a similar alternation between the preposition se ‘in, to, into’ and the allomorph s- found in both Greko and Standard Modern Greek represent instances of contextually conditioned allomorphy sensitive to a linearly adjacent definite article. Alternative approaches in terms of portmanteaux or making use of hyper-contextual rules for vocabulary insertion are shown to be unable to account for the data, supporting the need for allowing reference to linear adjacency relations in morphosyntactic theories of allomorphy.

The Pieri formulas for hook type Schur multiple zeta functions

We study the Pieri type formulas for the Schur multiple zeta functions along with those for the Schur functions. To express these formulas, we introduce a new insertion rule for adding boxes in the Young tableaux and obtain the results for the hook type Schur multiple zeta functions. For the proof, we show certain extended Jacobi-Trudi formulas for the Schur multiple zeta functions.

Quoi-sluices in French

Sluicing has traditionally been analyzed as an operation involving wh-movement and deletion (Merchant 2001). French is a language that has both fronted and wh-in situ strategies; on the surface, however, it seems that French sluices do not involve (overt) movement, in spite of this being an available option. For nearly all wh-words, the in situ and moved forms are the same; the notable exception is que/quoi ‘what’— que is found in fronted wh-questions alone, while quoi is found in situ. In sluicing, only quoi surfaces, suggesting that French may be a challenge for the movement-and-deletion approach (Dagnac 2019).By formalizing an analysis within a late insertion approach to the syntax-morphology interface, I argue that not only do sluices in French involve full structure, but that these involve movement as well. I assume that the wh-word is initially represented in the syntactic derivation as an abstract feature bundle. The morphological form is determined in the mapping of syntax to morphology by locality-dependent Vocabulary Insertion (VI) rules that are sensitive to C. These rules apply only after ellipsis occurs. Additionally, following Thoms (2010), I argue that C is targeted in sluicing, and as a result sluicing destroys the context that would trigger que. In this way, French sluicing provides support for the idea that ellipsis is able to bleed morphological operations (Saab & Lipták 2016; among others). The benefit of this analysis is that it is able to capture sluicing in French, while simultaneously explaining the behavior of quoi more generally.

Analyzing the Trade-Off Between Complexity Measures, Ambiguity in Insertion System and Its Applications

Insertion is one of the basic operations in DNA computing. Based on this operation, an evolutionary computation model, the insertion system, was defined. For the above defined evolutionary computation model, varying levels of ambiguity and basic descriptional complexity measures were defined. In this paper, we define twelve new (descriptional) complexity measures based on the integral parts of the derivation, such as axioms, strings to be inserted, and contexts used in the insertion rules. Later, we analyze the trade-off among the (newly defined) complexity measures and the existing ambiguity levels. Finally, we examine the application of the analyzed trade-off in natural languages and modelling of bio-molecular structures.

Increasing Message Capacity in Images Using Advanced Least Significant Bit and Image Scaling

Purpose: Steganography is the science of writing hidden or hiding messages so that apart from the sender and the recipient, no one can know or realize that a message is hidden. This paper aims to analyze the method of advanced LSB to increase message capacity. Methods/Study design/approach: The steganography technique advanced LSB algorithm develops pre-existing steganographic algorithms such as LSB by utilizing a range of media pixel values cover (images that are used as media to hide messages) with different insertion rules from LSB. Image scaling in digital image processing is known as resampling. Resampling is a mathematical technique used to produce a new image from the previous image with different pixel size, often called interpolation. Increasing the pixel size of the previous image is called upsampling and in this study we will only use twice the image magnification. Result/Findings: The results of each test method using advanced LSB without image scaling and advanced LSB using image scaling were compared to obtain detailed comparison results of each method. Novelty/Originality/Value: Advanced LSB and image scaling in this study can increase the message capacity three times compared to only using the advanced LSB method without image scaling. It depends on the image pixels used.

FishPhyloMaker: An R package to generate phylogenies for ray-finned fishes

Phylogenies summarize evolutionary information that is essential in the investigation of ecological and evolutionary causes of diversity patterns. They allow investigating hypotheses from trait evolution to the relationship between evolutionary diversity and ecosystem functioning. However, obtaining a comprehensive phylogenetic hypothesis can be difficult for some groups, especially those with a high number of species, that is the case for fishes, particularly tropical ones. The lack of species in phylogenetic hypotheses, called Darwinian shortfalls, can hinder ecological and evolutionary studies involving this group. To tackle this problem, we developed FishPhyloMaker, an R package that facilitates the generation of phylogenetic trees through a reliable and reproducible procedure, even for a large number of species. The package adopts well-known rules of insertion based on cladistic hierarchy, allowing its use by specialists and non-specialists in fish systematics. We tested the reliability of our algorithm in maintaining important properties of phylogenetic distances running a sensitivity analysis. We also exemplified the use of the FishPhyloMaker package by constructing complete phylogenies for fishes inhabiting the four richest freshwater ecoregions of the world. Furthermore, we proposed a new method to calculate Darwinian shortfalls and mapped this information for the major freshwater drainages of the world. FishPhyloMaker will expand the range of evolutionary and ecological questions that can be addressed using ray-finned fishes as study models, mainly in the field of community phylogenetics, by providing an easy and reliable way to obtain comprehensive phylogenies. Further, FishPhyloMaker presents the potential to be extended to other taxonomic groups that suffer from the same difficulty in the obtention of comprehensive phylogenetic hypothesis.

On the generative capacity of matrix insertion-deletion systems of small sum-norm

A matrix insertion-deletion system (or matrix ins-del system) is described by a set of insertion-deletion rules presented in matrix form, which demands all rules of a matrix to be applied in the given order. These systems were introduced to model very simplistic fragments of sequential programs based on insertion and deletion as elementary operations as can be found in biocomputing. We are investigating such systems with limited resources as formalized in descriptional complexity. A traditional descriptional complexity measure of such a matrix ins-del system is its size s=(k;n,i',i'';m,j',j''), where the parameters from left to right represent the maximal matrix length, maximal insertion string length, maximal length of left contexts in insertion rules, maximal length of right contexts in insertion rules; the last three are deletion counterparts of the previous three parameters. We call the sum n+i'+i''+m+j'+j'' the sum-norm of s. We show that matrix ins-del systems of sum-norm 4 and sizes (3; 1, 0, 0; 1, 2, 0), (3; 1, 0, 0; 1, 0, 2), (2; 1, 2, 0; 1, 0, 0), (2; 1, 0, 2; 1, 0, 0), and (2; 1, 1, 1; 1, 0, 0) describe the recursively enumerable languages. Moreover, matrix ins-del systems of sizes (3; 1, 1, 0; 1, 0, 0), (3; 1, 0, 1; 1, 0, 0), (2; 2, 1, 0; 1, 0, 0) and (2; 2, 0, 1; 1, 0, 0) can describe at least the regular closure of the linear languages. In fact, we show that if a matrix ins-del system of size s can describe the class of linear languages mathrm {LIN}, then without any additional resources, matrix ins-del systems of size s also describe the regular closure of mathrm {LIN}. Finally, we prove that matrix ins-del systems of sizes (2; 1, 1, 0; 1, 1, 0) and (2; 1, 0, 1; 1, 0, 1) can describe at least the regular languages.

Morphosyntax and Phonology of Agreement in Turkish

AbstractThis article offers a new morphosyntactic account of subject agreement in the Turkish verbal domain. The account is based on a combination of well‐known, novel, and overlooked observations about the distribution and prosody of verbal agreement. In Turkish, when certain morphosyntactic requirements are met and the verb is focused, as in fragment answers with ellipsis, the agreement morpheme can be parsed inside or outside of the prosodically prominent part of the verbal domain that constitutes the fragment answer. I claim that this optionality is a reflex of how the morphemes that constitute the verbal domain are postsyntactically concatenated. In particular, I argue that an agreement morpheme either lowers together with its host (full lowering) or is stranded when its host lowers (partial lowering). In full lowering, agreement is contained within the prominent part of the verbal domain, whereas in partial lowering, agreement falls outside of this prominence domain. I also show that the prosodic variability in question is observed only when two related noncanonical realizations of agreement are possible: medial agreement and double agreement. The Vocabulary Insertion rules that I postulate for the subject‐agreement paradigms of the Turkish verbal domain capture the acceptable cases of medial and double agreement and successfully predict in which environments medial agreement is optional and in which environments it is obligatory.

Coverage Layout Design Rules and Insertion Utilities for CMP-Related Processes

The continuous scaling needed for higher density and better performance has introduced some new challenges to the planarity processes. This has resulted in new definitions of the layout coverage rules developed by the foundry and provided to the designers. In advanced technologies, the set of rules considers both the global and the local coverage of the front-end-of line (FEOL) dielectric layers, to the back-end-of-line (BEOL) Cu layers and Al layers, to support high-k/Metal Gate process integration. For advance technologies, a new set of rules for dummy feature insertion was developed by the integrated circuit (IC) manufacturers in order to fulfill coverage limits. New models and utilities for fill insertion were developed, taking into consideration the design coverage, thermal effects, sensitive signal line, critical analog and RF devices like inductors, and double patterning requirements, among others. To minimize proximity effects, cell insertion was also introduced. This review is based on published data from leading IC manufacturers with a careful integration of new experimental data accumulated by the authors. We aim to present a typical foundry perspective. The review provides a detailed description of the chemical mechanical polishing (CMP) process and the coverage dependency, followed by a comprehensive description of coverage rules needed for dielectric, poly, and Cu layers used in advanced technologies. Coverage rules verification data are then presented. RF-related aspects of some rules, like the size and the distance of dummy features from inductors, are discussed with additional design-for-manufacturing layout recommendations as developed by the industry.

A Bio-Inspired Model of Picture Array Generating P System with Restricted Insertion Rules

In the bio-inspired area of membrane computing, a novel computing model with a generic name of P system was introduced around the year 2000. Among its several variants, string or array language generating P systems involving rewriting rules have been considered. A new picture array model of array generating P system with a restricted type of picture insertion rules and picture array objects in its regions, is introduced here. The generative power of such a system is investigated by comparing with the generative power of certain related picture array grammar models introduced and studied in two-dimensional picture language theory. It is shown that this new model of array P system can generate picture array languages which cannot be generated by many other array grammar models. The theoretical model developed is for handling the application problem of generation of patterns encoded as picture arrays over a finite set of symbols. As an application, certain floor-design patterns are generated using such an array P system.

Paradigm Structure in French Verbal Inflection

Verb inflectional morphology in French exhibits a range of complexities both in the structure of verb stems (stem-final latent consonant; vowel variation; stem-final nasal vowel ; suppletive forms ; etc.) and the organization of the inflectional system, marked for five grammatical categories: tense, aspect, mode, person and number, which in the majority of cases cannot be identified as a morphological or phonological unit. The main objective of this paper is to show that these morphosyntactic properties should be analyzed as a global affix, which operate within the same space, with no fixed order. This strategy has the advantage to 1) take into account all the verb syntactic properties, 2) avoid multiple zero suffixes, 3) avoid the use of different analyses depending on the verb class, 4) avoid non-productive and phonologically unmotivated rules of insertion of theme vowels as in [dorm-i-r-ons] dormirons, and epenthetic consonants as in [ku-d-r-ons] coudrons, 5) account for French verb inflectional system in a simple and more explanatory way than strictly segmental analyses without "motivated" processes, using massive suppletion and/or stems dependencies, where inflected verbal forms are related by arbitrary implicational associations or quantitative measures based on extensive memorization. This analysis also has the property of explaining by means of a very general principle (the Onset principle) the realization of a stem-final FC in front of the affixes 'ions' and 'iez' as in before any suffix beginning with an empty onset. The verb inflectional paradigmatic structures is captured within Construction Morphology (CxM) as stated in Booij, 2010.

Traços categorizadores na derivação de pares nome-verbo em Libras

A morfologia tem por objeto de estudo a estrutura, formação e categorização de unidades lexicais e apresenta diferentes perspectivas de análise. Sob o aporte gerativista, o componente lexical dispõe de palavras previamente categorizadas e traços que são o input para a sintaxe (CHOMKSY, 1970). Em Halle e Marantz (1993), a morfologia não existe per se, mas está distribuída em diferentes lugares da arquitetura da gramática e deve espelhar as operações sintáticas. A partir desse viés, assumimos que a formação de sinais e estruturas complexas se dá em um único locus gerativo, o componente sintático.Assim, coloca-se que em uma língua não oral, a Libras, raízes acategoriais são concatenadas a traços abstratos, por meio de regras de inserção de conteúdo fonológico, para se formarem os sinais. Neste artigo, evidenciamos pares nome-verbo que apresentam uma mesma forma superficial e são diferenciadossintaticamente por um v ou por um n categorizador, com realização fonológica Ø ou com realização específica em alguns membros dos pares. Essa proposta corrobora o Princípio da Uniformidade (CHOMSKY, 2001), pois, na ausência de fortes evidências que apontem para o contrário, reforçamos que as línguas são uniformes e as variações são restritas a propriedades facilmente identificáveis dos enunciados.

Vowel insertion after coda plosives in the dialect of Paraíba (PB): reflections on the establishment of syllabic and social boundaries

The present study aimed to verify how Brazilian Portuguese (BP) speakers born in the city of Campina Grande (PB) produce coda plosives in word-medial and -final positions, considering the possibilities of dealing with stray consonants in BP. Thus, 960 tokens of syllables closed by /p, t, k, b, d, g/ were recorded in audio and submitted for multivariate analysis. The results indicate that the application of the vowel insertion rule is influenced by two internal factors, namely the stray consonants and the words’ etymology, and two extralinguistic ones, that is, speakers’ gender and their L2 proficiency levels.

Machine Intelligence in Cardiovascular Medicine.

The computer science technology trend called artificial intelligence (AI) is not new. Both machine learning and deep learning AI applications have recently begun to impact cardiovascular medicine. Scientists working in the AI domain have long recognized the importance of data quality and provenance to AI algorithm efficiency and accuracy. A diverse array of cardiovascular raw data sources of variable quality-electronic medical records, radiological picture archiving and communication systems, laboratory results, omics, etc.-are available to train AI algorithms for predictive modeling of clinical outcomes (in-hospital mortality, acute coronary syndrome risk stratification, etc.), accelerated image interpretation (edge detection, tissue characterization, etc.) and enhanced phenotyping of heterogeneous conditions (heart failure with preserved ejection fraction, hypertension, etc.). A number of software as medical device narrow AI products for cardiac arrhythmia characterization and advanced image deconvolution are now Food and Drug Administration approved, and many others are in the pipeline. Present and future health professionals using AI-infused analytics and wearable devices have 3 critical roles to play in their informed development and ethical application in practice: (1) medical domain experts providing clinical context to computer and data scientists, (2) data stewards assuring the quality, relevance and provenance of data inputs, and (3) real-time and post-hoc interpreters of AI black box solutions and recommendations to patients. The next wave of so-called contextual adaption AI technologies will more closely approximate human decision-making, potentially augmenting cardiologists' real-time performance in emergency rooms, catheterization laboratories, imaging suites, and clinics. However, before such higher order AI technologies are adopted in the clinical setting and by healthcare systems, regulatory agencies, and industry must jointly develop robust AI standards of practice and transparent technology insertion rule sets.

KAIDAH-KAIDAH FONOLOGI BAHASA SUMBA DIALEK KAMBERA

This study aims to address problems related to morpheme structure requirements and phonological processes and rules. The Kambera dialect (BSDK) has 24 origin segments consisting of nineteen consonant segments, namely / p, b, t, d, k, m, n, ŋ, ň, mb, nd, nj, ŋg, j, h , l, r, w, y /, and five vocal segments, i.e., u, e, o, a /. Phonetically, four vocal segments of them experience relaxation, such as / i, u, e, o / being [I, U, E, O]. To distinguish the twenty-four segments, fourteen distinguishing features are needed.
 The segment (segment) found in BSDK is very limited, there are only vocal groups, whereas consonant groups are not found. To explain the possibility of existing vocal groups, a rule has been formulated, that is, if - then.
 Vocal groups in BSDK include / i - u /, / i - a /, / u - a /, / u - i /, / e - u /, / e - i /, / o - i /, / a - i /, and / a - u /. To describe the phonological process that occurs, four phonological rules are needed, namely (1) vocal and semivocal insertion rules, (2) syllable repetition rules, and (3) vocal relaxation rules, and (4) vocal change rules.

Enhancing Security Management at Software-Defined Exchange Points

Distributed Denial-of-Service (DDoS) attacks continue to escalate in size and scale, and there is growing need for security management at network-level that can restrict a service to a geography (aka geo-blocking) and prevent the victim’s IP address from being faked (aka IP-spoof protection). The former reduces the attack surface on the victim, while the latter reduces liability on the organization from which the attack originates. Unfortunately, these solutions are hard to implement in today’s networks, requiring expensive hardware appliances and/or manual configuration. This was exemplified in the recent attack on the Australian government census website, which had to be brought down for weeks in order for security configurations to be applied. In this paper, we first argue that an Internet Exchange Point (IXP) is an appropriate place for managing security of an enterprise, and then design, implement, and evaluate a geo-blocking and IP-spoofing protection solution for a Software Defined IXP. Our first contribution is to define a grammar for operators to specify their high-level security intents, and a compiler that automatically synthesizes these to low-level flow rules for insertion to the interconnect fabric. Our second contribution is to develop a mixed integer linear program optimization framework for distributing flow rules across switches with limited table size, while minimizing carriage costs of malicious and extraneous traffic. Finally, we evaluate the cost benefits of our scheme via simulation of a large IXP network, and demonstrate its practical utility in blocking attacks via implementation over the open-source ONOS controller and experimentation in an SDN testbed.

TG-SPP: A One-Transmission-Gate Short-Path Padding for Wide-Voltage-Range Resilient Circuits in 28-nm CMOS

Resilient circuits with timing error detection and correction (EDAC) can eliminate the excess timing margin but suffer from the short-path (SP) issue where SPs must be padded to exceed the detection window. SP padding (SPP) is similar to, but severer than, hold time fixing. Thus, it incurs significant area overhead, especially when working in the near-threshold region. In this article, we propose a transmission gate-based SPP (TG-SPP) method, which uses only one transmission gate to extend an SP to the negative clock phase while keeping the critical paths unaffected. Compared with the two-phase latch way or the conventional padding with tens to hundreds of buffers in an SP, our method efficiently decreases the overhead. We develop transmission gate insertion rules and an automatic insertion flow to overcome the complicated intersection problem of short and critical paths. To further reduce the EDAC area overhead, we also propose a lightweight error detection latch that has only two extra transistors compared to a conventional 24-T flip-flop for the conventional way. We implement all the proposed techniques in an SHA-256 chip using the 28-nm CMOS process. Results show that our TG-SPP method achieves the same padding effect as the two-phase latch-based method while reducing both the glitch power and sequential area overhead by a factor of 6 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\times $ </tex-math></inline-formula> . The fabricated resilient chips are measured to achieve 55%–405% frequency improvement and 38.6%–69.4% power saving compared with the typical margined baseline at the near-threshold region.

Study on Fractional Slot Distribution of Brushless Doubly Fed Machine

Brushless doubly-fed machine (BDFM) has advantages of brushless reliability and low frequency conversion capacity. It has a broad application prospect in AC speed regulation and direct drive wind power generation system. In this paper, winding arrangement and slot electromotive force star diagram of stator with different pole numbers are analyzed and studied comprehensively. When the number of slots per pole and phase is different, we get the winding wire insertion rule. These rules are of great significance for further design and application of multipole BDFM.

Aspects of the Morphophonology of the Verb in Latin and in German and English

Aspects of the Morphophonology of the Verb in Latin and in German and English