SoroushVahidi/scidocs huggingface dataset:
Drug delivery and nanoparticles: Applications and hazards
(2008)

The use of nanotechnology in medicine and more specifically drug delivery is set to spread rapidly. Currently many substances are under investigation for drug delivery and more specifically for cancer therapy. Interestingly pharmaceutical sciences are using nanoparticles to reduce toxicity and side effects of drugs and up to recently did not realize that carrier systems themselves may impose risks to the patient. The kind of hazards that are introduced by using nanoparticles for drug delivery are beyond that posed by conventional hazards imposed by chemicals in classical delivery matrices. For nanoparticles the knowledge on particle toxicity as obtained in inhalation toxicity shows the way how to investigate the potential hazards of nanoparticles. The toxicology of particulate matter differs from toxicology of substances as the composing chemical(s) may or may not be soluble in biological matrices, thus influencing greatly the potential exposure of various internal organs. This may vary from a rather high local exposure in the lungs and a low or neglectable exposure for other organ systems after inhalation. However, absorbed species may also influence the potential toxicity of the inhaled particles. For nanoparticles the situation is different as their size opens the potential for crossing the various biological barriers within the body. From a positive viewpoint, especially the potential to cross the blood brain barrier may open new ways for drug delivery into the brain. In addition, the nanosize also allows for access into the cell and various cellular compartments including the nucleus. A multitude of substances are currently under investigation for the preparation of nanoparticles for drug delivery, varying from biological substances like albumin, gelatine and phospholipids for liposomes, and more substances of a chemical nature like various polymers and solid metal containing nanoparticles. It is obvious that the potential interaction with tissues and cells, and the potential toxicity, greatly depends on the actual composition of the nanoparticle formulation. This paper provides an overview on some of the currently used systems for drug delivery. Besides the potential beneficial use also attention is drawn to the questions how we should proceed with the safety evaluation of the nanoparticle formulations for drug delivery. For such testing the lessons learned from particle toxicity as applied in inhalation toxicology may be of use. Although for pharmaceutical use the current requirements seem to be adequate to detect most of the adverse effects of nanoparticle formulations, it can not be expected that all aspects of nanoparticle toxicology will be detected. So, probably additional more specific testing would be needed.
Efficient mining of weighted association rules (WAR)
(2000)

ABSTRACT In this paper, we extend the tradition association rule problem by allowing a weight to be associated with each item in a transaction, to re ect interest/intensity of the item within the transaction. This provides us in turn with an opportunity to associate a weight parameter with each item in the resulting association rule. We call it weighted association rule (WAR). WAR not only improves the con dence of the rules, but also provides a mechanism to do more effective target marketing by identifying or segmenting customers based on their potential degree of loyalty or volume of purchases. Our approach mines WARs by rst ignoring the weight and nding the frequent itemsets (via a traditional frequent itemset discovery algorithm), and is followed by introducing the weight during the rule generation. It is shown by experimental results that our approach not only results in shorter average execution times, but also produces higher quality results than the generalization of previous known methods on quantitative association rules.
Fuzzy Neural Network-Based Adaptive Control for a Class of Uncertain Nonlinear Stochastic Systems
(2014)

This paper studies an adaptive tracking control for a class of nonlinear stochastic systems with unknown functions. The considered systems are in the nonaffine pure-feedback form, and it is the first to control this class of systems with stochastic disturbances. The fuzzy-neural networks are used to approximate unknown functions. Based on the backstepping design technique, the controllers and the adaptation laws are obtained. Compared to most of the existing stochastic systems, the proposed control algorithm has fewer adjustable parameters and thus, it can reduce online computation load. By using Lyapunov analysis, it is proven that all the signals of the closed-loop system are semiglobally uniformly ultimately bounded in probability and the system output tracks the reference signal to a bounded compact set. The simulation example is given to illustrate the effectiveness of the proposed control algorithm.
Detecting Avocados to Zucchinis: What Have We Done, and Where Are We Going?
(2013)

