Journal articles: 'Combinatorial exploration'

1

Levin, M. Sh. "Combinatorial planning framework for geological exploration." Information Processes 21, no. 1 (2021): 65–81. http://dx.doi.org/10.53921/18195822_2021_21_1_65.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Urata, Saori, Masaaki Kitawaki, and Ryoji Funahashi. "Exploration of Thermoelectric Oxides by Combinatorial Chemistry." Journal of the Japan Society of Powder and Powder Metallurgy 50, no. 6 (2003): 490–94. http://dx.doi.org/10.2497/jjspm.50.490.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Takahashi, Ryota, and Kazuhiro Kawashima. "Combinatorial High-throughput Exploration of Functional Materials." Materia Japan 60, no. 10 (October 1, 2021): 620–27. http://dx.doi.org/10.2320/materia.60.620.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ben-David, Noa, and Sivan Sabato. "A Fast Algorithm for PAC Combinatorial Pure Exploration." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 6 (June 28, 2022): 6064–71. http://dx.doi.org/10.1609/aaai.v36i6.20553.

Full text

Abstract:

We consider the problem of Combinatorial Pure Exploration (CPE), which deals with finding a combinatorial set of arms with a high reward, when the rewards of individual arms are unknown in advance and must be estimated using arm pulls. Previous algorithms for this problem, while obtaining sample complexity reductions in many cases, are highly computationally intensive, thus making them impractical even for mildly large problems. In this work, we propose a new CPE algorithm in the PAC setting, which is computationally light weight, and so can easily be applied to problems with tens of thousands of arms. This is achieved since the proposed algorithm requires a very small number of combinatorial oracle calls. The algorithm is based on successive acceptance of arms, along with elimination which is based on the combinatorial structure of the problem. We provide sample complexity guarantees for our algorithm, and demonstrate in experiments its usefulness on large problems, whereas previous algorithms are impractical to run on problems of even a few dozen arms. The code is provided at https://github.com/noabdavid/csale. The full version of this paper is available at https://arxiv.org/abs/2112.04197.

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Qun Jiao, and Min Xu. "Combinatorial Synthesis and Evaluation on Thermoelectric Films." Materials Science Forum 687 (June 2011): 591–95. http://dx.doi.org/10.4028/www.scientific.net/msf.687.591.

Full text

Abstract:

Combinatorial technology is a powerful tool for new material exploration. Some new combinatorial technologies, such as combinatorial laser molecular beam epitaxy (CLMBE) and combinatorial pulsed laser deposition (CPLD), were introduced in the paper. La1-xCexVO3 (0≤x≤1) composition-spread films were fabricated successfully by CPLD, while their thermoelectric properties and structures were evaluated by the multi-channel thermoelectric measurement system and concurrent X-ray analysis respectively. Combinatorial technologies are proving to be an efficient, low-cost tool in synthesis and characterization of thermoelectric composition-spread films.

APA, Harvard, Vancouver, ISO, and other styles

6

Orner, Brendan P., Ratmir Derda, Rachel L. Lewis, James A. Thomson, and Laura L. Kiessling. "Arrays for the Combinatorial Exploration of Cell Adhesion." Journal of the American Chemical Society 126, no. 35 (September 2004): 10808–9. http://dx.doi.org/10.1021/ja0474291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Liu, Jingbei, Yanhui Liu, Pan Gong, Yanglin Li, Kimberly M. Moore, Ellen Scanley, Fred Walker, Christine C. Broadbridge, and Jan Schroers. "Combinatorial exploration of color in gold-based alloys." Gold Bulletin 48, no. 3-4 (August 28, 2015): 111–18. http://dx.doi.org/10.1007/s13404-015-0167-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

ROWELL, MICHAEL. "A NEW EXPLORATION OF THE LEBESGUE IDENTITY." International Journal of Number Theory 06, no. 04 (June 2010): 785–98. http://dx.doi.org/10.1142/s1793042110003204.

Full text

Abstract:

We introduce a new combinatorial proof of the Lebesgue identity which allows us to find a new finite form of the identity. Using this new finite form we are able to make new observations about special cases of the Lebesgue identity, namely the "little" Göllnitz theorems and Sylvester's identity.

APA, Harvard, Vancouver, ISO, and other styles

9

Brütting, Jan, Patrick Ole Ohlbrock, Julian Hofer, and Pierluigi D’Acunto. "Stock-constrained truss design exploration through combinatorial equilibrium modeling." International Journal of Space Structures 36, no. 4 (December 2021): 253–69. http://dx.doi.org/10.1177/09560599211064100.

