Piracema.io: A rules-based tree model for phishing prediction

2022 ◽  
Vol 191 ◽  
pp. 116239
Author(s):  
Carlo Marcelo Revoredo da Silva ◽  
Bruno José Torres Fernandes ◽  
Eduardo Luzeiro Feitosa ◽  
Vinicius Cardoso Garcia
Keyword(s):  
Tree Model

Numerical simulation of the tree higro-thermal response in forest fire environment

2020 ◽  
pp. 57-65
Author(s):  
Eusébio Conceiçã ◽  
João Gomes ◽  
Maria Manuela Lúcio ◽  
Jorge Raposo ◽  
Domingos Xavier Viegas ◽  
...  
Keyword(s):  
Forest Fire ◽  
Numerical Study ◽  
Thermal Response ◽  
View Factor ◽  
Tree Model ◽  
Pine Tree ◽  
Surface Temperatures ◽  
Fire Environment ◽  
Fire Front ◽  
Heat Exchanges

This paper refers to a numerical study of the hypo-thermal behaviour of a pine tree in a forest fire environment. The pine tree thermal response numerical model is based on energy balance integral equations for the tree elements and mass balance integral equation for the water in the tree. The simulation performed considers the heat conduction through the tree elements, heat exchanges by convection between the external tree surfaces and the environment, heat exchanges by radiation between the flame and the external tree surfaces and water heat loss by evaporation from the tree to the environment. The virtual three-dimensional tree model has a height of 7.5 m and is constituted by 8863 cylindrical elements representative of its trunks, branches and leaves. The fire front has 10 m long and a 2 m high. The study was conducted taking into account that the pine tree is located 5, 10 or 15 m from the fire front. For these three analyzed distances, the numerical results obtained regarding to the distribution of the view factors, mean radiant temperature and surface temperatures of the pine tree are presented. As main conclusion, it can be stated that the values of the view factor, MRT and surface temperatures of the pine tree decrease with increasing distance from the pine tree in front of fire.

The Arabic Origins of English and Indo-European “Definite Articles”: A Radical Linguistic Theory Approach

2016 ◽  
Vol 4 (6) ◽  
pp. 26
Author(s):  
Zaidan Ali Jassem
Keyword(s):  
Comparative Method ◽  
Linguistic Theory ◽  
General Level ◽  
Theory Approach ◽  
Tree Model ◽  
Linguistic Change ◽  
European Languages ◽  
The Family ◽  
Different Types ◽  
Definite Articles

This paper traces the Arabic origins or cognates of the “definite articles” in English and Indo-European languages from a radical linguistic (or lexical root) theory perspective. The data comprises the definite articles in English, German, French, Spanish, Portuguese, Italian, Romanian, Latin, Greek, Macedonian, Russian, Polish, Sanskrit, Hindi, Bengali, Persian, and Arabic. The results clearly indicate that five different types of such articles emerged in the data, all of which have true Arabic cognates with the same or similar forms and meanings, whose differences are due to natural and plausible causes and different routes of linguistic change, especially lexical, semantic, or morphological shift. Therefore, the results support the adequacy of the radical linguistic theory according to which, unlike the Family Tree Model or Comparative Method, Arabic, English, German, French, Latin, Greek, and Sanskrit not only belong to the same language family, renamed Eurabian or Urban family, but also are dialects of the same language, with Arabic being their origin all because only it shares the whole cognates with them all and because it has a huge phonetic, morphological, grammatical, and lexical variety. They also manifest fundamental flaws and grave drawbacks which plague English and Indo-European lexicography for ignoring Arabic as an ultimate ancestor and progenitor not only in the treatment of the topic at hand but in all others in general. On a more general level, they also show that there is a radical language from which all human languages stemmed and which has been preserved almost intact in Arabic, thus being the most conservative and productive language

Assessing the Risk of Noncompliance in Wastewater Treatment

