Computer Engineering Commons^™

Simple Implementation Of An Elgamal Digital Signature And A Brute Force Attack On It, Valeriia Laryoshyna

Student Works

This study is an attempt to show a basic mathematical usage of the concepts behind digital signatures and to provide a simple approach and understanding to cracking basic digital signatures. The approach takes on simple C programming of the ElGamal digital signature to identify some limits that can be encountered and provide considerations for making more complex code. Additionally, there is a literature review of the ElGamal digital signature and the brute force attack.

The research component of this project provides a list of possible ways to crack the basic implementations and classifies the different approaches that could be taken …

Improving Disciplinary Literacy In An Electronics Course, Ohbong Kwon, Juanita C. But, Sunghoon Jang

Publications and Research

Electronics (EMT1255) is a required course for the Associate Degree in Applied Science (AAS) in Electromechanical Engineering Technology (EMT) at New York City College of Technology. EMT1255 introduces semiconductor devices and their applications in electronic-circuits. Students are expected to understand the structures and principles of semiconductor devices and the configuration and principles of basic electronic circuits. They also learn to analyze and design electronic circuits. In the lab setting, they acquire troubleshooting knowledge and hands-on technical skills. In this reading intensive course, students need to read the lab manual and a textbook of over 700 pages. Therefore, reading and understanding …

The Tax Treatment Of Tokens: What Does It Betoken?, David J. Shakow

All Faculty Scholarship

Digital tokens have been used to raise substantial amounts of money. But little attention has been paid to the tax consequences surrounding their issuance and sale. There are significant potential tax liabilities lurking in the use of digital tokens. But, because of the anonymity inherent in the blockchain structures used for the issuance of tokens and payments for them, there is a significant question as to whether those tax liabilities will ever be collected.

One-To-Cloud One-Time Pad Data Encryption: Introducing Virtual Prototyping With Pspice, Paul Tobin, Lee Tobin, Roberto Gandia Blanquer Dr, Michael Mckeever, Jonathan Blackledge

Conference papers

In this paper, we examine the design and application of a one-time pad encryption system for protecting data stored in the Cloud. Personalising security using a one-time pad generator at the client-end protects data from break-ins, side-channel attacks and backdoors in public encryption algorithms. The one-time pad binary sequences were obtained from modified analogue chaos oscillators initiated by noise and encoded client data locally. Specific ``one-to-Cloud'' storage applications returned control back to the end user but without the key distribution problem normally associated with one-time pad encryption. Development of the prototype was aided by ``Virtual Prototyping'' in the latest version …

Multiple-Phase Modeling Of Degradation Signal For Condition Monitoring And Remaining Useful Life Prediction, Yuxin Wen, Jianguo Wu, Yuan Yuan

Engineering Faculty Articles and Research

Remaining useful life prediction plays an important role in ensuring the safety, availability, and efficiency of various engineering systems. In this paper, we propose a flexible Bayesian multiple-phase modeling approach to characterize degradation signals for prognosis. The priors are specified with a novel stochastic process and the multiple-phase model is formulated to a novel state-space model to facilitate online monitoring and prediction. A particle filtering algorithm with stratified sampling and partial Gibbs resample-move strategy is developed for online model updating and residual life prediction. The advantages of the proposed method are demonstrated through extensive numerical studies and real case studies.

Design And Implementation Of An Archetype Based Interoperable Knowledge Eco-System For Data Buoys, Paul Stacey, Damon Berry

Conference papers

This paper describes the ongoing work of the authors in translating two-level system design techniques used in Health Informatics to the Earth Systems Science domain. Health informaticians have developed a sophisticated two-level systems design approach for electronic health documentation over many years, and with the use of archetypes, have shown how knowledge interoperability among heterogeneous systems can be achieved. Translating two-level modelling techniques to a new domain is a complex task. A proof-of-concept archetype enabled data buoy eco-system is presented. The concept of operational templates-as-a service is proposed. Design recommendations and implementation experiences of re-working the proposed architecture to run …

Propagating Degrees Of Truth On An Argumentation Framework: An Abstract Account Of Fuzzy Argumentation, Pierpaolo Dondio

Conference papers

This paper proposes a computational framework to reason with conflicting and gradual evidence. The framework is a synthesis of Dung’s seminal work in argumentation semantics with multi-valued logic. Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions. We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel’s, Zadeh’s and Łukasiewicz's logic.

Distinguished Alumni Luncheon With Dr. Wayne A. Brown, Nova Southeastern University

College of Computing and Engineering News Archive

Last week on November 9th, 2017, Dr. Tao and Dr. Abramson had the pleasure of honoring CCE's distinguished alumni Dr. Wayne A. Brown as part of the NSU's Homecoming festivities.