Full text

Abstract:

Reusing structural components has potential to reduce environmental impacts of building structures because it reduces new material use, energy consumption, and waste. When designing structures through reuse, available element characteristics become a design input. This paper presents a new computational workflow to design structures made of reused and new elements. The workflow combines Combinatorial Equilibrium Modeling, efficient Best-Fit heuristics, and Life Cycle Assessment to explore different design options in a user-interactive way and with almost real-time feedback. The method applicability is demonstrated by a realistic case study. Results show that structures combining reused and new elements have a significantly lower environmental impact than solutions made of new material only.

APA, Harvard, Vancouver, ISO, and other styles

10

Du, Yihan, Yuko Kuroki, and Wei Chen. "Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 8 (May 18, 2021): 7262–70. http://dx.doi.org/10.1609/aaai.v35i8.16892.

Full text

Abstract:

In this paper, we first study the problem of combinatorial pure exploration with full-bandit feedback (CPE-BL), where a learner is given a combinatorial action space X \subseteq {0,1}^d, and in each round the learner pulls an action x \in X and receives a random reward with expectation x^T \theta, with \theta \in \R^d a latent and unknown environment vector. The objective is to identify the optimal action with the highest expected reward, using as few samples as possible. For CPE-BL, we design the first polynomial-time adaptive algorithm, whose sample complexity matches the lower bound (within a logarithmic factor) for a family of instances and has a light dependence of \Delta_min (the smallest gap between the optimal action and sub-optimal actions). Furthermore, we propose a novel generalization of CPE-BL with flexible feedback structures, called combinatorial pure exploration with partial linear feedback (CPE-PL), which encompasses several families of sub-problems including full-bandit feedback, semi-bandit feedback, partial feedback and nonlinear reward functions. In CPE-PL, each pull of action x reports a random feedback vector with expectation of M_x \theta , where M_x \in R^{m_x \times d} is a transformation matrix for x, and gains a random (possibly nonlinear) reward related to x. For CPE-PL, we develop the first polynomial-time algorithm, which simultaneously addresses limited feedback, general reward function and combinatorial action space (e.g., matroids, matchings and s-t paths), and provide its sample complexity analysis. Our empirical evaluation demonstrates that our algorithms run orders of magnitude faster than the existing ones, and our CPE-BL algorithm is robust across different \Delta_min settings while our CPE-PL algorithm is the first one returning correct answers for nonlinear reward functions.

APA, Harvard, Vancouver, ISO, and other styles

11

Yao, Yonggang, Zhennan Huang, Tangyuan Li, Hang Wang, Yifan Liu, Helge S. Stein, Yimin Mao, et al. "High-throughput, combinatorial synthesis of multimetallic nanoclusters." Proceedings of the National Academy of Sciences 117, no. 12 (March 10, 2020): 6316–22. http://dx.doi.org/10.1073/pnas.1903721117.

Full text

Abstract:

Multimetallic nanoclusters (MMNCs) offer unique and tailorable surface chemistries that hold great potential for numerous catalytic applications. The efficient exploration of this vast chemical space necessitates an accelerated discovery pipeline that supersedes traditional “trial-and-error” experimentation while guaranteeing uniform microstructures despite compositional complexity. Herein, we report the high-throughput synthesis of an extensive series of ultrafine and homogeneous alloy MMNCs, achieved by 1) a flexible compositional design by formulation in the precursor solution phase and 2) the ultrafast synthesis of alloy MMNCs using thermal shock heating (i.e., ∼1,650 K, ∼500 ms). This approach is remarkably facile and easily accessible compared to conventional vapor-phase deposition, and the particle size and structural uniformity enable comparative studies across compositionally different MMNCs. Rapid electrochemical screening is demonstrated by using a scanning droplet cell, enabling us to discover two promising electrocatalysts, which we subsequently validated using a rotating disk setup. This demonstrated high-throughput material discovery pipeline presents a paradigm for facile and accelerated exploration of MMNCs for a broad range of applications.

APA, Harvard, Vancouver, ISO, and other styles

12

