Zeitschriftenartikel: „Mutual exclusion constraints“

1

Giua, A., F. Dicesare und M. Silva. „Petri Net Supervisors for Generalized Mutual Exclusion Constraints“. IFAC Proceedings Volumes 26, Nr. 2 (Juli 1993): 379–82. http://dx.doi.org/10.1016/s1474-6670(17)48493-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Barbara, Daniel, Hector Garcia-Molina und Annemarie Spauster. „Increasing availability under mutual exclusion constraints with dynamic vote reassignment“. ACM Transactions on Computer Systems 7, Nr. 4 (November 1989): 394–426. http://dx.doi.org/10.1145/75104.75107.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Ma, Ziyue, Zhiwu Li und Alessandro Giua. „Petri net controllers for Generalized Mutual Exclusion Constraints with floor operators“. Automatica 74 (Dezember 2016): 238–46. http://dx.doi.org/10.1016/j.automatica.2016.07.042.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Ma, Ziyue, Zhiwu Li und Alessandro Giua. „Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints“. IEEE Transactions on Automatic Control 60, Nr. 7 (Juli 2015): 1774–85. http://dx.doi.org/10.1109/tac.2015.2389313.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Abbott, Barbara. „THE HUMAN SEMANTIC POTENTIAL: SPATIAL LANGUAGE AND CONSTRAINED CONNECTIONISM.Terry Regier. Cambridge, MA: MIT Press, 1996. Pp. xvi + 220. $37.50 paper.“ Studies in Second Language Acquisition 19, Nr. 4 (Dezember 1997): 517–18. http://dx.doi.org/10.1017/s027226319722406x.

Der volle Inhalt der Quelle

Annotation:

The semantic potential referred to in the title of this book is the ability of humans to learn the (closed-class) terms for basic spatial relations, such as (for English) onto, above, and through. Regier presents a modified connectionist model of this ability designed to address three questions: (a) What kind of system can learn spatial terms? (b) How can this system function without negative evidence? and (c) What are the universal constraints on learnable spatial terms? The answers suggested to these questions are: (a) a modified connectionist network—one which incorporates structural constraints motivated by human physiology; (b) the assumption of mutual exclusion, that is, that different terms have mutually exclusive denotations; and (c) the structural constraints that are incorporated into the network.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

ZhiWu Li, MingMing Yan und MengChu Zhou. „Synthesis of Structurally Simple Supervisors Enforcing Generalized Mutual Exclusion Constraints in Petri Nets“. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 40, Nr. 3 (Mai 2010): 330–40. http://dx.doi.org/10.1109/tsmcc.2009.2037824.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Fujita, Kohei, und Toshimitsu Ushio. „Optimal Control of Colored Timed Petri Nets Under Generalized Mutual Exclusion Temporal Constraints“. IEEE Access 10 (2022): 110849–61. http://dx.doi.org/10.1109/access.2022.3216043.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Gharbi, Atef, Hamza Gharsellaoui und Mohamed Khalgui. „Real-Time Reconfigurations of Embedded Control Systems“. International Journal of System Dynamics Applications 5, Nr. 3 (Juli 2016): 71–93. http://dx.doi.org/10.4018/ijsda.2016070104.

Der volle Inhalt der Quelle

Annotation:

This paper deals with the study of the reconfiguration of embedded control systems with safety following component-based approaches from the functional level to the operational level. The authors define the architecture of the Reconfiguration Agent which is modelled by nested state machines to apply local reconfigurations. They propose in this journal paper technical solutions to implement the whole agent-based architecture, by defining UML meta-models for both Control Components and also agents. To guarantee safety reconfigurations of tasks at run-time, they define service and reconfiguration processes for tasks and use the semaphore concept to ensure safety mutual exclusions. As a method to ensure the scheduling between periodic tasks with precedence and mutual exclusion constraints, the authors apply the priority ceiling protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Chen, Y., B. W. Wah und C. Hsu. „Temporal Planning using Subgoal Partitioning and Resolution in SGPlan“. Journal of Artificial Intelligence Research 26 (06.08.2006): 323–69. http://dx.doi.org/10.1613/jair.1918.

Der volle Inhalt der Quelle

Annotation:

In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong locality of mutex constraints observed in many benchmarks of the Fourth International Planning Competition (IPC4), we propose to partition the constraints of a planning problem into groups based on their subgoals. Constraint partitioning leads to significantly easier subproblems that are similar to the original problem and that can be efficiently solved by the same planner with some modifications to its objective function. We present a partition-and-resolve strategy that looks for locally optimal subplans in constraint-partitioned temporal planning subproblems and that resolves those inconsistent global constraints across the subproblems. We also discuss some implementation details of SGPlan4, which include the resolution of violated global constraints, techniques for handling producible resources, landmark analysis, path finding and optimization, search-space reduction, and modifications of Metric-FF when used as a basic planner in SGPlan4. Last, we show results on the sensitivity of each of these techniques in quality-time trade-offs and experimentally demonstrate that SGPlan4 is effective for solving the IPC3 and IPC4 benchmarks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Jiliang Luo, Weimin Wu, Hongye Su und Jian Chu. „Supervisor Synthesis for Enforcing a Class of Generalized Mutual Exclusion Constraints on Petri Nets“. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 39, Nr. 6 (November 2009): 1237–46. http://dx.doi.org/10.1109/tsmca.2009.2027111.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Li, P., H. Wu, Binoy Ravindran und E. D. Jensen. „A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints“. IEEE Transactions on Computers 55, Nr. 4 (April 2006): 454–69. http://dx.doi.org/10.1109/tc.2006.47.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Sideris, Andreas, und Yannis Dimopoulos. „Constraint Propagation in Propositional Planning“. Proceedings of the International Conference on Automated Planning and Scheduling 20 (25.05.2021): 153–60. http://dx.doi.org/10.1609/icaps.v20i1.13422.

Der volle Inhalt der Quelle

Annotation:

Planning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization of constraints that are inferred from the problem planning graph. One of the recent improvements of the framework is the addition of long-distance mutual exclusion (londex) constraints that relate facts and actions which refer to different time steps. In this paper we compare different encodings of planning as satisfiability wrt the constraint propagation they achieve in a modern SAT solver. This analysis explains some of the differences observed in the performance of different encodings, and leads to some interesting conclusions. For instance, the Blackbox encoding achieves more propagation than the one of Satplan06, and therefore is a stronger formulation of planning as satisfiability. Moreover, our investigation suggests a new more compact and stronger model for the problem. We prove that in this new formulation many of the londex constraints are redundant in the sense that they do not add anything to the constraint propagation achieved by the model. Experimental results suggest that the theoretical results obtained are practically relevant.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Liu, Jiufu, Wenliang Liu Liu, Jianyong Zhou, Yan Sun und Zhisheng Wang. „Improved design of online fault diagnoser for partially observed Petri nets with generalized mutual exclusion constraints“. Journal of Systems Engineering and Electronics 28, Nr. 5 (25.10.2017): 971–78. http://dx.doi.org/10.21629/jsee.2017.05.15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Banaszak, Zbigniew, und Grzegorz Bocewicz. „Declarative Modeling for Production Order Portfolio Scheduling“. Foundations of Management 6, Nr. 3 (01.12.2014): 7–24. http://dx.doi.org/10.1515/fman-2015-0014.

