new approach
Recently Published Documents


TOTAL DOCUMENTS

63689
(FIVE YEARS 17583)

H-INDEX

251
(FIVE YEARS 50)

2022 ◽  
Vol 16 ◽  
pp. e00834
Author(s):  
R. Bakhti ◽  
B. Benahmed ◽  
A. Laib ◽  
M.T. Alfach

2022 ◽  
Vol 87 ◽  
pp. 102461
Author(s):  
Andrew Jorgenson ◽  
Rob Clark ◽  
Jeffrey Kentor ◽  
Annika Rieger

2022 ◽  
Vol 40 (3) ◽  
pp. 1-24
Author(s):  
Jiashu Zhao ◽  
Jimmy Xiangji Huang ◽  
Hongbo Deng ◽  
Yi Chang ◽  
Long Xia

In this article, we propose a Latent Dirichlet Allocation– (LDA) based topic-graph probabilistic personalization model for Web search. This model represents a user graph in a latent topic graph and simultaneously estimates the probabilities that the user is interested in the topics, as well as the probabilities that the user is not interested in the topics. For a given query issued by the user, the webpages that have higher relevancy to the interested topics are promoted, and the webpages more relevant to the non-interesting topics are penalized. In particular, we simulate a user’s search intent by building two profiles: A positive user profile for the probabilities of the user is interested in the topics and a corresponding negative user profile for the probabilities of being not interested in the the topics. The profiles are estimated based on the user’s search logs. A clicked webpage is assumed to include interesting topics. A skipped (viewed but not clicked) webpage is assumed to cover some non-interesting topics to the user. Such estimations are performed in the latent topic space generated by LDA. Moreover, a new approach is proposed to estimate the correlation between a given query and the user’s search history so as to determine how much personalization should be considered for the query. We compare our proposed models with several strong baselines including state-of-the-art personalization approaches. Experiments conducted on a large-scale real user search log collection illustrate the effectiveness of the proposed models.


Author(s):  
Frede Nidal Anakira ◽  
Ali Jameel ◽  
Mohmmad Hijazi ◽  
Abdel-Kareem Alomari ◽  
Noraziah Man

<p>In this paper, a modified procedure based on the residual power series method (RPSM) was implemented to achieve approximate solution with high degree of accuracy for a system of multi-pantograph type delay differential equations (DDEs). This modified procedure is considered as a hybrid technique used to improve the curacy of the standard RPSM by combining the RPSM, Laplace transform and Pade approximant to be a powerful technique that can be solve the problems directly without large computational work, also even enlarge domain and leads to very accurate solutions or gives the exact solutions which is consider the best advantage of this technique. Some numerical applications are illustrated and numerical results are provided to prove the validity and the ability of this technique for this type of important differential equation that appears in different applications in engineering and control system.</p>


2022 ◽  
Vol 44 (1) ◽  
pp. 1-50
Author(s):  
Omar Inverso ◽  
Ermenegildo Tomasco ◽  
Bernd Fischer ◽  
Salvatore La Torre ◽  
Gennaro Parlato

Bounded verification techniques such as bounded model checking (BMC) have successfully been used for many practical program analysis problems, but concurrency still poses a challenge. Here, we describe a new approach to BMC of sequentially consistent imperative programs that use POSIX threads. We first translate the multi-threaded program into a nondeterministic sequential program that preserves reachability for all round-robin schedules with a given bound on the number of rounds. We then reuse existing high-performance BMC tools as backends for the sequential verification problem. Our translation is carefully designed to introduce very small memory overheads and very few sources of nondeterminism, so it produces tight SAT/SMT formulae, and is thus very effective in practice: Our Lazy-CSeq tool implementing this translation for the C programming language won several gold and silver medals in the concurrency category of the Software Verification Competitions (SV-COMP) 2014–2021 and was able to find errors in programs where all other techniques (including testing) failed. In this article, we give a detailed description of our translation and prove its correctness, sketch its implementation using the CSeq framework, and report on a detailed evaluation and comparison of our approach.


2023 ◽  
Vol 83 ◽  
Author(s):  
A. Marins ◽  
P. F. Cristaldo ◽  
L. R. Paiva ◽  
O. Miramontes ◽  
O. DeSouza

Abstract Behavioral lab bioassays involving termites must be promptly performed to allow intended observations prior to death from dissecation, typical of these soft-bodied insects. To this end, topic markers have been proposed as an alternative to histological stains which, while not always toxic are inevitably lengthy to apply. Among recommended topic markers, gouache is easy to apply, dries out quickly, but it is known affect termites in the long run, being suitable only to short-term bioassays. Its alternative, colored glue, is also easy to apply, but it takes long to dry and it is too dense and heavy, being thus prone to affect termite walking patterns. Here we tested a mix of gouache and colored glue aiming to combine the qualities of both into a suitable topical marker for Cornitermes cumulans termites. Similar patterns of survival presented by marked and unmarked termites ruled out concerns about toxicity of this mixture. Such results were consistent across distinct group densities evidencing that the mixture does not interfere with, nor it is affected by, crowding effects. Because crowding regulates interindividual interactions and these underlie most behaviors, the mixture can be thought to be suitable to behavioral studies. We argue that this 1:2 glue:gouache mixture is an excellent alternative to mark termites for lab bioassays. Being atoxic, cheap, easy to apply, and non-invasive, this mixture may happen to be useful not only for termites but also in bioassaying other similarly soft-bodied insects.


Sign in / Sign up

Export Citation Format

Share Document