Mukherjee, Arijit, and Gautam R. Desiraju. "Combinatorial Exploration of the Structural Landscape of Acid–Pyridine Cocrystals." Crystal Growth & Design 14, no. 3 (February 16, 2014): 1375–85. http://dx.doi.org/10.1021/cg401851z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Koinuma, Hideomi, Kenji Itaka, Yuji Matsumoto, Yasuhiko Yoshida, Shunichi Aikawa, and Kazuhiko Takeuchi. "Vacuum and Pressured Combinatorial Processings for Exploration of Environmental Catalysts." Topics in Catalysis 53, no. 1-2 (January 5, 2010): 35–39. http://dx.doi.org/10.1007/s11244-009-9436-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Fujimoto, K., S. Ito, S. Suehara, S. Inoue, and M. Watanabe. "Effective algorithm for material exploration in ceramics with combinatorial technology." Journal of the European Ceramic Society 26, no. 4-5 (January 2006): 731–34. http://dx.doi.org/10.1016/j.jeurceramsoc.2005.07.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Bean, Christian, Émile Nadeau, Jay Pantone, and Henning Ulfarsson. "Using large random permutations to partition permutation classes." Pure Mathematics and Applications 30, no. 1 (June 1, 2022): 31–36. http://dx.doi.org/10.2478/puma-2022-0006.

Full text

Abstract:

Abstract Permutation classes are sets of permutations defined by the absence of certain substructures. In some cases permutation classes can be decomposed as unions of subclasses. We use combinatorial specifications automatically discovered by Combinatorial Exploration: An algorithmic framework for enumeration, Albert et al. 2022, to uniformly generate large random permutations in a permutation class, and apply clustering methods to partition them into interesting subclasses. We seek to automate as much of this process as possible.

APA, Harvard, Vancouver, ISO, and other styles

16

Li, Y. J., A. Savan, A. Kostka, H. S. Stein, and A. Ludwig. "Accelerated atomic-scale exploration of phase evolution in compositionally complex materials." Materials Horizons 5, no. 1 (2018): 86–92. http://dx.doi.org/10.1039/c7mh00486a.

Full text

Abstract:

Combining nanoscale-tip arrays with combinatorial thin film deposition and processing as well as direct atomic-scale characterization (APT and TEM) enables accelerated exploration of the temperature- and environment-dependent phase evolution in multinary materials systems.

APA, Harvard, Vancouver, ISO, and other styles

17

Wolff-Goodrich, Silas, Amalraj Marshal, K. G. Pradeep, Gerhard Dehm, Jochen M. Schneider, and Christian H. Liebscher. "Combinatorial exploration of B2/L21 precipitation strengthened AlCrFeNiTi compositionally complex alloys." Journal of Alloys and Compounds 853 (February 2021): 156111. http://dx.doi.org/10.1016/j.jallcom.2020.156111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kawasaki, Masashi. "Exploration of Electronic Functionalities in Metal Oxides by Combinatorial Lattice Engineering." Bulletin of the Chemical Society of Japan 86, no. 12 (December 15, 2013): 1341–58. http://dx.doi.org/10.1246/bcsj.20130236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Takahashi, R., Y. Yonezawa, M. Ohtani, M. Kawasaki, Y. Matsumoto, and H. Koinuma. "Combinatorial exploration of flux material for Bi4Ti3O12 single crystal film growth." Applied Surface Science 252, no. 7 (January 2006): 2477–81. http://dx.doi.org/10.1016/j.apsusc.2005.05.092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Modaresi, Sajad, Denis Sauré, and Juan Pablo Vielma. "Learning in Combinatorial Optimization: What and How to Explore." Operations Research 68, no. 5 (September 2020): 1585–604. http://dx.doi.org/10.1287/opre.2019.1926.

Full text

Abstract:

When moving from the traditional to combinatorial multiarmed bandit setting, addressing the classical exploration versus exploitation trade-off is a challenging task. In “Learning in Combinatorial Optimization: What and How to Explore,” Modaresi, Sauré, and Vielma show that the combinatorial setting has salient features that distinguish it from the traditional bandit. In particular, combinatorial structure induces correlation between cost of different solutions, thus raising the questions of what parameters to estimate and how to collect and combine information. The authors answer such questions by developing a novel optimization problem called the lower-bound problem (LBP). They establish a fundamental limit on asymptotic performance of any admissible policy and propose near-optimal LBP-based policies. Because LBP is likely intractable in practice, they propose policies that instead solve a proxy for LBP, which they call the optimality cover problem (OCP). They provide strong evidence of practical tractability of OCP and illustrate the markedly superior performance of OCP-based policies numerically.

APA, Harvard, Vancouver, ISO, and other styles

21

Youn, Hyejin, Deborah Strumsky, Luis M. A. Bettencourt, and José Lobo. "Invention as a combinatorial process: evidence from US patents." Journal of The Royal Society Interface 12, no. 106 (May 2015): 20150272. http://dx.doi.org/10.1098/rsif.2015.0272.

