Search

A decade ago, a task group of the International Union of Pure and Applied Chemistry performed an exhaustive collection and review of measured transitions, applied the MARVEL procedure, and derived recommended empirical energy levels for nine major water isotopologues. Very recently, using an improved methodology, the sets of empirical energy levels of H216O, H218O and H217O were updated, leading to the so-called W2020 energy levels and transition wavenumbers [Furtenbacher et al. J. Phys. Chem. Ref. Data 49 (2020) 043103; 10.1063/5.0030680]. Here we present validation tests of the W2020 line list of H216O against spectra recorded by cavity ring down spectroscopy (CRDS) referenced to a frequency comb (FC), newly obtained in the 8040-8630 cm−1 region. The recorded spectra are found in excellent agreement with previous high-quality studies available in the literature. While these literature sources were all incorporated in the transition database used to derive the W2020 energy levels, the direct superposition of the FC-CRDS spectra to the W2020 line list of H216O shows a number of large disagreements. Cases where deviations largely exceed the W2020 claimed uncertainty on the transition frequencies are noted. In the considered spectral region, the resulting W2020 list is thus less accurate than some of the published original sources used to derive the W2020 energy levels. We conclude that the sophisticated global procedure and algorithm elaborated to identify and adequately weight inaccurate line positions among the large W2020 transition database do not always prevent less accurate data from “spoiling” higher quality data sources. The W2020 list of H216O is also compared to newly recorded CRDS spectra in the 12970–13200 cm−1 region (corresponding to the region of the A-band of O2), where previous observations were very scarce. As in the previous region, substantial position deviations are evidenced, and in many cases, the W2020 error bars appear to be strongly underestimated. © 2021 Elsevier Ltd The support of the CNRS (France) in the frame of International Research Project SAMIA is acknowledged. SNM activity was also partly supported in the frame of the Russian Science Foundation, Grant No. 18-11-00024-Π. CRDS measurements near 760 nm were performed at IAO-Tomsk and funded by RFBR project 20-32-70054.

The increasing depletion of nonrenewable resources has motivated society to find alternate sources and methods of industrial processes. This problem can only be solved by using the resources that are given by nature in such a way that they can be spontaneously renewed, namely through sustainability. Industrial symbiosis (IS), which is the substitution of raw materials used in an industrial process by another resource that would otherwise be discarded, is the key to sustainability in industry. IS is an alternative to a conventional linear economy (take-make-dispose) in which one keeps resources in use for as long as possible, extracts the maximum value from them during use, then reclaims and reproduces products and materials at the end of each service life. The initial step in developing a symbiotic relationship is to define possible relationships between production firms. Many studies have shown that lack of data on waste streams is one of the significant barriers to IS establishment. In this study, by screening IS case studies in the literature, a construction industry-related symbiosis database, namely SymbioConstruction, is developed as three modules in which the necessary data are provided to waste seekers to utilize/send a specific waste and to stakeholder seekers to establish symbiotic relationships by exchanging wastes. Then, the database is tested with two steps: (1) evaluation on the ecoindustrial parks, and (2) evaluation on the construction materials industry. The exploratory results of the evaluation show that the SymbioConstruction is able to identify the major amount of construction industry-related symbiotic relationships realized in ecoindustrial parks located around the world. Furthermore, it also shows that the main producers of construction materials have the opportunity of implementing symbiotic relationships in terms of sending and receiving wastes for utilization. The practical contribution of this study is in the form of a database in which the guidance is provided to practitioners for decision making in symbiotic relationship implementation with respect to the identification and selection of possible stakeholders. Two methodological contributions are also provided: (1) a generalized method for identifying sector-oriented potential IS implementations, and (2) a generalized method for storing those IS opportunities.

Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide range of queries by means of carefully designed indexing and query planning. However, many aggregate range queries are usually performed by DBMSes using sequential scans, and certain needs, like storing Authenticated Data Structures (ADS), are not supported at all. Theoretically, these needs could be efficiently fulfilled adopting specific kinds of indexing, which however are normally ruled-out in DBMSes design. We introduce the concept of overlay index: an index that is meant to be stored in a standard database, alongside regular data and managed by regular software, to complement DBMS capabilities. We show a data structure, that we call DB-tree, that realizes an overlay index to support a wide range of custom aggregate range queries as well as ADSes, efficiently. All DB-trees operations can be performed by executing a small number of queries to the DBMS, that can be issued in parallel in one or two query rounds, and involves a logarithmic amount of data. We experimentally evaluate the efficiency of DB-trees showing that our approach is effective, especially if data updates are limited.

International audience; Non-Volatile Memory (NVM) is a promising development for Database Management Systems (DBMS), offering abundant and fast storage to complement traditional disk and main memory architectures. NVM introduces additional data migration possibilities to the traditional buffer pool (BP) managers used by the DBMS. Hence, the efficient use of this new technology requires a redesign of the BP manager. For the cloud Database-as-a-Service products, this need for a redesign is further complicated by the traditional cloud providers' goal to minimize the Service Level Agreement (SLA) violation penalties paid to their tenants. Unfortunately, current research in the area does not provide a comprehensive picture of the components constituting a multi-tenant persistent memory aware BP manager for a cloud database that makes use of NVM. Furthermore, researchers lack the software tools needed to quickly prototype and estimate the effectiveness of novel data management policies guiding those components. In this paper, we attempt to remedy both issues, first, by proposing a generalized framework that defines the purpose and the abstract interfaces of various multi-tenant persistent memory-aware BP manager components, and second, by developing and demonstrating a simulator algorithm that is shown to aid in quick testing of different implementations of those BP manager components.

This paper presents the stochastic-geometry analysis and designs a primary exclusive region (PER) for a spatial grid-based spectrum database system. The purpose of the spatial grid is to utilize information, such as the primary receiver (PR) antenna pattern, and the secondary transmitter (ST) density and transmission power, in each divided region. This paper introduces polar and square grids. For these spatial grids, the cumulants of the aggregate interference at a PR, from the STs, are derived, where the probability generating functional for the Poisson point process (PPP) is used on the assumption that the distribution of the STs in each divided region follows an inhomogeneous PPP. In addition, by introducing the allowable transmission probability of STs in each divided region, the PER optimization problem can be formulated as a continuous optimization problem. Numerical results demonstrate that a PER, corresponding to the information, is successfully designed and that more detailed information, due to a reduction in the area of each divided region, leads to a smaller and complex-shaped PER.

International audience; The process-based life cycle assessments (LCA) of goods and services are calculated using a bottom-up approach related to a functional unit. However, this does not provide any information regarding the scale of the environmental impacts. Therefore, the normalization allows to relate the impacts to a reference system (specific countries, regions or even the whole world). These references are usually obtained from top-down approach. The different data sources introduce inconsistencies on results and raise doubts on their adequacy and representativity. This paper proposes a novel approach for determining the data for the reference in order to ensure consistency about boundaries, data sources and modelling hypotheses describing the system. For this purpose, normalization is applied as an expression of the result relative to the average component of the reference system, instead of the sum of all the components. The reference values are determined from the geometric means of the datasets of the inventory database, used for assessing the studied systems. The exemplary application to the ecoinvent databases provides normalization references for 878 versions of the impacts categories listed by ecoinvent and for the 2077 involved substances. For eight impact assessment methods, the results are compared with 16 normalization sets from the literature and point out highly significant correlations.

