Filters








238 Hits in 6.5 sec

Scalable methods to integrate task knowledge with the Three-Weight Algorithm for hybrid cognitive processing via optimization

Nate Derbinsky, José Bento, Jonathan S. Yedidia
2014 Biologically Inspired Cognitive Architectures  
We propose novel methods by which to integrate diverse forms of task knowledge with this algorithm in order to improve expressiveness, efficiency, and scaling across a variety of problems.  ...  Given this context, we focus on the Three-Weight Algorithm, which is interruptible, scalable, and aims to solve general optimization problems.  ...  order to improve expressiveness of knowledge, methods, and heuristics, as well as bolster algorithm efficiency scaling.  ... 
doi:10.1016/j.bica.2014.03.007 fatcat:voctscpmvrcankeyv56k2ql56m

Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing [article]

Nate Derbinsky, José Bento, Jonathan S. Yedidia
2013 arXiv   pre-print
In this context, we focus on the Three-Weight Algorithm, which aims to solve general optimization problems.  ...  We propose novel methods by which to integrate knowledge with this algorithm to improve expressiveness, efficiency, and scaling, and demonstrate these techniques on two example problems (Sudoku and circle  ...  of circle movements, and then the TWA dated in the r-tree, as those are the only coordinates the TWA would integrate this information and perform low-level, fine- could have altered; (2) the algorithm  ... 
arXiv:1311.4064v1 fatcat:qbw7jl54kvgpnenl5rz7bvkogq

Latent Tree Decomposition Parsers for AMR-to-Text Generation [article]

Lisa Jin, Daniel Gildea
2021 arXiv   pre-print
By clustering edges into a hierarchy, a tree decomposition summarizes graph structure. Our model encodes a derivation forest of tree decompositions and extracts an expected tree.  ...  Encoding TD forests instead of shortest-pairwise paths in a self-attentive baseline raises BLEU by 0.7 and chrF++ by 0.3.  ...  Acknowledgments This work was supported by NSF awards IIS-1813823 and CCF-1934962.  ... 
arXiv:2108.12304v2 fatcat:hgm2tlnkhbgynbad36ep4na7c4

CREDIT CARD FRAUD DETECTION USING MACHINE LEARNING ALGORITHMS

Risha Irshad Khan, Rachana N, Varshitha Chandra B. R., Rajeshwari K
2020 International Journal of Recent Trends in Engineering and Research  
We also studied about a general model which explains about the steps to be followed in order to apply the algorisms and find out the performance and accuracy.  ...  Key aim of this paper is to find out regarding various machine learning algorithms which are utilized to identify credit card fraud.  ...  A very special thanks to our head of the Department Dr. M Dakshayini who gave us the opportunity to complete this paper.  ... 
doi:10.23883/ijrter.2020.6045.nbx9l fatcat:ciaxpw5f5zh47kcomcagmra2de

Locally Estimating Core Numbers [article]

Michael P. O'Brien, Blair D. Sullivan
2014 arXiv   pre-print
Finally, we evaluate the impact of improved local estimation on an open problem in network experimentation posed by Ugander et al.  ...  Moreover, in the context of network experiments, the subgraph induced by the treated vertices is only known in a probabilistic sense.  ...  ACKNOWLEDGMENTS The authors thank Johan Ugander for introducing them to the problem of calculating the k-cores in a network experiment during a workshop at the Statistical and Applied Mathematical Sciences  ... 
arXiv:1410.6793v2 fatcat:7ygtwwighbesdgwsbhsnrqds3i

Dynamic Compressive Sensing of Time-Varying Signals Via Approximate Message Passing

Justin Ziniel, Philip Schniter
2013 IEEE Transactions on Signal Processing  
While there has been a handful of previously proposed Bayesian dynamic CS algorithms in the literature, the ability to perform inference on high-dimensional problems in a computationally efficient manner  ...  We further describe the result of applying DCS-AMP to two real dynamic CS datasets, as well as a frequency estimation task, to bolster our claim that DCS-AMP is capable of offering state-of-the-art performance  ...  By viewing as a "local prior" 4 for , we can readily apply an off-the-shelf AMP algorithm (e.g., [28] , [32] , [33] ) as a means of performing the message passes within the portions of the factor graph  ... 
doi:10.1109/tsp.2013.2273196 fatcat:efr4p3baxrcc5me75iffg5r3ea

Boundary Defense against Cyber Threat for Power System Operation [article]

Ming Jin, Javad Lavaei, Somayeh Sojoudi, Ross Baldick
2019 arXiv   pre-print
The proposed method does not allow a local attack to have a global effect on the data analysis of the entire network, which enhances the situational awareness of the grid especially in the face of adversity  ...  The developed mathematical framework reveals key geometric and algebraic factors that can affect algorithmic robustness and is used to study the vulnerability of the U.S. power grid in this paper.  ...  Furthermore, the width of a tree decomposition is max(|W t | − 1 : t ∈ N (T )). The treewidth of G is the minimum width of a tree decomposition of G.  ... 
arXiv:1908.10315v1 fatcat:kuaakw7f4fdrfpc3txedoihqd4

Human Face Detection Techniques: A Comprehensive Review and Future Research Directions

Md Khaled Hasan, Md. Shamim Ahsan, Abdullah-Al-Mamun, S. H. Shah Newaz, Gyu Myoung Lee
2021 Electronics  
We provide the strengths and limitations of these algorithms and a novel literature survey that includes their use besides face detection.  ...  First, we explore a wide variety of the available face detection algorithms in five steps, including history, working procedure, advantages, limitations, and use in other fields alongside face detection  ...  Sub-trees in the tree describes sub-curves, thereby giving the local relative positions, explaining the local curvature.  ... 
doi:10.3390/electronics10192354 fatcat:oy7adwj6cjefnm66cn5kxrybni

Statistical analysis of the influence of microstructure on damage in fibrous ceramic matrix composites

Jared Tracy, Samantha Daly
2017 International Journal of Applied Ceramic Technology  
The effect of microstructure on cracking was analyzed in a CMC using statistical methods.  ...  It was determined that the amounts of coating surrounding fibers and their dispersion within the matrix influenced where cracks evolved in transverse plies.  ...  In the absence of an automated system for capturing images along the entirety of the edge of the gage section, notches were needed to localize matrix crack propagation and improve the likelihood of capturing  ... 
doi:10.1111/ijac.12646 fatcat:ckspsdksf5he5ou4sboh3iby5y

Using Bayesian Networks to Model Expected and Unexpected Operational Losses

Martin Neil, Norman Fenton, Manesh Tailor
2005 Risk Analysis  
We conclude that BNs can help combine qualitative data from experts and quantitative data from historical loss databases in a principled way and as such they go some way in meeting the requirements of  ...  The use of causal modeling is discussed from the perspective of exploiting local expertise about process reliability and formally connecting this knowledge to actual or hypothetical statistical phenomena  ...  The AgenaRisk software (AgenaRisk, 2005) was used to create the example analysis and graphs in this article. We would like to thank the referees for their helpful comments and suggestions.  ... 
doi:10.1111/j.1539-6924.2005.00641.x pmid:16268944 fatcat:toulzfwylzavfdtxyq3xag4hwu

Parallel computing works!

Marcin Paprzycki
1996 IEEE Parallel & Distributed Technology Systems & Applications  
However, we discovered that by increasing No,. in rough proportion to _, we can improve the performance of the algorithm significantly.  ...  As a natural result, it was reasonably easy to build tree structures but difficult to perform domain decompositions.  ...  Local arrays are denoted at left by A p'q where (p, q) is the grid position of the process on G =  ... 
doi:10.1109/mpdt.1996.7102339 fatcat:r6x46zu2pfd4rin4qpzt7ftqqq

SPIRAL: Code Generation for DSP Transforms

M. Puschel, J.M.F. Moura, J.R. Johnson, D. Padua, M.M. Veloso, B.W. Singer, Jianxin Xiong, F. Franchetti, A. Gacic, Y. Voronenko, K. Chen, R.W. Johnson (+1 others)
2005 Proceedings of the IEEE  
The "intelligence" is provided by search and learning techniques that exploit the structure of the algorithm and implementation space to guide  ...  SPIRAL formulates the tuning as an optimization problem and exploits the domain-specific mathematical structure of transform algorithms to implement a feedback-driven optimizer.  ...  Further, the authors acknowledge the many interactions with A. Tsao, D. Healy, D. Cochran, and more recently with F. Darema, during the development of SPIRAL.  ... 
doi:10.1109/jproc.2004.840306 fatcat:gdb4elhbl5eg5h7obiipe2sjlu

Habitability Classification of Exoplanets: A Machine Learning Insight [article]

Suryoday Basak, Surbhi Agrawal, Snehanshu Saha, Abhijit Jeremiel Theophilus, Kakoli Bora, Gouri Deshpande, Jayant Murthy
2018 arXiv   pre-print
We elaborate on the results obtained by using ML algorithms by stating the accuracy of each method used and propose the best paradigm to automate the task of exoplanet classification.  ...  We perform a detailed analysis of the structure of the data and propose methods that can be used to effectively categorize new exoplanet samples. Our contributions are two fold.  ...  Performance Improvement Using Elastic Gini Splitting Criteria in Decision Trees Naturally, the inquisition arises to further build up on decision trees to bolster the performance.  ... 
arXiv:1805.08810v1 fatcat:rvejpfensfbgzebm4q2lcih7li

Parsimonious Morpheme Segmentation with an Application to Enriching Word Embeddings [article]

Ahmed El-Kishky, Frank Xu, Aston Zhang, Jiawei Han
2019 arXiv   pre-print
Additionally, we experimentally demonstrate that utilizing MorphMine morphemes to enrich word embeddings consistently improves embedding quality on a variety of of embedding evaluations and a downstream  ...  However, in many languages and specialized corpora, words are composed by concatenating semantically meaningful subword structures.  ...  Any opinions, findings, and conclusions or recommendations expressed in this document are those of the author(s) and should not be interpreted as the views of any U.S. Government. The U.S.  ... 
arXiv:1908.07832v2 fatcat:ebil4lzppbbh3dn5e4kr6tlyyq

Meshless techniques for anisotropic diffusion

Annamaria Mazzia, Giorgio Pini, Flavio Sartoretto
2014 Applied Mathematics and Computation  
Transport processes are common in geoscience applications, and find their way into models of, e.g., the atmosphere, oceans, shallow water, subsurface, seismic inversion, and deep earth.  ...  The latter would allow better use of parallel computers, since time-stepping is essentially a serial process. Moreover, it would be good for the methods to be of high order accuracy.  ...  We present complex scenarios of multicomponent reactive transport in 2-D and in 3-D. These scenarios are further developments of the setting given by the MoMaS benchmark.  ... 
doi:10.1016/j.amc.2014.03.032 fatcat:c527226gyfgbffnq4p67qxd7wi
« Previous Showing results 1 — 15 out of 238 results