184 research outputs found

    On the completability of incomplete orthogonal Latin rectangles

    Get PDF
    We address the problem of completability for 2-row orthogonal Latin rectangles (OLR2). Our approach is to identify all pairs of incomplete 2-row Latin rectangles that are not com- pletable to an OLR2 and are minimal with respect to this property; i.e., we characterize all circuits of the independence system associated with OLR2. Since there can be no poly- time algorithm generating the clutter of circuits of an arbitrary independence system, our work adds to the few independence systems for which that clutter is fully described. The result has a direct polyhedral implication; it gives rise to inequalities that are valid for the polytope associated with orthogonal Latin squares and thus planar multi-dimensional assign- ment. A complexity result is also at hand: completing a set of (n - 1) incomplete MOLR2 is NP-complete

    Dynamic Behavior of Geogrid-Reinforced Soil

    Get PDF
    Geosynthetic materials particularly geogrids are widely used as reinforcement and is a proven technology for enhancing the performance of the foundation soil system under monotonic loadings. But the dynamic behavior of the reinforced foundation soil has not been well understood so far, and therefore dynamic loads (square wave pulse) of frequencies 0.2, 0.4 and 1 hertz under an amplitude of displacement of 2mm have been studied by carrying out dynamic plate loading tests on both unreinforced and the reinforced sandy beds. The size of the square plate is 150mm x 150mm x 30mm

    Robust seed selection algorithm for k-means type algorithms

    Full text link
    Selection of initial seeds greatly affects the quality of the clusters and in k-means type algorithms. Most of the seed selection methods result different results in different independent runs. We propose a single, optimal, outlier insensitive seed selection algorithm for k-means type algorithms as extension to k-means++. The experimental results on synthetic, real and on microarray data sets demonstrated that effectiveness of the new algorithm in producing the clustering resultsComment: 17 pages, 5 tables, 9figure

    An Efficient Local Search for Partial Latin Square Extension Problem

    Full text link
    A partial Latin square (PLS) is a partial assignment of n symbols to an nxn grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood is defined by (p,q)-swap, i.e., removing exactly p symbols and then assigning symbols to at most q empty cells. For p in {1,2,3}, our neighborhood search algorithm finds an improved solution or concludes that no such solution exists in O(n^{p+1}) time. We also propose a novel swap operation, Trellis-swap, which is a generalization of (1,q)-swap and (2,q)-swap. Our Trellis-neighborhood search algorithm takes O(n^{3.5}) time to do the same thing. Using these neighborhood search algorithms, we design a prototype iterated local search algorithm and show its effectiveness in comparison with state-of-the-art optimization solvers such as IBM ILOG CPLEX and LocalSolver.Comment: 17 pages, 2 figure

    Structure of chitinase D from Serratia proteamaculans reveals the structural basis of its dual action of hydrolysis and transglycosylation

    Get PDF
    Chitinases are known to hydrolyze chitin polymers into smaller chitooligosaccharides. Chitinase from bacterium Serratia proteamaculans (SpChiD) is found to exhibit both hydrolysis and transglycosylation activities. SpChiD belongs to family 18 of glycosyl hydrolases (GH-18). The recombinant SpChiD was crystallized and its three-dimensional structure was determined at 1.49 Å resolution. The structure was refined to an R-factor of 16.2%. SpChiD consists of 406 amino acid residues. The polypeptide chain of SpChiD adopts a (β/α)8 triosephosphate isomerase (TIM) barrel structure. SpChiD contains three acidic residues, Asp149, Asp151 and Glu153 as part of its catalytic scheme. While both Asp149 and Glu153 adopt single conformations, Asp151 is observed in two conformations. The substrate binding cleft is partially obstructed by a protruding loop, Asn30 - Asp42 causing a considerable reduction in the number of available subsites in the substrate binding site. The positioning of loop, Asn30 - Asp42 appears to be responsible for the transglycosylation activity. The structure determination indicated the presence of sulfone Met89 (SMet89). The sulfone methionine residue is located on the surface of the protein at a site where extra domain is attached in other chitinases. This is the first structure of a single domain chitinase with hydrolytic and transglycosylation activities

    Stock assessment of sciaenid resources of India

    Get PDF
    B e catches of Sew fishes decrensed froin 1'379 to 1980 and later increased in sages frum 1961 to 1984,1985 to 87 and 1988~089 . Gujantand Mahamshtra togehrwntribured 52%of zdal sdaenid calches along she wcsl coast. hi b.%h the states, the landings during tht: f~stfe w years showed an incmsing trend whercss during the remaining period, the catches and permrage eontnbuticn varied. Along the east coast dso i?r,e sciaenid landings showed annual fluctuations

    Pemberdayaan Masyarakat dengan Mengajari Microsoft Word Bagi Anak Muda di Kampung Enggros, Kota Jayapura

    Get PDF
    Pengabdian masyarakat dilaksanakan dengan tujuan meningkatkan pengetahuan anak-anak tentang penggunaan komputer dan pengenalan terhadap Microsot office yaitu Microsoft word di Kampung Enggros, Distrik Abepura, Kota Jayapura. Permasalahan yang terjadi yaitu anak-anak SD sampai dengan SMP belum semua mengenal tools yang ada di Microsoft word. Oleh sebab itu perlu untuk mengenalkan perangkat tersebut kepada mereka. Metode pelaksanaan pengabdian ini melalui tiga tahapan yaitu pertama pengenalan alat, kedua praktek dan ketiga sesi tanya jawab. Kegiatan pengabdian ini diberikan  kepada anak sekolah pada jenjang pendidikan SD sampai dengan SMP yang melibatkan Ecodefender, Lantamal X, Dosen FMIPA Uncen, Mahasiswa/i dari Fakultas Teknik Jurusan Planologi serta Mahasiwa Ilmu Perikanan (IKP) dan SI (Sistem Informasi). Kegiatan yang dilakukan oleh Dosen FMIPA Uncen yaitu perihal pengajaran dan pendampingan tentang Microsfot Word kepada siswa/siswi SMP dan diadakan sebanyak dua kali dari bulan Maret sampai dengan April Tahun 2023

    Formulation and pharmacodynamic evaluation of meloxicam liquisolid compacts

    Get PDF
    The purpose of this study was to improve the meloxicam dissolution rate through its formulation into liquisolid compacts and then to evaluate the in vitro and in vivo performance of the prepared liquisolid compacts. Dissolution efficiency, mean dissolution time and relative dissolution rate of liquisolid compacts were calculated and compared to marketed formulation. The degree of interaction between the ME and excipients was studied by differential scanning calorimetry and X-ray diffraction were used and results revealed that, there was a loss of meloxicam crystallanity upon liquisolid formulation and almost molecularly dispersed state, which contributed to the enhanced drug dissolution properties. The optimized liquisolid compact showed higher dissolution rates and dissolution efficiency compared to commercial product. The analgesic and anti inflammatory response of optimized liquisolid compact in Swiss albino mice and Wistar rats was found to be superior compared to the marketed formulation.Colegio de Farmacéuticos de la Provincia de Buenos Aire

    On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling

    Full text link
    Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a formulation of vertex colouring using a suitable clique partition of the graph. This formulation is applicable in timetabling applications, where such a clique partition of the conflict graph is given implicitly. In contrast with some alternatives, the presented formulation can also be easily extended to accommodate complex performance indicators (``soft constraints'') imposed in a number of real-life course timetabling applications. Its performance depends on the quality of the clique partition, but encouraging empirical results for the Udine Course Timetabling problem are reported
    corecore