This survey paper discusses the feasibility of sharing the spectrum between satellite telecommunication networks and terrestrial and other satellite networks on the basis of a comprehensive study carried out as part of the European Space Agency's (ESA) Advanced Research in Telecommunications Systems (ARTES) programme. The main area of investigation is the use of spectrum databases to enable a controlled sharing environment. Future satellite systems can largely benefit from the ability to access spectrum bands other than the dedicated licensed spectrum band. Potential spectrum sharing scenarios are classified as: a) secondary use of the satellite spectrum by terrestrial systems, b) satellite system as a secondary user of spectrum, c) extension of a terrestrial network by using the satellite network, and d) two satellite systems sharing the same spectrum. We define practical use cases for each scenario and identify suitable techniques. The proposed scenarios and use cases cover several frequency bands and satellite orbits. Out of all the scenarios reviewed, owing to the announcement of many different mega-constellation satellite networks, we focus on analysing the feasibility of spectrum sharing between geostationary orbit (GSO) and non-geostationary orbit (NGSO) satellite systems. The performance is primarily analysed on the basis of widely accepted recommendations of the Radiocommunications Sector of the International Telecommunications Union (ITU-R). Finally, future research directions are identified.

Günümüzde sayısal veri miktarının artmasıyla birlikte veri tabanı sistemlerinin kullanımı da artmıştır. Bu kadar çok veri arasından istenilen veriye hızlı bir şekilde ulaşmada ise veri tabanlarının fiziksel tasarımı önemli rol oynamaktadır. Fiziksel veri tabanı tasarımının önemli bir kısmını dizin seçimi oluşturmaktadır. Dizinler, tüm tablonun taranmasına gerek duyulmadan belirli seçim şartlarına uyan satırlara ulaşmayı sağlayan yardımcı yapılardır. Yüzlerce tablo ve binlerce sütun içeren ilişkisel bir veri tabanı için milyarlarca dizin oluşturabilme ihtimali vardır. Ancak bir veri tabanı için dizin sayısı sınırsız bir şekilde arttırılamaz. Çünkü veri tabanında yapılan bir güncellemeden sonra yeni veri tabanı ile tutarlı kalmak için dizinlerin de güncellenmesi gerekir, dolayısıyla dizinlerin bir bakım maliyeti vardır. Diğer taraftan dizinler de birer dosya olduklarından depolama maliyetleri vardır. Bu esaslar göz önünde bulundurulduğunda dizin seçim problemi, NP-tam bir problem olarak karşımıza çıkmaktadır. Böyle bir problem karşısında veri tabanı yöneticisinin bir veri tabanı için dizin seçimi yapması çok zordur.Bu tez kapsamında dizin seçim problemini otomatik olarak çözmek için dizin seçim aracı geliştirilmiştir. Dizin seçim aracı geliştirilirken kümeleme tekniklerinden yararlanılmıştır. Geliştirilen dizin seçim aracı ile bir iş yükü için uygun dizin kümesi seçerek, veri tabanı yöneticisi üzerindeki iş yükünü hafifletmek ve iş yükünü oluşturan sorguların cevaplanması için gereken toplam zamanın ve toplam disk erişim sayısının azaltılması hedeflenmiştir.Dizin seçim aracının çalışma prensibi, sorgulardan oluşan bir iş yükünü, birbirine benzer sorgular bir araya gelecek şekilde kümelere ayırmaya çalışmaktır. Benzer sorguları biraraya getirmedeki amaç ise birbirine benzer sorguların ortak nitelikleri üzerinde dizin oluşturma önerisinde bulunmaktır. Böylece oluşturulacak dizinlerin birden çok sorgu için faydalı olması beklenmektedir.Yapılan performans değerlendirmesi testlerinde iş yükünü oluşturan sorgular ardışık ve eş zamanlı olmak üzere 2 farklı şekilde çalıştırılmıştır. Testler ile iş yükünün işlenmesi için gereken toplam disk erişimi sayısı ve toplam cevap süresi ölçülmüştür. İş yükünün işlenmesi için gereken toplam disk erişimi sayısı ve toplam cevap süresinde, kümeleme yöntemi ile elde edilen dizin önerilerinin kullanılması ile büyük oranda iyileşme olduğu görülmüştür. Nowadays, with the increase in the number of digital data, the use of database systems has increased. The physical design of the databases plays an important role in reaching the requested data quickly among such a large number of data. An important part of the physical database design is the index selection. Indexes are auxiliary structures that allow access to rows that match specific selection conditions without having to scan the entire table. There is a possibility of creating billions of indexes for a relational database containing hundreds of tables and thousands of columns. However, the number of indexes for a database cannot be increased limitlessly. Because after an update to the database, the indexes need to be updated to remain consistent with the new database, so the indexes have a maintenance cost. On the other hand, indexes are stored in ordinary files like other data files, so they have storage cost. When these criteria are taken into consideration, the problem of index selection is an NP-complete problem. In the face of such a problem, it is very difficult for the database administrator to select the appropriate indexes for a database.In this thesis, an index selection tool has been developed to automatically solve the index selection problem. Clustering techniques were used to develop the index selection tool. By selecting the appropriate index set for a workload with the developed index selection tool, it is aimed to lighten of responsibility of database administrator and to reduce the total time and total disk access count required to answer the queries that make up the workload.The working principle of the index selection tool is to divide a workload into clusters such that similar queries come together. The purpose of grouping similar queries is to suggest indexing on the common attributes of similar queries. By this way, the indexes to be created are expected to be useful for multiple queries.In the performance evaluation tests, the queries that constitute the workload were executed in two different ways as consecutive and concurrent. The total number of disk access and total response time required to process the workload were measured with these tests. The total number of disk access count and the total response time required to process the workload has been greatly reduced by the use of index recommendations obtained by the clustering method. 112

Environmental hazards are caused by uranium mining legacies and enhanced radioactivity in utilized groundwater and surface water resources. Knowledge of uranium speciation in these waters is essential for predicting radionuclide migration and for installing effective water purification technology. The validity of the thermodynamic data for the environmental media affected by uranium mining legacies is of utmost importance. Therefore, a comprehensive and consistent database was established according to current knowledge. The uranium data included in the database is based on the NEA TDB (Guillaumont et al., 2003) and is modified or supplemented as necessary e.g. for calcium and magnesium uranyl carbonates. The specific ion interaction theory ( Bronsted, 1922 ) is used to estimate activity constants, which is sufficient for the considered low ionic strengths. The success of this approach was evaluated by comparative experimental investigations and model calculations (PHREEQC (Parkhurst and Appelo, 1999)) for several model systems. The waters differ in pH (2.7–9.8), uranium concentration (10−9-10−4 mol/L) and ionic strength (0.002–0.2 mol/L). We used chemical extraction experiments, ESI-Orbitrap-MS and time-resolved laser-induced fluorescence spectroscopy (TRLFS) to measure the uranium speciation. The latter method is nonintrusive and therefore does not change the chemical composition of the investigated waters. This is very important, because any change of the system under study may also change the speciation.

This paper presents a new database consisting of concurrent articulatory and acoustic speech data. The articulatory data correspond to ultrasound videos of the vocal tract dynamics, which allow the visualization of the tongue upper contour during the speech production process. Acoustic data is composed of 30 short sentences that were acquired by a directional cardioid microphone. This database includes data from 17 young subjects (8 male and 9 female) from the Santander region in Colombia, who reported not having any speech pathology. © 2019 IEEE. IEEE Colombia Section;IEEE Signal Processing Society Colombia Chapter;Universidad Industrial de Santander

