Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Bayesian Networks (40)
- Bayesian networks (23)
- Diagnosis (22)
- Electrical Power Systems (15)
- Arithmetic Circuits (14)
-
- Aerospace (11)
- Emerging Technologies (11)
- Software Engineering (10)
- Ubiquitous Computing (10)
- Junction Trees (9)
- Social Implications of ICT (9)
- Arithmetic circuits (8)
- Articles (8)
- Computer science (8)
- Parallel Computing (8)
- Technology (8)
- Location-Based Services (7)
- National Security (7)
- Patents (7)
- Privacy (7)
- Robotics (7)
- Surveillance (7)
- Austerity (6)
- Cyber (6)
- Cyber Operations (6)
- Evolutionary Computation (6)
- Global Positioning Systems (6)
- Security (6)
- System health management (6)
- Uncertainty (6)
- Publication Year
- Publication
-
- Ole J Mengshoel (45)
- Professor Katina Michael (27)
- Ronald Greenberg (27)
- Oleg Sokolsky (22)
- Shih-Fen CHENG (17)
-
- Jan Kallberg (14)
- Robert A Iannucci (13)
- Professor Aditya K. Ghose (12)
- John Hooker (10)
- Kyriakos MOURATIDIS (10)
- Vijayan K. Asari (10)
- Zheng Sun (9)
- William L Honig (6)
- Amber Settle (5)
- David G. Novick (5)
- George H Baker (5)
- George J. Pappas (5)
- George K. Thiruvathukal (5)
- Jeremy Straub (5)
- Mark L. Chang (5)
- Shih-Fen Cheng (5)
- Stephanie Weirich (5)
- Barry G Silverman (4)
- Buenaventura "Ven" Basco (4)
- Gene D. Cooperman (4)
- Johnny Wong (4)
- Rahul Mangharam (4)
- Wojciech Budzianowski (4)
- Allen B. Downey (3)
- Arcot Desai NARASIMHALU (3)
Articles 1 - 30 of 376
Full-Text Articles in Engineering
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 …
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
George K. Thiruvathukal
This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.
Suas: Cybersecurity Threats, Vulnerabilities, And Exploits, Philip Craiger, Gary Kessler, William Rose
Suas: Cybersecurity Threats, Vulnerabilities, And Exploits, Philip Craiger, Gary Kessler, William Rose
J. Philip Craiger, Ph.D.
The FAA predicts that purchases of hobbyist small unmanned aerial systems (sUAS) will grow from 1.9 million in 2016 to 4.3 million by 2020, and commercial sUAS to increase from 600,000 in 2016 to 2.7 million by 2020. sUAS, often referred to as 'drones,' are comprised of aeronautical hardware, a CPU, RAM, onboard storage, radio frequency communications, sensors, a camera, and a controller used by the pilot-in-command (PIC). Some have argued that a sUAS is essentially a flying computer. As such, sUAS are sometimes susceptible to many of the types of attacks that are often used on PC-based computers attached …
Call For Abstracts - Resrb 2019, July 8-9, Wrocław, Poland, Wojciech M. Budzianowski
Call For Abstracts - Resrb 2019, July 8-9, Wrocław, Poland, Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Sirani Mututhanthrige Perera
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.
The Subject Librarian Newsletter, Engineering And Computer Science, Spring 2017, Buenaventura "Ven" Basco
The Subject Librarian Newsletter, Engineering And Computer Science, Spring 2017, Buenaventura "Ven" Basco
Buenaventura "Ven" Basco
No abstract provided.
The Subject Librarian Newsletter, Engineering And Computer Science, Spring 2016, Ven Basco
The Subject Librarian Newsletter, Engineering And Computer Science, Spring 2016, Ven Basco
Buenaventura "Ven" Basco
No abstract provided.
The Subject Librarian Newsletter, Engineering And Computer Science, Fall 2016, Buenaventura "Ven" Basco
The Subject Librarian Newsletter, Engineering And Computer Science, Fall 2016, Buenaventura "Ven" Basco
Buenaventura "Ven" Basco
No abstract provided.
The Subject Librarian Newsletter, Engineering And Computer Science, Fall 2015, Ven Basco
The Subject Librarian Newsletter, Engineering And Computer Science, Fall 2015, Ven Basco
Buenaventura "Ven" Basco
No abstract provided.
Space Operations In The Suborbital Space Flight Simulator And Mission Control Center: Lessons Learned With Xcor Lynx, Pedro Llanos, Christopher Nguyen, David Williams, Kim O. Chambers Ph.D., Erik Seedhouse, Robert Davidson
Space Operations In The Suborbital Space Flight Simulator And Mission Control Center: Lessons Learned With Xcor Lynx, Pedro Llanos, Christopher Nguyen, David Williams, Kim O. Chambers Ph.D., Erik Seedhouse, Robert Davidson
Pedro J. Llanos (www.AstronauticsLlanos.com)
This study was conducted to better understand the performance of the XCOR Lynx vehicle. Because the Lynx development was halted, the best knowledge of vehicle dynamics can only be found through simulator flights. X-Plane 10 was chosen for its robust applications and accurate portrayal of dynamics on a vehicle in flight. The Suborbital Space Flight Simulator (SSFS) and Mission Control Center (MCC) were brought to the Applied Aviation Sciences department in fall 2015 at Embry-Riddle Aeronautical University, Daytona Beach campus. This academic and research tool is a department asset capable of providing multiple fields of data about suborbital simulated flights. …
Scrumtutor: A Web-Based Interactive Tutorial For Scrum Software Development, Sindhura Potineni, Srividya K. Bansal, Ashish Amresh
Scrumtutor: A Web-Based Interactive Tutorial For Scrum Software Development, Sindhura Potineni, Srividya K. Bansal, Ashish Amresh
Ashish Amresh
In a traditional software engineering class, students are typically engaged in theoretical lectures followed by homework assignments or a project. Use of hands-on training and laboratory activities using realworld projects is more likely to produce students with a higher level of achievement and more confidence in the course material. If every topic or technique introduced in the course has a corresponding hands-on activity that demonstrates an application or use of the concept in the industry, students better understand the need for the technique and the learning environment is more interactive, engaging, and interesting to students. This paper presents a project …
Evaluating The Effectiveness Of Flipped Classrooms For Teaching Cs1, Ashish Amresh, Adam R. Carberry, John Femiani
Evaluating The Effectiveness Of Flipped Classrooms For Teaching Cs1, Ashish Amresh, Adam R. Carberry, John Femiani
Ashish Amresh
An alternative to the traditional classroom structure that has seen increased use in higher education is the flipped classroom. Flipping the classroom switches when assignments (e.g. homework) and knowledge transfer (e.g. lecture) occur. Flipped classrooms are getting popular in secondary and postsecondary teaching institutions as evidenced by the marked increase in the study, use, and application of the flipped pedagogy as it applies to learning and retention. The majority of the courses that have undergone this change use applied learning strategies and include a significant “learning-by-doing” component. The research in this area is skewed towards such courses and in general …
Word Towers: Assessing Domain Knowledge With Non-Traditional Genres, Tyler Baron, Ashish Amresh
Word Towers: Assessing Domain Knowledge With Non-Traditional Genres, Tyler Baron, Ashish Amresh
Ashish Amresh
This paper presents the design, development and the results of a pilot study for Word Towers (WT), an educational game that combines gameplay mechanics from board-style word building and arcade style tower defense games. To our knowledge, this is the first ever attempt to merge these game genres into a functional educational game. Our efforts open the possibility for other learning games to be reworked into new genres, increasing novelty and player engagement. Expanding the range of genres also allows for learning games to reach a wider audience. The goal of the WT is to provide a natural method for …
Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al.
Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al.
Marc Compere
This paper describes a human-in-the-loop motion-based simulator interfaced to hybrid-electric power system hardware, both of which were used to measure the duty cycle of a combat vehicle in a virtual simulation environment. The project discussed is a greatly expanded follow-on to the experiment published in [1,7]. This paper is written in the context of [1,7] and therefore highlights the enhancements. The most prominent of these enhancements is the integration (in real-time) of the Power & Energy System Integration Lab (P&E SIL) with a motion base simulator by means of a “long haul” connection over the Internet (a geographical distance of …
Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson
Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson
Ronald Greenberg
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda + lg n lg lg n) with probability 1-O(1/n). The best previous …
The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg
The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg
Ronald Greenberg
This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg
Ronald Greenberg
This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …
Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg
Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg
Ronald Greenberg
This paper provides tips for LEGO robot construction involving bracing or gear meshing along a diagonal using standard Botball kits.
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Ronald Greenberg
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …
Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh
Universal Wormhole Routing, Ronald I. Greenberg, Hyeong-Cheol Oh
Ronald Greenberg
In this paper, we examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη+cLηlogP) time with high probability, where L is the number of flits in a packet, and η=min{d,L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat-tree network of area Θ(A) can simulate wormhole routing on any network of comparable area with O(log^3 A) …
Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih
Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih
Ronald Greenberg
This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time solutions to all three problems. Such results are implausible if the placement of terminals is entirely unrestricted; in fact, the size of the output for the feasible offset problem may be Ω(n^2). The linear-time …
Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle
Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle
Ronald Greenberg
In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …
On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy
On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy
Ronald Greenberg
We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Omega(sqrt(n)) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.
On The Area Of Hypercube Layouts, Ronald I. Greenberg, Lee Guan
On The Area Of Hypercube Layouts, Ronald I. Greenberg, Lee Guan
Ronald Greenberg
This paper precisely analyzes the wire density and required area in standard styles for the hypercube. It shows that the most natural, regular layout of a hypercube of N^2 nodes in the plane, in a NxN grid arrangement, uses floor(2N/3)+1 horizontal wiring tracks for each row of nodes. (In the process, we see that the number of tracks per row can be reduced by 1 with a less regular design, as can also be seen from an independent argument of Bezrukov et al.) This paper also gives a simple formula for the wire density at any cut position and a …
Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley
Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley
Ronald Greenberg
We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.
Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg
Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg
Ronald Greenberg
Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …
Mulch: A Multi-Layer Channel Router Using One, Two, And Three Layer Partitions, Ronald I. Greenberg, Alex T. Ishii, Alberto L. Sangiovanni-Vincentelli
Mulch: A Multi-Layer Channel Router Using One, Two, And Three Layer Partitions, Ronald I. Greenberg, Alex T. Ishii, Alberto L. Sangiovanni-Vincentelli
Ronald Greenberg
Chameleon, a channel router for three layers of interconnect, has been implemented to accept specification of an arbitrary number of layers. Chameleon is based on a strategy of decomposing the multilayer problem into two- and three-layer problems in which one of the layers is reserved primarily for vertical wire runs and the other layer(s) for horizontal runs. In some situations, however, it is advantageous to consider also layers that allow the routing of entire nets, using both horizontal and vertical wires. MulCh is a multilayer channel router that extends the algorithms of Chameleon in this direction. MulCh can route channels …
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Ronald Greenberg
We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Ronald Greenberg
We give algorithms to minimize density for VLSI channel routing problems with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, we improve previous results for running time and space by a factor of L/\lgn and L, respectively, where L is the channel length, and n is the number of terminals.