K–partitioning of Signed or Weighted Bipartite Graphs

Abstract — In this work, K-partitioning of signed or weighted bipartite graph problem has been introduced, which appears as a real life problem where the partitions of bipartite graph represent two different entities and the edges between the nodes of the partitions represent the relationships among them. A typical example is the set of people and their opinions, whose strength is represented as signed numerical values. Using the weights on the edges, these bipartite graphs can be partitioned into two or more clusters. In political domain, a cluster represents strong relationship among a group of people and a group of issues. In the paper, we formally define the problem and compare different heuristics, and show through both real and simulated data the effectiveness of our approaches

Enhancing interoperability: ontology-mapping in an electronic institution

The automation of B2B processes requires a high level of interoperability between potentially disparate systems. We model such systems using software agents (representing enterprises), which interact using specific protocols. When considering open environments, interoperability problems are even more challenging. Addressing business automation as a task that intends to align businesses through a tight integration of processes may not be desirable, because business relationships may be temporary and dynamic. Furthermore, openness implies heterogeneity of technologies, processes, and even domain ontologies. After discussing these issues, this paper presents, in the context of an Electronic Institution, an ontology-mapping service that enables the automation of negotiation protocols when agents may use different ontologies to represent their domain knowledge. The ontology-mapping service employs two approaches used for lexical and semantic similarity, namely N-Grams and WordNet, and poses few requirements on the ontologies' representation format. Examples are provided that illustrate the integration of ontology-mapping with automated negotiation. © 2009 Springer Berlin Heidelberg

Indole diterpenoid synthetic studies: The total synthesis of (+)-nodulisporic acid F and studies toward the total synthesis of (−)-nodulisporic acid D

Chapter one of this dissertation provides a general introduction to the indole diterpenoid class of natural products, with an emphasis on the recently discovered nodulisporic acids. Chapter two describes the stereocontrolled total synthesis of (+)-nodulisporic acid F. Highlights of the modular synthetic strategy include an efficient anionic coupling via the Smith 2-substituted indole synthesis, an optimized C-ring annulation protocol, and a late-stage installation of the α,β-unsaturated carboxylic acid sidechain via the B-alkyl Suzuki-Miyaura cross-coupling reaction.* Chapter three details our overall strategy for the convergent, asymmetric total synthesis of (-)-nodulisporic acid D, a representative member of a recently nodulisporane class of architecturally complex indole alkaloids. In addition, we describe an expedient, stereocontrolled preparation of tricyclic western hemisphere subtarget (-)-104. Successful union of (-)- 104 with eastern hemisphere subtarget (-)-125 via our 2-substituted indole synthesis has enabled construction of the heptacyclic core of (-)-nodulisporic acid D.* *Please refer to dissertation for diagrams

Mining "Hidden Phrase" Definitions from the Web

Keyword searching is the most common form of document search on the Web. Many Web publishers manually annotate the META tags and titles of their pages with frequently queried phrases in order to improve their placement and ranking. A "hidden phrase" is defined as a phrase that occurs in the META tag of a Web page but not in its body. In this paper we present an algorithm that mines the definitions of hidden phrases from the Web documents. Phrase definitions allow (i) publishers to find relevant phrases with high query frequency, and, (ii) search engines to test if the content of the body of a document matches the phrases. We use cooccurrence clustering and association rule mining algorithms to learn phrase definitions from high-dimensional data sets. We also provide experimental results

Allogeneic haematopoietic stem cell transplantation in adult aplastic anemia patients

9th International Eurasian Hematology Oncology Congress (EHOC) -- OCT 17-20, 2018 -- Istanbul, TURKEYSahin, Fahri/0000-0001-9315-8891; Saydam, Guray/0000-0001-8646-1673WOS:000447176600099[No Abstract Available

Clinical aspects of primary thyroid lymphoma

9th International Eurasian Hematology Oncology Congress (EHOC) -- OCT 17-20, 2018 -- Istanbul, TURKEYSaydam, Guray/0000-0001-8646-1673; Sahin, Fahri/0000-0001-9315-8891WOS:000447176600059[No Abstract Available

The Sampling of Conformational Dynamics in Ambient-Temperature Crystal Structures of Arginine Kinase

Arginine kinase provides a model for functional dynamics, studied through crystallography, enzymology, and nuclear magnetic resonance. Structures are now solved, at ambient temperature, for the transition state analog (TSA) complex. Analysis of quasi-rigid sub-domain displacements show that differences between the two TSA structures average about 5% of changes between substrate-free and TSA forms, and they are nearly co-linear. Small backbone hinge rotations map to sites that also flex on substrate binding. Anisotropic atomic displacement parameters (ADPs) are refined using rigid-body TLS constraints. Consistency between crystal forms shows that they reflect intrinsic molecular properties more than crystal lattice effects. In many regions, the favored directions of thermal/static displacement are appreciably correlated with movements on substrate binding. Correlation between ADPs and larger substrate-associated movements implies that the latter approximately follow paths of low-energy intrinsic motions