Filters








42 Hits in 8.9 sec

AN EXPERIMENTAL STUDY OF FACE RECOGNITION METHOD

Paula Pereira, Tanara Kuhn
2020 Computer Science & IT Research Journal  
The proposed idea relies on the spectral graph wavelet kernel procedure. In this proposed method, feature extraction is based on transformation into SGWT by means of spatial domain.  ...  In this study, a new method of face recognition is proposed based on the idea of wavelet operators for creating spectral graph wavelet transformation.  ...  The second stage is based on collaborative representation and learned metric for efficient nonnegative sparse code algorithm.  ... 
doi:10.51594/csitrj.v1i2.135 fatcat:a3qxrpe7dzfold2outg47syu4u

Support vector regression with genetic algorithms in forecasting tourism demand

Kuan-Yu Chen, Cheng-Hua Wang
2007 Tourism Management  
The experimental results demonstrate that SVR outperforms the BPNN and ARIMA models based on the normalized mean square error (NMSE) and mean absolute percentage error (MAPE).  ...  The aim of this study is to examine the feasibility of SVR in tourism demand forecasting by comparing it with back-propagation neural networks (BPNN) and the autoregressive integrated moving average (ARIMA  ...  . ; n, and are obtained by maximizing the dual function of Eq. (4), and the maximal dual function in Eq. (4) which has the following form: max Rða i ; a à i Þ ¼ X n i¼1 d i ða i À a à i Þ À e X n i¼1 ða  ... 
doi:10.1016/j.tourman.2005.12.018 fatcat:2n3phk45brgoxep2xc6awlphfa

The relative contribution of color and material in object selection

Ana Radonjić, Nicolas P. Cottaris, David H. Brainard, Wolfgang Einhäuser
2019 PLoS Computational Biology  
the relative importance of color vs. material in selection.  ...  On each experimental trial, observers viewed three blob-shaped objects-the target and two tests-and selected the test that was more similar to the target.  ...  Acknowledgments We thank Abby Squire for her help in data collection. Author Contributions  ... 
doi:10.1371/journal.pcbi.1006950 pmid:30978187 pmcid:PMC6490924 fatcat:pz3f3qcjyrhxfijomu6bc7nyzm

Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory

Guangfu Wu, Yijie Lv, Daojing He, Jiguang He, Huan Zhou, Sammy Chan
2020 IEEE Access  
Definition 1: A (n, k) linear block code has 2 k codewords forming a k-dimensional subspace of the vector space of all the n-tuples in GF (2) .  ...  THE ALGORITHM BASED ON CHANNEL CODING THEORY IS DETERMINISTIC AND ROBUST Forward error correction (FEC) coding is an important technique in communication.  ...  Three deterministic and robust algorithms have been proposed to solve the problem of the satisfiability of Boolean polynomial equations based on coding theory.  ... 
doi:10.1109/access.2020.2971393 fatcat:3fl6wrx7vrbjjcyu2usxebz2sm

The relative contribution of color and material in object selection [article]

Ana Radonjić, Nicolas P. Cottaris, David Brainard
2018 bioRxiv   pre-print
On each experimental trial, observers viewed three blob-shaped objects - the target and two tests - and selected the test that was more similar to the target.  ...  the relative importance of color vs. material in selection.  ...  This adjustment was based on informal judgments by authors AR and DHB. Note, 502 however, that our attention to spacing was only for the purpose of maximizing the power of the 503 data.  ... 
doi:10.1101/393470 fatcat:dbattux2wvdidbsjvnry7g6cxu

Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming [article]

Valentin Preda, Andrew Hyslop, Samir Bennani
2021 arXiv   pre-print
The proposed method was applied to a scenario that involved maximizing the science time for the upcoming Comet Interceptor flyby mission developed by the European Space Agency.  ...  The method directly handles the nonlinear dynamics of the spacecraft, sun exclusion constraint, torque and momentum limits on the reaction wheels as well as potential faults in these actuators.  ...  The mission takes advantage of the extra space available on the launcher of the ARIEL mission and will wait in hibernation until a suitable comet target is found.  ... 
arXiv:2105.09029v1 fatcat:2plqavhcznfqfmrp6lrwe63lfi

Imitative Planning using Conditional Normalizing Flow [article]

Shubhankar Agarwal, Harshit Sikchi, Cole Gulino, Eric Wilkinson
2020 arXiv   pre-print
This mapping allows for control samples and their associated energy to be generated jointly and in parallel.  ...  Finally, we demonstrate the effectiveness of our approach on real world datasets over IL and hand constructed trajectory sampling techniques.  ...  An autoregressive flow conditioned on the scene, generates trajectory samples in a latent space, described in section 4.4.  ... 
arXiv:2007.16162v2 fatcat:d5ifpjbgj5guvaoydlbpaxf3ny

Securing Tag-based recommender systems against profile injection attacks: A comparative study. (Extended Report) [article]

Georgios K. Pitsilis, Heri Ramampiaro, Helge Langseth
2019 arXiv   pre-print
This work addresses the challenges related to attacks on collaborative tagging systems, which often comes in a form of malicious annotations or profile injection attacks.  ...  In particular, we study various countermeasures against two types of such attacks for social tagging systems, the Overload attack and the Piggyback attack.  ...  This observation is in line with other researches in the field by Ramezani et al. (2008) , even though expressed in different metrics.  ... 
arXiv:1901.08422v1 fatcat:i5tltq6e65hmtfmwdcfx6gaptu

Constrained nonlinear optimization approaches to color-signal separation

Po-Rong Chang, Tsung-Hsieh Hsieh
1995 IEEE Transactions on Image Processing  
least-squares problem whose solution state space is less than that of the original space.  ...  Moreover, when taking in account the physical realizability constraints on both the surface reflectance and illumination, the feasible solutions to the nonlinear least-squares problem should satisfy a  ...  j of linear models that "ize the metric between ?  ... 
doi:10.1109/83.350812 pmid:18289960 fatcat:l7yohsqhwnhbxae3tx4sgbmqsm

Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks [article]

G. Maierbacher, J. Barros
2008 arXiv   pre-print
Although near-tooptimal solutions based on Turbo and LDPC codes exist for this problem, in most cases the proposed techniques do not scale to networks of hundreds of sensors.  ...  We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion  ...  Pradhan and Ramchandran presented in [19] a method called distributed source coding using syndromes (DISCUS), based on channel codes with good distance properties, where the set of possible codewords  ... 
arXiv:0809.1330v1 fatcat:t3waegrcdrguhmy5b6cfssxdx4

Learning one subprocedure per lesson

Kurt VanLehn
1987 Artificial Intelligence  
The harder one is learning a procedure from input-output pairs 4  ...  The key to SIERRA'S success lies in supplying a small amount of extra information with the examples.  ...  Given a version space and a positive instance, Update-S generalizes the patterns in S so that they match the instance and remain maximally specific.  ... 
doi:10.1016/0004-3702(87)90080-4 fatcat:bdp6op56knchbgdxw5fz3jv3yq

Abstracts of the Current Computer Literature

1969 IEEE transactions on computers  
In this note the computational efficiency of four methods for evaluating the interpolating polynominal is examined.  ...  ; Coding Conversational Use of Graphical Display Units in File Coding and Processing 7064 Generation of Optimal Code for Expres- sions Via Factorization 7070 Combinational Equation for Delay Between  ... 
doi:10.1109/t-c.1969.222561 fatcat:hsdd4fss3zc7pp6pschbyfbqlu

What's the Over/Under? Probabilistic Bounds on Information Leakage [chapter]

Ian Sweet, José Manuel Calderón Trilla, Chad Scherrer, Michael Hicks, Stephen Magill
2018 Lecture Notes in Computer Science  
Prior work has shown that QIF techniques based on abstract interpretation with probabilistic polyhedra can be used to analyze the worst-case leakage of a query, on-line, to determine whether that query  ...  In particular, depending on the size of the input and output space, it may take many samples to arrive at a proper approximation of the output distribution.  ...  A Query Code The following is the query code of the example developed in Sect. 2.2. Here, s x and s y represent a ship's secret location.  ... 
doi:10.1007/978-3-319-89722-6_1 fatcat:q473q7lhxbdqjhzmpzlbyuglxm

Methods of conjugate gradients for solving linear systems

M.R. Hestenes, E. Stiefel
1952 Journal of research of the National Bureau of Standards  
An iterative algorithm is given for solving a system Ax=k of n linear equations in n unknowns. The solution is given in n steps.  ...  (b) The conjugate gradient method is simpler to code and requires less storage space. (c) The given matrix is unaltered during the process, so that a maximum of the original data is used.  ...  A in the vector space according to (14:11).  ... 
doi:10.6028/jres.049.044 fatcat:3rgd76lupna3disvqvz7kdvu5y

What's the Over/Under? Probabilistic Bounds on Information Leakage [article]

Ian Sweet, Jose Manuel Calderon Trilla, Chad Scherrer, Michael Hicks,, Stephen Magill
2018 arXiv   pre-print
Prior work has shown that QIF techniques based on abstract interpretation with probabilistic polyhedra can be used to analyze the worst-case leakage of a query, on-line, to determine whether that query  ...  In particular, depending on the size of the input and output space, it may take many samples to arrive at a proper approximation of the output distribution.  ...  B Query code The following is the query code of the example developed in Section 2.2. Here, s_x and s_y represent a ship's secret location.  ... 
arXiv:1802.08234v1 fatcat:rd2isiuvjfcnbeeoe5vm6lzuu4
« Previous Showing results 1 — 15 out of 42 results