Discovering Complex Relationships of Drugs over Distributed Knowledgebases

Author(s):  
Juan Li ◽  
Ranjana Sharma ◽  
Yan Bai

Drug discovery is a lengthy, expensive and difficult process. Indentifying and understanding the hidden relationships among drugs, genes, proteins, and diseases will expedite the process of drug discovery. In this paper, we propose an effective methodology to discover drug-related semantic relationships over large-scale distributed web data in medicine, pharmacology and biotechnology. By utilizing semantic web and distributed system technologies, we developed a novel hierarchical knowledge abstraction and an efficient relation discovery protocol. Our approach effectively facilitates the realization of the full potential of harnessing the collective power and utilization of the drug-related knowledge scattered over the Internet.

Author(s):  
Juan Li ◽  
Ranjana Sharma ◽  
Yan Bai

Drug discovery is a lengthy, expensive and difficult process. Indentifying and understanding the hidden relationships among drugs, genes, proteins, and diseases will expedite the process of drug discovery. In this paper, we propose an effective methodology to discover drug-related semantic relationships over large-scale distributed web data in medicine, pharmacology and biotechnology. By utilizing semantic web and distributed system technologies, we developed a novel hierarchical knowledge abstraction and an efficient relation discovery protocol. Our approach effectively facilitates the realization of the full potential of harnessing the collective power and utilization of the drug-related knowledge scattered over the Internet.


Author(s):  
Ewiena Bivie Anak Apon ◽  
Cik Feresa Mohd Foozy ◽  
Palaniappan Shamala

Over the Internet today, communication environment is more easy and interesting to the citizen. There are much interesting in modern technology when they provided a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. The important objective of this article is getting information about comparison of two distributed system in messenger application. Messenger application is known as a tool communication that can get any information. The distributed system is one of the independent and single coherent systems it was built an application that will be informed that section is being fixed or replaces to serve more applications or users. The distributed system for this article about the comparison of two distributed system in messenger application for WeChat and Whatsapp, it is also known as the famous application for this generations nowadays.


2009 ◽  
Author(s):  
Eyal Oren ◽  
Spyros Kotoulas ◽  
George Anadiotis ◽  
Ronny Siebes ◽  
Annette ten Teije ◽  
...  

Author(s):  
Ismail Nadim ◽  
Yassine El ghayam ◽  
Abdelalim Sadiq

<p class="western" style="margin-top: 0.21cm; margin-bottom: 0cm;" lang="en-US" align="justify"><span style="color: #000000;"><span style="font-size: small;">Information and communication technologies (ICT) know a significant development especially in terms of hardware miniaturization, cost reduction and energy consumption optimization. This advancement enables the interconnection of a large number of physical objects namely using the Internet, forming what is called the Internet of Things (IoT). The IoT provides the opportunity to interact with these objects through sensors, actuators and smart applications which may help users in several areas such as transport, logistics, health care, agriculture, etc. However, building the IoT requires a strong interoperability between thousands of heterogeneous devices and services. In this context, the SWoT (Semantic Web of Things) uses semantic Web technologies to enrich these devices and services with semantic annotations which enables the semantic interoperability. However, the development of SWOT-based systems on a large scale faces many challenges especially due to the large number of devices and services, their geographical distribution as well as their mobility. These challenges - which may affect the system performance as a whole - require innovative industry and research efforts. The current paper proposes a SWoT framework architecture that take into account the main SWoT challenges.</span></span></p>


2009 ◽  
Vol 7 (4) ◽  
pp. 305-316 ◽  
Author(s):  
Eyal Oren ◽  
Spyros Kotoulas ◽  
George Anadiotis ◽  
Ronny Siebes ◽  
Annette ten Teije ◽  
...  

2020 ◽  
Vol 11 (2) ◽  
pp. 103
Author(s):  
Ardha Perwiradewa ◽  
Ahmad Naufal Rofiif ◽  
Nur Aini Rakhmawati