Full text

Abstract:

Invention has been commonly conceptualized as a search over a space of combinatorial possibilities. Despite the existence of a rich literature, spanning a variety of disciplines, elaborating on the recombinant nature of invention, we lack a formal and quantitative characterization of the combinatorial process underpinning inventive activity. Here, we use US patent records dating from 1790 to 2010 to formally characterize invention as a combinatorial process. To do this, we treat patented inventions as carriers of technologies and avail ourselves of the elaborate system of technology codes used by the United States Patent and Trademark Office to classify the technologies responsible for an invention's novelty. We find that the combinatorial inventive process exhibits an invariant rate of ‘exploitation’ (refinements of existing combinations of technologies) and ‘exploration’ (the development of new technological combinations). This combinatorial dynamic contrasts sharply with the creation of new technological capabilities—the building blocks to be combined—that has significantly slowed down. We also find that, notwithstanding the very reduced rate at which new technologies are introduced, the generation of novel technological combinations engenders a practically infinite space of technological configurations.

APA, Harvard, Vancouver, ISO, and other styles

22

Ahmad, Mukhtar, Ather Qayyum, Gulnaz Atta, Siti Suzlin Supadi, Muhammad Saleem, and Usman Ali. "A Study on Degree Based Topological Indices of Harary Subdivision Graphs With Application." International Journal of Analysis and Applications 22 (April 8, 2024): 63. http://dx.doi.org/10.28924/2291-8639-22-2024-63.

Full text

Abstract:

Combinatorial design theory and graph decompositions play a critical role in the exploration of combinatorial design theory and are essential in mathematical sciences. The process of graph decomposition involves partitioning the set of edges in a graph G. An n-sun graph, characterized by a cycle with an edge connecting each vertex to a terminating vertex of degree one, is introduced in this study. The concept of n-sun decomposition is applied to certain even-order graphs. The indices covered in this study include the general connectivity index of the harary graphs, Zagreb indices, symmetric division degree indices and randic indices.

APA, Harvard, Vancouver, ISO, and other styles

23

Nakamura, Shintaro, and Masashi Sugiyama. "Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 13 (March 24, 2024): 14414–21. http://dx.doi.org/10.1609/aaai.v38i13.29355.

Full text

Abstract:

We study the real-valued combinatorial pure exploration of the multi-armed bandit (R-CPE-MAB) problem. In R-CPE-MAB, a player is given stochastic arms, and the reward of each arm follows an unknown distribution. In each time step, a player pulls a single arm and observes its reward. The player's goal is to identify the optimal action from a finite-sized real-valued action set with as few arm pulls as possible. Previous methods in the R-CPE-MAB require enumerating all of the feasible actions of the combinatorial optimization problem one is considering. In general, since the size of the action set grows exponentially large with respect to the number of arms, this is almost practically impossible when the number of arms is large. We introduce an algorithm named the Generalized Thompson Sampling Explore (GenTS-Explore) algorithm, which is the first algorithm that can work even when the size of the action set is exponentially large with respect to the number of arms. We also introduce a novel problem-dependent sample complexity lower bound of the R-CPE-MAB problem, and show that the GenTS-Explore algorithm achieves the optimal sample complexity up to a problem-dependent constant factor.

APA, Harvard, Vancouver, ISO, and other styles

24

Chen, Yang. "Navigating the realm of noncommutative probability: Historical perspectives and future directionsstorical perspectives and future directions." Theoretical and Natural Science 14, no. 1 (November 30, 2023): 240–44. http://dx.doi.org/10.54254/2753-8818/14/20241042.

Full text

Abstract:

This review article provides a comprehensive overview of the fascinating field of noncommutative probability theory, tracing its evolution from its inception in the early 1980s by Romanian-American mathematician Dan Voiculescu to its current state of prominence in mathematics. Through a meticulous examination of seminal works and recent advancements, we explore the key concepts, methodologies, and significant developments in this field, emphasizing the combinatorial aspects of noncommutative probability spaces, including non-crossing partitions and linked partitions. This exploration encompasses various aspects, including analytical methods, operator algebras, random matrices, and combinatorial structures. Additionally, it concludes with the current understanding and potential directions for future research.

APA, Harvard, Vancouver, ISO, and other styles

25

