scholarly journals SAT-based termination analysis using monotonicity constraints over the integers

2011 ◽  
Vol 11 (4-5) ◽  
pp. 503-520 ◽  
Author(s):  
MICHAEL CODISH ◽  
IGOR GONOPOLSKIY ◽  
AMIR M. BEN-AMRAM ◽  
CARSTEN FUHS ◽  
JÜRGEN GIESL
Keyword(s):  
Ranking Function ◽  
Size Change ◽  
Trade Off ◽  
Termination Analysis ◽  
Preliminary Results ◽  
Java Bytecode ◽  
Front End ◽  
Monotonicity Constraints ◽  
Good Trade

AbstractWe describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a nontrivial extension of the well-known size-change termination method. While deciding termination for systems of monotonicity constraints is PSPACE complete, we focus on a well-defined and significant subset, which we call MCNP (for “monotonicity constraints in NP”), designed to be amenable to a SAT-based solution. Our technique is based on the search for a special type of ranking function defined in terms of bounded differences between multisets of integer values. We describe the application of our approach as the back end for the termination analysis of Java Bytecode. At the front end, systems of monotonicity constraints are obtained by abstracting information, using two different termination analyzers:AProVEandCOSTA. Preliminary results reveal that our approach provides a good trade-off between precision and cost of analysis.

Age and Performance Under Pressure

2012 ◽  
pp. 134-152 ◽  
Author(s):  
Harold O. Fried ◽  
Loren W. Tauer
Keyword(s):  
Correlation Coefficient ◽  
High Performance ◽  
Age Distribution ◽  
Mental Ability ◽  
Trade Off ◽  
Athletic Ability ◽  
Front End ◽  
Ladies Professional Golf Association ◽  
And Performance ◽  
Performance Under Pressure

This article explores how well an individual manages his or her own talent to achieve high performance in an individual sport. Its setting is the Ladies Professional Golf Association (LPGA). The order-m approach is explained. Additionally, the data and the empirical findings are presented. The inputs measure fundamental golfing athletic ability. The output measures success on the LPGA tour. The correlation coefficient between earnings per event and the ability to perform under pressure is 0.48. The careers of golfers occur on the front end of the age distribution. There is a classic trade-off between the inevitable deterioration in the mental ability to handle the pressure and experience gained with time. The ability to perform under pressure peaks at age 37.

Platinum(ii) acetylide complexes with star- and V-shaped configurations possessing good trade-off between optical transparency and optical power limiting performance

2017 ◽  
Vol 5 (45) ◽  
pp. 11672-11682 ◽  
Author(s):  
C. Yao ◽  
Z. Tian ◽  
D. Jin ◽  
F. Zhao ◽  
Y. Sun ◽  
...  
Keyword(s):  
Optical Power ◽  
Optical Transparency ◽  
Trade Off ◽  
Good Trade ◽  
Optical Power Limiting

Two series of Pt(ii) acetylide complexes containing dimesitylborane and phenyl terminal groups with star- and V-shaped configurations were synthesized.

New heterobimetallic Au(i)–Pt(ii) polyynes achieving a good trade-off between transparency and optical power limiting performance

2018 ◽  
Vol 6 (42) ◽  
pp. 11416-11426 ◽  
Author(s):  
Zhuanzhuan Tian ◽  
Xiaolong Yang ◽  
Boao Liu ◽  
Daokun Zhong ◽  
Guijiang Zhou ◽  
...  
Keyword(s):  
Optical Power ◽  
Trade Off ◽  
Good Trade ◽  
Optical Power Limiting

Two series of heterobimetallic Au(i)–Pt(ii) polyynes achieve consistency between enhanced transparency and high optical power limiting performances.

scholarly journals MATLAB-Like Scripting of Java Scientific Libraries in ScalaLab

2014 ◽  
Vol 22 (3) ◽  
pp. 187-199
Author(s):  
Stergios Papadimitriou ◽  
Seferina Mavroudi ◽  
Kostas Theofilatos ◽  
Spiridon Likothanasis
Keyword(s):  
Software Development ◽  
Scientific Computation ◽  
The Core ◽  
Java Bytecode ◽  
Front End ◽  
Average Scientist ◽  
Native Code ◽  
Scientific Libraries

Although there are a lot of robust and effective scientific libraries in Java, the utilization of these libraries in pure Java is difficult and cumbersome, especially for the average scientist that does not expertise in software development. We illustrate that ScalaLab presents an easier and productive MATLAB like front end. Also, the main strengths and weaknesses of the core Java libraries of ScalaLab are elaborated. Since performance is of paramount importance for scientific computation, the article discusses extensively performance aspects of the ScalaLab environment. Also, Java bytecode performance is compared to native code.

Zooming Diamonds: A New Illusion, and a Warning on the Biological Relevance of Parallel Projection

