Results 101 to 110 of about 980,436 (340)

Safe Grid Search with Optimal Complexity

open access: yes, 2018
Popular machine learning estimators involve regularization parameters that can be challenging to tune, and standard strategies rely on grid search for this task. In this paper, we revisit the techniques of approximating the regularization path up to predefined tolerance $ $ in a unified framework and show that its complexity is $O(1/\sqrt[d] )$ for ...
Ndiaye, Eugene   +4 more
openaire   +2 more sources

Intrinsic Nanopore‐Assisted SnP2S6 Memristors With Ti Ion Dynamics for Compact Logic‐In‐Memory Hardware

open access: yesAdvanced Functional Materials, EarlyView.
Tin hexathiophosphate memristors leverage intrinsic nanopores together with a guided filament formation strategy to regulate titanium ion motion and switching behavior. The devices support reliable nonvolatile memory and reconfigurable logic‐in‐memory, demonstrating 14 Boolean logic functions in a single cell.
Thaw Tint Te Tun   +7 more
wiley   +1 more source

Comparative Analysis of ARIMA and LSTM for Forecasting Maximum Wind Speed in Kupang City, East Nusa Tenggara

open access: yesJambura Journal of Mathematics
This study compares the Autoregressive Integrated Moving Average (ARIMA) and Long Short-Term Memory (LSTM) models for predicting maximum wind speed based on accuracy measured by Root Mean Square Error (RMSE) and Mean Absolute Percentage Error (MAPE ...
Indah Magfirrah   +4 more
doaj   +1 more source

An Evolutionary Algorithm for the Estimation of Threshold Vector Error Correction Models [PDF]

open access: yes
We develop an evolutionary algorithm to estimate Threshold Vector Error Correction models (TVECM) with more than two cointegrated variables. Since disregarding a threshold in cointegration models renders standard approaches to the estimation of the ...
Makram El-Shagi
core  

Encryption Key Search using Java-based ALiCE Grid [PDF]

open access: yes, 2003
Encryption Key Search is a compute-intensive operation that consists of a brute-force search of a particular key in a given key space. Sequential execution time for a 56-bit encryption key search is approximately 200,000 years and therefore it is ideal ...
Virkar, Ameya
core  

Data Access for LIGO on the OSG

open access: yes, 2017
During 2015 and 2016, the Laser Interferometer Gravitational-Wave Observatory (LIGO) conducted a three-month observing campaign. These observations delivered the first direct detection of gravitational waves from binary black hole mergers.
Bockelman, Brian   +5 more
core   +1 more source

Shaping of Biohybrid Functional Living Materials

open access: yesAdvanced Functional Materials, EarlyView.
This work demonstrates a strategy for shaping living mycelium into functional materials by directing its natural growth. Nanoparticles armor hyphae, micron‐scale particles entangle within the network, and printed hydrogel architectures steer expansion, creating defined geometries.
Sarah Schyck   +3 more
wiley   +1 more source

Accurate Grid-based Clustering Algorithm with Diagonal Grid Searching and Merging

open access: yesIOP Conference Series: Materials Science and Engineering, 2017
Due to the advent of big data, data mining technology has attracted more and more attentions. As an important data analysis method, grid clustering algorithm is fast but with relatively lower accuracy. This paper presents an improved clustering algorithm combined with grid and density parameters.
Feng Liu, Chengcheng Ye, Erzhou Zhu
openaire   +1 more source

BACH, a Bayesian Optimization Protocol for Accurate Coarse‐Grained Parameterization of Organic Liquids

open access: yesAdvanced Functional Materials, EarlyView.
We present a fully automated Bayesian optimization (BO) protocol for the parameterization of nonbonded interactions in coarse‐grain CG force fields (BACH). Using experimental thermophysical data, we apply the protocol to a broad range of liquids, spanning linear, branched, and unsaturated hydrocarbons, esters, triglycerides, and water.
Janak Prabhu   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy