Spam filtering based on preference ranking

When the average number of spam messages received is continually increasing exponentially, both the Internet service provider and the end user suffer. The lack of an efficient solution may threaten the usability of the email as a communication means. In this paper we present a filtering mechanism applying the idea of preference ranking. This filtering mechanism will distinguish spam emails from other email on the Internet. The preference ranking gives the similarity values for nominated emails and spam emails specified by users, so that the ISP/end users can deal with spam emails at filtering points. We designed three filtering points to classify nominated emails into spam email, unsure email and legitimate email. This filtering mechanism can be applied on both middleware and at the client-side. The experiments show that high precision, recall and TCR (total cost ratio) of spam emails can be predicted for the preference based filtering mechanisms. <br /

An architecture of internet based data processing based on multicast and anycast protocols

Most of the current web-based application systems suffer from poor performance and costly heterogeneous accessing. Distributed or replicated strategies can alleviate the problem in some degree, but there are still some problems of the distributed or replicated model, such as data synchronization, load balance, and so on.&nbsp; In this paper, we propose a novel architecture for Internet-based data processing system based on multicast and anycast protocols. The proposed architecture breaks the functionalities of existing data processing system, in particular, the database functionality, into several agents. These agents communicate with each other using multicast and anycast mechanisms. We show that the proposed architecture provides better scalability, robustness, automatic load balance, and performance than the current distributed architecture of Internet-based dataprocessing.<br /

A co-recommendation algorithm for web searching

This paper presents an approach called the Co-Recommendation Algorithm, which consists of the features of the recommendation rule and the co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users to provide a lot of interactive communication. Furthermore, it supports other queries, such as keyword, URL and document investigations. When the structure is compared to other algorithms, the scalability is noticeably easier. The high online performance can be obtained as well as the repository computation, which can achieve a high group-forming accuracy using only a fraction of Web pages from a cluster. <br /

Self-adaptive clock synchronisation based on clock precision difference

This paper presents an innovative strategy to synchronize all virtual clocks in asynchronous Internet environments. Our model is based on the architecture of one reference clock and many slave clocks communicating with each other over the Internet. The paper makes three major contributions to this research area. Firstly, one-way information transmission is applied to reduce traffic overhead on the Internet for the purpose of clock synchronization. Secondly, the slave nodes use local virtual time and the arrival timestamp, from the reference node, to create linear mathematical trend models and to retrieve the clock precision differences between reference clock and slave clocks. Finally, a fault-tolerant and self-adaptive model executed by each slave node based on the above linear trend model is created in order to ensure that the virtual clock is running normally, even when the link between the reference node and this slave node has crashed. We also present detailed simulations of this strategy and mathematical analysis on real Internet environments.<br /

A web-DB model on multicast and anycast

Most of the current web-based database systems suffer from poor performance, complicated heterogeneity, and synchronization issues. In this paper, we propose a novel mechanism for web-based database system on multicast and anycast protocols to deal with these issues. In the model, we put a castway, a network interface for database server, between database server and Web server. Castway deals with the multicast and anycast requests and responses. We propose a requirement-based server selection algorithm and an atomic multicast update algorithm for data queries and synchronizations. The model is independent from the Internet environment, it can synchronise the databases efficiently and automatically. Furthermore, the model can reduce the possibility of transaction deadlocks.<br /

Age-related differences in risk factors, clinical characteristics, and outcomes for intracerebral hemorrhage

Background and purposeIntracerebral hemorrhage (ICH) is a severe form of stroke that remains understudied in the young adults. We aimed to investigate the clinical presentation, and risk factors associated with ICH in this age group and compare them to older patients.MethodsOur study included ICH patients admitted between March 2016 and December 2021 in the First Affiliated Hospital of Chongqing Medical University from our ongoing prospective cohort database. Demographic characteristics, etiology, risk factors, and clinical outcomes were compared between elderly and young patients. Furthermore, logistic regression analysis was employed to explore risk factors associated with the functional outcome at 3-months.ResultsWe selected 1,003 patients (mean age, 59.9 ±13.8 years old), 746 (74.4%) patients were aged &gt;50 years. The logistic regression analysis showed young patients have a higher proportion of secondary ICH, higher white blood cell count and higher body mass index (BMI), but less diabetes mellitus. Of all patients, predictors of 3-month functional independence was first-ever ICH and age ≤50 years. The history of nephropathy and stroke, higher baseline NIHSS score, larger hematoma volume, and the presence of hydrocephalus were associated with poor outcomes. And the white blood cell count could significantly influence the prognosis among young ICH patients. Three-month functional outcome based on modified Rankin scale score was better in young patients than the elderly (OR, 1.232; 95% CI, 1.095–1.388; p &lt; 0.001).ConclusionsThe highest incidence of ICH occurs in the age groups of 50–59 and 60–69. ICH in young adults had higher white blood cell and BMI compared to the elderly, and differs in etiological distribution. The young patients also had similar short-term mortality but more favorable functional outcomes than the elderly. Furthermore, NIHSS score and larger hematoma volumes were associated with poor outcome in all patients

Large expert-curated database for benchmarking document similarity detection in biomedical literature search

Document recommendation systems for locating relevant literature have mostly relied on methods developed a decade ago. This is largely due to the lack of a large offline gold-standard benchmark of relevant documents that cover a variety of research fields such that newly developed literature search techniques can be compared, improved and translated into practice. To overcome this bottleneck, we have established the RElevant LIterature SearcH consortium consisting of more than 1500 scientists from 84 countries, who have collectively annotated the relevance of over 180 000 PubMed-listed articles with regard to their respective seed (input) article/s. The majority of annotations were contributed by highly experienced, original authors of the seed articles. The collected data cover 76% of all unique PubMed Medical Subject Headings descriptors. No systematic biases were observed across different experience levels, research fields or time spent on annotations. More importantly, annotations of the same document pairs contributed by different scientists were highly concordant. We further show that the three representative baseline methods used to generate recommended articles for evaluation (Okapi Best Matching 25, Term Frequency-Inverse Document Frequency and PubMed Related Articles) had similar overall performances. Additionally, we found that these methods each tend to produce distinct collections of recommended articles, suggesting that a hybrid method may be required to completely capture all relevant articles. The established database server located at https://relishdb.ict.griffith.edu.au is freely available for the downloading of annotation data and the blind testing of new methods. We expect that this benchmark will be useful for stimulating the development of new powerful techniques for title and title/abstract-based search engines for relevant articles in biomedical research.Peer reviewe

Algorithms and applications of preference based ranking for information retrieval

In this thesis, the author designed three sets of preference based ranking algorithms for information retrieval and provided the corresponsive applications for the algorithms. The main goal is to retrieve recommended, high similar and valuable ranking results to users