اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDREAMS: Drilling and Extraction Automated System
102
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Drilling and Extraction Automated System (DREAMS) is a fully automated prototype-drilling rig that can drill, extract water and assess subsurface density profiles from simulated lunar and Martian subsurface ice. DREAMS system is developed by the Texas A&M drilling automation team and composed of four main components: 1- tensegrity rig structure, 2- drilling system, 3- water extracting and heating system, and 4- electronic hardware, controls, and machine algorithm. The vertical and rotational movements are controlled by using an Acme rod, stepper, and rotary motor. DREAMS is a unique system and different from other systems presented before in the NASA Rascal-Al competition because 1- It uses the tensegrity structure concept to decrease the system weight, improve mobility, and easier installation in space. 2- It cuts rock layers by using a short bit length connected to drill pipes. This drilling methodology is expected to drill hundreds and thousands of meters below the moon and Martian surfaces without any anticipated problems (not only 1 m.). 3- Drilling, heating, and extraction systems are integrated into one system that can work simultaneously or individually to save time and cost.
قيم البحث
اقرأ أيضاً
CHARIS is an IFS designed for imaging and spectroscopy of disks and sub-stellar companions. To improve ease of use and efficiency of science production, we present progress on a fully-automated backend for CHARIS. This Automated Data Extraction, Proc
essing, and Tracking System (ADEPTS) will log data files from CHARIS in a searchable database and perform all calibration and data extraction, yielding science-grade data cubes. The extracted data will also be run through a preset array of post-processing routines. With significant parallelization of data processing, ADEPTS will dramatically reduce the time between data acquisition and the availability of science-grade data products.
In this paper, we present an Efficient Planning System for automated vehicles In highLy interactive envirONments (EPSILON). EPSILON is an efficient interaction-aware planning system for automated driving, and is extensively validated in both simulati
on and real-world dense city traffic. It follows a hierarchical structure with an interactive behavior planning layer and an optimization-based motion planning layer. The behavior planning is formulated from a partially observable Markov decision process (POMDP), but is much more efficient than naively applying a POMDP to the decision-making problem. The key to efficiency is guided branching in both the action space and observation space, which decomposes the original problem into a limited number of closed-loop policy evaluations. Moreover, we introduce a new driver model with a safety mechanism to overcome the risk induced by the potential imperfectness of prior knowledge. For motion planning, we employ a spatio-temporal semantic corridor (SSC) to model the constraints posed by complex driving environments in a unified way. Based on the SSC, a safe and smooth trajectory is optimized, complying with the decision provided by the behavior planner. We validate our planning system in both simulations and real-world dense traffic, and the experimental results show that our EPSILON achieves human-like driving behaviors in highly interactive traffic flow smoothly and safely without being over-conservative compared to the existing planning methods.
Weighted enumeration of reduced pipe dreams (or rc-graphs) results in a combinatorial expression for Schubert polynomials. The duality between the set of reduced pipe dreams and certain antidiagonals has important geometric implications [A. Knutson a
nd E. Miller, Grobner geometry of Schubert polynomials, Ann. Math. 161, 1245-1318]. The original proof of the duality was roundabout, relying on the algebra of certain monomial ideals and a recursive characterization of reduced pipe dreams. This paper provides a direct combinatorial proof.
Security operation centers (SOCs) typically use a variety of tools to collect large volumes of host logs for detection and forensic of intrusions. Our experience, supported by recent user studies on SOC operators, indicates that operators spend ample
time (e.g., hundreds of man-hours) on investigations into logs seeking adversarial actions. Similarly, reconfiguration of tools to adapt detectors for future similar attacks is commonplace upon gaining novel insights (e.g., through internal investigation or shared indicators). This paper presents an automated malware pattern-extraction and early detection tool, testing three machine learning approaches: TF-IDF (term frequency-inverse document frequency), Fishers LDA (linear discriminant analysis) and ET (extra trees/extremely randomized trees) that can (1) analyze freshly discovered malware samples in sandboxes and generate dynamic analysis reports (host logs); (2) automatically extract the sequence of events induced by malware given a large volume of ambient (un-attacked) host logs, and the relatively few logs from hosts that are infected with potentially polymorphic malware; (3) rank the most discriminating features (unique patterns) of malware and from the learned behavior detect malicious activity; and (4) allows operators to visualize the discriminating features and their correlations to facilitate malware forensic efforts. To validate the accuracy and efficiency of our tool, we design three experiments and test seven ransomware attacks (i.e., WannaCry, DBGer, Cerber, Defray, GandCrab, Locky, and nRansom). The experimental results show that TF-IDF is the best of the three methods to identify discriminating features, and ET is the most time-efficient and robust approach.
In this paper we present an interference detection toolbox consisting of a high dynamic range Digital Fast-Fourier-Transform spectrometer (DFFT, based on FPGA-technology) and data analysis software for automated radio frequency interference (RFI) det
ection. The DFFT spectrometer allows high speed data storage of spectra on time scales of less than a second. The high dynamic range of the device assures constant calibration even during extremely powerful RFI events. The software uses an algorithm which performs a two-dimensional baseline fit in the time-frequency domain, searching automatically for RFI signals superposed on the spectral data. We demonstrate, that the software operates successfully on computer-generated RFI data as well as on real DFFT data recorded at the Effelsberg 100-m telescope. At 21-cm wavelength RFI signals can be identified down to the 4-sigma level. A statistical analysis of all RFI events detected in our observational data revealed that: (1) mean signal strength is comparable to the astronomical line emission of the Milky Way, (2) interferences are polarised, (3) electronic devices in the neighbourhood of the telescope contribute significantly to the RFI radiation. We also show that the radiometer equation is no longer fulfilled in presence of RFI signals.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
