scholarly journals A Common Framework Using Expected Types for Several Type Debugging Approaches

2018 ◽  
pp. 230-246
Author(s):  
Kanae Tsushima ◽  
Olaf Chitil
Keyword(s):  
Common Framework

Assessing Potential Herb-Drug Interactions Using a Common Framework Approach: Boswellia serrata as a Case Study

Planta Medica ◽  
2016 ◽  
Vol 82 (05) ◽  
Author(s):  
AL Roe ◽  
C Black ◽  
K Brouwer ◽  
J Jackson ◽  
FB Jariwala ◽  
...  
Keyword(s):  
Drug Interactions ◽  
Boswellia Serrata ◽  
Framework Approach ◽  
Common Framework

A New Model of Man in Economics

2011 ◽  
pp. 78-98
Author(s):  
M. Storchevoy
Keyword(s):  
Behavioral Economics ◽  
Human Behavior ◽  
Social Factors ◽  
Rational Behavior ◽  
New Model ◽  
Common Framework

The paper draws on the most recent research in the field of behavioral economics, neuroscience, and other disciplines and shows how biological and social factors interact and co-determine real human behavior. The author considers in detail various affects and forms of non-rational behavior. He proposes a common framework for such analysis, where each of those forms of behavior becomes the result of conscious or evolutionary-driven choice.

Creating a local food procurement community of practice: The Alberta Flavour Learning Lab

2019 ◽  
Vol 6 (1) ◽  
pp. 155-169 ◽  
Author(s):  
Mary Anne Beckie ◽  
Leanne Hedberg ◽  
Jessie Radies
Keyword(s):  
Community Of Practice ◽  
Large Scale ◽  
Food System ◽  
Local Food ◽  
Provincial Government ◽  
Local Foods ◽  
Social Infrastructure ◽  
City Region ◽  
Physical Scale ◽  
Common Framework

In order for local food initiatives (LFIs) to have a transformative effect on the larger food system, greater levels of economic, organizational and physical scale are needed. One way for LFIs to reach the scale necessary to generate a more significant impact is through increased institutional procurement of local foods. But how do people and organizations come together to generate the social infrastructure required to shift food purchasing practices and processes? This field report shares the story of an innovative community of practice consisting of institutional food buyers, large-scale distributors, regional retailers, processors, producers, researchers, municipal and provincial government representatives within the Edmonton city-region that formed for the express purpose of “creating a positive community impact by getting more local foods on more local plates”. In describing the formation and first three years of the Alberta Flavour Learning Lab we examine the unique characteristics of this community of practice that has aided the development of a common framework for learning, understanding and joint action. In addition to the accomplishments to date, we also discuss the challenges faced by the Learning Lab and the strategies used to overcome them.  

Evaluvation of Multiresolution Watermarking Algorithm

2017 ◽  
Vol 7 (8) ◽  
pp. 85
Author(s):  
S. Thabasu Kannan ◽  
S. Azhagu Senthil
Keyword(s):  
Digital Watermarking ◽  
Wavelet Transformation ◽  
Signal To Noise Ratio ◽  
Rapid Development ◽  
Threshold Value ◽  
Discrete Wavelet ◽  
Digital Production ◽  
Common Framework ◽  
Sampling Operation ◽  
Watermarking Scheme

Now-a-days watermarking plays a pivotal role in most of the industries for providing security to their own as well as hired or leased data. This paper its main aim is to study the multiresolution watermarking algorithms and also choosing the effective and efficient one for improving the resistance in data compression. Computational savings from such a multiresolution watermarking framework is obvious. The multiresolutional property makes our watermarking scheme robust to image/video down sampling operation by a power of two in either space or time. There is no common framework for multiresolutional digital watermarking of both images and video. A multiresolution watermarking based on the wavelet transformation is selected in each frequency band of the Discrete Wavelet Transform (DWT) domain and therefore it can resist the destruction of image processing.   The rapid development of Internet introduces a new set of challenging problems regarding security. One of the most significant problems is to prevent unauthorized copying of digital production from distribution. Digital watermarking has provided a powerful way to claim intellectual protection. We proposed an idea for enhancing the robustness of extracted watermarks. Watermark can be treated as a transmitted signal, while the destruction from attackers is regarded as a noisy distortion in channel.  For the implementation, we have used minimum nine coordinate positions. The watermarking algorithms to be taken for this study are Corvi algorithm and Wang algorithm. In all graph, we have plotted X axis as peak signal to noise ratio (PSNR) and y axis as Correlation with original watermark. The threshold value ά is set to 5. The result is smaller than the threshold value then it is feasible, otherwise it is not.

