Downloads & Free Reading Options - Results

Kin terms, the set of words that denote family members, map variably to meanings cross-linguistically. But are there common semantic cues to kin category membership? In a previous study, we measured the extent to which kin terms reliably map semantic features to wordforms cross-linguistically, finding that some semantic features are more reliable cues to category membership than others. Two individuals are most likely to share part of their form if they belong to the same generation (Generation), followed by if they are the same gender (Gender), followed by whether both individuals are in Ego's direct lineage or not (Lineality), and finally whether they are connected to Ego via a male or female relative (Gender of Connecting Relative; GCR). In our upcoming experiment, we will test whether people's intuitions about which pairs of kin are more similar follow the same hierarchical patterning that we observed in the cross-linguistic data: Generation > Gender > Lineality > GCR. Following the cross-linguistic pattern, we expect that participants will prefer to co-lexify kin who share features further up the hierarchy, preferring higher-ranked features as a cue to shared category membership. Participants will be shown an artificial kin term for a single individual in a family tree, e.g. 'dax' for mother's sister. We will then show them two more individuals in the tree, and ask them to choose which of two labels they would prefer to assign to these kin. They can choose to label one as 'dax', indicating that this new individual belongs in the same category as the first individual, or to label them as 'fep', putting them in a new category. Crucially, the two target individuals differ from the first individual along a pair of feature dimensions. So, after seeing the label for mother's sister, participants could be asked to label mother's brother, who shares Generation but differs on Gender, and mother's sister's daughter, who shares Gender but differs on Generation. Each participant will have to choose labels for kin who exemplify all possible combinations of our four features: Generation vs Gender, Generation vs Lineality, Generation vs GCR, Gender vs Lineality, Gender vs GCR, and Lineality vs GCR. We expect that participants will more often use the 'dax' label for the target individual who shares a higher-ranked feature with the first individual: in the example above, they will co-lexify mother's sister with mother's brother. In doing so, they would indicate that they perceive two individuals who share a higher ranked feature to be more similar to one another than to an individual who shares a lower ranked feature. In turn, this would suggest that the hierarchy of features we perceive in the cross-linguistic data stems from an underlying bias about what semantic features form a better basis for a kinship category. In other words, we expect that the higher ranked features are more robust indicators of category membership because people are predisposed to perceive kin relations who share that feature as being more similar.

In my talk I will report on the work in progress. The initial idea of the project was to test available compilers of C-like languages. Our plan is the following: Choose a reasonable subset of the language to be tested. Formalize the semantics of the sub-language in AsmL. Produce tons of different programs. Using the AsmL Test tool, build test sequences for all these programs to check the correctness of the executable binary produced by the compiler. We started with a very simple fragment of the language (if, while, break, goto, simple function call). The next reasonable step is to add exceptions handling, arithmetical expressions, classes. (Joint work with Andrey Novikov.) ©2004 Microsoft Corporation. All rights reserved.

https://www.youtube.com/watch?v=Fq8VdeK9cfs

We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor—a language with shared memory, spawnable threads, and first-class locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and data-flow constructs. We present a Concurrent Separation Logic with first-class locks and threads, and prove its soundness with respect to the operational semantics. Using our modularity principle, we proved the sequential C.S.L. rules (those inherited from sequential Separation Logic) simply by adapting Appel & Blazy’s machine-checked soundness proofs. Our Concurrent C minor operational semantics is designed to connect to Leroy’s optimizing (sequential) C minor compiler; we propose our modular semantics as a way to adapt Leroy’s compiler-correctness proofs to the concurrent setting. Thus we will obtain end-to-end proofs: the properties you prove in Concurrent Separation Logic will be true of the program that actually executes on the machine. ©2008 Microsoft Corporation. All rights reserved.

In my talk I will report on the work in progress. The initial idea of the project was to test available compilers of C-like languages. Our plan is the following: Choose a reasonable subset of the language to be tested. Formalize the semantics of the sub-language in AsmL. Produce tons of different programs. Using the AsmL Test tool, build test sequences for all these programs to check the correctness of the executable binary produced by the compiler. We started with a very simple fragment of the language (if, while, break, goto, simple function call). The next reasonable step is to add exceptions handling, arithmetical expressions, classes. (Joint work with Andrey Novikov.) ©2004 Microsoft Corporation. All rights reserved.