Md Yusof, Zulkifli, Zuwairie Ibrahim, Asrul Adam, Kamil Zakwan Mohd Azmi, Tasiransurini Ab Rahman, Badaruddin Muhammad, Nor Azlina Ab Aziz, et al. "Distance Evaluated Simulated Kalman Filter with State Encoding for Combinatorial Optimization Problems." International Journal of Engineering & Technology 7, no. 4.27 (November 30, 2018): 22. http://dx.doi.org/10.14419/ijet.v7i4.27.22431.

Full text

Abstract:

Simulated Kalman Filter (SKF) is a population-based optimization algorithm which exploits the estimation capability of Kalman filter to search for a solution in a continuous search space. The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. Some problems, such as routing and scheduling, involve binary or discrete search space. At present, there are three modifications to the original SKF algorithm in solving combinatorial optimization problems. Those modified algorithms are binary SKF (BSKF), angle modulated SKF (AMSKF), and distance evaluated SKF (DESKF). These three combinatorial SKF algorithms use binary encoding to represent the solution to a combinatorial optimization problem. This paper introduces the latest version of distance evaluated SKF which uses state encoding, instead of binary encoding, to represent the solution to a combinatorial problem. The algorithm proposed in this paper is called state-encoded distance evaluated SKF (SEDESKF) algorithm. Since the original SKF algorithm tends to converge prematurely, the distance is handled differently in this study. To control and exploration and exploitation of the SEDESKF algorithm, the distance is normalized. The performance of the SEDESKF algorithm is compared against the existing combinatorial SKF algorithm based on a set of Traveling Salesman Problem (TSP).

APA, Harvard, Vancouver, ISO, and other styles

26

D’Amato, Alfonsina, Angelo Cereda, Angela Bachi, James C. Pierce, and Pier Giorgio Righetti. "In Depth Exploration of the Hemolymph ofLimulus polyphemusvia Combinatorial Peptide Ligand Libraries." Journal of Proteome Research 9, no. 6 (June 4, 2010): 3260–69. http://dx.doi.org/10.1021/pr1002033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

D’Amato, Alfonsina, Angela Bachi, Elisa Fasoli, Egisto Boschetti, Gabriel Peltre, Helène Sénéchal, and Pier Giorgio Righetti. "In-Depth Exploration of Cow’s Whey Proteome via Combinatorial Peptide Ligand Libraries." Journal of Proteome Research 8, no. 8 (August 7, 2009): 3925–36. http://dx.doi.org/10.1021/pr900221x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Yu, Ning, and Gregory A. Bakken. "Efficient Exploration of Large Combinatorial Chemistry Spaces by Monomer-Based Similarity Searching." Journal of Chemical Information and Modeling 49, no. 4 (March 24, 2009): 745–55. http://dx.doi.org/10.1021/ci800392z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Mossé, B., and É. Remy. "A Combinatorial Exploration of Boolean Dynamics Generated by Isolated and Chorded Circuits." Acta Biotheoretica 68, no. 1 (August 12, 2019): 87–117. http://dx.doi.org/10.1007/s10441-019-09355-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Lombard, John. "Honey from the Hives: A Theoretical and Computational Exploration of Combinatorial Hives." Experimental Mathematics 29, no. 4 (June 18, 2018): 361–82. http://dx.doi.org/10.1080/10586458.2018.1473822.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Fasoli, Elisa, Alfonsina D’Amato, Pier Giorgio Righetti, Rainer Barbieri, and Daniele Bellavia. "Exploration of the Sea Urchin Coelomic Fluid via Combinatorial Peptide Ligand Libraries." Biological Bulletin 222, no. 2 (April 2012): 93–104. http://dx.doi.org/10.1086/bblv222n2p93.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

许, 兰贵. "Exploration of the Construction of Huiyu Creative Combinatorial Model Electromechanical Integration Laboratory." Advances in Education 13, no. 08 (2023): 5871–74. http://dx.doi.org/10.12677/ae.2023.138915.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Newhouse, P. F., D. Guevarra, M. Umehara, D. A. Boyd, L. Zhou, J. K. Cooper, J. A. Haber, and J. M. Gregoire. "Multi-modal optimization of bismuth vanadate photoanodes via combinatorial alloying and hydrogen processing." Chemical Communications 55, no. 4 (2019): 489–92. http://dx.doi.org/10.1039/c8cc07156j.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Wang, Qun Jiao. "Combinatorial Synthesis and Evaluation of Vanadium Oxide Films." Advanced Engineering Forum 2-3 (December 2011): 1071–76. http://dx.doi.org/10.4028/www.scientific.net/aef.2-3.1071.