Der volle Inhalt der Quelle

Annotation:

Abstract A declarative framework enabling to determine conditions as well as to develop decision-making software supporting small- and medium-sized enterprises aimed at unique, multi-project-like and mass customized oriented production is discussed. A set of unique production orders grouped into portfolio orders is considered. Operations executed along different production orders share available resources following a mutual exclusion protocol. A unique product or production batch is completed while following a given activity’s network order. The problem concerns scheduling a newly inserted project portfolio subject to constraints imposed by a multi-project environment The answers sought are: Can a given project portfolio specified by its cost and completion time be completed within the assumed time period in a manufacturing system in hand? Which manufacturing system capability guarantees the completion of a given project portfolio ordered under assumed cost and time constraints? The considered problems regard finding a computationally effective approach aimed at simultaneous routing and allocation as well as batching and scheduling of a newly ordered project portfolio subject to constraints imposed by a multi-project environment. The main objective is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multi-project-like and mass customized oriented production scheduling. Multiple illustrative examples are discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Soumatia, Maroua, und Said Amari. „Design of control laws for timed event graphs networks subject to mutual exclusion constraints in Min-Plus algebra“. European Journal of Control 63 (Januar 2022): 270–76. http://dx.doi.org/10.1016/j.ejcon.2021.11.007.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Hou, Haiyang, und Chunyu Zhao. „A Novel Integration Method for D Numbers Based on Horizontal Comparison“. Axioms 10, Nr. 4 (21.11.2021): 312. http://dx.doi.org/10.3390/axioms10040312.

Der volle Inhalt der Quelle

Annotation:

D numbers theory is an extension of Dempster–Shafer evidence theory. It eliminates the constraints of mutual exclusion and completeness under the frame of discernment of Dempster–Shafer evidence theory, so it has been widely used to deal with uncertainty modelling, but if it cannot effectively deal with the problem of missing information, sometimes unreasonable conclusions will be drawn. This paper proposes a new type of integration representation of D numbers, which compares the data of multiple evaluation items horizontally, and can reasonably fill in missing information. We apply this method to the user experience evaluation problem of online live course platform to verify the effectiveness of this method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Hafezi, François, Lisa Jaxel, Morgane Lemaire, Jonathan D. Turner und Danielle Perez-Bercoff. „TERT Promoter Mutations Increase Sense and Antisense Transcription from the TERT Promoter“. Biomedicines 9, Nr. 12 (26.11.2021): 1773. http://dx.doi.org/10.3390/biomedicines9121773.

Der volle Inhalt der Quelle

Annotation:

Background: Chief among mechanisms of telomerase reverse transcriptase (TERT) reactivation is the appearance of mutations in the TERT promoter. The two main TERT promoter mutations are C>T transitions located −146C>T and −124C>T upstream from the translational start site. They generate a novel Ets/TCF binding site. Both mutations are mutually exclusive and −124C>T is strikingly overrepresented in most cancers. We investigated whether this mutational bias and mutual exclusion could be due to transcriptional constraints. Methods: We compared sense and antisense transcription of a panel of TERT promoter-luciferase vectors harboring the −124C>T and -146C>T mutations alone or together. lncRNA TAPAS levels were measured by RT-PCR. Results: Both mutations generally increased TERT transcription by 2–4-fold regardless of upstream and downstream regulatory elements. The double mutant increased transcription in an additive fashion, arguing against a direct transcriptional constraint. The −146C>T mutation, alone or in combination with −124C>T, also unleashed antisense transcription. In line with this finding, lncRNA TAPAS was higher in cells with mutated TERT promoter (T98G and U87) than in cells with wild-type promoter, suggesting that lncRNA TAPAS may balance the effect of TERT promoter mutations. Conclusions: −146C>T and −124C>T TERT promoter mutations increase TERT sense and antisense transcription, and the double mutant features higher transcription levels. Increased antisense transcription may contain TERT expression within sustainable levels.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Wada, Hiroshi, Junichi Suzuki und Katsuya Oba. „Leveraging Early Aspects in End-to-End Model Driven Development for Non-Functional Properties in Service Oriented Architecture“. Journal of Database Management 22, Nr. 2 (April 2011): 93–123. http://dx.doi.org/10.4018/jdm.2011040104.

Der volle Inhalt der Quelle

Annotation:

In Service Oriented Architecture (SOA), each application is designed with a set of reusable services and a business process. To retain the reusability of services, non-functional properties of applications must be separated from their functional properties. This paper investigates a model-driven development framework that separates non-functional properties from functional properties and manages them. This framework proposes two components: (1) a programming language, called BALLAD, for a new per-process strategy to specify non-functional properties for business processes, and (2) a graphical modeling method, called FM-SNFPs, to define a series of constraints among non-functional properties. BALLAD leverages aspects in aspect oriented programming/modeling. Each aspect is used to specify a set of non-functional properties that crosscut multiple services in a business process. FM-SNFPs leverage the notion of feature modeling to define constraints among non-functional properties like dependency and mutual exclusion constraints. BALLAD and FM-SNFPs free application developers from manually specifying, maintaining and validating non-functional properties and constraints for services one by one, reducing the burdens/costs in development and maintenance of service-oriented applications. This paper describes the design details of BALLAD and FM-SNFPs, and demonstrates how they are used in developing service-oriented applications. BALLAD significantly reduces the costs to implement and maintain non-functional properties in service-oriented applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Furmańczyk, H., und M. Kubale. „Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines“. Bulletin of the Polish Academy of Sciences Technical Sciences 65, Nr. 1 (01.02.2017): 29–34. http://dx.doi.org/10.1515/bpasts-2017-0004.

Der volle Inhalt der Quelle

Annotation:

Abstract In the paper we consider the problem of scheduling n identical jobs on 4 uniform machines with speeds s1 ≥ s2 ≥ s3 ≥ s4, respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incompatibility graph of degree Δ, where two incompatible jobs cannot be processed on the same machine. We show that the general problem is NP-hard even if s1 = s2 = s3. If, however, Δ ≤ 4 and s1 ≥ 12s2, s2 = s3 = s4, then the problem can be solved to optimality in time O(n1.5). The same algorithm returns a solution of value at most 2 times optimal provided that s1 ≥ 2s2. Finally, we study the case s1 ≥ s2 ≥ s3 = s4 and give a 32/15-approximation algorithm running also in O(n1.5) time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Yuan, Junkun, Anpeng Wu, Kun Kuang, Bo Li, Runze Wu, Fei Wu und Lanfen Lin. „Auto IV: Counterfactual Prediction via Automatic Instrumental Variable Decomposition“. ACM Transactions on Knowledge Discovery from Data 16, Nr. 4 (31.08.2022): 1–20. http://dx.doi.org/10.1145/3494568.

