Search results for "Database"
showing 10 items of 2136 documents
Comparison of SQL Servers
2010
Šajā darbā apskatīti Microsoft SQL 2000, Microsoft SQL 2005 un Microsoft SQL 2008 serveri, veikta to vispārīgā un ātrdarbības salīdzināšana. Rezultātā tika noskaidrots, ka vairākums gadījumos Microsft SQL 2008 ir ātrāks par abiem pārējiem Microsoft SQL serveriem un tā funkcionalitāte ievērojami palīdz SQL pieprasījumu veidošanā.
Advanced Topics in Intelligent Information and Database Systems
2017
This book presents recent research in intelligent information and database systems. The carefully selected contributions were initially accepted for presentation as posters at the 9th Asian Conference on Intelligent Information and Database Systems (ACIIDS 2017) held from to 5 April 2017 in Kanazawa, Japan. While the contributions are of an advanced scientific level, several are accessible for non-expert readers. The book brings together 47 chapters divided into six main parts: • Part I. From Machine Learning to Data Mining.• Part II. Big Data and Collaborative Decision Support Systems,• Part III. Computer Vision Analysis, Detection, Tracking and Recognition,• Part IV. Data-Intensive Text P…
Shaping inter-firm collaboration in new product development in the automobile industry: A trade-off between a transaction and relational-based approa…
2008
Abstract Shaping collaboration in the new product development (NPD) has always been a very difficult task, especially in complex industries like the automobile one. This complexity is particularly true during the engineering phase of the NPD process, where different complex systems are to be designed in a collaborative way. Basically, two-kind of approaches have been observed in the literature and industry: one is more related to market transactions, specifically the west car-company style, the other is more relational based, as in the Japanese car-company style. Now, the increasing globalisation of the industry asks for a merge of the two approaches; indeed, the increasing use of standard …
Design of a knowledge and management system for starch bioconversion
2011
Abstract In this paper a knowledge acquisition and management system (KAMS) which allows the collection, analysis, ordering and storage of informations generated at starch liquefaction was developed. KAMS was structured on three levels: PostgreSQL as a backend, D2RQ as middle tier and Seaside as frontend. The system was used to store knowledge about the liquefaction process with the goal to be used as a decision support system in chosing the condition for this operation. The tests had shown that the implemented KAMS provides support for: Distributed acquisition of the scientific data generated by the researchers; Structured data storage; Support for the generation and storage of knowledge o…
READING WORDS, NUMB3R5 and $YMßOL$
2007
Words in alphabetic languages are processed via their constituents [1]. To recognize a printed word, we need to process the identity and position of its letters, hence distinguishing between cat and fat, or dog and god, but not between tABLe and TabLE, or and . Dehaene and colleagues [2] proposed a neuronal model with feed-forward connections only, according to which the brain decodes words through a hierarchy of local combination detectors in the occipito–infero–temporal pathway sensitive to increasingly larger fragments of words.
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Medication-related osteonecrosis of the jaw associated with implant and regenerative treatments : systematic review
2019
Background The aim of this study was to determine if the treatment with bisphosphonates other anti-resorptive and antiangiogenic agents influences the success of regenerative and / or implant treatments. Material and Methods We reviewed the literature from the last 5 years in the PubMed database, using the following words: “Sinus Floor Augmentation”[Mesh] OR “Dental Implants”[Mesh]) OR “Guided Tissue Regeneration”[Mesh]) AND “Osteonecrosis”[Mesh]. The articles were selected following the inclusion and exclusion criteria and were evaluated using the 22 items of the STROBE declaration. The following PICO clinical question was applied: Does the treatment with agents associated with drug osteon…
Red emitting [Ir(C^N)2(N^N)]+ complexes employing bidentate 2,2':6,2''-terpyridine ligands for light-emitting electrochemical cells
2014
2,2':6',2''-Terpyridine (tpy), 4'-(4-HOC6H4)-2,2':6',2''-terpyridine (1), 4'-(4-MeOC6H4)-2,2':6',2''-terpyridine (2), 4'-(4-MeSC6H4)-2,2':6',2''-terpyridine (3), 4'-(4-H2NC6H4)-2,2':6',2''-terpyridine (4) and 4'-(4-pyridyl)-2,2':6',2''-terpyridine (4) act as N^N chelates in complexes of the type [Ir(C^N)2(N^N)][PF6] in which the cyclometallating ligand, C^N, is derived from 2-phenylpyridine (Hppy) or 3,5-dimethyl-1-phenyl-1H-pyrazole (Hdmppz). The single crystal structures of eight complexes have been determined, and in each iridium(III) complex cation, the non-coordinated pyridine ring of the tpy unit is involved in a face-to-face π-stacking interaction with the cyclometallated ring of an …
Trimethylplatinum(IV) complexes with ON bidentate ligands
1972
Abstract Complexes of the trimethylplatinum(IV) moiety with bidentate monobasic salicylaldimines C 6 H 5 (OH)CHNR (R = ethyl, propyl, phenyl) have been prepared and characterized by IR, UV and NMR spectra and magnetic susceptibility measurements. The complexes are dimeric with double PtOPt bridges, and the metal appears to be pseudo-octahedrally hexacoordinated.
Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems
2014
The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This article presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations…