Feasibility study for a generalized gate logic software simulator

Unit-delay simulation, event driven simulation, zero-delay simulation, simulation techniques, 2-valued versus multivalued logic, network initialization, gate operations and alternate network representations, parallel versus serial mode simulation fault modelling, extension of multiprocessor systems, and simulation timing are discussed. Functional level networks, gate equivalent circuits, the prototype BDX-930 network model, fault models, identifying detected faults for BGLOSS are discussed. Preprocessor tasks, postprocessor tasks, executive tasks, and a library of bliss coded macros for GGLOSS are also discussed

Model-based dependability analysis : state-of-the-art, challenges and future outlook

Abstract: Over the past two decades, the study of model-based dependability analysis has gathered significant research interest. Different approaches have been developed to automate and address various limitations of classical dependability techniques to contend with the increasing complexity and challenges of modern safety-critical system. Two leading paradigms have emerged, one which constructs predictive system failure models from component failure models compositionally using the topology of the system. The other utilizes design models - typically state automata - to explore system behaviour through fault injection. This paper reviews a number of prominent techniques under these two paradigms, and provides an insight into their working mechanism, applicability, strengths and challenges, as well as recent developments within these fields. We also discuss the emerging trends on integrated approaches and advanced analysis capabilities. Lastly, we outline the future outlook for model-based dependability analysis

A Reconfigurable Vector Instruction Processor for Accelerating a Convection Parametrization Model on FPGAs

High Performance Computing (HPC) platforms allow scientists to model computationally intensive algorithms. HPC clusters increasingly use General-Purpose Graphics Processing Units (GPGPUs) as accelerators; FPGAs provide an attractive alternative to GPGPUs for use as co-processors, but they are still far from being mainstream due to a number of challenges faced when using FPGA-based platforms. Our research aims to make FPGA-based high performance computing more accessible to the scientific community. In this work we present the results of investigating the acceleration of a particular atmospheric model, Flexpart, on FPGAs. We focus on accelerating the most computationally intensive kernel from this model. The key contribution of our work is the architectural exploration we undertook to arrive at a solution that best exploits the parallelism available in the legacy code, and is also convenient to program, so that eventually the compilation of high-level legacy code to our architecture can be fully automated. We present the three different types of architecture, comparing their resource utilization and performance, and propose that an architecture where there are a number of computational cores, each built along the lines of a vector instruction processor, works best in this particular scenario, and is a promising candidate for a generic FPGA-based platform for scientific computation. We also present the results of experiments done with various configuration parameters of the proposed architecture, to show its utility in adapting to a range of scientific applications.Comment: This is an extended pre-print version of work that was presented at the international symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART2014), Sendai, Japan, June 911, 201

A Simulation Tool for tccp Programs

The Timed Concurrent Constraint Language tccp is a declarative synchronous concurrent language, particularly suitable for modelling reactive systems. In tccp, agents communicate and synchronise through a global constraint store. It supports a notion of discrete time that allows all non-blocked agents to proceed with their execution simultaneously. In this paper, we present a modular architecture for the simulation of tccp programs. The tool comprises three main components. First, a set of basic abstract instructions able to model the tccp agent behaviour, the memory model needed to manage the active agents and the state of the store during the execution. Second, the agent interpreter that executes the instructions of the current agent iteratively and calculates the new agents to be executed at the next time instant. Finally, the constraint solver components which are the modules that deal with constraints. In this paper, we describe the implementation of these components and present an example of a real system modelled in tccp.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Computer-aided proofs for multiparty computation with active security

Secure multi-party computation (MPC) is a general cryptographic technique that allows distrusting parties to compute a function of their individual inputs, while only revealing the output of the function. It has found applications in areas such as auctioning, email filtering, and secure teleconference. Given its importance, it is crucial that the protocols are specified and implemented correctly. In the programming language community it has become good practice to use computer proof assistants to verify correctness proofs. In the field of cryptography, EasyCrypt is the state of the art proof assistant. It provides an embedded language for probabilistic programming, together with a specialized logic, embedded into an ambient general purpose higher-order logic. It allows us to conveniently express cryptographic properties. EasyCrypt has been used successfully on many applications, including public-key encryption, signatures, garbled circuits and differential privacy. Here we show for the first time that it can also be used to prove security of MPC against a malicious adversary. We formalize additive and replicated secret sharing schemes and apply them to Maurer's MPC protocol for secure addition and multiplication. Our method extends to general polynomial functions. We follow the insights from EasyCrypt that security proofs can be often be reduced to proofs about program equivalence, a topic that is well understood in the verification of programming languages. In particular, we show that in the passive case the non-interference-based definition is equivalent to a standard game-based security definition. For the active case we provide a new NI definition, which we call input independence

Penguasaan kemahiran generik di kalangan graduan hospitaliti di politeknik : satu kajian berkenaan keperluan industri perhotelan, persepsi pensyarah dan pelajar

Kajian yang dijalankan ini bertujuan untuk mengenal pasti kepentingan kemahiran generik mengikut keperluan industri perhotelan di Malaysia dengan persepsi pensyarah dan persepsi pelajar Jabatan Hospitaliti. Oleh kerana matlamat kurikulum pendidikan kini adalah untuk melahirkan graduan yang dapat memenuhi keperluan pihak industri, maka kajian ini dijalankan untuk menilai hubungan di antara keperluan industri perhotelan di Malaysia dengan persepsi pensyarah dan pelajar Jabatan Hospitaliti di Politeknik. Terdapat 13 kemahiran generik yang diperolehi daripada Kementerian Pelajaran dan Latihan Ontario (1997) dijadikan sebagai skop kepada instrumen kajian. Responden kajian terdiri daripada tiga pihak utama iaitu industri perhotelan di Malaysia yang melibatkan 40 buah hotel yang diwakili oleh MAH Chapter dan jawatankuasa dalam Malaysian Associated of Hotel (MAH), pensyarah Unit Hotel dan Katering dan pelajar semester akhir Diploma Hotel dan Katering di Politeknik Johor Bahru, Johor dan Politeknik Merlimau, Melaka. Kajian rintis yang dijalankan menunjukkan nilai Alpha Cronbach pada 0.8781. Data yang diperolehi dianalisis secara deskriptif dan inferensi dengan menggunakan perisian Statistical Package for Social Science (SPSS) versi 11.5. Melalui dapatan kajian, satu senarai berkenaan kemahiran generik yang diperlukan oleh industri perhotelan telah dapat dihasilkan. Selain itu, senarai kemahiran generik menurut persepsi pensyarah dan juga persepsi pelajar turut dihasilkan. Hasil statistik dan graf garis yang diperolehi menunjukkan terdapat perbezaan di antara kemahiran generik yang diperlukan oleh industri perhotelan di Malaysia dengan kemahiran generik menurut persepsi pensyarah dan persepsi pelajar Politeknik. Dapatan analisis menggunakan korelasi Pearson mendapati bahawa tidak terdapat perhubungan yang signifikan di antara kemahiran generik yang diperlukan oleh industri perhotelan dengan persepsi pensyarah dan persepsi pelajar. Namun begitu, terdapat hubungan yang signifikan di antara persepsi pensyarah dengan persepsi pelajar berkenaan dengan amalan kemahiran generik di Politeknik

Adaptive neurofuzzy ANFIS modeling of laser surface treatments

This paper introduces a new ANFIS adaptive neurofuzzy inference model for laser surface heat treatments based on the Green’s function. Due to its high versatility, efficiency and low simulation time, this model is suitable not only for the analysis and design of control systems, but also for the development of an expert real time supervision system that would allow detecting and preventing any failure during the treatment