Within the framework of the research, the information-educational environment 'Practice' has been developed: functional requirements have been identified, software and development tools have been selected, a database has been designed, a client-server web-application for its access has been implemented. The created information educational environment will effectively organize the process of students' practical training in terms of increasing the level of formation of the most important 'XXI century skills': bachelors' ICT-competence, communicative reflection, critical thinking. © 2019 IEEE.

International audience; In this paper, a new instance selection algorithm is proposed in the context of classification to manage non-trivial database sizes. The algorithm is hybrid and runs with only a few parameters that directly control the balance between the three objectives of classification, i.e. errors, storage requirements and runtime. It comprises different mechanisms involving neighborhood and stratification algorithms that specifically speed up the runtime without significantly degrading efficiency. Instead of applying an IS (Instance Selection) algorithm to the whole database, IS is applied to strata deriving from the regions, each region representing a set of patterns selected from the original training set. The application of IS is conditioned by the purity of each region (i.e. the extent to which different categories of patterns are mixed in the region) and the stratification strategy is adapted to the region components. For each region, the number of delivered instances is firstly limited via the use of an iterative process that takes into account the boundary complexity, and secondly optimized by removing the superfluous ones. The sets of instances determined from all the regions are put together to provide an intermediate instance set that undergoes a dedicated filtering process to deliver the final set. Experiments performed with various synthetic and real data sets demonstrate the advantages of the proposed approach.

Veri kavramı hayatımızın her alanında kullanılmaktadır. Bilişim sistemleri söz konusu olduğunda; veri tabanı, veri güvenliği, veri tutarlılığı, veri kirliliği kavramlarında olduğu gibi yanına yeni sözcükler alarak karşımıza çıkmaktadır.Atatürk Üniversitesi'nde kullanılan birçok sistem, çok fazla kişi tarafından kullanılmakta ve değişik şekillerde veriler girilmektedir. Girilen veriler aynı şeyi ifade etmesine rağmen kullanıcıların değişik bakış açılarından dolayı; bazen farkında olmadan, bazen de kasıtlı olarak farklı şekillerde girilebilmektedir. Bu farklılıklar sebebi ile tekrar tekrar eklenmiş olan veriler sistemin sağlıklı çalışmasını etkileyecek derecede veri kirliliğine sebep olabilmektedir. Sistemlerdeki bu tarz veri kirliliğinin önüne geçmenin çeşitli yöntemleri bulunmaktadır. Bu yöntemler kullanıcıların sistemdeki verilere müdahalesini kısıtlamak/engellemek ve yeni kayıt girilirken çeşitli kontroller yapıldıktan sonra eklemek şeklindedir. Atatürk Üniversitesi oldukça büyük ve köklü bir geçmişe sahip olmasından dolayı Öğrenci Bilgi Sistemine (ÖBS) ait veri tabanındaki veriler çok eski tarihlere uzanmaktadır. Daha önceleri yukarıda bahsedilen tedbirler uygulanmadığından dolayı, sistemde eskiden kalma kirli veriler mevcuttur. Ders adlarındaki veri kirliliği, ÖBS de en çok karşılaşılan ve en çok soruna sebep olan kirliliktir. Bu çalışmamızda aynı isim ve krediye sahip derslerin tek kayıtta birleştirilmesi ve aslında aynı olup farklı şekilde yazılmış olan derslerin tespit edilerek bunların da tek bir kayıtta birleştirilmesi amaçlanmıştır. Bu çalışma kapsamında ders adlarında bazı düzeltmeler yapılmış ve akabinde aynı isimli dersler birleştirilmiştir. Dizge karşılaştırma algoritmalarından Damerau-Levenshtein algoritması kullanılarak benzer isimli dersler tespit edilmiş ve bunlardan da birleştirilmesi uygun görülen dersler birleştirilmiştir. The concept of data is used in all areas of our lives. When it comes to information systems, the word data is used with another words alongside. Such as database, data safety, data integrity, data pollution etc. The systems used in Atatürk University, are used by many people and data is entered in different ways. Although the input data indicate the same thing, due to the different approaches of the users; sometimes unwittingly, sometimes intentionally, it could be entered in different forms. Data which is repeatedly added due to these different approaches, could cause data corruption that will affect the healthy operation of the system. There are various methods of preventing such data pollution in systems. These methods are to restrict / prevent users from interfering with the data in the system and to make various checks while entering the new record. Since Atatürk University has a very large and deep-rooted history, the data in the database of the Student Information System (SIS) goes back to very old dates. Since measures mentioned above had not been applied in earlier time, there are some old dirty data in the system. The data pollution in the course names is the most encountered pollution and causes the most problems in SIS. In this study, it is aimed to combine the courses with the same name and credits in a single record. It is also aimed to determine the courses that are actually the same but typed differently, and combine them in a single record. Within the scope of this study, some corrections have been made in the course names and then the courses with the same name were combined. Similarly named courses were determined by using Damerau-Levenshtein Algorithm which is one of string comparison algorithms. Similarly named courses which are agreed to be same ones, were combined in a single record. 126

Bu çalışmanın temel amacı, bireylerin genel sağlık durumunu etkileyen faktörleri veri madenciliği teknikleri ile belirlemektir. Bu amaç doğrultusunda, 2014 yılında Türkiye İstatistik Kurumu tarafından yapılan Türkiye Sağlık Araştırmasına ait B grubu mikro veri seti temin edilmiştir. Daha sonra çeşitli manipülasyon yöntemleriyle veri madenciliği analizlerine uygun hale getirilen veri seti üzerinde CHAID, QUEST ve C&R Tree algoritmaları uygulanmıştır. Analiz sonuçlarına göre kullanılan üç algoritma da genel sağlık durumu üzerinde en çok etkiye sahip faktörlerin, 6 ay ya da daha uzun süren veya sürmesi beklenen sağlık problemi ve herhangi bir sağlık problemi nedeniyle günlük faaliyetlerin 6 ay ve daha uzun süre kısıtlanma durumu olduğunu tespit etmiştir. Karar ağacı algoritmaları birbirleri ile kıyaslandığında ise CHAID algoritmasının hem QUEST hem de C&R Tree algoritmasına göre daha iyi sonuçlar verdiği gözlenmiştir. The main purpose of this study is to determine the factors affecting general state of health of individuals by data mining techniques. In accordance with this purpose, B group micro data set of the Turkish Health Research conducted by the Turkish Statistical Institute in 2014 was provided. Afterwards, CHAID, QUEST and C&R Tree algorithms were applied on the data set that was made suitable for data mining analysis with data pre-processing methods. The three algorithms used according to the results of the analysis found that the factors with the greatest impact on the general state of health, the health problem which is expected to last for 6 months or longer, and the daily activities are restricted for 6 months or longer due to any health problem. When the decision tree algorithms are compared with each other, it is observed that the CHAID algorithm gives better results than both the QUEST and C&R Tree algorithms. 152

Graphics processing units have proved its capability for general purpose computing in many research areas. In this paper, we propose the mechanism and implementation of a database system that encrypts and decrypts data by using GPU. The proposed mechanism is mainly designed for a database system that requires data encryption and decryption to support high security level or ODBS. By exploiting the computation capability of GPU, we achieve not only a fast encryption and decryption time per operation but also a higher overall performance of a database system by offioading computation to GPU. Moreover, the proposed system includes a mechanism which can decide whether to offload computation to GPU or not for more performance gain. We implemented the AES algorithm based on CUDA framework and integrate with MySQL, a commodity database system. Our evaluation demonstrates that the encryption and decryption on GPU shows eight times better performance compared that on CPU when the data size is 16 MB. We also show that the proposed system alleviates the utilization of CPU and the overall performance of database system is improved by offioading heavy encrypting and decrypting computation to GPU.

