Standard Notation Research Articles

Concept learning games

In this paper, we intend to have a game theoretic study on the concept learning problem in a multi-agent system. Concept learning is a very essential and well-studied domain of machine learning when it is studied under the characteristics of a multi-agent system. The most important reasons are the partiality of the environment perception for any agent and also the communication holdbacks, resulting into a deep need for a collaborative protocol in favor of multi-agent transactions. Here we wish to investigate multi-agent concept learning with the help of its components, thoroughly with a game theoretic taste, esp. on the pre-learning processes. Based on two standard notations, we address the non-unanimity of concepts, classification of objects, voting and communicating protocol, and also the learning itself. In such a game of concept learning, we consider a group of agents, communicating and consulting to upgrade their ontologies based on their conceptualizations of the environment. For this purpose, we investigate the problem in two separate and standard distinctions of game theory study, cooperation and competition. Several solution concepts and innovative ideas from the multi-agent realm are used to produce an approach that contains the reasoning process of the agents in this system. Some experimentations come at the end to show the functionality of our approach. These experimentations come distinctly for both cooperative and competitive views.

Inequalities involving multivariate convex functions III

20). The inner product of x, ye R“ is denoted by x. y= C:=, x,y,. For a given set A c Rk, xA(x), vol,(A), and [A] represent the characteristic function, the k-dimensional Lebesgue measure, and the convex hull of A, respectively. We use standard multi-index notation, i.e., for

Weyl's theorem for algebraically k-quasiclass A operators

If T or T is an algebraically k-quasiclass A operator acting on an infinite di- mensional separable Hilbert space and F is an operator commuting with T, and there exists a positive integer n such that F n has a finite rank, then we prove that Weyl's theorem holds for f(T)+F for every f2 H( (T)), where H( (T)) denotes the set of all analytic functions in a neighborhood of (T). Moreover, if T is an algebraically k-quasiclass A operator, then -Weyl's theorem holds for f(T). Also, we prove that if T or T is an algebraically k-quasiclass A operator then both the Weyl spectrum and the approximate point spectrum of T obey the spectral mapping theorem for every f2 H( (T)). We begin with some standard notation on Fredholm theory. Throughout this paper letH be a separable complex Hilbert space with inner producth ;i . Let B(H) and K(H) denote respectively, theC -algebra of all bounded linear operators and the ideal of compact operators acting on H. If T 2 B(H), we shall write kerT and ranT for the null space and the range of T respectively. Also let (T ) =dim kerT, (T ) =dim kerT and let (T ), a(T ) denote the spectrum, approximate point spectrum of T, respectively. Let p = p(T ) be the ascent of T; i.e., the smallest nonnegative integer p such that kerT p = kerT p+1 . If such an integer does not exist, we put p(T ) =1. Analogously, let q = q(T ) be the descent of T; i.e., the smallest nonnegative integer q such that ran T q =ranT q+1 , and if such an integer does not exist, we put q(T ) =1. It is well known that if p(T ) and q(T ) are both finite then p(T ) = q(T ). Moreover, 0 < p( T ) = q( T ) <1 precisely when is a pole of the resolvent of T, see Heuser (20, Proposition 50.2). An operator T 2 B(H) is called Fredholm if ranT is

Pattern matching for the masses using custom notations

For many programmers, the notion of “pattern matching” evokes nothing more than regular expressions for matching unstructured text, or technologies such as XPath to match semi-structured data in XML. This common perception of pattern matching is partly due to the success of regular expressions and XPath, which are supported in many popular programming languages today, either as standard libraries or as part of the language. But it is also due to the fact that many programmers never used another elegant form of pattern matching—on structured data, i.e., the native data structures of a programming language. This form of matching is common in functional or logic languages used in the research, but unfortunately much less used in the software industry. It is indeed very surprising that none of the popular languages in use today support, in their standard form, a nearly general form of structured data matching, decades after this technology has been discovered and continuously improved.This paper shows that programmers do not have to wait for next generation languages to integrate pattern matching, neither need they use non-standard pre-processors, thereby losing some advantages that are most important in an industrial setting: official support, compatibility, standardization, etc. Instead, pattern matching of native data in custom notations can be implemented as a minimalist library in popular object languages. Thus, some of the comfortable existing notations from logic languages can be reused, existing standard notations for structured data such as JSON (JavaScript Object Notation) can be smoothly extended to support pattern matching, and new notations can be designed.As in most library implementations of regular expressions, custom notation patterns are simply represented as strings. They can be used in two different modes: interpreted and compiled. This paper presents two open-source implementations of custom matching notations, for Java and JavaScript, exhibiting a reasonable overhead compared to other forms of pattern matching.