Contextual, semantic, and statistical relationships within a scene shape our understanding of the scene and are used to optimize perceptual processing. Knowledge and expectations regarding scenes and scene elements directly informs our interpretation of the scene, and subsequent behavior in the scene (e.g. object localization, navigation). Representations of commonly encountered environments (e.g. kitchen) built over numerous encounters can promote for example efficient object localization of canonical objects (e.g. microwave). In fact, previous studies have shown that semantic features of objects and scenes guide eye movements and improve visual search (Võ, 2021). Here, we specifically manipulate the expected size of a target object relative to the scene (i.e. canonical size of a pot in a kitchen), which is known as object-scene scale consistency, and aim to quantify its role on perceptual processing. Participants will complete a gabor discrimination task for a gabor placed atop an object in the scene (shown on either the right or left side of the scene). Critically, the object will vary in size (canonical, too large) and in semantic congruency (i.e. a pot belongs in a kitchen, but is semantically incongruent if placed in a classroom). On each trial participants see a real-world indoor scene with the object embedded on a surface either on the left or right side of the scene. The gabor is placed atop this object oriented horizontally or vertically. Analyses on reaction time will reveal the role, if any, object-scene scaling and semantic congruency play in facilitating attention and scene processing. We predict that if the object is semantically and/or size (object-scene scale) incongruent, that an impediment to performance (RT) will be observed. We leverage artificial intelligence within Photoshop to manipulate object-scene scaling bidirectionally in real-world scenes and objects to test the impact of object-scene semantics and scale on responses. Based on previous neuroimaging work the transverse occipital sulcus (TOS) has shown neural selectivity to object-size relationships. Future steps include translating this behavioral paradigm into a TMS experiment to further investigate the neural mechanism behind object-scene scaling and semantics.

Contextual, semantic, and statistical relationships within a scene shape our understanding of the scene and are used to optimize perceptual processing. Knowledge and expectations regarding scenes and scene elements directly informs our interpretation of the scene, and subsequent behavior in the scene (e.g. object localization, navigation). Representations of commonly encountered environments (e.g. kitchen) built over numerous encounters can promote for example efficient object localization of canonical objects (e.g. microwave). In fact, previous studies have shown that semantic features of objects and scenes guide eye movements and improve visual search (Võ, 2021). Here, we specifically manipulate the expected size of a target object relative to the scene (i.e. canonical size of a pot in a kitchen), which is known as object-scene scale consistency, and aim to quantify its role on perceptual processing. Participants will complete a gabor discrimination task for a gabor placed atop an object in the scene (shown on either the right or left side of the scene). Critically, the object will vary in size (canonical, too large) and in semantic congruency (i.e. a pot belongs in a kitchen, but is semantically incongruent if placed in a classroom). On each trial participants see a real-world indoor scene with the object embedded on a surface either on the left or right side of the scene. The gabor is placed atop this object oriented horizontally or vertically. Analyses on reaction time will reveal the role, if any, object-scene scaling and semantic congruency play in facilitating attention and scene processing. We predict that if the object is semantically and/or size (object-scene scale) incongruent, that an impediment to performance (RT) will be observed. We leverage artificial intelligence within Photoshop to manipulate object-scene scaling bidirectionally in real-world scenes and objects to test the impact of object-scene semantics and scale on responses. Based on previous neuroimaging work the transverse occipital sulcus (TOS) has shown neural selectivity to object-size relationships. Future steps include translating this behavioral paradigm into a TMS experiment to further investigate the neural mechanism behind object-scene scaling and semantics.

Contextual, semantic, and statistical relationships within a scene shape our understanding of the scene and are used to optimize perceptual processing. Knowledge and expectations regarding scenes and scene elements directly informs our interpretation of the scene, and subsequent behavior in the scene (e.g. object localization, navigation). Representations of commonly encountered environments (e.g. kitchen) built over numerous encounters can promote for example efficient object localization of canonical objects (e.g. microwave). In fact, previous studies have shown that semantic features of objects and scenes guide eye movements and improve visual search (Võ, 2021). Here, we specifically manipulate the expected size of a target object relative to the scene (i.e. canonical size of a pot in a kitchen), which is known as object-scene scale consistency, and aim to quantify its role on perceptual processing. Participants will complete a gabor discrimination task for a gabor placed atop an object in the scene (shown on either the right or left side of the scene). Critically, the object will vary in size (canonical, too large) and in semantic congruency (i.e. a pot belongs in a kitchen, but is semantically incongruent if placed in a classroom). On each trial participants see a real-world indoor scene with the object embedded on a surface either on the left or right side of the scene. The gabor is placed atop this object oriented horizontally or vertically. Analyses on reaction time will reveal the role, if any, object-scene scaling and semantic congruency play in facilitating attention and scene processing. We predict that if the object is semantically and/or size (object-scene scale) incongruent, that an impediment to performance (RT) will be observed. We leverage artificial intelligence within Photoshop to manipulate object-scene scaling bidirectionally in real-world scenes and objects to test the impact of object-scene semantics and scale on responses. Based on previous neuroimaging work the transverse occipital sulcus (TOS) has shown neural selectivity to object-size relationships. Future steps include translating this behavioral paradigm into a TMS experiment to further investigate the neural mechanism behind object-scene scaling and semantics.

