to design the first polynomial-time (polylog n-times-optimal) approximation algorithms for well-known NP-hard optimization problems such as graph partitioning, min-cut linear arrangement, crossing number, VLSI layout, and minimum feedback arc set. Applications of the flow results to path routing problems

Computing (ratios of) normalizing constants of probability models is a fundamental computational problem for many statistical and scientific studies. Monte Carlo simulation is an effective technique, especially with complex and high-dimensional models. This paper aims to bring to the attention

REsUMo Este trabalho tem como objetivo discutir como conceitos da teoria do conhecimento, particularmente a gnosiologia e a epistemologia, podem contribuir para o estudo das bases filosóficas da terapia cognitiva. Outro objetivo deste trabalho é analisar a influência do construtivismo e do racionalismo crítico no desenvolvimento dos objetivos terapêuticos e das técnicas em terapia cognitiva. Esses objetivos são alcançados a partir da revisão do idealismo transcendental de Kant, do conceito de construtivismo e da influência da psicologia cognitiva na terapia cognitiva. Analisa-se também a terapia cognitiva como uma prática científica, baseada no método hipotético-dedutivo. Nesse sentido, as etapas do processo terapêutico em terapia cognitiva e a aplicabilidade de algumas técnicas cognitivas e comportamentais em cada etapa são analisadas a partir do método hipotético-dedutivo, utilizando como analogia as práticas de pesquisa. Por fim, discute-se a visão da terapia cognitiva como um processo de aprendizagem e a influência do terapeuta no processo terapêutico.

Theories in “soft” areas of psychology lack the cumulative character of scientific knowledge. They tend neither to be refuted nor corroborated, but instead merely fade away as people lose interest. Even though intrinsic subject matter difficulties (20 listed) contribute to this, the excessive

in Net-workX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibil-ity makes NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network

ntroduction Recent advances in genomics, prot eomics and relat ed scient ific fields have creat ed a surge in t he amount of biological dat a. These biological dat a ar e made available t o scient ist s in mult iple public dat a sources. While t he amount of dat a increases dramat ically, t he number of biological reposit ories also grows. For molecular biology only, t he number of ke y dat abases of value t o scient ist s has increased of 4 3.5% from 2003 t o 2004 [1,2]. Scient ific dat a sources ar e het erogeneous. They organize biological dat a diff...

, such as backtracking and path consistency. New classes of tractable problems are characterized, involving qualitative networks augmented by quantitative domain constraints, some of which can be solved in polynomial time using arc and path consistency. This work was supported in part by grants from the Air Force

Abstract. Graph algorithms are fundamental to many disciplines and application areas. Large graphs involving millions of vertices are common in scientific and engineering applications. Practical-time implementations using high-end computing resources have been reported but are accessible only to a

The purpose of this demonstration is to present the main features of the BioNavigation system. Scientific data collection needed in various stages of scientific discovery is typically performed manually. For each scientific object of interest (e.g., a gene, a sequence), scientists query a

This paper discovers patterns of knowledge dissemination among scientific disciplines. While the transfer of knowledge is largely unobservable, citations from one discipline to another have been proven to be an effective proxy to study disciplinary knowledge flow. This study constructs a knowledge