On the self-trapping of the solutions of the nonlinear Schrödinger evolution equation

i ∂u ∂t = Δu+ f ( |u| ) u in R × R+, (1) u|t=0 = u0(x) in R. (2) Here f(s) is a given function on [0,∞), u0 is a given function in Rn. We shall use the standard notation from the monograph of Lions [1]: H(Rn) = L2(Rn) and H1(Rn) = W 1 2 (R n) are complex Hilbert Sobolev spaces, ‖ · ‖ is the norm on L2(R), ‖ · ‖p is the norm on Lp(R), p ≥ 1. Lemma 1 (on local existence). Suppose that u0 ∈ H1(Rn), f(0) = 0, and f(s) ∈ C1([0;∞)). Then there exists a t0 > 0 such that problem (1), (2) has a unique local solution for the class of functions C([0, t0);H(R)) ∩ C([0; t0);H(R)) with the following alternative: either this solution can be continuedwith respect to time to [0,∞), or this solution can be continued to the maximal existence interval [0, tmax), where tmax ≥ t0; furthermore, ‖u(·, t)‖H1(Rn) → +∞ as t → tmax. Lemma 1 is proved by reducing problem (1), (2) to the corresponding integral equation (see [2]) and then using the contraction mapping principle. In what follows, we shall use the following notation. Let u(x, t) be the maximal solution of problem (1), (2). We set A(t) = A(u(t)) = ‖∇u(·, t)‖, E(t) = E(u(t)) = A(t)−B(t), where B(t) = ˆ

A pure embedding of attribute grammars

Attribute grammars are a powerful specification paradigm for many language processing tasks, particularly semantic analysis of programming languages. Recent attribute grammar systems use dynamic scheduling algorithms to evaluate attributes on demand. In this paper, we show how to remove the need for a generator, by embedding a dynamic approach in a modern, object-oriented and functional programming language. The result is a small, lightweight attribute grammar library that is part of our larger Kiama language processing library. Kiama’s attribute grammar library supports a range of advanced features including cached, uncached, higher order, parameterised and circular attributes. Forwarding is available to modularise higher order attributes and decorators abstract away from the details of attribute value propagation. Kiama also implements new techniques for dynamic extension and variation of attribute equations. We use the Scala programming language because of its support for domain-specific notations and emphasis on scalability. Unlike generators with specialised notation, Kiama attribute grammars use standard Scala notations such as pattern-matching functions for equations, traits and mixins for composition and implicit parameters for forwarding. A benchmarking exercise shows that our approach is practical for realistic language processing.

Cloak and DAG: a response to the comments on our comment.

Our original comment (Lindquist and Sobel, 2011) made explicit the types of assumptions neuroimaging researchers are making when directed graphical models (DGMs), which include certain types of structural equation models (SEMs), are used to estimate causal effects. When these assumptions, which many researchers are not aware of, are not met, parameters of these models should not be interpreted as effects. Thus it is imperative that neuroimaging researchers interested in issues involving causation, for example, effective connectivity, consider the plausibility of these assumptions for their particular problem before using SEMs. In cases where these additional assumptions are not met, researchers may be able to use other methods and/or design experimental studies where the use of unrealistic assumptions can be avoided. Pearl does not disagree with anything we stated. However, he takes exception to our use of potential outcomes' notation, which is the standard notation used in the statistical literature on causal inference, and his comment is devoted to promoting his alternative conventions. Glymour's comment is based on three claims that he inappropriately attributes to us. Glymour is also more optimistic than us about the potential of using directed graphical models (DGMs) to discover causal relations in neuroimaging research; we briefly address this issue toward the end of our rejoinder.

A flexible, extensible online testing system for mathematics

