اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUn mod`ele booleen pour lenumeration des siphons et des pi`eges minimaux dans les reseaux de Petri
205
0
0.0
(
0
)
تأليف
Faten Nabli
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Petri-nets are a simple formalism for modeling concurrent computation. Recently, they have emerged as a powerful tool for the modeling and analysis of biochemical reaction networks, bridging the gap between purely qualitative and quantitative models. These networks can be large and complex, which makes their study difficult and computationally challenging. In this paper, we focus on two structural properties of Petri-nets, siphons and traps, that bring us information about the persistence of some molecular species. We present two methods for enumerating all minimal siphons and traps of a Petri-net by iterating the resolution of a boolean model interpreted as either a SAT or a CLP(B) program. We compare the performance of these methods with a state-of-the-art dedicated algorithm of the Petri-net community. We show that the SAT and CLP(B) programs are both faster. We analyze why these programs perform so well on the models of the repository of biological models biomodels.net, and propose some hard instances for the problem of minimal siphons enumeration.
قيم البحث
اقرأ أيضاً
We study the reduction modulo $l$ of some elliptic representations; for each of these representations, we give a particular lattice naturally obtained by parabolic induction in giving the graph of extensions between its irreducible sub-quotient of it
s reduction modulo $l$. The principal motivation for this work, is that these lattices appear in the cohomology of Lubin-Tate towers.
From 2010, the medical transport has become one of the top ten priorities of the risk management plan in France because of the increase in the cost. For social and medico-social institutions (MSI), this cost represents the second after that of the wa
ges. In this context, the project NOMAd aims an overall improvement of the daily transport of people between their home and their (MSI). To this end, we propose the sharing of transport between several ESMS. This mutualization of transport makes possible to gather and optimize routes in a certain geographical area. The challenge is to improve economic performance while maintaining economic, social and environmental goals. From a scientific point of view, the studied problem is called the Time-Consistent-Dial-a-Ride Problem and aims to find a compromise between the objectives of the cost of transport and the consistency of the service. Given the complexity of the problem, we seek, first of all, to solve the problem for half a day. Then we consider the whole week. To solve these problems, we use the Large Neighborhood Search meta-heuristic and a master problem based on the Set Covering Problem.
The recent apparition of mobile wireless sensor aware to their physical environment and able to process information must allow proposing applications able to take into account their physical context and to react according to the changes of the enviro
nment. It suppose to design applications integrating both software and hardware components able to communicate. Applications must use context information from components to measure the quality of the proposed services in order to adapt them in real time. This work is interested in the integration of sensors in distributed applications. It present a service oriented software architecture allowing to manage and to reconfigure applications in heterogeneous environment where entities of different nature collaborate: software components and wireless sensors.
Bitmap indexes are frequently used to index multidimensional data. They rely mostly on sequential input/output. Bitmaps can be compressed to reduce input/output costs and minimize CPU usage. The most efficient compression techniques are based on run-
length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. This type of compression accelerates logical operations (AND, OR) over the bitmaps. However, run-length encoding is sensitive to the order of the facts. Thus, we propose to sort the fact tables. We review lexicographic, Gray-code, and block-wise sorting. We found that a lexicographic sort improves compression--sometimes generating indexes twice as small--and make indexes several times faster. While sorting takes time, this is partially offset by the fact that it is faster to index a sorted table. Column order is significant: it is generally preferable to put the columns having more distinct values at the beginning. A block-wise sort is much less efficient than a full sort. Moreover, we found that Gray-code sorting is not better than lexicographic sorting when using word-aligned compression.
As a result of the deep modifications of the French physics and chemistry curricula in upper secondary school during these last three years, the physics department of the Universite Paris Diderot (France) wished to develop a renovation project concer
ning its methods of teachings. As science education researchers we took part in this project questioning 104 university academics of this department through 23 exploratory interviews and 81 questionnaires. They have been asked about the possible and desirable changes concerning pedagogical methods and organization (with respect to current difficulties met by the students). This study has enabled us to pinpoint elements of their professional identity as teachers. This identity has been explored according to various directions: rules which govern their profession, qualities and skills for the practice, values of the profession, as well as a didactic dimension, dealing specifically with physics teaching. The analysis of the collected data allows us to identify major trends among university academics conceptions about teaching, such as: a good teacher is above all a good physicist, or, teaching has to favor interactions with students. It also allows us to bring to light tensions between what university academics would like to do in their teaching and what they declare to do in practice or think feasible
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