Full text

Abstract:

Combinatorial technology is a powerful tool for new material exploration. La1-xCaxVO3composition-spread films were fabricated by combinatorial pulsed laser deposition and their thermoelectric properties were evaluated paralelly by the multi-channel thermoelectric measurement system. Concurrent X-ray analysis verified the formation of solid soluted films in the full composition range (0≤x≤1) as judged from the linear variation of the lattice constants. Growth conditions of LaVO3films were optimized. Good crystallinity of LaVO3film was obtained at 800°C, and the power factor of 0.6 µW/cm K2was achieved. The effects of oxygen content and the substitutions of Ca and Ce ions on TE properties of were also analysed respectively. Large TE properties in vanadium oxide system can be expected with the change of vanadium ion valence from 3+ to 2+. In La1-xCexVO3(0≤x≤1) system, Ce ion takes 3+ although Ce4+is stable in theory.

APA, Harvard, Vancouver, ISO, and other styles

35

Kauffmann, Alexander, Michael Stüber, Harald Leiste, Sven Ulrich, Sabine Schlabach, Dorothée Vinga Szabó, Sascha Seils, et al. "Combinatorial exploration of the High Entropy Alloy System Co-Cr-Fe-Mn-Ni." Surface and Coatings Technology 325 (September 2017): 174–80. http://dx.doi.org/10.1016/j.surfcoat.2017.06.041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Chalupa, David, and Ken A. Hawick. "GraphCombEx: a software tool for exploration of combinatorial optimisation properties of large graphs." Soft Computing 23, no. 14 (May 12, 2018): 5715–24. http://dx.doi.org/10.1007/s00500-018-3230-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Fujimoto, K., H. Takahashi, S. Ito, S. Inoue, and M. Watanabe. "New high-throughput material–exploration system based on combinatorial chemistry and electrostatic atomization." Applied Surface Science 252, no. 7 (January 2006): 2446–49. http://dx.doi.org/10.1016/j.apsusc.2005.07.078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Qiao, Li, Mahmoud Efatmaneshnik, and Michael Ryan. "A Combinatorial Approach to Tradespace Exploration of Complex Systems: A CubeSat Case Study." INCOSE International Symposium 27, no. 1 (July 2017): 763–79. http://dx.doi.org/10.1002/j.2334-5837.2017.00392.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Kawasaki, Masashi. "ChemInform Abstract: Exploration of Electronic Functionalities in Metal Oxides by Combinatorial Lattice Engineering." ChemInform 45, no. 8 (February 7, 2014): no. http://dx.doi.org/10.1002/chin.201408233.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Park, Suwon, Yongwook Song, Jiyoon Yeo, Songyun Han, and Hyunjoo Choi. "Exploration of Aluminum Alloy using Multi-feeder 3D Additive Manufacturing-based Combinatorial Experiment." Journal of Korean Powder Metallurgy Institute 30, no. 3 (June 30, 2023): 255–61. http://dx.doi.org/10.4150/kpmi.2023.30.3.255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Liu, Qun, Zhen Wang, Le-Le Liu, Ping Li, and E.-Hu Liu. "Discovery of anti-inflammatory components from Guge Fengtong tablet based on inflammatory markers and exploration of its molecular mechanism." RSC Advances 6, no. 98 (2016): 96039–48. http://dx.doi.org/10.1039/c6ra17737a.

Full text

Abstract:

In this work, we discovered GGFTT and its bioactive combinatorial components (10C) could significantly decrease the production of TNF-α, IL-1β, IL-6. 10C exert comparable anti-inflammatory effect through NF-κB and MAPKs signaling pathways as GGFTT.

APA, Harvard, Vancouver, ISO, and other styles

42

Skamaki, Kalliopi, Stephane Emond, Matthieu Chodorge, John Andrews, D. Gareth Rees, Daniel Cannon, Bojana Popovic, Andrew Buchanan, Ralph R. Minter, and Florian Hollfelder. "In vitro evolution of antibody affinity via insertional scanning mutagenesis of an entire antibody variable region." Proceedings of the National Academy of Sciences 117, no. 44 (October 16, 2020): 27307–18. http://dx.doi.org/10.1073/pnas.2002954117.

Full text

Abstract:

