• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 61,700
Next 10 →

Specificity and mechanism of action of some commonly used protein kinase inhibitors

by Stephen P. Davies, Helen Reddy, Matilde Caivano, Philip Cohen - Biochem. J , 2000
"... The specificities of 28 commercially available compounds reported to be relatively selective inhibitors of particular serine� threonine-specific protein kinases have been examined against a large panel of protein kinases. The compounds KT 5720, Rottlerin and quercetin were found to inhibit many prot ..."
Abstract - Cited by 532 (1 self) - Add to MetaCart
protein kinases, sometimes much more potently than their presumed targets, and conclusions drawn from their use in cell-based experiments are likely to be erroneous. Ro 318220 and related bisindoylmaleimides, as well as H89, HA1077 and Y 27632, were more selective inhibitors, but still inhibited two

Context-Aware Computing Applications

by Bill Schilit, Norman Adams, Roy Want , 1995
"... This paper describes systems that examine and react to an individual's changing context. Such systems can promote and mediate people's mleractlOns with devices, computers, and other people, and they can help navigate unfamiliar places. We bel1eve that a lunded amount of information coveTIn ..."
Abstract - Cited by 984 (6 self) - Add to MetaCart
TIng a per'son's proximale environment is most important for this form of com-puting since the interesting part of the world around us is what we can see, hear, and touch. In this paper we define context-aware computing, and describe four cal-egones of conteL·t-aware applications: proximate

K-theory for operator algebras

by Bruce Blackadar - Mathematical Sciences Research Institute Publications , 1998
"... p. XII line-5: since p. 1-2: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The Riesz-Fischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract - Cited by 558 (0 self) - Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von

Grounding in communication

by G. A. Hunt - In , 1991
"... We give a general analysis of a class of pairs of positive self-adjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h-10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator-(d2/A2) + x2 on L2(R, dx) and let ..."
Abstract - Cited by 1122 (20 self) - Add to MetaCart
We give a general analysis of a class of pairs of positive self-adjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h-10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator-(d2/A2) + x2 on L2(R, dx) and let

Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of n-alkanes

by Jean-paul Ryckaert, Giovanni Ciccotti, Herman J. C. Berendsen - J. Comput. Phys , 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract - Cited by 704 (6 self) - Add to MetaCart
(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical

The fundamental properties of natural numbers

by Grzegorz Bancerek - Journal of Formalized Mathematics , 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract - Cited by 688 (73 self) - Add to MetaCart
.html The articles [4], [6], [1], [2], [5], and [3] provide the notation and terminology for this paper. A natural number is an element of N. For simplicity, we use the following convention: x is a real number, k, l, m, n are natural numbers, h, i, j are natural numbers, and X is a subset of R

Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition

by Y. C. Pati, R. Rezaiifar, P. S. Krishnaprasad - in Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers , 1993
"... In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang (199 ..."
Abstract - Cited by 637 (1 self) - Add to MetaCart
recursively. where fk is the current approximation, and Rkf the current residual (error). Using initial values ofR0f = 1, fo = 0, and k = 1, the MP algorithm is comprised of the following steps,.,.41) Compute the inner-products {(Rkf,z)}. (H) Find flki such that (III) Set, I(R*f,1:n 1+,)l asupl

Numerical solution of initial boundary value problems involving Maxwell’s equations in isotropic media

by Kane S. Yee - IEEE Trans. Antennas and Propagation , 1966
"... The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 1158-1165, Deinterface which separates a semi-infinite region of free cember 1954. space from that of a magnetoionic medium are in ..."
Abstract - Cited by 1048 (0 self) - Add to MetaCart
The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 1158-1165, Deinterface which separates a semi-infinite region of free cember 1954. space from that of a magnetoionic medium

A Theory of Program Size Formally Identical to Information Theory

by Gregory J. Chaitin , 1975
"... A new definition of program-size complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest self-delimiting program for calculating strings A and B if one is given a minimal-size selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) ..."
Abstract - Cited by 380 (15 self) - Add to MetaCart
concept of information theory. For example, H(A;B) = H(A) + H(B=A) + O(1). Also, if a program of length k is assigned measure 2 \Gammak , then H(A) = \Gamma log 2 (the probability that the standard universal computer will calculate A) +O(1). Key Words and Phrases: computational complexity, entropy

On the bursty evolution of Blogspace

by Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins , 2003
"... O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +%&P &.F0, )& ;)S O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +% # O,<&7& =1 P &7"U;(Z ;>A@CB;D,[\D]K,D?^_ B`Bba]@C>Ac >AG8H$^2d)@C]E 9='0,*+82 &e " & Q (T0 U;Ub%&7*',#$ %& :3 Q ..."
Abstract - Cited by 365 (8 self) - Add to MetaCart
Q+ #$ f" L ;&Vg"L0 ,M' (Fhji_E KkI+H$^2D9" 0 O (` lV P gmA)fn i_E K/o3qpr%+N8%+*s&#$ V# t /M- &U5u 7*wv x)y z{V&.+L U; P| x)z}l P 3~10/)O&U; P)2 "; b" l P l*` 5)% U5u&0 =)7*& ( U; 28900-33320 3 &U;r82 U; 3!j" L8%=+*b
Next 10 →
Results 1 - 10 of 61,700
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University