Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Computer science (75)
- Services Computing (50)
- Automated Reasoning (49)
- Bayesian Networks (42)
- Privacy (38)
-
- Answer Set Programming and Solving (32)
- LANGUAGE (31)
- Parallel and Distributed Systems (28)
- Computing in Science and Engineering (27)
- Computer Science (25)
- Security (25)
- Articles (24)
- Bayesian networks (24)
- Information security (24)
- Net-Centric Collaboration (24)
- Answer set programming (23)
- Uberveillance (23)
- Diagnosis (22)
- Location-Based Services (21)
- Social Implications of ICT (21)
- Software engineering (21)
- Ethics (19)
- Scientific computing (19)
- Computer science education (18)
- National Security (18)
- AUTISM (17)
- Computers (16)
- Emerging Technologies (16)
- Visualization (16)
- Algorithms (15)
- Publication Year
- Publication
-
- John R Rice (175)
- David LO (126)
- George K. Thiruvathukal (100)
- Jia Zhang (85)
- Yuliya Lierler (81)
-
- Professor Katina Michael (79)
- Marcel Adam Just (78)
- Ole J Mengshoel (50)
- Arcot Desai NARASIMHALU (46)
- Ronald Greenberg (46)
- Saverio Perugini (42)
- Erik G Learned-Miller (41)
- Konstantin Läufer (40)
- Kyriakos MOURATIDIS (40)
- R. Manmatha (39)
- Oleg Sokolsky (33)
- Amy W. Apon (30)
- Gabriel A. Moreno (30)
- Amber Settle (28)
- C. Jason Woodard (25)
- Shih-Fen CHENG (24)
- Davide Andrea Mauro (21)
- Jan Kallberg (20)
- Zhi-Hong Chen (20)
- Arun Kulkarni (19)
- Luiz Fernando Capretz (18)
- Robert H Yacobellis (18)
- David J Brooks Dr. (17)
- Gang-Ryung Uh (17)
- Leisa Armstrong (17)
Articles 1 - 30 of 2683
Full-Text Articles in Physical Sciences and Mathematics
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Zhi-Hong Chen
No abstract provided.
On The Edge Arboricity Of A Random Graph, P. A. Catlin, Zhi-Hong Chen, E. M. Palmer
On The Edge Arboricity Of A Random Graph, P. A. Catlin, Zhi-Hong Chen, E. M. Palmer
Zhi-Hong Chen
No abstract provided.
On Hamiltonian Line Graphs, Zhi-Hong Chen
Supereuleriaun Graphs And The Petersen Graph, Zhi-Hong Chen
Supereuleriaun Graphs And The Petersen Graph, Zhi-Hong Chen
Zhi-Hong Chen
Using a contraction method, we find some best-possible sufficient conditions for 3-edge-connected simple graphs such that either the graphs have spanning eulerian subgraphs or the graphs are contractible to the Petersen graph.
Supereulerian Graphs And The Petersen Graph, Ii, Zhi-Hong Chen, Hong-Jian Lai
Supereulerian Graphs And The Petersen Graph, Ii, Zhi-Hong Chen, Hong-Jian Lai
Zhi-Hong Chen
In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graphs with at most 11 vertices. These are used to prove the following theorem which improves prior results in [10] and [13]:
Let G be a 3-edge-connected simple graph with order n. If n is large and if for every edge 11.v E E(G), d(u) + d(v) 2 % - 2, then either G has a spanning eulerian subgraph or G can be contracted to the Petersen graph.
Fan-Type Conditions For Collapsible Graphs, Zhi-Hong Chen
Fan-Type Conditions For Collapsible Graphs, Zhi-Hong Chen
Zhi-Hong Chen
No abstract provided.
Connectivity Of Cycle Matroids And Bicircular Matroids, Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai
Connectivity Of Cycle Matroids And Bicircular Matroids, Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai
Zhi-Hong Chen
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, Oxley and Wagner.
Finding Needles In A Haystack: A Case Study Of Text Mining The Corpus Of 15 Academic Journals, Eric A. Kowalik, Tara Baillargeon, Jennifer M. Cook
Finding Needles In A Haystack: A Case Study Of Text Mining The Corpus Of 15 Academic Journals, Eric A. Kowalik, Tara Baillargeon, Jennifer M. Cook
Eric A. Kowalik
Reinforcing The Number Of Disjoint Spanning Trees, Damin Liu, Hong-Jian Lai, Zhi-Hong Chen
Reinforcing The Number Of Disjoint Spanning Trees, Damin Liu, Hong-Jian Lai, Zhi-Hong Chen
Zhi-Hong Chen
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Zhi-Hong Chen
No abstract provided.
A University-Based Forensics Training Center As A Regional Outreach, Education, And Research Activity, Rayford B. Vaughn, David A. Dampier
A University-Based Forensics Training Center As A Regional Outreach, Education, And Research Activity, Rayford B. Vaughn, David A. Dampier
David Dampier
This paper describes a university-based Forensics Training Center (FTC) established by a Department of Justice grant for the purpose of improving the ability of state and local law enforcement in the Southeastern part of the United States to address the rising incidence of computer based crime. The FTC effort is described along with supporting evidence of its need. The program is not only a service activity, but also contributes to the Mississippi State University (MSU) security program pedagogy, and research effort.
Design Of Personnel Big Data Management System Based On Blockchain, Houbing Song, Jian Chen, Zhihan Lv
Design Of Personnel Big Data Management System Based On Blockchain, Houbing Song, Jian Chen, Zhihan Lv
Houbing Song
With the continuous development of information technology, enterprises, universities and governments are constantly stepping up the construction of electronic personnel information management system. The information of hundreds of thousands or even millions of people’s information are collected and stored into the system. So much information provides the cornerstone for the development of big data, if such data is tampered with or leaked, it will cause irreparable serious damage. However, in recent years, electronic archives have exposed a series of problems such as information leakage, information tampering, and information loss, which has made the reform of personnel information management more and …
Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen
Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen
Houbing Song
With the rapid development of Internet of Things, massive mobile intelligent terminals are ready to access edge servers for real-time data calculation and interaction. However, the risk of private data leakage follows simultaneously. As the administrator of all intelligent terminals in a region, the edge server needs to clarify the ability of the managed intelligent terminals to defend against malicious attacks. Therefore, the security level classification for mobile intelligent terminals before accessing the network is indispensable. In this paper, we firstly propose a safety assessment method to detect the weakness of mobile intelligent terminals. Secondly, we match the evaluation results …
Spanning Eulerian Subgraphs And Catlin’S Reduced Graphs, Wei-Guo Chen, Zhi-Hong Chen
Spanning Eulerian Subgraphs And Catlin’S Reduced Graphs, Wei-Guo Chen, Zhi-Hong Chen
Zhi-Hong Chen
A graph G is collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph HR of G whose set of odd degree vertices is R. A graph is reduced if it has no nontrivial collapsible subgraphs. Catlin [4] showed that the existence of spanning Eulerian subgraphs in a graph G can be determined by the reduced graph obtained from G by contracting all the collapsible subgraphs of G. In this paper, we present a result on 3-edge-connected reduced graphs of small orders. Then, we prove that a 3-edge-connected graph G of order n …
Properties Of Catlin’S Reduced Graphs And Supereulerian Graphs, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu
Properties Of Catlin’S Reduced Graphs And Supereulerian Graphs, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu
Zhi-Hong Chen
A graph G is called collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph H of G such that R is the set of vertices of odd degree in H. A graph is the reduction of G if it is obtained from G by contracting all the nontrivial collapsible subgraphs. A graph is reduced if it has no nontrivial collapsible subgraphs. In this paper, we first prove a few results on the properties of reduced graphs. As an application, for 3-edge-connected graphs G of order n with d(u) + d(v) ≥ 2(n/p − …
Lai’S Conditions For Spanning And Dominating Closed Trails, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu
Lai’S Conditions For Spanning And Dominating Closed Trails, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu
Zhi-Hong Chen
No abstract provided.
Analysis Of Flickr, Snapchat, And Twitter Use For The Modeling Of Visitor Activity In Florida State Parks, Hartwig H. Hochmair, Levente Juhasz
Analysis Of Flickr, Snapchat, And Twitter Use For The Modeling Of Visitor Activity In Florida State Parks, Hartwig H. Hochmair, Levente Juhasz
Levente Juhasz
Spatio-temporal information attached to social media posts allows analysts to study human activity and travel behavior. This study analyzes contribution patterns to the Flickr, Snapchat, and Twitter platforms in over 100 state parks in Central and Northern Florida. The first part of the study correlates monthly visitor count data with the number of Flickr images, snaps, or tweets, contributed within the park areas. It provides insight into the suitability of these different social media platforms to be used as a proxy for the prediction of visitor numbers in state parks. The second part of the study analyzes the spatial distribution …
Integrating Multiple Modalities Into Deep Learning Network, Patrick Mcneil
Integrating Multiple Modalities Into Deep Learning Network, Patrick Mcneil
Patrick McNeil
Deep learning networks in the literature traditionally only used a single input modality (or data stream). Integrating multiple modalities into deep learning networks with the goal of correlating extracted features was a major issue. Traditional methods involved treating each modality separately and then writing custom code to combine the extracted features. Current solutions for small numbers of modalities (three or less) showed there are multiple architectures for modality integration. With an increase in the number of modalities, the “curse of dimensionality” affects the performance of the system. The research showed current methods for larger scale integrations required separate, custom created …
System Projector: An Automatic Program Rewriting Tool For Non-Ground Answer Set Programs, Yuliya Lierler
System Projector: An Automatic Program Rewriting Tool For Non-Ground Answer Set Programs, Yuliya Lierler
Yuliya Lierler
Information Extraction Tool Text2alm: From Narratives To Action Language System Descriptions, Craig Olson, Yuliya Lierler
Information Extraction Tool Text2alm: From Narratives To Action Language System Descriptions, Craig Olson, Yuliya Lierler
Yuliya Lierler
Degree And Neighborhood Conditions For Hamiltonicity Of Claw-Free Graphs, Zhi-Hong Chen
Degree And Neighborhood Conditions For Hamiltonicity Of Claw-Free Graphs, Zhi-Hong Chen
Zhi-Hong Chen
For a graph H , let σ t ( H ) = min { Σ i = 1 t d H ( v i ) | { v 1 , v 2 , … , v t } is an independent set in H } and let U t ( H ) = min { | ⋃ i = 1 t N H ( v i ) | | { v 1 , v 2 , ⋯ , v t } is an independent set in H } . We show that for a given number ϵ and given integers …
Circumferences Of 3-Connected Claw-Free Graphs, Ii, Zhi-Hong Chen
Circumferences Of 3-Connected Claw-Free Graphs, Ii, Zhi-Hong Chen
Zhi-Hong Chen
For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle in H . It is proved in Chen (2016) that if H is a 3-connected claw-free graph of order n with δ ≥ 8 , then c ( H ) ≥ min { 9 δ − 3 , n } . In Li (2006), Li conjectured that every 3-connected k -regular claw-free graph H of order n has c ( H ) ≥ min { 10 k − 4 , n } . Later, Li posed …
The Design Of An Emerging/Multi-Paradigm Programming Languages Course, Saverio Perugini
The Design Of An Emerging/Multi-Paradigm Programming Languages Course, Saverio Perugini
Saverio Perugini
We present the design of a new special topics course, Emerging/Multi-paradigm Languages, on the recent trend toward more dynamic, multi-paradigm languages. To foster course adoption, we discuss the design of the course, which includes language presentations/papers and culminating, inal projects/papers. The goal of this article is to inspire and facilitate course adoption.
Developing A Contemporary And Innovative Operating Systems Course, Saverio Perugini, David J. Wright
Developing A Contemporary And Innovative Operating Systems Course, Saverio Perugini, David J. Wright
Saverio Perugini
This birds-of-a-feather provides a discussion forum to foster innovation in teaching operating systems (os) at the undergraduate level. This birds-of-a-feather seeks to generate discussion and ideas around pedagogy for os and, in particular, how we might develop a contemporary and innovative model, in both content and delivery, for an os course—that plays a central role in a cs curriculum—and addresses significant issues of misalignment between existing os courses and employee professional skills and knowledge requirements. We would like to exchange ideas regarding a re-conceptualized course model of os curriculum and related pedagogy, especially in the areas of mobile OSs and …
An Interactive, Graphical Simulator For Teaching Operating Systems, Joshua W. Buck, Saverio Perugini
An Interactive, Graphical Simulator For Teaching Operating Systems, Joshua W. Buck, Saverio Perugini
Saverio Perugini
We demonstrate a graphical simulation tool for visually and interactively exploring the processing of a variety of events handled by an operating system when running a program. Our graphical simulator is available for use on the web by both instructors and students for purposes of pedagogy. Instructors can use it for live demonstrations of course concepts in class, while students can use it outside of class to explore the concepts. The graphical simulation tool is implemented using the React library for the fancy ui elements of the Node.js framework and is available as a web application at https://cpudemo.azurewebsites.net. The goals …
An Introduction To Declarative Programming In Clips And Prolog, Jack L. Watkin, Adam C. Volk, Saverio Perugini
An Introduction To Declarative Programming In Clips And Prolog, Jack L. Watkin, Adam C. Volk, Saverio Perugini
Saverio Perugini
We provide a brief introduction to CLIPS—a declarative/logic programming language for implementing expert systems—and PROLOG—a declarative/logic programming language based on first-order, predicate calculus. Unlike imperative languages in which the programmer specifies how to compute a solution to a problem, in a declarative language, the programmer specifies what they what to find, and the system uses a search strategy built into the language. We also briefly discuss applications of CLIPS and PROLOG.
Statistical And Machine Learning Methods Evaluated For Incorporating Soil And Weather Into Corn Nitrogen Recommendations, Curtis J. Ransom, Newell R. Kitchen, James J. Camberato, Paul R. Carter, Richard B. Ferguson, Fabián G. Fernández, David W. Franzen, Carrie A. M. Laboski, D. Brenton Myers, Emerson D. Nafziger, John E. Sawyer, John F. Shanahan
Statistical And Machine Learning Methods Evaluated For Incorporating Soil And Weather Into Corn Nitrogen Recommendations, Curtis J. Ransom, Newell R. Kitchen, James J. Camberato, Paul R. Carter, Richard B. Ferguson, Fabián G. Fernández, David W. Franzen, Carrie A. M. Laboski, D. Brenton Myers, Emerson D. Nafziger, John E. Sawyer, John F. Shanahan
John E. Sawyer
Nitrogen (N) fertilizer recommendation tools could be improved for estimating corn (Zea mays L.) N needs by incorporating site-specific soil and weather information. However, an evaluation of analytical methods is needed to determine the success of incorporating this information. The objectives of this research were to evaluate statistical and machine learning (ML) algorithms for utilizing soil and weather information for improving corn N recommendation tools. Eight algorithms [stepwise, ridge regression, least absolute shrinkage and selection operator (Lasso), elastic net regression, principal component regression (PCR), partial least squares regression (PLSR), decision tree, and random forest] were evaluated using a dataset …
The Effect Of Conversational Agent Skill On User Behavior During Deception, Ryan M. Schuetzler, G Mark Grimes, Justin Scott Giboney
The Effect Of Conversational Agent Skill On User Behavior During Deception, Ryan M. Schuetzler, G Mark Grimes, Justin Scott Giboney
Ryan Schuetzler
No abstract provided.
The Usability Factors Of Lost Digital Legacy Icoict.Pdf, David M. Cook, Derani Nathasha Dissanayake, Kulwinder Kaur
The Usability Factors Of Lost Digital Legacy Icoict.Pdf, David M. Cook, Derani Nathasha Dissanayake, Kulwinder Kaur
Dr. David M Cook
Could A Robot Be District Attorney?, Stephen E. Henderson
Could A Robot Be District Attorney?, Stephen E. Henderson
Stephen E Henderson
No abstract provided.