We report a systematic combinatorial exploration of affinity enhancement of antibodies by insertions and deletions (InDels). Transposon-based introduction of InDels via the method TRIAD (transposition-based random insertion and deletion mutagenesis) was used to generate large libraries with random in-frame InDels across the entire single-chain variable fragment gene that were further recombined and screened by ribosome display. Knowledge of potential insertion points from TRIAD libraries formed the basis of exploration of length and sequence diversity of novel insertions by insertional-scanning mutagenesis (InScaM). An overall 256-fold affinity improvement of an anti–IL-13 antibody BAK1 as a result of InDel mutagenesis and combination with known point mutations validates this approach, and suggests that the results of this InDel mutagenesis and conventional exploration of point mutations can synergize to generate antibodies with higher affinity.

APA, Harvard, Vancouver, ISO, and other styles

43

Sagban, Rafid, Ku Ruhana Ku-Mahamud, and Muhamad Shahbani Abu Bakar. "ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization." Scientific World Journal 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/392345.

Full text

Abstract:

A statistical machine learning indicator,ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens’ acoustics of their ant hosts. The parasites’ reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance’s matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied. The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms. Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation. The analytical results showed that the proposed indicator is more informative and more robust.

APA, Harvard, Vancouver, ISO, and other styles

44

Petro, Miroslav, Son Hoai Nguyen, Mingjun Liu, and Oleg Kolosov. "Combinatorial Exploration of Polymeric Transport Agents for Targeted Delivery of Bioactives to Human Tissues." Macromolecular Rapid Communications 25, no. 1 (January 2004): 178–88. http://dx.doi.org/10.1002/marc.200300229.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Sánchez-Ansola, Eduardo, Ana C. Pérez-Pérez, Alejandro Rosete, Isis Torres-Pérez, Omar Rojas, and Guillermo Sosa-Gómez. "Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance." Computational Intelligence and Neuroscience 2022 (June 8, 2022): 1–9. http://dx.doi.org/10.1155/2022/4821927.

Full text

Abstract:

Combinatorial optimization problems allow for modeling multiple situations in which proper allocation of resources is needed. For some real-world problems, the use of fuzzy elements in the models allows for incorporating certain levels of uncertainty to better approximate such real-world situations. One way to solve combinatorial optimization problems with fuzzy elements is the parametric approach, where it is necessary to define how to explore different relaxation levels using alpha-cuts. Researchers tend to select such alpha-cuts uniformly. The current investigation proposes a novel strategy for selecting alpha-cuts in the School Bus Routing Problem with fuzzy students’ maximum walking distance. This proposal bases its foundations on the number of student-bus stop pairs available according to the different levels of relaxations allowed. Results demonstrate how the proposed strategy gives attractive solutions with more diverse trade-offs, contrasted with other methods in the literature. Furthermore, it decreases the computational cost for those instances where the maximum relaxation does not provide new pairs of students-bus stops.

APA, Harvard, Vancouver, ISO, and other styles

46

Zeng, Minxiang, Yipu Du, Qiang Jiang, Nicholas Kempf, Chen Wei, Miles V. Bimrose, A. N. M. Tanvir, et al. "High-throughput printing of combinatorial materials from aerosols." Nature 617, no. 7960 (May 10, 2023): 292–98. http://dx.doi.org/10.1038/s41586-023-05898-9.

Full text

Abstract:

AbstractThe development of new materials and their compositional and microstructural optimization are essential in regard to next-generation technologies such as clean energy and environmental sustainability. However, materials discovery and optimization have been a frustratingly slow process. The Edisonian trial-and-error process is time consuming and resource inefficient, particularly when contrasted with vast materials design spaces1. Whereas traditional combinatorial deposition methods can generate material libraries2,3, these suffer from limited material options and inability to leverage major breakthroughs in nanomaterial synthesis. Here we report a high-throughput combinatorial printing method capable of fabricating materials with compositional gradients at microscale spatial resolution. In situ mixing and printing in the aerosol phase allows instantaneous tuning of the mixing ratio of a broad range of materials on the fly, which is an important feature unobtainable in conventional multimaterials printing using feedstocks in liquid–liquid or solid–solid phases4–6. We demonstrate a variety of high-throughput printing strategies and applications in combinatorial doping, functional grading and chemical reaction, enabling materials exploration of doped chalcogenides and compositionally graded materials with gradient properties. The ability to combine the top-down design freedom of additive manufacturing with bottom-up control over local material compositions promises the development of compositionally complex materials inaccessible via conventional manufacturing approaches.

APA, Harvard, Vancouver, ISO, and other styles

47