"Natural languages are programming languages for minds." Can we or should we take this slogan seriously? If so, how? Can answers be found by looking at the various "dynamic" treatments of natural language developed over the last decade or so, mostly in response to problems associated with donkey anaphora? In Dynamic Logic of Programs, the meaning of a program is a binary relation on the set of states of some abstract machine. This relation is meant to model aspects of the effects of the execution of the program, in particular its input-output behavior. What, if anything, are the dynamic aspects of various proposed dynamic semantics for natural languages supposed to model? Is there anything dynamic to be modeled? If not, what is all the full about? We shall try to answer some, at least, of these questions and provide materials for answers to others.

A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula a as the theory defined by the set of all those models of a that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates describe properties of iterated revisions.

A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula a as the theory defined by the set of all those models of a that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates describe properties of iterated revisions.

This study aims to present a mathematical linguistic analysis in establishing the relations between TRs, LMs, potential senses, and actual senses by using the case of the preposition on found in academic texts under the framework of Trajector (TR) and Landmark (LM) configurations. Data were corpora taken from 10 bachelor’s theses written by Indonesian stu-dents. To sort the data, Ant Conc 3.4.1.0 was used to parse clauses or sentences based on the TR-LM configurations.

In a number of preceding articles having appeared in this series it has been demonstrated that the AaO paradigm can be used to develop a cognitive helical structure. The present article advances the process to the forth of five phases. Of the four dependent variables emerging at this stage, two will be discussed, namely (1) zero processing and (2) variations in form. The other two will be presented in a forthcoming article. A short introduction gives some of the basics that govern the process. The discussion of the variables begins with some arguments put forward within cognitive science. In agreement with the general conviction, symbol processing results in strings of symbols or sentences on which operations such as addition, deletion and insertion can be performed according to formally defined rules. By propositional knowledge statements about the world and by truth conditions, meaning of symbolic expressions is defined. But meaning, i.e. semantics, is not bound to a linguistic context of interpretation. As comprehensive term it denotes the knowledge system underlying various approaches to natural language processing. A system's semantics represents the constructorâs world view, but also a theory of how it shall be organised to enable disambiguation of strings of symbols. As a result, the conceptual base is constructed within formally different boundaries compared to the linguistic base. Thus, the semantic principle cuts across the linguistic - non-linguistic dimension. The implication rule of a semantic approach to interpretation and the processing of a conceptual base are discussed within the context of the degree of linguistic closeness of the meta-language used.

Students who are taught to understand and apply Korzybski's uses of semantics to their writing will learn to write more concretely. As students locate words and descriptions vertically on Korzybski's scale of abstraction levels, they will become able to perceive how meanings change when descriptions become either more general or specific, to differentiate between an idea and an example of an idea, and to discern patterns of abstraction levels in paragraphs and entire books. To make their writing more specifically useful, students should be encouraged to qualify isolated words with quantitative or identifying numbers and dates and to replace "is" with an active verb. By incorporating these writing aids, students will be reminded to constantly observe, question, and experiment with meanings and to express their own ideas in modestly specific and accurate sentences. (CK)

An extrinsic relationship between generative semantics and dialect geography should be exploited because contemporary transformational grammarians have too easily ignored the work of the dialectologist and have been too readily satisfied with what might be called armchair evidence. The work of the dialect geographers needs to be taken into account. The "Linguistic Atlas of New England" cites several examples of varying constructions which have the same meaning, e.g., 23 synonymous expressions for, "He died." Another type of problematic structure unearthed by dialect geographers is that in which a single surface representation has two possible semantic interpretations, such as, "He takes after his father." There are also many cases of synonymity or partial synonymity that dialect geographers have discovered, such as the way informants distinguish "stone" from "rock." In some instances, evidence shows informants not distinguishing words in meaning but in use as in the difference between "sunset" and "sundown." The differing linguistic phenomena described by dialectologists will have to be considered by generative semanticists in their analysis of English. (HOD)