Der volle Inhalt der Quelle

Annotation:

Instrumental variables (IVs), sources of treatment randomization that are conditionally independent of the outcome, play an important role in causal inference with unobserved confounders. However, the existing IV-based counterfactual prediction methods need well-predefined IVs, while it’s an art rather than science to find valid IVs in many real-world scenes. Moreover, the predefined hand-made IVs could be weak or erroneous by violating the conditions of valid IVs. These thorny facts hinder the application of the IV-based counterfactual prediction methods. In this article, we propose a novel Automatic Instrumental Variable decomposition (AutoIV) algorithm to automatically generate representations serving the role of IVs from observed variables (IV candidates). Specifically, we let the learned IV representations satisfy the relevance condition with the treatment and exclusion condition with the outcome via mutual information maximization and minimization constraints, respectively. We also learn confounder representations by encouraging them to be relevant to both the treatment and the outcome. The IV and confounder representations compete for the information with their constraints in an adversarial game, which allows us to get valid IV representations for IV-based counterfactual prediction. Extensive experiments demonstrate that our method generates valid IV representations for accurate IV-based counterfactual prediction.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Hou, Haiyang, und Chunyu Zhao. „A Novel D–SCRI–EDAS Method and Its Application to the Evaluation of an Online Live Course Platform“. Systems 10, Nr. 5 (19.09.2022): 157. http://dx.doi.org/10.3390/systems10050157.

Der volle Inhalt der Quelle

Annotation:

D number theory removes the constraints of mutual exclusion and completeness in the frame of discernment of DS evidence theory, and is therefore widely used to deal with uncertain and incomplete information. EDAS (evaluation based on distance from average solution) selects the optimal solution according to the distance from each solution to the average. This method is very suitable for solving issues of multiple attribute decision making (MADM) with conflicting attributes. In this study, we propose an evaluation method that combines D numbers with the EDAS method. D number theory is used to express the evaluation of the alternatives for experts. Then, we use the SCRI (stepwise comparison and replacement integration) method of D numbers for data integration, and finally the EDAS method is used to select the optimal one by sorting the alternatives. We apply this method to address the user experience evaluation problems of platforms that offer online live courses and compare the evaluation results with other methods to verify the applicability and practicability of the method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Zeng, Yao, und Huanhuan Dai. „CT Image Segmentation of Liver Tumor with Deep Convolutional Neural Network“. Journal of Medical Imaging and Health Informatics 11, Nr. 2 (01.02.2021): 337–44. http://dx.doi.org/10.1166/jmihi.2021.3295.

Der volle Inhalt der Quelle

Annotation:

The liver is the largest substantial organ in the abdominal cavity of the human body. Its structure is complex, the incidence of vascular abundance is high, and it has been seriously ribbed, human health and life. In this study, an automatic segmentation method based on deep convolutional neural network is proposed. Image data blocks of different sizes are extracted as training data and different network structures are designed, and features are automatically learned to obtain a segmentation structure of the tumor. Secondly, in order to further refine the segmentation boundary, we establish a multi-region segmentation model with region mutual exclusion constraints. The model combines the image grayscale, gradient and prior probability information, and overcomes the problem that the boundary point attribution area caused by boundary blur and regional adhesion is difficult to determine. Finally, the model is solved quickly using the time-invisible multi-phase level set. Compared with the traditional multi-organ segmentation method, this method does not require registration or model initialization. The experimental results show that the model can segment the liver, kidney and spleen quickly and effectively, and the segmentation accuracy reaches the advanced level of current methods.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Polzer, Thomas, Robert Najvirt, Florian Beck und Andreas Steininger. „On the Appropriate Handling of Metastable Voltages in FPGAs“. Journal of Circuits, Systems and Computers 25, Nr. 03 (28.12.2015): 1640020. http://dx.doi.org/10.1142/s021812661640020x.

Der volle Inhalt der Quelle

Annotation:

The significant process, voltage and temperature (PVT) variations seen with modern technologies make strictly synchronous design inefficient. Asynchronous design with its flexible timing is a promising alternative, but prototyping is difficult on the available FPGA platforms which are clock centric and do not provide the required functional primitives like mutual exclusion or Muller C-elements. The solutions proposed in the literature so far work nicely in principle but cannot safely handle metastability issues that are inevitable even at some interfaces in asynchronous designs. In this paper, we propose reliable implementations of the fundamental function blocks required to safely convert potential intermediate voltage levels that result from metastability into late transitions that can be reliably handled in the asynchronous domain. These are high- and low-threshold buffers as well as a Schmitt-trigger. We give elaborate background analysis for the proposed circuits and also present the associated routing constraints to make the Schmitt-trigger circuit work properly in spite of the uncertain routing within FPGAs. Furthermore, we propose a procedure for an “in situ reliability assessment” of the specific Schmitt-trigger element under consideration, which also applies to metastability containment with high- or low-threshold buffers only. Our proof of concept is based on experimental results for both Xilinx and Altera FPGA platforms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Anagnostaras, Georgios. „The Costa and Cifone ruling: Market Protection of Incumbent Gambling Licensees and the Provision of Cross Border Gaming Services Outside the Scope of the National Concession“. European Business Law Review 24, Issue 6 (01.12.2013): 873–89. http://dx.doi.org/10.54648/eulr2013041.

Der volle Inhalt der Quelle

Annotation:

Five years since the seminal Placanica ruling, the Court was eventually given the opportunity to ascertain whether the exclusionary effects of the then applicable Italian gambling legislation were indeed remedied in accordance with its relevant judicial pronouncements. In Costa and Cifone, it was called upon to examine in this respect two particular aspects of the reformed Italian gambling licensing regime. First, the requirement that all new concessionaries are obliged to observe a minimum distance from the gaming outlets of already established licensees. Second, the obligation imposed on the competent national authorities to revoke the gambling licence of operators engaging in cross border gaming activities outside the scope of the national concession. The ruling clarifies that the imposition of geographical constraints exclusively on new tenderers contravenes the Placanica case law. It omits to explain though what actually distinguishes the Costa and Cifone scenario from the earlier Blanco Pérez ruling, where the imposition of a similar legislative requirement was in principle accepted in relation to the provision of medicinal services. The ruling also relies on the ambiguity of the Italian gambling law and avoids tackling directly the second preliminary question asked by the referring national court. By doing so, it misses the opportunity to explain whether the obligation to comply with the totality of the conditions governing an awarded gaming licence constitutes the necessary corollary of the exclusion of the mutual recognition principle in the entire gambling area.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Basile, Francesco, Laura Recalde, Pasquale Chiacchio und Manuel Silva. „Closed-loop Live Marked Graphs under Generalized Mutual Exclusion Constraint Enforcement“. Discrete Event Dynamic Systems 19, Nr. 1 (25.09.2008): 1–30. http://dx.doi.org/10.1007/s10626-008-0050-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Saidi, Salah Eddine, Nicolas Pernet und Yves Sorel. „A method for parallel scheduling of multi-rate co-simulation on multi-core platforms“. Oil & Gas Science and Technology – Revue d’IFP Energies nouvelles 74 (2019): 49. http://dx.doi.org/10.2516/ogst/2019009.