The growth of detection datasets and the multiple directions of object detection research provide both an unprecedented need and a great opportunity for a thorough evaluation of the current state of the field of categorical object detection. In this paper we strive to answer two key questions. First, where are we currently as a field: what have we done right, what still needs to be improved? Second, where should we be going in designing the next generation of object detectors? Inspired by the recent work of Hoiem et al. on the standard PASCAL VOC detection dataset, we perform a large-scale study on the Image Net Large Scale Visual Recognition Challenge (ILSVRC) data. First, we quantitatively demonstrate that this dataset provides many of the same detection challenges as the PASCAL VOC. Due to its scale of 1000 object categories, ILSVRC also provides an excellent test bed for understanding the performance of detectors as a function of several key properties of the object classes. We conduct a series of analyses looking at how different detection methods perform on a number of image-level and object-class-level properties such as texture, color, deformation, and clutter. We learn important lessons of the current object detection methods and propose a number of insights for designing the next generation object detectors.
DFD: Efficient Functional Dependency Discovery
(2014)

The discovery of unknown functional dependencies in a dataset is of great importance for database redesign, anomaly detection and data cleansing applications. However, as the nature of the problem is exponential in the number of attributes none of the existing approaches can be applied on large datasets. We present a new algorithm DFD for discovering all functional dependencies in a dataset following a depth-first traversal strategy of the attribute lattice that combines aggressive pruning and efficient result verification. Our approach is able to scale far beyond existing algorithms for up to 7.5 million tuples, and is up to three orders of magnitude faster than existing approaches on smaller datasets.
Database Dependency Discovery: A Machine Learning Approach
(1999)

Database dependencies, such as functional and multivalued dependencies, express the presence of structure in databas e relations, that can be utilised in the database design proce ss. The discovery of database dependencies can be viewed as an induction problem, in which general rules (dependencies) a re obtained from specific facts (the relation). This viewpoint has the advantage of abstracting away as much as possible from the particulars of the dependencies. The algorithms in this paper are designed such that they can easily be generalised to other kinds of dependencies. Like in current approaches to computational induction such as inductive logic programming, we distinguish between top down algorithms and bottom-up algorithms. In a top-down approach, hypotheses are generated in a systematic way and then tested against the given relation. In a bottom-up approach, the relation is inspected in order to see what dependencies it may satisfy or violate. We give algorithms for bot h approaches.
GORDIAN: Efficient and Scalable Discovery of Composite Keys
(2006)

Identification of (composite) key attributes is of fundamental importance for many different data management tasks such as data modeling, data integration, anomaly detection, query formulation, query optimization, and indexing. However, information about keys is often missing or incomplete in many real-world database scenarios. Surprisingly, the fundamental problem of automatic key discovery has received little attention in the existing literature. Existing solutions ignore composite keys, due to the complexity associated with their discovery. Even for simple keys, current algorithms take a brute-force approach; the resulting exponential CPU and memory requirements limit the applicability of these methods to small datasets. In this paper, we describe GORDIAN, a scalable algorithm for automatic discovery of keys in large datasets, including composite keys. GORDIAN can provide exact results very efficiently for both real-world and synthetic datasets. GORDIAN can be used to find (composite) key attributes in any collection of entities, e.g., key column-groups in relational data, or key leaf-node sets in a collection of XML documents with a common schema. We show empirically that GORDIAN can be combined with sampling to efficiently obtain high quality sets of approximate keys even in very large datasets.
Logic and Databases: A Deductive Approach
(1984)