Perception ◽  
1997 ◽  
Vol 26 (1_suppl) ◽  
pp. 119-119
Author(s):  
R Cowie
Keyword(s):  
Vision Research ◽  
Biological Systems ◽  
Human Vision ◽  
Motion Path ◽  
Parallel Projection ◽  
Shape Discrimination ◽  
Elevation Change ◽  
Size Change ◽  
Trade Off ◽  
Fixed Distance

A new illusion is described. Observers watch parallel projections of ‘diamonds’ (rhombi) tumbling in 3-D. The displays are generated by moving a viewpoint round a fixed rhombus on a trajectory with two components—a circle parallel to the plane of the diamond, and a superimposed change in elevation which varies sinusoidally. To a greater or lesser extent, depending on the phase of the sinusoid, elevation change is misinterpreted as ‘zooming’ in and out—though in fact the projection always corresponds to an object at a fixed distance. The illusion was devised to underline the questions surrounding the treatment of parallel projection in biological systems. The standard formulations considered in computational vision preclude the kind of size - distance trade-off that the illusion demonstrates, but they do imply that observers should be able to register the shape of an object from this kind of display. A less familiar formulation, ‘paraperspective projection’, allows size - distance trade-off as in perspective projection, but it suggests the shape of a lamina should be impossible to recover from motion. Stimuli which promote ‘zooming’ do weaken shape discrimination, but the trade-off is incomplete. A possible solution is that human vision picks out size change in a way that is appropriate when either object or motion path is ‘friendly’, but that misleads when awkward combinations occur. Certainly vision research should avoid assuming that the attractively simple consequences associated with standard parallel projection govern the way biological systems operate.

scholarly journals Steganographic Scheme based on Message-Cover matching

2018 ◽  
Vol 8 (5) ◽  
pp. 3594
Author(s):  
Youssef Taouil ◽  
El Bachir Ameur
Keyword(s):  
Wavelet Transform ◽  
Discrete Wavelet Transform ◽  
Secret Message ◽  
Discrete Wavelet ◽  
Large Set ◽  
Integer Part ◽  
Least Significant Bit ◽  
Secret Data ◽  
Trade Off ◽  
Good Trade

Steganography is one of the techniques that enter into the field of information   security, it is the art of dissimulating data into digital files in an imperceptible way that does not arise the suspicion. In this paper, a steganographic method based on the Faber-Schauder discrete wavelet transform is proposed. The embedding of the secret data is performed in Least Significant Bit (LSB) of the integer part of the wavelet coefficients. The secret message is decomposed into pairs of bits, then each pair is transformed into another pair based on a permutation that allows to obtain the most matches possible between the message and the LSB of the coefficients. To assess the performance of the proposed method, experiments were carried out on a large set of images, and a comparison to prior works is accomplished. Results show a good level of imperceptibility and a good trade-off imperceptibility-capacity compared to literature.

scholarly journals On the Depth of Deep Learning Models for Splice Site Identification

2018 ◽  
Author(s):  
Reem Elsousy ◽  
Nagarajan Kathiresan ◽  
Sabri Boughorbel
Keyword(s):  
Computer Vision ◽  
Deep Learning ◽  
Splice Site ◽  
Dna Sequences ◽  
Classification Performance ◽  
Model Parameters ◽  
Learning Models ◽  
Trade Off ◽  
Good Trade ◽  
Site Identification

AbstractThe success of deep learning has been shown in various fields including computer vision, speech recognition, natural language processing and bioinformatics. The advance of Deep Learning in Computer Vision has been an important source of inspiration for other research fields. The objective of this work is to adapt known deep learning models borrowed from computer vision such as VGGNet, Resnet and AlexNet for the classification of biological sequences. In particular, we are interested by the task of splice site identification based on raw DNA sequences. We focus on the role of model architecture depth on model training and classification performance.We show that deep learning models outperform traditional classification methods (SVM, Random Forests, and Logistic Regression) for large training sets of raw DNA sequences. Three model families are analyzed in this work namely VGGNet, AlexNet and ResNet. Three depth levels are defined for each model family. The models are benchmarked using the following metrics: Area Under ROC curve (AUC), Number of model parameters, number of floating operations. Our extensive experimental evaluation show that shallow architectures have an overall better performance than deep models. We introduced a shallow version of ResNet, named S-ResNet. We show that it gives a good trade-off between model complexity and classification performance.Author summaryDeep Learning has been widely applied to various fields in research and industry. It has been also succesfully applied to genomics and in particular to splice site identification. We are interested in the use of advanced neural networks borrowed from computer vision. We explored well-known models and their usability for the problem of splice site identification from raw sequences. Our extensive experimental analysis shows that shallow models outperform deep models. We introduce a new model called S-ResNet, which gives a good trade-off between computational complexity and classification accuracy.

Sign in / Sign up

Export Citation Format

Share Document