Wortman-Jutt, Susan, and Dylan Edwards. "Poststroke Aphasia Rehabilitation: Why All Talk and No Action?" Neurorehabilitation and Neural Repair 33, no. 4 (March 22, 2019): 235–44. http://dx.doi.org/10.1177/1545968319834901.

Full text

Abstract:

There is ample agreement in the scientific literature, across diverse areas of study, that suggests that language and movement are interrelated. In particular, it is widely held that the upper limb and hand play a key role in language use. Aphasia, a common, disabling language disorder frequently associated with stroke, requires new restorative methods. A combinatorial hand-arm-language paradigm that capitalizes on shared neural networks may therefore prove beneficial for aphasia recovery in stroke patients and requires further exploration.

APA, Harvard, Vancouver, ISO, and other styles

48

Crawford, Broderick, Ricardo Soto, José Lemus-Romani, Marcelo Becerra-Rozas, José M. Lanza-Gutiérrez, Nuria Caballé, Mauricio Castillo, et al. "Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics." Mathematics 9, no. 16 (August 4, 2021): 1839. http://dx.doi.org/10.3390/math9161839.

Full text

Abstract:

One of the central issues that must be resolved for a metaheuristic optimization process to work well is the dilemma of the balance between exploration and exploitation. The metaheuristics (MH) that achieved this balance can be called balanced MH, where a Q-Learning (QL) integration framework was proposed for the selection of metaheuristic operators conducive to this balance, particularly the selection of binarization schemes when a continuous metaheuristic solves binary combinatorial problems. In this work the use of this framework is extended to other recent metaheuristics, demonstrating that the integration of QL in the selection of operators improves the exploration-exploitation balance. Specifically, the Whale Optimization Algorithm and the Sine-Cosine Algorithm are tested by solving the Set Covering Problem, showing statistical improvements in this balance and in the quality of the solutions.

APA, Harvard, Vancouver, ISO, and other styles

49

Norman, Thomas M., Max A. Horlbeck, Joseph M. Replogle, Alex Y. Ge, Albert Xu, Marco Jost, Luke A. Gilbert, and Jonathan S. Weissman. "Exploring genetic interaction manifolds constructed from rich single-cell phenotypes." Science 365, no. 6455 (August 8, 2019): 786–93. http://dx.doi.org/10.1126/science.aax4438.

Full text

Abstract:

How cellular and organismal complexity emerges from combinatorial expression of genes is a central question in biology. High-content phenotyping approaches such as Perturb-seq (single-cell RNA-sequencing pooled CRISPR screens) present an opportunity for exploring such genetic interactions (GIs) at scale. Here, we present an analytical framework for interpreting high-dimensional landscapes of cell states (manifolds) constructed from transcriptional phenotypes. We applied this approach to Perturb-seq profiling of strong GIs mined from a growth-based, gain-of-function GI map. Exploration of this manifold enabled ordering of regulatory pathways, principled classification of GIs (e.g., identifying suppressors), and mechanistic elucidation of synergistic interactions, including an unexpected synergy between CBL and CNN1 driving erythroid differentiation. Finally, we applied recommender system machine learning to predict interactions, facilitating exploration of vastly larger GI manifolds.

APA, Harvard, Vancouver, ISO, and other styles

50

Wu, Hao, and Gyöngyvér Molnár. "Analysing Complex Problem-Solving Strategies from a Cognitive Perspective: The Role of Thinking Skills." Journal of Intelligence 10, no. 3 (July 25, 2022): 46. http://dx.doi.org/10.3390/jintelligence10030046.

Full text

Abstract:

Complex problem solving (CPS) is considered to be one of the most important skills for successful learning. In an effort to explore the nature of CPS, this study aims to investigate the role of inductive reasoning (IR) and combinatorial reasoning (CR) in the problem-solving process of students using statistically distinguishable exploration strategies in the CPS environment. The sample was drawn from a group of university students (N = 1343). The tests were delivered via the eDia online assessment platform. Latent class analyses were employed to seek students whose problem-solving strategies showed similar patterns. Four qualitatively different class profiles were identified: (1) 84.3% of the students were proficient strategy users, (2) 6.2% were rapid learners, (3) 3.1% were non-persistent explorers, and (4) 6.5% were non-performing explorers. Better exploration strategy users showed greater development in thinking skills, and the roles of IR and CR in the CPS process were varied for each type of strategy user. To sum up, the analysis identified students’ problem-solving behaviours in respect of exploration strategy in the CPS environment and detected a number of remarkable differences in terms of the use of thinking skills between students with different exploration strategies.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Combinatorial exploration'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles