Weights of criteria are the important factors in decision-making. However, from a behavioral perspective, traditional weighting methods account for too few factors to deal with decisions properly. Based on the behavior mechanism and the theory of habitual domains, this study is undertaken to develop a new weight-assessing model that treats decisionmaking as a dynamically adjusting process proce...

Spreadsheets are widely used in the business, public, and private sectors. However, research and practice has generally shown that spreadsheets frequently contain errors. Several researchers and vendors have proposed the use of spreadsheet static analysis programs (SAPs) as a means to augment or potentially replace the manual inspection of spreadsheets for errors. SAPs automatically search spre...

This paper describes the method used in the design of a 26 million transistors chip at BULL to verify the timing performance using the hierarchical timing analysis tool HiTas as well as the interactive path browser Xtas. Those tools have been designed at UPMC and are now commercialized by AVERTEC. The complexity is handled by partitioning the analysis according to the hierarchical partitioning ...

Article history: Received 17 February 2016 Accepted 30 May 2016 Available online 6 July 2016

............................................................................................................................... viii

We formalize the phenomenon of disruptive technologies that initially serve isolated market niches and, as they mature, expand to displace established technologies from mainstream segments. Using a novel model of horizontal and vertical di®erentiation with discrete customer segmentation, we show how the emergence of technology competition depends on numerous factors including the number of ̄rms...

Dedicated to Peter Andrews on the occasion of his 70 th birthday.

interpretation: computing on properties readInt(x) if x>0 : x:= pred(x) x:= succ(x) writeInt(x) Q: Is output pos? A: abstractly interpret domain Int by Sign = {neg, zero, pos, any}: readSign(x) if isPos(x): x:= pred(x) x:= succ(x) writeSign(x) where succ(pos) = pos succ(zero) = pos succ(neg) = any succ(any) = any and pred(neg) = neg pred(zero) = neg pred(pos) = any pred(any) = any To answer the...