Social semiotics suggests that social and cultural formations, including the language and practice of science and the ways in which new generations and communities advance them, develop as an integral part of the evolution of social ecosystems. Some recent models of complex dynamic systems in physics, chemistry, and biology focus more on the process of a system (individual development, species evolution, ecological succession) than on the product. Ecological succession can be seen as an alternative to development as a basis for models of social learning in science. While a developmental model assumes that development occurs the same way each time, ignoring individuation, a successional model looks at how complexes of interdependent species (whole animal and plant communities) develop over time in interaction with each other and with the physical environment. Successional models have a mosaic character, with subgroups in the ecosystem following the same processes at somewhat different rates. A new idea entering this ecosystem may flourish or not, depending on the conditions and processes within the ecosystem, and may change the environment for future ideas. While traditional models of science education emphasize mastery of a curriculum, the successional model promotes true intellectual development as a dynamic, evolutionary process. Contains 46 references. (MSE)

This is a depth-first ordered VHDL syntax summary with annotated semantics and corresponding paragraph numbers to VHDL and Ada Reference Manuals. The BNF representation of VHDL is cross-referenced to comparable VHDL and Ada syntax and semantic descriptions within the VHDL and Ada language reference manuals (LRM). This product resulted from the first step of developing a VHDL to Ada interface. This ordering of the BNF representation of VHDL should help reduce the time for new VHDL implementors and programmers to overcome the robustness of the VHDL syntax and semantics. It could serve as an implementor's guide for developing VHDL software tools and help VHDL programmers remember the details of the VHDL syntax and semantics without having to thumb through the scattered bits and pieces of syntax scattered in the syntax summary of the reference manual. This VHDL Summary could also help insure validation test coverage by aiding the validation test writer to keep track of each detail incorporated in the VHDL language. The annotated semantics consist of brief descriptions to serve as reminders.

With the acceptance of Unmanned Aerial Vehicles (UAVs) as a primary platform within the Department of Defense (DOD) for gathering intelligence data, the amount of video information being recorded, analyzed, and archived continues to grow. Mechanisms for quickly locating and retrieving video segments of interest amongst the many hours of recorded video are required to accommodate the rapid turnaround expected in today's wartime planning environments. This research demonstrates that text-based data accompanying UAV video yields sufficient information to identify and create data items that can be indexed to provide for rapid identification and retrieval of video segments of interest. Four attributes are derived or calculated from mission-related telemetry and target data: look-direction, look-distance, zoom, and solar illumination direction. These attributes provide indicators of potential scene content and image quality thus allowing analysts to select the best (clearest, most detailed) images of a target or target area. A relational database and two tools, a query and profile tool, are implemented to store the data and provide for the retrieval and presentation of video segments to the user. An analysis of the results shows the methodology to be favorable for locating and retrieving video segments of interest. Several recommendations to enhance the methodology are provided at the conclusion of the paper.

Syntactic constraints and expectations are based on the patterns formed by a given set of linguistic objects, e.g. nouns, verbs, adjectives, etc. Pragmatic ones arise from notions of conversational structure and the types of linguistic behavior appropriate to a given situation. The bases for semantic constraints and expectations are an a priori sense of what can be meaningful and the ways in which meaningful concepts can be realized in actual language. The paper describes how semantics is being used in several recent speech understanding systems. It then expands the generalities of the first section with a detailed discussion of some actual problems that have arisen in the attempt to understand speech.

Mathematical semantics is introduced as the study of mappings between configuration spaces and image algebras. An image algebra is synthesized using generators that are relations. This will serve as the semantic counterpart of a formal language. The image algebra is analyzed in terms of its similarity group, bond relations and connection type. The semantic map is studied in terms of the morphisms of a category, the term used in its algebraic sense. We present strategies for constructing semantic maps with special properties related to memory requirements. Some examples are given, showing how the semantic categories can be constructed. (Author)

