Results 251 to 260 of about 717,652 (279)

PROOF SCORE APPROACH TO ANALYSIS OF ELECTRONIC COMMERCE PROTOCOLS

International Journal of Software Engineering and Knowledge Engineering, 2010
Proof scores are documents of comprehensible plans to prove theorems. The proof score approach to systems analysis is a method in which proof scores are used to verify that systems enjoy properties (or analyze systems). In this paper, we describe a way to analyze electronic commerce protocols with the proof score approach, which has been developed and
Kazuhiro Ogata 0001, Kokichi Futatsugi
openaire   +1 more source

Verifying Specifications with Proof Scores in CafeOBJ

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), 2006
Verifying specifications is still one of the most important undeveloped research topics in software engineering. It is important because quite a few critical bugs are caused at the level of domains, requirements, and/or designs. It is also important for the cases where no program codes are generated and specifications are analyzed and verified only for
openaire   +1 more source

Strategy Proof Scoring Rule Lotteries for Multiple Winners

Journal of Public Economic Theory, 2013
AbstractWe develop a lottery procedure for selecting multiple winners that is strategy proof. The rule assigns points to each candidate based on any standard scoring rule method, and then uses one draw to select a single winning set of candidates in proportion to their collective score.
JAC C. HECKELMAN, FREDERICK H. CHEN
openaire   +1 more source

Fostering Proof Scores in CafeOBJ 

2010
Proof scores are instructions to a proof engine such that when executed, if everything evaluates as expected, then a desired theorem is proved. Proof scores hide the detailed calculations done by machines, while revealing the proof plan created by humans.
openaire   +1 more source

Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub‐tournaments

Journal of Graph Theory, 2001
AbstractAo and Hanson, and Guiduli, Gyárfás, Thomassé and Weidl independently, proved the following result: For any tournament score sequence S = (s1, s2, … ,sn) with s1≤s2 ≤ … ≤ sn, there exists a tournament T on vertex set {1,2, …, n} such that the score of each vertex i is si and the sub‐tournaments of T on both the even and the odd indexed vertices
Richard A. Brualdi, Jian Shen
openaire   +2 more sources

Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method

2006
The OTS/CafeOBJ method is an instance of the proof score approach to systems analysis, which has been mainly devoted by researchers in the OBJ community. We describe some tips on writing proof scores in the OTS/CafeOBJ method and use a mutual exclusion protocol to exemplify the tips. We also argue soundness of proof scores in the OTS/CafeOBJ method.
Kazuhiro Ogata 0001, Kokichi Futatsugi
openaire   +1 more source

Five Portraits: proof for full score, page 2

2018
Score for violin and piano; Commissioned by the McKim Fund in The Library of ...
openaire   +2 more sources

A New Explanation and Proof of the Paradoxical Scoring Results in Multidimensional Item Response Models

Psychometrika, 2018
In multidimensional item response models, paradoxical scoring effects can arise, wherein correct answers are penalized and incorrect answers are rewarded. For the most prominent class of IRT models, the class of linearly compensatory models, a general derivation of paradoxical scoring effects based on the geometry of item discrimination vectors is ...
Jordan, Pascal, Spiess, Martin
openaire   +2 more sources

Generic Proof Scores for Generate & Check Method in CafeOBJ 

2015
Generic proof scores for the generate & check method in CafeOBJ are described. The generic proof scores codify the generate & check method as parameterized modules in the CafeOBJ language independently of specific systems to which the method applies. Basic proof scores for a specific system can be obtained by instantiating the formal parameter modules ...
openaire   +1 more source

Prediction of pink esthetic score using deep learning: A proof of concept

Journal of Dentistry
This study aimed to develop a deep learning (DL) model for the predictive esthetic evaluation of single-implant treatments in the esthetic zone.A total of 226 samples, each comprising three intraoral photographs and 12 clinical features, were collected for proof of concept.
Ziang Wu, Yizhou Chen, Xinbo Yu, Feng Wang, Haochen Shi, Fang Qu, Yingyi Shen, Xiaojun Chen, Chun Xu   +8 more
openaire   +2 more sources