Search

Researchers face difficulties in finding relevant papers to their research interest as the number of scientific publication is rapidly increasing on the web. Scientific paper recommenders have emerged as a leading solution to help researchers by automatically suggesting relevant and useful publications. Several approaches have been proposed on improving recommender systems. However, most existing approaches depend on priori user profiles, and thus they cannot recommend papers to new user. Furthermore, the existing approaches utilize non-public contextual information, and thus it cannot adequately find similarities between papers due to copyright restrictions. Also, the existing approaches consider only single level paper-citation relation to identify similarities between papers. Considering the above challenges, this paper presents a collaborative filtering based recommendation approach for scientific papers that does not depend on priori user profiles and which utilizes only public contextual information. Using citation context, we utilized 2-level paper-citation relations to find hidden associations between papers. The rational underlying this approach is that, two papers are co-occurred with same cited paper(s) and two papers are co-occurring with same citing paper(s) are significantly similar to some extent. To evaluate the performance of the proposed approach, publicly available datasets are used to conduct extensive experiments. The experimental results demonstrate that the proposed approach has significantly outperforms the baseline approaches in terms of precision, recall, F1, mean average precision, and mean reciprocal rank, which are commonly used information retrieval metrics. The novelty of this study is that, with the proposed approach, researchers are able to find relevant and useful publications over the internet regardless of their previous research experiences and research area.

In paper production, a jumbo reel is cut into multiple intermediate rolls, and each intermediate roll is then sheeted as finished goods. This problem is called a cutting stock problem and is proven to be NP-hard. The objective is to minimize material waste or trim loss from all the cuttings. In the case that any intermediate roll is not entirely used for its associated order, the intermediate roll itself could turn to be a dead stock. We use the concept of universal sizes of intermediate rolls to eliminate the dead stock. A pre-defined number of universal sizes of intermediate rolls is to be used to serve all the orders. The problem is solved using Reinforcement Artificial Bee Colony algorithm with Integer Linear Programming subroutine. This proposed approach is then tested with a set of 1,055 orders and 127 different sizes of sheet papers from a paper manufacturer. The results reveal that our method outperforms other algorithms. Our method offers the total trim loss of 3.51%, compared to the trim loss reported by the industry of at least 5%. This approach not only reduces the number of partially cut rolls, but also decreases the number of the jumbo reels needed to serve all the orders. Therefore, both the inventory cost and material cost can be saved.

This paper presents the design and analysis of a paper-based chipless RFID sensor for wetness content measurement in plant leaves. The sensor is designed using a passive microwave resonator to measure the ambient physical parameter. The resonator is designed with a rectangular loop inductively coupled with an interdigital capacitor. The experimental analysis of the designed sensor is illustrated here to prove its efficacy. The resonator provides adequate backscattered signal for wireless measurement in the microwave frequency band. When interrogated with a couple of UWB antennas and a VNA, it yields accurate leaf wetness response of the plant. The commercial competence of this sensing device is validated through its experimental analysis on three different types of leaf samples. This sensor is suitable for plant health monitoring in any small-scale gardening applications such as nurseries and greenhouses.

This paper investigates the impact of institutes and papers over time based on the heterogeneous institution-citation network. A new model, IPRank, is introduced to measure the impact of institution and paper simultaneously. This model utilises the heterogeneous structural measure method to unveil the impact of institution and paper, reflecting the effects of citation, institution, and structural measure. To evaluate the performance, the model first constructs a heterogeneous institution-citation network based on the American Physical Society (APS) dataset. Subsequently, PageRank is used to quantify the impact of institution and paper. Finally, impacts of same institution are merged, and the ranking of institutions and papers is calculated. Experimental results show that the IPRank model better identifies universities that host Nobel Prize laureates, demonstrating that the proposed technique well reflects impactful research. Refereed/Peer-reviewed

Researchers from academia and the corporate-sector rely on scholarly digital libraries to access articles. Attackers take advantage of innocent users who consider the articles' files safe and thus open PDF-files with little concern. In addition, researchers consider scholarly libraries a reliable, trusted, and untainted corpus of papers. For these reasons, scholarly digital libraries are an attractive-target and inadvertently support the proliferation of cyber-attacks launched via malicious PDF-files. In this study, we present related vulnerabilities and malware distribution approaches that exploit the vulnerabilities of scholarly digital libraries. We evaluated over two-million scholarly papers in the CiteSeerX library and found the library to be contaminated with a surprisingly large number (0.3-2%) of malicious PDF documents (over 55% were crawled from the IPs of US-universities). We developed a two layered detection framework aimed at enhancing the detection of malicious PDF documents, Sec-Lib, which offers a security solution for large digital libraries. Sec-Lib includes a deterministic layer for detecting known malware, and a machine learning based layer for detecting unknown malware. Our evaluation showed that scholarly digital libraries can detect 96.9% of malware with Sec-Lib, while minimizing the number of PDF-files requiring labeling, and thus reducing the manual inspection efforts of security-experts by 98%.