Robert B. Batie Jr., Ph.D., Nova Southeastern University

College of Computing and Engineering News Archive

It’s a safe bet to say that Robert B. Batie Jr., Ph.D., has seen a thing or two. Given his 22 years in the U.S. Army, it’s pretty clear to understand why. That’s because in those 2+ decades he traveled to 33 foreign countries, 41 of the 50 states and visited every continent aside from Antarctica and Australia. And it was his chosen occupation while serving in the U.S. Army – Signal Corp as a Communications Security (COMSEC) Maintenance Chief – that led him to where he is today.

Cce Hosts Shbe Workshop, Nova Southeastern University

College of Computing and Engineering News Archive

Dr. Yong Tao, Dean and Professor, College of Computing and Engineering hosted the Interdisciplinary Data Structure for Collaborative Research in Sustainable Human-Building Ecosystems (SHBE) Workshop on June 5-6 at NSU Art Museum with the support from Bonnie Clearwater, Director and Chief Curator of NSU Art Museum. The workshop was aimed at bringing together professionals from multiple disciplines, i.e., architects, civil engineers, electrical engineers, mechanical engineers, computer scientists, social scientists, psychologists, and social/ public policy experts.

Cec Congratulates 2017 Dean's List, Nova Southeastern University

College of Computing and Engineering News Archive

College of Computing and Engineering at NSU (CCE) held its Fall 2017 Dean’s List reception on April 25. 18 undergraduate students major in computer science, computer engineering, information technology and engineering are on the 2017 Dean’s List and have achieved a minimum GPA of 3.8 for the semester. They are: Franco Criscola, Christopher Daniels, Maximiliano Hernandez, Liana Huynh, Abraham Kohn, Brogan O’Connor, Sagar Patel, Liam White, Karen Rita Ann D’Lima, Ashli Amoy Jarrett, Anthony DiFede, Corey Lee, Nicole Staley, Simon Wang, Lydia Warshaw, Albert Baldoni, Henry Koenig, Nikolas Kevorkian.

Quasivarieties And Varieties Of Ordered Algebras: Regularity And Exactness, Alexander Kurz

Engineering Faculty Articles and Research

We characterise quasivarieties and varieties of ordered algebras categorically in terms of regularity, exactness and the existence of a suitable generator. The notions of regularity and exactness need to be understood in the sense of category theory enriched over posets.

We also prove that finitary varieties of ordered algebras are cocompletions of their theories under sifted colimits (again, in the enriched sense).

Features Of Agent-Based Models, Reiko Heckel, Alexander Kurz, Edmund Chattoe-Brown

Engineering Faculty Articles and Research

The design of agent-based models (ABMs) is often ad-hoc when it comes to defining their scope. In order for the inclusion of features such as network structure, location, or dynamic change to be justified, their role in a model should be systematically analysed. We propose a mechanism to compare and assess the impact of such features. In particular we are using techniques from software engineering and semantics to support the development and assessment of ABMs, such as graph transformations as semantic representations for agent-based models, feature diagrams to identify ingredients under consideration, and extension relations between graph transformation systems to …

Foreword: Special Issue On Coalgebraic Logic, Alexander Kurz

Engineering Faculty Articles and Research

The second Dagstuhl seminar on coalgebraic logics took place from October 7-12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009. From the 44 researchers who attended and the 30 talks presented, this collection highlights some of the progress that has been made in the field. We are grateful to Giuseppe Longo and his interest in a special issue in Mathematical Structures in Computer Science.

The Positivication Of Coalgebraic Logics, Fredrik Dahlqvist, Alexander Kurz

Engineering Faculty Articles and Research

We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically computing a endofunctor T': Pos->Pos from an endofunctor T: Set->Set, in a procedure previously defined by the second author et alii called posetification. On the syntax side, it involves canonically computing a syntax-building functor L': DL->DL from a syntax-building functor L: BA->BA, in a dual procedure which we call positivication. These operations are interesting in their own right and we explicitly compute posetifications and positivications in the case …

An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea

Branch Mathematics and Statistics Faculty and Staff Publications

The paper aims to explain the technology of emergence of information. Our research proves that information as communicational product is the result of processing within some operations, actions, mechanisms and strategies of informational material meanings. Are determined eight computational-communicative operations of building information. Information occurs in two communication phases, syncretic and the segregation-synthetic. The syncretic phase consists of four operations: referral of significant field, primary delimitation of information, detection-looking information and an anticipative-draft constitution (feedforward). The segregation-synthetic phase also includes four operations: discrimination, identification, interpretation and confrontation (feedback). In the future we will investigate informational actions, mechanisms and strategies.

A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.