Traditional Database Management System (DBMS) software relies on hard disks for storing relational data. Hard disks are cheap, persistent, and offer huge storage capacities. However, data retrieval latency for hard disks is extremely high. To hide this latency, DRAM is used as an intermediate storage. DRAM is significantly faster than disk, but deployed in smaller capacities due to cost and power constraints, and without the necessary persistency feature that disks have. Non-Volatile Memory (NVM) is an emerging storage class technology which promises the best of both worlds. It can offer large storage capacities, due to better scaling and cost metrics than DRAM, and is non-volatile (persistent) like hard disks. At the same time, its data retrieval time is much lower than that of hard disks and it is also byte-addressable like DRAM. In this paper, we explore the implications of employing NVM as primary storage for DBMS. In other words, we investigate the modifications necessary to be applied on a traditional relational DBMS to take advantage of NVM features. As a case study, we have modified the storage engine (SE) of PostgreSQL enabling efficient use of NVM hardware. We detail the necessary changes and challenges such modifications entail and evaluate them using a comprehensive emulation platform. Results indicate that our modified SE reduces query execution time by up to 40% and 14.4% when compared to disk and NVM storage, with average reductions of 20.5% and 4.5%, respectively. The research leading to these results has received funding from the European Union’s 7th Framework Programme under grant agreement number 318633, the Ministry of Science and Technology of Spain under contract TIN2015-65316-P, and a HiPEAC collaboration grant awarded to Naveed Ul Mustafa.

Conference of 4th ACM International Workshop on Security in Cloud Computing, SCC 2016 ; Conference Date: 30 May 2016; Conference Code:121977; International audience; The wide use of cloud computing and of data outsourcing rises important concerns with regards to data security resulting thus in the necessity of protection mechanisms such as encryption of sensitive data. The recent major theoretical breakthrough of finding the Holy Grail of encryption, i.e. fully homomorphic encryption guarantees the privacy of queries and their results on encrypted data. However, there are only a few studies proposing a practical performance evaluation of the use of homomorphic encryption schemes in order to perform database queries. In this paper, we propose and analyse in the context of a secure framework for a generic database query interpreter two different methods in which client requests are dynamically executed on homomorphically encrypted data. Dynamic compilation of the requests allows to take advantage of the different optimizations performed during an off-line step on an intermediate code representation, taking the form of boolean circuits, and, moreover, to specialize the execution using runtime information. Also, for the returned encrypted results, we assess the complexity and the efficiency of the different protocols proposed in the literature in terms of overall execution time, accuracy and communication overhead.

[EN] This paper presents an alternative to cluster mixed databases. The main idea is to propose a general method to cluster mixed data sets, which is not very complex and still can reach similar levels of performance of some good algorithms. The proposed approach is based on codifying the categorical attributes and use a numerical clustering algorithm on the resulting database. The codification proposed is based on polar or spherical coordinates, it is easy to understand and to apply, the increment in the length of the input matrix is not excessively large, and the codification error can be determined for each case. The proposed codification combined with the well known k-means algorithm showed a very good performance in different benchmarks and has been compared with both, other codifications and other mixed clustering algorithms, showing a better or comparable performance in all cases., The authors acknowledge the partial funding of this work by the National projects DPI2007-66728-C02-01 and DPI2008-06737-C02-01.

A software application for automatic descriptive feature extraction from image-objects, FETEX 2.0, is presented and described in this paper. The input data include a multispectral high resolution digital image and a vector file in shapefile format containing the polygons or objects, usually extracted from a geospatial database. The design of the available descriptive features or attributes has been mainly focused on the description of agricultural parcels, providing a variety of information: spectral information from the different image bands; textural descriptors of the distribution of the intensity values based on the grey level co-occurrence matrix, the wavelet transform and a factor of edgeness; structural features describing the spatial arrangement of the elements inside the objects, based on the semivariogram curve and the Hough transform; and several descriptors of the object shape. The output file is a table that can be produced in four alternative formats, containing a vector of features for every object processed. This table of numeric values describing the objects from different points of view can be externally used as input data for any classification software. Additionally, several types of graphs and images describing the feature extraction procedure are produced, useful for interpretation and understanding the process. A test of the processing times is included, as well as an application of the program in a real parcel-based classification problem, providing some results and analyzing the applicability, the future improvement of the methodologies, and the use of additional types of data sets. This software is intended to be a dynamic tool, integrating further data and feature extraction algorithms for the progressive improvement of land use/land cover database classification and agricultural database updating processes. © 2011 Elsevier B.V., The authors appreciate the financial support provided by the Spanish Ministerio de Ciencia e Innovacion and the FEDER in the framework of the Project CGL2009-14220 and CGL2010-19591/BTE, the Spanish Institut Geografico Nacional (IGN), Institut Cartografico Valenciano (ICV), Institut Murciano de Investigacion y Desarrollo Agrario y Alimentario (IMIDA) and Banco de Terras de Galicia (Bantegal).

Enhancing the performance of large database systems depends heavily on the cost of performing join operations. When two very large tables are joined, optimizing such operation is considered one of the interesting research topics to many researchers, especially when both tables, to be joined, are very large to fit in main memory. In such case, join is usually performed by any other method than hash Join algorithms. In this paper, a novel join algorithm that is based on the use of quadtrees, is introduced. Applying the proposed algorithm on two very large tables, that are too large to fit in main memory, is proven to be fast and efficient. In the proposed new algorithm, both tables are represented by a storage efficient quadtree that is designed to handle one-dimensional arrays (1-D arrays). The algorithm works on the two 1-D arrays of the two tables to perform join operations. For the new algorithm, time and space complexities are studied. Experimental studies show the efficiency and superiority of this algorithm. The proposed join algorithm requires minimum number of I/O operations and operates in main memory with O(n log (n/k)) time complexity, where k is number of key groups with same first letter, and (n/k) is much smaller than n.

The product generation from hyperspectral sensor data has high requirements on the processing infrastructure, both hardware and software. The Airborne Prism Experiment (APEX) processing and archiving facility has been set up to provide for the automated generation of level-1 calibrated data and user-configurable on-demand product generation for higher processing levels. The system offers full reproducibility of user orders and processing parameters by employing a relational database. The flexible workflow software allows for the quick integration of novel algorithms or the definition of new processing sequences. Reprocessing of data is supported by the archiving approach. Configuration management based on the database enables the control over different versions of processing modules to be applied. The system is described with a focus on the APEX instrument; however, its generic design allows adaptation to other sensor systems.

This set of three case studies explores the intersection of openness, digital governance, andhigh quality information in Estonia,1 Finland, and Norway with the aim of identifying lessonsthat will support the same objectives in lower resource countries. Openness, a key aspect ofthe international agenda for increasing transparency and accountability, for reducing public sectorcorruption, and for strengthening economic performance, rests on the principle that citizenshave a right to know what their governments are doing and to benefit from using governmentinformation. Goals for open, accountable, and inclusive governance rest on the assumption thattrustworthy information is available and can be shared meaningfully through strategies for digitalgovernance. This assumption needs to be examined. Does reliable and complete informationexist across lower resource countries? Can it be accessed readily? Will it survive through time?