A primary question in child language acquisition research is how children learn to express “who does what to whom” in the language they learn. In order to describe an action or event, an adult speaker uses a transitive sentence structure such as “The man broke the vase”, which encompasses two arguments, i.e. agent (man) and the patient (vase). How do children learn which is the agent or patient of an action or event? In fixed word order languages such as English, the word order helps the speaker determine the agent and the patient of the transitive clause, i.e. the agent is always mentioned first followed by the patient. However, in free word order languages such as Hindi, case-markings on the agent and patient, and not (just) word order, help denote their syntactic-semantic role in the sentence. A child must know the three semantic-syntactic relationships, as discussed by Dixon (1979), in order to correctly use case markings and produce transitive sentences. The semantic agent (A) and patient (O) are the grammatical subject and object of a transitive verb (e.g. break, wash), respectively. The actor of an intransitive verb (e.g., laugh, sleep), denoted by S, is the sole argument of this verb. Languages such as English and Russian referred to as nominative-accusative languages, case-mark the patient of a transitive verb (O) differently than the agent of a transitive (A) or intransitive (S) verb. A and S are marked with the nominative case and O with an accusative case. On the contrary, in languages such as Hindi and Basque referred to as ergative-absolutive languages, the agent (A) of the transitive verb is marked differently than the patient (O) of the transitive verb and the argument (S) of the intransitive verb. The agent of the transitive verb receives an ergative case and the patient of the transitive and sole argument of the intransitive clause are marked with the absolutive or accusative case (Dixon, 1994). Thus, a child learning an ergative-absolutive language should have the knowledge that the subjects of the transitive and intransitive verbs are treated differently; else, they can overextend the use of the ergative marker to subjects of intransitive verbs and thereby, produce overgeneralisation errors. Hindi, an Indo-Aryan language, is primarily spoken in the Northern and Central parts of India. According to the 2011 Census of India figures, 43.63% of the Indian population comprise of Hindi native speakers; thus, providing the motivation to study this language in greater detail. Hindi displays split morphological ergativity, with the split occurring in tense-aspect. The agent of a transitive clause is marked with a clitic marker -ne only in the perfective aspect (see example 1a), and the zero or null marker (example 1b) is used in other aspects. 1a. Ravi=ne khaanaa khaa-yaa. ‘Ravi=ERG food-NOM eat-PFV.SG.M’ ‘Ravi ate food.’ 1b. Ravi khaanaa khaa-taa hae. ‘Ravi-NOM food-NOM eat-IPFV.SG.M. be.PRS.3SG.’ ‘Ravi eats food.’ The linguistics literature suggests the role of transitivity in determining the use of ergative marker (Hopper & Thompson, 1980; Tsunoda, 1981). It is claimed that agents of transitive clauses receive ergative marking but not that of intransitive clauses. However, Mohanan (1994) and Piepers (2016) refute this claim and discuss a verb-split across transitive verbs in the use of ergative marking. Transitive verbs such as chakhnaa (to taste) are obligatorily marked with ergative clitic -ne, verbs such as laanaa (to buy) are null marked, and verbs such as sunghnaa alternate between -ne and null marking. These by-verb differences and optional use of -ne marking is particularly an area of interest to child language researchers. As discussed earlier, similar overgeneralisation errors across transitive verbs could be expected in a child’s production. How do Hindi speaking children learn these finer distinctions across verbs and effectively produce the ergative marker in some situations and not in all? Based on the transitivity hypothesis discussed by Hopper & Thompson (1980), it is possible that the semantics of the action or event (verb) might contribute to the acquisition of the correct usage of the ergative marker across transitive verbs. Further, drawing from the findings of acquisition data on ergative marking across languages (Pye, 1990) and of other morphosyntactic structures in Hindi (Ambridge et al., 2020), it can be suggested that the distributional properties of the language such as how frequently the child hears the form in the input might have a role to play. Narasimhan (2005) conducted a longitudinal study on three native Hindi speaking children aged between 1;7- 3;9 in order to examine the effects of semantics and distributional properties on the acquisition of language. None of the kids produced overgeneralisation errors in ungrammatical contexts and appeared to be productive, thus suggesting a role of distributional properties of the language in the acquisition of the ergative marker. Till date this is the only study that has examined the acquisition of ergative marking in Hindi speaking children and no systematic experimental research have investigated the effects of semantics and input frequency on the acquisition of ergative case marker across transitive verb. The current projects aims to examine these factors using an elicited production task in children aged four to six years.

We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture). We define a metalanguage (an idealised version of Anglican) for probabilistic computation with the above features, develop both operational and denotational semantics, and prove soundness, adequacy, and termination. They involve measure theory, stochastic labelled transition systems, and functor categories, but admit intuitive computational readings, one of which views sampled random variables as dynamically allocated read-only variables. We apply our semantics to validate nontrivial equations underlying the correctness of certain compiler optimisations and inference algorithms such as sequential Monte Carlo simulation. The language enables defining probability distributions on higher-order functions, and we study their properties.

