4,262 research outputs found
Hybrid cc, Hybrid Automata and Program Verification (Extended Abstract)
No full text) Vineet Gupta ? Radha Jagadeesan ?? Vijay Saraswat ? 1 Introduction Synchronous programming. Discrete event driven systems [HP85,Ber89,Hal93] are systems that react with their environment at a rate controlled by the environment. Such systems can be quite complex, so for modular development and re-use considerations, a model of a composite system should be built up from models of the components compositionally. From a programming language standpoint, this modularity concern is addressed by the analysis underlying synchronous languages [BB91,Hal93,BG92,HCP91,GBGM91,Har87,CLM91,SJG95], (adapted to dense discrete domains in [BBG93]): -- Logical concurrency/parallelism plays a role in determinate reactive system programming analogous to the role of procedural abstraction in sequential programming --- the role of matching program structure to the structure of the solution to the problem at hand. -- Preemption --- the ability to stop a process in its tracks --- is a fundamental progr..
Stochastic Processes as Concurrent Constraint Programs (Extended Abstract)
No full text) Vineet Gupta Radha Jagadeesan Prakash Panangaden y [email protected] [email protected] [email protected] Caelum Research Corporation Dept. of Math. and Computer Sciences School of Computer Science NASA Ames Research Center Loyola University--Lake Shore Campus McGill University Moffett Field CA 94035, USA Chicago IL 60626, USA Montreal, Quebec, Canada Abstract This paper describes a stochastic concurrent constraint language for the description and programming of concurrent probabilistic systems. The language can be viewed both as a calculus for describing and reasoning about stochastic processes and as an executable language for simulating stochastic processes. In this language programs encode probability distributions over (potentially infinite) sets of objects. We illustrate the subtleties that arise from the interaction of constraints, random choice and recursion. We describe operational semantics of these programs (programs are run by sampling random choices), deno..
Stochastic processes as concurrent constraint programs
No full text) Vineet Gupta Radha Jagadeesan Prakash Panangaden y [email protected] [email protected] [email protected] Caelum Research Corporation Dept. of Math. and Computer Sciences School of Computer Science NASA Ames Research Center Loyola University--Lake Shore Campus McGill University Moffett Field CA 94035, USA Chicago IL 60626, USA Montreal, Quebec, Canada Abstract This paper describes a stochastic concurrent constraint language for the description and programming of concurrent probabilistic systems. The language can be viewed both as a calculus for describing and reasoning about stochastic processes and as an executable language for simulating stochastic processes. In this language programs encode probability distributions over (potentially infinite) sets of objects. We illustrate the subtleties that arise from the interaction of constraints, random choice and recursion. We describe operational semantics of these programs (programs are run by sampling random choices), deno..
The use of zoning mechanisms for growth management : downtown Boston in the 1980's
No full textThesis (M.C.P.)--Massachusetts Institute of Technology, Dept. of Urban Studies and Planning, 1988, and, Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1988.M.I.T. copy lacks leaf 98. Title as it appears in M.I.T. Graduate List, June 1988: Increasing the scope of activity of the private sector in urban development.Includes bibliographical references.by Vineet Kumar Gupta.M.S.M.C.P
cc - A Generic Framework for Domain Specific Languages (Extended Abstract)
No full text) Markus P J Fromherz Vineet Gupta Vijay Saraswat y Abstract cc programming is a general framework for constructing a wide variety of domain-specific languages. In this paper we show how such languages can be easily constructed using cc, and why cc is particularly suitable for the construction of such languages. 1 Introduction Increasingly, the widely available cheap and powerful computers of today are being applied in extraordinarily diverse settings --- from powering photocopiers and telephony systems and other real-time testing, control and diagnosis systems, to automation of inventory and account management at the neighbourhood video rental store or the phone-order catalog company, to suporting net-based publication and electronic communities. This brings computational scientists (and their tools and techniques) in contact with practitioners of other disciplines whose work touches these diverse areas of human activity --- engineers, control-theorists, management scientists..
SMT-based bounded model checking of multi-threaded software in embedded systems
No full textOur reliance on the correct functioning of embedded systems is growing rapidly. Such systems are used in a wide range of applications such as airbag control systems, mobile phones, and high-end television sets. These systems are becoming more and more complex and require multi-core processors with scalable shared memory to meet the increasing computational power demands. The reliability of the embedded (distributed) software is thus a key issue in the system development. In this thesis we describe and evaluate an approach to reason accurately and effectively about large embedded software using bounded model checking (BMC) based on Satisfiability Modulo Theories (SMT) techniques. We present three major novel contributions. First, we extend the encodings from previous SMT-based bounded model checkers to provide more accurate support for variables of finite bit width, bit-vector operations, arrays, structures, unions and pointers and thus making our approach suitable to reason about embedded software. We then provide new encodings into existing SMT theories and we show that our translations from ANSI-C programs to SMT formulas are as precise as bit-accurate procedures based on Boolean Satisfiability. Second, we develop three related approaches for model checking multi-threaded software in embedded systems. In the lazy approach, we generate all possible interleavings and call the SMT solver on each of them individually, until we either find a bug, or have systematically explored all interleavings. In the schedule recording approach, we encode all possible interleavings into one single formula and then exploit the high speed of the SMT solvers. In the underapproximation and widening approach, we reduce the state space by abstracting the number of interleavings from the proofs of unsatisfiability generated by the SMT solvers. Finally, we describe and evaluate an approach to integrate our SMT-based BMC into the software engineering process by making the verification process incremental. In particular, our approach looks at the modifications suffered by the software system since its last verification, and submits them to a partly static and dynamic verification process, which is thus guided by a set of test cases for coverage. Experiments show that our SMT-based BMC can analyze larger problems and reduce the verification time compared to state-of-the-art techniques that use BMC, iterative context-bounding or counterexample-guided abstraction refinement
Intermolecular charge transfer and vibrational analysis of hydrogen bonding in acetazolamide
No full textIn the present work the structural and spectral characteristics of acetazolamide have been studied by methods of infrared, Raman spectroscopy and quantum chemistry. Electrostatic potential surface, optimized geometry, harmonic vibrational frequencies, infrared intensities and activities of Raman scattering were calculated by density functional theory (DFT) employing B3LYP with complete relaxation in the potential energy surface using 6-311++G(d,p) basis set. Based on these results, we have discussed the correlation between the vibrational modes and the structure of the dimers of acetazolamide. The calculated vibrational spectra of three dimers of acetazolamide have been compared with observed spectra, and the assignment of observed bands was carried out using potential energy distribution. The observed spectra agree well with the values computed from the DFT. A comparison of observed and calculated vibrational spectra clearly shows the effect of hydrogen bonding. The frequency shifts observed for the different dimers are in accord with the hydrogen bonding in acetazolamide. Natural bond orbital (NBO) analyses reflect the charge transfer interaction in the individual hydrogen bond units and the stability of different dimers of acetazolamide
Data for Gupta et al., "Estimating the Meridional Extent of Adiabatic Mixing in the Stratosphere using Age-of-Air", JGR:Atmospheres,
No full textModel data and post-processed data supporting the creation of the manuscript "Estimating the Meridional Extent of Adiabatic Mixing in the Stratosphere using Age-of-Air" submitted to JGR:Atmospheres in August 2022.
1) The netCDF files created through post-processing of full model data in FORTRAN are shared in the /data/ directory. These file contains the zonal mean circulation statistics based on Gupta et al. (2020), age-of-air transport diagnostics based on Linz et al. (2021), and the novel \Gamma-\Theta circulation streamfunction introduced in this study. The /data/ directory also contains MATLAB .mat data files for the transport diagnostics obtained from WACCM. 150 days of actual GFDL-FV3 model data in the northern hemisphere, between 0.1 hPa-500 hPa pressure levels is also provided to support external computations and validation.
2) The Jupyter notebook used for final computation and figures production is provided in .ipynb, .html and .pdf formats in /code/. All the files referred to in the notebook are stored in the /data/ directory.
Corresponding author : Aman Gupta, [email protected], [email protected], [email protected]
Corrigendum: Capital Inflows and House Prices: Aggregate and Regional Evidence from China
No full textIn the paper ‘Capital Inflows and House Prices: Aggregate and Regional Evidence from China’ by H. An, et al., printed in the December 2016 issue, there was a missing acknowledgement section for funding resources.
On page 451, the acknowledgement section should appear after the corresponding information as:
“Correspondence: Rakesh Gupta, Department of Accounting, Finance and Economics, Griffith Business School, Griffith University, Nathan Campus QLD 4111. [email protected]
*This work was financially supported by the Humanities and Social Science Foundation of Ministry of Education of China (16YJA790001).”
The author apologises for this error and any confusion it may have caused.No Full Tex
- …
