136 research outputs found
Levit, Martin , ed., Curriculum . Urbana, IL: University of Illinois Press, 1971.
No full textContains 27 essays in three sections: aims, the disciplines, and curriculum as a field of study
A LeViT–EfficientNet-Based Feature Fusion Technique for Alzheimer’s Disease Diagnosis
No full textAlzheimer’s disease (AD) is a progressive neurodegenerative condition. It causes cognitive impairment and memory loss in individuals. Healthcare professionals face challenges in detecting AD in its initial stages. In this study, the author proposed a novel integrated approach, combining LeViT, EfficientNet B7, and Dartbooster XGBoost (DXB) models to detect AD using magnetic resonance imaging (MRI). The proposed model leverages the strength of improved LeViT and EfficientNet B7 models in extracting high-level features capturing complex patterns associated with AD. A feature fusion technique was employed to select crucial features. The author fine-tuned the DXB using the Bayesian optimization hyperband (BOHB) algorithm to predict AD using the extracted features. Two public datasets were used in this study. The proposed model was trained using the Open Access Series of Imaging Studies (OASIS) Alzheimer’s dataset containing 86,390 MRI images. The Alzheimer’s dataset was used to evaluate the generalization capability of the proposed model. The proposed model obtained an average generalization accuracy of 99.8% with limited computational power. The findings highlighted the exceptional performance of the proposed model in predicting the multiple types of AD. The recommended integrated feature extraction approach has supported the proposed model to outperform the state-of-the-art AD detection models. The proposed model can assist healthcare professionals in offering customized treatment for individuals with AD. The effectiveness of the proposed model can be improved by generalizing it to diverse datasets
On the number of vertices belonging to all maximum stable sets of a graph
No full textAbstractLet us denote by α(G) the size of a maximum stable set, and by μ(G) the size of a maximum matching of a graph G, and let ξ(G) be the number of vertices which belong to all maximum stable sets. We shall show that ξ(G)⩾1+α(G)−μ(G) holds for any connected graph, whenever α(G)>μ(G). This inequality improves on related results by Hammer et al. (SIAM J. Algebraic Discrete Methods 3 (1982) 511) and by Levit and Mandrescu [(prE-print math. CO/9912047 (1999) 13pp.)].We also prove that on one hand, ξ(G)>0 can be recognized in polynomial time whenever μ(G)<|V(G)|/3, and on the other hand determining whether ξ(G)>k is, in general, NP-complete for any fixed k⩾0
Graph theory, computational intelligence and thought: essays dedicated to Martin Charles Golumbic on the occasion of his 60th birthday
No full textPublished to mark the 60th birthday of Martin Charles Golumbic, whose work on algorithmic graph theory and artificial intelligence is widely celebrated, this text contains papers by graduate students, research collaborators, and computer science colleagues
V.I. Vernadsky and the noosphere concept: Russian understandings of society-nature interaction
No full textRecent Russian legislative and policy documentation concerning national progress towards sustainable development has suggested that the attainment of such a state would represent the first stage in the development of the noosphere as outlined by the Russian scientist Vladimir Ivanovich Vernadsky (1863–1945). This paper explores Vernadsky’s model of evolutionary change through a focus on his work on the biosphere and noosphere in an attempt to further understanding of the way in which Russia is approaching the concept of sustainable development in the contemporary period. It is argued that the official Russian interpretation of the noosphere idea tends to obscure the evolutionary and materialist foundations of Vernadsky’s biosphere–noosphere conceptualisation. At the same time, the concluding section of the paper suggests that the scope of Vernadsky’s work can be used to stimulate the search for a more coherent approach to work in areas of sustainable development and sustainability across the span of the social and physical sciences
Der Hals der Giraffe oder: Jean-Baptiste de Lamarck (1744-1829), seine Transformationstheorie sowie die Bedeutung und Wirkungsgeschichte des Lamarckismus in Deutschland
No full text„Lamarckismus“ ist kein Synonym für LAMARCKS Transformationstheorie. Dessen eigenständige Rezeption als Alternative zur Selektionstheorie beginnt im deutschen
Sprachraum erst im Verlauf der 1880er – nach der Übersetzung der Philosophie zoologique 1876, doch primär als Reaktion auf AUGUST WEISMANNS Ultra-Selektionismus. Anders als etwa in den USA repräsentiert der Lamarckismus in Deutschland zwischen 1890 und 1940 eine äußerst heterogene, vielgestaltige evolutionstheoretische Strömung. Die Formel „VEE“ ist ebenso wie „der“ Lamarckismus nichtssagendes Schlagwort – nahezu jeder Lamarckist und jeder Anti-Lamarckist in Deutschland hat sie mit einer spezifischen Bedeutung versehen. Im Kern besagen lamarckistische Evolutionsvorstellungen: Die Umwelt hat im
Evolutionsgeschehen primär induzierende und instruierende Funktion. Stammesgeschichtlicher Formenwandel beginnt mit funktionellen Anpassungen des
Individuums, mit gerichteten Modifikationen ontogenetischer Entwicklungspfade. Erworbene
nichtzufällige entwicklungsrelevante Information ist partiell erblich: die „VEE“ ist funktionelles Brückenglied zwischen Ontogenese und Phylogenese. Die Selektion durch die
Umwelt hat – wenn überhaupt – nur nachrangige Bedeutung für das Evolutionsgeschehen. Durchgehend zwischen 1890 und 1940 reüssiert der Lamarckismus im deutschen Sprachraum vor allem unter Zoologen und Paläontologen, doch auch unter Botanikern. Lamarckistische Konzepte waren hier neben orthogenetischen die bedeutendste Alternative zum Neo-Darwinismus. In Deutschland gewinnt der Lamarckismus seit der Jahrhundertwende zunehmend auch eine gesellschaftspolitische Dimension. Da es in lamarckistischen Evolutionsmodellen das „aktive“ Individuum ist, das die Entwicklung – transgenerational
wirksam – forciert und lenkt, vertreten Lamarckisten typischerweise milieutheoretische Vorstellungen. Es ist kein spezifisches Experiment, keine singuläre wissenschaftliche
Erkenntnis, die dem LAMARCK´schen Denken in Deutschland ein plötzliches, definitives Ende bereitet hätten. Vielmehr verliert das lamarckistische Prinzip in dem Maße an Zustimmung, wie die „harte“ MENDEL- und Populationsgenetik direkt und indirekt erbliche Umweltwirkungen, mithin eine „weiche“ VEE als Quelle erblicher Variabilität überflüssig erscheinen lässt
Why Do Babies Cry: Once Again About Egoism and Altruism
No full textThe article deals with a ratio between egoistic and altruistic components in a person’s motivation and activity. The author provides new interpretations for the widely known examples of altruistic behavior. The results of experimental investigations discovering positive correlations, which exist between egoism and altruism in a person’s daily activity, are quoted. The author touches upon the problem of egoism as a new possible subject of psychology. The incorporation of egoism concept into the structure of modern humanitarian science opens new perspectives for theorizing and experimental investigation
EGOLOGY INSTEAD OF PSYCHOLOGY: WHAT IS WRONG WITH THE GODDESS?
No full textThe article contains a critical analysis of the ancient Greek myth about the goddess Psyche, whose name was given to psychology. The author of the paper demonstrates, that popularity of the given story is determined by the widely spread positive illusions, which are peculiar to human psyche. At the same time, the ideas about the object of psychology, which are based on the ancient myth, are non-adequate from the scientific point of view. They hamper the progress of psychology towards a full-fledged science. The paper proves the necessity and possibility of implementing the term «egoism» as the central notion in the ultimate fundamental theory for modern psychology («egology») and the adjacent sciences, thus building a logical scientific hierarchy «bio-psycho-socio». The arguments under consideration are based on theoretical discourse as well as on experimental results obtained by the author in longitudinal investigations with the help of the ESM techniques. The suggested operation brings multiple benefits for psychology as well as some changes in morality and religion. The author regards that it will help psychology to transform gradually into real scientific discipline and will further scientific progress in general.
Стаття містить критичний аналіз давньогрецького міфу про богиню Психею, ім’я якої дане психології. Автор статті демонструє, що популярність цього оповідання визначається широко поширеними позитивними ілюзіями, які властиві людській психіці. Водночас ідеї про об’єкт психології, що базуються на древньому міфі, є недоцільними з наукової точки зору. Вони перешкоджають руху психології до повноцінної науки. У статті обґрунтовується необхідність і можливість застосування терміну «егоїзм» як центрального поняття в основній фундаментальній теорії сучасної психології («егології») і суміжних науках, що вибудовує логічну наукову ієрархію «біо-психо-соціо». Розглянуті аргументи ґрунтуються як на теоретичному дискурсі, так і на експериментальних результатах, отриманих автором в процесі довготривалих досліджень за допомогою методів ESM. Запропонована операція дає багато переваг для психології, а також для деяких змін у моралі та релігії. Автор вважає, що це допоможе психології поступово трансформуватися у справжню наукову дисципліну і сприятиме науковому прогресу в цілому
 
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition
No full textA graph is well-covered if all its maximal independent sets have the same
cardinality. This well studied concept was introduced by Plummer in 1970 and
naturally generalizes to the weighted case. Given a graph , a real-valued
vertex weight function is said to be a well-covered weighting of if all
its maximal independent sets are of the same weight. The set of all
well-covered weightings of a graph forms a vector space over the field of
real numbers, called the well-covered vector space of . Since the problem of
recognizing well-covered graphs is --complete, the
problem of computing the well-covered vector space of a given graph is
--hard. Levit and Tankus showed in 2015 that the
problem admits a polynomial-time algorithm in the class of claw-free graph. In
this paper, we give two general reductions for the problem, one based on
anti-neighborhoods and one based on modular decomposition, combined with
Gaussian elimination. Building on these results, we develop a polynomial-time
algorithm for computing the well-covered vector space of a given fork-free
graph, generalizing the result of Levit and Tankus. Our approach implies that
well-covered fork-free graphs can be recognized in polynomial time and also
generalizes some known results on cographs.Comment: 25 page
- …