1992 ◽  
Vol 26 (5-6) ◽  
pp. 1411-1420 ◽  
Author(s):  
S. H. Choudhury ◽  
S. L. Yu ◽  
Y. Y. Haimes
Keyword(s):  
Wastewater Treatment ◽  
Wastewater Treatment Plant ◽  
Fault Tree ◽  
Treatment Plant ◽  
Risk Identification ◽  
System Component ◽  
System Failure ◽  
Tree Model ◽  
Risk Quantification ◽  
Failure Probabilities

This paper presents an integrated methodology that allows determining the probability of noncompliance for a given wastewater treatment plant. The methodology applies fault-tree analysis, which uses failure probabilities of individual components, to predict the overall system failure probability. The methodology can be divided into two parts : risk identification and risk quantification. In risk identification, the key components in the system are determined by analyzing the contribution of individual component failures toward system failure (i.e., noncompliance). In risk quantification, a fault-tree model is constructed for the particular system, component failure probabilities are estimated, and the fault-tree model is evaluated to determine the probability of occurrence of the top event (i.e., noncompliance). A list can be developed that ranks critical events on the basis of their contributions to the probability of noncompliance. Such a ranking should assist managers to determine which components require most attention for a better performance of the entire system. A wastewater treatment plant for treating metal-bearing rinse water from an electroplating industry is used as an example to demonstrate the application of this methodology.

Faking Detection Improved: Adopting a Likert Item Response Process Tree Model

2021 ◽  
pp. 109442812110029
Author(s):  
Tianjun Sun ◽  
Bo Zhang ◽  
Mengyang Cao ◽  
Fritz Drasgow
Keyword(s):  
Item Response ◽  
Personality Assessment ◽  
Personnel Selection ◽  
Process Model ◽  
Tree Model ◽  
High Stakes ◽  
New Approach ◽  
Job Applicant ◽  
Favorable Impression ◽  
Tree Modeling

With the increasing popularity of noncognitive inventories in personnel selection, organizations typically wish to be able to tell when a job applicant purposefully manufactures a favorable impression. Past faking research has primarily focused on how to reduce faking via instrument design, warnings, and statistical corrections for faking. This article took a new approach by examining the effects of faking (experimentally manipulated and contextually driven) on response processes. We modified a recently introduced item response theory tree modeling procedure, the three-process model, to identify faking in two studies. Study 1 examined self-reported vocational interest assessment responses using an induced faking experimental design. Study 2 examined self-reported personality assessment responses when some people were in a high-stakes situation (i.e., selection). Across the two studies, individuals instructed or expected to fake were found to engage in more extreme responding. By identifying the underlying differences between fakers and honest respondents, the new approach improves our understanding of faking. Percentage cutoffs based on extreme responding produced a faker classification precision of 85% on average.

A novel enhanced decision tree model for detecting chronic kidney disease

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Avijit Kumar Chaudhuri ◽  
Deepankar Sinha ◽  
Dilip K. Banerjee ◽  
Anirban Das
Keyword(s):  
Chronic Kidney Disease ◽  
Kidney Disease ◽  
Decision Tree ◽  
Decision Tree Model ◽  
Tree Model

scholarly journals Decision Tree-Based Adaptive Reconfigurable Cache Scheme

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 176
Author(s):  
Wei Zhu ◽  
Xiaoyang Zeng
Keyword(s):  
Decision Tree ◽  
Adaptive Algorithms ◽  
Memory Access ◽  
Access Time ◽  
Decision Tree Algorithm ◽  
Verilog Hdl ◽  
Tree Model ◽  
Cache Associativity ◽  
Cache Scheme ◽  
Reconfigurable Cache

Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system. To solve this problem, we propose a real-time adaptive reconfigurable cache based on the decision tree algorithm, which can optimize the average memory access time of cache without modifying the cache coherent protocol. By monitoring the application running state, the cache associativity is periodically tuned to the optimal cache associativity, which is determined by the decision tree model. This paper implements the proposed decision tree-based adaptive reconfigurable cache in the GEM5 simulator and designs the key modules using Verilog HDL. The simulation results show that the proposed decision tree-based adaptive reconfigurable cache reduces the average memory access time compared with other adaptive algorithms.

Sign in / Sign up

Export Citation Format

Share Document