The number of annual scientific publications is growing year by year, which has led to the accumulation and formation of large databases. This increases the complexity of the search for relevant articles. Modern searc...
详细信息
ISBN:
(纸本)9781665476249
The number of annual scientific publications is growing year by year, which has led to the accumulation and formation of large databases. This increases the complexity of the search for relevant articles. Modern search engines leverage keyphrases to improve the performance of search results. Keyphrases (or keywords) are a set of single or multi-word expressions which provide a very compact summary of contents and describe the overall topic of a document. Implementation of keyphrase extraction can be varied for specific-domain databases. This motivated us to evaluate these methods on a database of influenza scientific literature. In this work, we considered 9 well known methods for extracting keyphrases. Our preliminary results show txhat graph-based methods which employ topics outperform others using our database. We also determined that influenza-related papers can be grouped into three general topics: public health & medical care; molecular biology & immunology; and phylogenetic & epidemiological studies.
Blood is vital for transporting oxygen, nutrients, and hormones to all body parts as it circulates through arteries and veins. It removes carbon dioxide, regulates body temperature, and maintains the body's immune...
详细信息
In the purview of most educational sectors today, numerous reviews regarding data mining have been the primary focus, with goals of discovering vast knowledge patterns for students' data. This paper focuses on bui...
详细信息
Remote monitoring of objects or technological processes is used in many industries and service-oriented companies to obtain up-to-date information about the state of things or technical processes. The article is devot...
详细信息
The aggregation operator is a popular tool for dealing with multi-criteria decision-making (MCDM) problems. An MCDM technique based on the modified picture fuzzy weighted geometric operator (MPFWGO) is proposed in thi...
详细信息
MSC Codes 65K10In this paper, we leverage an information-theoretic upper bound on the maximum admissible level of noise (MALN) in convex Lipschitz-continuous zeroth-order optimisation to establish corresponding upper ...
详细信息
Nowadays, exploits often rely on a code-reuse approach. Short pieces of code called gadgets are chained together to execute some payload. Code-reuse attacks can exploit vulnerabilities in the presence of operating sys...
详细信息
The spider structure in the photoelectron momentum distributions(PMDs)of ionized electrons from the hydrogen atom is simulated by solving the time-dependent Schrodinger equation(TDSE).We find that the spider structure...
详细信息
The spider structure in the photoelectron momentum distributions(PMDs)of ionized electrons from the hydrogen atom is simulated by solving the time-dependent Schrodinger equation(TDSE).We find that the spider structure exhibits sensitive dependence on carrier envelope phase(CEP)of the few-cycle *** elucidate the striking CEP dependence of the spider structure,we select three physical parameters IL,IR,and IR/IL to quantitatively characterize the variations of the spider structure induced by altering the *** is the sum of the left half panel of the transverse cut curves(i.e.,the sum of all the negative momenta along the laser polarization direction),IR is the sum of the right half panel of the transverse cut curves(i.e.,the sum of all the positive momenta along the laser polarization direction),and IR/IL is the ratio between the two *** parameters are shown to have monotonic relation with the CEP value,which is exploited to extract the *** anticipate that our method will be useful for obtaining CEPs encoded in the spider structure of PMDs.
Asymptotic Notations have been very effective in representing the efficiencies of algorithms by analyzing the number of steps and the nature of traversals and operations that the algorithm is bound to perform. Though ...
详细信息
ISBN:
(纸本)9781665426923
Asymptotic Notations have been very effective in representing the efficiencies of algorithms by analyzing the number of steps and the nature of traversals and operations that the algorithm is bound to perform. Though they represent the nature of growth of the time or space consumed by the algorithms, they only consider the fastest-growing term and not the other terms. The result from this kind of analysis often seems to be fruitful in grading the algorithms based on their efficiency, but theoretically, there seem to be evident deviations when these complexities are extrapolated to larger datasets, hypothetically ‘infinitely large’ datasets. This deviation is tracked down when the constant and slow-growing terms involved are considered. The practical difficulty of empirically verifying this fact due to the ambiguity in defining a very large number of inputs is overcome by theoretically calculating the ratio between the time complexities of algorithms of interest and applying their limit to be infinity. In this study, the algorithms heapsort and merge sort are analyzed and the drastic deviation between them is shown mathematically though they both have the complexity of $n(log(n))$ , concluding that the merge sort is actually twice as fast as heap sort when approaching infinitely large data elements.
Correctness-by-Construction (CbC) is an incremental program construction process to construct functionally correct programs. The programs are constructed stepwise along with a specification that is inherently guarante...
详细信息
暂无评论