scholarly journals Residuated Structures and Orthomodular Lattices

Studia Logica ◽  
2021 ◽  
Author(s):  
D. Fazio ◽  
A. Ledda ◽  
F. Paoli
Keyword(s):  
Algebraic Logic ◽  
Residuated Lattices ◽  
Quantum Structures ◽  
Heyting Algebras ◽  
Quantum Algebras ◽  
Orthomodular Lattices ◽  
Lattice Of Subvarieties ◽  
Residuated Structures ◽  
Common Framework ◽  
Mv Algebras

AbstractThe variety of (pointed) residuated lattices includes a vast proportion of the classes of algebras that are relevant for algebraic logic, e.g., $$\ell $$ ℓ -groups, Heyting algebras, MV-algebras, or De Morgan monoids. Among the outliers, one counts orthomodular lattices and other varieties of quantum algebras. We suggest a common framework—pointed left-residuated $$\ell $$ ℓ -groupoids—where residuated structures and quantum structures can all be accommodated. We investigate the lattice of subvarieties of pointed left-residuated $$\ell $$ ℓ -groupoids, their ideals, and develop a theory of left nuclei. Finally, we extend some parts of the theory of join-completions of residuated $$\ell $$ ℓ -groupoids to the left-residuated case, giving a new proof of MacLaren’s theorem for orthomodular lattices.

scholarly journals Skeletal stochastic differential equations for superprocesses

2020 ◽  
Vol 57 (4) ◽  
pp. 1111-1134
Author(s):  
Dorottya Fekete ◽  
Joaquin Fontbona ◽  
Andreas E. Kyprianou
Keyword(s):  
Branching Process ◽  
Branching Processes ◽  
Subcritical Case ◽  
Markov Branching Process ◽  
Continuous State ◽  
Common Framework ◽  
Infinite Line ◽  
Current Article ◽  
Lines Of Descent ◽  
Skeletal Representation

AbstractIt is well understood that a supercritical superprocess is equal in law to a discrete Markov branching process whose genealogy is dressed in a Poissonian way with immigration which initiates subcritical superprocesses. The Markov branching process corresponds to the genealogical description of prolific individuals, that is, individuals who produce eternal genealogical lines of descent, and is often referred to as the skeleton or backbone of the original superprocess. The Poissonian dressing along the skeleton may be considered to be the remaining non-prolific genealogical mass in the superprocess. Such skeletal decompositions are equally well understood for continuous-state branching processes (CSBP).In a previous article [16] we developed an SDE approach to study the skeletal representation of CSBPs, which provided a common framework for the skeletal decompositions of supercritical and (sub)critical CSBPs. It also helped us to understand how the skeleton thins down onto one infinite line of descent when conditioning on survival until larger and larger times, and eventually forever.Here our main motivation is to show the robustness of the SDE approach by expanding it to the spatial setting of superprocesses. The current article only considers supercritical superprocesses, leaving the subcritical case open.

scholarly journals The Cryptographic Complexity of Anonymous Coins: A Systematic Exploration

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 10
Author(s):  
Niluka Amarasinghe ◽  
Xavier Boyen ◽  
Matthew McKague
Keyword(s):  
Ad Hoc ◽  
Significant Rise ◽  
Security Models ◽  
Systematic Exploration ◽  
Wide Range ◽  
Distributed Transaction ◽  
Common Framework

The modern financial world has seen a significant rise in the use of cryptocurrencies in recent years, partly due to the convincing lure of anonymity promised by these schemes. Bitcoin, despite being considered as the most widespread among all, is claimed to have significant lapses in relation to its anonymity. Unfortunately, studies have shown that many cryptocurrency transactions can be traced back to their corresponding participants through the analysis of publicly available data, to which the cryptographic community has responded by proposing new constructions with improved anonymity claims. Nevertheless, the absence of a common metric for evaluating the level of anonymity achieved by these schemes has led to numerous disparate ad hoc anonymity definitions, making comparisons difficult. The multitude of these notions also hints at the surprising complexity of the overall anonymity landscape. In this study, we introduce such a common framework to evaluate the nature and extent of anonymity in (crypto) currencies and distributed transaction systems, thereby enabling one to make meaningful comparisons irrespective of their implementation. Accordingly, our work lays the foundation for formalizing security models and terminology across a wide range of anonymity notions referenced in the literature, while showing how “anonymity” itself is a surprisingly nuanced concept, as opposed to existing claims that are drawn upon at a higher level, thus missing out on the elemental factors underpinning anonymity.

Sign in / Sign up

Export Citation Format

Share Document