ion, Databases and Conceptual Modeling (Pingree Park, Colo., June), pp. 112-114; ACM SZGMOD Rec. 11, 2 (Feb.). CODD, E. F. 1982. Relational database: A practical foundation for productivity. Commun. ACM 25, 2 (Feb.), 109-117. COLMERAUER, A. 1973. Un systeme de communication homme-machine en francais. Rapport, Groupe Intelligence Artificielle, Universite d’AixMarseille-Luminy, Marseilles, France. COLMERAUER, A., AND PIQUE, J. F. 1981. About natural logic. In Advances in Database Theory vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 343-365. COOPER, E. C. 1980. On the expressive power of query languages for relational databases. Tech. Rep. 14-80, Computer Science Dept., Harvard Univ., Cambridge, Mass. DAHL, V. 1982. On database systems development through logic. ACM Trans. Database Syst. 7, 1 (Mar.), 102-123. DATE, C. J. 1977. An Introduction to Database Systems. Addison-Wesley, Reading, Mass. DATE, C. J. 1981. An Introduction to Database Systems, 3rd ed. Addison-Wesley, Reading, Mass. DELIYANNI, A., AND KOWALSKI, R. A. 1979. Logic and semantic networks. Commun. ACM 22, 3
Regional cerebral blood flow correlates of visuospatial tasks in Alzheimer's disease.
(2008)

This study investigated the role of visuospatial tasks in identifying cognitive decline in patients with Alzheimer's disease (AD), by correlating neuropsychological performance with cerebral perfusion measures. There were 157 participants: 29 neurologically healthy controls (age: 70.3 +/- 6.6, MMSE > or = 27), 86 patients with mild AD (age: 69.18 +/- 8.28, MMSE > or = 21) and 42 patients moderate/severe AD (age: 68.86 +/- 10.69, MMSE 8-20). Single Photon Emission Computerized Tomography (SPECT) was used to derive regional perfusion ratios, and correlated using partial least squares (PLS) with neuropsychological test scores from the Benton Line Orientation (BLO) and the Rey-Osterrieth Complex Figure (RO). Cross-sectional analysis demonstrated that mean scores differed in accordance with disease status: control group (BLO 25.5, RO 33.3); mild AD (BLO 20.1, RO 25.5); moderate/severe AD (BLO 10.7, RO 16). Correlations were observed between BLO/RO and right parietal SPECT regions in the AD groups. Visuospatial performance, often undersampled in cognitive batteries for AD, is clearly impaired even in mild AD and correlates with functional deficits as indexed by cerebral perfusion ratios on SPECT implicating right hemisphere circuits. Furthermore, PLS reveals that usual spatial tasks probe a distributed brain network in both hemispheres including many areas targeted by early AD pathology.
Articulatory , positional and coarticulatory characteristics for clear / l / and dark / l / : evidence from two Catalan dialects
(2005)

Electropalatographic and acoustic data reported in this study show differences in closure location and degree, dorsopalatal contact size, closure duration, relative timing of events and formant frequency between clear /l/ and dark /l/ in two dialects of Catalan (Valencian and Majorcan). The two Catalan dialects under investigation differ also regarding degree of darkness but essentially not regarding coarticulatory resistance at the word edges, i.e. the alveolar lateral is equally dark word-initially and word-finally in Majorcan, and clearer in the former position vs. than the latter in Valencian, and more resistant to vowel effects in the two positions than intervocalically in both dialects. With reference to data from the literature, it appears that languages and dialects may differ as to whether /l/ is dark or clear in all word positions or whether or not initial /l/ is clearer than final /l/, and that articulatory strengthening occurs not only wordand utterance-initially but wordand utterance-finally as well. These and other considerations confirm the hypothesis that degree of darkness in /l/ proceeds gradually rather than categorically from one language to another.
Risk factors for involvement in cyber bullying : Victims , bullies and bully – victims ☆
(2011)

The use of online technology is exploding worldwide and is fast becoming a preferred method of interacting. While most online interactions are neutral or positive the Internet provides a new means through which children and youth are bullied. The aim of this grounded theory approach was to explore technology, virtual relationships and cyber bullying from the perspectives of students. Seven focus groups were held with 38 students between fifth and eighth grades. The participants considered cyber bullying to be a serious problem and some characterized online bullying as more serious than  ̳traditional‘ bullying because of the associated anonymity. Although the students depicted anonymity as integral to cyber bullying, the findings suggest that much of the cyber bullying occurred within the context of their social groups and relationships. Findings revealed five major themes: technology embraced at younger ages and becoming the dominant medium for communication; definitions and views of cyber bullying; factors unique to cyber bullying; types of cyber bullying; and telling adults. The findings highlight the complexity of the perceived anonymity provided by the Internet and how AC C EP TE D M AN U SC R IP T ACCEPTED MANUSCRIPT 3 this may impact cyber bullying. The study offers greater awareness of the meanings of online relationships for children and youth.
The Gut Microbiota and Autism Spectrum Disorders
(2017)

Gastrointestinal (GI) symptoms are a common comorbidity in patients with autism spectrum disorder (ASD), but the underlying mechanisms are unknown. Many studies have shown alterations in the composition of the fecal flora and metabolic products of the gut microbiome in patients with ASD. The gut microbiota influences brain development and behaviors through the neuroendocrine, neuroimmune and autonomic nervous systems. In addition, an abnormal gut microbiota is associated with several diseases, such as inflammatory bowel disease (IBD), ASD and mood disorders. Here, we review the bidirectional interactions between the central nervous system and the gastrointestinal tract (brain-gut axis) and the role of the gut microbiota in the central nervous system (CNS) and ASD. Microbiome-mediated therapies might be a safe and effective treatment for ASD.
Compiling Knowledge into Decomposable Negation Normal Form
(1999)

We propose a method for compiling proposit ional theories into a new tractable form that we refer to as decomposable negation normal form (DNNF). We show a number of results about our compilation approach. First, we show that every propositional theory can be compiled into D N N F and present an algorithm to this effect. Second, we show that if a clausal form has a bounded treewidth, then its DNNF compilation has a linear size and can be computed in linear t ime — treewidth is a graphtheoretic parameter which measures the connectivity of the clausal form. Th i rd , we show that once a propositional theory is compiled into DNNF, a number of reasoning tasks, such as satisfiability and forgett ing, can be performed in linear t ime. Finally, we propose two techniques for approximating the DNNF compilat ion of a theory when the size of such compilation is too large to be practical. One of the techniques generates a sound but incomplete compilation, while the other generates a complete but unsound compilation. Together, these approximations bound the exact compilation from below and above in terms for their abil i ty to answer queries.
Object volume estimation based on 3D point cloud
(2017)

An approach to estimating the volume of an object based on 3D point cloud is proposed in this paper. Firstly, 3D point cloud is cut into slices of equal thickness along the z-axis. Bisect each slice along the y-axis and cut each slice into sub-intervals along the x-axis. Using the minimum and maximum coordinates in each sub-interval, two surface curve functions can be fitted accordingly for the bisected slices. Then, the curves are integrated to estimate the area of each slice and further integrated along the z-axis for an estimated volume of the object.
Auto-Encoding User Ratings via Knowledge Graphs in Recommendation Scenarios
(2017)

In the last decade, driven also by the availability of an unprecedented computational power and storage capabilities in cloud environments, we assisted to the proliferation of new algorithms, methods, and approaches in two areas of artificial intelligence: knowledge representation and machine learning. On the one side, the generation of a high rate of structured data on the Web led to the creation and publication of the so-called knowledge graphs. On the other side, deep learning emerged as one of the most promising approaches in the generation and training of models that can be applied to a wide variety of application fields. More recently, autoencoders have proven their strength in various scenarios, playing a fundamental role in unsupervised learning. In this paper, we instigate how to exploit the semantic information encoded in a knowledge graph to build connections between units in a Neural Network, thus leading to a new method, SEM-AUTO, to extract and weight semantic features that can eventually be used to build a recommender system. As adding content-based side information may mitigate the cold user problems, we tested how our approach behaves in the presence of a few ratings from a user on the Movielens 1M dataset and compare results with BPRSLIM.
3D Deep Learning for Efficient and Robust Landmark Detection in Volumetric Data
(2015)