Abstract. Visualization of Indonesian Football Players on DBpedia through Node2Vec and Closeness Centrality Implementation. Through Semantic Web, data available on the internet are connected in a large graph. Those data are still raw so that they need to be processed to be an information that can help humans. This research aims to process and analyze the Indonesian soccer player graph by implementing node2vec and closeness centrality algorithm. The graph is modeled through a dataset obtained from the DBpedia by performing a SPARQL query on the SPARQL endpoint. The results of the Node2vec algorithm and closeness centrality are visualized for further analysis. Visualization of node2vec shows that the defenders are distributed over the players. Meanwhile, the result of closeness centrality shows that the strikers have the highest centrality score compared to other positions.Keywords: visualization, node2vec, closeness centralityAbstrak. Dengan adanya web semantik, data yang tersebar di internet dapat saling terhubung dan membentuk suatu graf. Data yang ada pada graf tersebut masih berupa data mentah sehingga perlu dilakukan pengolahan agar data mentah tersebut dapat menjadi informasi yang dapat membantu manusia. Penelitian ini bertujuan untuk melakukan pengolahan dan analisis terhadap graf pemain sepak bola Indonesia dengan mengimplementasikan algoritma node2vec dan closeness centrality. Graf dimodelkan melalui dataset yang didapat dari website DBpedia dengan cara melakukan query SPARQL pada SPARQL endpoint. Hasil dari algoritma node2vec dan closeness centrality divisualisasikan untuk dianalisis. Visualisasi dari node2vec menunjukkan pemain defender tersebar. Hasil closeness centrality menunjukkan bahwa pemain striker memiliki nilai tertinggi daripada posisi lainnya.Kata Kunci: visualisasi, node2vec, closeness centrality


Author(s):  
Danica Damljanovic ◽  
Vladan Devedžic

Offering tourist services on the Internet has become a great business over the past few years. Heung (2003) revealed that approximately 30% of travelers use the Internet for reservation or purchase of travel products or services. Classic sites of tourist agencies enable users to view and search for certain destinations and book and pay for vacation packages. At a higher level of sophistication are tourism Web portals, which integrate the offers of many tourist agencies and enable searching from one point on the Web. Still, when using this kind of systems one is forced to spend a lot of time analyzing Web content with destinations that match his/her wishes. This problem is identified by Hepp, Siorpaes and Bachlechner (2006) as the “needle in the haystack” problem. Applying artificial intelligence (AI) techniques in E-tourism could help resolve this problem by providing: 1. Data that are semantically enriched, structured, and thus represented in a machine readable form; 2. Easy integration of tourist sources from different applications; 3. Personalization of sites: the content can be created according to the user profile; 4. Improved system interactivity. As an example of using AI in e-tourism, we present Travel Guides—a prototype system that offers tourists complete information about numerous destinations. They can search destinations by using several criteria (e.g., accommodation type, food service, budget, activities during vacation, and user interests: sports, shopping, clubbing, art, museum, monuments, etc.). He/She can also read about the weather forecast and events in the destination. In a way, Travel Guides complements traditional information systems of tourist agencies. These systems require a lot of maintenance effort in order to keep the huge amount of data about tourist destinations up-to-date. Travel Guides is created to minimize the user’s input and his/her need to filter information. It shows how usage of semantically enriched data in a machine readable form can Increase interoperability in the area of tourism, Decrease maintenance efforts of tourist agents, and Offer tourists a better service. Nowadays, there are just a few e-tourism systems that use AI techniques. We briefly discuss them in the next section. In this article, we explain why it would be good to use such techniques and how Travel Guides does it. Specifically, using Semantic Web technologies in the area of tourism can improve already existing systems (which are mostly available online) that do not use Semantic Web techniques yet. Likewise, the Semantic Web approach can help decrease the maintenance efforts required for existing e-tourism systems and ease the process of searching for vacation packages. Travel Guides was initially developed as a large-scale expert system. Over time, it has evolved into a modern Semantic Web application.


Author(s):  
Christina Schindler ◽  
Hannah Baumann ◽  
Andreas Blum ◽  
Dietrich Böse ◽  
Hans-Peter Buchstaller ◽  
...  

Here we present an evaluation of the binding affinity prediction accuracy of the free energy calculation method FEP+ on internal active drug discovery projects and on a large new public benchmark set.<br>


2019 ◽  
Author(s):  
Kyle Konze ◽  
Pieter Bos ◽  
Markus Dahlgren ◽  
Karl Leswing ◽  
Ivan Tubert-Brohman ◽  
...  

We report a new computational technique, PathFinder, that uses retrosynthetic analysis followed by combinatorial synthesis to generate novel compounds in synthetically accessible chemical space. Coupling PathFinder with active learning and cloud-based free energy calculations allows for large-scale potency predictions of compounds on a timescale that impacts drug discovery. The process is further accelerated by using a combination of population-based statistics and active learning techniques. Using this approach, we rapidly optimized R-groups and core hops for inhibitors of cyclin-dependent kinase 2. We explored greater than 300 thousand ideas and identified 35 ligands with diverse commercially available R-groups and a predicted IC<sub>50</sub> < 100 nM, and four unique cores with a predicted IC<sub>50</sub> < 100 nM. The rapid turnaround time, and scale of chemical exploration, suggests that this is a useful approach to accelerate the discovery of novel chemical matter in drug discovery campaigns.


Sign in / Sign up

Export Citation Format

Share Document