|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Radioprotective thermally generated free-radical dextrins显示文摘Effect of doses of the X-ray radiation from 0 to 400 Gy upon granular cornstarch and dextrins (British gums, BG) thermally generated from it at 230-300℃ was recognized with quantitative EPR and IR ab-sorption spectroscopy, molecular mass distribution in the depolymerization products, Scanning Elec-tron Microscopy, and X-ray diffractometry. Fractal analysis of the profiles of molecular mass distribu-tion showed that the depolymerization involved debranching of amylopectin. Roasting of cornstarch produced BG which differed in concentration and EPR parameters of stable free radicals from BG generated by X-ray radiation. Two types of stable free radicals, with Gaussian and Lorentzian shapes of EPR signals, were recognized. The shapes of the signals and temperature dependence on free radical intensity indicated exchanging interactions of the antiferromagnetic type, causing partial quenching of the spins at-196℃ (77K). Upon X-ray irradiation, new radicals were generated, the number and stability of which strongly depended on the types of radicals present before irradiation. These radicals slowly ceased because of a repolymerization of BG on storage. | Piotr TOMASIK Oskar MICHALSKI Ewa BIDZINSKA Antonina CEBULSKA-WASILEWSKA Krystyna DYREK Maciej FIEDOROWICZ Pawe OLKO | 2008 | Chinese Science Bulletin2008，53，7： | 3 |
| 2 | Acyclic colorings of graphs with bounded degree显示文摘A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough. | FIEDOROWICZ Anna SIDOROWICZ Elzbieta | 2016 | Science China Mathematics2016，59，7： | 2 |
| 3 | Degradation of starch by polarised light显示文摘 | Fiedorowicz M Tomasik P Lii C Y | 2001 | Carbohydrate Polymers2001，45，1： | 1 |
| 4 | Systematic Re- view and Meta-analysis of Pharmacological Interventions for Weight Gain from Antipsychotics and Mood Stabilizers显示文摘 | Fiedorowicz JG Miller DD Bishop JR | 2012 | Curr Psychiatry Rev2012，8，1： | 1 |
| 5 | Elevated prevalence of obesity,metabolic syndrome,and cardiovascular risk factors in bipolar disorder显示文摘 | Fiedorowicz JG Palagummi NM Forman-Hoffman VL | 2008 | Ann Clin Psvchiatry2008，20，3： | 1 |
| 6 | Degradation of starch by polarised light 显示文摘 | FIEDOROWICZ M TOMASIK P LII C Y | 2001 | Carbohydrate Polymers2001，45，1： | 1 |
| 7 | Physicochemical properties of waxy corn starch and corn amylopectin illuminated with hne- arly polarized visible light显示文摘 | Fiedorowicz M Rebilas K | 2002 | Carbohydrate Polymer2002，50，： | 1 |
| 8 | Degradation of starch by polarised light显示文摘 | Fiedorowicz M Tomasik P Lii C Y | 2001 | Carbohydrate Polymers2001，45，1： | 1 |
| 9 | Dentate granule neuron apoptosis and glia activation in murine hippocampus induced by trimethyltin exposure 显示文摘 | Fiedorowicz A Figiel I Kaminska B | 2001 | Brain Res2001，912，2： | 1 |
| 10 | Structural and molecular properties of dialdehyde starch显示文摘 | Fiedorowicz M Para A | 2006 | Carbohydrate Polymers2006，63，3： | 1 |
| 11 | Cost coloufings of hypergraphs显示文摘 | DRGAS-BURCHARDT E FIEDOROWICZ A | 2007 | Discrete Mathematics2007，307，1112： | 1 |
| 12 | Surface modifi- cation of polymers for biocompatibility via exposure to ex- treme ultraviolet radiation显示文摘 | U1 Ahad I Bartnik A Fiedorowicz H | 2014 | Journal of Biomedical Materi- als Research Part A2014，102，9： | 1 |
| 13 | Cholesterol and suicide attempts:A prospective study of depressed inpatients显示文摘 | Fiedorowicz J Coryell W | 2007 | Psychiatry Res2007，152，1： | 1 |
| 14 | The role of monoamine oxi- dase inhibitors in current psychiatric practice显示文摘 | FIEDOROWICZ J G SWARTZ K L | 2004 | J Psychiatr Pract2004，10，4： | 1 |
| 15 | Structural and molecular properties of dialdehyde starch显示文摘 | Fiedorowicz M Para A | 2006 | Carbohydr Polym2006，63，： | 1 |
| 16 | The association between mood and anxiety disorders with vascular diseases and risk fac- tors in a nationally representative sample显示文摘 | Fiedorowicz JG He J Merikangas KR | 2011 | J Psychosom Res2011，70，2： | 1 |
| 17 | Polarized light - stimulated enzymatic hydrolysis of chitin and chitosan 显示文摘 | ANNA KONIECZNA - MOLENDA MACIEJ FIEDOROWICZ WEI ZHONG | 2008 | Carbohydr Res2008，343，18： | 1 |
| 18 | Depression and cardiovascular disease: an update on how course of illness may influence risk 显示文摘 | FIEDOROWICZ J G | 2014 | Curr PsychiatryRep2014，16，10： | 1 |
| 19 | Acyclic improper colouring of graphs with maximum degree 4显示文摘A k-colouring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colours i and j the subgraph induced by the edges whose endpoints have colours i and j is acyclic. We consider acyclic k-colourings such that each colour class induces a graph with a given(hereditary) property. In particular, we consider acyclic k-colourings in which each colour class induces a graph with maximum degree at most t, which are referred to as acyclic t-improper k-colourings. The acyclic t-improper chromatic number of a graph G is the smallest k for which there exists an acyclic t-improper k-colouring of G. We focus on acyclic colourings of graphs with maximum degree 4. We prove that 3 is an upper bound for the acyclic 3-improper chromatic number of this class of graphs. We also provide a non-trivial family of graphs with maximum degree4 whose acyclic 3-improper chromatic number is at most 2, namely, the graphs with maximum average degree at most 3. Finally, we prove that any graph G with Δ(G) 4 can be acyclically coloured with 4 colours in such a way that each colour class induces an acyclic graph with maximum degree at most 3. | FIEDOROWICZ Anna SIDOROWICZ Elzbieta | 2014 | Science China Mathematics2014，57，12： | 1 |
| 20 | Structural and molecular properties of dialdehyde starch显示文摘 | Fiedorowicz M Para A | 2006 | Carbohydrate Polymers2006，63，3： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员