The use of biological weapons represents a great concern both from a military and civilian point of view. The early detection of biological warfare agents (BWAs) in atmosphere is a huge challenge that could be addressed through UV-LIF (Ultra Violet Laser Induced Fluorescence) techniques. Fluorescence measurements of aerosol particles can provide gross discrimination between bio-agents and atmospheric background particles, In this work we intend to investigate the capability of discriminating among different biological warfare agents (BWA) through the analysis of the optical emission spectra. To accomplish this task, a deep knowledge of fluorescence features with different boundary conditions is required, in order to create a database of comparable spectral fingerprints. Preliminary results, obtained through a laboratory setup with a standard UV lamp source, showed that significant differences can be appreciated among BWAs simulants' spectra. This represents a first step towards the implementation of a spectral database and a laser-based biological stand-off identification technique.

For signature files we propose a new false drop estimation method for databases with varying record lengths. Our approach provides more accurate estimation of the number of false drops by considering the lengths of individual records instead of using the average number of terms per record. In signature file processing, accurate estimation of the number of false drops is essential to obtain a more accurate signature file and therefore to obtain a better (query) response time. With a formal proof we show that under certain conditions the number of false drops estimated by considering the average record length is less than or equal to the precise 'expected' estimation which is based on the individual record lengths. The experiments with real data show that the proposed method accurately estimates the number of false drops and the actual response time. Depending on the space overhead, our approach obtains up to 33% and 20% response time improvements for the conventional sequential and new efficient multiframe signature file methods, respectively.

Visual query systems (VQSs) are query systems for databases that use visual representations to depict the domain of interest and express related requests. VQSs can be seen as an evolution of query languages adopted into database management systems; they are designed to improve the effectiveness of the human?computer communication. Thus, their most important features are those that determine the nature of the human?computer dialogue. In order to survey and compare existing VQSs used for querying traditional databases, we first introduce a classification based on such features, namely the adopted visual representations and the interaction strategies. We then identify several user types and match the VQS classes against them, in order to understand which kind of system may be suitable for each kind of user. We also report usability experiments which support our claims. Finally, some of the most important open problems in the VQS area are described.

The paper is dedicated to issues concerning simulation and analysis of hierarchical multiprocessor systems oriented to database applications. Requirements for a parallel database system model are given. A survey and comparative analysis of known parallel database system models are presented. A new multiprocessor database system model is introduced. This model allows us to simulate and evaluate arbitrary hierarchical multiprocessor configurations in the context of the OLTP class database applications. Examples of using the database multiprocessor model for simulation study of multiprocessor database systems are presented. © Pleiades Publishing, Ltd., 2013.

In the bottom-up evaluation of logic programs and recursively defined views on databases, all generated facts are usually assumed to be stored until the end of the evaluation. Discarding facts during the evaluation, however, can considerably improve the efficiency of the evaluation: the space needed to evaluate the program, the I/O costs, the costs of maintaining and accessing indices, and the cost of eliminating duplicates may all be reduced. Given an evaluation method that is sound, complete, and does not repeat derivation steps, we consider how facts can be discarded during the evaluation without compromising these properties. We show that every such space optimization method has certain components, the first to ensure soundness and completeness, the second to avoid redundancy (i.e., repetition of derivations), and the third to reduce “fact lifetimes” (i.e., the time period for which each fact must be retained during evaluation). We present new techniques based on providing bounds on the number of derivations and uses of facts, and using monotonicity constraints for each of the first two components, and provide novel synchronization techniques for the third component of a space optimization method. We describe how techniques for each of the three components can be combined in practice to obtain a space optimization method for a program. Our results are also of importance in applications such as sequence querying, and in active databases where triggers are defined over multiple “events.”, © ACM

The aim of this paper is to describe a novel and completely automated technique for carotid artery (CA) recognition, far (distal) wall segmentation, and intima-media thickness (IMT) measurement, which is a strong clinical tool for risk assessment for cardiovascular diseases. The architecture of completely automated multiresolution edge snapper (CAMES) consists of the following two stages: 1) automated CA recognition based on a combination of scale-space and statistical classification in a multiresolution framework and 2) automated segmentation of lumen-intima (LI) and media-adventitia (MA) interfaces for the far (distal) wall and IMT measurement. Our database of 365 B-mode longitudinal carotid images is taken from four different institutions covering different ethnic backgrounds. The ground-truth (GT) database was the average manual segmentation from three clinical experts. The mean distance ± standard deviation of CAMES with respect to GT profiles for LI and MA interfaces were 0.081 ± 0.099 and 0.082 ± 0.197 mm, respectively. The IMT measurement error between CAMES and GT was 0.078 ± 0.112 mm. CAMES was benchmarked against a previously developed automated technique based on an integrated approach using feature-based extraction and classifier (CALEX). Although CAMES underestimated the IMT value, it had shown a strong improvement in segmentation errors against CALEX for LI and MA interfaces by 8% and 42%, respectively. The overall IMT measurement bias for CAMES improved by 36% against CALEX. Finally, this paper demonstrated that the figure-of-merit of CAMES was 95.8% compared with 87.4% for CALEX. The combination of multiresolution CA recognition and far-wall segmentation led to an automated, low-complexity, real-time, and accurate technique for carotid IMT measurement. Validation on a multiethnic/multi-institutional data set demonstrated the robustness of the technique, which can constitute a clinically valid IMT measurement for assistance in atherosclerosis disease management. © 2011 IEEE. 21 3 1211 1222 Cited By :37

Hızla gelişen dünyada varlığını sürdürmek isteyen ülkeler bilginin üretilmesine ve üretilen bilginin kullanılarak yeni uygulama alanlarına taşınmasına önem vermeye başlamıştır. Yeni fikirlerin üretilmesinde farklı bilgi ve beceriler ile donanımlı bilim insanlarının birbirlerini tamamlayarak bilgi paylaşımında bulunması modern araştırma sistemlerinde işbirliği çalışmaları ile teşvik edilmektedir.Son yıllarda araştırma işbirliklerinin incelenmesi matematiksel ve istatistiksel yöntemlerin kullanıldığı bibliyometrik çalışmaların odak noktası haline gelmiştir. Matematiksel ve istatistiksel yöntemlerin kullanıldığı bibliyometrik çalışmalara ait analizler, atıf veri tabanlarının kullanılması ile elde edilmektedir. 50 yılı aşkın süredir bibliyometrik çalışmaların yapılabildiği kapsamlı veri tabanı olma özelliğini taşıyan Bilimsel Bilgi Enstitüsü (Institute for Scientific Information, ISI) bu özelliğini 2004 yılına kadar korumuştur. Ancak, 2004 yılında Scopus'un kurulması ile beraber atıf indeksleyen veri tabanları arasında bir rekabet ortamı oluşmuştur. Bu bağlamda her iki veri tabanında Türkiye'nin profilini çıkarmak, sosyal ve beşeri bilimler ile temel bilimler alanlarında ortak yazarlı çalışmaları karşılaştırıp, disiplinler arası farklılıkları tanımlamaya ihtiyaç duyulmuştur. Bu ihtiyaç doğrultusunda tezin konusu; 2001-2010 yılları arasında ortak yazarlı çalışmalarda temel bilimler alanında matematik konu başlığında üretilen yayınları Orta Doğu Teknik Üniversitesi (ODTÜ) ve Bilkent Üniversitesi örnekleri üzerinden ülkeler, kurumlar ve yazarlar arası işbirliği çalışmalarını değerlendirerek, kullanılan dergileri yine işbirliği çerçevesinde karşılaştırmaktır.2001-2010 yılları arasında Türkiye adresli makaleler temel alınarak karşılaştırma yapıldığında, WoS ve Scopus veri tabanlarının yapılarından kaynaklanan farklılıklar bulunduğu saptanmıştır. Ayrıca her iki veri tabanında çıkan sonuçlar değerlendirildiğinde Türkiye'nin uluslararası ortak yazarlı çalışma oranının dünya ortalamasının altında bulunduğu tespit edilmiştir. In order to continue their existence in a rapidly developing world, countries have given importance to the production of knowledge along with its transmission to new fields of application. During the production of new ideas, sharing of knowledge between scientists with alternative knowledge and skills has been encouraged within the modern research systems.Recently, the analysis of collaboration has been the main focus point of bibliometrical studies, where mathematical and statistical methods are used. The analyses, which belong to these studies, are obtained through the utilization of citation databases. The Institute for Scientific Information, having been a comprehensive database where bibliometrical studies could be done, continued its reputation until 2004. However, a competitive environment has been created among the databases indexing citations with the establishment of Scopus in 2004. Therefore, a need arose for revealing the profile of Turkey in both databases along with comparing the studies with co-authors in the fields of social and human sciences as well as physical sciences in order to define interdisciplinary differences.In the light of this requirement, the topic of the thesis is to compare and evaluate the collaborated publications among countries, institutions and authors through the samplings of Middle East Technical University and Bilkent University in terms of studies with co authors listed under the title of mathematics in the field of basic sciences between 2001 and 2010.From the comparison of articles submitted from Turkey between 2001 and 2010, differences have been determined depending on the structures of WoS and Scopus databases. Additionally, the results obtained from both databases concluded that the percentage of articles with international co authors have found to be below the world average. 264

