Hybrid and optical packet switching supporting different service classes in data center network

Photonic Network Communications - Optical packet switching is a prominent technology proposing not only a reduction in the energy consumption by the elimination of numerous...     

Vitamin D Compounds PRI-2191 and PRI-2205 Enhance Anastrozole Activity in Human Breast Cancer Models

1,25-Dihydroxycholecalciferol, the hormonally active vitamin D₃ metabolite, is known to exhibit therapeutic effects against breast cancer, mainly by lowering the expression of estrogen receptors and aromatase activity. Previously, the safety of the vitamin D active metabolite (24R)-1,24-dihydroxycholecalciferol (PRI-2191) and 1,25(OH)₂D₃ analog PRI-2205 was tested, and the in vitro activity of these analogs against different cancer cell lines was studied. We determined the effect of the two vitamin D compounds on anastrozole (An) activity against breast cancer based on antiproliferative activity, ELISA, flow cytometry, enzyme inhibition potency, PCR, and xenograft study. Both the vitamin D active metabolite and synthetic analog regulated the growth of not only estrogen receptor-positive cells (T47D and MCF-7, in vitro and in vivo), but also hormone-independent cancer cells such as SKBR-3 (HER-2-positive) and MDA-MB-231 (triple-negative), despite their relatively low VDR expression. Combined with An, PRI-2191 and PRI-2205 significantly inhibited the tumor growth of MCF-7 cells. Potentiation of the antitumor activity in combined treatment of MCF-7 tumor-bearing mice is related to the reduced activity of aromatase by both An (enzyme inhibition) and vitamin D compounds (switched off/decreased aromatase gene expression, decreased expression of other genes related to estrogen signaling) and by regulation of the expression of the estrogen receptor ERα and VDR.     

Synthesis of Benzophenones and in vitro Evaluation of Their Anticancer Potential in Breast and Prostate Cancer Cells

Breast and prostate cancers are frequently treated with chemotherapy. Several novel chemicals are being reported for this purpose, particularly synthetic and natural benzophenones. This work reports the synthesis of substituted 2-hydroxybenzophenones through 1,4-conjugate addition/intramolecular cycloaddition/dehydration of nitromethane on key intermediate chromones. Structures were extensively studied by means of 2D NMR spectroscopy and single-crystal XRD. Their cytotoxicity was evaluated in vitro in two breast cancer cell lines (MDA-MB-231 and T47-D) and one prostate cancer cell line (PC3). The most potent compound exhibited good cytotoxic effects against the three cancer cell lines (IC₅₀ values ranging from 12.09 to 26.49 μm ) and induced cell-cycle retardation only on prostate cancer cells, which suggested that it might exert cell-type-specific effects.     

Further evidence of responsibility of impurities in MgO for variability in its basicity and catalytic performance in oxidative coupling of methane

Further evidence was delivered that certain impurities, which could be contained in MgO samples, might be responsible for observed variability in MgO basicity and catalytic performance in oxidative coupling of methane. The surface basicity/base strength distribution of a series of MgO samples containing or not containing Ca and Na impurities was determined by a temperature-programmed desorption of CO₂. It was revealed that samples containing Ca and Na impurities have much more medium, strong and very strong basic sites. The surface basicity of MgO samples containing added alkali or alkaline earth compounds or water was characterized by a test reaction of transformation of 2-butanol. It was confirmed that the introduction of these compounds to a pure MgO enhanced both its basicity and activity in oxidative coupling of methane.     

Interfacial activity and rate of palladium(II) extraction with decyl pyridine monocarboxylates

Decyl isonicotiniate and decyl nicotiniate permit a rapid extraction of palladium(II) from its hydrochloride solutions. Decyl picoliniate is not a suitable extractant. 4-Octylphenylamine can act as a phase transfer catalyst when its concentration in the organic phase is at least 2·5 × 10^?4 M . It seems that the interfacial adsorption of pyridine carboxylates and of 4-octylphenylamine is not the decisive phenomenon in palladium(II) extraction. The negligible protonation of the pyridine-type extractants and the phase transfer catalysis explains well the quick extraction of palladium(II) with the commercial and highly hydrophobic extractant ACORGA CLX-50.     

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time