Model-based design encourages architects to use customized architectural languages that precisely target their problem domains. These languages, coined domain-specific modeling languages (DSMLs), are essential components of model-driven architecture (MDA), platform-based design, and model-integrated computing (MIC). As a result, tools and methods for DSMLs have blossomed: Key research includes the heterogeneous composition of DSMLs, model transformations between DSMLs, approximations of formal properties within DSMLs, and reuse of DSML semantics. Despite this success, some key foundational issues concerning DSMLs have not been addressed. My presentation will address one of these issues; the structural semantics of DSMLs. The structural semantics of some DSML describes the set of structurally well-formed models that belong to that language. I will describe a formalization of structural semantics that takes into account current metamodeling techniques, provides a formal understanding of metacircularity, and allows us to algorithmically decide if two metamodels are equivalent. I will also describe how this theory has been used to provide a formal underpinning for existing metaprogrammable tools, providing proof-theoretic methods for evaluating DSML properties. ©2007 Microsoft Corporation. All rights reserved.

This item represents a case in PACER, the U.S. Government's website for federal case data. If you wish to see the entire case, please consult PACER directly.

This item represents a case in PACER, the U.S. Government's website for federal case data. If you wish to see the entire case, please consult PACER directly.

This item represents a case in PACER, the U.S. Government's website for federal case data. If you wish to see the entire case, please consult PACER directly.

This article is from Frontiers in Psychology , volume 4 . Abstract It was the aim of this study to investigate the impact of major depressive disorder (MDD) on judgment of emotions expressed at the verbal (semantic content) and non-verbal (prosody) level and to assess whether evaluation of verbal content correlate with self-ratings of depression-related symptoms as assessed by Beck Depression Inventory (BDI). We presented positive, neutral, and negative words spoken in happy, neutral, and angry prosody to 23 MDD patients and 22 healthy controls (HC) matched for age, sex, and education. Participants rated the valence of semantic content or prosody on a 9-point scale. MDD patients attributed significantly less intense ratings to positive words and happy prosody than HC. For judgment of words, this difference correlated significantly with BDI scores. No such correlation was found for prosody perception. MDD patients exhibited attenuated processing of positive information which generalized across verbal and non-verbal channels. These findings indicate that MDD is characterized by impairments of positive rather than negative emotional processing, a finding which could influence future psychotherapeutic strategies as well as provide straightforward hypotheses for neuroimaging studies investigating the neurobiological correlates of impaired emotional perception in MDD.

https://www.youtube.com/watch?v=c_8hDwN5Sg0 https://www.youtube.com/watch?v=A73sx8p3PKU

A short prayer and message to #OccupyOakland and all #OWS inspired occupations from a NYC Liberty Plaza Occupier.cc

Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone while mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified type system to provide type-safe integration of semantic data. This is achieved by the integration of description logics into the $\lambda$-calculus for typing and data access. It is centered around several key design principles. Among these are (1) the usage of semantic conceptualizations as types, (2) subtype inference for these types, and (3) type-checked query access to the data by both ensuring the satisfiability of queries as well as typing query results precisely in $\lambda_{DL}$. The paper motivates the use of a modified type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal specifications of $\lambda_{DL}$ including a proof of type safety.

Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone while mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified type system to provide type-safe integration of semantic data. This is achieved by the integration of description logics into the $\lambda$-calculus for typing and data access. It is centered around several key design principles. Among these are (1) the usage of semantic conceptualizations as types, (2) subtype inference for these types, and (3) type-checked query access to the data by both ensuring the satisfiability of queries as well as typing query results precisely in $\lambda_{DL}$. The paper motivates the use of a modified type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal specifications of $\lambda_{DL}$ including a proof of type safety.

Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone while mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified type system to provide type-safe integration of semantic data. This is achieved by the integration of description logics into the $\lambda$-calculus for typing and data access. It is centered around several key design principles. Among these are (1) the usage of semantic conceptualizations as types, (2) subtype inference for these types, and (3) type-checked query access to the data by both ensuring the satisfiability of queries as well as typing query results precisely in $\lambda_{DL}$. The paper motivates the use of a modified type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal specifications of $\lambda_{DL}$ including a proof of type safety.

Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone while mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified type system to provide type-safe integration of semantic data. This is achieved by the integration of description logics into the $\lambda$-calculus for typing and data access. It is centered around several key design principles. Among these are (1) the usage of semantic conceptualizations as types, (2) subtype inference for these types, and (3) type-checked query access to the data by both ensuring the satisfiability of queries as well as typing query results precisely in $\lambda_{DL}$. The paper motivates the use of a modified type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal specifications of $\lambda_{DL}$ including a proof of type safety.

Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone while mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified type system to provide type-safe integration of semantic data. This is achieved by the integration of description logics into the $\lambda$-calculus for typing and data access. It is centered around several key design principles. Among these are (1) the usage of semantic conceptualizations as types, (2) subtype inference for these types, and (3) type-checked query access to the data by both ensuring the satisfiability of queries as well as typing query results precisely in $\lambda_{DL}$. The paper motivates the use of a modified type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal specifications of $\lambda_{DL}$ including a proof of type safety.