Der volle Inhalt der Quelle

Annotation:

The design of cyber-physical systems is a complex process and relies on the simulation of the system behavior before its deployment. Such is the case, for instance, of joint simulation of the different subsystems that constitute a hybrid automotive powertrain. Co-simulation allows system designers to simulate a whole system composed of a number of interconnected subsystem simulators. Traditionally, these subsystems are modeled by experts of different fields using different tools, and then integrated into one tool to perform simulation at the system-level. This results in complex and compute-intensive co-simulations and requires the parallelization of these co-simulations in order to accelerate their execution. The simulators composing a co-simulation are characterized by the rates of data exchange between the simulators, defined by the engineers who set the communication steps. The RCOSIM approach allows the parallelization on multi-core processors of co-simulations using the FMI standard. This approach is based on the exploitation of the co-simulation parallelism where dependent functions perform different computation tasks. In this paper, we extend RCOSIM to handle additional co-simulation requirements. First, we extend the co-simulation to multi-rate, i.e. where simulators are assigned different communication steps. We present graph transformation rules and an algorithm that allow the execution of each simulator at its respective rate while ensuring correct and efficient data exchange between simulators. Second, we present an approach based on acyclic orientation of mixed graphs for handling mutual exclusion constraints between functions that belong to the same simulator due to the non-thread-safe implementation of FMI. We propose an exact algorithm and a heuristic for performing the acyclic orientation. The final stage of the proposed approach consists in scheduling the co-simulation on a multi-core architecture. We propose an algorithm and a heuristic for computing a schedule which minimizes the total execution time of the co-simulation. We evaluate the performance of our proposed approach in terms of the obtained execution speed. By applying our approach on an industrial use case, we obtained a maximum speedup of 2.91 on four cores.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Stöcker, Bianca, Johannes Köster, Eli Zamir und Sven Rahmann. „Modeling and Simulating Constrained Protein Interaction Networks“. Genomics and Computational Biology 4, Nr. 1 (11.12.2017): 100049. http://dx.doi.org/10.18547/gcb.2018.vol4.iss1.e100049.

Der volle Inhalt der Quelle

Annotation:

Cellular functions of biochemical reactions are enabled by protein interactions. In addition to the protein interactions themselves, dependencies between these interactions such as allosteric activation or mutual exclusion contribute to the complexity and functionality of these systems. We introduce a model of constrained protein interaction networks that uses propositional logic to combine protein networks with interaction dependencies. Further, we present an efficient model, enabling a fast simulation and analysis of many proteins in large networks. This allows to simulate perturbation effects (over-expression/knockout of single or multiple proteins, protein concentrations changes). A comparison of simulation results with known true dependencies against simulated complex formation without dependencies shows that interaction dependencies limit the resulting complex sizes. Further, we show how propagation of perturbation effects is influenced by the interplay of network topology and interaction dependencies and how to analyze this with our model.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Liu, Meng, Yun Luo, Chi Yang, Shaoning Pang, Deepak Puthal, Kaijun Ren und Xuyun Zhang. „Privacy-preserving matrix product based static mutual exclusive roles constraints violation detection in interoperable role-based access control“. Future Generation Computer Systems 109 (August 2020): 457–68. http://dx.doi.org/10.1016/j.future.2018.10.017.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Gupta, Bhupesh, und Sanjeev Rana. „Mutual Exclusive Sleep Awake Energy Efficient Distributive (MESAEED) Clustering: An Approach for Enhancing Lifetime of Wireless Sensor Network“. Journal of Computational and Theoretical Nanoscience 16, Nr. 9 (01.09.2019): 3925–31. http://dx.doi.org/10.1166/jctn.2019.8272.

Der volle Inhalt der Quelle

Annotation:

For resource constraint network, one uses wireless sensor network in which limited resources are there for sensor nodes. Basic aim of sensor node is to sense something, monitor it and explain it. The issue arises for sensor node is its battery endurance. The battery endurance of sensor node is consuming in communication instead of sensing. In this regard clustering is using now a day’s which reduces endurance consumption. This paper comes with a new clustering protocol MESAEED (Mutual Exclusive Sleep Awake Energy Efficient Distributed clustering), which helps in saving endurance of sensor nodes so that network lifetime will prolong. It is an extension work of previous work MESADC. In previous work cluster head is chooses on the basis of sleep awake mode in mutual exclusive way under communication range and the results were obtained with the help of comparison graph between HEED and MESADC. The proposed MESAEED protocol provides benefit of A* algorithm of heuristic search, HEED and MESADC. MATLAB 8.3 is use for simulation purpose. The comparison graph between HEED, MESADC and proposed MESAEED were shown. Parameters for comparison include alive nodes versus number of rounds taken and number of nodes dead versus number of rounds taken. The graph shows improvement in performance over HEED and MESADC, which results in enhancing lifetime of WSN.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Zhang, Linghong, und Hao Zhou. „The Optimal Green Product Design with Cost Constraint and Sustainable Policies for the Manufacturer“. Mathematical Problems in Engineering 2019 (24.10.2019): 1–14. http://dx.doi.org/10.1155/2019/7841097.

Der volle Inhalt der Quelle

Annotation:

In this paper, we study how the manufacturer balances the investment between the green product and the ordinary product as consumer environmental awareness (CEA) increases. The green product and ordinary product have a basic commonality traditional quality but difference between the premium environmental quality and premium traditional quality. With the cost constraint, we present manufacturer’s optimal strategy: producing one product or two products and the optimal traditional quality of the ordinary product or the optimal environmental quality of the green product. Then, we further study the effect of government subsidy and tax on manufacturer’s strategies and analyze the effectiveness of the policies. Finally, we give some numerical examples and sensitivity analysis. The main findings are as follows: (1) manufacturer’s cost constraint affects product’s optimal quality but may not influence manufacturer’s optimal product strategy: the manufacturer may not produce two products even through the budget is sufficient large; (2) the government policy could induce the manufacturer to invest green product but may be inefficient; the subsidy and tax policies are mutual exclusion; and either subsidy or tax could play a role in changing manufacturer’s strategy. Some management insights are given.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Bouazza, Syrine, Said Amari und Hichem Hassine. „Algebraic Control Strategy for Solving the Mutual Exclusion Constraint Problem in a Network of Timed Event Graphs With Disturbance Inputs: Application to an Assembly Process“. International Journal of Control, Automation and Systems 22, Nr. 5 (Mai 2024): 1563–72. http://dx.doi.org/10.1007/s12555-023-0627-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Allakany, Alaa, Abeer Saber, Samih M. Mostafa, Maazen Alsabaan, Mohamed I. Ibrahem und Haitham Elwahsh. „Enhancing Security in ZigBee Wireless Sensor Networks: A New Approach and Mutual Authentication Scheme for D2D Communication“. Sensors 23, Nr. 12 (19.06.2023): 5703. http://dx.doi.org/10.3390/s23125703.

