標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2006; 31st International S Rastislav Královi?,Pawe? Urzyczyn Conference proceedings 2006 Sprin [打印本頁(yè)] 作者: 我要黑暗 時(shí)間: 2025-3-21 19:34
書目名稱Mathematical Foundations of Computer Science 2006影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2006影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2006網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 2006網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2006被引頻次
書目名稱Mathematical Foundations of Computer Science 2006被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2006年度引用
書目名稱Mathematical Foundations of Computer Science 2006年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2006讀者反饋
書目名稱Mathematical Foundations of Computer Science 2006讀者反饋學(xué)科排名
作者: sparse 時(shí)間: 2025-3-21 21:50
Vincent Cremet,Fran?ois Garillot,Sergue? Lenglet,Martin Oderskychender Vorbehandlung, Strahlensp?tsch?den essentiell [657]. Klinische Kriterien helfen bei dieser Problemstellung. Sie werden aber unterschiedlich beurteilt. Bildgebende Verfahren und Elektroneurodiagnostik bieten keine klaren Unterscheidungsm?glichkeiten.作者: PANG 時(shí)間: 2025-3-22 02:05
Joan Boyar,René Peraltant of origin of branches or well-developed nodes, such as the nodes of Ranvier in vertebrates. In this chapter the occurrence of myelin and myelin-like sheaths in the three phyla will be surveyed, the sheaths and the myelinating cells that give rise to them will be compared, and their evolutionary s作者: 積極詞匯 時(shí)間: 2025-3-22 05:40 作者: initiate 時(shí)間: 2025-3-22 08:49 作者: urethritis 時(shí)間: 2025-3-22 16:20
Arnaud Carayol,Didier Caucaltal ependymal cells, radial cells) the name radial glial cell is now generally accepted (for a review, . Schmechel and Rakic, 1979). In the cerebral cortex of mammals, radial glial cells disappear at the end of neuronal cell migration. In contrast, in some nonmammalian species radial glia may persis作者: Vldl379 時(shí)間: 2025-3-22 18:42
O. Aichholzer,C. Huemer,S. Kappes,B. Speckmann,C. D. Tóth作者: 舉止粗野的人 時(shí)間: 2025-3-23 00:24 作者: Contort 時(shí)間: 2025-3-23 04:06 作者: 閹割 時(shí)間: 2025-3-23 06:06
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductionsve basically the same results, the translation via context nets provides a more abstract view and has the advantage that it follows the same inductive construction as the deduction graphs. The translations behave nicely with respect to cut-elimination.作者: 交響樂 時(shí)間: 2025-3-23 11:41 作者: LEER 時(shí)間: 2025-3-23 15:01 作者: Arthritis 時(shí)間: 2025-3-23 20:14 作者: 最高點(diǎn) 時(shí)間: 2025-3-23 22:53 作者: 花束 時(shí)間: 2025-3-24 03:28
A Polynomial Time Nilpotence Test for Galois Groups and Related Resultsg time is polynomial in size(.). Also, we generalize the Landau-Miller solvability test to an algorithm that tests if Gal(.) is in Γ.: this algorithm runs in time polynomial in size(.) and .. and, moreover, if Gal(.)?∈?Γ. it computes all the prime factors of # Gal(.).作者: 向外供接觸 時(shí)間: 2025-3-24 09:52
https://doi.org/10.1007/11821069Automat; algorithm; algorithms; artificial intelligence; automata; bioinformatics; complexity; computer sci作者: Etching 時(shí)間: 2025-3-24 11:17 作者: Communicate 時(shí)間: 2025-3-24 15:12 作者: ABYSS 時(shí)間: 2025-3-24 21:08
0302-9743 Overview: 978-3-540-37791-7978-3-540-37793-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 無(wú)法取消 時(shí)間: 2025-3-25 00:07
A Core Calculus for Scala Type CheckingWe present a minimal core calculus that captures interesting constructs of the Scala programming language: nested classes, abstract types, mixin composition, and path dependent types. We show that the problems of type assignment and subtyping in this calculus are decidable.作者: 使殘廢 時(shí)間: 2025-3-25 04:33
The Structure of Tractable Constraint Satisfaction ProblemsWe give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions.作者: 緩和 時(shí)間: 2025-3-25 08:58 作者: 賠償 時(shí)間: 2025-3-25 13:03 作者: 生銹 時(shí)間: 2025-3-25 16:13
Coloring Random 3-Colorable Graphs with Non-uniform Edge ProbabilitiesRandom 3-colorable graphs that are generated according to a .(.,.)-like model can be colored optimally, if . ≥./. for some large constant .. However, these methods fail in a model where the edge-probabilities are non-uniform and not bounded away from zero. We present a spectral algorithm that succeeds in such situations.作者: 易于出錯(cuò) 時(shí)間: 2025-3-25 22:34 作者: Insatiable 時(shí)間: 2025-3-26 02:54
The Kleene Equality for Graphs modes are equivalent, and in this case, the equational subsets form a Boolean algebra. We establish that the infinite grid and the transition graphs of deterministic pushdown automata satisfy the Kleene equality and we present families of graphs in which the free product of graphs preserves the Kleene equality.作者: 鑲嵌細(xì)工 時(shí)間: 2025-3-26 06:49
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-trianglesoverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results concerning disjoint empty convex .-gons in point sets.作者: 大方不好 時(shí)間: 2025-3-26 09:07 作者: 蜿蜒而流 時(shí)間: 2025-3-26 14:11
A Unified Construction of the Glushkov, Follow, and Antimirov Automatas to the weighted case. In particular, we extend the definition and construction of follow automata to the case of weighted regular expressions over a closed semiring and present the first algorithm to compute weighted Antimirov automata.作者: 壕溝 時(shí)間: 2025-3-26 17:34
Equations on Partial Wordsate equations on .. Partial words are sequences over a finite alphabet that may contain a number of “do not know” symbols. When we speak about equations on partial words, we replace the notion of equality (=) with compatibility ( ↑ ). Among other equations, we solve . ↑ ., . ↑ ., and special cases of .... ↑ .. for integers ., ., . ≥2. ...作者: 學(xué)術(shù)討論會(huì) 時(shí)間: 2025-3-26 21:46
Concrete Multiplicative Complexity of Symmetric Functionsbe exactly .???..(.), where ..(.) is the Hamming weight of the binary representation of .. We also show a close relationship between the complexity of symmetric functions and fractals derived from the parity of binomial coefficients.作者: Initial 時(shí)間: 2025-3-27 04:44
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measuresy of these languages. We show that the persistent language can be non-recursive. But our main result is that the set of quasi-nilpotent cellular automata (those with a single configuration in their .-limit set) is neither recursively enumerable nor co-recursively enumerable.作者: glomeruli 時(shí)間: 2025-3-27 05:57 作者: Anguish 時(shí)間: 2025-3-27 10:19
Vincent Cremet,Fran?ois Garillot,Sergue? Lenglet,Martin Oderskydelt es sich bei soliden Tumoren vorwiegend um Kompressionen durch Tumor oder Lymphknoten, tumor?se Infiltration oder narbige Ver?nderungen nach Bestrahlung. Infiltrative Prozesse des Plexus brachialis treten fast nur bei Lymphomen auf. Auch bei soliden Tumoren ist in seltenen F?llen ein direkter Be作者: Mumble 時(shí)間: 2025-3-27 14:29
Joan Boyar,René Peraltaf neuron—glia interrelations. Oligodendrocytes form the sheath in the central nervous system (CNS) and Schwann cells in the peripheral nervous system (PNS)—cells that differ in their origin and in their nature. Complex glial ensheathment of axons is not restricted to vertebrates, however, but is fou作者: 糾纏,纏繞 時(shí)間: 2025-3-27 21:48 作者: 令人不快 時(shí)間: 2025-3-27 23:44 作者: 小鹿 時(shí)間: 2025-3-28 04:20 作者: 流出 時(shí)間: 2025-3-28 08:21
Tree Exploration with an Oracleble information on the efficiency of solving network problems, such as communication or exploration, has been investigated before but assumptions concerned availability of . items of information about the network, such as the size, the diameter, or a map of the network. In contrast, our approach is 作者: fluoroscopy 時(shí)間: 2025-3-28 14:00
Distributed Data Structures: A Survey on Informative Labeling Schemesbuted fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the 作者: indubitable 時(shí)間: 2025-3-28 17:32
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductionses are used to restrict the scope of local assumptions. Proof nets for multiplicative exponential linear logic (MELL) are also graphs with boxes, but in MELL the boxes have the purpose of controlling the modal operator !. In this paper we study the apparent correspondences between deduction graphs a作者: modest 時(shí)間: 2025-3-28 19:31
On the Representation of Kleene Algebras with Testsies are identified that, along with star-continuity, are sufficient for nonstandard relational representation. An algebraic condition is identified that is necessary and sufficient for the construction to produce a standard representation.作者: 極深 時(shí)間: 2025-3-29 02:28
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-trianglesthan either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results con作者: encyclopedia 時(shí)間: 2025-3-29 07:04
Approximate Shortest Path Queries on Weighted Polyhedral Surfacesof . triangular faces. We present query algorithms that compute approximate distances and/or approximate (weighted) shortest paths. Our algorithm takes as input an approximation parameter .∈(0,1) and a query time parameter . and builds a data structure which is then used for answering .-approximate 作者: 外星人 時(shí)間: 2025-3-29 08:49
A Unified Construction of the Glushkov, Follow, and Antimirov Automata, ., or .. This paper presents a simple and unified view of all these construction methods both for unweighted and weighted regular expressions. It describes simpler algorithms with time complexities at least as favorable as that of the best previously known techniques, and provides a concise proof 作者: Oscillate 時(shí)間: 2025-3-29 15:28
Algebraic Characterizations of Unitary Linear Quantum Cellular Automataoth by direct combinatorial arguments, and by adding constraints into the model which do not change the quantum cellular automata’s computational power. The configurations we consider have finite but unbounded size.作者: 令人不快 時(shí)間: 2025-3-29 18:33
A Polynomial Time Nilpotence Test for Galois Groups and Related Resultsg time is polynomial in size(.). Also, we generalize the Landau-Miller solvability test to an algorithm that tests if Gal(.) is in Γ.: this algorithm runs in time polynomial in size(.) and .. and, moreover, if Gal(.)?∈?Γ. it computes all the prime factors of # Gal(.).作者: 消滅 時(shí)間: 2025-3-29 21:53 作者: thrombus 時(shí)間: 2025-3-30 00:09 作者: Mirage 時(shí)間: 2025-3-30 06:16
Concrete Multiplicative Complexity of Symmetric Functionsit representing ., when only exclusive-or, conjunction and negation gates may be used. This article explores in detail the multiplicative complexity of symmetric Boolean functions. New techniques that allow such exploration are introduced. They are powerful enough to give exact multiplicative comple作者: 宇宙你 時(shí)間: 2025-3-30 10:49
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures A.?Maass in [1]. It is a refinement of the classical notion of .-limit sets dealing with the typical long term behavior of cellular automata. It focuses on the words whose probability of appearance does not tend to 0 as time tends to infinity (the persistent words). In this paper, we give a charact作者: genuine 時(shí)間: 2025-3-30 14:57
The Kleene Equality for Graphse automaton of subsets of vertices of a graph. The subsets accepted in such a way are the equational subsets of vertices of the graph in the sense of Mezei and Wright. We introduce the notion of deterministic acceptance by finite automaton. A graph satisfies the Kleene equality if the two acceptance作者: 熔巖 時(shí)間: 2025-3-30 17:18
Artificial Intelligence (AI)-Powered Intelligent Systems for Disease Prognosis: A Bibliometric Studyteoarthritis, and many other non-communicable diseases. Predicting diseases using unconventional architectures that can predict patterns and medical images about the immediacy of diseases that cannot be traced by manual inspection is possible with artificial intelligence. Intelligent systems powered作者: 個(gè)阿姨勾引你 時(shí)間: 2025-3-30 23:24
An Equational Modeling of Asynchronous Concurrent Programmingresulting concurrent programs are deadlock free. In this paper, we develop, study and extend a formal model of the underlying application programmer interface. For such a purpose, we formally define the extension of a monad by some notion of monad references uniquely bound to running monad actions t作者: Figate 時(shí)間: 2025-3-31 01:40 作者: 動(dòng)機(jī) 時(shí)間: 2025-3-31 06:22 作者: indices 時(shí)間: 2025-3-31 10:20 作者: 極力證明 時(shí)間: 2025-3-31 13:34
https://doi.org/10.1007/978-3-642-41449-7h. The organization of carbon nanotubes on surfaces,as a critical prerequisite toward future applications in nanoelectronics, isreviewed with particular emphasis given to the synthesis of both vertically andhorizontally aligned arrays. Vertically aligned growth has been recently boosted bythe develo作者: slow-wave-sleep 時(shí)間: 2025-3-31 18:07
Sunil Kumar,Narayan S. Punekarts way into advanced chip designs. The second part of the book describes the most important passive devices used in millimetre-wave CMOS circuits. Part three uses these passive devices and builds circuit blocks for the wireless transceiver. The book completes with a comprehensive list of references 作者: 不規(guī)則 時(shí)間: 2025-4-1 01:13
AGE and the kidney: an update,at AGEs may be linked to the crippling amyloidosis with arthritis that afflicts long-term hemodialysis patients. In this report, a newly recognized threat of AGEs absorbed from cooked foods is assessed. There is hope of muting the damage caused by AGEs in diabetic individuals by at least three strat作者: Creatinine-Test 時(shí)間: 2025-4-1 03:57
A. A. Kal’nin,V. V. Pasynkov,Yu. M. Tairov,D. A. Yas’kovand two-component ceramic shields. Despite the massive use of mathematical techniques, the obtained results have a clear engineering meaning and are presented in an easy-to-use form. One of the chapters is devo978-90-481-6868-2978-1-4020-4239-3Series ISSN 0925-0042 Series E-ISSN 2214-7764 作者: Critical 時(shí)間: 2025-4-1 06:47 作者: META 時(shí)間: 2025-4-1 13:46 作者: abreast 時(shí)間: 2025-4-1 17:43