The project focuses on response particles ano ‘yes’ and ne ‘no’ in Czech. The starting point of the work is the study of Claus et. al., which tests hypotheses of feature model (F. Roelofsen & D. Farkas) and salliency account (M. Krifka). Every material is in czech.

The project focuses on response particles ano ‘yes’ and ne ‘no’ in Czech. The starting point of the work is the study of Claus et. al., which tests hypotheses of feature model (F. Roelofsen & D. Farkas) and salliency account (M. Krifka). Every material is in czech.

This talk is part of the D Programming Language Conference, May 1-3 2013, Menlo Park, CA. Slides available here and also embedded within this page. For more information click here .

This talk is part of the D Programming Language Conference, May 1-3 2013, Menlo Park, CA. Slides available here and also embedded within this page. For more information click here .

Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based standards to formalize the specification of Web services. In this paper, we propose the issue of web service discovery given non-explicit semantic-based service request. Our approach of semantic-based web service discovery involves semantic-based service categorization and semantic enhancement of the composition of service requests. And the functional level service categorization is based on ontology framework. Also uses clustering, to classify the web services accurately based on the service functionality. The semantic-based categorization is done offline at UDDI. The semantic enhancement process includes better matching with relevant services. Additional terms related to service requests are retrieved from the ontology. Service matching between requested service and the retrieved service description is done through Latent Semantic Indexing (LSI) method. Our experimental results validate the effectiveness and feasibility of the proposed scenario.

Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based standards to formalize the specification of Web services. In this paper, we propose the issue of web service discovery given non-explicit semantic-based service request. Our approach of semantic-based web service discovery involves semantic-based service categorization and semantic enhancement of the composition of service requests. And the functional level service categorization is based on ontology framework. Also uses clustering, to classify the web services accurately based on the service functionality. The semantic-based categorization is done offline at UDDI. The semantic enhancement process includes better matching with relevant services. Additional terms related to service requests are retrieved from the ontology. Service matching between requested service and the retrieved service description is done through Latent Semantic Indexing (LSI) method. Our experimental results validate the effectiveness and feasibility of the proposed scenario.

Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based standards to formalize the specification of Web services. In this paper, we propose the issue of web service discovery given non-explicit semantic-based service request. Our approach of semantic-based web service discovery involves semantic-based service categorization and semantic enhancement of the composition of service requests. And the functional level service categorization is based on ontology framework. Also uses clustering, to classify the web services accurately based on the service functionality. The semantic-based categorization is done offline at UDDI. The semantic enhancement process includes better matching with relevant services. Additional terms related to service requests are retrieved from the ontology. Service matching between requested service and the retrieved service description is done through Latent Semantic Indexing (LSI) method. Our experimental results validate the effectiveness and feasibility of the proposed scenario.

Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based standards to formalize the specification of Web services. In this paper, we propose the issue of web service discovery given non-explicit semantic-based service request. Our approach of semantic-based web service discovery involves semantic-based service categorization and semantic enhancement of the composition of service requests. And the functional level service categorization is based on ontology framework. Also uses clustering, to classify the web services accurately based on the service functionality. The semantic-based categorization is done offline at UDDI. The semantic enhancement process includes better matching with relevant services. Additional terms related to service requests are retrieved from the ontology. Service matching between requested service and the retrieved service description is done through Latent Semantic Indexing (LSI) method. Our experimental results validate the effectiveness and feasibility of the proposed scenario.

In this thesis we address the problem of how to give acceptable formal semantics for concurrent programming languages, that is, how to give a precise mathematical formulation of what programs in various such languages mean. We take a broad view of what constitutes a programining language - for example, notations that describe digital circuits or Petri nets we consider programming languages, as well as notations that describe systems of concurrent processes interacting via shared variables or message-passing. It is important that we have a formal semantics for any programming language we use, for the following reasons: 1. It is needed in order to precisely define the language. 2. It is needed to provide some basis for deciding the correctness of implementations of the language. 3. IL is iieeded to provide a foundation for methods of analyzing and reasoning about the behavior of programs in the language. In this thesis we shall not concern ourselves with 2. and 3. above, but shall concentrate on the prob lem of specifying the semantics of concurrent programming languages and showing the semantics to be acceptable' in some sense.

