Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCriteria to Distinguish non-Isomorphism Hypergraphs
معايير لتمييز فوق البيانات غير المتماكلة
972
0 16
0
(
0
)
Added by
Damascus University ورقة بحثية
Publication date
2000
fields
Mathematics
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
يهدف البحث إلى تمييز فوق البيانات غير المتماكلة، مثنى، مثنى، و التي لها عدد رؤوس Z, و عدد أضلاع d, معلومان. وضعت لحل هذه المسألة عدد من المعايير، متدرجة، في دقة الكشف. كما يعرض هذا البحث طريقة تجريبية لاختبار فعالية المعايير المستخدمة، و يعطي أسلوبًا لترتيبها. يعد هذا البحث ذا قيمة تطبيقية، فهو مفيد عند تصميم آلات، ونظم معقدة متغيرة البنى، و عند مقارنة مخططات التصاميم الجديدة.
The paper aims to distinguish the couple-couple non-isomorphism hypergraphs, which have a known vertexes number, Z, and sides number, d. To solve this problem a number of criteria graded in distinguishing accuracy are developed. It also presents an experimental method to test the efficiency of the used criteria. It gives a method to put them in order. This research is considered a practical because it is useful in designing of machines and variable structure complex systems, and in comparing the new patterns.
References used
د. علي جمال الدين. ١٩٨٧ . البنى التقريبية في الأنظمة متعددة الحالات. جامعة لينيغراد.
د. علي جمال الدين. خوارزمية لتعدد فوق البيانات غير المتماكلة. مجلة جامعة دمشق.
Gary Chartrand. Ortud R. Oellermann. Applied and Algorithmic Graph Theory. New York, ١٩٩٣. McGraw-Hill,Inc
rate research
Read More
Previous works on syntactically controlled paraphrase generation heavily rely on large-scale parallel paraphrase data that is not easily available for many languages and domains. In this paper, we take this research direction to the extreme and inves
tigate whether it is possible to learn syntactically controlled paraphrase generation with nonparallel data. We propose a syntactically-informed unsupervised paraphrasing model based on conditional variational auto-encoder (VAE) which can generate texts in a specified syntactic structure. Particularly, we design a two-stage learning method to effectively train the model using non-parallel data. The conditional VAE is trained to reconstruct the input sentence according to the given input and its syntactic structure. Furthermore, to improve the syntactic controllability and semantic consistency of the pre-trained conditional VAE, we fine-tune it using syntax controlling and cycle reconstruction learning objectives, and employ Gumbel-Softmax to combine these new learning objectives. Experiment results demonstrate that the proposed model trained only on non-parallel data is capable of generating diverse paraphrases with specified syntactic structure. Additionally, we validate the effectiveness of our method for generating syntactically adversarial examples on the sentiment analysis task.
The huge growth in the data storing and the wide use of social networks and applications that depend mainly on complicated and interrelated relations between entities which need specific models of databases to store and retriev quickly and effectivel
y, the relational databases are no longer adequate in distributed systems and websites that deal with big data which have to be accessible and operable.
This paper explains briefly the challenges of relational databases and the reasons that led to emergence the non-relational databases (NoSQL), in addition to CAP theorem and some of NoSQL types, specially GraphQL
We propose the Recursive Non-autoregressive Graph-to-Graph Transformer architecture (RNGTr) for the iterative refinement of arbitrary graphs through the recursive application of a non-autoregressive Graph-to-Graph Transformer and apply it to syntacti
c dependency parsing. We demonstrate the power and effectiveness of RNGTr on several dependency corpora, using a refinement model pre-trained with BERT. We also introduce Syntactic Transformer (SynTr), a non-recursive parser similar to our refinement model. RNGTr can improve the accuracy of a variety of initial parsers on 13 languages from the Universal Dependencies Treebanks, English and Chinese Penn Treebanks, and the German CoNLL2009 corpus, even improving over the new state-of-the-art results achieved by SynTr, significantly improving the state-of-the-art for all corpora tested.
Non-autoregressive neural machine translation, which decomposes the dependence on previous target tokens from the inputs of the decoder, has achieved impressive inference speedup but at the cost of inferior accuracy. Previous works employ iterative d
ecoding to improve the translation by applying multiple refinement iterations. However, a serious drawback is that these approaches expose the serious weakness in recognizing the erroneous translation pieces. In this paper, we propose an architecture named RewriteNAT to explicitly learn to rewrite the erroneous translation pieces. Specifically, RewriteNAT utilizes a locator module to locate the erroneous ones, which are then revised into the correct ones by a revisor module. Towards keeping the consistency of data distribution with iterative decoding, an iterative training strategy is employed to further improve the capacity of rewriting. Extensive experiments conducted on several widely-used benchmarks show that RewriteNAT can achieve better performance while significantly reducing decoding time, compared with previous iterative decoding strategies. In particular, RewriteNAT can obtain competitive results with autoregressive translation on WMT14 En-De, En-Fr and WMT16 Ro-En translation benchmarks.
Text simplification is a valuable technique. However, current research is limited to sentence simplification. In this paper, we define and investigate a new task of document-level text simplification, which aims to simplify a document consisting of m
ultiple sentences. Based on Wikipedia dumps, we first construct a large-scale dataset named D-Wikipedia and perform analysis and human evaluation on it to show that the dataset is reliable. Then, we propose a new automatic evaluation metric called D-SARI that is more suitable for the document-level simplification task. Finally, we select several representative models as baseline models for this task and perform automatic evaluation and human evaluation. We analyze the results and point out the shortcomings of the baseline models.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
