Petri Nets and Semantics of System Descriptions
DEFF Research Database (Denmark)
Jensen, Kurt; Kyng, Morten
1982-01-01
This paper discusses the use of Petri nets as a semantic tool in the design of languages and in the construction and analysis of system descriptions. The topics treated are: Languages based on nets. The problem of time in nets. Nets and related models. Nets and formal semantics. Parallel program...
Petri nets semantics ofπ-calculus
Institute of Scientific and Technical Information of China (English)
Zhenhua YU; Yuanli CAI; Haiping XU
2008-01-01
As π-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools,it is translated into Petri nets.π-calculus is divided into basic elements,sequence,concurrency,choice and recursive modules.These modules are translated into Petri nets to construct a complicated system.Petri nets semantics for π-calculus visualize system structure as well as system behaviors.The structural analysis techniques allow direct qualitative analysis of the system properties on the structure of the nets.Finally,Petri nets semantics for π-calculus are illustrated by applying them to mobile telephone systems.
Delta Semantics Defined By Petri Nets
DEFF Research Database (Denmark)
Jensen, Kurt; Kyng, Morten; Madsen, Ole Lehrmann
This report is identical to an earlier version of May 1978 except that Chapter 5 has been revised. A new paper: "A Petri Net Definition of a System Description Language", DAIMI, April 1979, 20 pages, extends the Petri net model to include a data state representing the program variables. Delta...... and the possibility of using predicates to specify state changes. In this paper a formal semantics for Delta is defined and analysed using Petri nets. Petri nets was chosen because the ideas behind Petri nets and Delta concide on several points. A number of proposals for changes in Delta, which resulted from...
Modeling argumentation based semantics using non-monotonic reasoning
2005-01-01
Argumentation theory is an alternative style of formalizing non-monotonic reasoning. It seems, argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments support conclusions. Dung's approach is an unifying framework which has played an influential role on argumentation research and Artificial Intelligence. Even though the success of the argumentation theory, it seems that argumentation theory is so far from being efficiently implemented like the logic ...
An ECNO semantics for Petri nets
DEFF Research Database (Denmark)
Kindler, Ekkart
2012-01-01
The Event Coordination Notation (ECNO) allows modelling the behaviour of software on top of structural software models - and to generate program code from these models fully automatically. ECNO distinguishes between the local behaviour of elements (objects) and the global behaviour, which denes t...... work. In this paper, we will show that the ECNO, in turn, can be used for modelling the behaviour of Petri nets in a simple and concise way. What is more, we will show that the ECNO semantics of Place/Transition Systems can easily be extended to so-called signal-event nets....
Semantic relations among nouns in Polish WordNet grounded in lexicographic and semantic tradition
Directory of Open Access Journals (Sweden)
Marek Maziarz
2015-11-01
Full Text Available Semantic relations among nouns in Polish WordNet grounded in lexicographic and semantic tradition The paper describes a system of lexico-semantic relations proposed for the nominal part of plWordNet 2.0 – the largest Polish wordnet. We briefly introduce a wordnet as a large electronic thesaurus. We discuss sixteen nominal relations together with many sub-types proposed for plWordNet 2.0. Each relation is based on linguistic intuition and supported by a set of tests which facilitate its identification. There are two main groups: pure lexico-semantic relations and semantic-derivational relations.
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Di Noia, T; Donini, F M; 10.1613/jair.2153
2011-01-01
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmaking process is to discover best available offers to a given request. We address the problem of matchmaking from a knowledge representation perspective, with a formalization based on Description Logics. We devise Concept Abduction and Concept Contraction as non-monotonic inferences in Description Logics suitable for modeling matchmaking in a logical framework, and prove some related complexity results. We also present reasonable algorithms for semantic matchmaking based on the devised inferences, and prove that they obey to some commonsense properties. Finally, we report on the implementation of the proposed matchmaking framework, which has been used both as a mediator in e-marketplaces and for semantic web services discovery.
Words semantic orientation classification based on HowNet
Institute of Scientific and Technical Information of China (English)
LI Dun; MA Yong-tao; GUO Jian-li
2009-01-01
Based on the text orientation classification, a new measurement approach to semantic orientation of words was proposed. According to the integrated and detailed definition of words in HowNet, seed sets including the words with intense orientations were built up. The orientation similarity between the seed words and the given word was then calculated using the sentiment weight priority to recognize the semantic orientation of common words. Finally, the words' semantic orientation and the context were combined to recognize the given words' orientation. The experiments show that the measurement approach achieves better results for common words' orientation classification and contributes particularly to the text orientation classification of large granularities.
The Formal Semantics of Core ABS and ABS-NET
Palmskog, Karl
2013-01-01
ABS is a language and framework for modelling distributed object-oriented systems, developed in the EU FP7 HATS project. Core ABS formalizes the key parts of ABS, including the syntax, type system, and an operational semantics in the style of rewriting logic. ABS-NET is a novel operational semantics for Core ABS programs, developed as a part of work on decentralized runtime adaptation of distributed objects. ABS-NET describes program execution on top of a network of nodes connected point-to-p...
Text Summarization Using FrameNet-Based Semantic Graph Model
Directory of Open Access Journals (Sweden)
Xu Han
2016-01-01
Full Text Available Text summarization is to generate a condensed version of the original document. The major issues for text summarization are eliminating redundant information, identifying important difference among documents, and recovering the informative content. This paper proposes a Semantic Graph Model which exploits the semantic information of sentence using FSGM. FSGM treats sentences as vertexes while the semantic relationship as the edges. It uses FrameNet and word embedding to calculate the similarity of sentences. This method assigns weight to both sentence nodes and edges. After all, it proposes an improved method to rank these sentences, considering both internal and external information. The experimental results show that the applicability of the model to summarize text is feasible and effective.
Maximality-Based Structural Operational Semantics for Petri Nets
Saīdouni, Djamel Eddine; Belala, Nabil; Bouneb, Messaouda
2009-03-01
The goal of this work is to exploit an implementable model, namely the maximality-based labeled transition system, which permits to express true-concurrency in a natural way without splitting actions on their start and end events. One can do this by giving a maximality-based structural operational semantics for the model of Place/Transition Petri nets in terms of maximality-based labeled transition systems structures.
Comparison Latent Semantic and WordNet Approach for Semantic Similarity Calculation
Wicaksana, I Wayan Simri
2011-01-01
Information exchange among many sources in Internet is more autonomous, dynamic and free. The situation drive difference view of concepts among sources. For example, word 'bank' has meaning as economic institution for economy domain, but for ecology domain it will be defined as slope of river or lake. In this aper, we will evaluate latent semantic and WordNet approach to calculate semantic similarity. The evaluation will be run for some concepts from different domain with reference by expert or human. Result of the evaluation can provide a contribution for mapping of concept, query rewriting, interoperability, etc.
Representation of a Sentence using a Polar Fuzzy Neutrosophic Semantic Net
Directory of Open Access Journals (Sweden)
Sachin Lakra
2014-01-01
Full Text Available A semantic net can be used to represent a sentence. A sentence in a language contains semantics which are polar in nature, that is, semantics which are positive, neutral and negative. Neutrosophy is a relatively new field of science which can be used to mathematically represent triads of concepts. These triads include truth, indeterminacy and falsehood, and so also positivity, neutrality and negativity. Thus a conventional semantic net has been extended in this paper using neutrosophy into a Polar Fuzzy Neutrosophic Semantic Net. A Polar Fuzzy Neutrosophic Semantic Net has been implemented in MATLAB and has been used to illustrate a polar sentence in English language. The paper demonstrates a method for the representation of polarity in a computer’s memory. Thus, polar concepts can be applied to imbibe a machine such as a robot, with emotions, making machine emotion representation possible.
Towards a Unified Recurrent Neural Network Theory:The Uniformly Pseudo-Projection-Anti-Monotone Net
Institute of Scientific and Technical Information of China (English)
Zong Ben XU; Chen QIAO
2011-01-01
In the past decades, various neural network models have been developed for modeling the behavior of human brain or performing problem-solving through simulating the behavior of human brain. The recurrent neural networks are the type of neural networks to model or simulate associative memory behavior of human being. A recurrent neural network (RNN) can be generally formalized as a dynamic system associated with two fundamental operators: one is the nonlinear activation operator deduced from the input-output properties of the involved neurons, and the other is the synaptic connections (a matrix) among the neurons. Through carefully examining properties of various activation functions used, we introduce a novel type of monotone operators, the uniformly pseudo-projectionanti-monotone (UPPAM) operators, to unify the various RNN models appeared in the literature. We develop a unified encoding and stability theory for the UPPAM network model when the time is discrete.The established model and theory not only unify but also jointly generalize the most known results of RNNs. The approach has lunched a visible step towards establishment of a unified mathematical theory of recurrent neural networks.
Semantic relations between verbs in Polish WordNet 2.0
Directory of Open Access Journals (Sweden)
Marek Maziarz
2015-11-01
Full Text Available Semantic relations between verbs in Polish WordNet 2.0 The noun dominates wordnets. The lexical semantics of verbs is usually under-represented, even if it is essential in any semantic analysis which goes beyond statistical methods. We present our attempt to remedy the imbalance; it begins by designing a sufficiently rich set of wordnet relations for verbs. We discuss and show in detail such a relation set in the largest Polish wordnet. Our design decisions, while as general and language-independent as possible, are mainly informed by our desire to capture the nature and peculiarities of the verb system in Polish.
WordNet-based lexical semantic classification for text corpus analysis
Institute of Scientific and Technical Information of China (English)
LONG Jun; WANG Lu-da; LI Zu-de; ZHANG Zu-ping; YANG Liu
2015-01-01
Many text classifications depend on statistical term measures to implement document representation. Such document representations ignore the lexical semantic contents of terms and the distilled mutual information, leading to text classification errors. This work proposed a document representation method, WordNet-based lexical semantic VSM, to solve the problem. Using WordNet, this method constructed a data structure of semantic-element information to characterize lexical semantic contents, and adjusted EM modeling to disambiguate word stems. Then, in the lexical-semantic space of corpus, lexical-semantic eigenvector of document representation was built by calculating the weight of each synset, and applied to a widely-recognized algorithm NWKNN. On text corpus Reuter-21578 and its adjusted version of lexical replacement, the experimental results show that the lexical-semantic eigenvector performsF1 measure and scales of dimension better than term-statistic eigenvector based on TF-IDF. Formation of document representation eigenvectors ensures the method a wide prospect of classification applications in text corpus analysis.
SEMANTIC3D.NET: a New Large-Scale Point Cloud Classification Benchmark
Hackel, T.; Savinov, N.; Ladicky, L.; Wegner, J. D.; Schindler, K.; Pollefeys, M.
2017-05-01
This paper presents a new 3D point cloud classification benchmark data set with over four billion manually labelled points, meant as input for data-hungry (deep) learning methods. We also discuss first submissions to the benchmark that use deep convolutional neural networks (CNNs) as a work horse, which already show remarkable performance improvements over state-of-the-art. CNNs have become the de-facto standard for many tasks in computer vision and machine learning like semantic segmentation or object detection in images, but have no yet led to a true breakthrough for 3D point cloud labelling tasks due to lack of training data. With the massive data set presented in this paper, we aim at closing this data gap to help unleash the full potential of deep learning methods for 3D labelling tasks. Our semantic3D.net data set consists of dense point clouds acquired with static terrestrial laser scanners. It contains 8 semantic classes and covers a wide range of urban outdoor scenes: churches, streets, railroad tracks, squares, villages, soccer fields and castles. We describe our labelling interface and show that our data set provides more dense and complete point clouds with much higher overall number of labelled points compared to those already available to the research community. We further provide baseline method descriptions and comparison between methods submitted to our online system. We hope semantic3D.net will pave the way for deep learning methods in 3D point cloud labelling to learn richer, more general 3D representations, and first submissions after only a few months indicate that this might indeed be the case.
Semantic Searching and Ranking of Documents using Hybrid Learning System and WordNet
Directory of Open Access Journals (Sweden)
Pooja Arora
2012-06-01
Full Text Available Semantic searching seeks to improve search accuracy of the search engine by understanding searcher’s intent and the contextual meaning of the terms present in the query to retrieve more relevant results. To find out the semantic similarity between the query terms, WordNet is used as the underlying reference database. Various approaches of Learning to Rank are compared. A new hybrid learning system is introduced which combines learning using Neural Network and Support Vector Machine. As the size of the training set highly affects the performance of the Neural Network, we have used Support Vector Machine to reduce the size of the data set by extracting support vectors that are critical for the learning. The data set containing support vectors is then used for learning a ranking function using Neural Network. The proposed system is compared with RankNet. The experimental results demonstrated very promising performance improvements. For experiments, we have used English-Hindi parallel corpus, Gyannidhi from CDAC. F-measure and Average Interpolated Precision are used for evaluation.
Chini, Davide; Pirri, Franco; Pettenati, Maria Chiara; Innocenti, Samuele; Ciofi, Lucia
Establishing equivalence links between (semantic) resources, as it is the case in the Linked Data approach, implies permanent search, analysis and alignment of new (semantic) data in a rapidly changing environment. Moreover the distributed management of data brings not negligible requirements as regards their authorship, update, versioning and replica management. Instead of providing solutions for the above issues at the application level, our approach relies on the adoption of a common layered infrastructure: InterDataNet (IDN). The core of the IDN architecture is the Naming System aimed at providing a scalable and open service to support consistent reuse of entities and their identifiers, enabling a global reference and addressing mechanism for convenient retrieval of resources. The IDN architecture also provides basic collaboration-oriented functions for (semantic) data, featuring authorship control, versioning and replica management through its stack layers.
Queralt-Rosinach, Núria; Piñero, Janet; Bravo, Àlex; Sanz, Ferran; Furlong, Laura I
2016-07-15
DisGeNET-RDF makes available knowledge on the genetic basis of human diseases in the Semantic Web. Gene-disease associations (GDAs) and their provenance metadata are published as human-readable and machine-processable web resources. The information on GDAs included in DisGeNET-RDF is interlinked to other biomedical databases to support the development of bioinformatics approaches for translational research through evidence-based exploitation of a rich and fully interconnected linked open data. http://rdf.disgenet.org/ support@disgenet.org. © The Author 2016. Published by Oxford University Press.
MONOTONIZATION IN GLOBAL OPTIMIZATION
Institute of Scientific and Technical Information of China (English)
WU ZHIYOU; BAI FUSHENG; ZHANG LIANSHENG
2005-01-01
A general monotonization method is proposed for converting a constrained programming problem with non-monotone objective function and monotone constraint functions into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existingconvexification and concavefication methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.
Directory of Open Access Journals (Sweden)
Kirthi J
2011-03-01
Full Text Available The proposed semantic information retrieval system handles the following : i automatic spell correction of user query. ii analysis and determination of the semantic feature of the content and development of a semantic pattern that represents the semantic features of the content. iii analysis of user's query and extension of implied semantics through semantic extension to identify more semantic features for matching. vi generation of contents with approximate semantics by clustering the documents and matching against the extended query to provide correct contents to the querist. v a ranking method which computes relevance of documents for actual queries by computing quantitative document-query semantic distance.
Linking netCDF Data with the Semantic Web - Enhancing Data Discovery Across Domains
Biard, J. C.; Yu, J.; Hedley, M.; Cox, S. J. D.; Leadbetter, A.; Car, N. J.; Druken, K. A.; Nativi, S.; Davis, E.
2016-12-01
Geophysical data communities are publishing large quantities of data across a wide variety of scientific domains which are overlapping more and more. Whilst netCDF is a common format for many of these communities, it is only one of a large number of data storage and transfer formats. One of the major challenges ahead is finding ways to leverage these diverse data sets to advance our understanding of complex problems. We describe a methodology for incorporating Resource Description Framework (RDF) triples into netCDF files called netCDF-LD (netCDF Linked Data). NetCDF-LD explicitly connects the contents of netCDF files - both data and metadata, with external web-based resources, including vocabularies, standards definitions, and data collections, and through them, a whole host of related information. This approach also preserves and enhances the self describing essence of the netCDF format and its metadata, whilst addressing the challenge of integrating various conventions into files. We present a case study illustrating how reasoning over RDF graphs can empower researchers to discover datasets across domain boundaries.
Time Petri Net Model with Mixed Semantics%混合语义时间Petri网模型
Institute of Scientific and Technical Information of China (English)
潘理; 丁志军; 郭观七
2011-01-01
提出了时间Petri网的混合语义模型,通过在变迁及其非冲突变迁集的最小上界处设置强制实施点,排除冲突变迁对变迁可实施性的影响,达到既能扩大模型调度范围又可保证任务调度时限性的目的,以解决现有语义模型在调度分析上的缺陷.进一步证明了混合语义模型的图灵等价性及标识可达性问题的不可判定性,然后界定了3种语义模型的时间语言接受能力.最后提出了状态类分析方法,用于模型的可调度性分析和时间计算,并以一个柔性制造系统为例,比较和验证了3种语义模型的调度分析能力.%This paper presents a time Petri net (TPN) model with mixed semantics that efficiently addresses the schedulability analysis problem of the existing semantics models. The proposed model associates each firahle transition with a mandatory firing point that is set to the least upper bound of the transition and its non-conflicting transitions. This treatment not only eliminates the effect of conflicting transitions on the transition friability and extends the scheduling scope of the TPN model, but also ensures the time limit of thc task scheduling. To determine thc exprcssiveness of the mixed model, the study proves that the mixed semantics model has the power of Turing machines and its marking reachability problem is undecidable. The timed expressiveness of three semantics models with respect to timed language acceptance is also comparcd. A statc class approach is then proposed for the scheduling analysis of thc mixed model. Finally, a flexible manufacturing system is used as an example to compare the scheduling ability of three semantics models.
Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics
DEFF Research Database (Denmark)
Mateo, Jose Antonio; Srba, Jiri; Sørensen, Mathias Grund
2015-01-01
Analysis of workflow processes with quantitative aspectslike timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and studythe foundational problems of soundness and strong (time-bounded) soundness.We first consider the discrete-t...
Chen, Liang-Chieh; Papandreou, George; Kokkinos, Iasonas; Murphy, Kevin; Yuille, Alan L
2017-04-27
In this work we address the task of semantic image segmentation with Deep Learning and make three main contributions that are experimentally shown to have substantial practical merit. First, we highlight convolution with upsampled filters, or 'atrous convolution', as a powerful tool in dense prediction tasks. Atrous convolution allows us to explicitly control the resolution at which feature responses are computed within Deep Convolutional Neural Networks. It also allows us to effectively enlarge the field of view of filters to incorporate larger context without increasing the number of parameters or the amount of computation. Second, we propose atrous spatial pyramid pooling (ASPP) to robustly segment objects at multiple scales. ASPP probes an incoming convolutional feature layer with filters at multiple sampling rates and effective fields-of-views, thus capturing objects as well as image context at multiple scales. Third, we improve the localization of object boundaries by combining methods from DCNNs and probabilistic graphical models. The commonly deployed combination of max-pooling and downsampling in DCNNs achieves invariance but has a toll on localization accuracy. We overcome this by combining the responses at the final DCNN layer with a fully connected Conditional Random Field (CRF), which is shown both qualitatively and quantitatively to improve localization performance. Our proposed "DeepLab" system sets the new state-of-art at the PASCAL VOC-2012 semantic image segmentation task, reaching 79.7% mIOU in the test set, and advances the results on three other datasets: PASCAL-Context, PASCAL-Person-Part, and Cityscapes. All of our code is made publicly available online.
Applying a semantic information Petri Net modeling method to AUV systems design
Institute of Scientific and Technical Information of China (English)
FENG Xiao-ning; WANG Shuo; WANG Zhuo; LIU Qun
2008-01-01
This paper informally introduces colored object-oriented Petri Nets(COOPN) with the application of the AUV system. According to the characteristic of the AUV system's running environment,the object-oriented method is used in this paper not only to dispart system modules but also construct the refined running model of AUV system,then the colored Petri Net method is used to establish hierarchically detailed model in order to get the performance analyzing information of the system. After analyzing the model implementation,the errors of architecture designing and function realization can be found. If the errors can be modified on time,the experiment time in the pool can be reduced and the cost can be saved.
Monotone Boolean approximation
Energy Technology Data Exchange (ETDEWEB)
Hulme, B.L.
1982-12-01
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
Energy Technology Data Exchange (ETDEWEB)
Korshunov, A D [S.L. Sobolev Institute for Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)
2003-10-31
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years.
Complexity of Non-Monotonic Logics
Thomas, Michael
2010-01-01
Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been considered, e.g., extension with default rules, extension with modal belief operators, or modification of the semantics. In this survey we consider a logical formalism from each of the above possibilities, namely Reiter's default logic, Moore's autoepistemic logic and McCarthy's circumscription. Additionally, we consider abduction, where one is not interested in inferences from a given knowledge base but in computing possible explanations for an observation with respect to a given knowledge base. Complexity results for different reasoning tasks for propositional variants of these logics have been studied already in the nineties. In recent years, however, a renewed interest in complexity issues can be observed. One current focal approach is to consider parameterized problems and ...
Directory of Open Access Journals (Sweden)
Ian Mackie
2013-02-01
Full Text Available Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically lambda calculi with patterns. However, the flat structure of interaction nets forces pattern matching and functional behaviour to be encoded at the same level, losing some potential parallelism. In this paper, we introduce bigraphical nets, or binets for short, as a generalisation of interaction nets using ideas from bigraphs and port graphs, and we present a formal notation and operational semantics for binets. We illustrate their expressive power by examples of applications.
Institute of Scientific and Technical Information of China (English)
雷丽晖; 段振华
2009-01-01
随着Web服务组合的发展,整合业务过程成为可能.组合Web服务可以被看作是基于过程的工作流.由于死锁、不安全和不可达等流的设计错误会影响组合Web服务的有效执行,因此这些错误应在组合Web服务执行前被检测出并修改.提出了基于语义标记Petri网的组合Web服务建模与验证方法.首先提出语义标记Petri网(SaPNs),并给出其语义;用受限描述逻辑tableau算法获得组合Web服务;使用SaPNs描述组合Web服务及其组成部分;最后,使用基于SaPNs的分析方法验证了组合Web服务.使用该方法在开放的Internet环境下可以获得满足客户需求的、可靠的组合Web服务.%Integrating business processes becomes practicable along with the development of Web services composition. Composite Web services can be regarded as process-based workflows. Since error design of flow structures, such as deadlock, unsafeness, non-reachability and so on, will affect composite Web services performance, these errors should be detected and corrected before composite Web services are executed. An approach for modeling and verifying composite Web services based on semantic annotated Petri Nets is proposed.Firstly, semantic annotated Petri Nets (SaPNs) is presented and the semantics of SaPNs is given. Secondly, a restricted description logic tableau algorithm is utilized to obtain composite Web services. Thirdly, SaPNs is used to represent a composite Web service and the participating services that are invoked by this composite Web service.Finally, the composite Web services represented with the SaPN are verified by means of some analysis methods based on SaPNs. With this approach, a reliable composite Web services meeting client requirements in an open Internet environment can be achieved.
Palmer, Martha; Xue, Nianwen
2011-01-01
This book is aimed at providing an overview of several aspects of semantic role labeling. Chapter 1 begins with linguistic background on the definition of semantic roles and the controversies surrounding them. Chapter 2 describes how the theories have led to structured lexicons such as FrameNet, VerbNet and the PropBank Frame Files that in turn provide the basis for large scale semantic annotation of corpora. This data has facilitated the development of automatic semantic role labeling systems based on supervised machine learning techniques. Chapter 3 presents the general principles of applyin
Guionnet, A
2012-01-01
By solving a free analog of the Monge-Amp\\`ere equation, we prove a non-commutative analog of Brenier's monotone transport theorem: if an $n$-tuple of self-adjoint non-commutative random variables $Z_{1},...,Z_{n}$ satisfies a regularity condition (its conjugate variables $\\xi_{1},...,\\xi_{n}$ should be analytic in $Z_{1},...,Z_{n}$ and $\\xi_{j}$ should be close to $Z_{j}$ in a certain analytic norm), then there exist invertible non-commutative functions $F_{j}$ of an $n$-tuple of semicircular variables $S_{1},...,S_{n}$, so that $Z_{j}=F_{j}(S_{1},...,S_{n})$. Moreover, $F_{j}$ can be chosen to be monotone, in the sense that $F_{j}=\\mathscr{D}_{j}g$ and $g$ is a non-commutative function with a positive definite Hessian. In particular, we can deduce that $C^{*}(Z_{1},...,Z_{n})\\cong C^{*}(S_{1},...,S_{n})$ and $W^{*}(Z_{1},...,Z_{n})\\cong L(\\mathbb{F}(n))$. Thus our condition is a useful way to recognize when an $n$-tuple of operators generate a free group factor. We obtain as a consequence that the q-deforme...
Monotone complete C*-algebras and generic dynamics
Saitô, Kazuyuki
2015-01-01
This monograph is about monotone complete C*-algebras, their properties and the new classification theory. A self-contained introduction to generic dynamics is also included because of its important connections to these algebras. Our knowledge and understanding of monotone complete C*-algebras has been transformed in recent years. This is a very exciting stage in their development, with much discovered but with many mysteries to unravel. This book is intended to encourage graduate students and working mathematicians to attack some of these difficult questions. Each bounded, upward directed net of real numbers has a limit. Monotone complete algebras of operators have a similar property. In particular, every von Neumann algebra is monotone complete but the converse is false. Written by major contributors to this field, Monotone Complete C*-algebras and Generic Dynamics takes readers from the basics to recent advances. The prerequisites are a grounding in functional analysis, some point set topology and an eleme...
Monotone partitions and almost partitions
Bonanzinga, M.; Cammaroto, F.; van Mill, J.; Pansera, B.A.
2014-01-01
In this paper we are interested in monotone versions of partitionability of topological spaces and weak versions thereof. We identify several classes of spaces with these properties by constructing trees of open sets with various properties.
Process of Petri Nets Extension
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
To describe the dynamic semantics for the network computing, the concept on process is presented based on the semantic model with variable, resource and relation. Accordingly, the formal definition of process and the mapping rules from the specification of Petri nets extension to process are discussed in detail respectively. Based on the collective concepts of process, the specification of dynamic semantics also is constructed as a net system. Finally, to illustrate process intuitively, an example is specified completely.
Why Monotonous Repetition is Unsatisfying
Salingaros, Nikos A
2011-01-01
Human beings prefer ordered complexity and not randomness in their environment, a result of our perceptual system evolving to interpret natural forms. We also recognize monotonously repeating forms as unnatural. Although widespread in today's built environment, such forms generate reactions ranging from boredom to unease. Christopher Alexander has introduced rules for generating forms adapted to natural geometries, which show structured variation with multiple symmetries in a hierarchy of scales. It turns out to be impossible to generate monotonously repeating forms by following those rules. As it is highly probable that traditional artifacts, buildings, and cities were created instinctively using a version of the same rules, this is the reason we never find monotonously repeating forms in traditional cultures.
Institute of Scientific and Technical Information of China (English)
林雱
2011-01-01
本文分析电子词典的超文本性对链接相关词汇语义信息,构建心理词库语义网络的作用,并提出电子词典的超链接功能对激活中观结构语义网络的几种途径。%This paper discusses the role that hypertext plays in bridging related lexical information and constructing mental lexicon,while it also introduces some approaches of activating the semantic net of mediocre structure through hyper-reference.
Monotonicity of social welfare optima
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Østerdal, Lars Peter Raahave
2010-01-01
This paper considers the problem of maximizing social welfare subject to participation constraints. It is shown that for an income allocation method that maximizes a social welfare function there is a monotonic relationship between the incomes allocated to individual agents in a given coalition...... (with at least three members) and its participation constraint if and only if the aggregate income to that coalition is always maximized. An impossibility result demonstrates that there is no welfare maximizing allocation method in which agents' individual incomes monotonically increase in society......'s income. Thus, for any such allocation method, there are situations where some agents have incentives to prevent society in becoming richer....
一种基于WordNet的短文本语义相似性算法%An Algorithm for Semantic Similarity of Short Text Based on WordNet
Institute of Scientific and Technical Information of China (English)
翟延冬; 王康平; 张东娜; 黄岚; 周春光
2012-01-01
The algorithm for semantic similarity of short text is used widely in document retrieval, information extraction and text mining. An algorithm for semantic similarity of short text named ST-CW is presented.The algorithm calculates semantic similarity of concept based on WordNet and The Brown Corpus,and then a formula is presented which refers to both concept similarity and syntactic information in short text.The evaluations are conducted on R&B and Miller dataset.%短文本语义相似性计算在文献检索、信息抽取、文本挖掘等方面应用日益广泛.本文提出了一种短文本语义相似性计算算法ST-CW.此算法使用WordNet和Brown文集来计算文本中的概念相似性,在此基础上提出了一个新的方法综合考虑概念、句法等信息来计算短文本的语义相似性.在R&B及Miller数据集上进行实验,实验结果验证了算法的有效性.
A Characterization of Generalized Monotone Normed Cones
Institute of Scientific and Technical Information of China (English)
S.ROMAGUERA; E.A.S(A)NCHEZ-P(E)REZ; O.VALERO
2007-01-01
Let C be a cone and consider a quasi-norm p defined on it. We study the structure of the couple (C, p) as a topological space in the case where the function p is also monotone. We characterize when the topology of a quasi-normed cone can be defined by means of a monotone norm. We also define and study the dual cone of a monotone normed cone and the monotone quotient of a general cone.We provide a decomposition theorem which allows us to write a cone as a direct sum of a monotone subcone that is isomorphic to the monotone quotient and other particular subcone.
Testing Monotonicity of Pricing Kernels
Timofeev, Roman
2007-01-01
In this master thesis a mechanism to test mononicity of empirical pricing kernels (EPK) is presented. By testing monotonicity of pricing kernel we can determine whether utility function is concave or not. Strictly decreasing pricing kernel corresponds to concave utility function while non-decreasing EPK means that utility function contains some non-concave regions. Risk averse behavior is usually described by concave utility function and considered to be a cornerstone of classical behavioral ...
Semantic Relatedness for Evaluation of Course Equivalencies
Yang, Beibei
2012-01-01
Semantic relatedness, or its inverse, semantic distance, measures the degree of closeness between two pieces of text determined by their meaning. Related work typically measures semantics based on a sparse knowledge base such as WordNet or Cyc that requires intensive manual efforts to build and maintain. Other work is based on a corpus such as the…
Monotonicity of chi-square test statistics
Ryu, Keunkwan
2003-01-01
This paper establishes monotonicity of the chi-square test statistic. As the more efficient parameter estimator is plugged into the test statistic, the degrees of freedom of the resulting chi-square test statistic monotonically increase.
A Strongly Grounded Stable Model Semantics for Full Propositional Language
2012-01-01
Answer set programming is one of the most praised frameworks for declarative programming in general and non-monotonic reasoning in particular. There has been many efforts to extend stable model semantics so that answer set programs can use a more extensive syntax. To such endeavor, the community of non-monotonic reasoning has introduced extensions such as equilibrium models and FLP semantics. However, both of these extensions suffer from two problems: intended models according to such extensi...
Some Generalizations of Monotonicity Condition and Applications
Institute of Scientific and Technical Information of China (English)
虞旦盛; 周颂平
2006-01-01
@@ O Introduction It is well known that there are a great number of interesting results in Fourier analysis established by assuming monotonicity of coefficients, and many of them have been generalized by loosing the condition to quasi-monotonicity, O-regularly varying quasi-monotonicity, etc..
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming
2009-01-01
The calculus of communicating systems, CCS, was introduced by Robin Milner as a calculus for modelling concurrent systems. Subsequently several techniques have been developed for analysing such models in order to get further insight into their dynamic behaviour. In this paper we present a static...... analysis for approximating the control structure embedded within the models. We formulate the analysis as an instance of a monotone framework and thus draw on techniques that often are associated with the efficient implementation of classical imperative programming languages. We show how to construct...
Principle Based Semantics for HPSG
Frank, A I
1994-01-01
The paper presents a constraint based semantic formalism for HPSG. The advantages of the formlism are shown with respect to a grammar for a fragment of German that deals with (i) quantifier scope ambiguities triggered by scrambling and/or movement and (ii) ambiguities that arise from the collective/distributive distinction of plural NPs. The syntax-semantics interface directly implements syntactic conditions on quantifier scoping and distributivity. The construction of semantic representations is guided by general principles governing the interaction between syntax and semantics. Each of these principles acts as a constraint to narrow down the set of possible interpretations of a sentence. Meanings of ambiguous sentences are represented by single partial representations (so-called U(nderspecified) D(iscourse) R(epresentation) S(tructure)s) to which further constraints can be added monotonically to gain more information about the content of a sentence. There is no need to build up a large number of alternative...
Annotating Coloured Petri Nets
DEFF Research Database (Denmark)
Lindstrøm, Bo; Wells, Lisa Marie
2002-01-01
Coloured Petri nets (CP-nets) can be used for several fundamentally different purposes like functional analysis, performance analysis, and visualisation. To be able to use the corresponding tool extensions and libraries it is sometimes necessary to include extra auxiliary information in the CP-ne...... a certain use of the CP-net. We define the semantics of annotations by describing a translation from a CP-net and the corresponding annotation layers to another CP-net where the annotations are an integrated part of the CP-net....... a method which makes it possible to associate auxiliary information, called annotations, with tokens without modifying the colour sets of the CP-net. Annotations are pieces of information that are not essential for determining the behaviour of the system being modelled, but are rather added to support...
On the sample monotonization problem
Takhanov, R. S.
2010-07-01
The problem of finding a maximal subsample in a training sample consisting of the pairs “object-answer” that does not violate monotonicity constraints is considered. It is proved that this problem is NP-hard and that it is equivalent to the problem of finding a maximum independent set in special directed graphs. Practically important cases in which a partial order specified on the set of answers is a complete order or has dimension two are considered in detail. It is shown that the second case is reduced to the maximization of a quadratic convex function on a convex set. For this case, an approximate polynomial algorithm based on linear programming theory is proposed.
Institute of Scientific and Technical Information of China (English)
史小平; 张懂
2016-01-01
This paper makes a study of the standardization of Chinese net abbreviations by means of cognitive semantic theory, and it has the following findings:the standardization can be made from two dimensions;one is that it can not go beyond people’s conceptual knowledge structure of Chinese language, the other is that the conceptualization mechanisms of Chinese net abbreviations can not be over complicated.%采用认知语义学理论，对汉语网络缩略词语的规范化进行了研究，研究发现：可以从两个维度对汉语网络缩略词语进行规范化：一是不能超出人们现有关于汉语的概念知识结构；二是对汉语网络缩略词语识解中涉及的概念化机制不能过于复杂。
Monotonic Allocation Schemes in Clan Games
Voorneveld, M.; Tijs, S.H.; Grahn, S.
2000-01-01
Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition reflecting the decreasing marginal contribution of non-clan members to growing coalitions.This decreasing marginal contribution is incorporated in the notion of a bi-monotonic allocation
Monotone models for prediction in data mining
Velikova, M.V.
2006-01-01
This dissertation studies the incorporation of monotonicity constraints as a type of domain knowledge into a data mining process. Monotonicity constraints are enforced at two stages¿data preparation and data modeling. The main contributions of the research are a novel procedure to test the degree of
Monotonic Stable Solutions for Minimum Coloring Games
Hamers, H.J.M.; Miquel, S.; Norde, H.W.
2011-01-01
For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is (P4,
Monotonicity-preserving linear multistep methods
Hundsdorfer, W.; Ruuth, S.J.; Spiteri, R.J.
2002-01-01
In this paper we provide an analysis of monotonicity properties for linear multistep methods. These monotonicity properties include positivity and the diminishing of total variation. We also pay particular attention to related boundedness properties such as the total-variation-bounded (TVB) property
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as speci
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as
Monotone Hurwitz numbers in genus zero
Goulden, I P; Novak, Jonathan
2012-01-01
Hurwitz numbers count branched covers of the Riemann sphere with specified ramification data, or equivalently, transitive permutation factorizations in the symmetric group with specified cycle types. Monotone Hurwitz numbers count a restricted subset of the branched covers counted by the Hurwitz numbers, and have arisen in recent work on the the asymptotic expansion of the Harish-Chandra-Itzykson-Zuber integral. In this paper we begin a detailed study of monotone Hurwitz numbers. We prove two results that are reminiscent of those for classical Hurwitz numbers. The first is the monotone join-cut equation, a partial differential equation with initial conditions that characterizes the generating function for monotone Hurwitz numbers in arbitrary genus. The second is our main result, in which we give an explicit formula for monotone Hurwitz numbers in genus zero.
Knowledge Representation and Natural-Language Semantics.
1985-08-01
that employ "semantic nets" and "frames" [ Woods 1975:50]. While this analysis is rather inelegant, it does appear to account for two constraints on...any participant in the action as rendering the action "easy": (86) Yolanda easily shot the arrow into the bullseye. (87) This exam is difficult. (88...lished manuscript, SRI International). Woods , William, 1975: "What’s in a link: foundations for semantic net- works", Representation and Understanding
Viable harvest of monotone bioeconomic models
De Lara, Michel; Cabrera, Hector Ramirez
2009-01-01
Some monospecies age class models, as well as specific multi-species models (with so-called technical interactions), exhibit useful monotonicity properties. This paper deals with discrete time monotone bioeconomics dynamics in the presence of state and control constraints. In practice, these latter ``acceptable configurations'' represent production and preservation requirements to be satisfied for all time, and they also possess monotonicity properties. A state $\\state$ is said to belong to the viability kernel if there exists a trajectory, of states and controls, starting from $\\state$ and satisfying the constraints. Under monotonicity assumptions, we present upper and lower estimates of the viability kernel. This helps delineating domains where a viable management is possible. Numerical examples, in the context of fisheries management, for the Chilean sea bass (\\emph{Dissostichus eleginoides}) and Alfonsino (\\emph{Beryx splendens}) are given.
Hyperbolic monotonicity in the Hilbert ball
Directory of Open Access Journals (Sweden)
Reich Simeon
2006-01-01
Full Text Available We first characterize -monotone mappings on the Hilbert ball by using their resolvents and then study the asymptotic behavior of compositions and convex combinations of these resolvents.
Semantic graphs and associative memories.
Pomi, Andrés; Mizraji, Eduardo
2004-12-01
Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.
Monotone Rank and Separations in Computational Complexity
Li, Yang D
2011-01-01
In the paper, we introduce the concept of monotone rank, and using it as a powerful tool, we obtain several important and strong separation results in computational complexity. We show a super-exponential separation between monotone and non-monotone computation in the non-commutative model, and thus give the answer to a longstanding open problem posed by Nisan \\cite{Nis1991} in algebraic complexity. More specifically, we exhibit a homogeneous algebraic function $f$ of degree $d$ ($d$ even) on $n$ variables with the monotone algebraic branching program (ABP) complexity $\\Omega(n^{d/2})$ and the non-monotone ABP complexity $O(d^2)$. We propose a relaxed version of the famous Bell's theorem\\cite{Bel1964}\\cite{CHSH1969}. Bell's theorem basically states that local hidden variable theory cannot predict the correlations produced by quantum mechanics, and therefore is an impossibility result. Bell's theorem heavily relies on the diversity of the measurements. We prove that even if we fix the measurement, infinite amo...
Sauermann, Leo; Kiesel, Malte; Schumacher, Kinga; Bernardi, Ansgar
In diesem Beitrag wird gezeigt, wie der Arbeitsplatz der Zukunft aussehen könnte und wo das Semantic Web neue Möglichkeiten eröffnet. Dazu werden Ansätze aus dem Bereich Semantic Web, Knowledge Representation, Desktop-Anwendungen und Visualisierung vorgestellt, die es uns ermöglichen, die bestehenden Daten eines Benutzers neu zu interpretieren und zu verwenden. Dabei bringt die Kombination von Semantic Web und Desktop Computern besondere Vorteile - ein Paradigma, das unter dem Titel Semantic Desktop bekannt ist. Die beschriebenen Möglichkeiten der Applikationsintegration sind aber nicht auf den Desktop beschränkt, sondern können genauso in Web-Anwendungen Verwendung finden.
The monotonic and fatigue behavior of CFCCs
Energy Technology Data Exchange (ETDEWEB)
Miriyala, N.; Liaw, P.K.; McHargue, C.J. [Univ. of Tennessee, Knoxville, TN (United States); Snead, L.L. [Oak Ridge National Laboratory, TN (United States)
1996-04-01
Flexure tests were performed to study the fabric orientation effects on the monotonic and fatigue behavior of two commercially available continuous fiber reinforced ceramic composites (CFCCs), namely (i) Nicalon fiber fabric reinforced alumina (Al{sub 2}O{sub 3}) matrix composite fabricated by a direct molten metal oxidation (DIMOX) process and, (ii) Nicalon fiber fabric reinforced silicon carbide (SiC) matrix composite fabricated by an isothermal chemical vapor infiltration (ICVI) process. The fabric orientation effects on the monotonic and fatigue behavior were strong in the Nicalon/Al{sub 2}O{sub 3} composite, while they were relatively weak in the Nicalon/SiC composite.
Weighted monotonicity inequalities for unbounded operators
Hoa, Dinh Trung
2011-01-01
Let $\\tau$ be a faithful normal semifinite trace on a von Neumann algebra $\\mathcal{M}$. For a continuous nonnegative convex monotone nondecreasing function $f$ on convex subset $\\Omega$ of $\\mathbb{R}$ and weight nonnegative Borel function $w$ we consider weighted monotonicity inequalities of the form {equation*} \\tau(w(A)^{1/2}f(A)w(A)^{1/2}) \\le \\tau (w(A)^{1/2}f(B)w(A)^{1/2}), {equation*} where $A$ and $B$ are unbounded operators affiliated with respect to algebra $\\mathcal{M}$.
DEFF Research Database (Denmark)
Thrane, Torben
1997-01-01
Understanding natural language is a cognitive, information-driven process. Discussing some of the consequences of this fact, the paper offers a novel look at the semantic effect of lexical nouns and the identification of reference types.......Understanding natural language is a cognitive, information-driven process. Discussing some of the consequences of this fact, the paper offers a novel look at the semantic effect of lexical nouns and the identification of reference types....
Institute of Scientific and Technical Information of China (English)
蒋昌俊; 吴哲辉
1992-01-01
Two kinds of net operations.addition and Cartesian production of P/T nets,are introduced.They are defined on the set of underlying net of P/T systems.The conditions for preserving structural properties of Petri net after these operations are discussed.It is shown that the set of P/T nets forms and Abelian group for net addition operation and the inverse net of a P/T net in usual meaning of net theory is exactly the inverse of this P/T net as an element of the P/T net group;and that the set of P/T nets forms an Abelian ring for net addition and Caresian product operations.
Institute of Scientific and Technical Information of China (English)
Mark GREAVES
2012-01-01
One of the principal scientific challenges that drives my group is to understand the character of formal knowledge on the Web.By formal knowledge,I mean information that is represented on the Web in something other than natural language text—typically,as machine-readable Web data with a formal syntax and a specific,intended semantics.The Web provides a major counterpoint to our traditional artificial intelligence (AI) based accounts of formal knowledge.Most symbolic AI systems are designed to address sophisticated logical inference over coherent conceptual knowledge,and thus the underlying research is focused on characterizing formal properties such as entailment relations,time/space complexity of inference,monotonicity,and expressiveness.In contrast,the Semantic Web allows us to explore formal knowledge in a very different context,where data representations exist in a constantly changing,large-scale,highly distributed network of looselyconnected publishers and consumers,and are governed by a Web-derived set of social practices for discovery,trust,reliability,and use.We are particularly interested in understanding how large-scale Semantic Web data behaves over longer time periods:the way by which its producers and consumers shift their requirements over time;how uniform resource identifiers (URIs) are used to dynamically link knowledge together;and the overall lifecycle of Web data from publication,to use,integration with other knowledge,evolution,and eventual deprecation.We believe that understanding formal knowledge in this Web context is the key to bringing existing AI insights and knowledge bases to the level of scale and utility of the current hypertext Web.
Business information query expansion through semantic network
Gong, Zhiguo; Muyeba, Maybin; Guo, Jingzhi
2010-02-01
In this article, we propose a method for business information query expansions. In our approach, hypernym/hyponymy and synonym relations in WordNet are used as the basic expansion rules. Then we use WordNet Lexical Chains and WordNet semantic similarity to assign terms in the same query into different groups with respect to their semantic similarities. For each group, we expand the highest terms in the WordNet hierarchies with hypernym and synonym, the lowest terms with hyponym and synonym and all other terms with only synonym. In this way, the contradictory caused by full expansion can be well controlled. Furthermore, we use collection-related term semantic network to further improve the expansion performance. And our experiment reveals that our solution for query expansion can improve the query performance dramatically.
Monotone Comparative Statics for the Industry Composition
DEFF Research Database (Denmark)
Laugesen, Anders Rosenstand
2015-01-01
We let heterogeneous firms face decisions on a number of complementary activities in a monopolistically-competitive industry. The endogenous level of competition and selection regarding entry and exit of firms introduces a wedge between monotone comparative statics (MCS) at the firm level and MCS...
On a Monotone Ill-posed Problem
Institute of Scientific and Technical Information of China (English)
Nguyen BUONG
2005-01-01
A class of a posteriori parameter choice strategies for the operator version of Tikhonovregularization (including variants of Morozov's and Arcangeli's methods) is proposed and used in investigating the rate of convergence of the regularized solution for ill-posed nonlinear equation involving a monotone operator in Banach space.
Population Monotonic Path Schemes for Simple Games
Ciftci, B.B.; Borm, P.E.M.; Hamers, H.J.M.
2006-01-01
A path scheme for a simple game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path.A path scheme is called population monotonic if a player's payoff does not decrease as the pa
Monotone method for nonlinear nonlocal hyperbolic problems
Directory of Open Access Journals (Sweden)
Azmy S. Ackleh
2003-02-01
Full Text Available We present recent results concerning the application of the monotone method for studying existence and uniqueness of solutions to general first-order nonlinear nonlocal hyperbolic problems. The limitations of comparison principles for such nonlocal problems are discussed. To overcome these limitations, we introduce new definitions for upper and lower solutions.
Limit points of the monotonic schemes
Salomon, J
2005-01-01
Many numerical simulations in quantum (bilinear) control use the monotonically convergent algorithms of Krotov (introduced by Tannor), Zhu & Rabitz or the general form of Maday & Turinici. This paper presents an analysis of the limit set of controls provided by these algorithms and a proof of convergence in a particular case.
REGULAR RELATIONS AND MONOTONE NORMAL ORDERED SPACES
Institute of Scientific and Technical Information of China (English)
XU XIAOQUAN; LIU YINGMING
2004-01-01
In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic characterization of regularity, the authors give a characterization of monotone normality of ordered spaces. A new proof of the UrysohnNachbin lemma is presented which is quite different from the classical one.
Monotonicity and bounds on Bessel functions
Directory of Open Access Journals (Sweden)
Larry Landau
2000-07-01
Full Text Available survey my recent results on monotonicity with respect to order of general Bessel functions, which follow from a new identity and lead to best possible uniform bounds. Application may be made to the "spreading of the wave packet" for a free quantum particle on a lattice and to estimates for perturbative expansions.
Strong monotonicity for analytic ordinary differential equations
Directory of Open Access Journals (Sweden)
Sebastian Walcher
2009-09-01
Full Text Available We present a necessary and sufficient criterion for the flow of an analytic ordinary differential equation to be strongly monotone; equivalently, strongly order-preserving. The criterion is given in terms of the reducibility set of the derivative of the right-hand side. Some applications to systems relevant in biology and ecology, including nonlinear compartmental systems, are discussed.
A monotonic archive for pareto-coevolution.
de Jong, Edwin D
2007-01-01
Coevolution has already produced promising results, but its dynamic evaluation can lead to a variety of problems that prevent most algorithms from progressing monotonically. An important open question therefore is how progress towards a chosen solution concept can be achieved. A general solution concept for coevolution is obtained by viewing opponents or tests as objectives. In this setup known as Pareto-coevolution, the desired solution is the Pareto-optimal set. We present an archive that guarantees monotonicity for this solution concept. The algorithm is called the Incremental Pareto-Coevolution Archive (IPCA), and is based on Evolutionary Multi-Objective Optimization (EMOO). By virtue of its monotonicity, IPCA avoids regress even when combined with a highly explorative generator. This capacity is demonstrated on a challenging test problem requiring both exploration and reliability. IPCA maintains a highly specific selection of tests, but the size of the test archive nonetheless grows unboundedly. We therefore furthermore investigate how archive sizes may be limited while still providing approximate reliability. The LAyered Pareto-Coevolution Archive (LAPCA) maintains a limited number of layers of candidate solutions and tests, and thereby permits a trade-off between archive size and reliability. The algorithm is compared in experiments, and found to be more efficient than IPCA. The work demonstrates how the approximation of a monotonic algorithm can lead to algorithms that are sufficiently reliable in practice while offering better efficiency.
Limit properties of monotone matrix functions
Behrndt, Jussi; Hassi, Seppo; de Snoo, Henk; Wietsma, Rudi
2012-01-01
The basic objects in this paper are monotonically nondecreasing n x n matrix functions D(center dot) defined on some open interval l = (a, b) of R and their limit values D(a) and D(b) at the endpoints a and b which are, in general, selfadjoint relations in C-n. Certain space decompositions induced b
Concerns on Monotonic Imbalance Bounding Matching Methods
Yatracos, Yannis G.
2013-01-01
Concerns are expressed for the Monotonic Imbalance Bounding (MIB) property (Iacus et al. 2011) and for MIB matching because i) the definition of the MIB property leads to inconsistencies and the nature of the imbalance measure is not clearly defined, ii) MIB property does not generalize Equal Percent Bias Reducing (EPBR) property, iii) MIB matching does not provide statistical information available with EPBR matching.
Nonparametric confidence intervals for monotone functions
Groeneboom, P.; Jongbloed, G.
2015-01-01
We study nonparametric isotonic confidence intervals for monotone functions. In [Ann. Statist. 29 (2001) 1699–1731], pointwise confidence intervals, based on likelihood ratio tests using the restricted and unrestricted MLE in the current status model, are introduced. We extend the method to the trea
Competitive learning of monotone Boolean functions
2014-01-01
We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances.
Nonparametric confidence intervals for monotone functions
Groeneboom, P.; Jongbloed, G.
2015-01-01
We study nonparametric isotonic confidence intervals for monotone functions. In [Ann. Statist. 29 (2001) 1699–1731], pointwise confidence intervals, based on likelihood ratio tests using the restricted and unrestricted MLE in the current status model, are introduced. We extend the method to the
Edit Distance to Monotonicity in Sliding Windows
DEFF Research Database (Denmark)
Chan, Ho-Leung; Lam, Tak-Wah; Lee, Lap Kei
2011-01-01
of a data stream is becoming well-understood over the past few years. Motivated by applications on network quality monitoring, we extend the study to estimating the edit distance to monotonicity of a sliding window covering the w most recent items in the stream for any w ≥ 1. We give a deterministic...
New concurrent iterative methods with monotonic convergence
Energy Technology Data Exchange (ETDEWEB)
Yao, Qingchuan [Michigan State Univ., East Lansing, MI (United States)
1996-12-31
This paper proposes the new concurrent iterative methods without using any derivatives for finding all zeros of polynomials simultaneously. The new methods are of monotonic convergence for both simple and multiple real-zeros of polynomials and are quadratically convergent. The corresponding accelerated concurrent iterative methods are obtained too. The new methods are good candidates for the application in solving symmetric eigenproblems.
Classification Trees for Problems with Monotonicity Constraints
R. Potharst (Rob); A.J. Feelders
2002-01-01
textabstractFor classification problems with ordinal attributes very often the class attribute should increase with each or some of the explaining attributes. These are called classification problems with monotonicity constraints. Classical decision tree algorithms such as CART or C4.5 generally do
Extended Fuzzy Logic Programs with Fuzzy Answer Set Semantics
Saad, Emad
This paper extends fuzzy logic programs [12, 24] to allow the explicit representation of classical negation as well as non-monotonic negation, by introducing the notion of extended fuzzy logic programs. We present the fuzzy answer set semantics for the extended fuzzy logic programs, which is based on the classical answer set semantics of classical extended logic programs [7]. We show that the proposed semantics is a natural extension to the classical answer set semantics of classical extended logic programs [7]. Furthermore, we define fixpoint semantics for extended fuzzy logic programs with and without non-monotonic negation, and study their relationship to the fuzzy answer set semantics. In addition, we show that the fuzzy answer set semantics is reduced to the stable fuzzy model semantics for normal fuzzy logic programs introduced in [42]. The importance of that is computational methods developed for normal fuzzy logic programs can be applied to the extended fuzzy logic programs. Moreover, we show that extended fuzzy logic programs can be intuitively used for representing and reasoning about actions in fuzzy environment.
Petri Nets in Cryptographic Protocols
DEFF Research Database (Denmark)
Crazzolara, Federico; Winskel, Glynn
2001-01-01
A process language for security protocols is presented together with a semantics in terms of sets of events. The denotation of process is a set of events, and as each event specifies a set of pre and postconditions, this denotation can be viewed as a Petri net. By means of an example we illustrat...
Monotone operators and "bigger conjugate" functions
Bauschke, Heinz H; Wang, Xianfu; Yao, Liangjin
2011-01-01
We study a question posed by Stephen Simons in his 2008 monograph involving "bigger conjugate" (BC) functions and the partial infimal convolution. As Simons demonstrated in his monograph, these function have been crucial to the understanding and advancement of the state-of-the-art of harder problems in monotone operator theory, especially the sum problem. In this paper, we provide some tools for further analysis of BC--functions which allow us to answer Simons' problem in the negative. We are also able to refute a similar but much harder conjecture which would have generalized a classical result of Br\\'ezis, Crandall and Pazy. Our work also reinforces the importance of understanding unbounded skew linear relations to construct monotone operators with unexpected properties.
Convex functions, monotone operators and differentiability
Phelps, Robert R
1993-01-01
The improved and expanded second edition contains expositions of some major results which have been obtained in the years since the 1st edition. Theaffirmative answer by Preiss of the decades old question of whether a Banachspace with an equivalent Gateaux differentiable norm is a weak Asplund space. The startlingly simple proof by Simons of Rockafellar's fundamental maximal monotonicity theorem for subdifferentials of convex functions. The exciting new version of the useful Borwein-Preiss smooth variational principle due to Godefroy, Deville and Zizler. The material is accessible to students who have had a course in Functional Analysis; indeed, the first edition has been used in numerous graduate seminars. Starting with convex functions on the line, it leads to interconnected topics in convexity, differentiability and subdifferentiability of convex functions in Banach spaces, generic continuity of monotone operators, geometry of Banach spaces and the Radon-Nikodym property, convex analysis, variational princ...
Linear Inviscid Damping for Monotone Shear Flows
Zillinger, Christian
2014-01-01
In this article we prove linear stability, inviscid damping and scattering of the 2D Euler equations around regular, strictly monotone shear flows $(U(y),0)$ in a periodic channel under Sobolev perturbations. We treat the settings of an infinite channel, $\\mathbb{T} \\times \\mathbb{R}$, as well as a finite channel, $\\mathbb{T} \\times [0,1]$, with impermeable boundary. We first prove inviscid damping with optimal algebraic rates for strictly monotone shear flows under the assumption of controlling the regularity of the scattered vorticity. Subsequently, we establish linear stability of the scattering equation in Sobolev spaces under perturbations which are of not too large wave-length with respect to $x$, depending on $U''$.
Improved selection in totally monotone arrays
Energy Technology Data Exchange (ETDEWEB)
Mansour, Y. (Harvard Univ., Cambridge, MA (United States). Aiken Computation Lab.); Park, J.K. (Sandia National Labs., Albuquerque, NM (United States)); Schieber, B. (International Business Machines Corp., Yorktown Heights, NY (United States). Thomas J. Watson Research Center); Sen, S. (AT and T Bell Labs., Murray Hill, NJ (United States))
1991-01-01
This paper's main result is an O(({radical}{bar m}lgm)(n lg n) + mlg n)-time algorithm for computing the kth smallest entry in each row of an m {times} n totally monotone array. (A two-dimensional A = a(i,j) is totally monotone if for all i{sub 1} < i{sub 2} and j{sub 1} < j{sup 2}, < a(i{sub 1},j{sub 2}) implies a(i{sub 2},j{sub 1})). For large values of k (in particular, for k=(n/2)), this algorithm is significantly faster than the O(k(m+n))-time algorithm for the same problem due to Kravets and Park. An immediate consequence of this result is an O(n{sup 3/2} lg{sup 2}n)-time algorithm for computing the kth nearest neighbor of each vertex of a convex n-gon. In addition to the main result, we also give an O(n lg m)-time algorithm for computing an approximate median in each row of an m {times} n totally monotone array; this approximate median is an entry whose rank in its row lies between (n/4) and (3n/4) {minus} 1. 20 refs., 3 figs.
Edit Distance to Monotonicity in Sliding Windows
Chan, Ho-Leung; Lee, Lap-Kei; Pan, Jiangwei; Ting, Hing-Fung; Zhang, Qin
2011-01-01
Given a stream of items each associated with a numerical value, its edit distance to monotonicity is the minimum number of items to remove so that the remaining items are non-decreasing with respect to the numerical value. The space complexity of estimating the edit distance to monotonicity of a data stream is becoming well-understood over the past few years. Motivated by applications on network quality monitoring, we extend the study to estimating the edit distance to monotonicity of a sliding window covering the $w$ most recent items in the stream for any $w \\ge 1$. We give a deterministic algorithm which can return an estimate within a factor of $(4+\\eps)$ using $O(\\frac{1}{\\eps^2} \\log^2(\\eps w))$ space. We also extend the study in two directions. First, we consider a stream where each item is associated with a value from a partial ordered set. We give a randomized $(4+\\epsilon)$-approximate algorithm using $O(\\frac{1}{\\epsilon^2} \\log \\epsilon^2 w \\log w)$ space. Second, we consider an out-of-order strea...
Bagha, Karim Nazari
2011-01-01
Generative semantics is (or perhaps was) a research program within linguistics, initiated by the work of George Lakoff, John R. Ross, Paul Postal and later McCawley. The approach developed out of transformational generative grammar in the mid 1960s, but stood largely in opposition to work by Noam Chomsky and his students. The nature and genesis of…
Weak monotonicity inequality and partial regularity for harmonic maps
Institute of Scientific and Technical Information of China (English)
沈尧天; 严树森
1999-01-01
The notion of locally weak monotonicity inequality for weakly harmonic maps is introduced and various results on this class of maps are obtained. For example, the locally weak monotonicity inequality is nearly equivalent to the ε-regularity.
Monotonic Loading of Circular Surface Footings on Clay
DEFF Research Database (Denmark)
Ibsen, Lars Bo; Barari, Amin
2011-01-01
Appropriate modeling of offshore foundations under monotonic loading is a significant challenge in geotechnical engineering. This paper reports experimental and numerical analyses, specifically investigating the response of circular surface footings during monotonic loading and elastoplastic beha...
A-monotonicity and applications to nonlinear variational inclusion problems
Directory of Open Access Journals (Sweden)
Ram U. Verma
2004-01-01
Full Text Available A new notion of the A-monotonicity is introduced, which generalizes the H-monotonicity. Since the A-monotonicity originates from hemivariational inequalities, and hemivariational inequalities are connected with nonconvex energy functions, it turns out to be a useful tool proving the existence of solutions of nonconvex constrained problems as well.
On the strong monotonicity of the CABARET scheme
Ostapenko, V. V.
2012-03-01
The strong monotonicity of the CABARET scheme with single flux correction is analyzed as applied to the linear advection equation. It is shown that the scheme is strongly monotone (has the NED property) at Courant numbers r ∈ (0,0,5), for which it is monotone. Test computations illustrating this property of the CABARET scheme are presented.
Testing Manifest Monotonicity Using Order-Constrained Statistical Inference
Tijmstra, Jesper; Hessen, David J.; van der Heijden, Peter G. M.; Sijtsma, Klaas
2013-01-01
Most dichotomous item response models share the assumption of latent monotonicity, which states that the probability of a positive response to an item is a nondecreasing function of a latent variable intended to be measured. Latent monotonicity cannot be evaluated directly, but it implies manifest monotonicity across a variety of observed scores,…
Towards a Standard for Modular Petri Nets
DEFF Research Database (Denmark)
Kindler, Ekkart; Petrucci, Laure
2009-01-01
as a mechanism for modules in Petri nets that is independent from a particular version of Petri nets and that can mimic many composition mechanisms by a simple import and export concept. Due to its generality, the semantics of modular PNML was only informally defined. Moreover, modular PNML did not define which...... concepts could or should be subject to import and export in high-level Petri nets. In this paper, we formalise a minimal version of modular high-level Petri nets, which is based on the concepts of modular PNML. This shows that modular PNML can be formalised once a specific version of Petri net is fixed...
Wehrl entropy, Lieb conjecture and entanglement monotones
Mintert, F; Mintert, Florian; Zyczkowski, Karol
2004-01-01
We propose to quantify the entanglement of pure states of $N \\times N$ bipartite quantum system by defining its Husimi distribution with respect to $SU(N)\\times SU(N)$ coherent states. The Wehrl entropy is minimal if and only if the pure state analyzed is separable. The excess of the Wehrl entropy is shown to be equal to the subentropy of the mixed state obtained by partial trace of the bipartite pure state. This quantity, as well as the generalized (R{\\'e}nyi) subentropies, are proved to be Schur--convex, so they are entanglement monotones and may be used as alternative measures of entanglement.
Topological recursion and a quantum curve for monotone Hurwitz numbers
Do, Norman; Dyer, Alastair; Mathews, Daniel V.
2017-10-01
Classical Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. Monotone Hurwitz numbers restrict the enumeration by imposing a further monotonicity condition on such factorisations. In this paper, we prove that monotone Hurwitz numbers arise from the topological recursion of Eynard and Orantin applied to a particular spectral curve. We furthermore derive a quantum curve for monotone Hurwitz numbers. These results extend the collection of enumerative problems known to be governed by the paradigm of topological recursion and quantum curves, as well as the list of analogues between monotone Hurwitz numbers and their classical counterparts.
BioFrameNet: A FrameNet Extension to the Domain of Molecular Biology
Dolbey, Andrew Eric
2009-01-01
In this study I introduce BioFrameNet, an extension of the Berkeley FrameNet lexical database to the domain of molecular biology. I examine the syntactic and semantic combinatorial possibilities exhibited in the lexical items used in this domain in order to get a better understanding of the grammatical properties of the language used in scientific…
The Monotonicity Puzzle: An Experimental Investigation of Incentive Structures
Directory of Open Access Journals (Sweden)
Jeannette Brosig
2010-05-01
Full Text Available Non-monotone incentive structures, which - according to theory - are able to induce optimal behavior, are often regarded as empirically less relevant for labor relationships. We compare the performance of a theoretically optimal non-monotone contract with a monotone one under controlled laboratory conditions. Implementing some features relevant to real-world employment relationships, our paper demonstrates that, in fact, the frequency of income-maximizing decisions made by agents is higher under the monotone contract. Although this observed behavior does not change the superiority of the non-monotone contract for principals, they do not choose this contract type in a significant way. This is what we call the monotonicity puzzle. Detailed investigations of decisions provide a clue for solving the puzzle and a possible explanation for the popularity of monotone contracts.
The Formal Semantics of an UML Activity Diagram
Institute of Scientific and Technical Information of China (English)
梁义芝; 王延章; 刘云飞
2004-01-01
Due to lack of strictly defined formal semantics, an UML activity diagram is unsuitable for the tasks of formal analysis, verification and assertion on the system it describes. In this paper, Petri net is used to define the formal semantics of an UML activity diagram containing object flow states, laying a foundation for the precise description and analysis of a workflow system.
Directory of Open Access Journals (Sweden)
Paul J. E. Dekker
2010-12-01
Full Text Available In the last decade the enterprise of formal semantics has been under attack from several philosophical and linguistic perspectives, and it has certainly suffered from its own scattered state, which hosts quite a variety of paradigms which may seem to be incompatible. It will not do to try and answer the arguments of the critics, because the arguments are often well-taken. The negative conclusions, however, I believe are not. The only adequate reply seems to be a constructive one, which puts several pieces of formal semantics, in particular dynamic semantics, together again. In this paper I will try and sketch an overview of tasks, techniques, and results, which serves to at least suggest that it is possible to develop a coherent overall picture of undeniably important and structural phenomena in the interpretation of natural language. The idea is that the concept of meanings as truth conditions after all provides an excellent start for an integrated study of the meaning and use of natural language, and that an extended notion of goal directed pragmatics naturally complements this picture. None of the results reported here are really new, but we think it is important to re-collect them.ReferencesAsher, Nicholas & Lascarides, Alex. 1998. ‘Questions in Dialogue’. Linguistics and Philosophy 23: 237–309.http://dx.doi.org/10.1023/A:1005364332007Borg, Emma. 2007. ‘Minimalism versus contextualism in semantics’. In Gerhard Preyer & Georg Peter (eds. ‘Context-Sensitivity and Semantic Minimalism’, pp. 339–359. Oxford: Oxford University Press.Cappelen, Herman & Lepore, Ernest. 1997. ‘On an Alleged Connection between Indirect Quotation and Semantic Theory’. Mind and Language 12: pp. 278–296.Cappelen, Herman & Lepore, Ernie. 2005. Insensitive Semantics. Oxford: Blackwell.http://dx.doi.org/10.1002/9780470755792Dekker, Paul. 2002. ‘Meaning and Use of Indefinite Expressions’. Journal of Logic, Language and Information 11: pp. 141–194
Convex functions, monotone operators and differentiability
Phelps, Robert R
1989-01-01
These notes start with an introduction to the differentiability of convex functions on Banach spaces, leading to the study of Asplund spaces and their intriguing relationship to monotone operators (and more general set-values maps) and Banach spaces with the Radon-Nikodym property. While much of this is classical, some of it is presented using streamlined proofs which were not available until recently. Considerable attention is paid to contemporary results on variational principles and perturbed optimization in Banach spaces, exhibiting their close connections with Asplund spaces. An introductory course in functional analysis is adequate background for reading these notes which can serve as the basis for a seminar of a one-term graduate course. There are numerous excercises, many of which form an integral part of the exposition.
Generalized convexity, generalized monotonicity recent results
Martinez-Legaz, Juan-Enrique; Volle, Michel
1998-01-01
A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized conve...
From a Link Semantic to Semantic Links - Building Context in Educational Hypermedia
Schmidt, Thomas C; Engelhardt, Michael; Lange, Dagmar
2009-01-01
Modularization and granulation are key concepts in educational content management, whereas teaching, learning and understanding require a discourse within thematic contexts. Even though hyperlinks and semantically typed references provide the context building blocks of hypermedia systems, elaborate concepts to derive, manage and propagate such relations between content objects are not around at present. Based on Semantic Web standards, this paper makes several contributions to content enrichment. Work starts from harvesting multimedia annotations in class-room recordings, and proceeds to deriving a dense educational semantic net between eLearning Objects decorated with extended LOM relations. Special focus is drawn on the processing of recorded speech and on an Ontological Evaluation Layer that autonomously derives meaningful inter-object relations. Further on, a semantic representation of hyperlinks is developed and elaborated to the concept of semantic link contexts, an approach to manage a coherent rhetori...
Minimally inconsistent reasoning in Semantic Web
Zhang, Xiaowang
2017-01-01
Reasoning with inconsistencies is an important issue for Semantic Web as imperfect information is unavoidable in real applications. For this, different paraconsistent approaches, due to their capacity to draw as nontrivial conclusions by tolerating inconsistencies, have been proposed to reason with inconsistent description logic knowledge bases. However, existing paraconsistent approaches are often criticized for being too skeptical. To this end, this paper presents a non-monotonic paraconsistent version of description logic reasoning, called minimally inconsistent reasoning, where inconsistencies tolerated in the reasoning are minimized so that more reasonable conclusions can be inferred. Some desirable properties are studied, which shows that the new semantics inherits advantages of both non-monotonic reasoning and paraconsistent reasoning. A complete and sound tableau-based algorithm, called multi-valued tableaux, is developed to capture the minimally inconsistent reasoning. In fact, the tableaux algorithm is designed, as a framework for multi-valued DL, to allow for different underlying paraconsistent semantics, with the mere difference in the clash conditions. Finally, the complexity of minimally inconsistent description logic reasoning is shown on the same level as the (classical) description logic reasoning. PMID:28750030
A Petri Net Definition of a System Description Language
DEFF Research Database (Denmark)
Jensen, Kurt; Kyng, Morten; Madsen, Ole Lehrmann
1979-01-01
This paper introduces a language for the description of systems with concurrency, and presents a formal definition of its semantics. The language is based on Delta and the semantic model is an extension of Petri nets with a data part and with expressions attached to transitions and to places....
Semantic Grounding Strategies for Tagbased Recommender Systems
Durao, Frederico
2011-01-01
Recommender systems usually operate on similarities between recommended items or users. Tag based recommender systems utilize similarities on tags. The tags are however mostly free user entered phrases. Therefore, similarities computed without their semantic groundings might lead to less relevant recommendations. In this paper, we study a semantic grounding used for tag similarity calculus. We show a comprehensive analysis of semantic grounding given by 20 ontologies from different domains. The study besides other things reveals that currently available OWL ontologies are very narrow and the percentage of the similarity expansions is rather small. WordNet scores slightly better as it is broader but not much as it does not support several semantic relationships. Furthermore, the study reveals that even with such number of expansions, the recommendations change considerably.
SEMANTIC TERM BASED INFORMATION RETRIEVAL USING ONTOLOGY
Directory of Open Access Journals (Sweden)
J. Mannar Mannan
2014-01-01
Full Text Available Information Searching and retrieval is a challenging task in the traditional keyword based textual information retrieval system. In the growing information age, adding huge data every day the searching problem also augmented. Keyword based retrieval system returns bulk of junk document irrelevant to query. To address the limitations, this paper proposed query terms along with semantic terms for information retrieval using multiple ontology reference. User query sometimes reflects multiple domain of interest that persist us to collect semantically related ontologies. If no related ontology exists then WordNet ontology used to retrieve semantic terms related to query term. In this approach, classes on the ontology derived as semantic related text keywords, these keywords considered for rank the documents.
Preserved musical semantic memory in semantic dementia.
Weinstein, Jessica; Koenig, Phyllis; Gunawardena, Delani; McMillan, Corey; Bonner, Michael; Grossman, Murray
2011-02-01
To understand the scope of semantic impairment in semantic dementia. Case study. Academic medical center. A man with semantic dementia, as demonstrated by clinical, neuropsychological, and imaging studies. Music performance and magnetic resonance imaging results. Despite profoundly impaired semantic memory for words and objects due to left temporal lobe atrophy, this semiprofessional musician was creative and expressive in demonstrating preserved musical knowledge. Long-term representations of words and objects in semantic memory may be dissociated from meaningful knowledge in other domains, such as music.
Fielker, David
2008-01-01
The Easter conference 2008 had several activities which for the author raised the same questions on cube nets in some work with eight-year-olds some time ago. In this article, the author muses on some problems from the Easter conference regarding nets of shapes. (Contains 1 note.)
Inquisitive semantics and pragmatics
Groenendijk, J.; Roelofsen, F.; Larrazabal, J.M.; Zubeldia, L.
2009-01-01
This paper starts with an informal introduction to inquisitive semantics. After that, we present a formal definition of the semantics, and introduce the basic semantic notions of inquisitiveness and informativeness, in terms of wich we define the semantic categories of questions, assertions, and hyb
Stability of dynamical systems on the role of monotonic and non-monotonic Lyapunov functions
Michel, Anthony N; Liu, Derong
2015-01-01
The second edition of this textbook provides a single source for the analysis of system models represented by continuous-time and discrete-time, finite-dimensional and infinite-dimensional, and continuous and discontinuous dynamical systems. For these system models, it presents results which comprise the classical Lyapunov stability theory involving monotonic Lyapunov functions, as well as corresponding contemporary stability results involving non-monotonicLyapunov functions.Specific examples from several diverse areas are given to demonstrate the applicability of the developed theory to many important classes of systems, including digital control systems, nonlinear regulator systems, pulse-width-modulated feedback control systems, and artificial neural networks. The authors cover the following four general topics: - Representation and modeling of dynamical systems of the types described above - Presentation of Lyapunov and Lagrange stability theory for dynamical sy...
Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
Hundsdorfer, W.
2011-04-29
In this paper nonlinear monotonicity and boundedness properties are analyzed for linear multistep methods. We focus on methods which satisfy a weaker boundedness condition than strict monotonicity for arbitrary starting values. In this way, many linear multistep methods of practical interest are included in the theory. Moreover, it will be shown that for such methods monotonicity can still be valid with suitable Runge-Kutta starting procedures. Restrictions on the stepsizes are derived that are not only sufficient but also necessary for these boundedness and monotonicity properties. © 2011 Springer Science+Business Media, LLC.
On the monotonicity of multidimensional finite difference schemes
Kovyrkina, O.; Ostapenko, V.
2016-10-01
The classical concept of monotonicity, introduced by Godunov for linear one-dimensional difference schemes, is extended to multidimensional case. Necessary and sufficient conditions of monotonicity are obtained for linear multidimensional difference schemes of first order. The constraints on the numerical viscosity are given that ensure the monotonicity of a difference scheme in the multidimensional case. It is proposed a modification of the second order multidimensional CABARET scheme that preserves the monotonicity of one-dimensional discrete solutions and, as a result, ensures higher smoothness in the computation of multidimensional discontinuous solutions. The results of two-dimensional test computations illustrating the advantages of the modified CABARET scheme are presented.
UniNet Description of Dining Philosopher Problem
Institute of Scientific and Technical Information of China (English)
DU Zhuomin; HE Yanxiang; ZHOU Guofu
2007-01-01
The UniNet specification of Dining Philosopher Problem we presents not only is graphic and intuitionistic but also explicitly indicates the static semantics and the dynamic semantics.In the specification, the static properties are the recorder of the dynamic properties, and the dynamic properties are the track of the static properties change. Accordingly, Dining Philosopher Problem is formally verified by UniNet. Furthermore, the procedure of properties' verification is implemented through the graphic-related computing style.
Zhang, Chuanrong; Li, Weidong
2015-01-01
This book covers key issues related to Geospatial Semantic Web, including geospatial web services for spatial data interoperability; geospatial ontology for semantic interoperability; ontology creation, sharing, and integration; querying knowledge and information from heterogeneous data source; interfaces for Geospatial Semantic Web, VGI (Volunteered Geographic Information) and Geospatial Semantic Web; challenges of Geospatial Semantic Web; and development of Geospatial Semantic Web applications. This book also describes state-of-the-art technologies that attempt to solve these problems such as WFS, WMS, RDF, OWL, and GeoSPARQL, and demonstrates how to use the Geospatial Semantic Web technologies to solve practical real-world problems such as spatial data interoperability.
Directory of Open Access Journals (Sweden)
Anna Lamandini
2011-06-01
Full Text Available The semantic Web is a technology at the service of knowledge which is aimed at accessibility and the sharing of content; facilitating interoperability between different systems and as such is one of the nine key technological pillars of TIC (technologies for information and communication within the third theme, programme specific cooperation of the seventh programme framework for research and development (7°PQRS, 2007-2013. As a system it seeks to overcome overload or excess of irrelevant information in Internet, in order to facilitate specific or pertinent research. It is an extension of the existing Web in which the aim is for cooperation between and the computer and people (the dream of Sir Tim Berners –Lee where machines can give more support to people when integrating and elaborating data in order to obtain inferences and a global sharing of data. It is a technology that is able to favour the development of a “data web” in other words the creation of a space in both sets of interconnected and shared data (Linked Data which allows users to link different types of data coming from different sources. It is a technology that will have great effect on everyday life since it will permit the planning of “intelligent applications” in various sectors such as education and training, research, the business world, public information, tourism, health, and e-government. It is an innovative technology that activates a social transformation (socio-semantic Web on a world level since it redefines the cognitive universe of users and enables the sharing not only of information but of significance (collective and connected intelligence.
Monotone measures of ergodicity for Markov chains
Directory of Open Access Journals (Sweden)
J. Keilson
1998-01-01
Full Text Available The following paper, first written in 1974, was never published other than as part of an internal research series. Its lack of publication is unrelated to the merits of the paper and the paper is of current importance by virtue of its relation to the relaxation time. A systematic discussion is provided of the approach of a finite Markov chain to ergodicity by proving the monotonicity of an important set of norms, each measures of egodicity, whether or not time reversibility is present. The paper is of particular interest because the discussion of the relaxation time of a finite Markov chain [2] has only been clean for time reversible chains, a small subset of the chains of interest. This restriction is not present here. Indeed, a new relaxation time quoted quantifies the relaxation time for all finite ergodic chains (cf. the discussion of Q1(t below Equation (1.7]. This relaxation time was developed by Keilson with A. Roy in his thesis [6], yet to be published.
Remarks on a monotone Markov chain
Directory of Open Access Journals (Sweden)
P. Todorovic
1987-01-01
Full Text Available In applications, considerations on stochastic models often involve a Markov chain {ζn}0∞ with state space in R+, and a transition probability Q. For each x R+ the support of Q(x,. is [0,x]. This implies that ζ0≥ζ1≥…. Under certain regularity assumptions on Q we show that Qn(x,Bu→1 as n→∞ for all u>0 and that 1−Qn(x,Bu≤[1−Q(x,Bu]n where Bu=[0,u. Set τ0=max{k;ζk=ζ0}, τn=max{k;ζk=ζτn−1+1} and write Xn=ζτn−1+1, Tn=τn−τn−1. We investigate some properties of the imbedded Markov chain {Xn}0∞ and of {Tn}0∞. We determine all the marginal distributions of {Tn}0∞ and show that it is asymptotically stationary and that it possesses a monotonicity property. We also prove that under some mild regularity assumptions on β(x=1−Q(x,Bx, ∑1n(Ti−a/bn→dZ∼N(0,1.
Algorithm to Match Ontologies on the Semantic Web
Directory of Open Access Journals (Sweden)
Alaa Qassim Al-Namiy
2013-04-01
Full Text Available It has been recognized that semantic data and knowledge extraction will significantly improve the capability of natural language interfaces to the semantic search engine. Semantic Web technology offers a vast scale of sharing and integration of distributed data sources by combining information easily. This will enable the user to find the information easily and efficiently. In this paper, we will explore some issues of developing algorithms for the Semantic Web. The first one to build the semantic contextual meaning by scanning the text, extract knowledge and automatically infer the meaning of the information from text that contains the search words in any sentence and correlate with hierarchical classes defined in the Ontology as a result of input resources. The second to discover the hierarchical relationships among terms (i.e. discover the semantic relations across hierarchical classifications. The proposed algorithm will be relying on a number of resources including Ontology and WordNet.
Robust Monotone Iterates for Nonlinear Singularly Perturbed Boundary Value Problems
Directory of Open Access Journals (Sweden)
Boglaev Igor
2009-01-01
Full Text Available This paper is concerned with solving nonlinear singularly perturbed boundary value problems. Robust monotone iterates for solving nonlinear difference scheme are constructed. Uniform convergence of the monotone methods is investigated, and convergence rates are estimated. Numerical experiments complement the theoretical results.
Regularization and Iterative Methods for Monotone Variational Inequalities
Directory of Open Access Journals (Sweden)
Xiubin Xu
2010-01-01
Full Text Available We provide a general regularization method for monotone variational inequalities, where the regularizer is a Lipschitz continuous and strongly monotone operator. We also introduce an iterative method as discretization of the regularization method. We prove that both regularization and iterative methods converge in norm.
LIMITED MEMORY BFGS METHOD FOR NONLINEAR MONOTONE EQUATIONS
Institute of Scientific and Technical Information of China (English)
Weijun Zhou; Donghui Li
2007-01-01
In this paper, we propose an algorithm for solving nonlinear monotone equations by combining the limited memory BFGS method (L-BFGS) with a projection method. We show that the method is globally convergent if the equation involves a Lipschitz continuous monotone function. We also present some preliminary numerical results.
Positivity and Monotonicity Preserving Biquartic Rational Interpolation Spline Surface
Directory of Open Access Journals (Sweden)
Xinru Liu
2014-01-01
Full Text Available A biquartic rational interpolation spline surface over rectangular domain is constructed in this paper, which includes the classical bicubic Coons surface as a special case. Sufficient conditions for generating shape preserving interpolation splines for positive or monotonic surface data are deduced. The given numeric experiments show our method can deal with surface construction from positive or monotonic data effectively.
DEFF Research Database (Denmark)
de Souza e Silva, Adriana Araujo; Gordon, Eric
Provides an introduction to the new theory of Net Locality and the profound effect on individuals and societies when everything is located or locatable. Describes net locality as an emerging form of location awareness central to all aspects of digital media, from mobile phones, to Google Maps, to...... of emerging technologies, from GeoCities to GPS, Wi-Fi, Wiki Me, and Google Android....
DEFF Research Database (Denmark)
de Souza e Silva, Adriana Araujo; Gordon, Eric
Provides an introduction to the new theory of Net Locality and the profound effect on individuals and societies when everything is located or locatable. Describes net locality as an emerging form of location awareness central to all aspects of digital media, from mobile phones, to Google Maps, to...... of emerging technologies, from GeoCities to GPS, Wi-Fi, Wiki Me, and Google Android....
Segaran, Toby; Taylor, Jamie
2009-01-01
With this book, the promise of the Semantic Web -- in which machines can find, share, and combine data on the Web -- is not just a technical possibility, but a practical reality Programming the Semantic Web demonstrates several ways to implement semantic web applications, using current and emerging standards and technologies. You'll learn how to incorporate existing data sources into semantically aware applications and publish rich semantic data. Each chapter walks you through a single piece of semantic technology and explains how you can use it to solve real problems. Whether you're writing
Petri Nets for Biologically Motivated Computing
Directory of Open Access Journals (Sweden)
J. Kleijn
2011-01-01
Full Text Available Petri nets are a general and well-established model of concurrent and distributed computation and behaviour, including that taking place in biological systems. In this survey paper, we are concerned with intrinsic relationships between Petri nets and two formal models inspired by aspects of the functioning of the living cell: membrane systems and reaction systems. In particular, we are interested in the benefits that can result from establishing strong semantical links between Petri nets and membrane systems and reaction systems. We first discuss Petri nets with localities reflecting the compartmentalisation modelled in membrane systems. Then special attention is given to set-nets, a new Petri net model for reaction systems and their qualitative approach to the investigation of the processes carried out by biochemical reactions taking place in the living cell.
Derivational and Semantic Relations of Croatian Verbs
Directory of Open Access Journals (Sweden)
Krešimir Šojat
2012-12-01
Full Text Available This paper deals with certain morphosemantic relations between Croatian verbs and discusses their inclusion in Croatian WordNet. The morphosemantic relations in question are the semantic relations between unprefixed infinitives and their prefixed derivatives. We introduce the criteria for the division of aspectual pairs and further discuss verb prefixation which results in combinations of prefixes and base forms that can vary in terms of meaning from compositional to completely idiosyncratic. The focus is on the regularities in semantic modifications of base forms modified by one prefix. The aim of this procedure is to establish a set of morphosemantic relations based on regular or reoccuring meaning alternations.
Flanders, Jon
2008-01-01
RESTful .NET is the first book that teaches Windows developers to build RESTful web services using the latest Microsoft tools. Written by Windows Communication Foundation (WFC) expert Jon Flanders, this hands-on tutorial demonstrates how you can use WCF and other components of the .NET 3.5 Framework to build, deploy and use REST-based web services in a variety of application scenarios. RESTful architecture offers a simpler approach to building web services than SOAP, SOA, and the cumbersome WS- stack. And WCF has proven to be a flexible technology for building distributed systems not necessa
Transactions on Petri Nets and Other Models of Concurrency VII
DEFF Research Database (Denmark)
The first section is concerned with the creation of Petri net models and their validation The second section addresses semantic issues and analysis methods The third section is devoted to the automatic synthesis of Petri nets These Transactions publish archival papers in the broad area of Petri n...
The Number of Monotone and Self-Dual Boolean Functions
Directory of Open Access Journals (Sweden)
Haviarova L.
2014-12-01
Full Text Available In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Ratio Monotonicity of Polynomials Derived from Nondecreasing Sequences
Chen, William Y C; Zhou, Elaine L F
2010-01-01
The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of P(x+c) for any $c\\geq 1$ due to Llamas and Mart\\'{\\i}nez-Bernal. As a consequence, we obtain the ratio monotonicity of the Boros-Moll polynomials obtained by Chen and Xia without resorting to the recurrence relations of the coefficients.
Directory of Open Access Journals (Sweden)
Michael Hoffmann
2012-03-01
Full Text Available Alexia may be divided into different subtypes, with semantic paralexia being particularly rare. A 57 year old woman with a discreet left thalamic stroke and semantic paralexia is described. Language evalution with the Boston Diagnostic Aphasia Battery confirmed the semantic paralexia (deep alexia. Multimodality magnetic resonance imaging brain scanning excluded other cerebral lesions. A good recovery ensued.
Hoffmann, Michael
2012-01-01
Alexia may be divided into different subtypes, with semantic paralexia being particularly rare. A 57 year old woman with a discreet left thalamic stroke and semantic paralexia is described. Language evalution with the Boston Diagnostic Aphasia Battery confirmed the semantic paralexia (deep alexia). Multimodality magnetic resonance imaging brain scanning excluded other cerebral lesions. A good recovery ensued. PMID:22593810
Principal semantic components of language and the measurement of meaning.
Directory of Open Access Journals (Sweden)
Alexei V Samsonovich
Full Text Available Metric systems for semantics, or semantic cognitive maps, are allocations of words or other representations in a metric space based on their meaning. Existing methods for semantic mapping, such as Latent Semantic Analysis and Latent Dirichlet Allocation, are based on paradigms involving dissimilarity metrics. They typically do not take into account relations of antonymy and yield a large number of domain-specific semantic dimensions. Here, using a novel self-organization approach, we construct a low-dimensional, context-independent semantic map of natural language that represents simultaneously synonymy and antonymy. Emergent semantics of the map principal components are clearly identifiable: the first three correspond to the meanings of "good/bad" (valence, "calm/excited" (arousal, and "open/closed" (freedom, respectively. The semantic map is sufficiently robust to allow the automated extraction of synonyms and antonyms not originally in the dictionaries used to construct the map and to predict connotation from their coordinates. The map geometric characteristics include a limited number ( approximately 4 of statistically significant dimensions, a bimodal distribution of the first component, increasing kurtosis of subsequent (unimodal components, and a U-shaped maximum-spread planar projection. Both the semantic content and the main geometric features of the map are consistent between dictionaries (Microsoft Word and Princeton's WordNet, among Western languages (English, French, German, and Spanish, and with previously established psychometric measures. By defining the semantics of its dimensions, the constructed map provides a foundational metric system for the quantitative analysis of word meaning. Language can be viewed as a cumulative product of human experiences. Therefore, the extracted principal semantic dimensions may be useful to characterize the general semantic dimensions of the content of mental states. This is a fundamental step
Institute of Scientific and Technical Information of China (English)
米热吉古丽·热扎克; 阿里甫·库尔班
2014-01-01
Construct Uyghur frame semantic knowledge base is a basic pro ject in natural language pro-cessing, at present most of work is based on artificial. Extract sample sentence from real corpus, which contains the describe lexical unit, for depth studied in annotation sentence and valency patterns of these sentence, extracted Uyghur lexical unit from annotated sentence, and sample sentence filled to frame corpus, construct the Uyghur lexicon corpus and sentence corpus, will achieve the Uyghur frame semantic network automatically construct purpose. In this paper makes a preliminary analysis the annotation object of the sentence which extracted from Uyghur real corpus, discuss the design and work process of the man-machine UFN interactive system that based Arabic character. Introduce the sentence annotation window of the UFN man-machine interactive system and lexical unit report, automatically generated demo of the lexical extry report.%构建维吾尔语框架语义知识库是自然语言处理的基础性工程，目前大部分工作基于人工。从真实语料库中抽取包含将要描述词元的例句，为例句标注以及这些例句的配价模式进行深入研究，从标注好的维吾尔语例句中提取维吾尔语词元和例句填充到维吾尔语框架库，构建维吾尔语词元库和例句库，实现维吾尔语语义框架网络的自动构造之目的。本文对维吾尔语真实语料库中抽取的例句中标注对象进行初步分析，论述了人机交互式基于阿拉伯字符的UFN例句辅助标注系统的功能模块设计和工作流程。介绍了UFN例句辅助标注系统的例句标注界面和词元标注报告、词条报告的自动生成演示界面。
Directory of Open Access Journals (Sweden)
Plubtieng Somyot
2009-01-01
Full Text Available Abstract We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.
Directory of Open Access Journals (Sweden)
Somyot Plubtieng
2009-01-01
Full Text Available We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.
On the Monotone Iterative Method for Set Valued Equation
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
This paper deals with the monotone iterative method for set- valued operator equation in ordered normed space. Some results for the case of single valued operator are generalized here, as an application, a discontinuous nonlinear differential equation problem is discussed.
Monotone method for initial value problem for fractional diffusion equation
Institute of Scientific and Technical Information of China (English)
ZHANG Shuqin
2006-01-01
Using the method of upper and lower solutions and its associated monotone iterative, consider the existence and uniqueness of solution of an initial value problem for the nonlinear fractional diffusion equation.
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
Kulik, Ariel; Tamir, Tami
2011-01-01
Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular function, an $\\alpha$-approximation algorithm for the continuous relaxation implies a randomized $(\\alpha - \\eps)$-approximation algorithm for the discrete problem. We use this relation to improve the best known approximation ratio for the problem to $1/4- \\eps$, for any $\\eps > 0$, and to obtain a nearly optimal $(1-e^{-1}-\\eps)-$approximation ratio for the monotone case, for any $\\eps>0$. We further show that the probabilistic domain ...
Action-Maslov Homomorphism for Monotone Symplectic Manifolds
Branson, Mark
2009-01-01
We explore conditions under which the action-Maslov homomorphism vanishes on monotone symplectic manifolds. Our strategy involves showing that the units in the quantum homology, and thus the Seidel element, have a very specific form. Then we use induction to show that other relevant Gromov-Witten invariants vanish. We prove that these conditions hold for monotone products of projective spaces and for the Grassmannian of 2-planes in $\\C^4$.
Completely monotonic functions related to logarithmic derivatives of entire functions
DEFF Research Database (Denmark)
Pedersen, Henrik Laurberg
2011-01-01
The logarithmic derivative l(x) of an entire function of genus p and having only non-positive zeros is represented in terms of a Stieltjes function. As a consequence, (-1)p(xml(x))(m+p) is a completely monotonic function for all m ≥ 0. This generalizes earlier results on complete monotonicity...... of functions related to Euler's psi-function. Applications to Barnes' multiple gamma functions are given....
Isotonicity of the projection onto the monotone cone
Németh, A B
2012-01-01
A wedge (i.e., a closed nonempty set in the Euclidean space stable under addition and multiplication with non-negative scalars) induces by a standard way a semi-order (a reflexive and transitive binary relation) in the space. The wedges admitting isotone metric projection with respect to the semi-order induced by them are characterized. The obtained result is used to show that the monotone wedge (called monotone cone in regression theory) admits isotone projection.
Monotonic loading of circular surface footings on clay
Energy Technology Data Exchange (ETDEWEB)
Ibsen, Lars Bo; Barari, Amin [Aalborg University, Aalborg (Denmark)
2011-12-15
Appropriate modeling of offshore foundations under monotonic loading is a significant challenge in geotechnical engineering. This paper reports experimental and numerical analyses, specifically investigating the response of circular surface footings during monotonic loading and elastoplastic behavior during reloading. By using the findings presented in this paper, it is possible to extend the model to simulate the vertical-load displacement response of offshore bucket foundations.
Convergence for pseudo monotone semiflows on product ordered topological spaces
Yi, Taishan; Huang, Lihong
In this paper, we consider a class of pseudo monotone semiflows, which only enjoy some weak monotonicity properties and are defined on product-ordered topological spaces. Under certain conditions, several convergence principles are established for each precompact orbit of such a class of semiflows to tend to an equilibrium, which improve and extend some corresponding results already known. Some applications to delay differential equations are presented.
Miller, G A; Fellbaum, C
1991-12-01
Principles of lexical semantics developed in the course of building an on-line lexical database are discussed. The approach is relational rather than componential. The fundamental semantic relation is synonymy, which is required in order to define the lexicalized concepts that words can be used to express. Other semantic relations between these concepts are then described. No single set of semantic relations or organizational structure is adequate for the entire lexicon: nouns, adjectives, and verbs each have their own semantic relations and their own organization determined by the role they must play in the construction of linguistic messages.
Directory of Open Access Journals (Sweden)
Zbigniew Kaleta
2014-01-01
Full Text Available This article presents a specific issue of the semantic analysis of texts in natural language – text indexing and describes one field of its application (web browsing.The main part of this article describes the computer system assigning a set of semantic indexes (similar to keywords to a particular text. The indexing algorithm employs a semantic dictionary to find specific words in a text, that represent a text content. Furthermore it compares two given sets of semantic indexes to determine texts’ similarity (assigning numerical value. The article describes the semantic dictionary – a tool essentialto accomplish this task and its usefulness, main concepts of the algorithm and test results.
Layered neural networks with non-monotonic transfer functions
Katayama, Katsuki; Sakata, Yasuo; Horiguchi, Tsuyoshi
2003-01-01
We investigate storage capacity and generalization ability for two types of fully connected layered neural networks with non-monotonic transfer functions; random patterns are embedded into the networks by a Hebbian learning rule. One of them is a layered network in which a non-monotonic transfer function of even layers is different from that of odd layers. The other is a layered network with intra-layer connections, in which the non-monotonic transfer function of inter-layer is different from that of intra-layer, and inter-layered neurons and intra-layered neurons are updated alternately. We derive recursion relations for order parameters for those layered networks by the signal-to-noise ratio method. We clarify that the storage capacity and the generalization ability for those layered networks are enhanced in comparison with those with a conventional monotonic transfer function when non-monotonicity of the transfer functions is selected optimally. We also point out that some chaotic behavior appears in the order parameters for the layered networks when non-monotonicity of the transfer functions increases.
Biomedical semantics in the Semantic Web.
Splendiani, Andrea; Burger, Albert; Paschke, Adrian; Romano, Paolo; Marshall, M Scott
2011-03-07
The Semantic Web offers an ideal platform for representing and linking biomedical information, which is a prerequisite for the development and application of analytical tools to address problems in data-intensive areas such as systems biology and translational medicine. As for any new paradigm, the adoption of the Semantic Web offers opportunities and poses questions and challenges to the life sciences scientific community: which technologies in the Semantic Web stack will be more beneficial for the life sciences? Is biomedical information too complex to benefit from simple interlinked representations? What are the implications of adopting a new paradigm for knowledge representation? What are the incentives for the adoption of the Semantic Web, and who are the facilitators? Is there going to be a Semantic Web revolution in the life sciences?We report here a few reflections on these questions, following discussions at the SWAT4LS (Semantic Web Applications and Tools for Life Sciences) workshop series, of which this Journal of Biomedical Semantics special issue presents selected papers from the 2009 edition, held in Amsterdam on November 20th.
Query Expansion: Term Selection using the EWC Semantic Relatedness Measure
Klyuev, Vitaly
2011-01-01
This paper investigates the efficiency of the EWC semantic relatedness measure in an ad-hoc retrieval task. This measure combines the Wikipedia-based Explicit Semantic Analysis measure, the WordNet path measure and the mixed collocation index. In the experiments, the open source search engine Terrier was utilised as a tool to index and retrieve data. The proposed technique was tested on the NTCIR data collection. The experiments demonstrated promising results.
An Analysis of Frame Semantics of Continuous Processes
2016-08-10
expression and adjective phrase and return either a noun - modifier or a predicate (Fillmore et al, 2012). Additionally, ‘amount of’ can be used to...QP frames, a frame semantic representation inspired by Fillmore et al’s (2001) FrameNet. This approach was expanded by McFate et al ( 2014). While...useful, both approaches had limited coverage and did not connect QP frames to existing frame semantic resources. We bridge that gap by providing a
Frame semantics-based study of verbs across medical genres.
Wandji Tchami, Ornella; L'Homme, Marie-Claude; Grabar, Natalia
2014-01-01
The field of medicine gathers actors with different levels of expertise. These actors must interact, although their mutual understanding is not always completely successful. We propose to study corpora (with high and low levels of expertise) in order to observe their specificities. More specifically, we perform a contrastive analysis of verbs, and of the syntactic and semantic features of their participants, based on the Frame Semantics framework and the methodology implemented in FrameNet. In order to achieve this, we use an existing medical terminology to automatically annotate the semantics classes of participants of verbs, which we assume are indicative of semantics roles. Our results indicate that verbs show similar or very close semantics in some contexts, while in other contexts they behave differently. These results are important for studying the understanding of medical information by patients and for improving the communication between patients and medical doctors.
Work Out the Semantic Web Search: The Cooperative Way
Directory of Open Access Journals (Sweden)
Dora Melo
2012-01-01
Full Text Available We propose a Cooperative Question Answering System that takes as input natural language queries and is able to return a cooperative answer based on semantic web resources, more specifically DBpedia represented in OWL/RDF as knowledge base and WordNet to build similar questions. Our system resorts to ontologies not only for reasoning but also to find answers and is independent of prior knowledge of the semantic resources by the user. The natural language question is translated into its semantic representation and then answered by consulting the semantics sources of information. The system is able to clarify the problems of ambiguity and helps finding the path to the correct answer. If there are multiple answers to the question posed (or to the similar questions for which DBpedia contains answers, they will be grouped according to their semantic meaning, providing a more cooperative and clarified answer to the user.
Structured Operational Semantics for Graph Rewriting
Directory of Open Access Journals (Sweden)
Andrei Dorman
2011-07-01
Full Text Available Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational semantics (SOS for Milner's Calculus of Communicating Systems (CCS. The paper introduces an SOS style axiomatization of the standard labelled transition semantics for graph transformation systems. The first result is its equivalence with the so-called Borrowed Context technique. Unfortunately, the axiomatization is not compositional in the expected manner as no rule captures "internal" communication of sub-systems. The main result states that such a rule is derivable if the given graph transformation system enjoys a certain property, which we call "complementarity of actions". Archetypal examples of such systems are interaction nets. We also discuss problems that arise if "complementarity of actions" is violated.
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING
Directory of Open Access Journals (Sweden)
Siham AMROUCH
2013-11-01
Full Text Available In the last decade, ontologies have played a key technology role for information sharing and agents interoperability in different application domains. In semantic web domain, ontologies are efficiently used to face the great challenge of representing the semantics of data, in order to bring the actual web to its full power and hence, achieve its objective. However, using ontologies as common and shared vocabularies requires a certain degree of interoperability between them. To confront this requirement, mapping ontologies is a solution that is not to be avoided. In deed, ontology mapping build a meta layer that allows different applications and information systems to access and share their informations, of course, after resolving the different forms of syntactic, semantic and lexical mismatches. In the contribution presented in this paper, we have integrated the semantic aspect based on an external lexical resource, wordNet, to design a new algorithm for fully automatic ontology mapping. This fully automatic character features the main difference of our contribution with regards to the most of the existing semi-automatic algorithms of ontology mapping, such as Chimaera, Prompt, Onion, Glue, etc. To better enhance the performances of our algorithm, the mapping discovery stage is based on the combination of two sub-modules. The former analysis the concept’s names and the later analysis their properties. Each one of these two sub-modules is it self based on the combination of lexical and semantic similarity measures.
Word sense disambiguation using semantic relatedness measurement
Institute of Scientific and Technical Information of China (English)
YANG Che-Yu
2006-01-01
All human languages have words that can mean different things in different contexts, such words with multiple meanings are potentially "ambiguous". The process of "deciding which of several meanings of a term is intended in a given context" is known as "word sense disambiguation (WSD)". This paper presents a method of WSD that assigns a target word the sense that is most related to the senses of its neighbor words. We explore the use of measures of relatedness between word senses based on a novel hybrid approach. First, we investigate how to "literally" and "regularly" express a "concept". We apply set algebra to WordNet's synsets cooperating with WordNet's word ontology. In this way we establish regular rules for constructing various representations (lexical notations) of a concept using Boolean operators and word forms in various synset(s) defined in WordNet. Then we establish a formal mechanism for quantifying and estimating the semantic relatedness between concepts-we facilitate "concept distribution statistics" to determine the degree of semantic relatedness between two lexically expressed concepts. The experimental results showed good performance on Semcor, a subset of Brown corpus. We observe that measures of semantic relatedness are useful sources of information for WSD.
Geospatial Semantics and the Semantic Web
Ashish, Naveen
2011-01-01
The availability of geographic and geospatial information and services, especially on the open Web has become abundant in the last several years with the proliferation of online maps, geo-coding services, geospatial Web services and geospatially enabled applications. The need for geospatial reasoning has significantly increased in many everyday applications including personal digital assistants, Web search applications, local aware mobile services, specialized systems for emergency response, medical triaging, intelligence analysis and more. Geospatial Semantics and the Semantic Web: Foundation
Driving performance impairments due to hypovigilance on monotonous roads.
Larue, Grégoire S; Rakotonirainy, Andry; Pettitt, Anthony N
2011-11-01
Drivers' ability to react to unpredictable events deteriorates when exposed to highly predictable and uneventful driving tasks. Highway design reduces the driving task mainly to a lane-keeping manoeuvre. Such a task is monotonous, providing little stimulation and this contributes to crashes due to inattention. Research has shown that driver's hypovigilance can be assessed with EEG measurements and that driving performance is impaired during prolonged monotonous driving tasks. This paper aims to show that two dimensions of monotony - namely road design and road side variability - decrease vigilance and impair driving performance. This is the first study correlating hypovigilance and driver performance in varied monotonous conditions, particularly on a short time scale (a few seconds). We induced vigilance decrement as assessed with an EEG during a monotonous driving simulator experiment. Road monotony was varied through both road design and road side variability. The driver's decrease in vigilance occurred due to both road design and road scenery monotony and almost independently of the driver's sensation seeking level. Such impairment was also correlated to observable measurements from the driver, the car and the environment. During periods of hypovigilance, the driving performance impairment affected lane positioning, time to lane crossing, blink frequency, heart rate variability and non-specific electrodermal response rates. This work lays the foundation for the development of an in-vehicle device preventing hypovigilance crashes on monotonous roads.
Uncovering highly obfuscated plagiarism cases using fuzzy semantic-based similarity model
Salha M. Alzahrani; Naomie Salim; Vasile Palade
2015-01-01
Highly obfuscated plagiarism cases contain unseen and obfuscated texts, which pose difficulties when using existing plagiarism detection methods. A fuzzy semantic-based similarity model for uncovering obfuscated plagiarism is presented and compared with five state-of-the-art baselines. Semantic relatedness between words is studied based on the part-of-speech (POS) tags and WordNet-based similarity measures. Fuzzy-based rules are introduced to assess the semantic distance between source and su...
Berendt, Bettina; Hotho, Andreas; Stumme, Gerd
2002-01-01
Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. The idea is to improve, on the one hand, the results of Web Mining by exploiting the new semantic structures in the Web; and to make use of Web Mining, on overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.
Pollock, Jeffrey T
2009-01-01
Semantic Web technology is already changing how we interact with data on the Web. By connecting random information on the Internet in new ways, Web 3.0, as it is sometimes called, represents an exciting online evolution. Whether you're a consumer doing research online, a business owner who wants to offer your customers the most useful Web site, or an IT manager eager to understand Semantic Web solutions, Semantic Web For Dummies is the place to start! It will help you:Know how the typical Internet user will recognize the effects of the Semantic WebExplore all the benefits the data Web offers t
Applied Semantic Web Technologies
Sugumaran, Vijayan
2011-01-01
The rapid advancement of semantic web technologies, along with the fact that they are at various levels of maturity, has left many practitioners confused about the current state of these technologies. Focusing on the most mature technologies, Applied Semantic Web Technologies integrates theory with case studies to illustrate the history, current state, and future direction of the semantic web. It maintains an emphasis on real-world applications and examines the technical and practical issues related to the use of semantic technologies in intelligent information management. The book starts with
Estimating monotonic rates from biological data using local linear regression.
Olito, Colin; White, Craig R; Marshall, Dustin J; Barneche, Diego R
2017-03-01
Accessing many fundamental questions in biology begins with empirical estimation of simple monotonic rates of underlying biological processes. Across a variety of disciplines, ranging from physiology to biogeochemistry, these rates are routinely estimated from non-linear and noisy time series data using linear regression and ad hoc manual truncation of non-linearities. Here, we introduce the R package LoLinR, a flexible toolkit to implement local linear regression techniques to objectively and reproducibly estimate monotonic biological rates from non-linear time series data, and demonstrate possible applications using metabolic rate data. LoLinR provides methods to easily and reliably estimate monotonic rates from time series data in a way that is statistically robust, facilitates reproducible research and is applicable to a wide variety of research disciplines in the biological sciences. © 2017. Published by The Company of Biologists Ltd.
Monotone traveling wavefronts of the KPP-Fisher delayed equation
Gomez, Adrian
2010-01-01
In the early 2000's, Gourley (2000), Wu et al. (2001), Ashwin et al. (2002) initiated the study of the positive wavefronts in the delayed Kolmogorov-Petrovskii-Piskunov-Fisher equation. Since then, this model has become one of the most popular objects in the studies of traveling waves for the monostable delayed reaction-diffusion equations. In this paper, we give a complete solution to the problem of existence and uniqueness of monotone waves in the KPP-Fisher equation. We show that each monotone traveling wave can be found via an iteration procedure. The proposed approach is based on the use of special monotone integral operators (which are different from the usual Wu-Zou operator) and appropriate upper and lower solutions associated to them. The analysis of the asymptotic expansions of the eventual traveling fronts at infinity is another key ingredient of our approach.
Adventures in semantic publishing: exemplar semantic enhancements of a research article.
Shotton, David; Portwin, Katie; Klyne, Graham; Miles, Alistair
2009-04-01
Scientific innovation depends on finding, integrating, and re-using the products of previous research. Here we explore how recent developments in Web technology, particularly those related to the publication of data and metadata, might assist that process by providing semantic enhancements to journal articles within the mainstream process of scholarly journal publishing. We exemplify this by describing semantic enhancements we have made to a recent biomedical research article taken from PLoS Neglected Tropical Diseases, providing enrichment to its content and increased access to datasets within it. These semantic enhancements include provision of live DOIs and hyperlinks; semantic markup of textual terms, with links to relevant third-party information resources; interactive figures; a re-orderable reference list; a document summary containing a study summary, a tag cloud, and a citation analysis; and two novel types of semantic enrichment: the first, a Supporting Claims Tooltip to permit "Citations in Context", and the second, Tag Trees that bring together semantically related terms. In addition, we have published downloadable spreadsheets containing data from within tables and figures, have enriched these with provenance information, and have demonstrated various types of data fusion (mashups) with results from other research articles and with Google Maps. We have also published machine-readable RDF metadata both about the article and about the references it cites, for which we developed a Citation Typing Ontology, CiTO (http://purl.org/net/cito/). The enhanced article, which is available at http://dx.doi.org/10.1371/journal.pntd.0000228.x001, presents a compelling existence proof of the possibilities of semantic publication. We hope the showcase of examples and ideas it contains, described in this paper, will excite the imaginations of researchers and publishers, stimulating them to explore the possibilities of semantic publishing for their own research articles
Adventures in semantic publishing: exemplar semantic enhancements of a research article.
Directory of Open Access Journals (Sweden)
David Shotton
2009-04-01
Full Text Available Scientific innovation depends on finding, integrating, and re-using the products of previous research. Here we explore how recent developments in Web technology, particularly those related to the publication of data and metadata, might assist that process by providing semantic enhancements to journal articles within the mainstream process of scholarly journal publishing. We exemplify this by describing semantic enhancements we have made to a recent biomedical research article taken from PLoS Neglected Tropical Diseases, providing enrichment to its content and increased access to datasets within it. These semantic enhancements include provision of live DOIs and hyperlinks; semantic markup of textual terms, with links to relevant third-party information resources; interactive figures; a re-orderable reference list; a document summary containing a study summary, a tag cloud, and a citation analysis; and two novel types of semantic enrichment: the first, a Supporting Claims Tooltip to permit "Citations in Context", and the second, Tag Trees that bring together semantically related terms. In addition, we have published downloadable spreadsheets containing data from within tables and figures, have enriched these with provenance information, and have demonstrated various types of data fusion (mashups with results from other research articles and with Google Maps. We have also published machine-readable RDF metadata both about the article and about the references it cites, for which we developed a Citation Typing Ontology, CiTO (http://purl.org/net/cito/. The enhanced article, which is available at http://dx.doi.org/10.1371/journal.pntd.0000228.x001, presents a compelling existence proof of the possibilities of semantic publication. We hope the showcase of examples and ideas it contains, described in this paper, will excite the imaginations of researchers and publishers, stimulating them to explore the possibilities of semantic publishing for their own
Monotone data visualization using rational trigonometric spline interpolation.
Ibraheem, Farheen; Hussain, Maria; Hussain, Malik Zawwar
2014-01-01
Rational cubic and bicubic trigonometric schemes are developed to conserve monotonicity of curve and surface data, respectively. The rational cubic function has four parameters in each subinterval, while the rational bicubic partially blended function has eight parameters in each rectangular patch. The monotonicity of curve and surface data is retained by developing constraints on some of these parameters in description of rational cubic and bicubic trigonometric functions. The remaining parameters are kept free to modify the shape of curve and surface if required. The developed algorithm is verified mathematically and demonstrated graphically.
Monotone Data Visualization Using Rational Trigonometric Spline Interpolation
Directory of Open Access Journals (Sweden)
Farheen Ibraheem
2014-01-01
Full Text Available Rational cubic and bicubic trigonometric schemes are developed to conserve monotonicity of curve and surface data, respectively. The rational cubic function has four parameters in each subinterval, while the rational bicubic partially blended function has eight parameters in each rectangular patch. The monotonicity of curve and surface data is retained by developing constraints on some of these parameters in description of rational cubic and bicubic trigonometric functions. The remaining parameters are kept free to modify the shape of curve and surface if required. The developed algorithm is verified mathematically and demonstrated graphically.
Ultimate generalization to monotonicity for uniform convergence of trigonometric series
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
Chaundy and Jolliffe proved that if {a n } is a non-increasing (monotonic) real sequence with lim n →∞ a n = 0, then a necessary and sufficient condition for the uniform convergence of the series ∑∞ n=1 a n sin nx is lim n →∞ na n = 0. We generalize (or weaken) the monotonic condition on the coefficient sequence {a n } in this classical result to the so-called mean value bounded variation condition and prove that the generalized condition cannot be weakened further. We also establish an analogue to the generalized Chaundy-Jolliffe theorem in the complex space.
Vector optimization and monotone operators via convex duality recent advances
Grad, Sorin-Mihai
2014-01-01
This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.
Towards On-line Automated Semantic Scoring of English-Chinese Translation
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
Described and exemplified a semantic scoring system of students' on-line English-Chinese translation.To achieve accurate assessment, the system adopted a comprehensive method which combines semantic scoring with keyword matching scoring. Four kinds of words-verbs, adjectives, adverbs and "the rest" including nouns, pronouns, idioms, prepositions, etc. , are identified after parsing. The system treats different words tagged with different part of speech differently. Then it calculated the semantic similarity between these words of the standard versions and those of students'translations by the distinctive differences of the semantic features of these words with the aid of HowNet. The first semantic feature of verbs and the last semantic features of adjectives and adverbs are calculated. "The rest" is scored by keyword matching. The experiment results show that the semantic scoring system is applicable in fulfilling the task of scoring students'on-line English-Chinese translations.
Linguistic Semantics: An Introduction.
Lyons, John
The book, designed as a textbook for introductory study of semantics within college-level linguistics, focuses on the study of meaning as it is systematically encoded in the vocabulary and grammar of natural languages. The term "semantics" is presumed here to include pragmatics. An introductory section explains fundamental theoretical and…
DEFF Research Database (Denmark)
Grasten, Maj Lervad
2016-01-01
Book review of: Semantics of Statebuilding: Language, Meanings & Sovereignty / (eds) Nicolas Lemay-Hébert, Nicholas Onuf, Vojin Rakić, Petar Bojanić. Abingdon: Routledge, 2014. 200 pp.......Book review of: Semantics of Statebuilding: Language, Meanings & Sovereignty / (eds) Nicolas Lemay-Hébert, Nicholas Onuf, Vojin Rakić, Petar Bojanić. Abingdon: Routledge, 2014. 200 pp....
The Semantic Learning Organization
Sicilia, Miguel-Angel; Lytras, Miltiadis D.
2005-01-01
Purpose: The aim of this paper is introducing the concept of a "semantic learning organization" (SLO) as an extension of the concept of "learning organization" in the technological domain. Design/methodology/approach: The paper takes existing definitions and conceptualizations of both learning organizations and Semantic Web technology to develop…
Communication: General Semantics Perspectives.
Thayer, Lee, Ed.
This book contains the edited papers from the eleventh International Conference on General Semantics, titled "A Search for Relevance." The conference questioned, as a central theme, the relevance of general semantics in a world of wars and human misery. Reacting to a fundamental Korzybski-ian principle that man's view of reality is distorted by…
Pragmatics for formal semantics
DEFF Research Database (Denmark)
Danvy, Olivier
2011-01-01
This tech talk describes how to write and how to inter-derive formal semantics for sequential programming languages. The progress reported here is (1) concrete guidelines to write each formal semantics to alleviate their proof obligations, and (2) simple calculational tools to obtain a formal...
MediaNet: a multimedia information network for knowledge representation
Benitez, Ana B.; Smith, John R.; Chang, Shih-Fu
2000-10-01
In this paper, we present MediaNet, which is a knowledge representation framework that uses multimedia content for representing semantic and perceptual information. The main components of MediaNet include conceptual entities, which correspond to real world objects, and relationships among concepts. MediaNet allows the concepts and relationships to be defined or exemplified by multimedia content such as images, video, audio, graphics, and text. MediaNet models the traditional relationship types such as generalization and aggregation but adds additional functionality by modeling perceptual relationships based on feature similarity. For example, MediaNet allows a concept such as car to be defined as a type of a transportation vehicle, but which is further defined and illustrated through example images, videos and sounds of cars. In constructing the MediaNet framework, we have built on the basic principles of semiotics and semantic networks in addition to utilizing the audio-visual content description framework being developed as part of the MPEG-7 multimedia content description standard. By integrating both conceptual and perceptual representations of knowledge, MediaNet has potential to impact a broad range of applications that deal with multimedia content at the semantic and perceptual levels. In particular, we have found that MediaNet can improve the performance of multimedia retrieval applications by using query expansion, refinement and translation across multiple content modalities. In this paper, we report on experiments that use MediaNet in searching for images. We construct the MediaNet knowledge base using both WordNet and an image network built from multiple example images and extracted color and texture descriptors. Initial experimental results demonstrate improved retrieval effectiveness using MediaNet in a content-based retrieval system.
Sheth, A.; Henson, C.; Thirunarayan, K.
2008-12-01
Sensors are distributed across the globe leading to an avalanche of data about our environment. It is possible today to utilize networks of sensors to detect and identify a multitude of observations, from simple phenomena to complex events and situations. The lack of integration and communication between these networks, however, often isolates important data streams and intensifies the existing problem of too much data and not enough knowledge. With a view to addressing this problem, the Semantic Sensor Web (SSW) [1] proposes that sensor data be annotated with semantic metadata that will both increase interoperability and provide contextual information essential for situational knowledge. Kno.e.sis Center's approach to SSW is an evolutionary one. It adds semantic annotations to the existing standard sensor languages of the Sensor Web Enablement (SWE) defined by OGC. These annotations enhance primarily syntactic XML-based descriptions in OGC's SWE languages with microformats, and W3C's Semantic Web languages- RDF and OWL. In association with semantic annotation and semantic web capabilities including ontologies and rules, SSW supports interoperability, analysis and reasoning over heterogeneous multi-modal sensor data. In this presentation, we will also demonstrate a mashup with support for complex spatio-temporal-thematic queries [2] and semantic analysis that utilize semantic annotations, multiple ontologies and rules. It uses existing services (e.g., GoogleMap) and semantics enhanced SWE's Sensor Observation Service (SOS) over weather and road condition data from various sensors that are part of Ohio's transportation network. Our upcoming plans are to demonstrate end to end (heterogeneous sensor to application) semantics support and study scalability of SSW involving thousands of sensors to about a billion triples. Keywords: Semantic Sensor Web, Spatiotemporal thematic queries, Semantic Web Enablement, Sensor Observation Service [1] Amit Sheth, Cory Henson, Satya
Order Theoretical Semantic Recommendation
Energy Technology Data Exchange (ETDEWEB)
Joslyn, Cliff A.; Hogan, Emilie A.; Paulson, Patrick R.; Peterson, Elena S.; Stephan, Eric G.; Thomas, Dennis G.
2013-07-23
Mathematical concepts of order and ordering relations play multiple roles in semantic technologies. Discrete totally ordered data characterize both input streams and top-k rank-ordered recommendations and query output, while temporal attributes establish numerical total orders, either over time points or in the more complex case of startend temporal intervals. But also of note are the fully partially ordered data, including both lattices and non-lattices, which actually dominate the semantic strcuture of ontological systems. Scalar semantic similarities over partially-ordered semantic data are traditionally used to return rank-ordered recommendations, but these require complementation with true metrics available over partially ordered sets. In this paper we report on our work in the foundations of partial order measurement in ontologies, with application to top-k semantic recommendation in workflows.
On Quantifying Semantic Information
Directory of Open Access Journals (Sweden)
Simon D’Alfonso
2011-01-01
Full Text Available The purpose of this paper is to look at some existing methods of semantic information quantification and suggest some alternatives. It begins with an outline of Bar-Hillel and Carnap’s theory of semantic information before going on to look at Floridi’s theory of strongly semantic information. The latter then serves to initiate an in-depth investigation into the idea of utilising the notion of truthlikeness to quantify semantic information. Firstly, a couple of approaches to measure truthlikeness are drawn from the literature and explored, with a focus on their applicability to semantic information quantification. Secondly, a similar but new approach to measure truthlikeness/information is presented and some supplementary points are made.
MONOTONE ITERATION FOR ELLIPTIC PDEs WITH DISCONTINUOUS NONLINEAR TERMS
Institute of Scientific and Technical Information of China (English)
Zou Qingsong
2005-01-01
In this paper, we use monotone iterative techniques to show the existence of maximal or minimal solutions of some elliptic PDEs with nonlinear discontinuous terms. As the numerical analysis of this PDEs is concerned, we prove the convergence of discrete extremal solutions.
Modeling non-monotone risk aversion using SAHARA utility functions
A. Chen; A. Pelsser; M. Vellekoop
2011-01-01
We develop a new class of utility functions, SAHARA utility, with the distinguishing feature that it allows absolute risk aversion to be non-monotone and implements the assumption that agents may become less risk averse for very low values of wealth. The class contains the well-known exponential and
On Uniqueness of Conjugacy of Continuous and Piecewise Monotone Functions
Directory of Open Access Journals (Sweden)
Ciepliński Krzysztof
2009-01-01
Full Text Available We investigate the existence and uniqueness of solutions of the functional equation , , where are closed intervals, and , are some continuous piecewise monotone functions. A fixed point principle plays a crucial role in the proof of our main result.
L^p solutions of reflected BSDEs under monotonicity condition
Rozkosz, Andrzej
2012-01-01
We prove existence and uniqueness of L^p solutions of reflected backward stochastic differential equations with p-integrable data and generators satisfying the monotonicity condition. We also show that the solution may be approximated by the penalization method. Our results are new even in the classical case p=2.
A monotonic method for solving nonlinear optimal control problems
Salomon, Julien
2009-01-01
Initially introduced in the framework of quantum control, the so-called monotonic algorithms have shown excellent numerical results when dealing with various bilinear optimal control problems. This paper aims at presenting a unified formulation of such procedures and the intrinsic assumptions they require. In this framework, we prove the feasibility of the general algorithm. Finally, we explain how these assumptions can be relaxed.
On Some Conjectures on the Monotonicity of Some Arithmetical Sequences
2012-01-01
THE MONOTONICITY OF SOME ARITHMETICAL SEQUENCES ∗ Florian Luca † Centro de Ciencias Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089...visit of P. S. to the Centro de Ciencias Matemáticas de la UNAM in Morelia in August 2012. During the preparation of this paper, F. L. was supported in
Interval Routing and Minor-Monotone Graph Parameters
Bakker, E.M.; Bodlaender, H.L.; Tan, R.B.; Leeuwen, J. van
2006-01-01
We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the k
Multivariate Regression with Monotone Missing Observation of the Dependent Variables
Raats, V.M.; van der Genugten, B.B.; Moors, J.J.A.
2002-01-01
Multivariate regression is discussed, where the observations of the dependent variables are (monotone) missing completely at random; the explanatory variables are assumed to be completely observed.We discuss OLS-, GLS- and a certain form of E(stimated) GLS-estimation.It turns out that
Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes
Norde, H.W.; Moretti, S.; Tijs, S.H.
2001-01-01
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegati
Size monotonicity and stability of the core in hedonic games
Dimitrov, Dinko; Sung, Shao Chin
2011-01-01
We show that the core of each strongly size monotonic hedonic game is not empty and is externally stable. This is in sharp contrast to other sufficient conditions for core non-emptiness which do not even guarantee the existence of a stable set in such games.
Monotone missing data and repeated controls of fallible authors
Raats, V.M.
2004-01-01
Chapters 2 and 3 focus on repeated audit controls with categorical variables. Chapter 4 and 5 introduce and analyse a very general multivariate regression model for (monotone) missing data. In the final Chapter 6 the previous chapters are combined into a more realistic model for repeated audit contr
A POTENTIAL REDUCTION ALGORITHM FOR MONOTONE VARIATIONAL INEQUALITY PROBLEMS
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
A potential reduction algorithm is proposed for the solution of monotone variational inequality problems. At each step of the algorithm, a system of linear equations is solved to get the search direction and the Armijo's rule is used to determine the stepsize.It is proved that the algorithm is globally convergent. Computational results are reported.
Relaxing monotonicity in the identification of local average treatment effects
DEFF Research Database (Denmark)
Huber, Martin; Mellace, Giovanni
In heterogeneous treatment effect models with endogeneity, the identification of the local average treatment effect (LATE) typically relies on an instrument that satisfies two conditions: (i) joint independence of the potential post-instrument variables and the instrument and (ii) monotonicity...
Incorporating "Unconscious Reanalysis" into an Incremental, Monotonic Parser
Sturt, P
1995-01-01
This paper describes an implementation based on a recent model in the psycholinguistic literature. We define a parsing operation which allows the reanalysis of dependencies within an incremental and monotonic processing architecture, and discuss search strategies for its application in a head-initial language (English) and a head-final language (Japanese).
Interval Routing and Minor-Monotone Graph Parameters
Bakker, E.M.; Bodlaender, H.L.; Tan, R.B.; Leeuwen, J. van
2006-01-01
We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the
Reasoning Biases, Non-Monotonic Logics, and Belief Revision
Dutilh Novaes, Catarina; Veluwenkamp, Herman
2017-01-01
A range of formal models of human reasoning have been proposed in a number of fields such as philosophy, logic, artificial intelligence, computer science, psychology, cognitive science etc.: various logics (epistemic logics; non-monotonic logics), probabilistic systems (most notably, but not exclusi
Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems
Cattuto, Ciro; Hotho, Andreas; Stumme, Gerd
2008-01-01
Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose differe...
A Semantic Graph Query Language
Energy Technology Data Exchange (ETDEWEB)
Kaplan, I L
2006-10-16
Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.
The cumulative semantic cost does not reflect lexical selection by competition☆
Navarrete, Eduardo; Mahon, Bradford Z.; Caramazza, Alfonso
2010-01-01
The cumulative semantic cost describes a phenomenon in which picture naming latencies increase monotonically with each additional within-category item that is named in a sequence of pictures. Here we test whether the cumulative semantic cost requires the assumption of lexical selection by competition. In Experiment 1 participants named a sequence of pictures, while in Experiment 2 participants named words instead of pictures, preceded by a gender marked determiner. We replicate the basic cumulative semantic cost with pictures (Exp. 1) and show that there is no cumulative semantic cost for word targets (Exp. 2). This pattern was replicated in Experiment 3 in which pictures and words were named along with their gender marked definite determiner, and were intermingled within the same experimental design. In addition, Experiment 3 showed that while picture naming induces a cumulative semantic cost for subsequently named words, word naming does not induce a cumulative semantic cost for subsequently named pictures. These findings suggest that the cumulative semantic cost arises prior to lexical selection and that the effect arises due to incremental changes to the connection weights between semantic and lexical representations. PMID:20347062
UML 2 Semantics and Applications
Lano, Kevin
2009-01-01
A coherent and integrated account of the leading UML 2 semantics work and the practical applications of UML semantics development With contributions from leading experts in the field, the book begins with an introduction to UML and goes on to offer in-depth and up-to-date coverage of: The role of semantics Considerations and rationale for a UML system model Definition of the UML system model UML descriptive semantics Axiomatic semantics of UML class diagrams The object constraint language Axiomatic semantics of state machines A coalgebraic semantic framework for reasoning about interaction des
Non-monotonic effect of confinement on the glass transition
Varnik, Fathollah; Franosch, Thomas
2016-04-01
The relaxation dynamics of glass forming liquids and their structure are influenced in the vicinity of confining walls. This effect has mostly been observed to be a monotonic function of the slit width. Recently, a qualitatively new behaviour has been uncovered by Mittal and coworkers, who reported that the single particle dynamics in a hard-sphere fluid confined in a planar slit varies in a non-monotonic way as the slit width is decreased from five to roughly two particle diametres (Mittal et al 2008 Phys. Rev. Lett. 100 145901). In view of the great potential of this effect for applications in those fields of science and industry, where liquids occur under strong confinement (e.g. nano-technology), the number of researchers studying various aspects and consequences of this non-monotonic behaviour has been rapidly growing. This review aims at providing an overview of the research activity in this newly emerging field. We first briefly discuss how competing mechanisms such as packing effects and short-range attraction may lead to a non-monotonic glass transition scenario in the bulk. We then analyse confinement effects on the dynamics of fluids using a thermodynamic route which relates the single particle dynamics to the excess entropy. Moreover, relating the diffusive dynamics to the Widom’s insertion probability, the oscillations of the local dynamics with density at moderate densities are fairly well described. At high densities belonging to the supercooled regime, however, this approach breaks down signaling the onset of strongly collective effects. Indeed, confinement introduces a new length scale which in the limit of high densities and small pore sizes competes with the short-range local order of the fluid. This gives rise to a non-monotonic dependence of the packing structure on confinement, with a corresponding effect on the dynamics of structural relaxation. This non-monotonic effect occurs also in the case of a cone-plate type channel, where the degree
Gabbay, Dov M
2013-01-01
This text offers an extension to the traditional Kripke semantics for non-classical logics by adding the notion of reactivity. Reactive Kripke models change their accessibility relation as we progress in the evaluation process of formulas in the model. This feature makes the reactive Kripke semantics strictly stronger and more applicable than the traditional one. Here we investigate the properties and axiomatisations of this new and most effective semantics, and we offer a wide landscape of applications of the idea of reactivity. Applied topics include reactive automata, reactive grammars, rea
Benchmarking semantic web technology
García-Castro, R
2009-01-01
This book addresses the problem of benchmarking Semantic Web Technologies; first, from a methodological point of view, proposing a general methodology to follow in benchmarking activities over Semantic Web Technologies and, second, from a practical point of view, presenting two international benchmarking activities that involved benchmarking the interoperability of Semantic Web technologies using RDF(S) as the interchange language in one activity and OWL in the other.The book presents in detail how the different resources needed for these interoperability benchmarking activities were defined:
Semantic Web Evaluation Challenge
2014-01-01
This book constitutes the thoroughly refereed post conference proceedings of the first edition of the Semantic Web Evaluation Challenge, SemWebEval 2014, co-located with the 11th Extended Semantic Web conference, held in Anissaras, Crete, Greece, in May 2014. This book includes the descriptions of all methods and tools that competed at SemWebEval 2014, together with a detailed description of the tasks, evaluation procedures and datasets. The contributions are grouped in three areas: semantic publishing (sempub), concept-level sentiment analysis (ssa), and linked-data enabled recommender systems (recsys).
Roget's Thesaurus and Semantic Similarity
Jarmasz, Mario
2012-01-01
We have implemented a system that measures semantic similarity using a computerized 1987 Roget's Thesaurus, and evaluated it by performing a few typical tests. We compare the results of these tests with those produced by WordNet-based similarity measures. One of the benchmarks is Miller and Charles' list of 30 noun pairs to which human judges had assigned similarity measures. We correlate these measures with those computed by several NLP systems. The 30 pairs can be traced back to Rubenstein and Goodenough's 65 pairs, which we have also studied. Our Roget's-based system gets correlations of .878 for the smaller and .818 for the larger list of noun pairs; this is quite close to the .885 that Resnik obtained when he employed humans to replicate the Miller and Charles experiment. We further evaluate our measure by using Roget's and WordNet to answer 80 TOEFL, 50 ESL and 300 Reader's Digest questions: the correct synonym must be selected amongst a group of four words. Our system gets 78.75%, 82.00% and 74.33% of ...
Compactness theorems of fuzzy semantics
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
The relationship among diverse fuzzy semantics vs. the corresponding logic consequence operators has been analyzed systematically. The results that compactness and logical compactness of fuzzy semantics are equivalent to compactness and continuity of the logic consequence operator induced by the semantics respectively have been proved under certain conditions. A general compactness theorem of fuzzy semantics have been established which says that every fuzzy semantics defined on a free algebra with members corresponding to continuous functions is compact.
A Hybrid Approach to Proving Memory Reference Monotonicity
Oancea, Cosmin E.
2013-01-01
Array references indexed by non-linear expressions or subscript arrays represent a major obstacle to compiler analysis and to automatic parallelization. Most previous proposed solutions either enhance the static analysis repertoire to recognize more patterns, to infer array-value properties, and to refine the mathematical support, or apply expensive run time analysis of memory reference traces to disambiguate these accesses. This paper presents an automated solution based on static construction of access summaries, in which the reference non-linearity problem can be solved for a large number of reference patterns by extracting arbitrarily-shaped predicates that can (in)validate the reference monotonicity property and thus (dis)prove loop independence. Experiments on six benchmarks show that our general technique for dynamic validation of the monotonicity property can cover a large class of codes, incurs minimal run-time overhead and obtains good speedups. © 2013 Springer-Verlag.
Measurement of non-monotonic Casimir forces between silicon nanostructures
Tang, L.; Wang, M.; Ng, C. Y.; Nikolic, M.; Chan, C. T.; Rodriguez, A. W.; Chan, H. B.
2017-01-01
Casimir forces are of fundamental interest because they originate from quantum fluctuations of the electromagnetic field. Apart from controlling this force via the optical properties of materials, a number of novel geometries have been proposed to generate repulsive and/or non-monotonic Casimir forces between bodies separated by vacuum gaps. Experimental realization of these geometries, however, is hindered by the difficulties in alignment when the bodies are brought into close proximity. Here, using an on-chip platform with integrated force sensors and actuators, we circumvent the alignment problem and measure the Casimir force between two surfaces with nanoscale protrusions. We demonstrate that the force depends non-monotonically on the displacement. At some displacements, the Casimir force leads to an effective stiffening of the nanomechanical spring. Our findings pave the way for exploiting the Casimir force in nanomechanical systems using structures of complex and non-conventional shapes.
A Monotonic Precise Current DAC for Sensor Applications
Directory of Open Access Journals (Sweden)
P. Horsky
2008-12-01
Full Text Available In this paper a 17 bit monotonic precise current DAC for sensor applications is described. It is working in a harsh automotive environment in a wide temperature range with high output voltage swing and low current consumption. To guarantee monotonicity current division and segmentation techniques are used. To improve the output impedance, the accuracy and the voltage compliance of the DAC, two active cascoding loops and one follower loop are used. The resolution of the DAC is further increased by applying pulse width modulation to one fine LSB current. To achieve low power consumption unused coarse current sources are switched off. Several second order technological effects influencing final performance and circuits dealing with them are discussed.
Computation of Optimal Monotonicity Preserving General Linear Methods
Ketcheson, David I.
2009-07-01
Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal methods even among classes involving very high order accuracy and that use many steps and/or stages. The optimality of some recently proposed methods is verified, and many more efficient methods are found. We use similar algorithms to find optimal strong stability preserving linear multistep methods of both explicit and implicit type, including methods for hyperbolic PDEs that use downwind-biased operators.
Rational functions with maximal radius of absolute monotonicity
Loczi, Lajos
2014-05-19
We study the radius of absolute monotonicity R of rational functions with numerator and denominator of degree s that approximate the exponential function to order p. Such functions arise in the application of implicit s-stage, order p Runge-Kutta methods for initial value problems and the radius of absolute monotonicity governs the numerical preservation of properties like positivity and maximum-norm contractivity. We construct a function with p=2 and R>2s, disproving a conjecture of van de Griend and Kraaijevanger. We determine the maximum attainable radius for functions in several one-parameter families of rational functions. Moreover, we prove earlier conjectured optimal radii in some families with 2 or 3 parameters via uniqueness arguments for systems of polynomial inequalities. Our results also prove the optimality of some strong stability preserving implicit and singly diagonally implicit Runge-Kutta methods. Whereas previous results in this area were primarily numerical, we give all constants as exact algebraic numbers.
On Uniqueness of Conjugacy of Continuous and Piecewise Monotone Functions
Directory of Open Access Journals (Sweden)
Krzysztof Ciepliński
2009-01-01
Full Text Available We investigate the existence and uniqueness of solutions φ:I→J of the functional equation φ(f(x=F(φ(x, x∈I, where I,J are closed intervals, and f:I→I, F:J→J are some continuous piecewise monotone functions. A fixed point principle plays a crucial role in the proof of our main result.
Block Monotone Iterative Algorithms for Variational Inequalities with Nonlinear Operators
Institute of Scientific and Technical Information of China (English)
Ming-hui Ren; Jin-ping Zeng
2008-01-01
Some block iterative methods for solving variational inequalities with nonlinear operators are proposed. Monotone convergence of the algorithms is obtained. Some comparison theorems are also established.Compared with the research work in given by Pao in 1995 for nonlinear equations and research work in given by Zeng and Zhou in 2002 for elliptic variational inequalities, the algorithms proposed in this paper are independent of the boundedness of the derivatives of the nonlinear operator.
Monotonic Property in Field Algebra of G-Spin Model
Institute of Scientific and Technical Information of China (English)
蒋立宁
2003-01-01
Let F be the field algebra of G-spin model, D(G) the double algebra of a finite group G and D(H) the sub-Hopf algerba of D(G) determined by the subgroup H of G. The paper builds a correspondence between D(H) and the D(H)-invariant sub-C*-algebra AH in F, and proves that the correspondence is strictly monotonic.
Nonparametric estimation for hazard rate monotonously decreasing system
Institute of Scientific and Technical Information of China (English)
Han Fengyan; Li Weisong
2005-01-01
Estimation of density and hazard rate is very important to the reliability analysis of a system. In order to estimate the density and hazard rate of a hazard rate monotonously decreasing system, a new nonparametric estimator is put forward. The estimator is based on the kernel function method and optimum algorithm. Numerical experiment shows that the method is accurate enough and can be used in many cases.
Stability and monotonicity of Lotka-Volterra type operators
Mukhamedov, Farrukh
2009-01-01
In the present paper, we study Lotka-Volterra (LV) type operators defined in finite dimensional simplex. We prove that any LV type operator is a surjection of the simplex. After, we introduce a new class of LV-type operators, called $M$LV type. We prove convergence of their trajectories and study certain its properties. Moreover, we show that such kind of operators have totaly different behavior than ${\\mathbf{f}}$-monotone LV type operators.
Institute of Scientific and Technical Information of China (English)
李琦
2014-01-01
Semantics is the study of the meanings of words and sentences. While word is the most basic unit in every language and the understanding of the word meaning is the most important problem in translation. Therefore, the analysis of semantics just provides a very direct approach to doing translation. In this paper, I’d like to focus on the three kinds of word meaning in transla- tion, the ambiguities caused by the word meaning and how to deal with such ambiguities.
Monotone traveling wavefronts of the KPP-Fisher delayed equation
Gomez, Adrian; Trofimchuk, Sergei
In the early 2000's, Gourley (2000), Wu et al. (2001), Ashwin et al. (2002) initiated the study of the positive wavefronts in the delayed Kolmogorov-Petrovskii-Piskunov-Fisher equation u(t,x)=Δu(t,x)+u(t,x)(1-u(t-h,x)), u⩾0, x∈R. Since then, this model has become one of the most popular objects in the studies of traveling waves for the monostable delayed reaction-diffusion equations. In this paper, we give a complete solution to the problem of existence and uniqueness of monotone waves in Eq. (*). We show that each monotone traveling wave can be found via an iteration procedure. The proposed approach is based on the use of special monotone integral operators (which are different from the usual Wu-Zou operator) and appropriate upper and lower solutions associated to them. The analysis of the asymptotic expansions of the eventual traveling fronts at infinity is another key ingredient of our approach.
Solving the power flow equations: a monotone operator approach
Energy Technology Data Exchange (ETDEWEB)
Dvijotham, Krishnamurthy [California Inst. of Technology (CalTech), Pasadena, CA (United States); Low, Steven [California Inst. of Technology (CalTech), Pasadena, CA (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-07-21
The AC power flow equations underlie all operational aspects of power systems. They are solved routinely in operational practice using the Newton-Raphson method and its variants. These methods work well given a good initial “guess” for the solution, which is always available in normal system operations. However, with the increase in levels of intermittent generation, the assumption of a good initial guess always being available is no longer valid. In this paper, we solve this problem using the theory of monotone operators. We show that it is possible to compute (using an offline optimization) a “monotonicity domain” in the space of voltage phasors. Given this domain, there is a simple efficient algorithm that will either find a solution in the domain, or provably certify that no solutions exist in it. We validate the approach on several IEEE test cases and demonstrate that the offline optimization can be performed tractably and the computed “monotonicity domain” includes all practically relevant power flow solutions.
Disjunctive logic and semantics of disjunctive logic programs
Institute of Scientific and Technical Information of China (English)
沈一栋
1997-01-01
In common sense reasoning with incomplete knowledge bases, conclusions are made by defaultHowever, it is observed that when the negation-by-default operator not is defined as not provable , the disjunctive logic program { a V b, not a, not b} should be consistent because a being not provable and b being nor provable does not imply a V b being riot provable. Such an observation is significant for non-monotonic reasoning, but none of the major current semantics for disjunctive logic programs is able to support it because they are all based on classical first-order logic in which assuming not a and not b implies assuming no: (a V b) A new first-order logic (disjunctive logic ) is developed that fully complies with this observation and new semantics for disjunctive logic programs are established This theory is able to formalize and solve some paradoxical problems, such as the lottery paradox
Bruza, P D
2006-01-01
This article is an exploratory account of the the non-monotonic behaviour of conceptual associations in the light of context. Computational approximations of conceptual space are furnished by semantic space models which are emerging from the fields of cognition and computational linguistics. Semantic space models not only provide a cognitively motivated basis to underpin human practical reasoning, but from a mathematical perspective, they are real-valued Hilbert spaces. This introduces the highly speculative prospect of formalizing aspects of human practical reasoning via quantum mechanics. This account focuses on how to formalize context effects in relation to concepts as well as keeping an eye on operational issues.
Directory of Open Access Journals (Sweden)
Feng Qi
2014-10-01
Full Text Available The authors find the absolute monotonicity and complete monotonicity of some functions involving trigonometric functions and related to estimates the lower bounds of the first eigenvalue of Laplace operator on Riemannian manifolds.
Non-monotonic reasoning in conceptual modeling and ontology design: A proposal
CSIR Research Space (South Africa)
Casini, G
2013-06-01
Full Text Available and modeling of defeasible information and non-monotonic reasoning services. Here we formalize a possible way of introducing non-monotonic reasoning into ORM2 schemas, enriching the language with special set of new constraints....
Mixed Monotonicity of Partial First-In-First-Out Traffic Flow Models
Coogan, Samuel; Arcak, Murat; Kurzhanskiy, Alexander A.
2015-01-01
In vehicle traffic networks, congestion on one outgoing link of a diverging junction often impedes flow to other outgoing links, a phenomenon known as the first-in-first-out (FIFO) property. Simplified traffic models that do not account for the FIFO property result in monotone dynamics for which powerful analysis techniques exist. FIFO models are in general not monotone, but have been shown to be mixed monotone - a generalization of monotonicity that enables similarly powerful analysis techni...
Towards the Methodology for Extending Princeton WordNet
Directory of Open Access Journals (Sweden)
Ewa Katarzyna Rudnicka
2015-12-01
Full Text Available Towards the Methodology for Extending Princeton WordNet The paper presents the methodology and results of the first, pilot stage of the extension of Princeton WordNet, a huge electronic English language thesaurus and lexico-semantic network based on synsets, ie. sets of synonymous lexical units, or lemma sense pairs. The necessity for such extension arose in the course of mapping plWordNet (Polish WordNet — Słowosieć onto Princeton WordNet, which produced a large number of inter-lingual hyponymy links signalling differences in the structure and lexical coverage of the two networks. The proposed strategy uses I-hyponymy links as pointers to presumed gaps in the lexical coverage of PrincetonWordNet and offers strategies of filling them in with new lexical units and synsets.
Disambiguating bilingual nominal entries against WordNet
Rigau, G; Rigau, German; Agirre, Eneko
1995-01-01
This paper explores the acquisition of conceptual knowledge from bilingual dictionaries (French/English, Spanish/English and English/Spanish) using a pre-existing broad coverage Lexical Knowledge Base (LKB) WordNet. Bilingual nominal entries are disambiguated agains WordNet, therefore linking the bilingual dictionaries to WordNet yielding a multilingual LKB (MLKB). The resulting MLKB has the same structure as WordNet, but some nodes are attached additionally to disambiguated vocabulary of other languages. Two different, complementary approaches are explored. In one of the approaches each entry of the dictionary is taken in turn, exploiting the information in the entry itself. The inferential capability for disambiguating the translation is given by Semantic Density over WordNet. In the other approach, the bilingual dictionary was merged with WordNet, exploiting mainly synonymy relations. Each of the approaches was used in a different dictionary. Both approaches attain high levels of precision on their own, sh...
Attention trees and semantic paths
Giusti, Christian; Pieroni, Goffredo G.; Pieroni, Laura
2007-02-01
In the last few decades several techniques for image content extraction, often based on segmentation, have been proposed. It has been suggested that under the assumption of very general image content, segmentation becomes unstable and classification becomes unreliable. According to recent psychological theories, certain image regions attract the attention of human observers more than others and, generally, the image main meaning appears concentrated in those regions. Initially, regions attracting our attention are perceived as a whole and hypotheses on their content are formulated; successively the components of those regions are carefully analyzed and a more precise interpretation is reached. It is interesting to observe that an image decomposition process performed according to these psychological visual attention theories might present advantages with respect to a traditional segmentation approach. In this paper we propose an automatic procedure generating image decomposition based on the detection of visual attention regions. A new clustering algorithm taking advantage of the Delaunay- Voronoi diagrams for achieving the decomposition target is proposed. By applying that algorithm recursively, starting from the whole image, a transformation of the image into a tree of related meaningful regions is obtained (Attention Tree). Successively, a semantic interpretation of the leaf nodes is carried out by using a structure of Neural Networks (Neural Tree) assisted by a knowledge base (Ontology Net). Starting from leaf nodes, paths toward the root node across the Attention Tree are attempted. The task of the path consists in relating the semantics of each child-parent node pair and, consequently, in merging the corresponding image regions. The relationship detected in this way between two tree nodes generates, as a result, the extension of the interpreted image area through each step of the path. The construction of several Attention Trees has been performed and partial
Foundations of semantic web technologies
Hitzler, Pascal; Rudolph, Sebastian
2009-01-01
The Quest for Semantics Building Models Calculating with Knowledge Exchanging Information Semanic Web Technologies RESOURCE DESCRIPTION LANGUAGE (RDF)Simple Ontologies in RDF and RDF SchemaIntroduction to RDF Syntax for RDF Advanced Features Simple Ontologies in RDF Schema Encoding of Special Data Structures An ExampleRDF Formal Semantics Why Semantics? Model-Theoretic Semantics for RDF(S) Syntactic Reasoning with Deduction Rules The Semantic Limits of RDF(S)WEB ONTOLOGY LANGUAGE (OWL) Ontologies in OWL OWL Syntax and Intuitive Semantics OWL Species The Forthcoming OWL 2 StandardOWL Formal Sem
UML活动图的形式语义%The Formal Semantics of an UML Activity Diagram
Institute of Scientific and Technical Information of China (English)
梁义芝; 王延章; 刘云飞
2004-01-01
Due to lack of strictly defined formal semantics, an UML activity diagram is unsuitable for the tasks of formal analysis, verification and assertion on the system it describes. In this paper, Petri net is used to define the formal semantics of an UML activity diagram containing object flow states, laying a foundation for the precise description and analysis of a workflow system.
Image Semantic Automatic Annotation by Relevance Feedback
Institute of Scientific and Technical Information of China (English)
ZHANG Tong-zhen; SHEN Rui-min
2007-01-01
A large semantic gap exists between content based index retrieval (CBIR) and high-level semantic, additional semantic information should be attached to the images, it refers in three respects including semantic representation model, semantic information building and semantic retrieval techniques. In this paper, we introduce an associated semantic network and an automatic semantic annotation system. In the system, a semantic network model is employed as the semantic representation model, it uses semantic keywords, linguistic ontology and low-level features in semantic similarity calculating. Through several times of users' relevance feedback, semantic network is enriched automatically. To speed up the growth of semantic network and get a balance annotation, semantic seeds and semantic loners are employed especially.
Hughes, S.; Crichton, D.; Thieman, J.; Ramirez, P.; King, T.; Weiss, M.
2005-12-01
The Semantic SPASE (Space Physics Archive Search and Extract) prototype demonstrates the use of semantic web technologies to capture, document, and manage the SPASE data model, support facet- and text-based search, and provide flexible and intuitive user interfaces. The SPASE data model, under development since late 2003 by a consortium of space physics domain experts, is intended to serve as the basis for interoperability between independent data systems. To develop the Semantic SPASE prototype, the data model was first analyzed to determine the inherit object classes and their attributes. These were entered into Stanford Medical Informatics' Protege ontology tool and annotated using definitions from the SPASE documentation. Further analysis of the data model resulted in the addition of class relationships. Finally attributes and relationships that support broad-scope interoperability were added from research associated with the Object-Oriented Data Technology task. To validate the ontology and produce a knowledge base, example data products were ingested. The capture of the data model as an ontology results in a more formal specification of the model. The Protege software is also a powerful management tool and supports plug-ins that produce several graphical notations as output. The stated purpose of the semantic web is to support machine understanding of web-based information. Protege provides an export capability to RDF/XML and RDFS/XML for this purpose. Several research efforts use RDF/XML knowledge bases to provide semantic search. MIT's Simile/Longwell project provides both facet- and text-based search using a suite of metadata browsers and the text-based search engine Lucene. Using the Protege generated RDF knowledge-base a semantic search application was easily built and deployed to run as a web application. Configuration files specify the object attributes and values to be designated as facets (i.e. search) constraints. Semantic web technologies provide
Directory of Open Access Journals (Sweden)
Zofija Babickienė
2012-06-01
Full Text Available In this article, semantic models of gerund in the Lithuanian language are being investigated. Their productivity and the reasons of their change in the Lithuanian language are identified. The tendency to use gerund semantic structure in noun constructions is typical not only in Greek or Latin languages but also in English, Russian, etc. Regular polysemy is regarded as semantic derivation, i. e. shifting from main meanings to derivative ones. The object of this investigation is the usage patterns of gerunds which bear both the meaning of a verb and a noun. The examples for the present study have been gathered from the language of different Lithuanian dialects as well as from the Dictionary of the Lithuanian language (different volumes, etc. The research results reveal that semantic changes of object and result are the most productive, whereas mood or time semantic model proved to be not so productive. The productivity of regular models depends on the fact that there are suffix derivatives which have the meaning of a result. The research shows that scientific style and language of different dialects are rich in the use of gerund.
Semantic home video categorization
Min, Hyun-Seok; Lee, Young Bok; De Neve, Wesley; Ro, Yong Man
2009-02-01
Nowadays, a strong need exists for the efficient organization of an increasing amount of home video content. To create an efficient system for the management of home video content, it is required to categorize home video content in a semantic way. So far, a significant amount of research has already been dedicated to semantic video categorization. However, conventional categorization approaches often rely on unnecessary concepts and complicated algorithms that are not suited in the context of home video categorization. To overcome the aforementioned problem, this paper proposes a novel home video categorization method that adopts semantic home photo categorization. To use home photo categorization in the context of home video, we segment video content into shots and extract key frames that represent each shot. To extract the semantics from key frames, we divide each key frame into ten local regions and extract lowlevel features. Based on the low level features extracted for each local region, we can predict the semantics of a particular key frame. To verify the usefulness of the proposed home video categorization method, experiments were performed with home video sequences, labeled by concepts part of the MPEG-7 VCE2 dataset. To verify the usefulness of the proposed home video categorization method, experiments were performed with 70 home video sequences. For the home video sequences used, the proposed system produced a recall of 77% and an accuracy of 78%.
Supporting Personal Semantic Annotations in P2P Semantic Wikis
Torres, Diego; Skaf-Molli, Hala; Díaz, Alicia; Molli, Pascal
In this paper, we propose to extend Peer-to-Peer Semantic Wikis with personal semantic annotations. Semantic Wikis are one of the most successful Semantic Web applications. In semantic wikis, wikis pages are annotated with semantic data to facilitate the navigation, information retrieving and ontology emerging. Semantic data represents the shared knowledge base which describes the common understanding of the community. However, in a collaborative knowledge building process the knowledge is basically created by individuals who are involved in a social process. Therefore, it is fundamental to support personal knowledge building in a differentiated way. Currently there are no available semantic wikis that support both personal and shared understandings. In order to overcome this problem, we propose a P2P collaborative knowledge building process and extend semantic wikis with personal annotations facilities to express personal understanding. In this paper, we detail the personal semantic annotation model and show its implementation in P2P semantic wikis. We also detail an evaluation study which shows that personal annotations demand less cognitive efforts than semantic data and are very useful to enrich the shared knowledge base.
Monotonicity Formula and Regularity for General Free Discontinuity Problems
Bucur, Dorin; Luckhaus, Stephan
2014-02-01
We give a general monotonicity formula for local minimizers of free discontinuity problems which have a critical deviation from minimality, of order d - 1. This result allows us to prove partial regularity results (that is closure and density estimates for the jump set) for a large class of free discontinuity problems involving general energies associated to the jump set, as for example free boundary problems with Robin conditions. In particular, we give a short proof to the De Giorgi-Carriero-Leaci result for the Mumford-Shah functional.
The Non-Monotonic Effect of Financing Constraints on Investment
DEFF Research Database (Denmark)
Hirth, Stefan; Viswanatha, Marc
We analyze investment timing in a discrete-time framework with two possible investment dates, which is an extension of the model by Lyandres (2007). While Lyandres could only show non-monotonicity of investment in market frictions, we derive an investment threshold that is U-shaped in the firm's ......'s liquid funds, a result similar to the infinite-horizon model by Boyle and Guthrie (2003). However, due to the tractability of our model, we can more clearly explain the relevant trade-offs leading to the U-shape....
Contribution to the ergodic theory of piecewise monotone continuous maps
Faller, Bastien
2008-01-01
This thesis is devoted to the ergodic theory of the piecewise monotone continuous maps of the interval. The coding is a classical approach for these maps. Thanks to the coding, we get a symbolic dynamical system which is almost isomorphic to the initial dynamical system. The principle of the coding is very similar to the one of expansion of real numbers. We first define the coding in a perspective similar to the one of the expansions of real numbers; this perspective was already adopted by Ré...
Stability of generalized monotonicity with respect to their characterizations
An, P T
2002-01-01
We show that known types of generalized monotone maps are not stable with respect to their characterizations (i.e., the characterizations are not maintained during an arbitrary map of this type is disturbed by an element with sufficiently small norm) then introduce s-quasimonotone maps, which are stable with respect to their characterization. For gradient maps, s-quasimonotonicity is related to s-quasiconvexity of the underlying function. A necessary and sufficient condition for a univariate polynomial to be s-quasimonotone is given. Furthermore, some stability properties of a-quasiconvex functions are presented.
Deterministic homogenization of parabolic monotone operators with time dependent coefficients
Directory of Open Access Journals (Sweden)
Gabriel Nguetseng
2004-06-01
Full Text Available We study, beyond the classical periodic setting, the homogenization of linear and nonlinear parabolic differential equations associated with monotone operators. The usual periodicity hypothesis is here substituted by an abstract deterministic assumption characterized by a great relaxation of the time behaviour. Our main tool is the recent theory of homogenization structures by the first author, and our homogenization approach falls under the two-scale convergence method. Various concrete examples are worked out with a view to pointing out the wide scope of our approach and bringing the role of homogenization structures to light.
Semantic Parameters of Split Intransitivity.
Van Valin, Jr., Robert D.
1990-01-01
This paper argues that split-intransitive phenomena are better explained in semantic terms. A semantic analysis is carried out in Role and Reference Grammar, which assumes the theory of verb classification proposed in Dowty 1979. (49 references) (JL)
Time-dependent, non-monotonic response of warm convective cloud fields to changes in aerosol loading
Dagan, Guy; Koren, Ilan; Altaratz, Orit; Heiblum, Reuven H.
2017-06-01
Large eddy simulations (LESs) with bin microphysics are used here to study cloud fields' sensitivity to changes in aerosol loading and the time evolution of this response. Similarly to the known response of a single cloud, we show that the mean field properties change in a non-monotonic trend, with an optimum aerosol concentration for which the field reaches its maximal water mass or rain yield. This trend is a result of competition between processes that encourage cloud development versus those that suppress it. However, another layer of complexity is added when considering clouds' impact on the field's thermodynamic properties and how this is dependent on aerosol loading. Under polluted conditions, rain is suppressed and the non-precipitating clouds act to increase atmospheric instability. This results in warming of the lower part of the cloudy layer (in which there is net condensation) and cooling of the upper part (net evaporation). Evaporation at the upper part of the cloudy layer in the polluted simulations raises humidity at these levels and thus amplifies the development of the next generation of clouds (preconditioning effect). On the other hand, under clean conditions, the precipitating clouds drive net warming of the cloudy layer and net cooling of the sub-cloud layer due to rain evaporation. These two effects act to stabilize the atmospheric boundary layer with time (consumption of the instability). The evolution of the field's thermodynamic properties affects the cloud properties in return, as shown by the migration of the optimal aerosol concentration toward higher values.
Hutchison, Keith A; Balota, David A; Neely, James H; Cortese, Michael J; Cohen-Shikora, Emily R; Tse, Chi-Shing; Yap, Melvin J; Bengson, Jesse J; Niemeyer, Dale; Buchanan, Erin
2013-12-01
Speeded naming and lexical decision data for 1,661 target words following related and unrelated primes were collected from 768 subjects across four different universities. These behavioral measures have been integrated with demographic information for each subject and descriptive characteristics for every item. Subjects also completed portions of the Woodcock-Johnson reading battery, three attentional control tasks, and a circadian rhythm measure. These data are available at a user-friendly Internet-based repository ( http://spp.montana.edu ). This Web site includes a search engine designed to generate lists of prime-target pairs with specific characteristics (e.g., length, frequency, associative strength, latent semantic similarity, priming effect in standardized and raw reaction times). We illustrate the types of questions that can be addressed via the Semantic Priming Project. These data represent the largest behavioral database on semantic priming and are available to researchers to aid in selecting stimuli, testing theories, and reducing potential confounds in their studies.
Semantic Observation Integration
Directory of Open Access Journals (Sweden)
Werner Kuhn
2012-09-01
Full Text Available Although the integration of sensor-based information into analysis and decision making has been a research topic for many years, semantic interoperability has not yet been reached. The advent of user-generated content for the geospatial domain, Volunteered Geographic Information (VGI, makes it even more difficult to establish semantic integration. This paper proposes a novel approach to integrating conventional sensor information and VGI, which is exploited in the context of detecting forest fires. In contrast to common logic-based semantic descriptions, we present a formal system using algebraic specifications to unambiguously describe the processing steps from natural phenomena to value-added information. A generic ontology of observations is extended and profiled for forest fire detection in order to illustrate how the sensing process, and transformations between heterogeneous sensing systems, can be represented as mathematical functions and grouped into abstract data types. We discuss the required ontological commitments and a possible generalization.
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analysis...... correct. Our main conclusion is that environment based semantics is more flexible than either substitution based semantics or semantics making use of structural congruences (like alpha-renaming)....
Temporal Representation in Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Kaufmann, Stefan
2013-08-01
The rise of causality and the attendant graph-theoretic modeling tools in the study of counterfactual reasoning has had resounding effects in many areas of cognitive science, but it has thus far not permeated the mainstream in linguistic theory to a comparable degree. In this study I show that a version of the predominant framework for the formal semantic analysis of conditionals, Kratzer-style premise semantics, allows for a straightforward implementation of the crucial ideas and insights of Pearl-style causal networks. I spell out the details of such an implementation, focusing especially on the notions of intervention on a network and backtracking interpretations of counterfactuals.
CSIR Research Space (South Africa)
Gerber, AJ
2006-06-01
Full Text Available for reasoning systems [Bech- hofer et al., 2004; McGuinness and van Harmelen, 2004; Smith et al., 2004]. DL is a set of knowledge representation formalisms with semantic characterisation based on stan- dard first-order logics. DL offers a formal foundation... is a knowledge representation language capturing the syntax (ontology) as well as the semantics (rules) of a specific domain [McGuin- ness et al., 2002; McGuinness and van Harmelen, 2004]. Currently, OWL is the W3C technology representing...
Communication of Semantic Properties
DEFF Research Database (Denmark)
Lenau, Torben Anker; Boelskifte, Per
2004-01-01
a number of semantic properties associated with the meaning we read from the form, colour, texture and sound of the product. The purpose of working with these properties can be to make the use of the product more self-evident, to form or enhance the cultural meaning of the product and to give the product...... processes. This working paper argues for the need for a commonly accepted terminology used to communicate semantic product properties. Designers and others involved in design processes are dependent of a sharp and clear verbal communication. Search facilities in computer programs for product and material...
Küppers, Bernd-Olaf; Artmann, Stefan
2013-01-01
Complex systems in nature and society make use of information for the development of their internal organization and the control of their functional mechanisms. Alongside technical aspects of storing, transmitting and processing information, the various semantic aspects of information, such as meaning, sense, reference and function, play a decisive part in the analysis of such systems.With the aim of fostering a better understanding of semantic systems from an evolutionary and multidisciplinary perspective, this volume collects contributions by philosophers and natural scientists, linguists, i
Semantic Search of Web Services
Hao, Ke
2013-01-01
This dissertation addresses semantic search of Web services using natural language processing. We first survey various existing approaches, focusing on the fact that the expensive costs of current semantic annotation frameworks result in limited use of semantic search for large scale applications. We then propose a vector space model based service…
DEFF Research Database (Denmark)
Mørk, Simon; Godskesen, Jens Christian; Hansen, Michael Reichhardt
1996-01-01
An alternative formal semantics for describing the temporal aspects for the ITU-T specification language SDL is proposed, based on the interval temporal logic Duration Calculus (DC). It is shown how DC can be used to give an SDL semantics with a precise treatment oftemporal phenomena. The semantics...
Semantic cognition or data mining?
Borsboom, D.; Visser, I.
2008-01-01
We argue that neural networks for semantic cognition, as proposed by Rogers & McClelland (R&M), do not acquire semantics and therefore cannot be the basis for a theory of semantic cognition. The reason is that the neural networks simply perform statistical categorization procedures, and these do not
Semantic Search of Web Services
Hao, Ke
2013-01-01
This dissertation addresses semantic search of Web services using natural language processing. We first survey various existing approaches, focusing on the fact that the expensive costs of current semantic annotation frameworks result in limited use of semantic search for large scale applications. We then propose a vector space model based service…
Semantic repository and ontology mapping
Gracia, J.; Trna, M.; Lozano, E.; Nguyen, T.T.; Gómez-Pérez, A.; Montaña, C.; Liem, J.
2010-01-01
This document discusses the core Semantic Technologies in DynaLearn: i) The semantic repository, which supports the online storage and access of qualitative reasoning models, ii) the grounding process, which establishes semantic equivalences between the concepts in the models and the concepts in a
Semantic cognition or data mining?
D. Borsboom; I. Visser
2008-01-01
We argue that neural networks for semantic cognition, as proposed by Rogers & McClelland (R&M), do not acquire semantics and therefore cannot be the basis for a theory of semantic cognition. The reason is that the neural networks simply perform statistical categorization procedures, and these do not
A Neurodynamic Model to Solve Nonlinear Pseudo-Monotone Projection Equation and Its Applications.
Eshaghnezhad, Mohammad; Effati, Sohrab; Mansoori, Amin
2016-09-29
In this paper, a neurodynamic model is given to solve nonlinear pseudo-monotone projection equation. Under pseudo-monotonicity condition and Lipschitz continuous condition, the projection neurodynamic model is proved to be stable in the sense of Lyapunov, globally convergent, globally asymptotically stable, and globally exponentially stable. Also, we show that, our new neurodynamic model is effective to solve the nonconvex optimization problems. Moreover, since monotonicity is a special case of pseudo-monotonicity and also since a co-coercive mapping is Lipschitz continuous and monotone, and a strongly pseudo-monotone mapping is pseudo-monotone, the neurodynamic model can be applied to solve a broader classes of constrained optimization problems related to variational inequalities, pseudo-convex optimization problem, linear and nonlinear complementarity problems, and linear and convex quadratic programming problems. Finally, several illustrative examples are stated to demonstrate the effectiveness and efficiency of our new neurodynamic model.
Testing monotonicity of a hazard: asymptotic distribution theory
Groeneboom, Piet
2011-01-01
Two new test statistics are introduced to test the null hypotheses that the sampling distribution has an increasing hazard rate on a specified interval [0,a]. These statistics are empirical L_1-type distances between the isotonic estimates, which use the monotonicity constraint, and either the empirical distribution function or the empirical cumulative hazard. They measure the excursions of the empirical estimates with respect to the isotonic estimates, due to local non-monotonicity. Asymptotic normality of the test statistics, if the hazard is strictly increasing on [0,a], is established under mild conditions. This is done by first approximating the global empirical distance by an distance with respect to the underlying distribution function. The resulting integral is treated as sum of increasingly many local integrals to which a CLT can be applied. The behavior of the local integrals is determined by a canonical process: the difference between the stochastic process x -> W(x)+x^2 where W is standard two-sid...
DATA PREORDERING IN GENERALIZED PAV ALGORITHM FOR MONOTONIC REGRESSION
Institute of Scientific and Technical Information of China (English)
Oleg Burdakov; Anders Grimvall; Oleg Sysoev
2006-01-01
Monotonic regression (MR) is a least distance problem with monotonicity constraints induced by a partially ordered data set of observations. In our recent publication [In Ser.Nonconvex Optimization and Its Applications, Springer-Verlag, (2006) 83, pp. 25-33],the Pool-Adjacent-Violators algorithm (PAV) was generalized from completely to partially ordered data sets (posets). The new algorithm, called GPAV, is characterized by the very low computational complexity, which is of second order in the number of observations.It treats the observations in a consecutive order, and it can follow any arbitrarily chosen topological order of the poset of observations. The GPAV algorithm produces a sufficiently accurate solution to the MR problem, but the accuracy depends on the chosen topological order. Here we prove that there exists a topological order for which the resulted GPAV solution is optimal. Furthermore, we present results of extensive numerical experiments,from which we draw conclusions about the most and the least preferable topological orders.
Semantator: semantic annotator for converting biomedical text to linked data.
Tao, Cui; Song, Dezhao; Sharma, Deepak; Chute, Christopher G
2013-10-01
More than 80% of biomedical data is embedded in plain text. The unstructured nature of these text-based documents makes it challenging to easily browse and query the data of interest in them. One approach to facilitate browsing and querying biomedical text is to convert the plain text to a linked web of data, i.e., converting data originally in free text to structured formats with defined meta-level semantics. In this paper, we introduce Semantator (Semantic Annotator), a semantic-web-based environment for annotating data of interest in biomedical documents, browsing and querying the annotated data, and interactively refining annotation results if needed. Through Semantator, information of interest can be either annotated manually or semi-automatically using plug-in information extraction tools. The annotated results will be stored in RDF and can be queried using the SPARQL query language. In addition, semantic reasoners can be directly applied to the annotated data for consistency checking and knowledge inference. Semantator has been released online and was used by the biomedical ontology community who provided positive feedbacks. Our evaluation results indicated that (1) Semantator can perform the annotation functionalities as designed; (2) Semantator can be adopted in real applications in clinical and transactional research; and (3) the annotated results using Semantator can be easily used in Semantic-web-based reasoning tools for further inference.
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science Oak Ridge National Lab., TN (United States)); Rosener, B. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science)
1991-12-01
This report describes a facility called NA-NET created to allow numerical analysts (na) an easy method of communicating with one another. The main advantage of the NA-NET is uniformity of addressing. All mail is addressed to the Internet host na-net.ornl.gov'' at Oak Ridge National Laboratory. Hence, members of the NA-NET do not need to remember complicated addresses or even where a member is currently located. As long as moving members change their e-mail address in the NA-NET everything works smoothly. The NA-NET system is currently located at Oak Ridge National Laboratory. It is running on the same machine that serves netlib. Netlib is a separate facility that distributes mathematical software via electronic mail. For more information on netlib consult, or send the one-line message send index'' to netlib{at}ornl.gov. The following report describes the current NA-NET system from both a user's perspective and from an implementation perspective. Currently, there are over 2100 members in the NA-NET. An average of 110 mail messages pass through this facility daily.
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J. [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science]|[Oak Ridge National Lab., TN (United States); Rosener, B. [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science
1991-12-01
This report describes a facility called NA-NET created to allow numerical analysts (na) an easy method of communicating with one another. The main advantage of the NA-NET is uniformity of addressing. All mail is addressed to the Internet host ``na-net.ornl.gov`` at Oak Ridge National Laboratory. Hence, members of the NA-NET do not need to remember complicated addresses or even where a member is currently located. As long as moving members change their e-mail address in the NA-NET everything works smoothly. The NA-NET system is currently located at Oak Ridge National Laboratory. It is running on the same machine that serves netlib. Netlib is a separate facility that distributes mathematical software via electronic mail. For more information on netlib consult, or send the one-line message ``send index`` to netlib{at}ornl.gov. The following report describes the current NA-NET system from both a user`s perspective and from an implementation perspective. Currently, there are over 2100 members in the NA-NET. An average of 110 mail messages pass through this facility daily.
A semantic space for modeling children's semantic memory
Denhière, Guy; Bellissens, Cédrick; Jhean, Sandra
2008-01-01
The goal of this paper is to present a model of children's semantic memory, which is based on a corpus reproducing the kinds of texts children are exposed to. After presenting the literature in the development of the semantic memory, a preliminary French corpus of 3.2 million words is described. Similarities in the resulting semantic space are compared to human data on four tests: association norms, vocabulary test, semantic judgments and memory tasks. A second corpus is described, which is composed of subcorpora corresponding to various ages. This stratified corpus is intended as a basis for developmental studies. Finally, two applications of these models of semantic memory are presented: the first one aims at tracing the development of semantic similarities paragraph by paragraph; the second one describes an implementation of a model of text comprehension derived from the Construction-integration model (Kintsch, 1988, 1998) and based on such models of semantic memory.
A Semantic Lexicon-Based Approach for Sense Disambiguation and Its WWW Application
di Lecce, Vincenzo; Calabrese, Marco; Soldo, Domenico
This work proposes a basic framework for resolving sense disambiguation through the use of Semantic Lexicon, a machine readable dictionary managing both word senses and lexico-semantic relations. More specifically, polysemous ambiguity characterizing Web documents is discussed. The adopted Semantic Lexicon is WordNet, a lexical knowledge-base of English words widely adopted in many research studies referring to knowledge discovery. The proposed approach extends recent works on knowledge discovery by focusing on the sense disambiguation aspect. By exploiting the structure of WordNet database, lexico-semantic features are used to resolve the inherent sense ambiguity of written text with particular reference to HTML resources. The obtained results may be extended to generic hypertextual repositories as well. Experiments show that polysemy reduction can be used to hint about the meaning of specific senses in given contexts.
Learning semantic query suggestions
E. Meij; M. Bron; L. Hollink; B. Huurnink; M. de Rijke
2009-01-01
An important application of semantic web technology is recognizing human-defined concepts in text. Query transformation is a strategy often used in search engines to derive queries that are able to return more useful search results than the original query and most popular search engines provide faci
Semantically Grounded Briefings
2005-12-01
occurring relations. AeroText and consequently AeroDAML can be tailored to particular domains through training sessions with annotated corpuses...the complexities of semantic markup by using mnemonic names for URIs, hiding unnamed intermediate objects (represented by “ GenSym ” identifiers), and
The semantic similarity ensemble
Directory of Open Access Journals (Sweden)
Andrea Ballatore
2013-12-01
Full Text Available Computational measures of semantic similarity between geographic terms provide valuable support across geographic information retrieval, data mining, and information integration. To date, a wide variety of approaches to geo-semantic similarity have been devised. A judgment of similarity is not intrinsically right or wrong, but obtains a certain degree of cognitive plausibility, depending on how closely it mimics human behavior. Thus selecting the most appropriate measure for a specific task is a significant challenge. To address this issue, we make an analogy between computational similarity measures and soliciting domain expert opinions, which incorporate a subjective set of beliefs, perceptions, hypotheses, and epistemic biases. Following this analogy, we define the semantic similarity ensemble (SSE as a composition of different similarity measures, acting as a panel of experts having to reach a decision on the semantic similarity of a set of geographic terms. The approach is evaluated in comparison to human judgments, and results indicate that an SSE performs better than the average of its parts. Although the best member tends to outperform the ensemble, all ensembles outperform the average performance of each ensemble's member. Hence, in contexts where the best measure is unknown, the ensemble provides a more cognitively plausible approach.
Directory of Open Access Journals (Sweden)
Murray-Rust Peter
2012-08-01
Full Text Available Abstract The articles in this special issue arise from a workshop and symposium held in January 2012 (Semantic Physical Science’. We invited people who shared our vision for the potential of the web to support chemical and related subjects. Other than the initial invitations, we have not exercised any control over the content of the contributed articles.
Communication of Semantic Properties
DEFF Research Database (Denmark)
Lenau, Torben Anker; Boelskifte, Per
2004-01-01
processes. This working paper argues for the need for a commonly accepted terminology used to communicate semantic product properties. Designers and others involved in design processes are dependent of a sharp and clear verbal communication. Search facilities in computer programs for product and material...
Automating Ontological Annotation with WordNet
Energy Technology Data Exchange (ETDEWEB)
Sanfilippo, Antonio P.; Tratz, Stephen C.; Gregory, Michelle L.; Chappell, Alan R.; Whitney, Paul D.; Posse, Christian; Paulson, Patrick R.; Baddeley, Bob L.; Hohimer, Ryan E.; White, Amanda M.
2006-01-22
Semantic Web applications require robust and accurate annotation tools that are capable of automating the assignment of ontological classes to words in naturally occurring text (ontological annotation). Most current ontologies do not include rich lexical databases and are therefore not easily integrated with word sense disambiguation algorithms that are needed to automate ontological annotation. WordNet provides a potentially ideal solution to this problem as it offers a highly structured lexical conceptual representation that has been extensively used to develop word sense disambiguation algorithms. However, WordNet has not been designed as an ontology, and while it can be easily turned into one, the result of doing this would present users with serious practical limitations due to the great number of concepts (synonym sets) it contains. Moreover, mapping WordNet to an existing ontology may be difficult and requires substantial labor. We propose to overcome these limitations by developing an analytical platform that (1) provides a WordNet-based ontology offering a manageable and yet comprehensive set of concept classes, (2) leverages the lexical richness of WordNet to give an extensive characterization of concept class in terms of lexical instances, and (3) integrates a class recognition algorithm that automates the assignment of concept classes to words in naturally occurring text. The ensuing framework makes available an ontological annotation platform that can be effectively integrated with intelligence analysis systems to facilitate evidence marshaling and sustain the creation and validation of inference models.
Ontological Annotation with WordNet
Energy Technology Data Exchange (ETDEWEB)
Sanfilippo, Antonio P.; Tratz, Stephen C.; Gregory, Michelle L.; Chappell, Alan R.; Whitney, Paul D.; Posse, Christian; Paulson, Patrick R.; Baddeley, Bob; Hohimer, Ryan E.; White, Amanda M.
2006-06-06
Semantic Web applications require robust and accurate annotation tools that are capable of automating the assignment of ontological classes to words in naturally occurring text (ontological annotation). Most current ontologies do not include rich lexical databases and are therefore not easily integrated with word sense disambiguation algorithms that are needed to automate ontological annotation. WordNet provides a potentially ideal solution to this problem as it offers a highly structured lexical conceptual representation that has been extensively used to develop word sense disambiguation algorithms. However, WordNet has not been designed as an ontology, and while it can be easily turned into one, the result of doing this would present users with serious practical limitations due to the great number of concepts (synonym sets) it contains. Moreover, mapping WordNet to an existing ontology may be difficult and requires substantial labor. We propose to overcome these limitations by developing an analytical platform that (1) provides a WordNet-based ontology offering a manageable and yet comprehensive set of concept classes, (2) leverages the lexical richness of WordNet to give an extensive characterization of concept class in terms of lexical instances, and (3) integrates a class recognition algorithm that automates the assignment of concept classes to words in naturally occurring text. The ensuing framework makes available an ontological annotation platform that can be effectively integrated with intelligence analysis systems to facilitate evidence marshaling and sustain the creation and validation of inference models.
U.S. Geological Survey, Department of the Interior — Net Ecosystem Carbon Flux is defined as the year-over-year change in Total Ecosystem Carbon Stock, or the net rate of carbon exchange between an ecosystem and the...
The regularized monotonicity method: detecting irregular indefinite inclusions
DEFF Research Database (Denmark)
Garde, Henrik; Staboulis, Stratos
2017-01-01
In inclusion detection in electrical impedance tomography, the support of perturbations (inclusion) from a known background conductivity is typically reconstructed from idealized continuum data modelled by a Neumann-to-Dirichlet map. Only few reconstruction methods apply when detecting indefinite...... of approximative measurement models, including the Complete Electrode Model, hence making the method robust against modelling error and noise. In particular, we demonstrate that for a convergent family of approximative models there exists a sequence of regularization parameters such that the outer shape...... of the inclusions is asymptotically exactly characterized. Finally, a peeling-type reconstruction algorithm is presented and, for the first time in literature, numerical examples of monotonicity reconstructions for indefinite inclusions are presented....
Convex analysis and monotone operator theory in Hilbert spaces
Bauschke, Heinz H
2017-01-01
This reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, ma...
Monotonic childhoods: representations of otherness in research writing
Directory of Open Access Journals (Sweden)
Denise Marcos Bussoletti
2011-12-01
Full Text Available This paper is part of a doctoral thesis entitled “Monotonic childhoods – a rhapsody of hope”. It follows the perspective of a critical psychosocial and cultural study, and aims at discussing the other’s representation in research writing, electing childhood as an allegorical and refl ective place. It takes into consideration, by means of analysis, the drawings and poems of children from the Terezin ghetto during the Second World War. The work is mostly based on Serge Moscovici’s Social Representation Theory, but it is also in constant dialogue with other theories and knowledge fi elds, especially Walter Benjamin’s and Mikhail Bakhtin’s contributions. At the end, the paper supports the thesis that conceives poetics as one of the translation axes of childhood cultures.
PPA BASED PREDICTION-CORRECTION METHODS FOR MONOTONE VARIATIONAL INEQUALITIES
Institute of Scientific and Technical Information of China (English)
He Bingsheng; Jiang Jianlin; Qian Maijian; Xu Ya
2005-01-01
In this paper we study the proximal point algorithm (PPA) based predictioncorrection (PC) methods for monotone variational inequalities. Each iteration of these methods consists of a prediction and a correction. The predictors are produced by inexact PPA steps. The new iterates are then updated by a correction using the PPA formula. We present two profit functions which serve two purposes: First we show that the profit functions are tight lower bounds of the improvements obtained in each iteration. Based on this conclusion we obtain the convergence inexactness restrictions for the prediction step. Second we show that the profit functions are quadratically dependent upon the step lengths, thus the optimal step lengths are obtained in the correction step. In the last part of the paper we compare the strengths of different methods based on their inexactness restrictions.
Strong convergence theorems for maximal monotone mappings in Banach spaces
Zegeye, Habtu
2008-07-01
Let E be a uniformly convex and 2-uniformly smooth real Banach space with dual E*. Let be a Lipschitz continuous monotone mapping with A-1(0)[not equal to][empty set]. For given u,x1[set membership, variant]E, let {xn} be generated by the algorithm xn+1:=[beta]nu+(1-[beta]n)(xn-[alpha]nAJxn), n[greater-or-equal, slanted]1, where J is the normalized duality mapping from E into E* and {[lambda]n} and {[theta]n} are real sequences in (0,1) satisfying certain conditions. Then it is proved that, under some mild conditions, {xn} converges strongly to x*[set membership, variant]E where Jx*[set membership, variant]A-1(0). Finally, we apply our convergence theorems to the convex minimization problems.
Convergence of the natural approximations of piecewise monotone interval maps.
Haydn, Nicolai
2004-06-01
We consider piecewise monotone interval mappings which are topologically mixing and satisfy the Markov property. It has previously been shown that the invariant densities of the natural approximations converge exponentially fast in uniform pointwise topology to the invariant density of the given map provided its derivative is piecewise Lipshitz continuous. We provide an example of a map which is Lipshitz continuous and for which the densities converge in the bounded variation norm at a logarithmic rate. This shows that in general one cannot expect exponential convergence in the bounded variation norm. Here we prove that if the derivative of the interval map is Holder continuous and its variation is well approximable (gamma-uniform variation for gamma>0), then the densities converge exponentially fast in the norm.
A COMPARISON OF DIFFERENT CONTRACTION METHODS FOR MONOTONE VARIATIONAL INEQUALITIES
Institute of Scientific and Technical Information of China (English)
Bingsheng He; Xiang Wang; Junfeng Yang
2009-01-01
It is interesting to compare the efficiency of two methods when their computational loads in each iteration are equal. In this paper, two classes of contraction methods for monotone variational inequalities are studied in a unified framework. The methods of both classes can be viewed as prediction-correction methods, which generate the same test vector in the prediction step and adopt the same step-size rule in the correction step. The only difference is that they use different search directions. The computational loads of each iteration of the different classes are equal. Our analysis explains theoretically why one class of the contraction methods usually outperforms the other class. It is demonstrated that many known methods belong to these two classes of methods. Finally, the presented numerical results demonstrate the validity of our analysis.
A new non-monotone fitness scaling for genetic algorithm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The properties of selection operators in the genetic algorithm (GA) are studied in detail. It is indicated that the selection of operations is significant for both improving the general fitness of a population and leading to the schema deceptiveness. The stochastic searching characteristics of GA are compared with those of heuristic methods. The influence of selection operators on the GA' s exploration and exploitation is discussed, and the performance of selection operators is evaluated with the premature convergence of the GA taken as an example based on One-Max function. In order to overcome the schema deceptiveness of the GA, a new type of fitness scaling, non monotone scaling, is advanced to enhance the evolutionary ability of a population. The effectiveness of the new scaling method is tested by a trap function and a needle-in-haystack (NiH) function.
MINLIP for the Identification of Monotone Wiener Systems
Pelckmans, Kristiaan
2010-01-01
This paper studies the MINLIP estimator for the identification of Wiener systems consisting of a sequence of a linear FIR dynamical model, and a monotonically increasing (or decreasing) static function. Given $T$ observations, this algorithm boils down to solving a convex quadratic program with $O(T)$ variables and inequality constraints, implementing an inference technique which is based entirely on model complexity control. The resulting estimates of the linear submodel are found to be almost consistent when no noise is present in the data, under a condition of smoothness of the true nonlinearity and local Persistency of Excitation (local PE) of the data. This result is novel as it does not rely on classical tools as a 'linearization' using a Taylor decomposition, nor exploits stochastic properties of the data. It is indicated how to extend the method to cope with noisy data, and empirical evidence contrasts performance of the estimator against other recently proposed techniques.
A new approximate proximal point algorithm for maximal monotone operator
Institute of Scientific and Technical Information of China (English)
HE; Bingsheng(何炳生); LIAO; Lizhi(廖立志); YANG; Zhenhua(杨振华)
2003-01-01
The problem concerned in this paper is the set-valued equation 0 ∈ T(z) where T is a maximal monotone operator. For given xk and βk ＞ 0, some existing approximate proximal point algorithms take xk+1 = xk such that xk +ek∈ xk + βkT(xk) and||ek|| ≤ηk||xk - xk||, where {ηk} is a non-negative summable sequence. Instead of xk+1 = xk, the new iterate of the proposing method is given by xk+1 = PΩ[xk - ek], where Ω is the domain of T and PΩ(@) denotes the projection on Ω. The convergence is proved under a significantly relaxed restriction supk＞0 ηk ＜ 1.
Payoff-monotonic game dynamics and the maximum clique problem.
Pelillo, Marcello; Torsello, Andrea
2006-05-01
Evolutionary game-theoretic models and, in particular, the so-called replicator equations have recently proven to be remarkably effective at approximately solving the maximum clique and related problems. The approach is centered around a classic result from graph theory that formulates the maximum clique problem as a standard (continuous) quadratic program and exploits the dynamical properties of these models, which, under a certain symmetry assumption, possess a Lyapunov function. In this letter, we generalize previous work along these lines in several respects. We introduce a wide family of game-dynamic equations known as payoff-monotonic dynamics, of which replicator dynamics are a special instance, and show that they enjoy precisely the same dynamical properties as standard replicator equations. These properties make any member of this family a potential heuristic for solving standard quadratic programs and, in particular, the maximum clique problem. Extensive simulations, performed on random as well as DIMACS benchmark graphs, show that this class contains dynamics that are considerably faster than and at least as accurate as replicator equations. One problem associated with these models, however, relates to their inability to escape from poor local solutions. To overcome this drawback, we focus on a particular subclass of payoff-monotonic dynamics used to model the evolution of behavior via imitation processes and study the stability of their equilibria when a regularization parameter is allowed to take on negative values. A detailed analysis of these properties suggests a whole class of annealed imitation heuristics for the maximum clique problem, which are based on the idea of varying the parameter during the imitation optimization process in a principled way, so as to avoid unwanted inefficient solutions. Experiments show that the proposed annealing procedure does help to avoid poor local optima by initially driving the dynamics toward promising regions in
Join Bayes Nets: A new type of Bayes net for relational data
Schulte, Oliver; Moser, Flavia; Ester, Martin
2008-01-01
Many databases store data in relational format, with different types of entities and information about links between the entities. The field of statistical-relational learning has developed a number of new statistical models for such data. Instead of introducing a new model class, we propose using a standard model class--Bayes nets--in a new way: Join Bayes nets contain nodes that correspond to the descriptive attributes of the database tables, plus Boolean relationship nodes that indicate the presence of a link. Join Bayes nets are class-level models whose random variables describe attributes of generic individuals (e.g., $\\age(\\P)$ rather than $\\age(\\jack)$ where $\\P$ stands for a randomly selected person). As Join Bayes nets are just a special type of Bayes net, their semantics is standard (edges denote direct associations, d-separation implies probabilistic independence etc.), and Bayes net inference algorithms can be used "as is" to answer probabilistic queries involving relations. We present a dynamic p...
Kobayashi, Norio; Ishii, Manabu; Takahashi, Satoshi; Mochizuki, Yoshiki; Matsushima, Akihiro; Toyoda, Tetsuro
2011-07-01
Global cloud frameworks for bioinformatics research databases become huge and heterogeneous; solutions face various diametric challenges comprising cross-integration, retrieval, security and openness. To address this, as of March 2011 organizations including RIKEN published 192 mammalian, plant and protein life sciences databases having 8.2 million data records, integrated as Linked Open or Private Data (LOD/LPD) using SciNetS.org, the Scientists' Networking System. The huge quantity of linked data this database integration framework covers is based on the Semantic Web, where researchers collaborate by managing metadata across public and private databases in a secured data space. This outstripped the data query capacity of existing interface tools like SPARQL. Actual research also requires specialized tools for data analysis using raw original data. To solve these challenges, in December 2009 we developed the lightweight Semantic-JSON interface to access each fragment of linked and raw life sciences data securely under the control of programming languages popularly used by bioinformaticians such as Perl and Ruby. Researchers successfully used the interface across 28 million semantic relationships for biological applications including genome design, sequence processing, inference over phenotype databases, full-text search indexing and human-readable contents like ontology and LOD tree viewers. Semantic-JSON services of SciNetS.org are provided at http://semanticjson.org.
On the Unification of Process Semantics: Logical Semantics
Romero-Hernández, David; 10.4204/EPTCS.62.4
2011-01-01
We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. We start by considering the classic linear time-branching time spectrum developed by R.J. van Glabbeek. He provided a logical characterization of most of the semantics in his spectrum but, without following a unique pattern. In this paper, we present a uniform logical characterization of all the semantics in the enlarged spectrum. The common structure of the formulas that constitute all the corresponding logics gives us a much clearer picture of the spectrum, clarifying the relations between the different semantics, and allows us to develop generic proofs of some general properties of the semantics.
Arking, Jon
2010-01-01
Comprehensive coverage to help experienced .NET developers create flexible, extensible enterprise application code If you're an experienced Microsoft .NET developer, you'll find in this book a road map to the latest enterprise development methodologies. It covers the tools you will use in addition to Visual Studio, including Spring.NET and nUnit, and applies to development with ASP.NET, C#, VB, Office (VBA), and database. You will find comprehensive coverage of the tools and practices that professional .NET developers need to master in order to build enterprise more flexible, testable, and ext
Computation on Sentence Semantic Distance for Novelty Detection
Institute of Scientific and Technical Information of China (English)
Hua-Ping Zhang; Jian Sun; Bing Wang; Shuo Bai
2005-01-01
Novelty detection is to retrieve new information and filter redundancy from given sentences that are relevant to a specific topic. In TREC2003, the authors tried an approach to novelty detection with semantic distance computation.The motivation is to expand a sentence by introducing semantic information. Computation on semantic distance between sentences incorporates WordNet with statistical information. The novelty detection is treated as a binary classification problem: new sentence or not. The feature vector, used in the vector space model for classification, consists of various factors, including the semantic distance from the sentence to the topic and the distance from the sentence to the previous relevant context occurring before it. New sentences are then detected with Winnow and support vector machine classifiers,respectively. Several experiments are conducted to survey the relationship between different factors and performance. It is proved that semantic computation is promising in novelty detection. The ratio of new sentence size to relevant size is further studied given different relevant document sizes. It is found that the ratio reduced with a certain speed (about 0.86).Then another group of experiments is performed supervised with the ratio. It is demonstrated that the ratio is helpful to improve the novelty detection performance.
A Bayesian Generative Model for Learning Semantic Hierarchies
Directory of Open Access Journals (Sweden)
Roni eMittelman
2014-05-01
Full Text Available Building fine-grained visual recognition systems that are capable of recognizing tens of thousands of categories, has received much attention in recent years. The well known semantic hierarchical structure of categories and concepts, has been shown to provide a key prior which allows for optimal predictions. The hierarchical organization of various domains and concepts has been subject to extensive research, and led to the development of the WordNet domains hierarchy [18], which was also used to organize the images in the ImageNet [11] dataset, in which the category count approaches the human capacity. Still, for the human visual system, the form of the hierarchy must be discovered with minimal use of supervision or innate knowledge. In this work, we propose a new Bayesian generative model for learning such domain hierarchies, based on semantic input. Our model is motivated by the super-subordinate organization of domain labels and concepts that characterizes WordNet, and accounts for several important challenges: maintaining context information when progressing deeper into the hierarchy, learning a coherent semantic concept for each node, and modeling uncertainty in the perception process.
A Bayesian generative model for learning semantic hierarchies.
Mittelman, Roni; Sun, Min; Kuipers, Benjamin; Savarese, Silvio
2014-01-01
Building fine-grained visual recognition systems that are capable of recognizing tens of thousands of categories, has received much attention in recent years. The well known semantic hierarchical structure of categories and concepts, has been shown to provide a key prior which allows for optimal predictions. The hierarchical organization of various domains and concepts has been subject to extensive research, and led to the development of the WordNet domains hierarchy (Fellbaum, 1998), which was also used to organize the images in the ImageNet (Deng et al., 2009) dataset, in which the category count approaches the human capacity. Still, for the human visual system, the form of the hierarchy must be discovered with minimal use of supervision or innate knowledge. In this work, we propose a new Bayesian generative model for learning such domain hierarchies, based on semantic input. Our model is motivated by the super-subordinate organization of domain labels and concepts that characterizes WordNet, and accounts for several important challenges: maintaining context information when progressing deeper into the hierarchy, learning a coherent semantic concept for each node, and modeling uncertainty in the perception process.
Strong Stationary Duality for M\\"obius Monotone Markov Chains: Unreliable Networks
Lorek, Pawel
2011-01-01
For Markov chains with a partially ordered finite state space we show strong stationary duality under the condition of M\\"obius monotonicity of the chain. We show relations of M\\"obius monotonicity to other definitions of monotone chains. We give examples of dual chains in this context which have transitions only upwards. We illustrate general theory by an analysis of nonsymmetric random walks on the cube with an application to networks of queues.
Causality in the Semantics of Esterel: Revisited
Mousavi, MohammadReza
2010-01-01
We re-examine the challenges concerning causality in the semantics of Esterel and show that they pertain to the known issues in the semantics of Structured Operational Semantics with negative premises. We show that the solutions offered for the semantics of SOS also provide answers to the semantic challenges of Esterel and that they satisfy the intuitive requirements set by the language designers.
Vincent, Etter
2011-01-01
We first present our work in machine translation, during which we used aligned sentences to train a neural network to embed n-grams of different languages into an $d$-dimensional space, such that n-grams that are the translation of each other are close with respect to some metric. Good n-grams to n-grams translation results were achieved, but full sentences translation is still problematic. We realized that learning semantics of sentences and documents was the key for solving a lot of natural language processing problems, and thus moved to the second part of our work: sentence compression. We introduce a flexible neural network architecture for learning embeddings of words and sentences that extract their semantics, propose an efficient implementation in the Torch framework and present embedding results comparable to the ones obtained with classical neural language models, while being more powerful.
DEFF Research Database (Denmark)
Ejstrup, Michael; le Fevre Jakobsen, Bjarne
Semantic gaps are dangerous Language adapts to the environment where it serves as a tool to communication. Language is a social agreement, and we all have to stick to both grammaticalized and non-grammaticalized rules in order to pass information about the world around us. As such language develops...... unpolite language and tend to create dangerous relations where specialy language creates problems and trouble that could be avoided if we had better language tools at hand. But we have not these tools of communication, and we are in a situation today where media and specially digital and social media......, supported by new possibilities of migration, create dangerous situations. How can we avoid these accidental gaps in language and specially the gaps in semantic and metaphoric tools. Do we have to keep silent and stop discusing certain isues, or do we have other ways to get acces to sufficient language tools...
On a correspondence between regular and non-regular operator monotone functions
DEFF Research Database (Denmark)
Gibilisco, P.; Hansen, Frank; Isola, T.
2009-01-01
We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information.......We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information....
Non-monotonic dynamics and crosstalk in signaling pathways and their implications for pharmacology
van Wijk, Roeland; Tans, Sander J.; Wolde, Pieter Rein Ten; Mashaghi, Alireza
2015-06-01
Currently, drug discovery approaches commonly assume a monotonic dose-response relationship. However, the assumption of monotonicity is increasingly being challenged. Here we show that for two simple interacting linear signaling pathways that carry two different signals with different physiological responses, a non-monotonic input-output relation can arise with simple network topologies including coherent and incoherent feed-forward loops. We show that non-monotonicity of the response functions has severe implications for pharmacological treatment. Fundamental constraints are imposed on the effectiveness and toxicity of any drug independent of its chemical nature and selectivity due to the specific network structure.
Institute of Scientific and Technical Information of China (English)
Igor Boglaev; Matthew Hardy
2008-01-01
This paper presents and analyzes a monotone domain decomposition algorithm for solving nonlinear singularly perturbed reaction-diffusion problems of parabolic type.To solve the nonlinear weighted average finite difference scheme for the partial differential equation,we construct a monotone domain decomposition algorithm based on a Schwarz alternating method and a box-domain decomposition.This algorithm needs only to solve linear discrete systems at each iterative step and converges monotonically to the exact solution of the nonlinear discrete problem. The rate of convergence of the monotone domain decomposition algorithm is estimated.Numerical experiments are presented.
Directory of Open Access Journals (Sweden)
Richard Vallée
2006-06-01
Full Text Available According to some philosophers, sentences like (1 “It is raining” and (2 “John is ready” are context sensitive sentences even if they do not contain indexicals or demonstratives. That view initiated a context sensitivity frenzy. Cappelen and Lepore (2005 summarize the frenzy by the slogan “Every sentence is context sensitive” (Insensitive Semantics, p. 6, note 5. They suggest a view they call Minimalism according to which the truth conditions of utterances of sentences like (1/(2 are exactly what Convention T gives you. I will distinguish different propositions, and refocus semantics on sentences. As distinct from what the protagonists in the ongoing debate think, I argue that the content or truth conditions of utterances of both context sensitive sentences and sentences like (1/(2 are not interesting from a semantic point of view, and that the problem sentences like (1/(2 raises is not about context sensitivity or context insensitivity of sentences, but relevance of the content of utterances.
Teixeira, G. M.; Aguiar, M. S. F.; Carvalho, C. F.; Dantas, D. R.; Cunha, M. V.; Morais, J. H. M.; Pereira, H. B. B.; Miranda, J. G. V.
Verbal language is a dynamic mental process. Ideas emerge by means of the selection of words from subjective and individual characteristics throughout the oral discourse. The goal of this work is to characterize the complex network of word associations that emerge from an oral discourse from a discourse topic. Because of that, concepts of associative incidence and fidelity have been elaborated and represented the probability of occurrence of pairs of words in the same sentence in the whole oral discourse. Semantic network of words associations were constructed, where the words are represented as nodes and the edges are created when the incidence-fidelity index between pairs of words exceeds a numerical limit (0.001). Twelve oral discourses were studied. The networks generated from these oral discourses present a typical behavior of complex networks and their indices were calculated and their topologies characterized. The indices of these networks obtained from each incidence-fidelity limit exhibit a critical value in which the semantic network has maximum conceptual information and minimum residual associations. Semantic networks generated by this incidence-fidelity limit depict a pattern of hierarchical classes that represent the different contexts used in the oral discourse.
Subliminal Semantic Priming in Speech
Tillmann, Barbara; Perrin, Fabien
2011-01-01
Numerous studies have reported subliminal repetition and semantic priming in the visual modality. We transferred this paradigm to the auditory modality. Prime awareness was manipulated by a reduction of sound intensity level. Uncategorized prime words (according to a post-test) were followed by semantically related, unrelated, or repeated target words (presented without intensity reduction) and participants performed a lexical decision task (LDT). Participants with slower reaction times in the LDT showed semantic priming (faster reaction times for semantically related compared to unrelated targets) and negative repetition priming (slower reaction times for repeated compared to semantically related targets). This is the first report of semantic priming in the auditory modality without conscious categorization of the prime. PMID:21655277
Subliminal semantic priming in speech.
Directory of Open Access Journals (Sweden)
Jérôme Daltrozzo
Full Text Available Numerous studies have reported subliminal repetition and semantic priming in the visual modality. We transferred this paradigm to the auditory modality. Prime awareness was manipulated by a reduction of sound intensity level. Uncategorized prime words (according to a post-test were followed by semantically related, unrelated, or repeated target words (presented without intensity reduction and participants performed a lexical decision task (LDT. Participants with slower reaction times in the LDT showed semantic priming (faster reaction times for semantically related compared to unrelated targets and negative repetition priming (slower reaction times for repeated compared to semantically related targets. This is the first report of semantic priming in the auditory modality without conscious categorization of the prime.
NetCDF-U - Uncertainty conventions for netCDF datasets
Bigagli, Lorenzo; Nativi, Stefano; Domenico, Ben
2013-04-01
To facilitate the automated processing of uncertain data (e.g. uncertainty propagation in modeling applications), we have proposed a set of conventions for expressing uncertainty information within the netCDF data model and format: the NetCDF Uncertainty Conventions (NetCDF-U). From a theoretical perspective, it can be said that no dataset is a perfect representation of the reality it purports to represent. Inevitably, errors arise from the observation process, including the sensor system and subsequent processing, differences in scales of phenomena and the spatial support of the observation mechanism, lack of knowledge about the detailed conversion between the measured quantity and the target variable. This means that, in principle, all data should be treated as uncertain. The most natural representation of an uncertain quantity is in terms of random variables, with a probabilistic approach. However, it must be acknowledged that almost all existing data resources are not treated in this way. Most datasets come simply as a series of values, often without any uncertainty information. If uncertainty information is present, then it is typically within the metadata, as a data quality element. This is typically a global (dataset wide) representation of uncertainty, often derived through some form of validation process. Typically, it is a statistical measure of spread, for example the standard deviation of the residuals. The introduction of a mechanism by which such descriptions of uncertainty can be integrated into existing geospatial applications is considered a practical step towards a more accurate modeling of our uncertain understanding of any natural process. Given the generality and flexibility of the netCDF data model, conventions on naming, syntax, and semantics have been adopted by several communities of practice, as a means of improving data interoperability. Some of the existing conventions include provisions on uncertain elements and concepts, but, to our
Survey of semantic modeling techniques
Energy Technology Data Exchange (ETDEWEB)
Smith, C.L.
1975-07-01
The analysis of the semantics of programing languages was attempted with numerous modeling techniques. By providing a brief survey of these techniques together with an analysis of their applicability for answering semantic issues, this report attempts to illuminate the state-of-the-art in this area. The intent is to be illustrative rather than thorough in the coverage of semantic models. A bibliography is included for the reader who is interested in pursuing this area of research in more detail.
Semantic multimedia analysis and processing
Spyrou, Evaggelos; Mylonas, Phivos
2014-01-01
Broad in scope, Semantic Multimedia Analysis and Processing provides a complete reference of techniques, algorithms, and solutions for the design and the implementation of contemporary multimedia systems. Offering a balanced, global look at the latest advances in semantic indexing, retrieval, analysis, and processing of multimedia, the book features the contributions of renowned researchers from around the world. Its contents are based on four fundamental thematic pillars: 1) information and content retrieval, 2) semantic knowledge exploitation paradigms, 3) multimedia personalization, and 4)
Towards a Semantic Grid Architecture
Goble, Carole
2005-01-01
The Semantic Grid is an extension of the current Grid in which information and services are given well defined and explicitly represented meaning, better enabling computers and people to work in cooperation. In the last few years, several projects have embraced this vision and there are already successful pioneering applications that combine the strengths of the Grid and of semantic technologies. However, the Semantic Grid currently lacks a reference architecture, or a systematic approach for...
Survey of semantic modeling techniques
Energy Technology Data Exchange (ETDEWEB)
Smith, C.L.
1975-07-01
The analysis of the semantics of programing languages was attempted with numerous modeling techniques. By providing a brief survey of these techniques together with an analysis of their applicability for answering semantic issues, this report attempts to illuminate the state-of-the-art in this area. The intent is to be illustrative rather than thorough in the coverage of semantic models. A bibliography is included for the reader who is interested in pursuing this area of research in more detail.
Mapping Persian Words to WordNet Synsets
Directory of Open Access Journals (Sweden)
Mehrnoush Shamsfard
2009-12-01
Full Text Available Lexical ontologies are one of the main resourcesfor developing natural language processing and semantic web applications. Mapping lexical ontologies of different languagesis very important for inter-lingual tasks. On the other hand mapping approaches can be implied to build lexical ontologies for a new language based on pre-existing resources of other languages. In this paper we propose a semantic approach for mapping Persian words to Princeton WordNet Synsets. As there is no lexical ontology for Persian, our approach helps not only in building one for this language but also enables semantic web applications on Persian documents. To do the mapping, we calculate the similarity of Persian words and English synsets using their features such as super-classes and subclasses, domain and related words. Our approach is an improvement of an existing one applying in a new domain, which increases the recall noticeably.
Semantic Representatives of the Concept
Directory of Open Access Journals (Sweden)
Elena N. Tsay
2013-01-01
Full Text Available In the article concept as one of the principle notions of cognitive linguistics is investigated. Considering concept as culture phenomenon, having language realization and ethnocultural peculiarities, the description of the concept “happiness” is presented. Lexical and semantic paradigm of the concept of happiness correlates with a great number of lexical and semantic variants. In the work semantic representatives of the concept of happiness, covering supreme spiritual values are revealed and semantic interpretation of their functioning in the Biblical discourse is given.
Resource modalities in game semantics
Melliès, Paul-André
2007-01-01
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is more primitive than game semantics. We advocate instead the contrary: that game semantics is conceptually more primitive than linear logic. Starting from this revised point of view, we design a categorical model of resources in game semantics, and construct an arena game model where the usual notion of bracketing is extended to multi- bracketing in order to capture various resource policies: linear, afﬁne and exponential.
System semantics of explanatory dictionaries
Directory of Open Access Journals (Sweden)
Volodymyr Shyrokov
2015-11-01
Full Text Available System semantics of explanatory dictionaries Some semantic properties of the language to be followed from the structure of lexicographical systems of big explanatory dictionaries are considered. The hyperchains and hypercycles are determined as the definite kind of automorphisms of the lexicographical system of explanatory dictionary. Some semantic consequencies following from the principles of lexicographic closure and lexicographic completeness are investigated using the hyperchains and hypercycles formalism. The connection between the hypercyle properties of the lexicographical system semantics and Goedel’s incompleteness theorem is discussed.
Document Representation and Clustering with WordNet Based Similarity Rough Set Model
Directory of Open Access Journals (Sweden)
Koichi Yamada
2011-09-01
Full Text Available Most studies on document clustering till date use Vector Space Model (VSM to represent documents in the document space, where documents are denoted by a vector in a word vector space. The standard VSM does not take into account the semantic relatedness between terms. Thus, terms with some semantic similarity are dealt with in the same way as terms with no semantic relatedness. Since this unconcern about semantics reduces the quality of clustering results, many studies have proposed various approaches to introduce knowledge of semantic relatedness into VSM model. Those approaches give better results than the standard VSM. However they still have their own issues. We propose a new approach as a combination of two approaches, one of which uses Rough Sets theory and co-occurrence of terms, and the other uses WordNet knowledge to solve these issues. Experiments for its evaluation show advantage of the proposed approach over the others.
Xu, Ji; Liu, Feng; Luo, Xiaofeng
2016-01-01
Fluctuations of conserved quantities are sensitive observables to probe the signature of QCD phase transition and critical point in heavy-ion collisions. With the UrQMD model, we have studied the centrality and energy dependence of various order cumulants and cumulant ratios (up to fourth order) of net-proton,net-charge and net-kaon multiplicity distributions in Au+Au collisions at $\\sqrt{s_{NN}}$= 7.7, 11.5, 19.6, 27, 39, 62.4, 200 GeV. The model results show that the production mechanism of the particles and anti-particles have significant impacts on the cumulants of net-particles multiplicity distributions and show strong energy dependence. We also made comparisons between model calculations and experimental data measured in the first phase of the beam energy scan (BES) program by the STAR experiment at RHIC. The comparisons indicate that the baryon conservation effect strongly suppress the cumulants of net-proton distributions at low energies and the non-monotonic energy dependence for the net-proton {\\KV...
Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates
Borodin, Allan; Ye, Yuli
2012-01-01
Result diversification has many important applications in databases, operations research, information retrieval, and finance. In this paper, we study and extend a particular version of result diversification, known as max-sum diversification. More specifically, we consider the setting where we are given a set of elements in a metric space and a set valuation function $f$ defined on every subset. For any given subset $S$, the overall objective is a linear combination of $f(S)$ and the sum of the distances induced by $S$. The goal is to find a subset $S$ satisfying some constraints that maximizes the overall objective. This problem is first studied by Gollapudi and Sharma for modular set functions and for sets satisfying a cardinality constraint. We consider an extension of the modular case to the monotone submodular case, for which the previous algorithm no longer applies. Interestingly, we are able to match the 2-approximation using a natural, but different greedy algorithm. We then further extend the problem...
Non-monotonicity of trace distance under tensor products
Energy Technology Data Exchange (ETDEWEB)
Maziero, Jonas, E-mail: jonas.maziero@ufsm.br [Universidade Federal de Santa Maria (UFSM), RS (Brazil). Departamento de Fisica
2015-10-15
The trace distance (TD) possesses several of the good properties required for a faithful distance measure in the quantum state space. Despite its importance and ubiquitous use in quantum information science, one of its questionable features, its possible non-monotonicity under taking tensor products of its arguments (NMuTP), has been hitherto unexplored. In this article, we advance analytical and numerical investigations of this issue considering different classes of states living in a discrete and finite dimensional Hilbert space. Our results reveal that although this property of TD does not show up for pure states and for some particular classes of mixed states, it is present in a non-negligible fraction of the regarded density operators. Hence, even though the percentage of quartets of states leading to the NMuTP drawback of TD and its strength decrease as the system's dimension grows, this property of TD must be taken into account before using it as a figure of merit for distinguishing mixed quantum states. (author)
Dynamical zeta functions for piecewise monotone maps of the interval
Ruelle, David
2004-01-01
Consider a space M, a map f:M\\to M, and a function g:M \\to {\\mathbb C}. The formal power series \\zeta (z) = \\exp \\sum ^\\infty _{m=1} \\frac {z^m}{m} \\sum _{x \\in \\mathrm {Fix}\\,f^m} \\prod ^{m-1}_{k=0} g (f^kx) yields an example of a dynamical zeta function. Such functions have unexpected analytic properties and interesting relations to the theory of dynamical systems, statistical mechanics, and the spectral theory of certain operators (transfer operators). The first part of this monograph presents a general introduction to this subject. The second part is a detailed study of the zeta functions associated with piecewise monotone maps of the interval [0,1]. In particular, Ruelle gives a proof of a generalized form of the Baladi-Keller theorem relating the poles of \\zeta (z) and the eigenvalues of the transfer operator. He also proves a theorem expressing the largest eigenvalue of the transfer operator in terms of the ergodic properties of (M,f,g).
Completely Monotone Multisequences, Symmetric Probabilities and a Normal Limit Theorem
Indian Academy of Sciences (India)
J C Gupta
2000-11-01
Let G, be the set of all partial completely monotone multisequences of order and degree , i.e., multisequences (1, 2,$\\ldots$ ,k), 1, 2,$\\ldots$ , = 0, 1, 2,$\\ldots$ ,1 + 2 + \\$cdots$ + ≤ n, (0,0,$\\ldots$ ,0) = 1 and $(-1)^{_0}^{_0}$ (1, 2,$\\ldots$ ,)≥ 0 whenever 0 ≤ -(1 + 2 +$\\cdots$ +) where (1, 2,$\\ldots$ ,)=(1+1, 2,$\\ldots$ ,)+ (1,2+1,$\\ldots$ ,)+$\\cdots$ + (1, 2,$\\ldots$ ,+1)-(1,2,$\\ldots$ ,)$. Further, let $\\prod_{n,k}$ be the set of all symmetric probabilities on ${0, 1, 2,\\ldots ,k}^{n}$. We establish a one-to-one correspondence between the sets G, and $\\prod_{n, k}$ and use it to formulate and answer interesting questions about both. Assigning to G, the uniform probability measure, we show that, as → ∞ , any fixed section {(1, 2,$\\ldots$ ,), 1 ≤ $\\sum ≤ }, properly centered and normalized, is asymptotically multivariate normal. That is, $\\left\\{\\sqrt{\\left(\\binom{n+k}{k}\\right)}((1, 2,\\ldots ,)-c_0(1, 2,\\ldots ,), 1≤ _1+2+\\cdots +_k≤ m\\right\\}$ converges weakly to MVN[0,]; the centering constants 0(1, 2,$\\ldots$ ,) and the asymptotic covariances depend on the moments of the Dirichlet $(1, 1,\\ldots ,1; 1)$ distribution on the standard simplex in .
Junaid Rashid; Muhammad Wasif Nisar
2016-01-01
Semantic search engines(SSE) are more efficient than other web engines because in this era of busy life everyone wants an exact answer to his question which only semantic engines can provide. The immense increase in the volume of data, traditional search engines has increased the number of answers to satisfy the user. This creates the problem to search for the desired answer. To solve this problem, the trend of developing semantic search engines is increasing day by da...
Directory of Open Access Journals (Sweden)
Junaid Rashid
2016-10-01
Full Text Available Semantic search engines(SSE are more efficient than other web engines because in this era of busy life everyone wants an exact answer to his question which only semantic engines can provide. The immense increase in the volume of data, traditional search engines has increased the number of answers to satisfy the user. This creates the problem to search for the desired answer. To solve this problem, the trend of developing semantic search engines is increasing day by day. Semantic search engines work to extract the best answer of user queries which exactly fits with it. Traditional search engines are keyword based which means that they do not know the meaning of the words which we type in our queries. Due to this reason, the semantic search engines super pass the conventional search engines because they give us meaningful and well-defined information. In this paper, we will discuss the background of Semantic searching, about semantic search engines; the technology used for the semantic search engines and some of the existing semantic search engines on various factors are compared.
DEFF Research Database (Denmark)
Jensen, Kurt
1991-01-01
This paper describes how Coloured Petri Nets (CP-nets) have been developed — from being a promising theoretical model to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and...... use of CP-nets — because it means that the function representation and the translations (which are a bit mathematically complex) no longer are parts of the basic definition of CP-nets. Instead they are parts of the invariant method (which anyway demands considerable mathematical skills...
Ferrara, Alex
2007-01-01
Web services are poised to become a key technology for a wide range of Internet-enabled applications, spanning everything from straight B2B systems to mobile devices and proprietary in-house software. While there are several tools and platforms that can be used for building web services, developers are finding a powerful tool in Microsoft's .NET Framework and Visual Studio .NET. Designed from scratch to support the development of web services, the .NET Framework simplifies the process--programmers find that tasks that took an hour using the SOAP Toolkit take just minutes. Programming .NET
DEFF Research Database (Denmark)
Westergaard, Michael
2006-01-01
This paper introduces the notion of game coloured Petri nets. This allows the modeler to explicitly model what parts of the model comprise the modeled system and what parts are the environment of the modeled system. We give the formal definition of game coloured Petri nets, a means of reachability...... analysis of this net class, and an application of game coloured Petri nets to automatically generate easy-to-understand visualizations of the model by exploiting the knowledge that some parts of the model are not interesting from a visualization perspective (i.e. they are part of the environment...
The global convergence of the non-quasi-Newton methods with non-monotone line search
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The non-quasi-Newton methods for unconstrained optimization was investigated. Non-monotone line search procedure is introduced, which is combined with the non-quasi-Newton family. Under the uniform convexity assumption on objective function, the global convergence of the non-quasi-Newton family was proved.Numerical experiments showed that the non-monotone line search was more effective.
How to project onto the monotone nonnegative cone using Pool Adjacent Violators type algorithms
Németh, A B
2012-01-01
The metric projection onto an order nonnegative cone from the metric projection onto the corresponding order cone is derived. Particularly, we can use Pool Adjacent Violators-type algorithms developed for projecting onto the monotone cone for projecting onto the monotone nonnegative cone too.
An analysis of the stability and monotonicity of a kind of control models
Directory of Open Access Journals (Sweden)
LU Yifa
2013-06-01
Full Text Available The stability and monotonicity of control systems with parameters are considered.By the iterative relationship of the coefficients of characteristic polynomials and the Mathematica software,some sufficient conditions for the monotonicity and stability of systems are given.
Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.
2005-01-01
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems i
A novel complex-system-view-based method for system effectiveness analysis: Monotonic indexes space
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Based on the characteristics of the complex system, this paper presents a novel method, the monotonic indexes space method, for the effectiveness analysis of the complex system. First, it presents some basic concepts and assumption such as the monotonic indexes space, monotonic indexes requirement locus, etc. Second, based on the assumption that indexes are monotonic for the requirements, an algorithm is proposed and applied to numerical approximation of monotonic indexes requirement locus with hyperboxes. Third, this paper proposes two algorithms for acquiring intersection of several monotonic indexes requirement locus. Fourth, this paper proposes the monotonic-index- space based system analysis model such as the system evaluation model, the sensitivity analysis model for indexes. Based on the practical requirement, the concept of fuzzy monotonic indexes requirement locus and the corresponding analysis model are introduced. Finally, this paper applies the above-mentioned models to analyze the effectiveness of a notional anti-stealth-air-defense information system. And the outputs show that the method is promising.
Effects of temperature on monotonic and fatigue properties of carbon fibre epoxy cross ply laminates
Matsuhisa, Y.; King, J.
1993-01-01
The effects of test temperature on damage accumulation behaviour has been studied using "Torayca" T800H / #3631 in conditions of monotonic and fatigue loading. The damage accumulation behaviour was found to vary as a function of the test temperature, with the effect of temperature on the damage behaviour being different between monotonic and fatigue loading.
Effects of temperature on monotonic and fatigue properties of carbon fibre epoxy cross ply laminates
Energy Technology Data Exchange (ETDEWEB)
Matsuhisa, Y. (Composite Materials Research Labs., Toray Industries Inc., Ehime (Japan)); King, J.E. (Composite Materials Research Labs., Toray Industries Inc., Ehime (Japan) Dept. of Materials Science and Metallurgy, Univ. of Cambridge (United Kingdom))
1993-11-01
The effects of test temperature on damage accumulation behaviour has been studied using ''Torayca'' T800H/[3631] in conditions of monotonic and fatigue loading. The damage accumulation behaviour was found to vary as a function of the test temperature, with the effect of temperature on the damage behaviour being different between monotonic and fatigue loading. (orig.).
Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.
2005-01-01
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems
Kovyrkina, O. A.; Ostapenko, V. V.
2016-05-01
The monotonicity of the CABARET scheme approximating a hyperbolic differential equation with a sign-changing characteristic field is analyzed. Monotonicity conditions for this scheme are obtained in domains where the characteristics have a sign-definite propagation velocity and near sonic lines, on which the propagation velocity changes its sign. These properties of the CABARET scheme are illustrated by test computations.
Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.
2005-01-01
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems i
Computation of displacements for nonlinear elastic beam models using monotone iterations
Directory of Open Access Journals (Sweden)
Philip Korman
1988-01-01
Full Text Available We study displacement of a uniform elastic beam subject to various physically important boundary conditions. Using monotone methods, we discuss stability and instability of solutions. We present computations, which suggest efficiency of monotone methods for fourth order boundary value problems.
Developing Semantic Business Model for VO Construction on Semantic Grid
Institute of Scientific and Technical Information of China (English)
CHU Wang; QIAN Depei
2006-01-01
This paper combines semantic web technology with business modeling and yields semantic business model that is semantically described in terms of roles and relationships. The semantic business model can be used to discover grid services by means of automation tools. The gap between business goals and grid services is bridged by role relationships and compositions of them, so that the virtual organization evolution is supported effectively. Semantic business model can support virtual organization validation at design stage rather than at run-time stage. The designers can animate their business model and make initial assessment of what interactions should occur between roles and in which order. The users can verify whether the grid service compositions satisfy business goals.
The UMLS Semantic Network and the Semantic Web.
Kashyap, Vipul
2003-01-01
The Unified Medical Language System is an extensive source of biomedical knowledge developed and maintained by the US National Library of Medicine (NLM) and is being currently used in a wide variety of biomedical applications. The Semantic Network, a component of the UMLS is a structured description of core biomedical knowledge consisting of well defined semantic types and relationships between them. We investigate the expressiveness of DAML+OIL, a markup language proposed for ontologies on the Semantic Web, for representing the knowledge contained in the Semantic Network. Requirements specific to the Semantic Network, such as polymorphic relationships and blocking relationship inheritance are discussed and approaches to represent these in DAML+OIL are presented. Finally, conclusions are presented along with a discussion of ongoing and future work.
Properties of Distributed Timed-Arc Petri Nets
DEFF Research Database (Denmark)
Nielsen, M.; Sassone, V.; Srba, J.
2001-01-01
In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This formalism enables to model e.g. hardware architectures like GALS. We give a formal de...... definition of process semantics for our model and investigate several properties of local versus global timing: expressiveness, reachability and coverability....
Universal semantic communication
Juba, Brendan
2011-01-01
Is meaningful communication possible between two intelligent parties who share no common language or background? In this work, a theoretical framework is proposed in which it is possible to address when and to what extent such semantic communication is possible: such problems can be rigorously addressed by explicitly focusing on the goals of the communication. Under this framework, it is possible to show that for many goals, communication without any common language or background is possible using universal protocols. This work should be accessible to anyone with an undergraduate-level knowled
2006-09-01
the information out of various types of EXIF digital camera files and show it in a reasonably consistent way (schema), 2003. http://www.w3.org/2000...many documents are not expressible in logica at all, and many in logic but not in N3. However, we are building a system for which a prime goal is the...demonstrate that conventional logica programming tools are efficent and straightforwradly adapted to semantic web work. • Jena RDF toolkit now accepts N3 as
Semantic and Process Interoperability
Directory of Open Access Journals (Sweden)
Félix Oscar Fernández Peña
2010-05-01
Full Text Available Knowledge management systems support education at different levels of the education. This is very important for the process in which the higher education of Cuba is involved. Structural transformations of teaching are focused on supporting the foundation of the information society in the country. This paper describes technical aspects of the designing of a model for the integration of multiple knowledgemanagement tools supporting teaching. The proposal is based on the definition of an ontology for the explicit formal description of the semantic of motivations of students and teachers in the learning process. Its target is to facilitate knowledge spreading.
DEFF Research Database (Denmark)
Levisen, Carsten
kilimand faetem with the newly imported English word vaeolens (violence). My study provides newevidence for how cognitive and semantic change co-occur in the context of postcolonial linguisticcommunities, and my paper addresses an important, ongoing controversy related to the notion of“Anglocentric bias...... counterparts in many (most) languages, and thatPinker’s claims are Anglocentric in nature. My papir studies the intricate details of vaeolens, as a new word that has attracted a number ofother English-based phraseologies such as vaeolens againsem woman ‘violence against women’,and vaeolens againsem pikinini...
Semantic Roles and Grammatical Relations.
Van Valin, Robert D., Jr.
The nature of semantic roles and grammatical relations are explored from the perspective of Role and Reference Grammar (RRG). It is proposed that unraveling the relational aspects of grammar involves the recognition that semantic roles fall into two types, thematic relations and macroroles, and that grammatical relations are not universal and are…
The Problem of Naturalizing Semantics.
Sullivan, Arthur
2000-01-01
Investigates conceptual barriers prevalent in the works of both proponents and opponents of semantic naturalism. Searches for a tenable definition of naturalism according to which one can be a realist, a non-reductionist, and a naturalist about semantic content. (Author/VWL)
Semantic Processing of Mathematical Gestures
Lim, Vanessa K.; Wilson, Anna J.; Hamm, Jeff P.; Phillips, Nicola; Iwabuchi, Sarina J.; Corballis, Michael C.; Arzarello, Ferdinando; Thomas, Michael O. J.
2009-01-01
Objective: To examine whether or not university mathematics students semantically process gestures depicting mathematical functions (mathematical gestures) similarly to the way they process action gestures and sentences. Semantic processing was indexed by the N400 effect. Results: The N400 effect elicited by words primed with mathematical gestures…
Probabilistic Analysis of Pattern Formation in Monotonic Self-Assembly.
Moore, Tyler G; Garzon, Max H; Deaton, Russell J
2015-01-01
Inspired by biological systems, self-assembly aims to construct complex structures. It functions through piece-wise, local interactions among component parts and has the potential to produce novel materials and devices at the nanoscale. Algorithmic self-assembly models the product of self-assembly as the output of some computational process, and attempts to control the process of assembly algorithmically. Though providing fundamental insights, these computational models have yet to fully account for the randomness that is inherent in experimental realizations, which tend to be based on trial and error methods. In order to develop a method of analysis that addresses experimental parameters, such as error and yield, this work focuses on the capability of assembly systems to produce a pre-determined set of target patterns, either accurately or perhaps only approximately. Self-assembly systems that assemble patterns that are similar to the targets in a significant percentage are "strong" assemblers. In addition, assemblers should predominantly produce target patterns, with a small percentage of errors or junk. These definitions approximate notions of yield and purity in chemistry and manufacturing. By combining these definitions, a criterion for efficient assembly is developed that can be used to compare the ability of different assembly systems to produce a given target set. Efficiency is a composite measure of the accuracy and purity of an assembler. Typical examples in algorithmic assembly are assessed in the context of these metrics. In addition to validating the method, they also provide some insight that might be used to guide experimentation. Finally, some general results are established that, for efficient assembly, imply that every target pattern is guaranteed to be assembled with a minimum common positive probability, regardless of its size, and that a trichotomy exists to characterize the global behavior of typical efficient, monotonic self-assembly systems
Probabilistic Analysis of Pattern Formation in Monotonic Self-Assembly.
Directory of Open Access Journals (Sweden)
Tyler G Moore
Full Text Available Inspired by biological systems, self-assembly aims to construct complex structures. It functions through piece-wise, local interactions among component parts and has the potential to produce novel materials and devices at the nanoscale. Algorithmic self-assembly models the product of self-assembly as the output of some computational process, and attempts to control the process of assembly algorithmically. Though providing fundamental insights, these computational models have yet to fully account for the randomness that is inherent in experimental realizations, which tend to be based on trial and error methods. In order to develop a method of analysis that addresses experimental parameters, such as error and yield, this work focuses on the capability of assembly systems to produce a pre-determined set of target patterns, either accurately or perhaps only approximately. Self-assembly systems that assemble patterns that are similar to the targets in a significant percentage are "strong" assemblers. In addition, assemblers should predominantly produce target patterns, with a small percentage of errors or junk. These definitions approximate notions of yield and purity in chemistry and manufacturing. By combining these definitions, a criterion for efficient assembly is developed that can be used to compare the ability of different assembly systems to produce a given target set. Efficiency is a composite measure of the accuracy and purity of an assembler. Typical examples in algorithmic assembly are assessed in the context of these metrics. In addition to validating the method, they also provide some insight that might be used to guide experimentation. Finally, some general results are established that, for efficient assembly, imply that every target pattern is guaranteed to be assembled with a minimum common positive probability, regardless of its size, and that a trichotomy exists to characterize the global behavior of typical efficient, monotonic
Fused Lasso Screening Rules via the Monotonicity of Subdifferentials.
Wang, Jie; Fan, Wei; Ye, Jieping
2015-09-01
Fused Lasso is a popular regression technique that encodes the smoothness of the data. It has been applied successfully to many applications with a smooth feature structure. However, the computational cost of the existing solvers for fused Lasso is prohibitive when the feature dimension is extremely large. In this paper, we propose novel screening rules that are able to quickly identity the adjacent features with the same coefficients. As a result, the number of variables to be estimated can be significantly reduced, leading to substantial savings in computational cost and memory usage. To the best of our knowledge, the proposed approach is the first attempt to develop screening methods for the fused Lasso problem with general data matrix. Our major contributions are: 1) we derive a new dual formulation of fused Lasso that comes with several desirable properties; 2) we show that the new dual formulation of fused Lasso is equivalent to that of the standard Lasso by two affine transformations; 3) we propose a novel framework for developing effective and efficient screening rules for fused Lasso via the monotonicity of the subdifferentials (FLAMS). Some appealing features of FLAMS are: 1) our methods are safe in the sense that the detected adjacent features are guaranteed to have the same coefficients; 2) the dataset needs to be scanned only once to run the screening, whose computational cost is negligible compared to that of solving the fused Lasso; (3) FLAMS is independent of the solvers and can be integrated with any existing solvers. We have evaluated the proposed FLAMS rules on both synthetic and real datasets. The experiments indicate that FLAMS is very effective in identifying the adjacent features with the same coefficients. The speedup gained by FLAMS can be orders of magnitude.
Local Monotonicity and Isoperimetric Inequality on Hypersurfaces in Carnot groups
Directory of Open Access Journals (Sweden)
Francesco Paolo Montefalcone
2010-12-01
Full Text Available Let G be a k-step Carnot group of homogeneous dimension Q. Later on we shall present some of the results recently obtained in [32] and, in particular, an intrinsic isoperimetric inequality for a C2-smooth compact hypersurface S with boundary @S. We stress that S and @S are endowed with the homogeneous measures n????1 H and n????2 H , respectively, which are actually equivalent to the intrinsic (Q - 1-dimensional and (Q - 2-dimensional Hausdor measures with respect to a given homogeneous metric % on G. This result generalizes a classical inequality, involving the mean curvature of the hypersurface, proven by Michael and Simon [29] and Allard [1], independently. One may also deduce some related Sobolev-type inequalities. The strategy of the proof is inspired by the classical one and will be discussed at the rst section. After reminding some preliminary notions about Carnot groups, we shall begin by proving a linear isoperimetric inequality. The second step is a local monotonicity formula. Then we may achieve the proof by a covering argument.We stress however that there are many dierences, due to our non-Euclidean setting.Some of the tools developed ad hoc are, in order, a \\blow-up" theorem, which holds true also for characteristic points, and a smooth Coarea Formula for the HS-gradient. Other tools are the horizontal integration by parts formula and the 1st variation formula for the H-perimeter n????1H already developed in [30, 31] and then generalized to hypersurfaces having non-empty characteristic set in [32]. These results can be useful in the study of minimal and constant horizontal mean curvature hypersurfaces in Carnot groups.
Ontologies: Semantic Nirvana for Earth Science Model Interoperability? (Invited)
Graybeal, J.
2009-12-01
The Challenge: When we build a given model, we do so to meet today's needs. If the model is good, new people will want to use it in new ways. That tests how well the model can work in new contexts: new user groups, new science domains, or new data providers or data users. We can say a model is interoperable if it works well in each new case, with few or no changes. Here we deal with perhaps the least-addressed part of model interoperability: semantic interoperability, the ability of models to understand the meaning of each other's data. The Scenario: A model has been built that uses observational data, and creates output data sets. In subsequent years, the model must (a) be connected to another model and exchange data with it; (b) be evaluated and used by a scientist in another domain; (c) document its outputs for two different repositories that use different keywords; and (d) identify and incorporate new observation streams as they come on-line. All these steps are mostly done manually today, and explanations about the data exchanged in similar form. Can we make them more efficient, or even automated, by leveraging good semantic practices? A problem in each case is the use of local or community naming conventions that are not known to all parties. How can this be improved? The Reality: Many models use the standard name conventions and vocabularies specified by the netCDF COARDS Climate and Forecast conventions. These provide a good basic level of 'semantic interoperability', and for this reason alone Earth science models are semantically far ahead of most other Earth science data systems. Yet these conventions aren't always used, aren't always sufficient, and don't help us interoperate with lots of existing systems. What are the issues for semantic interoperability in modeling, how do ontologies and other semantic capabilities help us fix them, and are ontologies worth the trouble?
DEFF Research Database (Denmark)
Hørning, Annette
1994-01-01
Artiklen beskæftiger sig med muligheden for at anvende kunstige neurale net i forbindelse med datamatisk procession af naturligt sprog, specielt automatisk talegenkendelse.......Artiklen beskæftiger sig med muligheden for at anvende kunstige neurale net i forbindelse med datamatisk procession af naturligt sprog, specielt automatisk talegenkendelse....
DEFF Research Database (Denmark)
Jordan, Ulrike; Vajen, Klaus; Bales, Chris;
2014-01-01
SolNet, founded in 2006, is the first coordinated International PhD education program on Solar Thermal Engineering. The SolNet network is coordinated by the Institute of Thermal Engineering at Kassel University, Germany. The network offers PhD courses on solar heating and cooling, conference...
CSIR Research Space (South Africa)
Lindeque, M
2013-01-01
Full Text Available Is it possible to develop a building that uses a net zero amount of water? In recent years it has become evident that it is possible to have buildings that use a net zero amount of electricity. This is possible when the building is taken off...
Evangelopoulos, Nicholas E
2013-11-01
This article reviews latent semantic analysis (LSA), a theory of meaning as well as a method for extracting that meaning from passages of text, based on statistical computations over a collection of documents. LSA as a theory of meaning defines a latent semantic space where documents and individual words are represented as vectors. LSA as a computational technique uses linear algebra to extract dimensions that represent that space. This representation enables the computation of similarity among terms and documents, categorization of terms and documents, and summarization of large collections of documents using automated procedures that mimic the way humans perform similar cognitive tasks. We present some technical details, various illustrative examples, and discuss a number of applications from linguistics, psychology, cognitive science, education, information science, and analysis of textual data in general. WIREs Cogn Sci 2013, 4:683-692. doi: 10.1002/wcs.1254 CONFLICT OF INTEREST: The author has declared no conflicts of interest for this article. For further resources related to this article, please visit the WIREs website. © 2013 John Wiley & Sons, Ltd.
Song, Daegene
2016-01-01
Both the choice made by the observer and consciousness are discussed in terms of cyclical time. That is, while the process of classical choice evolves forward in time, the quantum reference frame evolves backward in time to equate itself with the classical choice made by the observer, such that at the end, this corresponds to the case of self-observation in consciousness in linear time. This indicates that discrete and finite information is accompanied by a continuous or infinite "semantic" quantum part. In particular, the continuous semantic aspect is considered to be related to universal grammar, a suggested innate structure in languages. This paper also argues that the cyclical time model can be considered to have both small and large cycles and will also argue that at the most basic level, consciousness is strongly connected to time. This means that another aspect is added, that is, a more detailed description of the ongoing proposal of the subjective model, in which the classical is just as fundamental a...
DEFF Research Database (Denmark)
Marszal, Anna Joanna; Bourrelle, Julien S.; Musall, Eike
2010-01-01
and identify possible renewable energy supply options which may be considered in calculations. Finally, the gap between the methodology proposed by each organisation and their respective national building code is assessed; providing an overview of the possible changes building codes will need to undergo......The international cooperation project IEA SHC Task 40 / ECBCS Annex 52 “Towards Net Zero Energy Solar Buildings”, attempts to develop a common understanding and to set up the basis for an international definition framework of Net Zero Energy Buildings (Net ZEBs). The understanding of such buildings...... and how the Net ZEB status should be calculated differs in most countries. This paper presents an overview of Net ZEBs energy calculation methodologies proposed by organisations representing eight different countries: Austria, Canada, Denmark, Germany, Italy, Norway, Switzerland and the USA. The different...
Directory of Open Access Journals (Sweden)
Thea eLu
2012-12-01
Full Text Available Neutrophils constitute a critical part of innate immunity and are well known for their ability to phagocytose and kill invading microorganisms. The microbicidal processes employed by neutrophils are highly effective at killing most ingested bacteria and fungi. However, an alternative non-phagocytic antimicrobial mechanism of neutrophils has been proposed whereby microorganisms are eliminated by neutrophil extracellular traps (NETs. NETs are comprised of DNA, histones, and antimicrobial proteins extruded by neutrophils during NETosis, a cell death pathway reported to be distinct from apoptosis, phagocytosis-induced cell death, and necrosis. Although multiple laboratories have reported NETs using various stimuli in vitro, the molecular mechanisms involved in this process have yet to be definitively elucidated, and many questions regarding the formation and putative role or function of NETs in innate host defense remain unanswered. It is with these questions in mind that we provide some reflection and perspective on NETs and NETosis.
Jefferies, Elizabeth; Rogers, Timothy T.; Hopper, Samantha; Lambon Ralph, Matthew A.
2010-01-01
Patients with semantic dementia show a specific pattern of impairment on both verbal and non-verbal "pre-semantic" tasks, e.g., reading aloud, past tense generation, spelling to dictation, lexical decision, object decision, colour decision and delayed picture copying. All seven tasks are characterised by poorer performance for items that are…
Adding semantics to image-region annotations with the Name-It-Game
Steggink, J.; Snoek, C.G.M.
2011-01-01
In this paper we present the Name-It-Game, an interactive multimedia game fostering the swift creation of a large data set of region-based image annotations. Compared to existing annotation games, we consider an added semantic structure, by means of the WordNet ontology, the main innovation of the N
Energy Technology Data Exchange (ETDEWEB)
Angelis, G I; Kotasidis, F A; Matthews, J C [Imaging, Proteomics and Genomics, MAHSC, University of Manchester, Wolfson Molecular Imaging Centre, Manchester (United Kingdom); Reader, A J [Montreal Neurological Institute, McGill University, Montreal (Canada); Lionheart, W R, E-mail: georgios.angelis@mmic.man.ac.uk [School of Mathematics, University of Manchester, Alan Turing Building, Manchester (United Kingdom)
2011-07-07
Iterative expectation maximization (EM) techniques have been extensively used to solve maximum likelihood (ML) problems in positron emission tomography (PET) image reconstruction. Although EM methods offer a robust approach to solving ML problems, they usually suffer from slow convergence rates. The ordered subsets EM (OSEM) algorithm provides significant improvements in the convergence rate, but it can cycle between estimates converging towards the ML solution of each subset. In contrast, gradient-based methods, such as the recently proposed non-monotonic maximum likelihood (NMML) and the more established preconditioned conjugate gradient (PCG), offer a globally convergent, yet equally fast, alternative to OSEM. Reported results showed that NMML provides faster convergence compared to OSEM; however, it has never been compared to other fast gradient-based methods, like PCG. Therefore, in this work we evaluate the performance of two gradient-based methods (NMML and PCG) and investigate their potential as an alternative to the fast and widely used OSEM. All algorithms were evaluated using 2D simulations, as well as a single [{sup 11}C]DASB clinical brain dataset. Results on simulated 2D data show that both PCG and NMML achieve orders of magnitude faster convergence to the ML solution compared to MLEM and exhibit comparable performance to OSEM. Equally fast performance is observed between OSEM and PCG for clinical 3D data, but NMML seems to perform poorly. However, with the addition of a preconditioner term to the gradient direction, the convergence behaviour of NMML can be substantially improved. Although PCG is a fast convergent algorithm, the use of a (bent) line search increases the complexity of the implementation, as well as the computational time involved per iteration. Contrary to previous reports, NMML offers no clear advantage over OSEM or PCG, for noisy PET data. Therefore, we conclude that there is little evidence to replace OSEM as the algorithm of choice
ONTOLOGY BASED MEANINGFUL SEARCH USING SEMANTIC WEB AND NATURAL LANGUAGE PROCESSING TECHNIQUES
Directory of Open Access Journals (Sweden)
K. Palaniammal
2013-10-01
Full Text Available The semantic web extends the current World Wide Web by adding facilities for the machine understood description of meaning. The ontology based search model is used to enhance efficiency and accuracy of information retrieval. Ontology is the core technology for the semantic web and this mechanism for representing formal and shared domain descriptions. In this paper, we proposed ontology based meaningful search using semantic web and Natural Language Processing (NLP techniques in the educational domain. First we build the educational ontology then we present the semantic search system. The search model consisting three parts which are embedding spell-check, finding synonyms using WordNet API and querying ontology using SPARQL language. The results are both sensitive to spell check and synonymous context. This paper provides more accurate results and the complete details for the selected field in a single page.
Sequence Semantics for Dynamic Predicate Logic
Vermeulen, C.F.M.
2008-01-01
In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments. This semantics is compared with the usual relational semantics for dynamic predicate logic: it is shown that the most important intuitions of the usual semantics are preserved. Then it is shown
Semantic understanding of Image content
Directory of Open Access Journals (Sweden)
D D Dhobale
2011-05-01
Full Text Available Large amounts of spatial data are becoming available today due to the rapid development of remote sensing techniques. Several retrieval systems are proposed to retrieve necessary, interested and effective information such as key- word based image retrieval and content based image retrieval. However, the results of these approaches are generally unsatisfactory, unpredictable and do not match human perception due to the well gap between visual features and semantic concepts. In this paper, we propose a new approach allowing semantic satellite image retrieval, describing the semantic image content and managing uncertain information. It is based on ontology model which represents spatial knowledge in order to provide semantic understanding of image content. Our retrieval system is based on two modules: ontological model merging and semantic strategic image retrieval. The first module allows developing ontological models which represent spatial knowledge of the satellite image, and managing uncertain information. The second module allows retrieving satellite images basing on their ontological model. In order to improve the quality of retrieval system and to facilitate the retrieval process, we propose two retrieval strategies which are the opportunist strategy and the hypothetic strategy. Our approach attempts to improve the quality of image retrieval, to reduce the semantic gap between visual features and semantic concepts and to provide an automatic solution for efficient satellite image retrieval.
Ritchie, Stephen D
2011-01-01
Pro .NET Best Practices is a practical reference to the best practices that you can apply to your .NET projects today. You will learn standards, techniques, and conventions that are sharply focused, realistic and helpful for achieving results, steering clear of unproven, idealistic, and impractical recommendations. Pro .NET Best Practices covers a broad range of practices and principles that development experts agree are the right ways to develop software, which includes continuous integration, automated testing, automated deployment, and code analysis. Whether the solution is from a free and
Energy Technology Data Exchange (ETDEWEB)
2016-09-01
The technology necessary to build net zero energy buildings (NZEBs) is ready and available today, however, building to net zero energy performance levels can be challenging. Energy efficiency measures, onsite energy generation resources, load matching and grid interaction, climatic factors, and local policies vary from location to location and require unique methods of constructing NZEBs. It is recommended that Components start looking into how to construct and operate NZEBs now as there is a learning curve to net zero construction and FY 2020 is just around the corner.
DEFF Research Database (Denmark)
Marszal, Anna Joanna; Bourrelle, Julien S.; Musall, Eike
2010-01-01
The international cooperation project IEA SHC Task 40 / ECBCS Annex 52 “Towards Net Zero Energy Solar Buildings”, attempts to develop a common understanding and to set up the basis for an international definition framework of Net Zero Energy Buildings (Net ZEBs). The understanding of such buildings...... and identify possible renewable energy supply options which may be considered in calculations. Finally, the gap between the methodology proposed by each organisation and their respective national building code is assessed; providing an overview of the possible changes building codes will need to undergo...
Exploiting Recurring Structure in a Semantic Network
Wolfe, Shawn R.; Keller, Richard M.
2004-01-01
With the growing popularity of the Semantic Web, an increasing amount of information is becoming available in machine interpretable, semantically structured networks. Within these semantic networks are recurring structures that could be mined by existing or novel knowledge discovery methods. The mining of these semantic structures represents an interesting area that focuses on mining both for and from the Semantic Web, with surprising applicability to problems confronting the developers of Semantic Web applications. In this paper, we present representative examples of recurring structures and show how these structures could be used to increase the utility of a semantic repository deployed at NASA.
Potechin, Aaron
2011-01-01
L (Logarithmic space) versus NL (Non-deterministic logarithmic space) is one of the great open problems in computational complexity theory. In the paper "Bounds on monotone switching networks for directed connectivity", we separated monotone analogues of L and NL using a model called the switching network model. In particular, by considering inputs consisting of just a path and isolated vertices, we proved that any monotone switching network solving directed connectivity on $N$ vertices must have size at least $N^{\\Omega(\\lg(N))}$ and this bound is tight. If we could show a similar result for general switching networks solving directed connectivity, then this would prove that $L \
Semantic Web Mining: Benefits, Challenges and Opportunities
Directory of Open Access Journals (Sweden)
Syeda Farha Shazmeen, Etyala Ramyasree
2012-12-01
Full Text Available Semantic Web Mining aims at combining the two areas Semantic Web and Web Mining by using semantics to improve mining and using mining to create semantics. Web Mining aims at discovering insights about the meaning of Web resources and their usage In Semantic Web, the semantics information is presented by the relation with others and is recorded by RDF. RDF which is semantic web technology that can be utilized to build efficient and scalable systems for Cloud. The Semantic Web enriches the World Wide Web by machine process able information which supports the user in his tasks, and also helps the users to get the exact search result .In this paper; we discuss the interplay of the Semantic Web with Web Mining, list out the benefits. Challenges, opportunities of the Semantic web are discussed.
Adaptive semantics visualization
Nazemi, Kawa
2016-01-01
This book introduces a novel approach for intelligent visualizations that adapts the different visual variables and data processing to human’s behavior and given tasks. Thereby a number of new algorithms and methods are introduced to satisfy the human need of information and knowledge and enable a usable and attractive way of information acquisition. Each method and algorithm is illustrated in a replicable way to enable the reproduction of the entire “SemaVis” system or parts of it. The introduced evaluation is scientifically well-designed and performed with more than enough participants to validate the benefits of the methods. Beside the introduced new approaches and algorithms, readers may find a sophisticated literature review in Information Visualization and Visual Analytics, Semantics and information extraction, and intelligent and adaptive systems. This book is based on an awarded and distinguished doctoral thesis in computer science.
Operational Semantics of Termination Types
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1996-01-01
In principle termination analysis is easy: find a well-founded ordering and prove that calls decrease with respect to the ordering. We show how to embed termination information into a polymorphic type system for an eager higher-order functional language allowing multiple-argument functions...... and algebraic data types. The well-founded orderings are defined by pattern matching against the definition of the algebraic data types. We prove that the analysis is semantically sound with respect to a big-step (or natural) operational semantics. We compare our approach based on operational semantics to one...
Workspaces in the Semantic Web
Wolfe, Shawn R.; Keller, RIchard M.
2005-01-01
Due to the recency and relatively limited adoption of Semantic Web technologies. practical issues related to technology scaling have received less attention than foundational issues. Nonetheless, these issues must be addressed if the Semantic Web is to realize its full potential. In particular, we concentrate on the lack of scoping methods that reduce the size of semantic information spaces so they are more efficient to work with and more relevant to an agent's needs. We provide some intuition to motivate the need for such reduced information spaces, called workspaces, give a formal definition, and suggest possible methods of deriving them.
Formal Component-Based Semantics
Madlener, Ken; van Eekelen, Marko; 10.4204/EPTCS.62.2
2011-01-01
One of the proposed solutions for improving the scalability of semantics of programming languages is Component-Based Semantics, introduced by Peter D. Mosses. It is expected that this framework can also be used effectively for modular meta theoretic reasoning. This paper presents a formalization of Component-Based Semantics in the theorem prover Coq. It is based on Modular SOS, a variant of SOS, and makes essential use of dependent types, while profiting from type classes. This formalization constitutes a contribution towards modular meta theoretic formalizations in theorem provers. As a small example, a modular proof of determinism of a mini-language is developed.
Semantic perception for ground robotics
Hebert, M.; Bagnell, J. A.; Bajracharya, M.; Daniilidis, K.; Matthies, L. H.; Mianzo, L.; Navarro-Serment, L.; Shi, J.; Wellfare, M.
2012-06-01
Semantic perception involves naming objects and features in the scene, understanding the relations between them, and understanding the behaviors of agents, e.g., people, and their intent from sensor data. Semantic perception is a central component of future UGVs to provide representations which 1) can be used for higher-level reasoning and tactical behaviors, beyond the immediate needs of autonomous mobility, and 2) provide an intuitive description of the robot's environment in terms of semantic elements that can shared effectively with a human operator. In this paper, we summarize the main approaches that we are investigating in the RCTA as initial steps toward the development of perception systems for UGVs.
Russian nominal semantics and morphology
DEFF Research Database (Denmark)
Nørgård-Sørensen, Jens
The principal idea behind this book is that lexis and grammar make up a single coherent structure. It is shown that the grammatical patterns of the different classes of Russian nominals are closely interconnected. They can be described as reflecting a limited set of semantic distinctions which...... are also rooted in the lexical-semantic classification of Russian nouns. The presentation focuses on semantics, both lexical and grammatical, and not least the connection between these two levels of content. The principal theoretical impact is the insight that grammar and lexis should not be seen...
Semantic acquisition games harnessing manpower for creating semantics
Šimko, Jakub
2014-01-01
A comprehensive and extensive review of state-of-the-art in semantics acquisition game (SAG) design A set of design patterns for SAG designers A set of case studies (real SAG projects) demonstrating the use of SAG design patterns
High Performance Descriptive Semantic Analysis of Semantic Graph Databases
Energy Technology Data Exchange (ETDEWEB)
Joslyn, Cliff A.; Adolf, Robert D.; al-Saffar, Sinan; Feo, John T.; Haglin, David J.; Mackey, Greg E.; Mizell, David W.
2011-06-02
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call descriptive semantic analysis of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.
Semantator: Annotating Clinical Narratives with Semantic Web Ontologies
Song, Dezhao; Chute, Christopher G; Tao, Cui
2012-01-01
To facilitate clinical research, clinical data needs to be stored in a machine processable and understandable way. Manual annotating clinical data is time consuming. Automatic approaches (e.g., Natural Language Processing systems) have been adopted to convert such data into structured formats; however, the quality of such automatically extracted data may not always be satisfying. In this paper, we propose Semantator, a semi-automatic tool for document annotation with Semantic Web ontologies. ...
Semantic Session Analysis for Web Usage Mining
Institute of Scientific and Technical Information of China (English)
ZHANG Hui; SONG Hantao; XU Xiaomei
2007-01-01
A semantic session analysis method partitioning Web usage logs is presented. Semantic Web usage log preparation model enhances usage logs with semantic. The Markov chain model based on ontology semantic measurement is used to identifying which active session a request should belong to. The competitive method is applied to determine the end of the sessions.Compared with other algorithms, more successful sessions are additionally detected by semantic outlier analysis.
Expansion Nets and Expansion Processes of Elementary Net Systems
Institute of Scientific and Technical Information of China (English)
曹存根
1995-01-01
Occurrence nets are insufficient to precisely describe executions of elementary net systems with contacts.Traditionally,S-complementation is used for removal of contacts from the systems.Although the main behavior and properties of the original elementary net systems are preserved during S-complementation,their topologies may be changed greatly.This paper introduces a new kind of nets-expansion nets-for representing behavior of elementary net systems.As shown in the paper,expansion nets are natural as well as sufficient for describing the precise behavior of elementary net systems with or without contactks.
U.S. Department of Health & Human Services — The PhysioNet Resource is intended to stimulate current research and new investigations in the study of complex biomedical and physiologic signals. It offers free...
Semantic Knowledge Acquisition of Information for Syntactic web
Directory of Open Access Journals (Sweden)
G.Nagarajan
2012-11-01
Full Text Available Information retrieval is one of the most common web service used. Information is knowledge. In earlierdays one has to find a resource person or resource library to acquire knowledge. But today just by typing akeyword on a search engine all kind of resources are available to us. Due to this mere advancement thereare trillions of information available on net. So, in this era we are in need of search engine which alsosearch with us by understanding the semantics of given query by the user. One such design is only possibleonly if we provide semantic to our ordinary HTML web page. In this paper we have explained the conceptof converting an HTML page to RDFS/OWL page. This technique is incorporated along with naturallanguage technology as we have to provide the Hyponym and Meronym of the given HTML pages. Throughthis automatic conversion the concept of intelligent information retrieval is framed.
Liberty, Jesse
2009-01-01
Bestselling author Jesse Liberty and industry expert Alex Horovitz uncover the common threads that unite the .NET 3.5 technologies, so you can benefit from the best practices and architectural patterns baked into the new Microsoft frameworks. The book offers a Grand Tour" of .NET 3.5 that describes how the principal technologies can be used together, with Ajax, to build modern n-tier and service-oriented applications. "
DEFF Research Database (Denmark)
Westergaard, Michael
2006-01-01
This paper introduces the notion of game coloured Petri nets. This allows the modeler to explicitly model what parts of the model comprise the modeled system and what parts are the environment of the modeled system. We give the formal definition of game coloured Petri nets, a means of reachabilit......, and not controllable by the system itself, or they are part of the system itself and therefore we need not worry about them)....
Semantic Knowledge Representation (SKR) API
U.S. Department of Health & Human Services — The SKR Project was initiated at NLM in order to develop programs to provide usable semantic representation of biomedical free text by building on resources...
Chinese semantic processing cerebral areas
Institute of Scientific and Technical Information of China (English)
SHAN Baoci; ZHANG Wutian; MA Lin; LI Dejun; CAO Bingli; TANG Yiyuan; WU Yigen; TANG Xiaowei
2003-01-01
This study has identified the active cerebral areas of normal Chinese that are associated with Chinese semantic processing using functional brain imaging. According to the traditional cognitive theory, semantic processing is not particularly associated with or affected by input modality. The functional brain imaging experiments were conducted to identify the common active areas of two modalities when subjects perform Chinese semantic tasks through reading and listening respectively. The result has shown that the common active areas include left inferior frontal gyrus (BA 44/45), left posterior inferior temporal gyrus (BA37); the joint area of inferior parietal lobules (BA40) and superior temporal gyrus, the ventral occipital areas and cerebella of both hemispheres. It gives important clue to further discerning the roles of different cerebral areas in Chinese semantic processing.
Problem Solving with General Semantics.
Hewson, David
1996-01-01
Discusses how to use general semantics formulations to improve problem solving at home or at work--methods come from the areas of artificial intelligence/computer science, engineering, operations research, and psychology. (PA)
Monotone Iterative Technique for Duffie-Epstein Type Backward Stochastic Differential Equations
Institute of Scientific and Technical Information of China (English)
SUN Xiao-jun; WU Yue
2005-01-01
For Duffle-Epstein type Backward Stochastic Differential Equations, the comparison theorem is proved. Based on the comparison theorem, by monotone iterative technique, the existence of the minimal and maximal solutions of the equations are proved.
Monotonicity in the Sample Size of the Length of Classical Confidence Intervals
Kagan, Abram M
2012-01-01
It is proved that the average length of standard confidence intervals for parameters of gamma and normal distributions monotonically decrease with the sample size. The proofs are based on fine properties of the classical gamma function.
Criteria for Response Monotonicity Preserving in Approximation of Fractional Order Systems
Institute of Scientific and Technical Information of China (English)
Mohammad Saleh Tavazoei
2016-01-01
In approximation of fractional order systems,a significant objective is to preserve the important properties of the original system.The monotonicity of time/frequency responses is one of these properties whose preservation is of great importance in approximation process.Considering this importance,the issues of monotonicity preservation of the step response and monotonicity preservation of the magnitude-frequency response are independently investigated in this paper.In these investigations,some conditions on approximating filters of fractional operators are found to guarantee the preservation of step/magnitude-frequency response monotonicity in approximation process.These conditions are also simplified in some special cases.In addition,numerical simulation results are presented to show the usefulness of the obtained conditions.
Greenhouse Modeling Using Continuous Timed Petri Nets
Directory of Open Access Journals (Sweden)
José Luis Tovany
2013-01-01
Full Text Available This paper presents a continuous timed Petri nets (ContPNs based greenhouse modeling methodology. The presented methodology is based on the definition of elementary ContPN modules which are designed to capture the components of a general energy and mass balance differential equation, like parts that are reducing or increasing variables, such as heat, CO2 concentration, and humidity. The semantics of ContPN is also extended in order to deal with variables depending on external greenhouse variables, such as solar radiation. Each external variable is represented by a place whose marking depends on an a priori known function, for instance, the solar radiation function of the greenhouse site, which can be obtained statistically. The modeling methodology is illustrated with a greenhouse modeling example.
Neural substrates of semantic memory.
Hart, John; Anand, Raksha; Zoccoli, Sandra; Maguire, Mandy; Gamino, Jacque; Tillman, Gail; King, Richard; Kraut, Michael A
2007-09-01
Semantic memory is described as the storage of knowledge, concepts, and information that is common and relatively consistent across individuals (e.g., memory of what is a cup). These memories are stored in multiple sensorimotor modalities and cognitive systems throughout the brain (e.g., how a cup is held and manipulated, the texture of a cup's surface, its shape, its function, that is related to beverages such as coffee, and so on). Our ability to engage in purposeful interactions with our environment is dependent on the ability to understand the meaning and significance of the objects and actions around us that are stored in semantic memory. Theories of the neural basis of the semantic memory of objects have produced sophisticated models that have incorporated to varying degrees the results of cognitive and neural investigations. The models are grouped into those that are (1) cognitive models, where the neural data are used to reveal dissociations in semantic memory after a brain lesion occurs; (2) models that incorporate both cognitive and neuroanatomical information; and (3) models that use cognitive, neuroanatomic, and neurophysiological data. This review highlights the advances and issues that have emerged from these models and points to future directions that provide opportunities to extend these models. The models of object memory generally describe how category and/or feature representations encode for object memory, and the semantic operations engaged in object processing. The incorporation of data derived from multiple modalities of investigation can lead to detailed neural specifications of semantic memory organization. The addition of neurophysiological data can potentially provide further elaboration of models to include semantic neural mechanisms. Future directions should incorporate available and newly developed techniques to better inform the neural underpinning of semantic memory models.
Semantic Deviation in Oliver Twist
Institute of Scientific and Technical Information of China (English)
康艺凡
2016-01-01
Dickens, with his adeptness with language, applies semantic deviation skillfully in his realistic novel Oliver Twist. However, most studies and comments home and abroad on it mainly focus on such aspects as humanity, society, and characters. Therefore, this thesis will take a stylistic approach to Oliver Twist from the perspective of semantic deviation, which is achieved by the use of irony, hyperbole, and pun and analyze how the application of the technique makes the novel attractive.
Are Some Semantic Changes Predictable?
DEFF Research Database (Denmark)
Schousboe, Steen
2010-01-01
Historical linguistics is traditionally concerned with phonology and syntax. With the exception of grammaticalization - the development of auxiliary verbs, the syntactic rather than localistic use of prepositions, etc. - semantic change has usually not been described as a result of regular deve...... developments, but only as specific meaning changes in individual words. This paper will suggest some regularities in semantic change, regularities which, like sound laws, have predictive power and can be tested against recorded languages....
Ashish, Naveen
2005-01-01
We provide an overview of several ongoing NASA endeavors based on concepts, systems, and technology from the Semantic Web arena. Indeed NASA has been one of the early adopters of Semantic Web Technology and we describe ongoing and completed R&D efforts for several applications ranging from collaborative systems to airspace information management to enterprise search to scientific information gathering and discovery systems at NASA.
Efficient computation of argumentation semantics
Liao, Beishui
2013-01-01
Efficient Computation of Argumentation Semantics addresses argumentation semantics and systems, introducing readers to cutting-edge decomposition methods that drive increasingly efficient logic computation in AI and intelligent systems. Such complex and distributed systems are increasingly used in the automation and transportation systems field, and particularly autonomous systems, as well as more generic intelligent computation research. The Series in Intelligent Systems publishes titles that cover state-of-the-art knowledge and the latest advances in research and development in intelligen
Monotone methods for solving a boundary value problem of second order discrete system
Directory of Open Access Journals (Sweden)
Wang Yuan-Ming
1999-01-01
Full Text Available A new concept of a pair of upper and lower solutions is introduced for a boundary value problem of second order discrete system. A comparison result is given. An existence theorem for a solution is established in terms of upper and lower solutions. A monotone iterative scheme is proposed, and the monotone convergence rate of the iteration is compared and analyzed. The numerical results are given.
On the rate of convergence of the maximum likelihood estimator of a k-monotone density
Institute of Scientific and Technical Information of China (English)
WELLNER; Jon; A
2009-01-01
Bounds for the bracketing entropy of the classes of bounded k-monotone functions on [0,A] are obtained under both the Hellinger distance and the Lp(Q) distance,where 1 p < ∞ and Q is a probability measure on [0,A].The result is then applied to obtain the rate of convergence of the maximum likelihood estimator of a k-monotone density.
On the rate of convergence of the maximum likelihood estimator of a K-monotone density
Institute of Scientific and Technical Information of China (English)
GAO FuChang; WELLNER Jon A
2009-01-01
Bounds for the bracketing entropy of the classes of bounded K-monotone functions on [0, A] are obtained under both the Hellinger distance and the LP(Q) distance, where 1 ≤ p < ∞ and Q is a probability measure on [0, A]. The result is then applied to obtain the rate of convergence of the maximum likelihood estimator of a K-monotone density.
Cuong LE VAN; Morhaim, Lisa; Vailakis, Yiannis
2008-01-01
We propose a new approach to the issue of existence and uniqueness of solutions to the Bellman equation, exploiting an emerging class of methods, called monotone map methods, pioneered in the work of Krasnosel’skii (1964) and Krasnosel’skii-Zabreiko (1984). The approach is technically simple and intuitive. It is derived from geometric ideas related to the study of fixed points for monotone concave operators defined on partially order spaces.
MIXED MONOTONE ITERATIVE TECHNIQUES FOR SEMILINEAR EVOLUTION EQUATIONS IN BANACH SPACES
Institute of Scientific and Technical Information of China (English)
王良龙; 王志成
2004-01-01
This paper is concerned with initial value problems for semilinear evolution equations in Banach spaces. The abstract iterative schemes are constructed by combining the theory of semigroups of linear operators and the method of mixed monotone iterations. Some existence results on minimal and maximal (quasi)solutions are established for abstract semilinear evolution equations with mixed monotone or mixed quasimonotone nonlinear terms. To illustrate the main results, applications to ordinary differential equations and partial differential equations are also given.
Global Attractivity Results for Mixed-Monotone Mappings in Partially Ordered Complete Metric Spaces
Directory of Open Access Journals (Sweden)
Kalabušić S
2009-01-01
Full Text Available We prove fixed point theorems for mixed-monotone mappings in partially ordered complete metric spaces which satisfy a weaker contraction condition than the classical Banach contraction condition for all points that are related by given ordering. We also give a global attractivity result for all solutions of the difference equation , where satisfies mixed-monotone conditions with respect to the given ordering.
Global Attractivity Results for Mixed-Monotone Mappings in Partially Ordered Complete Metric Spaces
Directory of Open Access Journals (Sweden)
Dž. Burgić
2009-01-01
Full Text Available We prove fixed point theorems for mixed-monotone mappings in partially ordered complete metric spaces which satisfy a weaker contraction condition than the classical Banach contraction condition for all points that are related by given ordering. We also give a global attractivity result for all solutions of the difference equation zn+1=F(zn,zn−1, n=2,3,…, where F satisfies mixed-monotone conditions with respect to the given ordering.
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
Directory of Open Access Journals (Sweden)
Heinz Werner Höppel
2012-02-01
Full Text Available The monotonic and cyclic deformation behavior of ultrafine-grained metastable austenitic steel AISI 304L, produced by severe plastic deformation, was investigated. Under monotonic loading, the martensitic phase transformation in the ultrafine-grained state is strongly favored. Under cyclic loading, the martensitic transformation behavior is similar to the coarse-grained condition, but the cyclic stress response is three times larger for the ultrafine-grained condition.
Health inequality and non-monotonicity of the health related social welfare function.
Dutta, Indranil
2007-03-01
In a recent paper in this journal Abasolo and Tsuchiya [Abasolo, I., Tsuchiya, A., 2004. Exploring social welfare functions and violation of monotonicity: an example from inequalities in health. Journal of Health Economics 23, 313-329] have strongly argued for the use of a non-monotonic health related social welfare function. This note discusses both the limitations of the measure proposed by Abasolo and Tsuchiya [Abasolo, I., Tsuchiya, A., 2004. Exploring social welfare functions and violation of monotonicity: an example from inequalities in health. Journal of Health Economics 23, 313-329] and the problems associated with their empirics. We are able to show how non-monotonicity may lead to paradoxical results and policies. Further we examine the empirics of Abasolo and Tsuchiya [Abasolo, I., Tsuchiya, A., 2004. Exploring social welfare functions and violation of monotonicity: an example from inequalities in health. Journal of Health Economics 23, 313-329] and provide an alternative explanation to the observed patterns in the data that do not violate monotonicity. Finally we briefly mention why the Atkinson-Sen framework may be more appropriate as a way forward.
Terra Populus and DataNet Collaboration
Kugler, T.; Ruggles, S.; Fitch, C. A.; Clark, P. D.; Sobek, M.; Van Riper, D.
2012-12-01
Terra Populus, part of NSF's new DataNet initiative, is developing organizational and technical infrastructure to integrate, preserve, and disseminate data describing changes in the human population and environment over time. Terra Populus will incorporate large microdata and aggregate census datasets from the United States and around the world, as well as land use, land cover, climate and other environmental datasets. These data are widely dispersed, exist in a variety of data structures, have incompatible or inadequate metadata, and have incompatible geographic identifiers. Terra Populus is developing methods of integrating data from different domains and translating across data structures based on spatio-temporal linkages among data contents. The new infrastructure will enable researchers to identify and merge data from heterogeneous sources to study the relationships between human behavior and the natural world. Terra Populus will partner with data archives, data producers, and data users to create a sustainable international organization that will guarantee preservation and access over multiple decades. Terra Populus is also collaborating with the other projects in the DataNet initiative - DataONE, the DataNet Federation Consortium (DFC) and Sustainable Environment-Actionable Data (SEAD). Taken together, the four projects address aspects of the entire data lifecycle, including planning, collection, documentation, discovery, integration, curation, preservation, and collaboration; and encompass a wide range of disciplines including earth sciences, ecology, social sciences, hydrology, oceanography, and engineering. The four projects are pursuing activities to share data, tools, and expertise between pairs of projects as well as collaborating across the DataNet program on issues of cyberinfrastructure and community engagement. Topics to be addressed through program-wide collaboration include technical, organizational, and financial sustainability; semantic
Formal Semantics: Origins, Issues, Early Impact
Directory of Open Access Journals (Sweden)
Barbara H. Partee
2010-12-01
Linguistics Wars. New York and Oxford: Oxford University Press.Heim, I. 1982. The Semantics of Definite and Indefinite Noun Phrases. Ph.D. thesis, University of Massachusetts. Published 1989, New York: Garland. http://newstar.rinet.ru/~goga/biblio/heim (djvu or http://semanticsarchive.net/Archive/Tk0ZmYyY/ (very large PDF file.Heim, I. & Kratzer, A. 1998. Semantics in Generative Grammar. Oxford: Blackwell.https://udrive.oit.umass.edu/partee/Semantics_Readings/Heim%26Kratzer.pdf.Hintikka, J. 1973. ‘Carnap’s heritage in logical semantics’. Synthese 25: 372–397.Hintikka, K. J. J. 1962. Knowledge and Belief. Ithaca, N.Y.: Cornell University Press.Hintikka, K. J. J., Moravcsik, J. & Suppes, P. (eds.. 1973. Approaches to Natural Language. Ithaca, N.Y.: Cornell University Press.Hodges, W. 1998. ‘Compositionality is not the problem’. Logic and Logical Philosophy 6:7–33. http://www.logika.umk.pl/llp/06/hodges.pdf.Hodges, W. 2001. ‘Formal Features of Compositionality’. Journal of Logic, Language and Information 10: 7–28.http://dx.doi.org/10.1023/A:1026502210492Huck, G. J. & Goldsmith, J. A. 1995. Ideology and Linguistic Theory: Noam Chomsky and the Deep Structure Debates. London: Routledge.Jackendoff, R. 1972. Semantic Interpretation in Generative Grammar. Cambridge, Mass.: MIT Press.Jacobson, P. 1999. ‘Towards a variable-free semantics’. Linguistics and Philosophy 22: 117–184.http://dx.doi.org/10.1023/A:1005464228727Janssen, T. M. V. 1983. Foundations and Applications of Montague Grammar. Amsterdam: Mathematisch Centrum, University of Amsterdam.Kalish, D. & Montague, R. 1964. Logic: Techniques of Formal Reasoning. New York: Harcourt, Brace & World, Inc.Kalish, D., Montague, R., Mar, G. & Fogelin, R. J. 1980. Logic : Techniques of Formal Reasoning. New York: Harcourt Brace Jovanovich.Kanger, S. 1957a. ‘The Morning Star Paradox’. Theoria 23: 1–11.http://dx.doi.org/10.1111/j.1755-2567.1957.tb00263.xKanger, S. 1957b. ‘A note on quantification and
A Lexical Semantic Database for Verbmobil
Heinecke, J; Heinecke, Johannes; Worm, Karsten L.
1996-01-01
This paper describes the development and use of a lexical semantic database for the Verbmobil speech-to-speech machine translation system. The motivation is to provide a common information source for the distributed development of the semantics, transfer and semantic evaluation modules and to store lexical semantic information application-independently. The database is organized around a set of abstract semantic classes and has been used to define the semantic contributions of the lemmata in the vocabulary of the system, to automatically create semantic lexica and to check the correctness of the semantic representations built up. The semantic classes are modelled using an inheritance hierarchy. The database is implemented using the lexicon formalism LeX4 developed during the project.
Johnson, Matthew; Brostow, G. J.; Shotton, J.; Kwatra, V.; Cipolla, R.
2007-02-01
Composite images are synthesized from existing photographs by artists who make concept art, e.g. storyboards for movies or architectural planning. Current techniques allow an artist to fabricate such an image by digitally splicing parts of stock photographs. While these images serve mainly to "quickly" convey how a scene should look, their production is laborious. We propose a technique that allows a person to design a new photograph with substantially less effort. This paper presents a method that generates a composite image when a user types in nouns, such as "boat" and "sand." The artist can optionally design an intended image by specifying other constraints. Our algorithm formulates the constraints as queries to search an automatically annotated image database. The desired photograph, not a collage, is then synthesized using graph-cut optimization, optionally allowing for further user interaction to edit or choose among alternative generated photos. Our results demonstrate our contributions of (1) a method of creating specific images with minimal human effort, and (2) a combined algorithm for automatically building an image library with semantic annotations from any photo collection.
Semantic Legal Policies for Data Exchange and Protection across Super-Peer Domains in the Cloud
Directory of Open Access Journals (Sweden)
Kua-Ping Cheng
2012-10-01
Full Text Available In semantic policy infrastructure, a Trusted Legal Domain (TLD, designated as a Super-Peer Domain (SPD, is a legal cage model used to circumscribe the legal virtual boundary of data disclosure and usage in the cloud. Semantic legal policies in compliance with the law are enforced at the super-peer within an SPD to enable Law-as-a-Service (LaaS for cloud service providers. In addition, cloud users could query fragmented but protected outsourcing cloud data from a law-aware super-peer, where each query is also compliant with the law. Semantic legal policies are logic-based formal policies, which are shown to be a combination of OWL-DL ontologies and stratified Datalog rules with negation, i.e., so-called non-monotonic cq-programs, for policy representation and enforcement. An agent at the super-peer is a unique law-aware guardian that provides protected data integration services for its peers within an SPD. Furthermore, agents at the super-peers specify how law-compliant legal policies are unified with each other to provide protected data exchange services across SPDs in the semantic data cloud.
Process-oriented semantic web search
Tran, DT
2011-01-01
The book is composed of two main parts. The first part is a general study of Semantic Web Search. The second part specifically focuses on the use of semantics throughout the search process, compiling a big picture of Process-oriented Semantic Web Search from different pieces of work that target specific aspects of the process.In particular, this book provides a rigorous account of the concepts and technologies proposed for searching resources and semantic data on the Semantic Web. To collate the various approaches and to better understand what the notion of Semantic Web Search entails, this bo
A Semantic Matchmaker for Ranking Web Services
Institute of Scientific and Technical Information of China (English)
Bin Xu; Po Zhang; Juan-Zi Li; Wen-Jun Yang
2006-01-01
This paper is concerned with the matchmaker for ranking web services by using semantics. So far several methods of semantic matchmaker have been proposed. Most of them, however, focus on classifying the services into predefined categories rather than providing a ranking result. In this paper, a new method of semantic matchmaker is proposed for ranking web services. It is proposed to use the semantic distance for estimating the matching degree between a service and a user request. Four types of semantic distances are defined and four algorithms are implemented respectively to calculate them. Experimental results show that the proposed semantic matchmaker significantly outperforms the keywordbased baseline method.
CASL The Common Algebraic Specification Language Semantics
DEFF Research Database (Denmark)
Haxthausen, Anne
1998-01-01
This is version 1.0 of the CASL Language Summary, annotated by the CoFI Semantics Task Group with the semantics of constructs. This is the first complete but possibly imperfect version of the semantics. It was compiled prior to the CoFI workshop at Cachan in November 1998.......This is version 1.0 of the CASL Language Summary, annotated by the CoFI Semantics Task Group with the semantics of constructs. This is the first complete but possibly imperfect version of the semantics. It was compiled prior to the CoFI workshop at Cachan in November 1998....
Theorem proving support in programming language semantics
Bertot, Yves
2007-01-01
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verification condition generator and a static analyser that can be run inside the theorem prover for use in reflective proofs. Extraction of an interpreter from the denotational semantics is also described. All different aspects are formally proved sound with respect to the natural semantics specification.
DEFF Research Database (Denmark)
Jensen, Kurt
1991-01-01
use of CP-nets — because it means that the function representation and the translations (which are a bit mathematically complex) no longer are parts of the basic definition of CP-nets. Instead they are parts of the invariant method (which anyway demands considerable mathematical skills...... the different kinds of analysis. It has, however, turned out that it only is necessary to turn to functions when we deal with invariant analysis, and this means that we now use the expression representation for all purposes — except for the calculation of invariants. This change is important for the practical...
Wingender, E
2011-01-01
It was suggested some years ago that Petri nets might be well suited to modeling metabolic networks, overcoming some of the limitations encountered by the use of systems employing ODEs (ordinary differential equations). Much work has been done since then which confirms this and demonstrates the usefulness of this concept for systems biology. Petri net technology is not only intuitively understood by scientists trained in the life sciences, it also has a robust mathematical foundation and provides the required degree of flexibility. As a result it appears to be a very promising approach to mode
Directory of Open Access Journals (Sweden)
Colleen E Crangle
Full Text Available This paper presents a new method of analysis by which structural similarities between brain data and linguistic data can be assessed at the semantic level. It shows how to measure the strength of these structural similarities and so determine the relatively better fit of the brain data with one semantic model over another. The first model is derived from WordNet, a lexical database of English compiled by language experts. The second is given by the corpus-based statistical technique of latent semantic analysis (LSA, which detects relations between words that are latent or hidden in text. The brain data are drawn from experiments in which statements about the geography of Europe were presented auditorily to participants who were asked to determine their truth or falsity while electroencephalographic (EEG recordings were made. The theoretical framework for the analysis of the brain and semantic data derives from axiomatizations of theories such as the theory of differences in utility preference. Using brain-data samples from individual trials time-locked to the presentation of each word, ordinal relations of similarity differences are computed for the brain data and for the linguistic data. In each case those relations that are invariant with respect to the brain and linguistic data, and are correlated with sufficient statistical strength, amount to structural similarities between the brain and linguistic data. Results show that many more statistically significant structural similarities can be found between the brain data and the WordNet-derived data than the LSA-derived data. The work reported here is placed within the context of other recent studies of semantics and the brain. The main contribution of this paper is the new method it presents for the study of semantics and the brain and the focus it permits on networks of relations detected in brain data and represented by a semantic model.
The Information Resources in Arcetri Astrophysics Observatory: Between Metadata and Semantic Web
Baglioni, Roberto; Gasperini, Antonella
It is becoming apparent that libraries are going to play a key role in the new W3C's (World Wide Web Consortium) paradigm for the semantic web. For this reason, the Arcetri library is investigating methods for publishing different kinds of electronic documents on the net and a way of enriching them with semantic metadata. For the first phase, we are focusing on the library catalogue; and, in a second phase, we will consider bibliographies, preprints, technical reports, web pages, archives of astronomical data, and photographic and historical archives.
DEFF Research Database (Denmark)
Ilsøe, Anna
2012-01-01
Does regulation of working hours at national and sector level impose straitjackets, or offer safety nets to employees seeking working time flexibility? This article compares legislation and collective agreements in the metal industries of Denmark, Germany and the USA. The industry has historically...
Nonmetro Net Outmigration Stops.
Cromartie, John B.
1992-01-01
Annual population losses from net migration for nonmetro areas declined from 0.38-0.20 percent during the period of 1988-91. However, annual inmigration and outmigration flows were consistently above 1.5 million (about 3 percent of nonmetro population). During the three-year period, nonmetro areas consistently lost young adults and those with…
DEFF Research Database (Denmark)
2012-01-01
, that in turn enables general practitioners and clinical staff to view observations. Use the menus above to explore the site's information resources. To get started, follow the short Hello, World! tutorial. The Net4Care project is funded by The Central Denmark Region and EU via Caretech Innovation....
Jensen, Kurt
2009-01-01
Coloured Petri Nets (CPN) is a graphical language for modelling and validating concurrent and distributed systems, and other systems in which concurrency plays a major role. This book introduces the constructs of the CPN modelling language and presents the related analysis methods. It provides a comprehensive road map for the practical use of CPN.
Konolige, Kurt G.; Gutmann, Steffen; Guzzoni, Didier; Ficklin, Robert W.; Nicewarner, Keith E.
1999-08-01
Mobile robot hardware and software is developing to the point where interesting applications for groups of such robots can be contemplated. We envision a set of mobots acting to map and perform surveillance or other task within an indoor environment (the Sense Net). A typical application of the Sense Net would be to detect survivors in buildings damaged by earthquake or other disaster, where human searchers would be put a risk. As a team, the Sense Net could reconnoiter a set of buildings faster, more reliably, and more comprehensibly than an individual mobot. The team, for example, could dynamically form subteams to perform task that cannot be done by individual robots, such as measuring the range to a distant object by forming a long baseline stereo sensor form a pari of mobots. In addition, the team could automatically reconfigure itself to handle contingencies such as disabled mobots. This paper is a report of our current progress in developing the Sense Net, after the first year of a two-year project. In our approach, each mobot has sufficient autonomy to perform several tasks, such as mapping unknown areas, navigating to specific positions, and detecting, tracking, characterizing, and classifying human and vehicular activity. We detail how some of these tasks are accomplished, and how the mobot group is tasked.
DEFF Research Database (Denmark)
2012-01-01
, that in turn enables general practitioners and clinical staff to view observations. Use the menus above to explore the site's information resources. To get started, follow the short Hello, World! tutorial. The Net4Care project is funded by The Central Denmark Region and EU via Caretech Innovation....
Shor, Mikhael
2003-01-01
States making game theory relevant and accessible to students is challenging. Describes the primary goal of GameTheory.net is to provide interactive teaching tools. Indicates the site strives to unite educators from economics, political and computer science, and ecology by providing a repository of lecture notes and tests for courses using…
Graph-based Operational Semantics of a Lazy Functional Languages
DEFF Research Database (Denmark)
Rose, Kristoffer Høgsbro
1992-01-01
Presents Graph Operational Semantics (GOS): a semantic specification formalism based on structural operational semantics and term graph rewriting. Demonstrates the method by specifying the dynamic ......Presents Graph Operational Semantics (GOS): a semantic specification formalism based on structural operational semantics and term graph rewriting. Demonstrates the method by specifying the dynamic ...
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
DEFF Research Database (Denmark)
David, Alexandre; Jacobsen, Lasse; Jacobsen, Morten
2012-01-01
in the presence of monotonicity-breaking features like age invariants and inhibitor arcs. We implement the algorithm within the model-checkerTAPAAL and the experimental results document an encouraging performance compared to verification approaches that translate TAPN models to UPPAAL timed automata.......Timed-arc Petri nets (TAPN) are a well-known time extension of thePetri net model and several translations to networks of timedautomata have been proposed for this model.We present a direct, DBM-basedalgorithm for forward reachability analysis of bounded TAPNs extended with transport arcs...
The surplus value of semantic annotations
Marx, M.
2010-01-01
We compare the costs of semantic annotation of textual documents to its benefits for information processing tasks. Semantic annotation can improve the performance of retrieval tasks and facilitates an improved search experience through faceted search, focused retrieval, better document summaries,
Formal Language Decomposition into Semantic Primes
Directory of Open Access Journals (Sweden)
Johannes FÄHNDRICH
2014-10-01
Full Text Available This paper describes an algorithm for semantic decomposition. For that we surveys languages used to enrich contextual information with semantic descriptions. Such descriptions can be e.g. applied to enable reasoning when collecting vast amounts of information. In particular, we focus on the elements of the languages that make up their semantic. To do so, we compare the expressiveness of the well-known languages OWL, PDDL and MOF with a theory from linguistic called the Natural Semantic Metalanguage. We then analyze how the semantic of the language is build up and describe how semantic decomposition based on the semantic primes can be used for a so called mental lexicon. This mental lexicon can be used to reason upon semantic service description in the research domain of service match making.
Scaling Effect of Area-Averaged NDVI: Monotonicity along the Spatial Resolution
Directory of Open Access Journals (Sweden)
Hiroki Yoshioka
2012-01-01
Full Text Available Changes in the spatial distributions of vegetation across the globe are routinely monitored by satellite remote sensing, in which the reflectance spectra over land surface areas are measured with spatial and temporal resolutions that depend on the satellite instrumentation. The use of multiple synchronized satellite sensors permits long-term monitoring with high spatial and temporal resolutions. However, differences in the spatial resolution of images collected by different sensors can introduce systematic biases, called scaling effects, into the biophysical retrievals. This study investigates the mechanism by which the scaling effects distort normalized difference vegetation index (NDVI. This study focused on the monotonicity of the area-averaged NDVI as a function of the spatial resolution. A monotonic relationship was proved analytically by using the resolution transform model proposed in this study in combination with a two-endmember linear mixture model. The monotonicity allowed the inherent uncertainties introduced by the scaling effects (error bounds to be explicitly determined by averaging the retrievals at the extrema of theresolutions. Error bounds could not be estimated, on the other hand, for non-monotonic relationships. Numerical simulations were conducted to demonstrate the monotonicity of the averaged NDVI along spatial resolution. This study provides a theoretical basis for the scaling effects and develops techniques for rectifying the scaling effects in biophysical retrievals to facilitate cross-sensor calibration for the long-term monitoring of vegetation dynamics.
eSDI-NET+: una rete tematica per l’arricchimento e il riuso dell’informazione geografica in Europa
Directory of Open Access Journals (Sweden)
Redazione Redazione
2008-03-01
Full Text Available eSDI-NET+: a thematic net for the enhancement and reuse of european geographic informationThe enhancement of geographic data through well defined semantic metadata – as expected by the INSPIRE initiative – together with the creation of comprehensive Spatial Data Infrastructures (SDIs contemplating the extensive re-use of geographic information, could contribute in solving the divulgation and accessibility problems concerned with geographic data. In this context, eSDI-Net+ task is to establish a Thematic Net working asa communication and information exchange platform between different subjects involved in the creation and use of SDIs.
The semantics of biological forms.
Albertazzi, Liliana; Canal, Luisa; Dadam, James; Micciolo, Rocco
2014-01-01
This study analyses how certain qualitative perceptual appearances of biological forms are correlated with expressions of natural language. Making use of the Osgood semantic differential, we presented the subjects with 32 drawings of biological forms and a list of 10 pairs of connotative adjectives to be put in correlations with them merely by subjective judgments. The principal components analysis made it possible to group the semantics of forms according to two distinct axes of variability: harmony and dynamicity. Specifically, the nonspiculed, nonholed, and flat forms were perceived as harmonic and static; the rounded ones were harmonic and dynamic. The elongated forms were somewhat disharmonious and somewhat static. The results suggest the existence in the general population of a correspondence between perceptual and semantic processes, and of a nonsymbolic relation between visual forms and their adjectival expressions in natural language.
Action semantics modulate action prediction.
Springer, Anne; Prinz, Wolfgang
2010-11-01
Previous studies have demonstrated that action prediction involves an internal action simulation that runs time-locked to the real action. The present study replicates and extends these findings by indicating a real-time simulation process (Graf et al., 2007), which can be differentiated from a similarity-based evaluation of internal action representations. Moreover, results showed that action semantics modulate action prediction accuracy. The semantic effect was specified by the processing of action verbs and concrete nouns (Experiment 1) and, more specifically, by the dynamics described by action verbs (Experiment 2) and the speed described by the verbs (e.g., "to catch" vs. "to grasp" vs. "to stretch"; Experiment 3). These results propose a linkage between action simulation and action semantics as two yet unrelated domains, a view that coincides with a recent notion of a close link between motor processes and the understanding of action language.
A Semantic Web Blackboard System
McKenzie, Craig; Preece, Alun; Gray, Peter
In this paper, we propose a Blackboard Architecture as a means for coordinating hybrid reasoning over the Semantic Web. We describe the components of traditional blackboard systems (Knowledge Sources, Blackboard, Controller) and then explain how we have enhanced these by incorporating some of the principles of the Semantic Web to pro- duce our Semantic Web Blackboard. Much of the framework is already in place to facilitate our research: the communication protocol (HTTP); the data representation medium (RDF); a rich expressive description language (OWL); and a method of writing rules (SWRL). We further enhance this by adding our own constraint based formalism (CIF/SWRL) into the mix. We provide an example walk-though of our test-bed system, the AKTive Workgroup Builder and Blackboard(AWB+B), illustrating the interaction and cooperation of the Knowledge Sources and providing some context as to how the solution is achieved. We conclude with the strengths and weaknesses of the architecture.
Semantics for Possibilistic Disjunctive Programs
Nieves, Juan Carlos; Cortés, Ulises
2011-01-01
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic is defined. It shows that this possibilistic semantics for disjunctive logic programs can be characterized by a fixed-point operator. It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined; in addition, the approach of cuts for re...
Semantic Ambiguity and Perceived Ambiguity
Poesio, M
1995-01-01
I explore some of the issues that arise when trying to establish a connection between the underspecification hypothesis pursued in the NLP literature and work on ambiguity in semantics and in the psychological literature. A theory of underspecification is developed `from the first principles', i.e., starting from a definition of what it means for a sentence to be semantically ambiguous and from what we know about the way humans deal with ambiguity. An underspecified language is specified as the translation language of a grammar covering sentences that display three classes of semantic ambiguity: lexical ambiguity, scopal ambiguity, and referential ambiguity. The expressions of this language denote sets of senses. A formalization of defeasible reasoning with underspecified representations is presented, based on Default Logic. Some issues to be confronted by such a formalization are discussed.
Institute of Scientific and Technical Information of China (English)
Yang Liu; Huai-Kou Miao; Hong-Wei Zeng; Yan Ma; Pan Liu
2013-01-01
There are many variants of Petri net at present,and some of them can be used to model system with both function and performance specification,such as stochastic Petri net,generalized stochastic Petri net and probabilistic Petri net.In this paper,we utilize extended Petri net to address the issue of modeling and verifying system with probability and nondeterminism besides function aspects.Using probabilistic Petri net as reference,we propose a new mixed model NPPN (Nondeterministic Probabilistic Petri Net) system,which can model and verify systems with qualitative and quantitative behaviours.Then we develop a kind of process algebra for NPPN system to interpret its algebraic semantics,and an actionbased PCTL (Probabilistic Computation Tree Logic) to interpret its logical semantics.Afterwards we present the rules for compositional operation of NPPN system based on NPPN system process algebra,and the model checking algorithm based on the action-based PCTL.In order to put the NPPN system into practice,we develop a friendly and visual tool for modeling,analyzing,simulating,and verifying NPPN system using action-based PCTL.The usefulness and effectiveness of the NPPN system are illustrated by modeling and model checking an elaborate model of travel arrangements workflow.
How many kinds of reasoning? Inference, probability, and natural language semantics.
Lassiter, Daniel; Goodman, Noah D
2015-03-01
The "new paradigm" unifying deductive and inductive reasoning in a Bayesian framework (Oaksford & Chater, 2007; Over, 2009) has been claimed to be falsified by results which show sharp differences between reasoning about necessity vs. plausibility (Heit & Rotello, 2010; Rips, 2001; Rotello & Heit, 2009). We provide a probabilistic model of reasoning with modal expressions such as "necessary" and "plausible" informed by recent work in formal semantics of natural language, and show that it predicts the possibility of non-linear response patterns which have been claimed to be problematic. Our model also makes a strong monotonicity prediction, while two-dimensional theories predict the possibility of reversals in argument strength depending on the modal word chosen. Predictions were tested using a novel experimental paradigm that replicates the previously-reported response patterns with a minimal manipulation, changing only one word of the stimulus between conditions. We found a spectrum of reasoning "modes" corresponding to different modal words, and strong support for our model's monotonicity prediction. This indicates that probabilistic approaches to reasoning can account in a clear and parsimonious way for data previously argued to falsify them, as well as new, more fine-grained, data. It also illustrates the importance of careful attention to the semantics of language employed in reasoning experiments. Copyright © 2014 Elsevier B.V. All rights reserved.
Towards the Semantic Web Expert System
Verhodubs, O; Grundspeņķis, J
2011-01-01
The paper presents a conception of the Semantic Web Expert System which is the logical continuation of the expert system development. The Semantic Web Expert System emerges as the result of evolution of expert system concept and it means expert system moving toward the Web and using new Semantic Web technologies. The proposed conception of the Semantic Web Expert System promises to have new useful features that distinguish it from other types of expert systems
A Modular Rewriting Semantics for CML
DEFF Research Database (Denmark)
Chalub, Fabricio; Braga, Christiano de Oliveira
2004-01-01
This paper presents a modular rewriting semantics (MRS) specification for Reppy's Concurrent ML (CML), based on Peter Mosses' modular structural operational semantics specification for CML. A modular rewriting semantics specification for a programming language is a rewrite theory in rewriting log...... of rewriting logic, and to verify CML programs using Maude's built-in LTL model checker. It is assumed that the reader is familiar with basic concepts of structural operational semantics and algebraic specifications....
Proceedings Seventh Workshop on Structural Operational Semantics
Aceto, Luca; 10.4204/EPTCS.32
2010-01-01
Structural operational semantics (SOS) is a technique for defining operational semantics for programming and specification languages. Because of its intuitive appeal and flexibility, SOS has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs and in proving compiler correctness. Recently it has been applied in emerging areas such as probabilistic systems and systems biology.
SEMANTIC WEB MINING: ISSUES AND CHALLENGES
Karan Singh*, Anil kumar, Arun Kumar Yadav
2016-01-01
The combination of the two fast evolving scientific research areas “Semantic Web” and “Web Mining” are well-known as “Semantic Web Mining” in computer science. These two areas cover way for the mining of related and meaningful information from the web, by this means giving growth to the term “Semantic Web Mining”. The “Semantic Web” makes mining easy and “Web Mining” can construct new structure of Web. Web Mining applies ...
SETL: A programmable semantic extract-transform-load framework for semantic data warehouses
DEFF Research Database (Denmark)
Nath, Rudra; Hose, Katja; Pedersen, Torben Bach
2017-01-01
on Semantic Web (SW) standards and tools and supports developers by offering a number of powerful modules, classes, and methods for (dimensional and semantic) DW constructs and tasks. Thus it supports semantic data sources in addition to traditional data sources, semantic integration, and creating......” because they do not consider semantic issues in the integration processing. Current ETL tools neither support processing semantic data nor create a semantic Data Warehouse (DW), a repository of semantically integrated data. This paper describes our programmable Semantic ETL (SETL) framework. SETL builds...... or publishing a semantic (multidimensional) DW in terms of a knowledge base. A comprehensive experimental evaluation comparing SETL to a solution made with traditional tools (requiring much more hand-coding) on a concrete use case, shows that SETL provides better programmer productivity, knowledge base quality...
Integrating Semantic Features for Enhancing Arabic Named Entity Recognition
Directory of Open Access Journals (Sweden)
Hamzah A. Alsayadi
2016-03-01
Full Text Available Named Entity Recognition (NER is currently an essential research area that supports many tasks in NLP. Its goal is to find a solution to boost accurately the named entities identification. This paper presents an integrated semantic-based Machine learning (ML model for Arabic Named Entity Recognition (ANER problem. The basic idea of that model is to combine several linguistic features and to utilize syntactic dependencies to infer semantic relations between named entities. The proposed model focused on recognizing three types of named entities: person, organization and location. Accordingly, it combines internal features that represented linguistic features as well as external features that represent the semantic of relations between the three named entities to enhance the accuracy of recognizing them using external knowledge source such as Arabic WordNet ontology (ANW. We introduced both features to CRF classifier, which are effective for ANER. Experimental results show that this approach can achieve an overall F-measure around 87.86% and 84.72% for ANERCorp and ALTEC datasets respectively.
Order effects in dynamic semantics.
Graben, Peter Beim
2014-01-01
In their target article, Wang and Busemeyer (2013) discuss question order effects in terms of incompatible projectors on a Hilbert space. In a similar vein, Blutner recently presented an orthoalgebraic query language essentially relying on dynamic update semantics. Here, I shall comment on some interesting analogies between the different variants of dynamic semantics and generalized quantum theory to illustrate other kinds of order effects in human cognition, such as belief revision, the resolution of anaphors, and default reasoning that result from the crucial non-commutativity of mental operations upon the belief state of a cognitive agent.
Semantic Presupposition in Advertisement Language
Institute of Scientific and Technical Information of China (English)
王芸芸
2008-01-01
Presupposition is. a very important linguistic concept that originates from philosophy. It is often considered as a kind of pragmatic inference. In linguistics it can be classified as semantic presupposition and Pragmatic presupposition. This article will deals with semantic presupposition. Besides the most important characteristics constancy under negation, presupposition boasts some other characteristics, namely unidirectionality, subjectiveness and latency, which exactly fulfill the demands of advertising. Because presupposition, used in advertising, can not possible risk caused by ostentation or direct assertion. On this account, presupposition is adopted into advertising as a pragmatic strategy.
SEMANTIC TRANSFERS: CRITERIA FOR CLASSIFICATION
Directory of Open Access Journals (Sweden)
Moskvin, V.P.
2016-03-01
Full Text Available There is represented the general classification of semantic transfers. As the research has shown, transfers can be systematized based on four parameters: 1 the type of associations lying on their basis: similarity, contiguity and contrast, the associations by similarity and contrast being regarded as the basis for taxonomic transfers (from genus to species, from species to genus, from species to species, etc.; 2 the functional parameter: functionally relevant and irrelevant; 3 the sphere of action: transfer applies both to lexical and grammatical semantics; 4 the degree of ex-pressiveness: thus, the metonymic associations are more predictable than the metaphoric ones.
The semantic structure of gratitude
Directory of Open Access Journals (Sweden)
Smirnov, Alexander V.
2016-06-01
Full Text Available In the modern social and economic environment of Russia, gratitude might be considered an ambiguous phenomenon. It can have different meaning for a person in different contexts and can manifest itself differently as well (that is, as an expression of sincere feelings or as an element of corruption. In this respect it is topical to investigate the system of meanings and relationships that define the semantic space of gratitude. The goal of the study was the investigation and description of the content and structure of the semantic space of the gratitude phenomenon as well as the determination of male, female, age, and ethnic peculiarities of the expression of gratitude. The objective was achieved by using the semantic differential designed by the authors to investigate attitudes toward gratitude. This investigation was carried out with the participation of 184 respondents (Russians, Tatars, Ukrainians, Jews living in the Russian Federation, Belarus, Kazakhstan, Tajikistan, Israel, Australia, Canada, and the United Kingdom and identifying themselves as representatives of one of these nationalities. The structural components of gratitude were singled out by means of exploratory factor analysis of the empirical data from the designed semantic differential. Gender, age, and ethnic differences were differentiated by means of Student’s t-test. Gratitude can be represented by material and nonmaterial forms as well as by actions in response to help given. The empirical data allowed us to design the ethnically nonspecified semantic structure of gratitude. During the elaboration of the differential, semantic universals of gratitude, which constitute its psychosemantic content, were distinguished. Peculiarities of attitudes toward gratitude by those in different age and gender groups were revealed. Differences in the degree of manifestation of components of the psychosemantic structure of gratitude related to ethnic characteristics were not discovered
On Semantic Development of HAND
Institute of Scientific and Technical Information of China (English)
黎金娥
2015-01-01
The body-part term, HAND, ranks 48 in Swadesh's 100-Word List.This paper discusses the origin and meanings, and then the rules of semantic development in the HAND semantic field by comparing with other languages.The word itself does not only denote the body part but also things resembling hands in shape, position, function and things associated with hands.Plenty of linguistic evidence can be found to illustrate that all human beings regard their bodies as the basis and starting point of recognition of the whole world.
A Modular Rewriting Semantics for CML
DEFF Research Database (Denmark)
Chalub, Fabricio; Braga, Christiano de Oliveira
2004-01-01
This paper presents a modular rewriting semantics (MRS) specification for Reppy's Concurrent ML (CML), based on Peter Mosses' modular structural operational semantics specification for CML. A modular rewriting semantics specification for a programming language is a rewrite theory in rewriting log...
Applying Semantic Reasoning in Image Retrieval
Boer, M.H.T. de; Daniele, L.M.; Brandt, P.; Sappelli, M.
2015-01-01
Abstract—With the growth of open sensor networks, multiple applications in different domains make use of a large amount of sensor data, resulting in an emerging need to search semantically over heterogeneous datasets. In semantic search, an important challenge consists of bridging the semantic gap
Applying Semantic Reasoning in Image Retrieval
Boer, M.H.T. de; Daniele, L.M.; Brandt, P.; Sappelli, M.
2015-01-01
Abstract—With the growth of open sensor networks, multiple applications in different domains make use of a large amount of sensor data, resulting in an emerging need to search semantically over heterogeneous datasets. In semantic search, an important challenge consists of bridging the semantic gap b
Semantic Web Technologies for Digital Libraries
Directory of Open Access Journals (Sweden)
Rajab Abd al-Hamed
2007-09-01
Full Text Available An article about the semantic web, it begins with defining the semantic web and its importance, then talks about the ontology relations, then the role of the semantic web in digital libraries, and its features which will serve digital libraries.
DEFF Research Database (Denmark)
Garde, Henrik; Staboulis, Stratos
2016-01-01
demonstrate that for admissible choices of regularization parameters the inhomogeneities are detected, and under reasonable assumptions, asymptotically exactly characterized. Moreover, we rigorously associate this result with the complete electrode model, and describe how a computationally cheap monotonicity......The inverse problem of electrical impedance tomography is severely ill-posed, meaning that, only limited information about the conductivity can in practice be recovered from boundary measurements of electric current and voltage. Recently it was shown that a simple monotonicity property...... of the related Neumann-to-Dirichlet map can be used to characterize shapes of inhomogeneities in a known background conductivity. In this paper we formulate a monotonicity-based shape reconstruction scheme that applies to approximative measurement models, and regularizes against noise and modelling error. We...
Energy Technology Data Exchange (ETDEWEB)
Erol, V. [Department of Computer Engineering, Institute of Science, Okan University, Istanbul (Turkey); Netas Telecommunication Inc., Istanbul (Turkey)
2016-04-21
Entanglement has been studied extensively for understanding the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known monotones for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. The study on these monotones has been a hot topic in quantum information [1-7] in order to understand the role of entanglement in this discipline. It can be observed that from any arbitrary quantum pure state a mixed state can obtained. A natural generalization of this observation would be to consider local operations classical communication (LOCC) transformations between general pure states of two parties. Although this question is a little more difficult, a complete solution has been developed using the mathematical framework of the majorization theory [8]. In this work, we analyze the relation between entanglement monotones concurrence and negativity with respect to majorization for general two-level quantum systems of two particles.
Comparison of boundedness and monotonicity properties of one-leg and linear multistep methods
Mozartova, A.
2015-05-01
© 2014 Elsevier B.V. All rights reserved. One-leg multistep methods have some advantage over linear multistep methods with respect to storage of the past results. In this paper boundedness and monotonicity properties with arbitrary (semi-)norms or convex functionals are analyzed for such multistep methods. The maximal stepsize coefficient for boundedness and monotonicity of a one-leg method is the same as for the associated linear multistep method when arbitrary starting values are considered. It will be shown, however, that combinations of one-leg methods and Runge-Kutta starting procedures may give very different stepsize coefficients for monotonicity than the linear multistep methods with the same starting procedures. Detailed results are presented for explicit two-step methods.
Erol, V.
2016-04-01
Entanglement has been studied extensively for understanding the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known monotones for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. The study on these monotones has been a hot topic in quantum information [1-7] in order to understand the role of entanglement in this discipline. It can be observed that from any arbitrary quantum pure state a mixed state can obtained. A natural generalization of this observation would be to consider local operations classical communication (LOCC) transformations between general pure states of two parties. Although this question is a little more difficult, a complete solution has been developed using the mathematical framework of the majorization theory [8]. In this work, we analyze the relation between entanglement monotones concurrence and negativity with respect to majorization for general two-level quantum systems of two particles.
STRONG CONVERGENCE OF MONOTONE HYBRID METHOD FOR FIXED POINT ITERATION PROCESSES
Institute of Scientific and Technical Information of China (English)
Yongfu SU; Xiaolong QIN
2008-01-01
K. Nakajo and W. Takahashi in 2003 proved the strong convergence theorems for nonexpansive mappings, nonexpansive semigroups, and proximal point algorithm for zero point of monotone operators in Hilbert spaces by using the hybrid method in mathematical programming. The purpose of this paper is to modify the hybrid iteration method of K. Nakajo and W. Takahashi through the monotone hybrid method, and to prove strong convergence theorems. The convergence rate of iteration process of the monotone hybrid method is faster than that of the iteration process of the hybrid method of K. Nakajo and W. Takahashi. In the proofs in this article, Cauchy sequence method is used to avoid the use of the demiclosedness principle and Opial's condition.
Semantic heterogeneity: comparing new semantic web approaches with those of digital libraries
Krause, Jürgen
2008-01-01
To demonstrate that newer developments in the semantic web community, particularly those based on ontologies (simple knowledge organization system and others) mitigate common arguments from the digital library (DL) community against participation in the Semantic web. The approach is a semantic web discussion focusing on the weak structure of the Web and the lack of consideration given to the semantic content during indexing. The points criticised by the semantic web and ontology approaches ar...
Privacy for Semantic Web Mining using Advanced DSA – Spatial LBS Case Study in mining
Directory of Open Access Journals (Sweden)
S.Nagaprasad Sri
2010-09-01
Full Text Available The Web Services paradigm promises to enable rich flexible and dynamic interoperation of highly distributed, heterogeneous network enabled services. The idea of Web Services Mining that it makes use of the findings in the field of data mining and applies them to the world of Web Services. The emerging concept of Semantic Web Services aims at more sophisticated Web Services technologies: on basis of Semantic Description Frameworks, Intelligent mechanisms are envisioned for Discovery, Composition, and contracting of Web Services. The aim of semantic web is not only to support to access information on the web but also to support its usage. Geospatial Semantic Web is an augmentation to the Semantic Web that adds geospatial abstractions, as well as related reasoning, representation and query mechanisms. Web Service Security represents a key requirement for today’s distributed interconnected digital world and for the new generations, Web 2.0 and Semantic Web. To date, the problem of security has been investigated very much in the context of standardization efforts; Personal judgments are made usually based on the sensitivity of the information and the reputation of the party to which the information is to be disclosed. On the privacy front, this means that privacy invasion would net more quality and sensitive personal information. In this paper, we had implemented a case study on integrated privacy issues of Spatial Semantic Web Services Mining. Initially we improved privacy of Geospatial Semantic Layer. Finally, we implemented a Location Based System and improved its digital signature capability, using advanced Digital Signature standards.
Directory of Open Access Journals (Sweden)
Veerle Neyens
2017-08-01
Full Text Available According to a recent study, semantic similarity between concrete entities correlates with the similarity of activity patterns in left middle IPS during category naming. We examined the replicability of this effect under passive viewing conditions, the potential role of visuoperceptual similarity, where the effect is situated compared to regions that have been previously implicated in visuospatial attention, and how it compares to effects of object identity and location. Forty-six subjects participated. Subjects passively viewed pictures from two categories, musical instruments and vehicles. Semantic similarity between entities was estimated based on a concept-feature matrix obtained in more than 1,000 subjects. Visuoperceptual similarity was modeled based on the HMAX model, the AlexNet deep convolutional learning model, and thirdly, based on subjective visuoperceptual similarity ratings. Among the IPS regions examined, only left middle IPS showed a semantic similarity effect. The effect was significant in hIP1, hIP2, and hIP3. Visuoperceptual similarity did not correlate with similarity of activity patterns in left middle IPS. The semantic similarity effect in left middle IPS was significantly stronger than in the right middle IPS and also stronger than in the left or right posterior IPS. The semantic similarity effect was similar to that seen in the angular gyrus. Object identity effects were much more widespread across nearly all parietal areas examined. Location effects were relatively specific for posterior IPS and area 7 bilaterally. To conclude, the current findings replicate the semantic similarity effect in left middle IPS under passive viewing conditions, and demonstrate its anatomical specificity within a cytoarchitectonic reference frame. We propose that the semantic similarity effect in left middle IPS reflects the transient uploading of semantic representations in working memory.
Privacy for Semantic Web Mining using Advanced DSA – Spatial LBS Case Study
Directory of Open Access Journals (Sweden)
Dr.D.Sravan Kumar,
2010-05-01
Full Text Available The Web Services paradigm promises to enable rich flexible and dynamic interoperation of highly distributed, heterogeneous network enabled services. The idea of Web Services Mining that it makes use of the findings in the field of data mining and applies them to the world of Web Services. The emerging concept of Semantic Web Services aims at more sophisticated Web Services technologies: on basis of Semantic Description Frameworks, Intelligent mechanisms are envisioned for Discovery, Composition, and contracting of Web Services. The aim of semantic web is not only to support to access information on the web but also to support its usage. Geospatial Semantic Web is an augmentation to the Semantic Web that adds geospatial abstractions, as well as related reasoning, representation and query mechanisms. Web Service Security represents a key requirement for today’s distributed interconnected digital world and for the new generations, Web 2.0 and Semantic Web. To date, the problem of security has been investigated very much in the context of standardization efforts; Personal judgments are made usually based on the sensitivity of the information and the reputation of the party towhich the information is to be disclosed. On the privacy front,this means that privacy invasion would net more quality and sensitive personal information. In this paper, we had implemented a case study on integrated privacy issues of Spatial Semantic Web Services Mining. Initially we improved privacy of Geospatial Semantic Layer. Finally, we implemented a Location Based System and improved its digital signature capability, using advanced Digital Signature standards.
Army Net Zero Prove Out. Net Zero Waster Best Practices
2014-11-18
Colorado • Fort Bliss, Texas These sites served as test beds for the Army’s Net Zero Initiative, specifically, Net Zero Water , and the Army provided...have sustainability, energy efficiency, water conservation, recycling, pollution prevention, and green procurement programs in place that they can...ARMY NET ZERO PROVE OUT Final Net Zero Water Best Practices November 18, 2014 Distribution A Approved for public release
The Role of Monotonicity in the Epistemic Analysis of Strategic Games
Directory of Open Access Journals (Sweden)
Jonathan A. Zvesper
2010-10-01
Full Text Available It is well-known that in finite strategic games true common belief (or common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality notions and arbitrary strategic games and allows to strengthen the above result to arbitrary games, other rationality notions, and transfinite iterations of the elimination process. We also clarify what conclusions one can draw for the customary dominance notions that are not monotonic. The main tool is Tarski’s Fixpoint Theorem.
Stochastic Monotone Markov Integrated Semigroups%随机单调Markov积分半群
Institute of Scientific and Technical Information of China (English)
文兴易; 李扬荣
2009-01-01
In this paper we discuss the relationship between monotone of Markov integrated semigroups and transition functions,which are closely linked with each other for continuous time Markov chains.By this a necessary and sufficient condition for the minimal q-semigroup to be stochastic monotone is given in terms of their q-matrix only.%讨论了Markov积分半群的单调性和转移函数的单调性的等价性,并得到最小的Q半群是单调的充要条件.
DEFF Research Database (Denmark)
Garde, Henrik
2017-01-01
Detecting inhomogeneities in the electrical conductivity is a special case of the inverse problem in electrical impedance tomography, that leads to fast direct reconstruction methods. One such method can, under reasonable assumptions, exactly characterize the inhomogeneities based on monotonicity....... For a fair comparison, exact matrix characterizations are used when probing the monotonicity relations to avoid errors from numerical solution to PDEs and numerical integration. Using a special factorization of the Neumann-to-Dirichlet map also makes the non-linear method as fast as the linear method...
Xiao, Jie
2009-01-01
Two optimal monotone integral principles (equivalently for the Laplacian, two sharp iso-weighted-volume inequalities) are established through extending the first and second integral bounds of H. Weinberger for the Green functions (i.e., fundamental solutions) of uniformly elliptic equations in terms of the layer-cake formula, a one-dimensional monotone integral principle, and the isoperimetric and Jenson's inequalities with sharp constants. Surprisingly, a special setting of the first principle can be used to not only verify the low-dimensional P\\'olya conjecture for the principal eigenvalue of the Laplacian but also to characterize the geometry of the Nash inequality for a strong uniform elliptic equation.
Ellis, Jules L
2014-04-01
It is shown that a unidimensional monotone latent variable model for binary items implies a restriction on the relative sizes of item correlations: The negative logarithm of the correlations satisfies the triangle inequality. This inequality is not implied by the condition that the correlations are nonnegative, the criterion that coefficient H exceeds 0.30, or manifest monotonicity. The inequality implies both a lower bound and an upper bound for each correlation between two items, based on the correlations of those two items with every possible third item. It is discussed how this can be used in Mokken's (A theory and procedure of scale-analysis, Mouton, The Hague, 1971) scale analysis.
A Mathematical Model for Non-monotonic Deposition Profiles in Deep Bed Filtration Systems
DEFF Research Database (Denmark)
Yuan, Hao; Shapiro, Alexander
2011-01-01
A mathematical model for suspension/colloid flow in porous media and non-monotonic deposition is proposed. It accounts for the migration of particles associated with the pore walls via the second energy minimum (surface associated phase). The surface associated phase migration is characterized...... by advection and diffusion/dispersion. The proposed model is able to produce a nonmonotonic deposition profile. A set of methods for estimating the modeling parameters is provided in the case of minimal particle release. The estimation can be easily performed with available experimental information...... condition for producing non-monotonic deposition profiles. The described physics by the additional equation may be different in different experimental settings....
Semantic prioritization of novel causative genomic variants
Boudellioua, Imane
2017-04-17
Discriminating the causative disease variant(s) for individuals with inherited or de novo mutations presents one of the main challenges faced by the clinical genetics community today. Computational approaches for variant prioritization include machine learning methods utilizing a large number of features, including molecular information, interaction networks, or phenotypes. Here, we demonstrate the PhenomeNET Variant Predictor (PVP) system that exploits semantic technologies and automated reasoning over genotype-phenotype relations to filter and prioritize variants in whole exome and whole genome sequencing datasets. We demonstrate the performance of PVP in identifying causative variants on a large number of synthetic whole exome and whole genome sequences, covering a wide range of diseases and syndromes. In a retrospective study, we further illustrate the application of PVP for the interpretation of whole exome sequencing data in patients suffering from congenital hypothyroidism. We find that PVP accurately identifies causative variants in whole exome and whole genome sequencing datasets and provides a powerful resource for the discovery of causal variants.
Multimedia Semantics Metadata, Analysis and Interaction
Troncy, Raphael; Schenk, Simon
2011-01-01
In this book, the authors present the latest research results in the multimedia and semantic web communities, bridging the "Semantic Gap" This book explains, collects and reports on the latest research results that aim at narrowing the so-called multimedia "Semantic Gap": the large disparity between descriptions of multimedia content that can be computed automatically, and the richness and subjectivity of semantics in user queries and human interpretations of audiovisual media. Addressing the grand challenge posed by the "Semantic Gap" requires a multi-disciplinary approach (computer science,
Action representation: crosstalk between semantics and pragmatics.
Prinz, Wolfgang
2014-03-01
Marc Jeannerod pioneered a representational approach to movement and action. In his approach, motor representations provide both, declarative knowledge about action and procedural knowledge for action (action semantics and action pragmatics, respectively). Recent evidence from language comprehension and action simulation supports the claim that action pragmatics and action semantics draw on common representational resources, thus challenging the traditional divide between declarative and procedural action knowledge. To account for these observations, three kinds of theoretical frameworks are discussed: (i) semantics is grounded in pragmatics, (ii) pragmatics is anchored in semantics, and (iii) pragmatics is part and parcel of semantics.
Query Optimization by Semantic Reasoning.
1981-05-01
Haas, Doug Hofstadter, Elaine Kant, Peggy Karp , Fred Lakin, Ruth Andrea Levinson, Paul Martin, Larry Masinter, Thorne McCarty, Brian McCune, Charles...design. McGraw-Hill, New York, 1977. [Wilson80) Wilson, Gerald A. A conceptual model for semantic integrity checking. In Proc. Sixth Itl. Conference on
Genres, Semantics, and Classroom Education.
Lemke, Jay
1988-01-01
Argues that competence in academic subjects depends on mastery of their specialized patterns of language use. These patterns are described in terms of: 1) the semantics underlying Halliday's functional linguistics and 2) the structural analysis of communication genres. A sample classroom episode illustrates relationships among semantic…
Endo, Yoshio
1989-01-01
The notions of categorical selection (c-selection) and semantic selection (s-selection) as outlined in recent research on generative grammar are discussed. The first section addresses the type of selectional constraint imposed on English small clauses (e.g., "John considers [Mary smart]"). In the second section, it is suggested that the constraint…
Towards semantic software engineering enviroments
Falbo, R.A.; Guizzardi, G.; Natali, A.; Bertollo, G.; Ruy, F.; Mian, P.; Tortora, G.; Chang, S.K.
2002-01-01
Software tools processing partially common set of data should share an understanding of what these data mean. Since ontologies have been used to express formally a shared understanding of information, we argue that they are a way towards Semantic SEEs. In this paper we discuss an ontology-based
Towards semantic software engineering environments
Falbo, R.A.; Guizzardi, G.; Natali, A.; Bertollo, G.; Ruy, F.; Mian, P.; Tortora, G.; Chang, S.-K.
2002-01-01
Software tools processing partially common set of data should share an understanding of what these data mean. Since ontologies have been used to express formally a shared understanding of information, we argue that they are a way towards Semantic SEEs. In this paper we discuss an ontology-based appr
Semantic Reasoning for Scene Interpretation
DEFF Research Database (Denmark)
Jensen, Lars Baunegaard With; Baseski, Emre; Pugeault, Nicolas
2008-01-01
In this paper, we propose a hierarchical architecture for representing scenes, covering 2D and 3D aspects of visual scenes as well as the semantic relations between the different aspects. We argue that labeled graphs are a suitable representational framework for this representation and demonstrat...
The Semantics of Query Modification
Hollink, V.; Tsikrika, T.; Vries, A.P. de
2010-01-01
We present a method that exploits `linked data' to determine semantic relations between consecutive user queries. Our method maps queries onto concepts in linked data and searches the linked data graph for direct or indirect relations between the concepts. By comparing relations between large number
Semantic activation in action planning
Lindemann, Oliver; Stenneken, Prisca; van Schie, Hein T.; Bekkering, Harold
2006-01-01
Four experiments investigated activation of semantic information in action preparation. Participants either prepared to grasp and use an object (e.g., to drink from a cup) or to lift a finger in association with the object's position following a go/no-go lexical-decision task. Word stimuli were cons
Semantic Borders and Incomplete Understanding.
Silva-Filho, Waldomiro J; Dazzani, Maria Virgínia
2016-03-01
In this article, we explore a fundamental issue of Cultural Psychology, that is our "capacity to make meaning", by investigating a thesis from contemporary philosophical semantics, namely, that there is a decisive relationship between language and rationality. Many philosophers think that for a person to be described as a rational agent he must understand the semantic content and meaning of the words he uses to express his intentional mental states, e.g., his beliefs and thoughts. Our argument seeks to investigate the thesis developed by Tyler Burge, according to which our mastery or understanding of the semantic content of the terms which form our beliefs and thoughts is an "incomplete understanding". To do this, we discuss, on the one hand, the general lines of anti-individualism or semantic externalism and, on the other, criticisms of the Burgean notion of incomplete understanding - one radical and the other moderate. We defend our understanding that the content of our beliefs must be described in the light of the limits and natural contingencies of our cognitive capacities and the normative nature of our rationality. At heart, anti-individualism leads us to think about the fact that we are social creatures, living in contingent situations, with important, but limited, cognitive capacities, and that we receive the main, and most important, portion of our knowledge simply from what others tell us. Finally, we conclude that this discussion may contribute to the current debate about the notion of borders.
Denotational semantics for thread algebra
Vu, T.D.
2008-01-01
This paper gives a denotational semantics for thread algebra (TA), an algebraic framework for the description and analysis of recent programming languages such as C# and Java [J.A. Bergstra, C.A. Middelburg, Thread algebra for strategic interleaving, Formal Aspects of Computing, in press.
Semantic enrichment of GPS trajectories
Graaff, de Victor; Keulen, van Maurice; By, de Rolf
2012-01-01
Semantic annotation of GPS trajectories helps us to recognize the interests of the creator of the GPS trajectories. Automating this trajectory annotation circumvents the requirement of additional user input. To annotate the GPS traces automatically, two types of automated input are required: 1) a co
Quality measurement of semantic standards
Folmer, E.J.A.; Oude Luttighuis, P.H.W.M.; Hillegersberg, J. van
2010-01-01
Quality of semantic standards is unadressed in current research while there is an explicit need from standard developers. The business importance is evident since quality of standards will have impact on its diffusion and achieved interoperability in practice. An instrument to measure the quality of
Semantic Annotation of Computational Components
Vanderbilt, Peter; Mehrotra, Piyush
2004-01-01
This paper describes a methodology to specify machine-processable semantic descriptions of computational components to enable them to be shared and reused. A particular focus of this scheme is to enable automatic compositon of such components into simple work-flows.
Ohler, Jason
2008-01-01
The semantic web or Web 3.0 makes information more meaningful to people by making it more understandable to machines. In this article, the author examines the implications of Web 3.0 for education. The author considers three areas of impact: knowledge construction, personal learning network maintenance, and personal educational administration.…
Literature Review of Semantic Presupposition
Institute of Scientific and Technical Information of China (English)
张婷婷
2012-01-01
Since Gottlob Frege,the German philosopher and mathematician raises the concept of presupposition in his works On Sense and Reference at the end of the 19th century,to interpret some semantic phenomenon,the discussions of presupposition have become central in both linguistic field and the field of philosophy.Presupposition is a very important linguistic concept that originates from philosophy.
Towards semantic software engineering enviroments
Falbo, R.A.; Guizzardi, G.; Natali, A.; Bertollo, G.; Ruy, F.; Mian, P.; Tortora, G.; Chang, S.K.
2002-01-01
Software tools processing partially common set of data should share an understanding of what these data mean. Since ontologies have been used to express formally a shared understanding of information, we argue that they are a way towards Semantic SEEs. In this paper we discuss an ontology-based appr
Ohler, Jason
2008-01-01
The semantic web or Web 3.0 makes information more meaningful to people by making it more understandable to machines. In this article, the author examines the implications of Web 3.0 for education. The author considers three areas of impact: knowledge construction, personal learning network maintenance, and personal educational administration.…
Lexical Semantics and Irregular Inflection
Huang, Yi Ting; Pinker, Steven
2010-01-01
Whether a word has an irregular inflection does not depend on its sound alone: compare lie-lay (recline) and lie-lied (prevaricate). Theories of morphology, particularly connectionist and symbolic models, disagree on which nonphonological factors are responsible. We test four possibilities: (1) Lexical effects, in which two lemmas differ in whether they specify an irregular form; (2) Semantic effects, in which the semantic features of a word become associated with regular or irregular forms; (3) Morphological structure effects, in which a word with a headless structure (e.g., a verb derived from a noun) blocks access to a stored irregular form; (4) Compositionality effects, in which the stored combination of an irregular word’s meaning (e.g., the verb’s inherent aspect) with the meaning of the inflection (e.g., pastness) doesn’t readily transfer to new senses with different combinations of such meanings. In four experiments, speakers were presented with existing and novel verbs and asked to rate their past-tense forms, semantic similarities, grammatical structure, and aspectual similarities. We found (1) an interaction between semantic and phonological similarity, coinciding with reported strategies of analogizing to known verbs and implicating lexical effects; (2) weak and inconsistent effects of semantic similarity; (3) robust effects of morphological structure, and (4) robust effects of aspectual compositionality. Results are consistent with theories of language that invoke lexical entries and morphological structure, and which differentiate the mode of storage of regular and irregular verbs. They also suggest how psycholinguistic processes have shaped vocabulary structure over history. PMID:21151703
Integrated Semantic Similarity Model Based on Ontology
Institute of Scientific and Technical Information of China (English)
LIU Ya-Jun; ZHAO Yun
2004-01-01
To solve the problem of the inadequacy of semantic processing in the intelligent question answering system, an integrated semantic similarity model which calculates the semantic similarity using the geometric distance and information content is presented in this paper.With the help of interrelationship between concepts, the information content of concepts and the strength of the edges in the ontology network, we can calculate the semantic similarity between two concepts and provide information for the further calculation of the semantic similarity between user's question and answers in knowlegdge base.The results of the experiments on the prototype have shown that the semantic problem in natural language processing can also be solved with the help of the knowledge and the abundant semantic information in ontology.More than 90% accuracy with less than 50 ms average searching time in the intelligent question answering prototype system based on ontology has been reached.The result is very satisfied.
A Denotational Semantics for Communicating Unstructured Code
Directory of Open Access Journals (Sweden)
Nils Jähnig
2015-03-01
Full Text Available An important property of programming language semantics is that they should be compositional. However, unstructured low-level code contains goto-like commands making it hard to define a semantics that is compositional. In this paper, we follow the ideas of Saabas and Uustalu to structure low-level code. This gives us the possibility to define a compositional denotational semantics based on least fixed points to allow for the use of inductive verification methods. We capture the semantics of communication using finite traces similar to the denotations of CSP. In addition, we examine properties of this semantics and give an example that demonstrates reasoning about communication and jumps. With this semantics, we lay the foundations for a proof calculus that captures both, the semantics of unstructured low-level code and communication.
Scandinavian Semantics and the Human Body
DEFF Research Database (Denmark)
Levisen, Carsten
2015-01-01
, it is demonstrated that Scandinavian and English systems differ significantly in some aspects of the way in which the construe the human body with words. The study ventures an innovative combination of methods, pairing the Natural Semantic Metalanguage (NSM) approach to linguistic and conceptual analysis...... in closely related languages can differ substantially in their semantics. In related languages, where shared lexical form does not always mean shared semantics, ethnolinguistic studies in semantic change and shifts in polysemy patterns can help to reveal and explain the roots of semantic diversity.......This paper presents an ethnolinguistic analysis of how the space between the head and the body is construed in Scandinavian semantic systems vis-a-vis the semantic system of English. With an extensive case study of neck-related meanings in Danish, and with cross-Scandinavian reference...
Learning Dependency-Based Compositional Semantics
Liang, Percy; Klein, Dan
2011-01-01
Suppose we want to build a system that answers a natural language question by representing its semantics as a logical form and computing the answer given a structured database of facts. The core part of such a system is the semantic parser that maps questions to logical forms. Semantic parsers are typically trained from examples of questions annotated with their target logical forms, but this type of annotation is expensive. Our goal is to learn a semantic parser from question-answer pairs instead, where the logical form is modeled as a latent variable. Motivated by this challenging learning problem, we develop a new semantic formalism, dependency-based compositional semantics (DCS), which has favorable linguistic, statistical, and computational properties. We define a log-linear distribution over DCS logical forms and estimate the parameters using a simple procedure that alternates between beam search and numerical optimization. On two standard semantic parsing benchmarks, our system outperforms all existing...