Der volle Inhalt der Quelle

Annotation:

The latest version of ZigBee offers improvements in various aspects, including its low power consumption, flexibility, and cost-effective deployment. However, the challenges persist, as the upgraded protocol continues to suffer from a wide range of security weaknesses. Constrained wireless sensor network devices cannot use standard security protocols such as asymmetric cryptography mechanisms, which are resource-intensive and unsuitable for wireless sensor networks. ZigBee uses the Advanced Encryption Standard (AES), which is the best recommended symmetric key block cipher for securing data of sensitive networks and applications. However, AES is expected to be vulnerable to some attacks in the near future. Moreover, symmetric cryptosystems have key management and authentication issues. To address these concerns in wireless sensor networks, particularly in ZigBee communications, in this paper, we propose a mutual authentication scheme that can dynamically update the secret key value of device-to-trust center (D2TC) and device-to-device (D2D) communications. In addition, the suggested solution improves the cryptographic strength of ZigBee communications by improving the encryption process of a regular AES without the need for asymmetric cryptography. To achieve that, we use a secure one-way hash function operation when D2TC and D2D mutually authenticate each other, along with bitwise exclusive OR operations to enhance cryptography. Once authentication is accomplished, the ZigBee-based participants can mutually agree upon a shared session key and exchange a secure value. This secure value is then integrated with the sensed data from the devices and utilized as input for regular AES encryption. By adopting this technique, the encrypted data gains robust protection against potential cryptanalysis attacks. Finally, a comparative analysis is conducted to illustrate how the proposed scheme effectively maintains efficiency in comparison to eight competitive schemes. This analysis evaluates the scheme’s performance across various factors, including security features, communication, and computational cost.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Hopkins, B., J. E. Vos und T. Van Wulfften Palthe. „Quantitative Description of Early Mother-Infant Interaction Using Information Theoretical Statistics“. Behaviour 112, Nr. 1-2 (1990): 117–47. http://dx.doi.org/10.1163/156853990x00716.

Der volle Inhalt der Quelle

Annotation:

AbstractThe general hypothesis concerning the development of dyadic interaction ascribed to here is that during the first six weeks after birth the infant is insufficiently equipped for active participation in en face interaction and acts relatively independently of his mother. Due to the maturation of underlying neural mechanisms at the age of about two months, a number of crucial transformations occur in postural, motor and visual functions (see PRECHTL, 1984). These developmental changes enable the infant to become an increasingly active partner in en face interaction: a two-way process during which both mother and infant relate the timing of their behaviour to that of the other. Six healthy mother-infant pairs participated in this longitudinal, home-based study which made use of video equipment to record a 15 min interaction session at 3, 6, 9, 12, 15 and 21 weeks of age. The infant behaviours selected for study were: posture, movement, looking, smile, whimper, grunt, "pleasure" vocalization, yawn, grasping hands in mid-line, hand-mouth contact. Maternal behaviours selected were: looking, body movement, head movement, touching, speech, other vocalizations and sound effects, moving infant's limbs. The aim of the study was to provide a quantitative description of the changes in the sequential dependence of behaviour within the mother-infant pairs. To this end information theoretical statistics as elaborated by van den BERCKEN (1979) and van den BERCKEN & COOLS (1980) were applied making use of analysis of variance terminology. The methodological problem of taking into account the constraint stemming from each partner's own previous behaviour (auto-correlation) when making inferences about ongoing behaviour between the two partners (cross-correlation) was removed by identifying and successfully controlling the various sources of influences affecting behaviour during dyadic interaction. The data were addressed to the following questions: 1. Was there a change in the use the infants made of their behavioural repertoire (individual variability of the infant) during the age-range studied? 2. Was there a change in the use the mothers made of their behavioural repertoire (individual variability of the mother)? 3. Was there a change in the constraint on the infant's current behaviour stemming from his previous behaviour, i.e. did the amount of variance explained by the exclusive influence of the infant's own preceding behaviour on its current behaviour (auto-covariability) increase during the age-range studied? 4. Was there a change in the constraint on the infant's current behaviour stemming from his mother's previous behaviour, i.e. did the amount of variance explained by the exclusive influence of the mother's previous behaviour (cross-covariability) increase during the age-range studied? 5. Was there a change in the constraint on the infant's current behaviour stemming only from the combined effect of his own and his mother's previous behaviour, i.e. did the so-called synergic covariability effect become stronger during the age-range studied which reflected increasing mutual dependence between the behaviour of the two partners? For both mothers and infants an increase was found in individual variability while no changes were found in the measures of auto- and cross-covariability. The measure of synergic covariability became increasingly stronger from 12 weeks onwards. These results were interpreted as follows: over the age-range studied infant and mother showed a growing mutual dependence (stronger synergic covariability) with increasing use of their own repertoire (increasing individual variabilities) while the infant's behaviour neither became less dependant on his own previous behaviour (auto-covariability) nor more dependant on the mother's previous behaviour (cross-covariability). Thus a quantitative confirmation of the general hypothesis stated at the onset was provided. Moreover, information theoretical statistics have proved a satisfactory method by means of which dyadic interaction between mother and infant can be described quantitatively.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Yang, Dong, Jingyuan Wang und Xi Yang. „3D Point Cloud Shape Generation with Collaborative Learning of Generative Adversarial Network and Auto-Encoder“. Remote Sensing 16, Nr. 10 (16.05.2024): 1772. http://dx.doi.org/10.3390/rs16101772.

Der volle Inhalt der Quelle

Annotation:

A point cloud is a simple and concise 3D representation, but point cloud generation is a long-term challenging task in 3D vision. However, most existing methods only focus on their effectiveness of generation and auto-encoding separately. Furthermore, both generative adversarial networks (GANs) and auto-encoders (AEs) are the most popular generative models. But there is a lack of related research that investigates the implicit connections between them in the field of point cloud generation. Thus, we propose a new bidirectional network (BI-Net) trained with collaborative learning, introducing more priors through the alternate parameter optimizations of a GAN and AE combination, which is different from the way of combining them at the network structure and loss function level. Specifically, BI-Net acts as a GAN and AE in different data processing directions, where their network structures can be reused. If optimizing only the GAN without the AE, there is no direct constraint of ground truth on the generator’s parameter optimization. This unique approach enables better network optimization and leads to superior generation results. Moreover, we propose a nearest neighbor mutual exclusion (NNME) loss to further homogenize the spatial distribution of generated points during the reverse direction. Extensive experiments were conducted, and the results show that the BI-Net produces competitive and high-quality results on reasonable structure and uniform distributions compared to existing state-of-the-art methods. We believe that our network structure (BI-Net) with collaborative learning could provide a new promising method for future point cloud generation tasks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

