Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Wright State University (147)
- TÜBİTAK (75)
- Embry-Riddle Aeronautical University (34)
- Washington University in St. Louis (18)
- Singapore Management University (13)
-
- University of Nebraska - Lincoln (13)
- Air Force Institute of Technology (12)
- Selected Works (11)
- University of Nevada, Las Vegas (8)
- California Polytechnic State University, San Luis Obispo (5)
- Chapman University (5)
- SelectedWorks (5)
- Old Dominion University (4)
- Western University (4)
- San Jose State University (3)
- Technological University Dublin (3)
- Wayne State University (3)
- American University in Cairo (2)
- University of New Haven (2)
- Loyola University Chicago (1)
- Pace University (1)
- University of South Florida (1)
- Keyword
-
- Department of Computer Science and Engineering (8)
- Security (5)
- HF radar (4)
- Road Network Databases (4)
- Computer forensics (3)
-
- Cryptography (3)
- HFSWR (3)
- Privacy (3)
- Adaptive control (2)
- Air indexes (2)
- Artificial neural network (2)
- Biometrics (2)
- Chaos (2)
- Checkpointing (2)
- Clustering (2)
- Computer networks--Security measures (2)
- Customer Satisfaction (2)
- Cyber crime (2)
- Data structures (2)
- Digital forensics (2)
- Disk analysis (2)
- Euclidean (2)
- Forensics (2)
- High Frequency Surface Wave Radar (2)
- Induction machine (2)
- Innovation (2)
- Location-based services (2)
- Mobile computing (2)
- Nonlinear systems (2)
- OTH radar (2)
- Publication
-
- Computer Science & Engineering Syllabi (139)
- Turkish Journal of Electrical Engineering and Computer Sciences (75)
- Journal of Digital Forensics, Security and Law (20)
- All Computer Science and Engineering Research (18)
- Annual ADFSL Conference on Digital Forensics, Security and Law (14)
-
- Research Collection School Of Computing and Information Systems (13)
- Theses and Dissertations (11)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (10)
- Browse all Theses and Dissertations (8)
- Kyriakos MOURATIDIS (7)
- Engineering Faculty Articles and Research (5)
- 2010 Annual Nevada NSF EPSCoR Climate Change Conference (4)
- Dr Deogratias Harorimana (4)
- Electrical and Computer Engineering Publications (4)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (4)
- CSE Technical Reports (3)
- Computer Engineering (3)
- Faculty Publications (3)
- Wayne State University Dissertations (3)
- Archived Theses and Dissertations (2)
- Conference papers (2)
- Electrical & Computer Engineering and Computer Science Faculty Publications (2)
- Gene D. Cooperman (2)
- Master's Theses (2)
- Computational Modeling & Simulation Engineering Faculty Publications (1)
- Computer Science Theses & Dissertations (1)
- Computer Science: Faculty Publications and Other Works (1)
- Cornerstone 3 Reports : Interdisciplinary Informatics (1)
- Dissertations (1)
- Electrical & Computer Engineering Faculty Publications (1)
- Publication Type
Articles 361 - 370 of 370
Full-Text Articles in Computer Engineering
The 2009 Analysis Of Information Remaining On Disks Offered For Sale On The Second Hand Market, Andy Jones, Craig Valli, Glenn S. Dardick, Iain Sutherland, G. Dabibi, Gareth Davies
The 2009 Analysis Of Information Remaining On Disks Offered For Sale On The Second Hand Market, Andy Jones, Craig Valli, Glenn S. Dardick, Iain Sutherland, G. Dabibi, Gareth Davies
Journal of Digital Forensics, Security and Law
The ever increasing use and reliance upon computers in both the public and private sector has led to enormous numbers of computers being disposed of at the end of their useful life within an organisation. As the cost of computers has dropped, their use in the home has also continued to increase. In most organisations, computers have a relatively short life and are replaced on a regular basis with the result that, if not properly cleansed of data, they are released into the public domain containing data that can be relatively up to date. This problem is exacerbated by the …
Avoiding Sanctions At The E-Discovery Meet-And-Confer In Common Law Countries, Milton Luoma, Vicki Luoma
Avoiding Sanctions At The E-Discovery Meet-And-Confer In Common Law Countries, Milton Luoma, Vicki Luoma
Journal of Digital Forensics, Security and Law
The rules of civil procedure in common law countries have been amended to better deal with the requirements of electronic discovery. One of the key changes in case management is the scheduling of a meet-and-confer session where the parties to litigation must meet early in the case before any discovery procedures have begun to exchange information regarding the nature, location, formats, and pertinent facts regarding custody and control of a party’s electronically stored information (ESI). Failure to abide by the rules and participate in good faith at the meet-and-confer session can have dire consequences for the parties and lawyers involved. …
Table Of Contents
Journal of Digital Forensics, Security and Law
No abstract provided.
Transmitter Optimization In Multiuser Wireless Systems With Quality Of Service Constraints, Danda B. Rawat
Transmitter Optimization In Multiuser Wireless Systems With Quality Of Service Constraints, Danda B. Rawat
Electrical & Computer Engineering Theses & Dissertations
In this dissertation, transmitter adaptation for optimal resource allocation in wireless communication systems are investigated. First, a multiple access channel model is considered where many transmitters communicate with a single receiver. This scenario is a basic component of a. wireless network in which multiple users simultaneously access the resources of a wireless service provider. Adaptive algorithms for transmitter optimization to meet Quality-of-Service (QoS) requirements in a distributed manner are studied. Second, an interference channel model is considered where multiple interfering transmitter-receiver pairs co-exist such that a given transmitter communicates with its intended receiver in the presence of interference from other …
Security In Ad Hoc Networks And Pervasive Computing, Isaac Z. Wu, X.-Y. Li, M. Song, C.-M. Liu
Security In Ad Hoc Networks And Pervasive Computing, Isaac Z. Wu, X.-Y. Li, M. Song, C.-M. Liu
Electrical & Computer Engineering Faculty Publications
Pervasive computing is an exciting and blooming research field, in which innovative techniques and applications are continuously emerging and aim to provide ambient and personalized services to users with high quality. Ad hoc networks are wireless, self-organizing systems formed by cooperating nodes within communication range of each other that form temporary networks. Their topology is dynamic, decentralized, ever changing and the nodes may move around arbitrarily. The last few years have witnessed a wealth of research ideas on ad hoc networking that are moving rapidly into implemented standards. Technology under development for ad hoc networks and pervasive computing is making …
On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz
On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz
Engineering Faculty Articles and Research
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.
Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari
Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari
Engineering Faculty Articles and Research
Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …
On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan
On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan
Engineering Faculty Articles and Research
We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.
Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Engineering Faculty Articles and Research
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.
Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz
Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz
Engineering Faculty Articles and Research
We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …