Results 41 to 50 of about 2,023 (88)

Modeling Regular Replacement for String Constraint Solving [PDF]

open access: yes
Bugs in user input sanitation of software systems often lead to vulnerabilities. Among them many are caused by improper use of regular replacement.
Fu, Xiang, Li, Chung-Chih
core   +1 more source

A coprocessor design for the architectural support of non-numeric operations [PDF]

open access: yes, 1988
Computer Science is concerned with the electronic manipulation of information. Continually increasing amounts of computer time are being expended on information that is not numeric.
Curry, Timothy W.
core   +1 more source

Flight Safety Assessment and Management. [PDF]

open access: yes, 2016
This dissertation develops a Flight Safety Assessment and Management (FSAM) system to mitigate aircraft loss of control risk. FSAM enables switching between the pilot/nominal autopilot system and a complex flight control system that can potentially ...
Balachandran, Sweewarman
core  

Sensor fusion for fault detection and classification in distributed physical processes [PDF]

open access: yes, 2014
This paper proposes a feature extraction and fusion methodology to perform fault detection and classification in distributed physical processes generating heterogeneous data. The underlying concept is built upon a semantic framework for multi-sensor data
Ray, Asok   +4 more
core   +1 more source

Algebraic Approaches to State Complexity of Regular Operations [PDF]

open access: yes, 2019
The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory of semigroups and monoids, many problems in this area can be simplified or ...
Davies, Sylvie
core  

Learning Author’s Writing Pattern System By Automata [PDF]

open access: yes, 2011
The purpose of the report is to document our project’s theory, implementation and test results. The project works on an automata-based learning system which models authors’ writing characters with automatons. Since there were pervious works done by Dr. T.
Yu, Qun
core   +1 more source

Runtime Validation of Communication Histories: An Automata-based Approach [PDF]

open access: yes, 2006
Modern software systems have become increasingly complex and they are used to perform vital functions in todays society. It is therefore crucial that software systems are as free of errors as possible.
Torget, Øystein
core  

Mechanically supported design of self-stabilizing algorithms [PDF]

open access: yes, 1995
Het schrijven van een programma is vaak veel gemakkelijker dan te bewijzen dat een programma doet wat het moet doen. Daarbij wordt onze samenleving steeds afhankelijker van computers; men denke daarbij aan complexe programmatuur die de verkeersleiding
Prasetya, I.S.W.B.
core   +1 more source

On plausible counterexamples to Lehnert's conjecture [PDF]

open access: yes, 2018
A group whose co-word problem is a context free language is called co . Lehnert's conjecture states that a group is co if and only if embeds as a finitely generated subgroup of R. Thompson's group V .
Bennett, Daniel
core  

Home - About - Disclaimer - Privacy