Konu: Elektronik Ortamda Kitap Satışı Veritabanı Yapısı Örnek Bir UygulamaÖZETElektronik ticaret günlük hayatımızdaki yerini almış bulunmaktadır. Çok çeşitli ürün grupları internet ortamında satılmaktadır. Dünyada olduğu gibi, ülkemizdede internetde en çok satılan ürün kitaptır. Bu gün ciro bazında dünyanın en büyük alışveriş siteleri kitap satış siteleridir. İnternet ortamında kitap satışı hedeflendiğinde, iyi bir site ve veritabanı tasarımına ihtiyaç bulunmaktadır. Site tasarımı ile anlatılmak istenen, görsellik kadar sitenin içeriği ve fonksiyonları ile birlikte ihtiyaçlara cevap verebilmesidir. Sitenin veritabanı yapısının kitap satışına uygun dizayn edilmesi gerekmektedir. Tablolar ve bunlar arasındaki ilişkiler özel olarak tasarlanmalıdır. Bu tezde, bilişim ve iletişim teknolojileri açıklanarak başlanmakta, ülkemizde kitabın basımından satışına kalan olan süreçler ortaya konulmakta, ideal bir web sitesinin özellikleri tanımlanmakta ve örnek bir sitenin veritabanı yapısı tablolar ve ilişkilerle birlikte incelenmektedir.Subject: Database Structure of Book Sales at Eletronic Media, An application ExampleABSTRACTElectronic commerce has taken its place in our daily lives. Various product groups sold on the internet. As in the world, the best-selling product in our country in internet is book. These days the world's biggest shopping sites on the basis of book sales turnover sites. Book sales targeted in internet environment, there is a need of a good site and database design. Site design means, with the site's content and functions of visual ability to answer to the needs. Database structure of the site should be designed in accordance with the sale of the book. tables and relations between them specially designed. In this thesis, information and communication technologies is beginning to be explained, the publication of the book examines the processes of the sale of our country, described the ideal characteristics of a web site and tables in the database structure and relationships are examined with a sample site.

This thesis deals with database systems referred to as NoSQL databases. In the second chapter, I explain basic terms and the theory of database systems. A short explanation is dedicated to database systems based on the relational data model and the SQL standardized query language. Chapter Three explains the concept and history of the NoSQL databases, and also presents database models, major features and the use of NoSQL databases in comparison with traditional database systems. In the fourth chapter I focus on the various representatives of NoSQL databases, in particular the ones that are most frequently used. In the next chapter, I have taken a practical look at a NoSQL database, specifically Apache Cassandra. I briefly describe the steps required to launch Apache Cassandra and its administration tools. In this practically-oriented chapter, I also show basic operations performed over a sample database using Cassandra CLI, its interactive command line interface. The purpose of this chapter is to make the reader familiar with the method of working with the Apache Cassandra database system and to point out some of its specific aspects. The primary objective of this thesis is to acquaint readers with the most important features and representatives of NoSQL databases and the potential for their practical use.

Bu tez çalışmasında veritabanında bahsedilmiş, veritabanı türleri ve günümüzde yaygın kullanılan ticari veritabanları incelenmiştir. En çok kullanılan oracle veritabanı üzerinden çalışan uygulamaların güvenlik ve performans sorunlarının tespit edilmesi ve çözüm önerilerinin yapan bir yazılım geliştirilmiştir. Geliştirilen yazılım, oracle veritabanı kullanan kullanıcıların gelecekle ilgili donanım ve kaynak planlamasının yapılmasına yardımcı olmaktır. Yazılımın içindeki örnek uygulamalar ve sorun çözme yöntemleriyle veritabanı yöneticilerinin bilgilerinin gelişmesine katkı sağlamaktadır. Aynı zamanda veritabanı ve uygulamalarının sağlıklı ve güvenli çalışmasına yardımcı olmaktadır. Tez 2011 yılında yapılmıştır ve 128 sayfadan oluşmaktadır., In the scope of this thesis, database concept and the types of databases are mentioned, widespreadly used commercial databases are examined. Since oracle database is the most used and widespreadly known database, a software application has been developed that discover, determine, make suggestions in order to solve the security and performance issues in the oracle databases. Developed software helps oracle database users with hardware and resource planning in the future. The best practices and samples in the software contributes significantly to expand database administrator's knowledge and ability to manage the database. This software application ensures database and their applications running healty and secure at the same time. This thesis has been completed in 2011 and it has 128 pages.

The ASTEC/Sophaeros computer code has been developed to model transport of reactive gases and aerosols in pipe flows with extensive coverage of chemical and physical phenomena. As part of the ASTEC severe-accident code co-developed by IRSN in France and GRS (Gesellschaft für Anlagen- und Reaktorsicherheit) in Germany, it is principally used to evaluate so-called radioactive source terms released to the environment in the event of potential accidents affecting water-cooled nuclear reactors. A major uncertainty in the past concerned the impact of chemistry on radioactivity transfer where the treatment of chemical phenomena was recognized as inadequate. Work described here, involving mainly systematic identification of relevant species and thermodynamic- data verification, has vastly improved this situation leading in particular to creation of a comprehensive database with fully-referenced sources of information. Further prospective improvements in this area are described.

