A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Onp-closed spaces
2000
International Journal of Mathematics and Mathematical Sciences
Preserved Fulltext
We will provide new characterizations ofp-closed spaces and investigate their relationships with some other classes of topological spaces. ...
A topological space (X, τ) is said to be strongly p-regular (respectively, p-regular [8] , almost p-regular [14] ) if for each point x ∈ X and each preclosed set (respectively, closed set, regular closed ...
Several topological spaces share this property for κ = ℵ 0 . ...
doi:10.1155/s016117120000226x
fatcat:3rt5qcwfnvfbtmucuaozjxpnjq
Topology-Aware Single-Image 3D Shape Reconstruction
2020
2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We make an attempt to address topology-awareness for 3D shape reconstruction. ...
TPWCoder can be directly combined with the existing 3D shape reconstruction pipelines for endto-end training and prediction. ...
We thank Jiajun Wu, Kwonjoon Lee, Weijian Xu, Justin Lazarow, Sainan Liu, and Hao Su for valuable discussions. ...
doi:10.1109/cvprw50498.2020.00143
dblp:conf/cvpr/ChenNHKT20
fatcat:m6f7n7qgknfolpwtkk6czz4n4a
Order isomorphisms between bases of topologies
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
about regular open subsets of Hausdorff regular topological spaces. ...
It turns out that the perfect setting for this study is that of regular open subsets of complete metric spaces, but we have achieved some results about arbitrary bases in complete metric spaces and also ...
Leung for his interest in the present paper and for pointing out a mistake. ...
arXiv:2007.04384v3
fatcat:ikk2usa4t5cnra44i6jgdc34mm
Unsupervised Depth Completion with Calibrated Backprojection Layers
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
KBNet imputes missing depth value based on the training set, rather than on generic regularization. ...
A decoder, exploiting skip-connections, produces a dense depth map. ...
Bilateral cyclic con-
straint and adaptive regularization for unsupervised monoc-
ular depth prediction. ...
arXiv:2108.10531v2
fatcat:oksdumjhwnfsbb2gvamh3oz4cq
Order isomorphisms between bases of topologies
2022
Extracta Mathematicae
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
and also about regular open subsets in Hausdorff regular topological spaces. ...
It turns out that the perfect setting for this study is that of regular open subsets of complete metric spaces, but we have been able to show some results about arbitrary bases in complete metric spaces ...
Leung for his interest in the present paper and for pointing out a relevant mistake. I also need to thank the anonymous referee for their careful reading and for some specially accurate comments. ...
doi:10.17398/2605-5686.37.1.139
fatcat:nzbkyb42ybg77dtwtcrgveup5i
Collision Detection Optimization in a Multi-particle System
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The data structures under consideration are the dynamic generalized Voronoi diagram, the regular spatial subdivision, the regular spatial tree and the set of segment trees. ...
We employ dynamic computational geometry data structures as a tool for collision detection optimization. ...
The regular spatial subdivision and the regular spatial tree methods perform worst for densely packed granular systems. 4. ...
doi:10.1007/3-540-47789-6_11
fatcat:kmx5qtj7m5arvmfy4kqrxut6vm
COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM
2003
International journal of computational geometry and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The data structures under consideration are the dynamic generalized Voronoi diagram, the regular spatial subdivision, the regular spatial tree and the set of segment trees. ...
We employ dynamic computational geometry data structures as a tool for collision detection optimization. ...
The regular spatial subdivision and the regular spatial tree methods perform worst for densely packed granular systems. 4. ...
doi:10.1142/s0218195903001189
fatcat:k5jrq5h2bffs7ksi3zcy7bezua
ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
(ii) Self-Attention Regularization (SAR) method, a novel regularization designed to minimize the distance for transformers with different attention topologies. ...
Sparse Transformer has recently attracted a lot of attention since the ability for reducing the quadratic dependency on the sequence length. ...
However, current regularization methods are mostly designed for dense models and don't take into account the characteristic of sparse model. ...
arXiv:2203.12276v1
fatcat:ogiht7r52zhjffzc6j6g5ogy74
SMILES Enumeration as Data Augmentation for Neural Network Modeling of Molecules
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
By taking the average per molecule of the predictions for the enumerated SMILES a further improvement to a correlation coefficient of 0.68 and a RMS of 0.52 was found. ...
The technique also works in the prediction phase. ...
(dropout_U)
0.0
0.0
Number of dense hidden layers
0
0
Hidden layer size
N/A
N/A
Weight regularization on dense layer, L1
0.2
0.005
Weight regularization on dense layer, L2
0.2
0.01
Learning ...
arXiv:1703.07076v2
fatcat:47zx5ghpzzcznm3xudrynd4fcm
Hierarchical self-assembly of a striped gyroid formed by threaded chiral mesoscale networks
2014
Proceedings of the National Academy of Sciences of the United States of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
for 3D nets (2) ]. ...
and topological aspects. ...
For x < 1:75, four-colored columnar phases appear, and for x > 7, a hierarchical lamellar pattern is predicted (4) . ...
doi:10.1073/pnas.1316348111
pmid:24474747
pmcid:PMC3910609
fatcat:ylxcpjv7lje6bnmew4eexuvff4
Improving demand forecasting with LSTM by taking into account the seasonality of data
2020
Journal of Applied Research on Industrial Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The principle idea of this study is to propose a method that predicts the demand for every different season using a specialized forecaster. ...
The proposed method is evaluated using different topologies of the LSTM model. ...
Output (dense layer with 1 neuron).
Table 5 , 5 the mean RMSE for all models with our proposal is lower than the regular models. ...
doi:10.22105/jarie.2020.232594.1168
doaj:8e5cbe18b44d46209c7d1af90a9ed7e5
fatcat:h5v77btthrfkvoh2id7uh7vfwy
Hereditarily R-factorizable groups
2010
Topology and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For topological groups, we prove a more general result as follows. ...
MSC: We show that every subgroup of the σ -product of a family {G i : i ∈ I} of regular paratopological groups satisfying Nag(G i ) ω has countable cellularity, is perfectly κnormal and R 3 -factorizable ...
In paratopological groups, the behaviour of R-factorizability is less predictable. ...
doi:10.1016/j.topol.2008.12.045
fatcat:mckqr6kogrf6naouqvhm26y7sm
NeuroFabric: Identifying Ideal Topologies for Training A Priori Sparse Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, the choice of which sparse topology should be used in these networks is unclear. In this work, we provide a theoretical foundation for the choice of intra-layer topology. ...
The major impediment to fast training is the quadratic growth of both memory and compute requirements of dense and convolutional layers with respect to their information bandwidth. ...
of a dataset, we develop a data-free heuristic for predicting the expressiveness of a given sparse network. • From the heuristic, we derive requirements that make a good topology, and settle on a single ...
arXiv:2002.08339v1
fatcat:v7kjagfmtfgvlea4da57v57nn4
Learning to Infer Implicit Surfaces without 3D Supervision
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To this end, we propose a novel ray-based field probing technique for efficient image-to-field supervision, as well as a general geometric regularizer for implicit surfaces, which provides natural shape ...
In particular, sampling implicit surfaces densely is also known to be a computationally demanding and very slow operation. ...
While being able to describe arbitrary topologies, point-based representations are also restricted by their resolution capabilities since dense samples are needed. ...
arXiv:1911.00767v1
fatcat:vq33mtgfvvc7llzkigbvpljo4i
On the dynamics of the Tent function - Phase diagrams
2016
Journal of Advanced Studies in Topology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
from a topological viewpoint. ...
This paper focuses on the study of a one-dimensional topological dynamical system, the tent function. ...
There is an indication of (regular) periodic behavior densely distributed in the phase space. ...
doi:10.20454/jast.2016.1011
fatcat:g74qoedswbbznfiryl26sykzbq
« Previous
Showing results 1 — 15 out of 42,716 results