Results 101 to 110 of about 94,123 (313)

Penerapan Algoritma Optimasi Chaos pada Jaringan Ridge Polynomial untuk Prediksi Jumlah Pengangguran

open access: yesIJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2013
Abstrak Ridge polynomial neural network (RPNN) awalnya diusulkan oleh Shin dan Ghosh, dibangun dari jumlah peningkatan order pi-sigma neuron (PSN). RPNN mempertahankan pembelajaran cepat, pemetaan yang kuat dari layer tunggal higher order neural network
Rina Pramitasari, Retantyo Wardoyo
doaj   +1 more source

Inversion of Parahermitian matrices [PDF]

open access: yes, 2010
Parahermitian matrices arise in broadband multiple-input multiple-output (MIMO) systems or array processing, and require inversion in some instances. In this paper, we apply a polynomial eigenvalue decomposition obtained by the sequential best rotation ...
Weiss, Stephan   +2 more
core  

Physical Origin of Temperature Induced Activation Energy Switching in Electrically Conductive Cement

open access: yesAdvanced Science, EarlyView.
The temperature‐induced Arrhenius activation energy switching phenomenon of electrical conduction in electrically conductive cement originates from structural degradation within the biphasic ionic‐electronic conduction architecture and shows percolation‐governed characteristics: pore network opening dominates the low‐percolation regime with downward ...
Jiacheng Zhang   +7 more
wiley   +1 more source

An Algorithm for Distributing Coalitional Value Calculations among Cooperating Agents [PDF]

open access: yes, 2007
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if it was formed.
Jennings, N. R.   +5 more
core   +1 more source

Phase Diagrams and Piezoelectric Properties of Wurtzite Al1−x−yScxGdyN Heterostructural Alloys

open access: yesAdvanced Science, EarlyView.
This study demonstrates ferroelectricity and piezoelectric properties improvement of quaternary wurtzite Al1−x−yScxGdyN${\rm Al}_{1-x-y}{\rm Sc}_x{\rm Gd}_y{\rm N}$ films, guided by density functional theory calculations. Wurtzite Al1−x−yScxGdyN${\rm Al}_{1-x-y}{\rm Sc}_x{\rm Gd}_y{\rm N}$ films have a high optical bandgap, enhanced piezoelectric ...
Julia L. Martin   +11 more
wiley   +1 more source

Even-hole-free graphs [PDF]

open access: yes, 2008
In this thesis we consider the class of simple graphs defined by excluding even holes (i.e. chordless cycles of even length). These graphs are known as even-hole-free graphs. We first prove that every even-hole-free graph has a node whose neighborhood is
Da Silva, Murilo Vicente Gonçalves
core  

Clustering Affine Subspaces: Algorithms and Hardness [PDF]

open access: yes, 2012
We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core   +1 more source

Atomic Defects in Layered Transition Metal Dichalcogenides for Sustainable Energy Storage and the Intelligent Trends in Data Analytics

open access: yesAdvanced Science, EarlyView.
This review comprehensively summarizes the atomic defects in TMDs for their applications in sustainable energy storage devices, along with the latest progress in ML methodologies for high‐throughput TEM data analysis, offering insights on how ML‐empowered microscopy facilitates bridging structure–property correlation and inspires knowledge for precise ...
Zheng Luo   +6 more
wiley   +1 more source

An Improved Coppersmith Algorithm Based on Block Preprocessing

open access: yesMathematics
Since Coppersmith proposed the use of the LLL algorithm to solve univariate modular polynomial equations at EUROCRYPT’96, it has sparked a fervent research interest in lattice analysis among cryptographers.
Lu Zhang   +3 more
doaj   +1 more source

Evaluating a weighted graph polynomial for graphs of bounded tree-width [PDF]

open access: yes, 2009
We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point.
Noble, Steven, Noble, S D
core  

Home - About - Disclaimer - Privacy