R. Chapman, Jared, und Bruce L. Brown. „An empirical study of the career anchors that govern career decisions“. Personnel Review 43, Nr. 5 (29.07.2014): 717–40. http://dx.doi.org/10.1108/pr-01-2013-0017.

Der volle Inhalt der Quelle

Annotation:

Purpose – The purpose of this paper is to examine two of Feldman and Bolino's proposals: career anchor plurality and career anchor relationships. Design/methodology/approach – A novel method for examining the relationships between career anchors called “indices of mutual presence” is developed for this study to generate meaningful results from ordinal and ipsative career anchor data. Findings – Evidence for some individuals having multiple career anchors was found. Complementary and exclusivity career anchor relationships are identified and a model for representing them is presented. The importance and possible benefit of understanding both an individual's preferred and “unpreferred” anchors is discussed. The non-reflexive nature of career anchors is explored and the idea of “mutually” exclusive career anchors is rejected. Weaknesses in the octagon shaped career anchor relationships diagram presented by Feldman and Bolino are discussed. Research limitations/implications – Despite the benefits associated with forced-choice assessments, some have expressed concern because of the nature of this type of evaluation. Each time an item is preferred, another item must be “unpreferred.” Thus, for one item to have a high preference count, some other item must necessarily have lower preference counts. The resulting data is ordinal rather than interval or ratio. It contains information regarding order of preference, but provides little insight into magnitude of preference. This makes it difficult to identify and examine how much more or less one individual prefers an item when compared to another individual. Originality/value – The second property of forced-choice data that raises concern is its ipsative nature. As respondents are constrained to unprefer an item each time the prefer one, the total preference counts remain the same for every individual. As a result, the preference scores for every individual will always sum to the same value. When data has this property, it is called ipsative. Ipsative data is not free to vary, and thus statistical methods which analyze variance may yield spurious results. Thus, traditional factorial statistical methods cannot be appropriately used with ipsative data (Baron, 1996; Bartram, 1996; Closs, 1996). It is commonly believed that researchers trade ease of use and accuracy for fewer available statistical tools when using forced-choice methods. However, this paper attempts to use “indices of mutual presence” developed for this study (described below) that do not rely on variance to generate meaningful results from ipsative career anchor data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Pandey, Neeraj, und Gaganpreet Singh. „Value communication: low-cost marketing initiatives for “Guru Ki Bani 58282”“. Emerald Emerging Markets Case Studies 3, Nr. 3 (28.06.2013): 1–9. http://dx.doi.org/10.1108/eemcs-04-2013-0025.

Der volle Inhalt der Quelle

Annotation:

Subject area Pricing, digital marketing, marketing management and strategic marketing. Study level/applicability The case can be used for pricing or digital marketing courses as well as marketing management courses to MBA students and/or for management development programmes. Case overview Goldfinch Mobile Solutions, a Hong-Kong based value added services (VAS) and gaming platform provider, had an exclusive tie up with Bharti Airtel in India for providing value added voice applications on an interactive voice response system (IVRS) platform. The Goldfinch flagship service is “Guru Ki Bani” which may be subscribed to by dialing the short code 58282. This “58282” service has a repository of all Sikh religion daily prayers, religious songs, teachings, stories from Guru's life and similar information that is derived from the Sikh Holy book Guru Granth Sahib Ji. As per mutual agreement between Goldfinch Mobile Solutions and Bharti Airtel, the telecom operator had the responsibility to promote Goldfinch's Guru Ki Bani service amongst its subscriber base through its below the line (BTL) promotional channels such as short messaging service (SMS), outbound calls, cell information, notification SMS after call and above the line (ATL) activities such as posters, leaflets, print, promoters, regional TV, outdoors, etc. The revenue sharing arrangement between Airtel and Golfinch was in the ratio of 75 percent and 25 percent. However, with recent changes in the policies of Telephone Regulatory Authority of India (TRAI), promotional marketing used by telecom operators has been constrained. Declining customer share, decreasing profits (after Bharti Airtel halted promotions) and increasing organization cost per customer have made MD and CEO Mr Newton Bubber think of various options including low-cost marketing initiatives besides digital marketing to promote Guru Ki Bani services. Value communication to its huge potential customer base, i.e. 184.19 million Bharti Airtel subscribers was another challenge facing Mr Newton and his marketing team at Goldfinch. Expected learning outcomes The case enables students to learn the concepts and application of value creation, effective value communication, price waterfall analysis, importance of costing parameters in pricing decisions, low-cost marketing strategies and digital marketing. Supplementary materials Teaching notes are available for educators only. Please contact your library to gain login details or email support@emeraldinsight.com to request teaching notes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Полінкевич, Оксана, und Олена Кузьмак. „MARKETING TRIGGERS OF EFFECTIVE TEAM BUILDING AS FACTORS OF ENSURING THE QUALITY OF EDUCATION“. Економічний форум 1, Nr. 4 (14.12.2022): 83–89. http://dx.doi.org/10.36910/6775-2308-8559-2022-4-10.

Der volle Inhalt der Quelle

Annotation:

Education is the field of activity that forms and lays down skills in the subject field of knowledge, psychological and social foundations of communication and promotes self-development and self-expression of individuals. The main goal of the study is to determine the marketing triggers of team building in ensuring the quality of education according to internal and external quality characteristics. Systematization of literary sources and approaches to solving this problem showed that the issue of marketing triggers as a tool for effective team building and quality of education is relevant. The urgency of solving this scientific problem lies in the fact that teamwork will bring better results in terms of ensuring the quality of education than individual aspirations of individuals. The study of the problem was carried out in the following logical sequence: first, the main problems of ensuring the quality of education were analyzed, marketing triggers were grouped according to two groups of factors (external and internal), then the characteristics of the team were outlined, the Drexler-Sibbet model was built, marketing triggers of team building in ensuring the quality of education were proposed. The methodological tools of the study were the following approaches and methods: systematic approach, logical generalization and comparison - for grouping marketing triggers of team building to ensure the quality of education, methods of analysis and synthesis - for evaluating the characteristics of the quality of education. Marketing triggers for ensuring the quality of education were chosen as the research object, and the quality of education as the subject. The article establishes that team building is the main tool that will contribute to the quality of education. The process of team building itself should take place in 7 stages, the main ones of which are orientation, gaining trust, specification of the goal, commitment, distribution of roles, high performance, reboot. These stages are predicted by the Drexler-Sibbet model. The methodology of team building based on the model provides an answer at each stage to one of the questions: What am I doing here? Who are you? What are we doing? How are we doing it? Who, how, what, when?, Why continue? At each of them, depending on the answers of a potential team member, trust, goals and common perspectives, agreement in actions, clarity of decisions, clarity of processes are formed, discipline, synergy, unexpected interactivity, joint spending of time are growing. However, in the event of a team member's lack of answers to questions or hesitation and uncertainty, caution, difficulty communicating, pretense, mistrust, apathy, skepticism, unhealthy competition, confusion, danger, resistance, silence, resistance, lack of interest, shallow thinking, conflict may occur. , breaking deadlines, inequality, avoiding one's obligations, envy, disharmony, fatigue and tension, exhaustion, boredom and decay. At each of the stages, there are marketing triggers and trigger words, thanks to which you can stimulate team building, which will increase the quality of education. It is known that teamwork creates a synergy effect that contributes to achieving higher results than individual results. The main triggers are: fear and danger, herd instinct, individuality, greed, mutual gratitude, trust, limitation, ambiguity, scarcity, time constraints, loyalty, fear, storytelling, news, price comparison, guarantees, relevance. Trigger words are: free, immediate, today only, news, secret, open, increase, exclusive, because, only. The study results can be useful in developing a methodology for improving the quality of education with marketing tools.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

