作者: intercede 時(shí)間: 2025-3-21 20:41 作者: phytochemicals 時(shí)間: 2025-3-22 01:10 作者: MUMP 時(shí)間: 2025-3-22 04:43
Reachability Problems978-3-030-30806-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Classify 時(shí)間: 2025-3-22 12:22 作者: 多骨 時(shí)間: 2025-3-22 16:01
Reachability in Augmented Interval Markov Chains,n . if the underlying graph is known, whilst the restriction of the exact problem to a constant number of uncertain edges is in .. Finally, we show that uncertainty in the graph structure affects complexity by proving .-completeness for the qualitative subproblem, in contrast with an easily-obtained作者: 保守黨 時(shí)間: 2025-3-22 17:39 作者: 墻壁 時(shí)間: 2025-3-22 21:20
Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds,decidability of the reachability problem is unknown. In this paper we show that the reachability problem becomes decidable for PCD.?if we slightly limit their dynamics, and thus we partially answer the open question of Asarin, Mysore, Pnueli and Schneider posed in [.].作者: installment 時(shí)間: 2025-3-23 03:51
Synthesis of Structurally Restricted ,-bounded Petri Nets: Complexity Results,y, synthesis for this class becomes tractable if . are chosen .. We contrast this result with the fact that synthesis for weighted (.,?.)., being the T-systems’s dual class, is NP-complete for any fixed ..作者: Melodrama 時(shí)間: 2025-3-23 09:22
ped to SBVR rules representation. SBVR rules are easy to translate other formal representations such as OCL and UML as SBVR is based on higher order logic. A case study solved with our tool NL2UMLviaSBVR is also presented and the a comparative analysis of our tools research with other available tool作者: Stricture 時(shí)間: 2025-3-23 10:05
Guy Avni,Thomas A. Henzinger,Rasmus Ibsen-Jensen,Petr Novotnyplicitation, based on initial conceptual model cleaning rules, expert knowledge injection rules and finally fact-oriented transformation rules. A case study is proposed, related to a work order process in an Enterprise Resource Planning application, Sage X3.作者: 下邊深陷 時(shí)間: 2025-3-23 14:29
Vladimir Yu. Protasovrvices in an integrated environment. In this paper, we design a new querying system which takes data concerns into account. To this end we discuss several models of data concern aware querying and select the best suited one for our system. We describe a querying system where data concern awareness i作者: antidote 時(shí)間: 2025-3-23 19:22 作者: 確定無疑 時(shí)間: 2025-3-24 01:32 作者: LEVY 時(shí)間: 2025-3-24 02:34
Thomas Brihaye,Véronique Bruyère,Aline Goeminne,Nathan ThomassetWe also present a maturity level analysis of the tools. Finally, we discussed the main findings and implications for future research. .: We identify that most of existing tools are industrial, revealing a considerable interest of the industry in TD tools. Most of the tools address code-related TD. T作者: Petechiae 時(shí)間: 2025-3-24 09:47
Véronique Bruyère,Guillermo A. Pérez,Jean-Fran?ois Raskin,Clément Tamines is supported by Libra consortium based on the ANP’s Research, Development and Innovation clauses. The requirements were collected with the companies stakeholders, and the system was implemented in a permissioned blockchain, Hyperledger Fabric. Furthermore, a permissioned blockchain network was prop作者: AFFIX 時(shí)間: 2025-3-24 13:14 作者: Adulterate 時(shí)間: 2025-3-24 17:14 作者: 知識(shí)分子 時(shí)間: 2025-3-24 22:18 作者: Aerophagia 時(shí)間: 2025-3-24 23:52 作者: Ingredient 時(shí)間: 2025-3-25 03:22 作者: 使激動(dòng) 時(shí)間: 2025-3-25 10:42
Chris K?cherct to the construction of instance-based classification systems; and (.) the curation of a ground-truth annotated dataset of fire images from social media. Using real data from Flickr, the experiments showed that system . was able to achieve a precision for fire detection comparable to that of human作者: LUCY 時(shí)間: 2025-3-25 14:39 作者: 憲法沒有 時(shí)間: 2025-3-25 19:16
Andrei Sandler,Olga Tveretinaolution algorithm versus an exhaustive approach. First, we consider a real industrial use case and show several numerical results to analyze the effect of the parameters of the simulated annealing on the accuracy of the solution and on the execution time of the algorithm. Then, we provide results va作者: judiciousness 時(shí)間: 2025-3-25 22:10 作者: overweight 時(shí)間: 2025-3-26 02:27 作者: 太空 時(shí)間: 2025-3-26 04:39 作者: CIS 時(shí)間: 2025-3-26 11:25 作者: 鈍劍 時(shí)間: 2025-3-26 14:25 作者: 整頓 時(shí)間: 2025-3-26 18:34 作者: facilitate 時(shí)間: 2025-3-27 00:15
Vladimir Yu. Protasovstrength of database systems and query languages on the one hand with the benefits of service-oriented architecture on the other hand. Data services are increasingly used for data integration. The data provided via data services is often associated with data concerns like privacy, licensing, pricing作者: FLIRT 時(shí)間: 2025-3-27 03:09 作者: 不溶解 時(shí)間: 2025-3-27 06:01 作者: 演講 時(shí)間: 2025-3-27 10:37 作者: Adulterate 時(shí)間: 2025-3-27 15:09 作者: GORGE 時(shí)間: 2025-3-27 19:58 作者: 薄膜 時(shí)間: 2025-3-27 22:13 作者: FISC 時(shí)間: 2025-3-28 03:00 作者: HOWL 時(shí)間: 2025-3-28 08:21
Nazim Fatès,Irène Marcovici,Siamak Taatis and, in some cases, on external repositories. After, the information gathered is analysed, selected, filtered, transformed and integrated in special data storage units, commonly named by data warehouses systems. To do all the previous tasks properly, it is necessary to dispense significant efforts作者: 非實(shí)體 時(shí)間: 2025-3-28 11:04
Christopher Hampsons and, in some cases, on external repositories. After, the information gathered is analysed, selected, filtered, transformed and integrated in special data storage units, commonly named by data warehouses systems. To do all the previous tasks properly, it is necessary to dispense significant efforts作者: Entreaty 時(shí)間: 2025-3-28 16:28
Chris K?cheruch of the data from social media are images, which are uploaded at a rate that makes it impossible for human beings to analyze them. To cope with that problem, we design and implement a database-driven architecture for fast and accurate fire detection named FFireDt. The design of FFireDt uses the i作者: muscle-fibers 時(shí)間: 2025-3-28 21:36
Pierre-Alain Reynier,Frédéric Servais so called scheduling problems. Such techniques approach the optimization problems by taking inspiration from a certain physical phenomenon. Simulated annealing is a metaheuristic approach inspired to the controlled cooling of a material from a high temperature to a state in which internal defects o作者: 斥責(zé) 時(shí)間: 2025-3-28 23:14 作者: SIT 時(shí)間: 2025-3-29 06:28 作者: 占卜者 時(shí)間: 2025-3-29 08:46
Ronny Treduply respond to new market demands became a strategic pillar for innovation, and knowledge management could support organizations to achieve that goal. However, such knowledge management approaches tend to be over complex or too academic, with interfaces difficult to manage, even more if cooperative h作者: FOLD 時(shí)間: 2025-3-29 13:26 作者: jungle 時(shí)間: 2025-3-29 16:44
happened at anytime of human mankind, all around the world, and affects all kind of human activities. For instance, betrayers are entities of the society, industry, banks, services, health-care, non-profit organizations, art, science, media or even a government or the Vatican. We consider four main 作者: BOAST 時(shí)間: 2025-3-29 23:27
Bidding Games on Markov Decision Processes,tative payoff of the game. In ., in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bi作者: Engulf 時(shí)間: 2025-3-30 01:05
Primitivity and Synchronizing Automata: A Functional Analytic Approach,nchronising automata and prove that the existence of a reset .-tuple of a deterministic automata with . states can be decided in less than . operations. We study whether the functional-analytic approach can be extended to .-primitivity and to .-synchronising automata. Several open problems and conje作者: 歸功于 時(shí)間: 2025-3-30 06:20 作者: remission 時(shí)間: 2025-3-30 12:03
,On the m-eternal Domination Number of?Cactus Graphs, by a guard moving from a neighboring vertex. The m-eternal domination number is the minimum number of guards such that the graph can be defended indefinitely. In this paper we study the m-eternal domination number of cactus graphs, that is, connected graphs where each edge lies in at most one cycle作者: 匍匐前進(jìn) 時(shí)間: 2025-3-30 14:57 作者: 挫敗 時(shí)間: 2025-3-30 19:47
Partial Solvers for Generalized Parity Games,or parity games that execute in polynomial time, while incomplete, can solve most games in publicly available benchmark suites. In this paper, we combine those partial solvers with the classical algorithm for parity games due to Zielonka. We also extend partial solvers to generalized parity games th作者: APNEA 時(shí)間: 2025-3-30 23:14
Reachability in Augmented Interval Markov Chains,sition probabilities are in addition allowed to depend on one another. This new model preserves the flexibility afforded by IMCs for describing stochastic systems where the parameters are unclear, for example due to measurement error, but also allows us to specify transitions with probabilities know作者: Airtight 時(shí)間: 2025-3-31 01:08 作者: averse 時(shí)間: 2025-3-31 06:57 作者: 尊重 時(shí)間: 2025-3-31 09:26 作者: palpitate 時(shí)間: 2025-3-31 16:32 作者: Pruritus 時(shí)間: 2025-3-31 20:21 作者: 無彈性 時(shí)間: 2025-3-31 21:50
On the Computation of the Minimal Coverability Set of Petri Nets,algorithm is known. The . of a Petri net can be understood as an approximation of its reachability set described by means of .-markings (. markings in which some entries may be set to infinity). It allows to solve numerous decision problems on Petri nets, such as any coverability problem. In this pa