The Contractibility problem takes as input two graphs G and H, and the task is to decide whether H can be obtained from G by a sequence of edge contractions. The Induced Minor and Induced Topological Minor problems are similar, but the first allows both edge contractions and vertex deletions, whereas the latter allows only vertex deletions and vertex dissolutions. All three problems are NP-complete, even for certain fixed graphs H. We show that these problems can be solved in polynomial time for every fixed H when the input graph G is chordal. Our results can be considered tight, since these problems are known to be W[1]-hard on chordal graphs when parameterized by the size of H. To solve Contractibility and Induced Minor, we define and use a generalization of the classic Disjoint Paths problem, where we require the vertices of each of the k paths to be chosen from a specified set. We prove that this variant is NP-complete even when k=2, but that it is polynomial-time solvable on chordal graphs for every fixed k. Our algorithm for Induced Topological Minor is based on another generalization of Disjoint Paths called Induced Disjoint Paths, where the vertices from different paths may no longer be adjacent. We show that this problem, which is known to be NP-complete when k=2, can be solved in polynomial time on chordal graphs even when k is part of the input. Our results fit into the general framework of graph containment problems, where the aim is to decide whether a graph can be modified into another graph by a sequence of specified graph operations. Allowing combinations of the four well-known operations edge deletion, edge contraction, vertex deletion, and vertex dissolution results in the following ten containment relations: (induced) minor, (induced) topological minor, (induced) subgraph, (induced) spanning subgraph, dissolution, and contraction. Our results, combined with existing results, settle the complexity of each of the ten corresponding containment problems on chordal graphs.     

Applying “Design Thinking” in the context of media management education

“Design Thinking” – a cross-disciplinary and user centered method – is an approach towards the discovery of solutions and sparks innovative thinking in many ways. It also can be argued, that designers put themselves in the place of the user rather than co-creating with the consumer. Innovation is one of the current keywords across many industries, and many attempt to find new solutions to daily problems. Design Thinking as method allows to understand user needs and understand their principle problems in daily life. The design process uses intensive collaboration in cross-disciplinary settings and is divided into the exploration of the problem space and the solution space to achieve new ways of solving existing problems. Design Thinking has to integrate into the innovation process and into organizational structures right from the beginning. It constitutes a complement to classical analytical processes for problems that require lateral, not linear thinking. This article reviews the practical application of this energetic methodology in the academic context and presents some hands-on examples. The course series has been established by the Entertainment and Media Management Lab. (EMMi Lab.) at the Tampere University of Technology (TUT) and was held in cooperation with students from the University of Tampere (UTA), and the Tampere University of Applied Sciences (TAMK). One course has been held in cooperation with the University of Applied Sciences Magdeburg-Stendal, Germany. This article describes how to train students especially with strong technical background and analytical mind-sets in the development of innovations in the field of media, foster creative thinking, and achieve problem solutions beyond the current state of the art. We present the basic curriculum, course structure, goals & objectives, applied methods, settings, and theoretical aspects of Design Thinking. Our experience and reflections on conducting the courses concludes this article. The article shall be an introductory guide for anyone who intends to organize a similar course in the university context.     

The Complexity of Compressed Membership Problems for Finite Automata

In this paper, a compressed membership problem for finite automata, both deterministic (DFAs) and non-deterministic (NFAs), with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free grammars generating exactly one string. A novel technique of dealing with SLPs is employed: the SLPs are recompressed, so that substrings of the input word are encoded in SLPs labelling the transitions of the NFA (DFA) in the same way, as in the SLP representing the input text. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. Furthermore, in order to reflect the recompression in the NFA, we need to modify it only a little, in particular its size stays polynomial in the input size. Using this technique it is shown that the compressed membership for NFA with compressed labels is in NP, thus confirming the conjecture of Plandowski and Rytter (Jewels Are Forever, pp. 262–272, Springer, Berlin, 1999) and extending the partial result of Lohrey and Mathissen (in CSR, LNCS, vol. 6651, pp. 275–288, Springer, Berlin, 2011); as this problem is known to be NP-hard (in Plandowski and Rytter, Jewels Are Forever, pp. 262–272, Springer, Berlin, 1999), we settle its exact computational complexity. Moreover, the same technique applied to the compressed membership for DFA with compressed labels yields that this problem is in P, and this problem is known to be P-hard (in Markey and Schnoebelen, Inf. Process. Lett. 90(1):3–6, 2004; Beaudry et al., SIAM J. Comput. 26(1):138–152, 1997).