BioPAX (Biological Pathway Exchange) is a standard language to represent biological pathways at the molecular and cellular level. Its major use is to facilitate the exchange of pathway data (http://www.biopax.org). Pathway data captures our understanding of biological processes, but its rapid growth necessitates development of databases and computational tools to aid interpretation. However, the current fragmentation of pathway information across many databases with incompatible formats presents barriers to its effective use. BioPAX solves this problem by making pathway data substantially easier to collect, index, interpret and share. BioPAX can represent metabolic and signaling pathways, molecular and genetic interactions and gene regulation networks. BioPAX was created through a community process. Through BioPAX, millions of interactions organized into thousands of pathways across many organisms, from a growing number of sources, are available. Thus, large amounts of pathway data are available in a computable form to support visualization, analysis and biological discovery.

Gelişen teknolojiye paralel olarak sayısal görüntülerin üretimi ve kullanımında büyük bir artış olmuştur. Bu artış verilerin uygun ortamlarda arşivlenmesi, yönetimi ve ihtiyaç duyulduğunda kısa surede ulaşılarak kullanıma sunulması ile ilgili sorunları da beraberinde getirmiştir. Bu sorunların en kolay yoldan çözümü bu amaç için ticari olarak üretilmiş arşiv ve yönetim yazılımları kullanmaktır. Ancak bu yöntemin maliyeti de bu oranda yüksek olmaktadır. Sorunun bir diğer çözümü ise doğrudan amaca yönelik olarak ve ücretsiz, açık kaynak kodlu yazılımlar kullanarak geliştirilecek yeni bir yazılım üretmektir. Bu çalışmada bu yöntem denenmiş ve sayısal görüntülerin bir düzen içerisinde bir veri tabanında bilgileri tutularak, gerektiğinde bu verilere kolayca ulaşılması sağlanmıştır. Geliştirilen yazılım tamamen ücretsiz programlama dili yazılımları ve veri tabanı yönetim yazılımları kullanılarak ortaya çıkarılmıştır. Temel olarak hava fotoğrafları, uydu görüntüleri, sayısal Ortofoto ve Ortofoto haritaları, Sayısal Arazi Modellerini ve sayısal haritaları ele almıştır. Bu veriler ile ilgili bilgilerin girilmesi, düzenlenmesi ve sorgulanması ile ilgili bölümler oluşturulmuştur. Ortaya çıkan yazılım, sıfır maliyette, milli, ve gelişime açık bir yazılımdır. Ayrıca benzer özellik taşıyan birçok ticari yazılımın ortak özelliklerini taşımaktadır., In parallel to developing technology, production and use of digital images has become a big increase. Along with this increase, data archiving, management and use problems were observed. . The easiest way to solve these problems is to use archive and management software that commercially produced for this purpose. However, the cost of this method is a little higher. Another solution is using free, open source software. In this study we tested this method. Information will be kept in a database belonging to the digital images, easy access to this data to be provided when necessary. This software is developed with free programming language, and free data base management software was used. Basically, aerial photographs, satellite images, digital Orthophoto and Orthophoto maps, digital maps, Digital Terrain Model were used. Data entering, editing and querying sections have been set up. Program has been developed with zero cost, and is fully national. Also includes common features of many commercial software.

Information is valuable asset of any organization which is stored in databases. Data in such databases may contain credit card numbers, social security number or personal medical records etc. Failing to protect these databases from intrusions will result in loss of customer's confidence and might even result in lawsuits. Traditional database security mechanism does not design to detect anomalous behavior of database users. There are number of approaches to detect intrusions in network. But they cannot detect intrusions in database. There have been very few ID mechanisms specifically tailored to database systems. We propose transaction level approach to detect malicious behavior in database systems enabled with Role Based Access Control (RBAC) mechanism., by Udai Pratap Rao, G. J. Sahani and Dhiren R. Patel

Technical report TR08-13. The vast number of on-line biological and medical databases available can be a great resource for medical researchers. However, the different types of data and interfaces available can be overwhelming for many medical researchers to learn. Moreover, the available resources lack needed integration. Here we focus on an important task in medical research: to provide researchers with promoter analysis for a given gene. PROM-OOGLE is a web based data mining tool that provides a means for researchers to take a gene name of interest and obtain its promoter sequence in return after automatic integration of text databases. Additionally, the program is capable of returning multiple promoters from different genes allowing researchers to study how promoters regulate genes. This tool facilitates the process of acquiring information on a promoter and may lead to interesting discoveries. | TRID-ID TR08-13

Çalışmada dağıtık veri tabanı sistemleri gelişim süreci ve bu gelişimi etkileyen faktörler incelenmiştir. Dağıtık veri tabanı sistemleri sadece bilgi ve iletişim teknolojileri ile değil sosyal ve kültürel birçok faktör ile etkileşim halinde olmuştur. Bilgi toplumuna geçilmesi, bununla beraber küreselleşme eğiliminin başlaması bilgi ve iletişim teknolojilerindeki birçok gelişmeyi tetiklemiştir. Bu süreçte öne çıkan diğer kavram ise bilgi yönetimidir. Bunların gelişmelerin veri tabanı teknolojileri kullanılarak veriden bilgi çıkarımı ve elde edilen bu bilgilerin doğru zamanda doğru yerde kullanılması organizasyonların rekabet güçlerini arttırmada büyük rol oynamaya başlamıştır.Dağıtık veri tabanı sistemleri ve optimizasyonu için gerekli süreçler tespit edilip incelendikten sonra sağlık sektöründe veri tabanı sistemleri ve dağıtık veri tabanı sistemleri ile ilgili bir araştırma çalışması gerçekleştirilmiştir. Araştırmanın sonucunda sağlık sektöründe kullanılan bilgi ve iletişim teknolojilerinin diğer sektörlerde olduğundan daha geç geliştiği gözlemlenmiştir. Bunun yanında sürekli artan insan nüfusu ile hizmet verebilecek doktor sayısının arasındaki farkın büyümesi sonucu bilgi paylaşımının daha da büyük önem taşımaya başladığı ve bu sebeple araştırmacılar farklı branşlarda sağlık sektöründe tutulan verilerin entegre edilmesiyle ilgilenmişlerdir.Bu çalışmanın amacı araştırmanın yapıldığı merkezde kurulması planlanan veri tabanı sisteminin merkezi veya dağıtık olma durumunda sağlayacağı avantajlar ve dezavantajların belirlenmesidir. Uygulama sonucunda literatürde daha önce dağıtık veri tabanı sistemleri optimizasyonu ile ilgili gerçekleştirilmemiş olan merkezi ve dağıtık veri tabanı sistemi performans karşılaştırması elde edilmiştir. Çalışmada yapılan uygulamada bir tüp bebek merkezi için dağıtık veri tabanı sistemi oluşturulmuş ve bu sistem merkezi veri tabanı sistemiyle karşılaştırılmıştır. Karşılaştırma merkezde kullanılan uygulamalara alınan yanıt süreleri arasında yapılmıştır. In this study development of distributed database systems and the factors efecting this development has been analyzed. Distributed database systems are not only related with information and communication technologies but they are also in interaction with varying social and cultural factors. Going towards information society and beginning of globalization paradigm triggered varying developments in information and communication technologies. Another important concept among these is knowledge management. As a result of these knowledge discovery form stored data, and using these knowledge at the right time at the right place using database technologies, increased companies competitive advantage.After identifying the necessary processes for optimization a survey has been conducted in healthcare industry. As a result survey it has been observed that information and communication technologies have been developed slowly in healthcare industry then the other industries. Also, because of increasing difference between the population and the medical doctors to serve patients, researchers have been interested in integration of data stored in healthcare industry.The aim of this study is to compare the advantages and disadvantages of distributed and central data base systems with an application in the center where the survey has been conducted. As a result the performance comparison between distributed and centralized data base systems, which has not been measured before have been achieved. In this application a distributed data base system for an infertility clinic have been designed and compared with a centralized one. The comparison has been done between response times of applications used. 261

This paper argues that the systemic nature of contemporary consumer surveillance undermines the most fundamental principle of free market economics: consumer sovereignty. Specifically, this paper argues that the rise of an ‘information’ or ‘knowledge’ society in conjunction with neoliberal capitalism has entrenched routine forms of surveillance within commercial strategies by employing networked databases as a primary medium for the articulation of consumer sovereignty (choice/demand). The communicative relationship between consumers and producers within the market involves effectively ‘listening’ (and then responding) to consumer needs and wants in a timely manner. Surveillance is therefore not only necessary for the operation of globalized consumer capitalism, it is also the primary means by which consumer communicate their sovereignty within the marketplace. By turning to the work of Harold Innis and the intellectual tradition known as medium theory, this paper will theorize how in linking the actions of individual consumers to the decision-making capacities of trans-national corporations (TNC), the prevalence of consumer databases violates the fundamental neutrality of the market, and thus sovereignty, of individual consumers. In sum, by treating the database as a distinct communication medium, this paper will highlight how the commercial mediation of identity under neoliberalism can conceal the potential for the uneven geographic development, the marginalization of ‘less valuable’ consumer segments, and the exploitation of individual vulnerabilities through behavior and profile modeling.

The paper is dedicated to a problem of effective query processing in cluster database systems. An original approach to data allocation and replication at nodes of a cluster system is presented. On the basis of this approach the load balancing method is developed. Also, we propose a new method for parallel query processing on the cluster systems. All described methods have been implemented in "Omega" parallel database management system prototype. Our experiments show that "Omega" system demonstrates nearly linear scalability even in presence of data skew. © 2010 Springer-Verlag.

SQL tuning - the attempt to improve a poorly-performing execution plan produced by the database query optimizer - is a critical aspect of database performance tuning. Ironically, as commercial databases strive to improve on the manageability front, SQL tuning is becoming more of a black art. It requires a high level of expertise in areas like (i) query optimization, run-time execution of query plan operators, configuration parameter settings, and other database internals; (ii) identification of missing indexes and other access structures; (iii) statistics maintained about the data; and (iv) characteristics of the underlying storage system. Since database systems, their workloads, and the data that they manage are not getting any simpler, database users and administrators often rely on trial and error for SQL tuning. In this paper, we take the position that the trial-and-error (or, experiment-driven) process of SQL tuning can be automated by the database system in an e cient manner; freeing the user or administrator from this burden in most cases. A number of current approaches to SQL tuning indeed take an experiment-driven approach. We are prototyping a tool, called zTuned, that automates experiment-driven SQL tuning. This paper describes the design choices in zTuned to address three nontrivial issues: (i) how is the SQL tuning logic integrated with the regular query optimizer, (ii) how to plan the experiments to conduct so that a satisfactory (new) plan can be found quickly, and (iii) how to conduct experiments with minimal impact on the user-facing production workload. We conclude with a preliminary empirical evaluation and outline promising new directions in automated SQL tuning. Copyright 2009 ACM.

Bu çalışmada Türkiye'den bir arkadaşlık sitesinin veritabanını incelenerek, site üzerinden tanışmış çiftlerin sahip olduğu ortak özellikler araştırılmıştır.Veri Madenciliği araçlarından biri olan ?Association Rule Mining? `ten yararlanılarak, mesajlaşma ve kullanıcı verilerinden bir kural seti türetilmiş; bu kurallar da kullanıcının kendisine en uygun adayları listeleyebileceği bir öneri sisteminin geliştirilmesinde kullanılmıştır.Öneri sisteminin üretilen sonuçların kalitesinde yaptığı artış istatistik araçlarıyla test edilmiş, verilerin anlamlı olduğu sonucuna varılmıştır. In this study, the database of a Turkish online dating site is analyzed to reveal patterns in the personal features of matching couples.By using a functionality of data Mining, the Association Rule mining, a set of rules is extracted from the available messaging and user data. The rules are used for the development of a recommendation engine which is capable to give list of best potential matches to the site user.The performance of the recommendation engine is tested with statistical tools to find whether the increase in the quality of results is significant. 104

The conventional models of authorization have been designed for database systems supporting the hierarchical, network, and relational models of data. However, these models are not adequate for next-generation database systems that support richer data models that include object-oriented concepts and semantic data modeling concepts. Rabitti, Woelk, and Kim [14] presented a preliminary model of authorization for use as the basis of an authorization mechanism in such database systems. In this paper we present a fuller model of authorization that fills a few major gaps that the conventional models of authorization cannot fill for next-generation database systems. We also further formalize the notion of implicit authorization and refine the application of the notion of implicit authorization to object-oriented and semantic modeling concepts. We also describe a user interface for using the model of authorization and consider key issues in implementing the authorization model. © 1991, ACM. All rights reserved.

Self-managing solutions have recently attracted a lot of interest from the database community. The need for self-* properties is more evident in distributed applications comprising heterogeneous and autonomous databases and functionality providers. Such resources are typically exposed as Web Services (WSs), which encapsulate remote DBMSs and functions called from within database queries. In this setting, database queries are over WSs, and the data transfer cost becomes the main bottleneck. To reduce this cost, data is shipped to and from WSs in chunks however the optimum chunk size is volatile, depending on both the resources' runtime properties and the query. In this paper we propose a robust control theoretical solution to the problem of optimizing the data transfer in queries over WSs, by continuously tuning at runtime the block size and thus tracking the optimum point. Also, we develop online system identification mechanisms that are capable of estimating the optimum block size analytically. Both contributions are evaluated via both empirical experimentation in a real environment and simulations, and have been proved to be more effective and efficient than static solutions. © 2008 IEEE. 596 605 Conference code: 73145 Cited By :23

Increased availability of sensing, communication and computing equipment in modern vehicles presents opportunities for a generational advance in driver assistance and safety functions. However, the growth in the volume and complexity of data also presents challenges for its collection, maintenance and distribution. The SAFESPOT Local Dynamic Map (LDM) contains a structured model of the world. It acts as an interface between sensing modules and the safety applications. It enables applications to extract context-dependent views of the environment and the platform's state. These unique views differ in spatio-temporal scale, as well as the objects, attributes and relationships they contain. The ability to extract various views from a LDM is seen as an important tool in the development of multiple, advanced applications on a single platform.

Web prefetching is an attractive solution to reduce the network resources consumed by Web services as well as the access latencies perceived by Web users. Unlike Web caching, which exploits the temporal locality, Web prefetching utilizes the spatial locality of Web objects. Specifically, Web prefetching fetches objects that are likely to be accessed in the near future and stores them in advance. In this context, a sophisticated combination of these two techniques may cause significant improvements on the performance of the Web infrastructure. Considering that there have been several caching policies proposed in the past, the challenge is to extend them by using data mining techniques. In this paper, we present a clustering-based prefetching scheme where a graph-based clustering algorithm identifies clusters of "correlated" Web pages based on the users' access patterns. This scheme can be integrated easily into a Web proxy server, improving its performance. Through a simulation environment, using a real data set, we show that the proposed integrated framework is robust and effective in improving the performance of the Web caching environment. © 2007 Elsevier Ltd. All rights reserved. 34 4 309 323 Cited By :52

Cataloged from PDF version of article. Multimedia databases have gained popularity due to rapidly growing quantities of multimedia data and the need to perform efficient indexing, retrieval and analysis of this data. One downside of multimedia databases is the necessity to process the data for feature extraction and labeling prior to storage and querying. Huge amount of data makes it impossible to complete this task manually. We propose a tool for the automatic detection and tracking of salient objects, and derivation of spatio-temporal relations between them in video. Our system aims to reduce the work for manual selection and labeling of objects significantly by detecting and tracking the salient objects, and hence, requiring to enter the label for each object only once within each shot instead of specifying the labels for each object in every frame they appear. This is also required as a first step in a fully-automatic video database management system in which the labeling should also be done automatically. The proposed framework covers a scalable architecture for video processing and stages of shot boundary detection, salient object detection and tracking, and knowledge-base construction for effective spatio-temporal object querying. (c) 2008 Elsevier B.V. All rights reserved.