Results 281 to 290 of about 22,742,041 (354)
Some of the next articles are maybe not open access.
Reduced access, reduced choice, reduced transparency
Business Information Review, 2012Information acquisition and use have been transformed by the internet. An enormous range of resources are more widely available than ever before, contributing to the perception that all information is available on the web. Many internet users complain of 'information surfeit', an inability to negotiate the vast volume of information at their fingertips.
Jacqueline Beattie, Amy Spiegel
openaire +1 more source
The American Journal of Nursing, 1925
know Sairey Gamp, the famous Dickens character, who stood as a type of her profession during the early part of the 19th Century? Two qualifications appeared to be desirable at that time. The popular conception of a nurse was a woman well along in years and usually fat.
openaire +1 more source
know Sairey Gamp, the famous Dickens character, who stood as a type of her profession during the early part of the 19th Century? Two qualifications appeared to be desirable at that time. The popular conception of a nurse was a woman well along in years and usually fat.
openaire +1 more source
European Urology, 2010
This trial investigated the value of the dual-action 5a-reductase inhibitor dutasteride (GlaxoSmithKline, Middlesex, UK) in 8231 men with prostate-specific antigen (PSA) values between 2.5 and 10 ng/ml who had undergone previous negative biopsies. Of these men, 6729 had at least one biopsy and were analyzed and presented as what the authors called the ‘
Schröder, Fritz +1 more
openaire +2 more sources
This trial investigated the value of the dual-action 5a-reductase inhibitor dutasteride (GlaxoSmithKline, Middlesex, UK) in 8231 men with prostate-specific antigen (PSA) values between 2.5 and 10 ng/ml who had undergone previous negative biopsies. Of these men, 6729 had at least one biopsy and were analyzed and presented as what the authors called the ‘
Schröder, Fritz +1 more
openaire +2 more sources
Heart Failure With Reduced Ejection Fraction: A Review.
Journal of the American Medical Association (JAMA), 2020Importance Worldwide, the burden of heart failure has increased to an estimated 23 million people, and approximately 50% of cases are HF with reduced ejection fraction (HFrEF).
Sean P. Murphy +2 more
semanticscholar +1 more source
MLQ, 2000
In this paper the author studies computational relationships between a relation \(R\) and a countable model \({\mathcal A}\) which are not disturbed by isomorphisms. Let \({\mathcal A}\) be a countable model, and let \(R\) be an extra unary relation on \({\mathcal A}\). Let \(\leq_0\) be a reducibility, and \(k\in\omega\). Then \(R\) is intrisically \(\
openaire +3 more sources
In this paper the author studies computational relationships between a relation \(R\) and a countable model \({\mathcal A}\) which are not disturbed by isomorphisms. Let \({\mathcal A}\) be a countable model, and let \(R\) be an extra unary relation on \({\mathcal A}\). Let \(\leq_0\) be a reducibility, and \(k\in\omega\). Then \(R\) is intrisically \(\
openaire +3 more sources
ACM SIGSAM Bulletin, 1985
This paper deals with some distinctive characteristics of the REDUCE-2 computer algebra system operating in interactive mode. A brief description of a new version of the system with extended interactive capabilities is presented.
Alexander P. Kryukov, A. Ya. Rodionov
openaire +1 more source
This paper deals with some distinctive characteristics of the REDUCE-2 computer algebra system operating in interactive mode. A brief description of a new version of the system with extended interactive capabilities is presented.
Alexander P. Kryukov, A. Ya. Rodionov
openaire +1 more source
REDUCIBILITY AND UNIFORM REDUCIBILITY OF ALGEBRAIC OPERATIONS
Mathematics of the USSR-Sbornik, 1974This paper is devoted to a study of the conditions under which one algebraic operation can be expressed in terms of others by some arrangement of parentheses. The terminology is mainly that of Frenkin (MR 44 #6888). It is shown that the class of ?-reducible n-groupoids is axiomatizable, but not elementary, and the class of ?-uniformly reducible n ...
openaire +2 more sources
Periodica Mathematica Hungarica, 2000
In general, to decide if a given polynomial is irreducible or not is a difficult problem, however, several results have been established for families of polynomials. Among those results, one finds Capelli's theorem, see \textit{A. Schinzel} [Polynomials with special regard to reducibility, Encyclopedia of Mathematics and its Applications 77, Cambridge ...
openaire +3 more sources
In general, to decide if a given polynomial is irreducible or not is a difficult problem, however, several results have been established for families of polynomials. Among those results, one finds Capelli's theorem, see \textit{A. Schinzel} [Polynomials with special regard to reducibility, Encyclopedia of Mathematics and its Applications 77, Cambridge ...
openaire +3 more sources
Mathematical Logic Quarterly, 2020
AbstractWe introduce agreement reducibility and highlight its major features. Given subsets A and B of , we write if there is a total computable function satisfying for all , .We shall discuss the central role plays in this reducibility and its connection to strong‐hyper‐hyper‐immunity.
Rachel Epstein, Karen M. Lange
openaire +3 more sources
AbstractWe introduce agreement reducibility and highlight its major features. Given subsets A and B of , we write if there is a total computable function satisfying for all , .We shall discuss the central role plays in this reducibility and its connection to strong‐hyper‐hyper‐immunity.
Rachel Epstein, Karen M. Lange
openaire +3 more sources
Journal of Optimization Theory and Applications, 2007
The notions of exhaustive families of upper convex and lower concave approximations (in the sense of B. N. Pschenichnyi) were introduced by A. M. Rubinov. For some classes of nonsmooth functions, these tools appeared to be very productive and constructive.
openaire +2 more sources
The notions of exhaustive families of upper convex and lower concave approximations (in the sense of B. N. Pschenichnyi) were introduced by A. M. Rubinov. For some classes of nonsmooth functions, these tools appeared to be very productive and constructive.
openaire +2 more sources