„079 Petri net supervisors for generalized mutual exclusion constraints“. Control Engineering Practice 2, Nr. 6 (Dezember 1994): 1070. http://dx.doi.org/10.1016/0967-0661(94)91706-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Yang, Benyuan, und Hesuan Hu. „Implementation of Generalized Mutual Exclusion Constraints Using Critical Places and Marking Estimation“. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2019, 1–13. http://dx.doi.org/10.1109/tsmc.2019.2944886.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

FUJITA, Kohei, und Toshimitsu USHIO. „Optimal Control of Timed Petri Nets Under Temporal Logic Constraints with Generalized Mutual Exclusion“. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2021. http://dx.doi.org/10.1587/transfun.2021map0003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Bouazza, S., S. Amari und H. Hassine. „Control laws for partially observable Min-Plus systems networks with disturbances and under mutual exclusion constraints“. IEEE Robotics and Automation Letters, 2023, 1–8. http://dx.doi.org/10.1109/lra.2023.3346809.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Rajah, Jihene, Said Amari, Karima Tebani, Maher Barkallah und Mohamed Haddar. „Feedback control laws to ensure generalized mutual exclusion constraints in a network of partially observable timed event graphs“. European Journal of Control, April 2023, 100809. http://dx.doi.org/10.1016/j.ejcon.2023.100809.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Rajah, Jihene, Said Amari, Maher Barkallah und Mohamed Haddar. „Control laws synthesis to satisfy generalized mutual exclusion constraints for timed event graphs networks using Min-Plus algebra“. Information Sciences, Januar 2024, 120115. http://dx.doi.org/10.1016/j.ins.2024.120115.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Soumatia, Maroua, Saïd Amari und Khalid Hachemi. „Modeling and control of drug assignment for pharmaceutical cabinets using discrete event systems approaches“. Asian Journal of Control, 14.01.2024. http://dx.doi.org/10.1002/asjc.3292.

Der volle Inhalt der Quelle

Annotation:

AbstractThe public health sector, considered to be vital, especially in this pandemic crisis of COVID‐19, requires automation and control of drug distribution in pharmacies commonly called: “Dispensing.” In this paper, we address the medication assignment problem for automated dispensing cabinets (ADCs). First, we use a network of conflicting timed event graphs (CTEGs), a class of timed Petri nets with shared resources, to model pharmaceutical cabinets. Second, we develop a new method for controlling CTEGs under mutual exclusion constraints (MECs) to solve the problem of drug assignment, using a control approach based on Min‐Plus algebra. Finally, a case study of assigning drugs is given to illustrate the proposed methodology and show the efficiency of the developed control laws.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Soumatia, Maroua, und Said Amari. „On the Feedback Control for Networks of Partially Observable Timed Event Graphs Subject to Mutual Exclusion Constraints in Dioid Algebra“. SSRN Electronic Journal, 2022. http://dx.doi.org/10.2139/ssrn.4213457.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Kazemi, Hesaneh, Ashkan Vaziri und Julián A. Norato. „Topology Optimization of Structures Made of Discrete Geometric Components With Different Materials“. Journal of Mechanical Design 140, Nr. 11 (07.09.2018). http://dx.doi.org/10.1115/1.4040624.

Der volle Inhalt der Quelle

Annotation:

We present a new method for the simultaneous topology optimization and material selection of structures made by the union of discrete geometric components, where each component is made of one of multiple available materials. Our approach is based on the geometry projection method, whereby an analytical description of the geometric components is smoothly mapped onto a density field on a fixed analysis grid. In addition to the parameters that dictate the dimensions, position, and orientation of the component, a size variable per available material is ascribed to each component. A size variable value of unity indicates that the component is made of the corresponding material. Moreover, all size variables can be zero, signifying the component is entirely removed from the design. We penalize intermediate values of the size variables via an aggregate constraint in the optimization. We also introduce a mutual material exclusion constraint that ensures that at most one material has a unity size variable in each geometric component. In addition to these constraints, we propose a novel aggregation scheme to perform the union of geometric components with dissimilar materials. These ingredients facilitate treatment of the multi-material case. Our formulation can be readily extended to any number of materials. We demonstrate our method with several numerical examples.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

König, Simone, Maximilian Reihn, Felipe Gelinski Abujamra, Alexander Novy und Birgit Vogel-Heuser. „Flexible scheduling of diagnostic tests in automotive manufacturing“. Flexible Services and Manufacturing Journal, 16.01.2022. http://dx.doi.org/10.1007/s10696-021-09438-3.

Der volle Inhalt der Quelle

Annotation:

AbstractThe car of the future will be driven by software and offer a variety of customisation options. Enabling these customisation options forces modern automotive manufacturers to update their standardised scheduling concepts for testing and commissioning cars. A flexible scheduling concept means that every chosen customer configuration code must have its own testing procedure. This concept is essential to provide individual testing workflows where the time and resources are optimised for every car. Manual scheduling is complicated due to constraints on time, predecessor-successor relationships, mutual exclusion criteria, resources and status conditions on the car engineering and assembly line. Applied methods to handle the mathematical formulation for the corresponding industrial optimisation problem and its implementation are not yet available. This paper presents a procedure for automated and non-preemptive scheduling in the testing and commissioning of cars, which is built on a Boolean satisfiability problem on parallel and identical machines with temporal and resource constraints. The presented method is successfully implemented and evaluated on a variant assembly line of an automotive Original Equipment Manufacturer. This paper is the starting point for an automated workflow planning and scheduling process in automotive manufacturing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Jenke, Alexander C., Sebastian Bodenstedt, Fiona R. Kolbinger, Marius Distler, Jürgen Weitz und Stefanie Speidel. „One model to use them all: training a segmentation model with complementary datasets“. International Journal of Computer Assisted Radiology and Surgery, 27.04.2024. http://dx.doi.org/10.1007/s11548-024-03145-8.

