با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
501 |
MESCO (MEat Supply Chain Ontology): An ontology for supporting traceability in the meat supply chain
MESCO زنجیره تامین گوشت گوسفند: هستی شناسی برای حمایت از ردیابی در زنجیره تامین گوشت-2017 Traceability plays an important role in the food industry because it is directly connected with food
quality and safety. Safety, in fact, can only be guaranteed by following food products along the entire
supply chain. In the last years, a series of food safety scandals have invested the meat sector, highlighting
the lack of common standards for information encoding and management and the inability to link food
products with the elements involved in their transformation process. This paper describes the MEat
Supply Chain Ontology (MESCO), an ontology developed for supporting the management of meat
traceability along the whole supply chain. In particular, in this paper the authors instantiate MESCO to
take the problem of meat traceability from the farmer to the final consumer. The article describes the
main features of MESCO, illustrating the different steps followed for its development and some example
of application. MESCO has been validated and interrogated through the formulation of several queries
expressed in Description Logic (DL), executed using the Pellet reasoner, to deal with different scenarios
and problems of traceability. The results show that MESCO is able to represent all the knowledge and
information related to the meat traceability domain into a single ontology, enabling interoperability
among different systems and allowing for integrating the heterogeneous databases adopted by each
actor involved in the supply chain. One of the main advantages in using MESCO is the facility in obtaining
essential data, fundamental in case of food outbreak disease, addressing the key issues that makes the
job of food safety agents frustrating.
Keywords: Meat supply chain | Traceability | Ontology | Web ontology language | Description logic |
مقاله انگلیسی |
502 |
RAACFDb: Rheumatoid arthritis ayurvedic classical formulations database
RAACFDb: پایگاه داده فرموله سازی کریستال آئورودیک آرتروز روماتوئید-2017 Ethnopharmacological relevance: In the past years, the treatment of rheumatoid arthritis (RA) has
undergone remarkable changes in all therapeutic modes. The present newfangled care in clinical research
is to determine and to pick a new track for better treatment options for RA. Recent ethnopharmacological
investigations revealed that traditional herbal remedies are the most preferred modality of complementary
and alternative medicine (CAM). However, several ayurvedic modes of treatments and formulations for RA
are not much studied and documented from Indian traditional system of medicine. Therefore, this directed
us to develop an integrated database, RAACFDb (acronym: Rheumatoid Arthritis Ayurvedic Classical
Formulations Database) by consolidating data from the repository of Vedic Samhita – The Ayurveda to
retrieve the available formulations information easily.
Materials and methods: Literature data was gathered using several search engines and from ayurvedic
practitioners for loading information in the database. In order to represent the collected information about
classical ayurvedic formulations, an integrated database is constructed and implemented on a MySQL and
PHP back-end.
Results: The database is supported by describing all the ayurvedic classical formulations for the treatment
rheumatoid arthritis. It includes composition, usage, plant parts used, active ingredients present in the
composition and their structures.
Conclusion: The prime objective is to locate ayurvedic formulations proven to be quite successful and
highly effective among the patients with reduced side effects. The database (freely available at www.beta.
vit.ac.in/raacfdb/index.html) hopefully enables easy access for clinical researchers and students to discover
novel leads with reduced side effects.
Keywords: Rheumatoid arthritis | Ayurvedic formulations | Ayurveda database | Vedic samhita |
مقاله انگلیسی |
503 |
Belgian Branded Food Products Database: Inform consumers on a healthy lifestyle in a public-private partnership
پایگاه داده محصولات غذایی مارک بلژیک: اطلاع مصرف کنندگان در یک شیوه زندگی سالم در یک مشارکت دولتی- خصوصی-2017 Nubel (Nutrients of Belgium) is a non-profit organization that manages nutrition related information in Belgium.
Nubel consists of both private and public partners. Next to the Board of Directors and the Scientific Council,
Nubel has numerous additional members working in the area of nutrition and which are using the Nubel pro
ducts as basic information for several target groups. Our objective is to develop, update and manage a scientific
food composition database of nutrients from all kinds of food products and to distribute the data to potential
users. For each nutrient Nubel tracks the origin of the data. This can be an analysis carried out in accredited
laboratories, corrected values, calculated values, data from Global Standard 1 Belgilux (GS1), literature, other
databases. The branded food products database is an interactive database on the Internet. The pictures,
household measures and portions are available in close collaboration with the food industry. In return the food
industry receives objective information on nutritional values of our generic foods based on a scientific back
ground that can be used to improve the quality of food products and to label food products. Nubel wishes to
inform her users by using the NUBEL Foodplanner about a healthy lifestyle based on a well-balanced nutrition.
Keywords: Nubel | Private and public partners | Industrial data | Food composition database | Branded food products database | Well-balanced nutrition | Healthy lifestyle | Nutrition |
مقاله انگلیسی |
504 |
Efficient algorithms for mining colossal patterns in high dimensional databases
الگوریتم های کارآمد برای کاوش الگوهای عظیم در پایگاه داده های ابعادی بالا-2017 Mining association rules plays an important role in decision support systems. To mine strong association
rules, it is necessary to mine frequent patterns. There are many algorithms that have been developed
to efficiently mine frequent patterns, such as Apriori, Eclat, FP-Growth, PrePost, and FIN. However, these
are only efficient with a small number of items in the database. When a database has a large number
of items (from thousands to hundreds of thousands) but the number of transactions is small, these al
gorithms cannot run when the minimum support threshold is also small (because the search space is
huge). This thus causes the problem of mining colossal patterns in high dimensional databases. In 2012,
Sohrabi and Barforoush proposed the BVBUC algorithm for mining colossal patterns based on a bottom
up scheme. However, this needs more time to check subsets and supersets, because it generates a lot
of candidates and consumes more memory to store these. In this paper we propose new, efficient algo
rithms for mining colossal patterns. Firstly, the CP (Colossal Pattern)-tree is designed. Next, we develop
two theorems to rapidly compute patterns of nodes and prune nodes without the loss of information
in colossal patterns. Based on the CP-tree and these theorems, an algorithm (named CP-Miner) is pro
posed to solve the problem of mining colossal patterns. A sorting strategy for efficiently mining colossal
patterns is thus developed. This strategy helps to reduce the number of significant candidates and the
time needed to check subsets and supersets. The PCP-Miner algorithm, which uses this strategy, is then
proposed, and we also conduct experiments to show the efficiency of these algorithms.
Keywords: Bottom up | Colossal patterns | Data mining | High dimensional databases |
مقاله انگلیسی |
505 |
Secure-channel free keyword search with authorization in manager-centric databases
جستجوی کلمات کلیدی رایگان کانال امن با مجوز در پایگاه داده مدیریت محور-2017 Public key encryption with keyword search (PEKS) provides the functionality of encrypted
data retrieval with keyword privacy in database systems. PEKS allows a user to specify a
keyword and search the encrypted data associated with this keyword that is uploaded by
others. In this paper, we investigate the retrieval privilege management in the manager
centric model, where each user has a different search right over the unique keyword set.
Unfortunately, employing the prior PEKS and other related cryptographic techniques
might suffer from the problems of key abuse and bandwidth consumption. To address
these issues, we introduce a new cryptographic primitive called public key encryption
with authorized keyword search (PEAKS). In PEAKS, the search right is assigned by the
authority over a distinct keyword set and the user with an authorized search right can
only search data associated with these keywords. We propose two constructions with
formal security proof, namely the basic PEAKS scheme and the secure channel-free PEAKS
(SCF-PEAKS) scheme. Both schemes feature with the constant-size authorized token,
while the SCF-PEAKS scheme is also resistant against the outsider keyword guessing
attacks. The performance evaluation shows that the proposed schemes consume less
bandwidth for frequent token update.
Keywords: Searchable encryption | Secure keyword search | Authorization | Provable security | Database system management |
مقاله انگلیسی |
506 |
Distributed incremental fingerprint identification with reduced database penetration rate using a hierarchical classification based on feature fusion and selection
شناسایی اثر انگشت افزایشی توزیع شده با میزان نفوذ پایگاه داده کاهش یافته با استفاده از طبقه بندی سلسله مراتبی بر مبنای همجوشی و انتخاب ویژگی-2017 Fingerprint recognition has been a hot research topic along the last few decades, with many applications
and ever growing populations to identify. The need of flexible, fast identification systems is therefore
patent in such situations. In this context, fingerprint classification is commonly used to improve the speed
of the identification. This paper proposes a complete identification system with a hierarchical classifica
tion framework that fuses the information of multiple feature extractors. A feature selection is applied
to improve the classification accuracy. Finally, the distributed identification is carried out with an incre
mental search, exploring the classes according to the probability order given by the classifier. A single
parameter tunes the trade-off between identification time and accuracy. The proposal is evaluated over
two NIST databases and a large synthetic database, yielding penetration rates close to the optimal values
that can be reached with classification, leading to low identification times with small or no accuracy loss.
Keywords: Fingerprint recognition | Fingerprint identification | Fingerprint classification | Large databases | Feature selection | Hierarchical classification |
مقاله انگلیسی |
507 |
Clinical and mutational characteristics of Duchenne muscular dystrophy patients based on a comprehensive database in South China
خصوصیات بالینی و جهش یافته بیماران دیستروفی عضلانی دوشن بر اساس یک پایگاه جامع در جنوب چین-2017 The development of clinical trials for Duchenne muscular dystrophy (DMD) in China faces many challenges due to limited information about
epidemiological data, natural history and clinical management. To provide these detailed data, we developed a comprehensive database based on
registered DMD patients from South China and analysed their clinical and mutational characteristics. The database included DMD registrants
confirmed by clinical presentation, family history, genetic detection, prognostic outcome, and/or muscle biopsy. Clinical data were collected by a
registry form. Mutations of dystrophin were detected by multiplex ligation-dependent probe amplification (MLPA) and Sanger sequencing.
Currently, 132 DMD patients from 128 families in South China have been registered, and 91.7% of them were below 10 years old. In mutational
detection, large deletions were the most frequent type (57.8%), followed by small deletion/insertion mutations (14.1%), nonsense mutations
(13.3%), large duplications (10.9%), and splice site mutations (3.1%). Clinical analysis revealed that most patients reported initial symptoms
between 1 and 3 years of age, but the diagnostic age was more frequently between 6 and 8 years. 81.4% of patients were ambulatory. Baseline
cardiac assessments at diagnosis were conducted in 39.4% and 29.5% of patients by echocardiograms and electrocardiograms, respectively. Only
22.7% of registrants performed baseline respiratory assessments. A small numbers of patients (20.5%) were treated with glucocorticoids. 13.3%
of patients were eligible for stop codon read-through therapy, and 48.4% of patients would potentially benefit from exon skipping. The top five exon
skips applicable to the largest group of registrants were skipping of exons 51 (14.8% of total mutations), 53 (12.5%), 45 (7.0%), 55 (4.7%), and
44 (3.9%). In conclusion, our database provided information on the natural history, diagnosis and management status of DMD in South China, as
well as potential molecular therapies suitable for these patients. This comprehensive database will promote future experimental therapies in China.
Keywords: Duchenne muscular dystrophy | Database | Natural history | Patient management | Dystrophin gene |
مقاله انگلیسی |
508 |
Rule-based topology system for spatial databases to validate complex geographic datasets
سیستم توپولوژی مبتنی بر قواعد برای پایگاه داده های فضایی برای اعتبارسنجی مجموعه داده های جغرافیایی پیچیده-2017 A rule-based topology software system providing a highly flexible and fast procedure to enforce integrity in
spatial relationships among datasets is presented. This improved topology rule system is built over the spatial
extension Jaspa. Both projects are open source, freely available software developed by the corresponding author
of this paper.
Currently, there is no spatial DBMS that implements a rule-based topology engine (considering that the
topology rules are designed and performed in the spatial backend). If the topology rules are applied in the
frontend (as in many GIS desktop programs), ArcGIS is the most advanced solution. The system presented in
this paper has several major advantages over the ArcGIS approach: it can be extended with new topology rules,
it has a much wider set of rules, and it can mix feature attributes with topology rules as filters. In addition, the
topology rule system can work with various DBMSs, including PostgreSQL, H2 or Oracle, and the logic is
performed in the spatial backend.
The proposed topology system allows users to check the complex spatial relationships among features (from
one or several spatial layers) that require some complex cartographic datasets, such as the data specifications
proposed by INSPIRE in Europe and the Land Administration Domain Model (LADM) for Cadastral data.
Keywords: Topology | Spatial Databases | GIS | Cartography | INSPIRE |
مقاله انگلیسی |
509 |
Will Web Search Engines Replace Bibliographic Databases in the Systematic Identification of Research?
آیا موتورهای جستجوگر وب جایگزین پایگاه های کتابشناسی در شناسایی سیستماتیک تحقیق هستند؟-2017 The availability of web search engines offers opportunities in addition to those provided by bibliographic data
bases for identifying academic literature, but their usefulness for retrieving research is uncertain. A rigorous lit
erature search was undertaken to investigate whether web search engines might replace bibliographic
databases, using empirical research in health and social care as a case study. Eight databases and five web search
engines were searched between 20 July and 6 August 2015. Sixteen unique studies which compared at least one
database with at least one web search engine were examined, as well as drawing lessons from the authors’ own
search process. Web search engines were limited in that the searcher cannot be certain that the principles of
Boolean logic apply and they were more limited than bibliographic databases in their functions, such as exporting
abstracts. Recommendations are made for improving the rigour and quality of reporting studies of academic lit
erature searching.
KEYWORDS: Academic librarianship | Bibliographic databases | Google Scholar | Health research | Literature searching | Social care research | Systematic searching | Web search engines |
مقاله انگلیسی |
510 |
Participatory database of repair cases on fatigue damaged welded structures
پایگاه داده مشارکتی موارد تعمیر در ساختارهای جوش آسیب دیده فرسودگی-2017 We report a Web database in which 204 fatigue-related steel bridge repair cases have been summarized.
Since the database is based on the PukiWiki system, which is a Wiki-type content management arrange
ment, any user can participate in creating and modifying database files, much as is commonly done in
Wikipedia. Furthermore, failures causes, repair methods, service years, crack occurrences, and welding
defect types are analyzed using the cases included in this database. In this paper, we introduce the data
base and present the results of the analyses.
Keywords: Database | Steel bridge | Fatigue | Repair | Wiki |
مقاله انگلیسی |