Academic literature on the topic 'Distributed contraint solving'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Distributed contraint solving.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Distributed contraint solving"
1
SO, YOUNG-PA, and EDMUND H. DURFEE. "A DISTRIBUTED PROBLEM-SOLVING INFRASTRUCTURE FOR COMPUTER NETWORK MANAGEMENT." International Journal of Cooperative Information Systems 01, no. 02 (June 1992): 363–92. http://dx.doi.org/10.1142/s0218215792000246.
Full textAbstract:
A distributed computer network management system consisting of cooperating autonomous computing agents allows network management to be more responsive due to information gathering and network recovery activities being performed in parallel. However, to perform these tasks, the network of agents requires a stable organizational infrastructure. In addition, to meet the needs of human network administrators, the distributed system must allow ultimate authority to be centralized at a single location. Distributed Big Brother (DBB) represents a pragmatic blending of diverse technologies from the field of distributed AI, such as contract formation, organizational structuring, election for role assignment, and hierarchical control. The result is an infrastructure for a network management system in which separate agents reconfigure themselves when hardware and software failures occur in order to assure the authority structure demanded by network operators. Our efforts illustrate how integrating existing distributed AI technologies can meet realistic needs, and highlight open problems that require the development of new technologies.
2
Et al., *Wan Nur Izzah Wan Muhamad Fokri. "THE UNCLAIMED INHERITANCE ISSUES: A SOLUTION USING BLOCKCHAIN TECHNOLOGY." Psychology and Education Journal 58, no. 1 (January 15, 2021): 4709–17. http://dx.doi.org/10.17762/pae.v58i1.1630.
Full textAbstract:
Unclaimed inheritance retards the economy as well as the continuity of life, especially for beneficiaries who are less capable. Recorded cases of unclaimed inheritance have seen a yearly rise, and this also has an effect on the Malaysian economy, mainly due to the failure to distribute immoveable property, such as the failure to transfer the ownership of land and houses. This causes the land to become abandoned and underdeveloped. Hence, various measures are needed to solve the unclaimed inheritance problem and contemporary technology should be fully utilised to overcome this problem. This study intended to explore the benefits of blockchain technology for solving the unclaimed inheritance problem. Blockchain technology is a database system that replaces the traditional system with various advantageous, which makes organisational management more effective and systematic. This technology supports the implementation of a smart contract, which acts as a medium for managing inheritance distribution to ensure no beneficiaries is left out and receives the rightful share. A smart contract is an agreement in digital form that uses a certain protocol and only applies to the relevant parties. This study applied the qualitative approach and a descriptive research design. Data collected through document analysis and interview methods. Data from the document analysis method involved primary and secondary sources, while the semi-structured interview method was used for field studies. Findings showed that the blockchain technology is an appropriate solution for solving unclaimed inheritance problems. However, a blockchain based smart contract requires the cooperation between the party authorised to distribute inheritance property and the banks as well as other government agencies in order to ensure that the inheritance distribution process is carried out smoothly. This study benefits the authorities in charge of inheritance management as well as act as a guide for future researchers. This study offers a theoretical solution for solving the distribution of unclaimed inheritance by using blockchain based smart contract.
3
SHEKHAR, SHASHI, and C. V. RAMAMOORTHY. "COOP: A SELF-ASSESSMENT BASED APPROACH TO COOPERATING EXPERT SYSTEMS." International Journal on Artificial Intelligence Tools 01, no. 02 (June 1992): 175–204. http://dx.doi.org/10.1142/s0218213092000181.
Full textAbstract:
Conventional Expert System Shells do not help in developing AI programs for large applications like automated factories, which require multi-disciplinary knowledge and which are geographically distributed. To support these applications, a shell must provide tools for a knowledge-based system to (i) reason about the need for cooperation, (ii) understand global knowledge to locate relevant expert systems and (iii) select appropriate cooperation plans. Contemporary approaches like Blackboard [1], Contract-net [2] and Distributed problem solving [3] help in exploring alternative cooperation plans without any reasoning about the need for cooperation and understanding of global knowledge. Coop [4] support cooperation models to characterize three essential decisions in the cooperation process. It provides a computational method to decide if an expert system needs to consult with other expert systems. We provide techniques select appropriate cooperation plans.
4
Nanayakkara, Samudaya, Srinath Perera, Sepani Senaratne, Geeganage Thilini Weerasuriya, and Herath Mudiyanselage Nelanga Dilum Bandara. "Blockchain and Smart Contracts: A Solution for Payment Issues in Construction Supply Chains." Informatics 8, no. 2 (May 27, 2021): 36. http://dx.doi.org/10.3390/informatics8020036.
Full textAbstract:
The construction industry has dynamic supply chains with multiple suppliers usually engaged in short-term relationships. Government legislation, novel types of payment agreements, conventional information technology solutions, and supply chain management best practices have endeavoured to solve payment-related financial issues in the construction industry, which are mainly caused by the complexities of the construction supply chain. Nevertheless, payment-related issues persist as one of the key challenges in the industry. Applications of blockchain technology–a trusted, distributed data storing mechanism–along with smart contracts are gaining focus as solutions for complex interorganisational processes. A smart contract is a self-executing script that codifies a set of rules or agreements between multiple parties and runs across the blockchain network. This paper identifies the suitability of blockchain and smart contract technologies in solving payment issues in the construction industry. An expert forum of construction industry stakeholders served as the primary data collection method through a structured questionnaire. The key finding of the paper is that blockchain and smart contract powered solutions can significantly mitigate the payment and related financial issues in the construction industry, including partial payments, nonpayments, cost of finance, long payment cycle, retention, and security of payments.
5
Hongmei, Zhao. "A Cross-Border E-Commerce Approach Based on Blockchain Technology." Mobile Information Systems 2021 (July 15, 2021): 1–10. http://dx.doi.org/10.1155/2021/2006082.
Full textAbstract:
In the current cross-border electronic commerce (e-commerce) system, various document recording and authorization processes are cumbersome, record sharing efficiency is low, and identity verification is difficult. A method of asymmetric encryption technology combining Blockchain technology and cryptography is proposed. The advantages of asymmetric encrypted communications include high security and ease of multiparties communication collaboration, being applied to a peer-to-peer network formed by Blockchain technology, and making cross-border e-commerce record cross-domain sharing traceable, data immutable, and identity verification simplified. First of all, based on the immutable modification of Blockchain technology and asymmetric encryption technology, file synchronization contracts and authorization contracts are designed. Its distributed storage advantages ensure the privacy of users’ cross-border e-commerce information. Second, the design of the cross-domain acquisition contract can effectively verify the identity and transmission efficiency of both parties to the data sharing, so that illegal users can be safely filtered without a third-party notary institution. The simulation experiment results show that the solution proposed in this paper has obvious advantages in data antitheft, multiparty authentication, and saving system overhead compared with traditional cloud computing methods to solve the problem of sharing medical records. It provides a reference for solving the security problems in the process of data sharing by using the advantages of Blockchain’s decentralization and auditability and provides reference ideas for solving the problems of data sharing and cross-domain authentication.
6
Rauzana, Anita, Muhammad Hafidz Akbar, and Wira Dharma. "The influence of project manager competencies on the success of construction projects: A case of Indonesia." Problems and Perspectives in Management 20, no. 4 (October 18, 2022): 67–75. http://dx.doi.org/10.21511/ppm.20(4).2022.06.
Full textAbstract:
Competent project managers are expected to be able to achieve project success in terms of time, quality, and costs specified in the contract. This study aims to determine the competence of project managers that has the most significant influence on the success of a construction project. The data used were questionnaires distributed to 43 respondents employed at contractor companies located in Aceh Province, Indonesia. The samples were selected using Stovin’s formula; data were analyzed using descriptive statistical methods. The results of the study showed that of ten project managers’ competence factors, the top five rankings were obtained by knowledge factor (X1) with a mean value of 4.773, problem-solving (X8) with a mean value of 4.659, technical skills (X5) with a mean value of 4.587, general skills factor (X2) with a mean value of 4.531, and attitude and behavior factor (X3) with a mean value of 4.521. The findings show that the knowledge factor was dominant among all project manager competencies necessary to implement construction projects in Aceh Province. This shows that the knowledge possessed by a project manager significantly affects the successful implementation of such projects.
7
Guan, Yurong, Muhammad Aamir, Zaheer Ahmed Dayo, Ziaur Rahman, Waheed Ahmed Abro, Irfan Ali, and Zhihua Hu. "A Coordinated Optimization Model of the Complex System of the Green Supply Chain Distribution Network." Discrete Dynamics in Nature and Society 2021 (August 12, 2021): 1–12. http://dx.doi.org/10.1155/2021/4077151.
Full textAbstract:
A well-established distribution network is fundamental to the sound management of the green supply chain. To adapt to the market demand and policies for green products, it is urgent to build an efficient and rational logistic distribution network for the green supply chain. Many researchers have tried to design distribution networks through the coordinated optimization of the green supply chain, in the light of realistic situation. However, there are very few optimization models that consider all kinds of influencing factors. To solve the problem, this paper attempts to establish a coordinated optimization model of the complex system of the green supply chain distribution network (GSCDN). Firstly, the authors plotted the structure and game logic of the GSCDN and defined the upper limit of sales induced by the limited production capacity of producers. Secondly, the coordinated optimization conditions were configured for the distributor layer, producer layer, and market demand layer, and a coordinated optimization model was set up for the complex system. Finally, the contractual coordinated optimization mechanism was detailed for the complex system under the profit-sharing contract. The proposed model and solving algorithm were proved valid through experiments.
8
Gatitu, J. N., C. K. Kabubo, and P. Ajwang. "Approaches on Mitigating Variation Orders in Road Construction Industry in Kenya: The Case of Kenya National Highways Authority (KeNHA)." Engineering, Technology & Applied Science Research 10, no. 5 (October 26, 2020): 6195–99. http://dx.doi.org/10.48084/etasr.3737.
Full textAbstract:
Variation orders have been globally identified as a significant reason for poor performance of construction projects. Several variation orders have been identified in the Kenyan construction industry, however, there is a paucity of information on the approaches to minimize their occurrence. The aim of this study is to identify the practices for variation order mitigation in the public road construction sector in Kenya. This is a cross-sectional study that was carried out among the stakeholders (clients, consultants, and contractors) involved in road construction projects. The study used the purposive sampling technique whereby the data were collected with the use of distributed questionnaires among clients, consultants, and contractors’ staff with a technical background in civil engineering. The Relative Importance Index (RII) was used for data analysis. According to the findings of the study, the top five recommended approaches for minimizing variation orders include the provision of adequate planning before the initiation of road construction projects, understanding of the contract provisions by all the parties before project implementation, solving of land disputes before the project tender awards, provision of complete project designs, and provision of a brief project scope during the tendering process. This research, therefore, contributes to a pool of knowledge that will enable practitioners and researchers in the construction industry to develop effective models for minimizing variation orders.
9
Завгородній, В. А. "Theoretical Tools for Studying the Phenomenon of the Influence of the European Court of Human Rights Practice on Legal Activities in Ukraine." Науково-теоретичний журнал «Вісник Луганського державного університету внутрішніх справ імені Е.О. Дідоренка» 1, no. 85 (March 28, 2019): 20–30. http://dx.doi.org/10.33766/2524-0323.85.20-30.
Full textAbstract:
In this article, the existing approaches to general theoretical jurisprudence have been studied to understand the concept of «methodology» and its structure, on the basis of which the methodology of the European Court of Human Rights practice research and its influence on legal activity in Ukraine is determined. In the opinion of the owner, the most suitable for solving our research tasks is an approach in which the methodology of legal knowledge includes methodological tools and other designs, logically distributed by the conceptual and instrumental levels.As a result, the study found that the theoretical toolkit for the study of the phenomenon of influencing the practice of the European Court of Human Rights on legal activity in Ukraine are: a) universal epistemological principles (comprehensiveness, completeness, historicism, objectivity), which are the imperative requirements that guided the researcher; b) human-centered and sociological methodological paradigms that are interconnected, do not contradict and complement each other, as well as the provisions of the theories of legal influence, legal regulation, legal practice, law-making, legal interpretation, enforcement, legal relations, which became the basis for the formulation of research problems; c) anthropological, complex, dialectical, synergetic, axiological approaches, by which the strategy of scientific intelligence is determined, its specific perspective, selection of investigated facts and interpretation of research results are carried out; d) general scientific and special methods of cognition that ensure the receipt of true scientifically sound knowledge about the subject of research.
10
"Modeling And Optimization Of The Construction Organization's Production Program." Promyshlennoe i Grazhdanskoe Stroitel'stvo, no. 6 (June 2020): 49–56. http://dx.doi.org/10.33622/0869-7019.2020.06.49-56.
Full textAbstract:
In the article, the author considers the problems of complex algorithmization and systematization of approaches to optimizing the work plans of construction organizations (calendar plans) using various modern tools, including, for example, evolutionary algorithms for "conscious" enumeration of options for solving a target function from an array of possible constraints for a given nomenclature. Various typical schemes for modeling the processes of distribution of labor resources between objects of the production program are given, taking into account the array of source data. This data includes the possibility of using the material and technical supply base (delivery, storage, packaging) as a temporary container for placing the labor resource in case of released capacity, quantitative and qualification composition of the initial labor resource, the properties of the construction organization as a counterparty in the contract system with the customer of construction and installation works etc. A conceptual algorithm is formed that is the basis of the software package for operational harmonization of the production program ( work plans) in accordance with the loading of production units, the released capacities of labor resources and other conditions stipulated by the model. The application of the proposed algorithm is most convenient for a set of objects, which determines the relevance of its implementation in optimization models when planning production programs of building organizations that contain several objects distributed over a time scale.
Dissertations / Theses on the topic "Distributed contraint solving"
1
Fu, Ser-Geon. "Genetic and evolionary protocols for solving distributed asymmetric contraint satisfaction problems." Auburn, Ala., 2007. http://repo.lib.auburn.edu/07M%20Dissertations/FU_SER-GEON_10.pdf.
Full text
2
Zhou, Lingzhong, and n/a. "Agent Ordering and Nogood Repairs in Distributed Constraint Solving." Griffith University. School of Information and Communication Technology, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070713.162515.
Full textAbstract:
The distributed constraint satisfaction problem is a general formalization used to represent problems in distributed multi-agent systems. A large body of problems in artificial intelligence and computer science can be easily formulated as distributed constraint satisfaction problems. In this thesis we study agent ordering, effects of no-goods, search efficiency and threshold repairing in distributed constraint satisfaction problems and its variants. A summary of contributions is as follows: 1. We present a new algorithm, Dynamic Agent Ordering. A distinctive feature of this algorithm is that it uses the degree of unsatisfiability as a guiding parameter to dynamically determine agent ordering during the search. We show through an empirical study that our algorithm performs better than the existing approaches. In our approach, the independence of agents is guaranteed and agents without neighbouring relationships can run concurrently and asynchronously. (Part of this work was published in the Australian Al Conference (80)). 2. We extend the Dynamic Agent Ordering algorithm by incorporating a novel technique called nogood repairing. This results in a dramatic reduction in the nogoods being stored, and communication costs. In an empirical study, we11 show that this approach outperforms an equivalent static ordering algorithm and a current state-of-the-art technique in terms of execution time, memory usage and communication cost. (Part of this work was published at FLAIRS Conference (81)). Further, we introduce a new algorithm, Over-constrained Dynamic Agent Ordering, that breaks new ground in handling multiple variables per agent in distributed over-constrained satisfaction problems. The algorithm also uses the degree of unsatisfiability as a measure for relaxing constraints, and hence as a way to guide the search toward the best optimal solution(s). By applying our Threshold Repair method, we can solve a distributed constraint satisfaction problem without knowing whether the problem is under- or over-constrained. In an experimental study, we show that the new algorithm compares favourably to an implementation of asynchronous weak commitment search adapted to handle over-constrained problems. (Part of this work was published at the Canadian AI conference (79)).
3
Zhou, Lingzhong. "Agent Ordering and Nogood Repairs in Distributed Constraint Solving." Thesis, Griffith University, 2006. http://hdl.handle.net/10072/365303.
Full textAbstract:
The distributed constraint satisfaction problem is a general formalization used to represent problems in distributed multi-agent systems. A large body of problems in artificial intelligence and computer science can be easily formulated as distributed constraint satisfaction problems. In this thesis we study agent ordering, effects of no-goods, search efficiency and threshold repairing in distributed constraint satisfaction problems and its variants. A summary of contributions is as follows: 1. We present a new algorithm, Dynamic Agent Ordering. A distinctive feature of this algorithm is that it uses the degree of unsatisfiability as a guiding parameter to dynamically determine agent ordering during the search. We show through an empirical study that our algorithm performs better than the existing approaches. In our approach, the independence of agents is guaranteed and agents without neighbouring relationships can run concurrently and asynchronously. (Part of this work was published in the Australian Al Conference (80)). 2. We extend the Dynamic Agent Ordering algorithm by incorporating a novel technique called nogood repairing. This results in a dramatic reduction in the nogoods being stored, and communication costs. In an empirical study, we11 show that this approach outperforms an equivalent static ordering algorithm and a current state-of-the-art technique in terms of execution time, memory usage and communication cost. (Part of this work was published at FLAIRS Conference (81)). Further, we introduce a new algorithm, Over-constrained Dynamic Agent Ordering, that breaks new ground in handling multiple variables per agent in distributed over-constrained satisfaction problems. The algorithm also uses the degree of unsatisfiability as a measure for relaxing constraints, and hence as a way to guide the search toward the best optimal solution(s). By applying our Threshold Repair method, we can solve a distributed constraint satisfaction problem without knowing whether the problem is under- or over-constrained. In an experimental study, we show that the new algorithm compares favourably to an implementation of asynchronous weak commitment search adapted to handle over-constrained problems. (Part of this work was published at the Canadian AI conference (79)).Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Full Text
4
Hoessen, Benoît. "Solving the Boolean satisfiability problem using the parallel paradigm." Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0406/document.
Full textAbstract:
Cette thèse présente différentes techniques permettant de résoudre le problème de satisfaction de formule booléenes utilisant le parallélisme et du calcul distribué. Dans le but de fournir une explication la plus complète possible, une présentation détaillée de l'algorithme CDCL est effectuée, suivi d'un état de l'art. De ce point de départ, deux pistes sont explorées. La première est une amélioration d'un algorithme de type portfolio, permettant d'échanger plus d'informations sans perte d'efficacité. La seconde est une bibliothèque de fonctions avec son interface de programmation permettant de créer facilement des solveurs SAT distribuésThis thesis presents different technique to solve the Boolean satisfiability problem using parallel and distributed architectures. In order to provide a complete explanation, a careful presentation of the CDCL algorithm is made, followed by the state of the art in this domain. Once presented, two propositions are made. The first one is an improvement on a portfolio algorithm, allowing to exchange more data without loosing efficiency. The second is a complete library with its API allowing to easily create distributed SAT solver
5
Benharrat, Nassim. "Model-Based Testing of Timed Distributed Systems : A Constraint-Based Approach for Solving the Oracle Problem." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC021/document.
Full textAbstract:
Le test à base de modèles des systèmes réactifs est le processus de vérifier si un système sous test (SUT) est conforme à sa spécification. Il consiste à gérer à la fois la génération des données de test et le calcul de verdicts en utilisant des modèles. Nous spécifions le comportement des systèmes réactifs à l'aide des systèmes de transitions symboliques temporisées à entrée-sortie (TIOSTS). Quand les TIOSTSs sont utilisés pour tester des systèmes avec une interface centralisée, l'utilisateur peut ordonner complètement les événements (i.e., les entrées envoyées au système et les sorties produites). Les interactions entre le testeur et le SUT consistent en des séquences d'entrées et de sortie nommées traces, pouvant être séparées par des durées dans le cadre du test temporisé, pour former ce que l'on appelle des traces temporisées. Les systèmes distribués sont des collections de composants locaux communiquant entre eux et interagissant avec leur environnement via des interfaces physiquement distribuées. Différents événements survenant à ces différentes interfaces ne peuvent plus être ordonnés. Cette thèse concerne le test de conformité des systèmes distribués où un testeur est placé à chaque interface localisée et peut observer ce qui se passe à cette interface. Nous supposons qu'il n'y a pas d’horloge commune mais seulement des horloges locales pour chaque interface. La sémantique de tels systèmes est définie comme des tuples de traces temporisées. Nous considérons une approche du test dans le contexte de la relation de conformité distribuée dtioco. La conformité globale peut être testée dans une architecture de test en utilisant des testeurs locaux sans communication entre eux. Nous proposons un algorithme pour vérifier la communication pour un tuple de traces temporisées en formulant le problème de message-passing en un problème de satisfaction de contraintes (CSP). Nous avons mis en œuvre le calcul des verdicts de test en orchestrant à la fois les algorithmes du test centralisé off-line de chacun des composants et la vérification des communications par le biais d'un solveur de contraintes. Nous avons validé notre approche sur un cas étude de taille significativeModel-based testing of reactive systems is the process of checking if a System Under Test (SUT) conforms to its model. It consists of handling both test data generation and verdict computation by using models. We specify the behaviour of reactive systems using Timed Input Output Symbolic Transition Systems (TIOSTS) that are timed automata enriched with symbolic mechanisms to handle data. When TIOSTSs are used to test systems with a centralized interface, the user may completely order events occurring at this interface (i.e., inputs sent to the system and outputs produced from it). Interactions between the tester and the SUT are sequences of inputs and outputs named traces, separated by delays in the timed framework, to form so-called timed traces. Distributed systems are collections of communicating local components which interact with their environment at physically distributed interfaces. Interacting with such a distributed system requires exchanging values with it by means of several interfaces in the same testing process. Different events occurring at different interfaces cannot be ordered any more. This thesis focuses on conformance testing for distributed systems where a separate tester is placed at each localized interface and may only observe what happens at this interface. We assume that there is no global clock but only local clocks for each localized interface. The semantics of such systems can be seen as tuples of timed traces. We consider a framework for distributed testing from TIOSTS along with corresponding test hypotheses and a distributed conformance relation called dtioco. Global conformance can be tested in a distributed testing architecture using only local testers without any communication between them. We propose an algorithm to check communication policy for a tuple of timed traces by formulating the verification of message passing in terms of Constraint Satisfaction Problem (CSP). Hence, we were able to implement the computation of test verdicts by orchestrating both localised off-line testing algorithms and the verification of constraints defined by message passing that can be supported by a constraint solver. Lastly, we validated our approach on a real case study of a telecommunications distributed system
Book chapters on the topic "Distributed contraint solving"
1
Cammarata, Stephanie, David McArthur, and Randall Steeb. "STRATEGIES OF COOPERATION IN DISTRIBUTED PROBLEM SOLVING††The work reported here was supported by Contract MDA903-82-C-0061 from the Information Processing Technology Office of the Defense Advanced Projects Agency (DOD)." In Readings in Distributed Artificial Intelligence, 102–5. Elsevier, 1988. http://dx.doi.org/10.1016/b978-0-934613-63-7.50012-7.
Full textConference papers on the topic "Distributed contraint solving"
1
Alexandridis, Paschalis, Dengpan Dong, Dmitry Bedrov, Marina Tsianou, and Samhitha Kancharla. "Surfactant micelle structure and composition." In 2022 AOCS Annual Meeting & Expo. American Oil Chemists' Society (AOCS), 2022. http://dx.doi.org/10.21748/hwzn7583.
Full textAbstract:
Surfactants are mixed with various ingredients during their formulation into products and during their use. The interactions of surfactants with compounds such as electrolytes, polar organic solvents and solutes, other surfactants, polymers, and, of course, the solvent water, are manifested in the formation and structure of micelles. In turns, self-assembly in solution and on surfaces underlies the macroscopic performance of surfactant formulations. Accordingly, it is important to have information available on the structure and composition of micelles at various conditions. To this end, we utilize complementary experiments (small-angle neutron scattering, SANS, with contrast variation) and modeling (molecular dynamics, MD), and present here examples on how the structure of micelles formed in water by anionic surfactants (sodium dodecylsulfate, SDS, perfluorooctanoate, PFOA) responds to the presence of additives (salt [10.1016/j.colsurfa.2021.127313], urea [10.1021/acs.langmuir.1c00433], ethanol [10.1039/d1cp00049g], poly(ethylene oxide) (PEO) [10.1021/jp5023168], PEO-based amphiphilic polymers [10.1016/j.jcis.2021.10.176]) across a wide range of compositions. A detailed description emerges on how the additives distribute at the outer surface of the micelles and in their interior, which is used to rationalize various properties of the mixtures.
2
Panchal, Jitesh H., Marco Gero Ferna´ndez, Janet K. Allen, Christiaan J. J. Paredis, and Farrokh Mistree. "An Interval-Based Focalization Method for Decision-Making in Decentralized, Multi-Functional Design." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-85322.
Full textAbstract:
Multi-functional design problems are characterized by strong coupling between design variables that are controlled by stakeholders from different disciplines. This coupling necessitates efficient modeling of interactions between multiple designers who want to achieve conflicting objectives but share control over design variables. Various game-theoretic protocols such as cooperative, non-cooperative, and leader/follower have been used to model interactions between designers. Non-cooperative game theory protocols are of particular interest for modeling cooperation in multi-functional design problems. These are the focus of this paper because they more closely reflect the level of information exchange possible in a distributed environment. Two strategies for solving such non-cooperative game theory problems are: a) passing Rational Reaction Sets (RRS) among designers and combining these to find points of intersection and b) exchanging single points in the design space iteratively until the solution converges to a single point. While the first strategy is computationally expensive because it requires each designer to consider all possible outcomes of decisions made by other designers, the second strategy may result in divergence of the solution. In order to overcome these problems, we present an interval-based focalization method for executing decentralized decision-making problems that are common in multi-functional design scenarios. The method involves propagating ranges of design variables and systematically eliminating infeasible portions of the shared design space. This stands in marked contrast to the successive consideration of single points, as emphasized in current multifunctional design methods. The key advantages of the proposed method are: a) targeted reduction of design freedom and b) non-divergence of solutions. The method is illustrated using two sample scenarios — solution of a decision problem with quadratic objectives and the design of multi-functional Linear Cellular Alloys (LCAs). Implications include use of the method to guide design space partitioning and control assignment.