Der volle Inhalt der Quelle

Annotation:

Abstract Purpose Understanding surgical scenes is crucial for computer-assisted surgery systems to provide intelligent assistance functionality. One way of achieving this is via scene segmentation using machine learning (ML). However, such ML models require large amounts of annotated training data, containing examples of all relevant object classes, which are rarely available. In this work, we propose a method to combine multiple partially annotated datasets, providing complementary annotations, into one model, enabling better scene segmentation and the use of multiple readily available datasets. Methods Our method aims to combine available data with complementary labels by leveraging mutual exclusive properties to maximize information. Specifically, we propose to use positive annotations of other classes as negative samples and to exclude background pixels of these binary annotations, as we cannot tell if a positive prediction by the model is correct. Results We evaluate our method by training a DeepLabV3 model on the publicly available Dresden Surgical Anatomy Dataset, which provides multiple subsets of binary segmented anatomical structures. Our approach successfully combines 6 classes into one model, significantly increasing the overall Dice Score by 4.4% compared to an ensemble of models trained on the classes individually. By including information on multiple classes, we were able to reduce the confusion between classes, e.g. a 24% drop for stomach and colon. Conclusion By leveraging multiple datasets and applying mutual exclusion constraints, we developed a method that improves surgical scene segmentation performance without the need for fully annotated datasets. Our results demonstrate the feasibility of training a model on multiple complementary datasets. This paves the way for future work further alleviating the need for one specialized large, fully segmented dataset but instead the use of already existing datasets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Tan, Viggy Wee Gee, Yiann Sitoh, Dominic Chwan Yee Foo, John Frederick D. Tapia und Raymond R. Tan. „Optimal reaction pathways of carbon dioxide hydrogenation using P-graph attainable region technique (PART)“. Discover Chemical Engineering 3, Nr. 1 (14.08.2023). http://dx.doi.org/10.1007/s43938-023-00031-8.

Der volle Inhalt der Quelle

Annotation:

AbstractThe attainable region interpretation of the thermodynamic principles has indicated that carbon dioxide (CO2) can be either hydrogenated directly to form dimethyl ether (DME) or gasoline. The process that converts CO2 to DME is more thermodynamically favourable at lower temperature. A certain thermodynamic temperature range (25 to 300 °C) is suggested for the conversion of CO2 to DME via a methanol intermediate pathway without addition of work. Optimal synthesis routes derived from P-graph's mutual exclusion solver were compared with reactions reported in literature and showed great correlation. The reactions collectively possess Gibbs free energy of less than zero, and negative enthalpy of reaction. With P-graph attainable region technique, the case studies have demonstrated that the synthesis of DME and gasoline using CO2 hydrogenation via methanol intermediate and carbon monoxide intermediate from Fischer–Tropsch synthesis is feasible with no work and heat requirement. Both case studies have demonstrated visual advantage of P-graph and data-driven applications. The benefit of integrating the P-graph framework with machine learning model like decision tree classifier was also demonstrated in the second case study as it solves topological optimisation problems without scaling constraints.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Chatterjee, Ayan, Andreas Prinz, Michael A. Riegler und Jishnu Das. „A systematic review and knowledge mapping on ICT-based remote and automatic COVID-19 patient monitoring and care“. BMC Health Services Research 23, Nr. 1 (30.09.2023). http://dx.doi.org/10.1186/s12913-023-10047-z.

Der volle Inhalt der Quelle

Annotation:

Abstract Background e-Health has played a crucial role during the COVID-19 pandemic in primary health care. e-Health is the cost-effective and secure use of Information and Communication Technologies (ICTs) to support health and health-related fields. Various stakeholders worldwide use ICTs, including individuals, non-profit organizations, health practitioners, and governments. As a result of the COVID-19 pandemic, ICT has improved the quality of healthcare, the exchange of information, training of healthcare professionals and patients, and facilitated the relationship between patients and healthcare providers. This study systematically reviews the literature on ICT-based automatic and remote monitoring methods, as well as different ICT techniques used in the care of COVID-19-infected patients. Objective The purpose of this systematic literature review is to identify the e-Health methods, associated ICTs, method implementation strategies, information collection techniques, advantages, and disadvantages of remote and automatic patient monitoring and care in COVID-19 pandemic. Methods The search included primary studies that were published between January 2020 and June 2022 in scientific and electronic databases, such as EBSCOhost, Scopus, ACM, Nature, SpringerLink, IEEE Xplore, MEDLINE, Google Scholar, JMIR, Web of Science, Science Direct, and PubMed. In this review, the findings from the included publications are presented and elaborated according to the identified research questions. Evidence-based systematic reviews and meta-analyses were conducted using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) framework. Additionally, we improved the review process using the Rayyan tool and the Scale for the Assessment of Narrative Review Articles (SANRA). Among the eligibility criteria were methodological rigor, conceptual clarity, and useful implementation of ICTs in e-Health for remote and automatic monitoring of COVID-19 patients. Results Our initial search identified 664 potential studies; 102 were assessed for eligibility in the pre-final stage and 65 articles were used in the final review with the inclusion and exclusion criteria. The review identified the following eHealth methods—Telemedicine, Mobile Health (mHealth), and Telehealth. The associated ICTs are Wearable Body Sensors, Artificial Intelligence (AI) algorithms, Internet-of-Things, or Internet-of-Medical-Things (IoT or IoMT), Biometric Monitoring Technologies (BioMeTs), and Bluetooth-enabled (BLE) home health monitoring devices. Spatial or positional data, personal and individual health, and wellness data, including vital signs, symptoms, biomedical images and signals, and lifestyle data are examples of information that is managed by ICTs. Different AI and IoT methods have opened new possibilities for automatic and remote patient monitoring with associated advantages and weaknesses. Our findings were represented in a structured manner using a semantic knowledge graph (e.g., ontology model). Conclusions Various e-Health methods, related remote monitoring technologies, different approaches, information categories, the adoption of ICT tools for an automatic remote patient monitoring (RPM), advantages and limitations of RMTs in the COVID-19 case are discussed in this review. The use of e-Health during the COVID-19 pandemic illustrates the constraints and possibilities of using ICTs. ICTs are not merely an external tool to achieve definite remote and automatic health monitoring goals; instead, they are embedded in contexts. Therefore, the importance of the mutual design process between ICT and society during the global health crisis has been observed from a social informatics perspective. A global health crisis can be observed as an information crisis (e.g., insufficient information, unreliable information, and inaccessible information); however, this review shows the influence of ICTs on COVID-19 patients' health monitoring and related information collection techniques.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zeitschriftenartikel zum Thema „Mutual exclusion constraints“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an