Recently, deep learning has demonstrated great success in computer vision with the capability to learn powerful image features from a large training set. However, most of the published work has been confined to solving 2D problems, with a few limited exceptions that treated the 3D space as a composition of 2D orthogonal planes. The challenge of 3D deep learning is due to a much larger input vector, compared to 2D, which dramatically increases the computation time and the chance of over-fitting, especially when combined with limited training samples (hundreds to thousands), typical for medical imaging applications. To address this challenge, we propose an efficient and robust deep learning algorithm capable of full 3D detection in volumetric data. A two-step approach is exploited for efficient detection. A shallow network (with one hidden layer) is used for the initial testing of all voxels to obtain a small number of promising candidates, followed by more accurate classification with a deep network. In addition, we propose two approaches, i.e., separable filter decomposition and network sparsification, to speed up the evaluation of a network. To mitigate the over-fitting issue, thereby increasing detection robustness, we extract small 3D patches from a multi-resolution image pyramid. The deeply learned image features are further combined with Haar wavelet features to increase the detection accuracy. The proposed method has been quantitatively evaluated for carotid artery bifurcation detection on a head-neck CT dataset from 455 patients. Compared to the state-ofthe-art, the mean error is reduced by more than half, from 5.97 mm to 2.64 mm, with a detection speed of less than 1 s/volume.
Residual Memory Networks in Language Modeling: Improving the Reputation of Feed-Forward Networks
(2017)

We introduce the Residual Memory Network (RMN) architecture to language modeling. RMN is an architecture of feedforward neural networks that incorporates residual connections and time-delay connections that allow us to naturally incorporate information from a substantial time context. As this is the first time RMNs are applied for language modeling, we thoroughly investigate their behaviour on the well studied Penn Treebank corpus. We change the model slightly for the needs of language modeling, reducing both its time and memory consumption. Our results show that RMN is a suitable choice for small-sized neural language models: With test perplexity 112.7 and as few as 2.3M parameters, they out-perform both a much larger vanilla RNN (PPL 124, 8M parameters) and a similarly sized LSTM (PPL 115, 2.08M parameters), while being only by less than 3 perplexity points worse than twice as big LSTM.
Author Disambiguation in PubMed: Evidence on the Precision and Recall of Author-ity among NIH-Funded Scientists
(2016)

We examined the usefulness (precision) and completeness (recall) of the Author-ity author disambiguation for PubMed articles by associating articles with scientists funded by the National Institutes of Health (NIH). In doing so, we exploited established unique identifiers-Principal Investigator (PI) IDs-that the NIH assigns to funded scientists. Analyzing a set of 36,987 NIH scientists who received their first R01 grant between 1985 and 2009, we identified 355,921 articles appearing in PubMed that would allow us to evaluate the precision and recall of the Author-ity disambiguation. We found that Author-ity identified the NIH scientists with 99.51% precision across the articles. It had a corresponding recall of 99.64%. Precision and recall, moreover, appeared stable across common and uncommon last names, across ethnic backgrounds, and across levels of scientist productivity.
Motion planning based on learning models of pedestrian and driver behaviors
(2016)

Autonomous driving has shown the capability of providing driver convenience and enhancing safety. While introducing autonomous driving into our current traffic system, one significant issue is to make the autonomous vehicle be able to react in the same way as real human drivers. In order to ensure that an autonomous vehicle of the future will perform like human drivers, this paper proposes a vehicle motion planning model, which can represent how drivers control vehicles based on the assessment of traffic environments in the real signalized intersection. The proposed motion planning model comprises functions of pedestrian intention detection, gap detection and vehicle dynamic control. The three functions are constructed based on the analysis of actual data collected from real traffic environments. Finally, this paper demonstrates the performance of the proposed method by comparing the behaviors of our model with the behaviors of real pedestrians and human drivers. The experimental results show that our proposed model can achieve 85% recognition rate for the pedestrian crossing intention. Moreover, the vehicle controlled by the proposed motion planning model and the actual human-driven vehicle are highly similar with respect to the gap acceptance in intersections.