Search

Information retrieval systems embed temporal information for retrieving the news documents related to temporal queries. One of the important aspects of a news document is the focus time , a time to which the content of document refers. The contemporary state-of-the-art does not exploit focus time to retrieve relevant news document. This paper investigates the inverted pyramid news paradigm to determine the focus time of news documents by extracting temporal expressions, normalizing their value and assigning them a score on the basis of their position in the text. In this method, the news documents are first divided into three sections following the inverted pyramid news paradigm. This paper presents a comprehensive analysis of four methods for splitting news document into sections: the paragraph-based method, the words-based method, the sentence-based method, and the semantic-based method (SeBM). Temporal expressions in each section are assigned weights using a linear regression model. Finally, a scoring function is used to calculate a temporal score for each time expression appearing in the document. These temporal expressions are then ranked on the basis of their temporal score, where the most suitable expression appears on top. The effectiveness of the proposed method is evaluated on a diverse dataset of news related to popular events; the results revealed that the proposed splitting methods achieved an average error of less than 5.6 years, whereas the SeBM achieved a high precision score of 0.35 and 0.77 at positions 1 and 2, respectively.

Cloud computing has recently been evolved in terms of the dynamic provision of computing resources to the users based on payment for usage on a pay-as-you-go basis. This provides feasibility to gain access to the large-scale and high-speed resources without establishing their own computing infrastructure to execute high-performance computing (HPC) applications. However, for the past several years, the efficient utilization of resources on a compute cloud has become a prime interest of the scientific community. One of the major causes behind inefficient resource utilization is the imbalance distribution of workload in a distributed computing. This paper contemplates the scheduling objectives of contemporary state-of-the-art heuristics to investigate their behavior to map HPC jobs to resources. Furthermore, the status of workload distribution in cloud computing is also critically assessed. A set of nine scheduling heuristics is validated in the CloudSim simulation environment. The potential of all the heuristics in terms of resource utilization is assessed by combining the workload balancing and machine-level load imbalance using different instances of benchmark scientific datasets (i.e., Heterogeneous Computing Scheduling Problems instances and Google Cloud Jobs dataset). The empirical assessment shows that it is not only an optimal solution to schedule the independent jobs on machines solely based on the execution time, throughput, and average resource utilization ratio; instead, the machine-level load balancing must also be considered to effectuate the usage of full capacity of computing power in a cloud system. Among all the heuristics, Resource-aware load balancing algorithm (RALBA) heuristic has outperformed, and it seems an optimal choice in terms of the tradeoff between complexity and the performance in terms of resource utilization and machine-level load balancing.