Search
Now showing items 1-10 of 160
Investigation of substituent effect of 1-(3,3-diphenylpropyl)-piperidinyl phenylacetamides on CCR5 binding affinity using QSAR and virtual screening techniques
(2006)
A linear quantitative-structure activity relationship model is developed in this work using Multiple Linear Regression Analysis as applied to a series of 51 1-(3,3-diphenylpropyl)-piperidinyl phenylacetamides derivatives ...
A combined LS-SVM & MLR QSAR workflow for predicting the inhibition of CXCR3 receptor by quinazolinone analogs
(2010)
AnovelQSARworkflowis constructed that combines MLR with LS-SVM classification techniques for the identification of quinazolinone analogs as "active" or "nonactive" CXCR3 antagonists. The accuracy of the LS-SVM classification ...
A novel QSAR model for predicting induction of apoptosis by 4-aryl-4H-chromenes
(2006)
A linear quantitative structure-activity relationship (QSAR) model is presented for modeling and predicting induction of apoptosis by 4-aryl-4H-chromenes. The model was produced by using the multiple linear regression (MLR) ...
Folk dance evaluation using laban movement analysis
(2015)
Motion capture (mocap) technology is an efficient method for digitizing art performances, and is becoming increasingly popular in the preservation and dissemination of dance performances. Although technically the captured ...
Complexity of rational and irrational Nash equilibria
(2011)
We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
The complexity of decision problems about nash equilibria in win-lose games
(2012)
We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist
Extended semantics and optimization algorithms for CP-networks
(2004)
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more ...
Direct routing: Algorithms and complexity
(2006)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...
Direct routing: Algorithms and complexity
(2004)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
A spiking neuron model: Applications and learning
(2002)
This paper presents a biologically inspired, hardware-realisable spiking neuron model, which we call the Temporal Noisy-Leaky Integrator (TNLI). The dynamic applications of the model as well as its applications in Computational ...