&lt;span&gt;An online testing system developed for entry-skills testing of first-year university students in algebra and calculus is described. The system combines the open-source computer algebra system &lt;/span&gt;&lt;em&gt;Maxima&lt;/em&gt;&lt;span&gt; with computer scripts to parse student answers, which are entered using standard mathematical notation and conventions. The answers can involve structures such as: lists, variable-precision-floating-point numbers, integers and algebra. This flexibility allows more sophisticated testing designs than the multiple choice, or exact match, paradigms common in other systems, and the implementation is entirely vendor neutral. Experience using the system and ideas for further development are discussed.&lt;/span&gt;

Transformation of UML Class Diagram for Object Oriented Database System

a-days use of objects is a common approach in all aspects of computing. An Object-Oriented database can utilize the benefits of both the design and implementation of any application. Object-Oriented database System is the fusion of Database Management System with Object-Oriented System. UML provides stable and industry standard notation for object- oriented analysis and design models. A case study of NSC scheme of Indian Postal Services is considered for storing the data using object database modeling. UML class diagram and sequence diagram are constructed for the post office system and then the transformation of class diagram is done for the ease of understanding and working.

An empirical analysis of overlap publication in Chinese language and English research manuscripts.

BackgroundThere are a number of sound justifications for publishing nearly identical information in Chinese and English medical journals, assuming several conditions are met. Although overlap publication is perceived as undesirable and ethically questionable in Europe and North America, it may serve an important function in some regions where English is not the native tongue. There is no empirical data on the nature and degree of overlap publication in English and Chinese language journals.Methods/Principal FindingsA random sample of 100 English manuscripts from Chinese institutions was selected from PubMed. Key words and institutions were searched in the China National Knowledge Infrastructure, a comprehensive Chinese language research database. Unacknowledged overlap was a priori defined according to International Committee of Medical Journal Editor (ICMJE) guidelines following examination by two individuals. 19% (95% CI 11–27) of English manuscripts from Chinese institutions were found to have substantial overlap with Chinese published work based on full text examination. None of the manuscripts met all of the criteria established by the ICMJE for an acknowledged overlap publication. Individual-level, journal-level, and institutional factors seem to influence overlap publication. Manuscripts associated with an institution outside of China and with more than one institution were significantly less likely to have substantial overlap (p<0.05).Conclusions/SignificanceOverlap publication was common in this context, but instances of standard ICMJE notations to acknowledge this practice were rare. This research did not cite the identified overlap manuscripts with the hope that these empirical data will inform journal policy changes and structural initiatives to promote clearer policies and manuscripts.

Dependability analysis of DES based on MARTE and UML state machines models

UML (Unified Modeling Language) is a standard design notation which offers the state machines diagram to specify reactive software systems. The "Modeling and Analysis of Real-Time and Embedded systems" profile (MARTE) enables UML with capabilities for performance analysis. MARTE has been specialized in a "Dependability Analysis and Modeling" profile (DAM), then providing UML with dependability assets. In this work, we propose an approach for the automatic transformation of UML-DAM models into Deterministic and Stochastic Petri nets and the subsequent dependability analysis.

Threat scenario‐based security risk analysis using use case modeling in information systems

ABSTRACTSuccessful Security Risk Analysis (SRA) enables us to develop a secure information management system and provides valuable analysis data for future risk estimation. One of the qualitative techniques for SRA is the scenario method. This provides a framework for our explorations that raises our awareness and appreciation of uncertainty. However, the existing scenario methods are too abstract to be applicable to some situations and have not been formalized in information systems (ISs) because they do not explicitly define artifacts or have any standard notation. Therefore, this paper proposes the improved scenario‐based SRA approach, which can create SRA reports using threat scenario templates and manage security risk directly in ISs. Furthermore, in order to show how to apply the proposed method in a specific environment, especially in a Broadband convergence Network (BcN) environment, a case study is presented. Copyright © 2011 John Wiley &amp; Sons, Ltd.

“In an Easy and Familiar Style:” Music Education and Improvised Accompaniment Practices in the U.S., 1820–80