The volume of research articles in digital repositories is increasing. This spectacular growth of repositories makes it rather difficult for researchers to obtain related research papers in response to their queries. The problem becomes worse when a researcher with insufficient knowledge of searching research articles uses these repositories. In the traditional recommendation approaches, the results of the query miss many high-quality papers, in the related work section, which are either published recently or have low citation count. To overcome this problem, there needs to be a solution which considers not only structural relationships between the papers but also inspects the quality of authors publishing those articles. Many research paper recommendation approaches have been implemented which includes collaborative filtering-based, content-based, and citation analysis-based techniques. The collaborative filtering-based approaches primarily use paper-citation matrix for recommendations, whereas the content-based approaches only consider the content of the paper. The citation analysis considers the structure of the network and focuses on papers citing or cited by the paper of interest. It is therefore very difficult for a recommender system to recommend high-quality papers without a hybrid approach that incorporates multiple features, such as citation information and author information. The proposed method creates a multilevel citation and relationship network of authors in which the citation network uses the structural relationship between the papers to extract significant papers, and authors' collaboration network finds key authors from those papers. The papers selected by this hybrid approach are then recommended to the user. The results have shown that our proposed method performs exceedingly well as compared with the state-of-the-art existing systems, such as Google scholar and multilevel simultaneous citation network.

The accelerating rate of scientific publications makes it extremely difficult for researchers to find out the relevant papers and related works. Recommender systems that aim at solving the information overload problem have attracted lots of attention. However, existing paper recommendation works generally rely on the simple citation-ships between papers, which ignore the heterogeneity of the academic graphs. In this paper, we solve the personalized paper recommendation problem in the setting of heterogeneous information networks. A heterogeneous graph representation based recommendation method named HGRec is proposed. First, the author and paper profiles are constructed based on the extracted contents information. Second, we initialize the node vectors by employing the word-embedding technique. Third, we jointly update the node embeddings in the heterogeneous graph by proposing two meta-path based proximity measures. Finally, the paper recommendation is completed by calculating the similarity of the generated author and paper feature vectors. We present experiments on a real academic network, the DBLP network. The comparative results demonstrate the effectiveness of the proposed personalized recommendation approach compared to state-of-the-art methods.

Evolutionary game dynamics is a combination of game theory and dynamical systems. Using dynamical theory, we investigate chaotic behavior in asymmetric Rock-Paper-Scissors games under imitative dynamics with two different populations. Our theoretical analysis and numerical simulations demonstrate that the dynamical system can give rise to chaotic behavior in zero-sum and positive-sum asymmetric games. However, chaos cannot occur in a negative-sum asymmetric game. In particular, the numerical simulations show that there is a limit cycle in a negative-sum asymmetric game.

© 2013 IEEE. With the rapid growth of scientific publications, it is hard for researchers to acquire appropriate papers that meet their expectations. Recommendation system for scientific articles is an essential technology to overcome this problem. In this paper, we propose a novel low-rank and sparse matrix factorization-based paper recommendation (LSMFPRec) method for authors. The proposed method seamlessly combines low-rank and sparse matrix factorization method with fine-grained paper and author affinity matrixes that are extracted from heterogeneous scientific network. Thus, it can effectively alleviate the sparsity and cold start problems that exist in traditional matrix factorization based collaborative filtering methods. Moreover, LSMFPRec can significantly reduce the error propagated from intermediate outputs. In addition, the proposed method essentially captures the low-rank and sparse characteristics that exist in scientific rating activities; therefore, it can generate more reasonable predicted ratings for influential and uninfluential papers. The effectiveness of the proposed LSMFPRec is demonstrated by the recommendation evaluation conducted on the AAN and CiteULike data sets.

With the rapid growth of scientific publications, research paper recommendation which suggests relevant research papers to users can bring great benefits to researchers. In this paper, we focus on the problem of recommending conference papers to the conference attendees. While most of the related existing methods depend on the content-based filtering, we propose a unified conference paper recommendation method named $CPRec$ , which exploits both the contents and the authorship information of the papers. In particular, besides the contents, we exploit the relationships between a user and the authors of a paper for recommendation. In our method, we extract several features for a user-paper pair from the citation network, the coauthor network, and the contents, respectively. In addition, we derive a user’s pairwise preference towards the conference papers from the user’s bookmarked papers in each conference. Furthermore, we employ a pairwise learning to rank model which exploits the pairwise user preference to learn a function that predicts a user’s preference towards a paper based on the extracted features. We conduct a recommendation performance evaluation using real-world data and the experimental results demonstrate the effectiveness of our proposed method.