In this thesis we address the problem of how to give acceptable formal semantics for concurrent programming languages, that is, how to give a precise mathematical formulation of what programs in various such languages mean. We take a broad view of what constitutes a programining language - for example, notations that describe digital circuits or Petri nets we consider programming languages, as well as notations that describe systems of concurrent processes interacting via shared variables or message-passing. It is important that we have a formal semantics for any programming language we use, for the following reasons: 1. It is needed in order to precisely define the language. 2. It is needed to provide some basis for deciding the correctness of implementations of the language. 3. IL is iieeded to provide a foundation for methods of analyzing and reasoning about the behavior of programs in the language. In this thesis we shall not concern ourselves with 2. and 3. above, but shall concentrate on the prob lem of specifying the semantics of concurrent programming languages and showing the semantics to be acceptable' in some sense.

This paper presents a rigorous framework to discuss the synchronization necessary to coordinate accesses to a resource. The framework, among other things, provides a method for specifying concurrency and forms the semantic basis of a synchronization mechanism which avoids certain unfortunate characteristics of monitors and serializers. Synchronization is viewed as being managed by a resource guardian. A synchronization problem is defined as a predicate on event sequences. The interaction of a guardian and the rest of the system is formalized in terms of a two person game. This formalization results in precise definitions of guardian and guardian behavior. The notion of a 'good' or optimal solution is defined, and the solutions to certain classes of synchronization problems are characterized. An abstract description of the general actions of a guardian is given. This general description, with some restrictions, forms the basis of a simple synchronization mechanism for actually implementing solutions. The mechanism is given a rigorous semantics based on the definition of guardian. This facilitates the verification of correctness. Many examples of the use of the mechanism are given and its advantages are discussed. (Author)

Partial contents: Grammar; Syntax/Semantics Interaction; Semantics; Demo Environment; Change in Key Personnel; Darpa Meetings.

The main objective in this semantics unit is to sharpen the students' powers of critical thinking while increasing their sensitivity to the language. The course of study for grade 7 contains four lessons: referent and symbol, levels of abstraction, argument, and fact and opinion. The grade 8 course of study features the following lessons: similes and metaphors, hyperbole and personification, euphemism, and advertising analysis. The ninth grade course focuses on various types of propaganda from the glittering generality to the bandwagon approach. Each lesson presents objectives, lists materials needed, and describes procedures. (LL)

It has long been said that there are an infinite number of English sentences. "This is the cat that caught the rat" is an Enqlish sentence. So is "This is the cat that caught the rat that stole the cheese.""This is the cat with white paws that caught the rat that stole the cheese" is unobjectionable as well. Since a clear cutoff point cannot be specified, it is tempting to resort to the three dots. This study proposes that the argument from the lack of a clear cutoff point to infinity is a bad argument; the set of English sentences may be a fuzzy set rather than a standard set. Furthermore, it is argued that the initial question suppresses several quite distinct questions. A theory constructed to account for formal relations between sentences might warrant the positing of infinite semantic structures. A theory constructed to account for human understanding probably would not. The common claim that infinity is necessary if there are to be novel and creative uses of language is found to be entirely without substance. (Author/AMH)

This paper argues that the Korean particles "-to" and "-na" can be analyzed as having one core meaning with their own accompanying meanings due to illocutionary forces or to people's world-knowledge on orderings among the elements of alternative sets. It also maintains that both the incompatibility of "amwu" ('any') plus "-to" and the concurrence of "amwu" plus "-na" with upward entailing property predicates are due to informativity and some other pragmatic felicity conditions. The quantificational forces of polarity items are then examined. Finally, since negative polarity items are accompanied by strong stress, arguably related to focus, it is possible to show how focus participates in the compositional derivations and contributes to the entire meaning of the sentence in which it occurs. Contains 28 references. (MDM)

This paper explains a method of semantic analysis developed in the course of a natural-language research project that led to the computer implementation of the Multistore Parser. Positing an interlinguistic substratum of semantic particles of several different types (e.g. substantive, attributive, developmental, relational), a method is illustrated which makes it possible to map the meaning of activity words in context; the resulting mappings, on the one hand, incorporate much of what, hitherto, has been considered "pragmatics," and on the other, they furnish an exact definition of the semantic "deep structure" underlying the grammatical surface structure of a phrase or sentence. The mappings are here used to demonstrate semantic similarities and discrepancies between an English verb and the German verbs which are required for its translation in various contexts. (Author/FWB)