A complimentary review of a performance by the Fisk Jubilee Singers in 1871 of William Bradbury's popular choral work, Esther, the Beautiful Queen, drew particular attention to the ensemble's accompanist, Ella Sheppard. The critic noted that Sheppard, an organist, played with true artistic touch, showing consummate skill and taste as well as a thorough knowledge of rules, as to and modulations. An examination of Bradbury's score reveals the abundance of musical rules Sheppard followed with considerable facility, for most of the work's numbers lack fully written-out accompaniments and none include figured bass symbols. The comments regarding Sheppard's performance, especially the observation of her familiarity with progressions and modulations, strongly imply that she improvised accompaniments. Ultimately, her unimpeachable ability at the keyboard improved the effect of the Singers' production of Esther, the Beautiful Queen. (3) Regardless of how much or how little of the accompaniment to Esther Sheppard may have worked out in advance, the fact remains that Bradbury's music manifests accompaniment practices commonplace in the U.S. during the years spanning approximately 1820 to 1880. Much of the music published in this time period consisted of tune book choral scores printed without accompaniment, or with accompaniments merely suggested by the use of figured bass symbols. In the absence of figured bass, a keyboard player of modest ability could create a functional accompaniment by simply doubling the pitches of some of the voice parts with little, if any, elaboration. Tune book scores not only facilitated these practices, but their format also reveals that American musicians retained certain fundamental expectations and assumptions associated with the European Baroque accompaniment tradition. In the very least, to realize an accompaniment from a tune book score required a basic knowledge of diatonic harmony and, in some cases, that the player be able to comprehend figured bass symbols. There were discernible differences between European and American accompaniment practices, however. In the U.S., the performance of improvised accompaniment endured decades beyond the European transition from the Baroque to the Classical style period. Aside from the matter of longevity, improvised accompaniment practices in Europe were largely associated with cultivated concert, operatic, sacred, or court repertoire. Conversely, tune book content consisted mostly of uncomplicated music not normally considered to represent the cultivated tradition, such as popular and religious songs and instructional pieces. Those who performed tune book accompaniments were usually amateurs, teachers, or church musicians, whereas European musicians who realized accompaniments, especially during the Baroque period, had generally learned their art through extensive, specialized training, often in a conservatory environment. In the discussion below I consider salient aspects of tune book accompaniment notation and practices prevalent in nineteenth-century U.S. during the era associated with Lowell Mason and the early decades of the music education movement. Tune books printed with standard notation rather than shape-notes will comprise the subject of this discussion. I will focus on a format common in tune books of this period: four-voice scores with each voice printed on a separate staff. Tune Books We have tune books without number, ... and a new tune book is wanted every year, just as the makers of them intend. James M. Hewins (1856) (4) Throughout the nineteenth century, the American publishing industry flooded the market with thousands of inexpensive tune books crammed with popular songs. (5) The commercially-driven format prevailed, in part, because Americans did not import the system of aristocratic and royal patronage that supported many celebrated European composers, performers, and publishing ventures. …

Spot-welding sequence planning and optimization using a hybrid rule-based approach and genetic algorithm

Performing assembly planning to find a valid hierarchical assembling structure of a product (i.e. Manufacturing Bill of Materials or MBOM) based on the constraints and necessities inferred from or declared by different sources is potentially complicated. On the other hand, Engineering Changes (EC) may drastically affect the constraints and necessities which the planning of an MBOM was based on. Managing ECs to evaluate and propagate their effects on the upstream data used in assembly planning and downstream activities and information is crucial but problematic. Often it is possible to define a set of rules for the constraints and necessities of assembly planning and find solutions or check validity of solutions based on the rule-set. This paper proposes a rule-based assembly planning method and introduces the concepts and standard notations on how structured rule-sets can be derived from descriptive rules and then used in an algorithm for generating or validating MBOMs. The method was partially automated and successfully employed along with a commercial Virtual Manufacturing package integrated with an in-house developed GA-based sequence optimizer and applied to the sequence optimization in minimizing the cycle time of the robotic spot welding operations for a sheet-metal assembly found in automotive industry.

Speaking Their Language: Guitar Tablature in the Middle School Classroom

In this article, the historical roots of tablature for stringed instruments are noted, and the use of tablature is explained. Modern guitar tablature is then shown and explained, and the author leads the reader through the basics of using Guitar Pro 6, a guitar tablature program that simultaneously displays standard Western staff notation. The argument is made that using such a program in music education classrooms will build bridges with students whose primary music education experiences occur beyond the classroom.

Venous Hypertension and Cerebral Aneurysm Rupture

To investigate the correlation between the sinus asymmetry and aneurysm rupture. We retrospectively reviewed all diagnostic and therapeutic conventional angiograms of patients with cerebral aneurysms in our hospital from January 2000 to April 2008. Cases were categorized according to gender, presence or absence of aneurysm rupture, and presence or absence of symmetric dural sinuses. Exclusion criteria included patients with underlying fibromuscular dysplasia, dissecting aneurysms, pseudoaneurysms, and the presence of arteriovenous malformations or fistulas. The venous pressure was measured by MR phase contrast with standard fluid dynamics notation as Poiseuille's Law. A total of 193 cases (131 females and 62 males) were included for Chi-squared analysis, which showed significant difference (p < 0.05) between aneurysm rupture and venous asymmetry in the entire group as well as in females, but not in males. There was an association between side of rupture and side of asymmetry as well as between the size of hemorrhage. Ruptured aneurysm is more frequent at the same side of dominant dural sinus than the side of hypoplasia venous sinus. MRA phase contrast is able to show the venous pressure gradient of asymmetrical dural sinuses. With our preliminary data, we propose that dural sinus asymmetry is associated with aneurysm rupture.

Structural and electronic characterization of (2,33) bar-shaped stacking fault in 4H-SiC epitaxial layers

Crystallographic, electronic, and energetic analyses of the (2,33) [or (2,3,3,3) in the standard Zhadanov notation] bar-shaped stacking fault, observed in as-grown 4H-SiC epitaxial layers, are presented. The defect has been identified by means of spatially resolved microphotoluminescence (μ-PL) measurements at different emission wavelengths, focusing on the emission peak at 0.3 eV below the conduction band. Low temperature μ-PL measurements have also been performed. The defect has been identified and characterized using high resolution transmission electron microscopy. Experimental results are correlated and validated by the calculations of the Kohn–Sham electronic band structure and the defect formation energy.

Unified Modeling Language based Analysis of Security Attacks in Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSNs) are rapidly emerging because of their potential applications available in military and civilian environments. Due to unattended and hostile deployment environments, shared wireless links, and inherent resource constraints, providing high level security services is challenging in WSNs. In this paper, we revisit various security attack models and analyze them by using a well-known standard notation, Unified Modeling Language (UML). We provide a set of UML collaboration diagram and sequence diagrams of attack models witnessed in different network layers: physical, data/link, network, and transport. The proposed UML-based analysis not only can facilitate understanding of attack strategies, but can also provide a deep insight into designing/developing countermeasures in WSNs.

Reconstituting typeset Marriage Registers using simple software tools

In a world of fully integrated software applications, which can seem daunting to develop and to maintain, it is sometimes useful to recall that a system of loosely-linked software components can provide surprisingly powerful and flexible methods for software development.This paper describes a project which aims to re-typeset a series of volumes from the Phillimore Marriage Registers, first published in England around the turn of the last century. The source material is plain text derived from running Optical Character Recognition (OCR) on a set of page scans taken from the original printed volumes. The regular, tabular, structure of the Register pages allows us to automate the re-typesetting process.The UNIX troff software and its tbl preprocessor are used for the typesetting itself, but a series of simple awk-based software tools, all of them parsers and code generators of one sort or another, is used to bring about the OCR-to-troff transformation.By re-parsing the generated troff codes it is possible to produce a surname index as a supplement to the re-typeset volume. Moreover, this second-stage parsing has been invaluable in discovering subtle ‘typos’ in the automatically generated material. With small adjustments to this parser it would be possible to output the complete marriage entries in standard XML or GEDCOM notations.

Conditional symmetries for systems of PDEs: new definitions and their application for reaction–diffusion systems

New definitions of Q-conditional symmetry for systems of PDEs are presented, which generalize the standard notation of non-classical (conditional) symmetry. It is shown that different types of Q-conditional symmetry of a system generate a hierarchy of conditional symmetry operators. A class of two-component nonlinear reaction–diffusion systems is examined to demonstrate the applicability of the definitions proposed and it is shown when different definitions of Q-conditional symmetry lead to the same operators.