Relevant bibliographies by topics / Hypercuts

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Hypercuts'

Author: Grafiati
Published: 5 June 2025
Last updated: 16 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hypercuts.'

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 "Hypercuts"

1

Linial, Nati, Ilan Newman, Yuval Peled, and Yuri Rabinovich. "Extremal hypercuts and shadows of simplicial complexes." Israel Journal of Mathematics 229, no. 1 (2019): 133–63. http://dx.doi.org/10.1007/s11856-018-1803-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nikutta, Robert, Enrique Lopez-Rodriguez, Kohei Ichikawa, Nancy A. Levenson, and Christopher C. Packham. "Hypercat - hypercube of AGN tori." Proceedings of the International Astronomical Union 15, S356 (2019): 44–49. http://dx.doi.org/10.1017/s1743921320002550.

Full text
Abstract:
AbstarctWe introduce Hypercat, a large set of 2-d AGN torus images computed with the state-of-the-art clumpy radiative transfer code Clumpy. The images are provided as a 9-dimensional hypercube, in addition to a smaller hypercube of corresponding projected dust distribution maps. Hypercat also comprises a software suite for easy use of the hypercubes, quantification of image morphology, and simulation of synthetic observations with single-dish telescopes, interferometers, and Integral Field Units. We apply Hypercat to NGC 1068 and find that it can be spatially resolved in Near- and Mid-IR, for the first time with single-dish apertures, on the upcoming generation of 25–40m class telescopes. We also find that clumpy AGN torus models within a range of the parameter space can explain on scales of several parsec the recently reported polar elongation of MIR emission in several sources, while not upending basic assumptions about AGN unification.
APA, Harvard, Vancouver, ISO, and other styles
3

Wee, Jaehyung, Jin-Ghoo Choi, and Wooguil Pak. "Wildcard Fields-Based Partitioning for Fast and Scalable Packet Classification in Vehicle-to-Everything." Sensors 19, no. 11 (2019): 2563. http://dx.doi.org/10.3390/s19112563.

Full text
Abstract:
Vehicle-to-Everything (V2X) requires high-speed communication and high-level security. However, as the number of connected devices increases exponentially, communication networks are suffering from huge traffic and various security issues. It is well known that performance and security of network equipment significantly depends on the packet classification algorithm because it is one of the most fundamental packet processing functions. Thus, the algorithm should run fast even with the huge set of packet processing rules. Unfortunately, previous packet classification algorithms have focused on the processing speed only, failing to be scalable with the rule-set size. In this paper, we propose a new packet classification approach balancing classification speed and scalability. It can be applied to most decision tree-based packet classification algorithms such as HyperCuts and EffiCuts. It determines partitioning fields considering the rule duplication explicitly, which makes the algorithm memory-effective. In addition, the proposed approach reduces the decision tree size substantially with the minimal sacrifice of classification performance. As a result, we can attain high-speed packet classification and scalability simultaneously, which is very essential for latest services such as V2X and Internet-of-Things (IoT).
APA, Harvard, Vancouver, ISO, and other styles
4

Röttger, Markus, and Ulf-Peter Schroeder. "Embedding 2-Dimensional Grids Into Optimal Hypercubes with Edge-Congestion 1 or 2." Parallel Processing Letters 08, no. 02 (1998): 231–42. http://dx.doi.org/10.1142/s0129626498000249.

Full text
Abstract:
This paper explores one-to-one embeddings of 2-dimensional grids into hypercubes. It is shown that each 2-dimensional grid can be embedded with edge-congestion 2 into its optimal hypercube (the smallest hypercube with at least as many nodes as the grid). Additionally, a technique is developed to embed many 2-dimensional grids into their optimal hypercubes with edge-congestion 1.
APA, Harvard, Vancouver, ISO, and other styles
5

Prabhu, Savari, Arumugam Krishnan Arulmozhi, and M. Arulperumjothi. "Certain Domination Parameters and Their Resolving Versions of Fractal Cubic Networks." Fractal and Fractional 8, no. 12 (2024): 747. https://doi.org/10.3390/fractalfract8120747.

Full text
Abstract:
Networks are designed to communicate, operate, and allocate tasks to respective commodities. Operating supercomputers became challenging, which was handled by the network design commonly known as hypercube, denoted by Qn. In a recent study, the hypercube networks were insufficient to hold supercomputers’ parallel processors. Thus, variants of hypercubes were discovered to produce an alternative to the hypercube. A new variant of the hypercube, the fractal cubic network, can be used as the best alternative in the case of hypercubes. Our research investigates that the fractal cubic network is a rooted product of two graphs. We try to determine its domination and resolving domination parameters, which could be applied to resource location and broadcasting-related problems.
APA, Harvard, Vancouver, ISO, and other styles
6

Burkov, Andriy, and Brahim Chaib-draa. "An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (2010): 729–36. http://dx.doi.org/10.1609/aaai.v24i1.7623.

Full text
Abstract:
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a single hypercube approximation of the set of SPE payoff profiles. Then the initial hypercube is gradually partitioned on to a set of smaller adjacent hypercubes, while those hypercubes that cannot contain any SPE point are gradually withdrawn. Whether a given hypercube can contain an equilibrium point is verified by an appropriate mixed integer program. A special attention is paid to the question of extracting players' strategies and their representability in form of finite automata.
APA, Harvard, Vancouver, ISO, and other styles
7

HUANG, KE, and JIE WU. "AREA EFFICIENT LAYOUT OF BALANCED HYPERCUBES." International Journal of High Speed Electronics and Systems 06, no. 04 (1995): 631–45. http://dx.doi.org/10.1142/s0129156495000237.

Full text
Abstract:
As a multicomputer structure, the balanced hypercube is a variant of the standard hypercube for multicomputers, with desirable properties of strong connectivity, regularity, and symmetry. This structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. In this paper, we study the implementation of balanced hypercubes in VLSI using the Wafer Scale Integration (VLSI/WSI) technology. Emphasis is on VLSI/WSI layout and area estimates. Our results show that the balanced hypercube can be implemented at least as efficient as the standard hypercube in an area layout and more efficient in a linear layout.
APA, Harvard, Vancouver, ISO, and other styles
8

Kim, Jin S., Seung Ryoul Maeng, and H. Yoon. "Ring Embedding in Hypercubes with Faculty Nodes." Parallel Processing Letters 07, no. 03 (1997): 285–96. http://dx.doi.org/10.1142/s0129626497000309.

Full text
Abstract:
Hypercube is an attractive structure for parellel processing due to its symmetry and regularity. To increase the reliability of hypercube based systems and to allow their use in the presence of faulty nodes, efficient fault-tolerant schemes in hypercubes are necessary. In this paper, we present an algorithm for embedding rings in hypercubes based multiprocessor network in the event of node failures. The algorithm can tolerate up to θ(2n/2) faults, and guarantee that given any f < (n - 2k)2k faulty nodes, it can find a ring of size at least 2n - 2f for k = 0 and 2n - 2k f - 22k for k ≥ 1 in an n-dimensional hypercube. It improves over existing algorithms in the size of ring.
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Jia-Bao, Xiang-Feng Pan, and Jinde Cao. "Some Properties on Estrada Index of Folded Hypercubes Networks." Abstract and Applied Analysis 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/167623.

Full text
Abstract:
LetGbe a simple graph withnvertices and letλ1,λ2,…,λnbe the eigenvalues of its adjacency matrix; the Estrada indexEEGof the graphGis defined as the sum of the termseλi, i=1,2,…,n. Then-dimensional folded hypercube networksFQnare an important and attractive variant of then-dimensional hypercube networksQn, which are obtained fromQnby adding an edge between any pair of vertices complementary edges. In this paper, we establish the explicit formulae for calculating the Estrada index of the folded hypercubes networksFQnby deducing the characteristic polynomial of the adjacency matrix in spectral graph theory. Moreover, some lower and upper bounds for the Estrada index of the folded hypercubes networksFQnare proposed.
APA, Harvard, Vancouver, ISO, and other styles
10

WU, JIE. "TIGHT BOUNDS ON THE NUMBER OF l-NODES IN A FAULTY HYPERCUBE." Parallel Processing Letters 05, no. 02 (1995): 321–28. http://dx.doi.org/10.1142/s0129626495000308.

Full text
Abstract:
The spanning binomial tree is one of most frequently used spanning tree structures to implement various parallel applications in multiprocessor systems, such as hypercubes. In this paper, we define an l-node as a root node of an incomplete spanning binomial tree of a hypercube, which is defined as a connected subtree of a spanning binomial tree with the same root node that connects all the nonfaulty nodes in the hypercube. We show that in an n-dimensional hypercube with m faulty nodes there are at least 2n − 2ml-nodes. This implies that at least half of the nodes of the hypercube are l-nodes if the number of faulty nodes is less than the dimension of the hypercube.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Hypercuts"

1

John, Ajita. "Linearly Ordered Concurrent Data Structures on Hypercubes." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc501197/.

Full text
Abstract:
This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the root, using a fan-out of at most [log₂ 𝑛] and a depth of [log₂ 𝑛] +1. Search trees spanning non-overlapping processor lists are formed using only local information, and can be used concurrently without contention problems. Thus, they can be used for performing broadcast and merge operations simultaneously on sets with non-uniform sizes. Extensions to generalized and faulty hypercubes and applications to image processing algorithms and for m-way search are discussed.
APA, Harvard, Vancouver, ISO, and other styles
2

潘忠強 and Chung-keung Poon. "Fault tolerant computing on hypercubes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1991. http://hub.hku.hk/bib/B31209944.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hartman, Jonathan Edward. "Hypercube solutions for conjugate directions." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/26581.

Full text
Abstract:
As computing machines advance, new fields are explored and old ones are expanded. This thesis considers parallel solutions to several well-known problems from numerical linear algebra, including Gauss Factorization and the method of Conjugate Gradients. The Gauss algorithm was implemented on two parallel machines: an Intel iPSC/2, and a network of INMOST-800 transputers. Interprocessor communication-in both cases-was borne by a hypercube interconnection topology. The results reveal general findings from parallel computing and more specific data and information concerning the systems and algorithms that were employed. Communication is timed and the results are analyzed, showing typical features of a message passing system. System performance is illustrated by results from the Gauss codes. The use of two different pivoting strategies shows the potential and the limitations of a parallel machine. The iPSC/2 and transputer systems both show excellent parallel performance when solving large, dense, unstructured systems. Differences, advantages, and disadvantages of these two systems are examined and expectations for current and future machines are discussed
APA, Harvard, Vancouver, ISO, and other styles
4

Pinto, Trevor Alvaro Anthony. "Extremal problems on the hypercube." Thesis, Queen Mary, University of London, 2016. http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651.

Full text
Abstract:
The hypercube, Qd, is a natural and much studied combinatorial object, and we discuss various extremal problems related to it. A subgraph of the hypercube is said to be (Qd; F)-saturated if it contains no copies of F, but adding any edge forms a copy of F. We write sat(Qd; F) for the saturation number, that is, the least number of edges a (Qd; F)-saturated graph may have. We prove the upper bound sat(Qd;Q2) < 10 2d, which strongly disproves a conjecture of Santolupo that sat(Qd;Q2) = 1 4 + o(1) d2d 1. We also prove upper bounds on sat(Qd;Qm) for general m. Given a down-set A and an up-set B in the hypercube, Bollobás and Leader conjectured a lower bound on the number of edge-disjoint paths between A and B in the directed hypercube. Using an unusual form of the compression argument, we confirm the conjecture by reducing the problem to a the case of the undirected hypercube. We also prove an analogous conjecture for vertex-disjoint paths using the same techniques, and extend both results to the grid. Additionally, we deal with subcube intersection graphs, answering a question of Johnson and Markström of the least r = r(n) for which all graphs on n vertices may be represented as subcube intersection graph where each subcube has dimension exactly r. We also contribute to the related area of biclique covers and partitions, and study relationships between various parameters linked to such covers and partitions. Finally, we study topological properties of uniformly random simplicial complexes, employing a characterisation due to Korshunov of almost all down-sets in the hypercube as a key tool.
APA, Harvard, Vancouver, ISO, and other styles
5

Park, Jahng Sun. "The Folded Hypercube ATM Switches." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/29167.

Full text
Abstract:
Over the past few years, many high performance asynchronous transfer mode (ATM) switches have been proposed. The majority of these switches have high performance but also high hardware complexity. Therefore, there is a need for switch designs with low complexity and high performance. This research proposes three new ATM switches based on the folded hypercube network (FHC). The performance of the three architectures are studied using a network model and simulation. The major performance parameters measured are the cell loss rate and cell delay time through the switch under uniform, normal, and bursty traffic patterns. To guarantee faster switching of time-sensitive cells, the routing algorithm of the three switches uses a priority scheme that gives higher precedence to the time-sensitive cells. Also, an output buffer controller is designed to manage the buffers in a fair manner. The three proposed switch architectures have lower complexity while providing equivalent or better switching performance compared to other more complex ATM switches described in the literature. This research shows a new approach to designing ATM switches by using the FHC as the switching fabric for the first time instead of using the crossbar, multi-path, or Banyan-based switching fabrics.<br>Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
6

White, William Warren. "Mapping parallel algorithms into hypercubes /." The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261010809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhu, Yahui. "Job scheduling on a hypercube /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487686243822801.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Johansson, Per. "Avoiding edge colorings of hypercubes." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160863.

Full text
Abstract:
The hypercube Qn is the graph whose vertices are the ordered n-tuples of zeros and ones, where two vertices are adjacent iff they differ in exactly one coordinate. A partial edge coloring f of a graph G is a mapping from a subset of edges of G to a set of colors; it is called proper if no pair of adjacent edges share the same color. A (possibly partial and unproper) coloring f is avoidable if there exists a proper coloring g such that no edge has the same color under f and g. An unavoidable coloring h is called minimal if it would be avoidable by letting any colored edge turn noncolored. We construct a computer program to find all minimal unavoidable edge colorings of Q3 using up to 3 colors, and draw some conclusions for general Qn.
APA, Harvard, Vancouver, ISO, and other styles
9

Lin, Eileen Tien. "Join processing on a hypercube multicomputer." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/8206.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gurney, Kevin. "Learning in networks of structured hypercubes." Thesis, Brunel University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328877.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Hypercuts"

1

Ranka, Sanjay, and Sartaj Sahni. Hypercube Algorithms. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-9692-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

McBryan, Oliver A. Hypercube algorithms and implementations. Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Afuah, Allan Nembo. The hypercube of innovation. Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Afuah, Allan Nembo. The hypercube of innovation. Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992., 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Xian-He. Optimal cube-connected cube multiprocessors. National Aeronautics and Space Administration, Langley Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Xian-He. Optimal cube-connected cube multiprocessors. National Aeronautics and Space Administration, Langley Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sun, Xian-He. Optimal cube-connected cube multiprocessors. National Aeronautics and Space Administration, Langley Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Grunwald, Dirk C. Benchmarking hypercube hardware and software. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dandamudi, Sivarama P. Hierarchical hypercube multicomputer interconnection networks. E. Horwood, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tannous, Joumana. Hypercube: Drawing an invisible world. Oxford Brookes University, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Hypercuts"

1

Weik, Martin H. "hypercube." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8546.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Thoegersen, Peter Alexander. "Hypercube." In Maqam Melodies. Jenny Stanford Publishing, 2024. http://dx.doi.org/10.1201/9781003492856-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Koziol, Quincey, Wu-Chun Feng, Wu-Chun Feng, et al. "Hypercube." In Encyclopedia of Parallel Computing. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2371.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cypher, Robert, and Jorge L. C. Sanz. "Hypercube Computers." In The SIMD Model of Parallel Computation. Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-2612-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Diudea, Mircea Vasile. "Spongy Hypercubes." In Multi-shell Polyhedral Clusters. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64123-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tsuiki, Hideki, and Yasuyuki Tsukamoto. "Imaginary Hypercubes." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13287-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liebeherr, Jörg, and Tyler K. Beam. "HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-540-46703-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tvrdík, Pavel. "On incomplete hypercubes." In Parallel Processing: CONPAR 92—VAPP V. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55895-0_392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aumasson, Jean-Philippe, Eric Brier, Willi Meier, María Naya-Plasencia, and Thomas Peyrin. "Inside the Hypercube." In Information Security and Privacy. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02620-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Stout, Quentin F. "Hypercubes and Pyramids." In Pyramidal Systems for Computer Vision. Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-82940-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hypercuts"

1

Wilson, David Bruce. "Embedding leveled hypercube algorithms into hypercubes (extended abstract)." In the fourth annual ACM symposium. ACM Press, 1992. http://dx.doi.org/10.1145/140901.141881.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Hyeongok. "Design of new routing algorithm and embedding for Hierarchical Hypercube Networks." In AHFE 2023 Hawaii Edition. AHFE International, 2023. http://dx.doi.org/10.54941/ahfe1004204.

Full text
Abstract:
Mesh, hypercube, HHN, bubbls-sort, star, transposition, and macro-star graphs have been proposed as interconnection networks used in high-performance parallel computer structures. A hypercube expresses a node with n binary numbers, and has an edge between 1-bit other nodes. A hypercube is an excellent network from a graph-theoretic point of view, such as node symmetry, fault tolerance, recursive scalability, and Hamiltonian cycles. However, compared to the increase in the number of nodes, the number of edges increases proportionally, so the network cost is not good. The HHN graph was proposed as a network that improved the network cost by improving the disadvantages of the hypercube. HHN graph uses hypercube as a basic module. The HHN graph is a network that has improved network cost by designing it to have a hierarchical structure based on a hypercube. HHN graphs have a simple routing algorithm with fewer branches and fewer links than hypercubes. Although HHN's routing algorithm has a simple advantage, it has a disadvantage that the path length is long via unnecessary nodes. In this study, we propose a new routing algorithm that improves the path length of the HHN graph and analyze its efficiency. The improved routing algorithm proposed in this study has the result of improving the existing algorithm by 30% on average. In addition, we analyze the embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes novel methods for the embedding of hierarchical Hypercube networks in the hypercube to minimize the dilation and the expansion costs.
APA, Harvard, Vancouver, ISO, and other styles
3

Hamza, Karim, and Mohammed Shalaby. "Convex Estimators for Optimization of Kriging Model Problems." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48566.

Full text
Abstract:
This paper presents a framework for identification of the global optimum of Kriging models. The framework is based on a branch and bound scheme for sub-division of the search space into hypercubes while constructing convex under-estimators of the Kriging models. The convex under-estimators, which are a key development in this paper, provide a relaxation of the original problem. The relaxed problem has two key features: i) convex optimization algorithms such as sequential quadratic programming (SQP) are guaranteed to find the global optimum of the relaxed problem, and ii) objective value of the relaxed problem is a lower bound on the best attainable solution within a hypercube for the original (Kriging model) problem. The convex under-estimators improve in accuracy as the size of a hypercube gets smaller via the branching search. Termination of a hypercube branch is done when either: i) solution of the relaxed problem within the hypercube is no better than current best solution of the original problem, or ii) best solution of the original problem and that of the relaxed problem are within tolerance limits. To assess the significance of the proposed framework, comparison studies against genetic algorithm (GA) are conducted using Kriging models that approximate standard nonlinear test functions, as well as application problems of water desalination and vehicle crashworthiness. Results of the studies show the proposed framework deterministically providing a solution within tolerance limits from the global optimum, while GA is observed to not reliably discover the best solutions in problems with larger number of design variables.
APA, Harvard, Vancouver, ISO, and other styles
4

Schneider, Fabian, Max Schüssler, Ralph Hellmig, and Oliver Nelles. "Constrained Design of Experiments for Data-Driven Models." In Forum Bildverarbeitung 2022. KIT Scientific Publishing, 2022. http://dx.doi.org/10.58895/ksp/1000151141-14.

Full text
Abstract:
The quality of data-driven models depends significantly on the data distribution in the input space. In this work, design of experiments (DoE) methods for constrained input spaces are discussed. An approach based on an Latin hypercube (LH) design is introduced to deal with strongly constrained input spaces. For the unconstrained case, where the input space is a hypercube, different design of experiments methods have been developed. The dominating state-of-the-art methods are Sobol sequences and Latin hypercubes. Instead of optimizing complete LH designs, the proposed strategy is to incrementally construct an LH design. Every new sample is selected by a distance-based metric. The presented method is then applied in two test cases and compared to a method based on a Sobol sequence. Here, an initial design is created by a Sobol sequence and every sample is removed that violates the constraints. The design qualities are measured by the resulting model accuracies of data-driven models. A function generator is applied to create synthetic data sets to train and evaluate local linear model networks.
APA, Harvard, Vancouver, ISO, and other styles
5

Schneider, Fabian, Max Schüssler, Ralph Hellmig, and Oliver Nelles. "Constrained Design of Experiments for Data-Driven Models." In Forum Bildverarbeitung 2022. KIT Scientific Publishing, 2022. http://dx.doi.org/10.58895/ksp/1000150865-14.

Full text
Abstract:
The quality of data-driven models depends significantly on the data distribution in the input space. In this work, design of experiments (DoE) methods for constrained input spaces are discussed. An approach based on an Latin hypercube (LH) design is introduced to deal with strongly constrained input spaces. For the unconstrained case, where the input space is a hypercube, different design of experiments methods have been developed. The dominating state-of-the-art methods are Sobol sequences and Latin hypercubes. Instead of optimizing complete LH designs, the proposed strategy is to incrementally construct an LH design. Every new sample is selected by a distance-based metric. The presented method is then applied in two test cases and compared to a method based on a Sobol sequence. Here, an initial design is created by a Sobol sequence and every sample is removed that violates the constraints. The design qualities are measured by the resulting model accuracies of data-driven models. A function generator is applied to create synthetic data sets to train and evaluate local linear model networks.
APA, Harvard, Vancouver, ISO, and other styles
6

Angel, D., G. Uma, and E. Priyadharshini. "Application of Graph theory to Defend Hypercubes and Matching Graph of Hypercube Structures Against Cyber Threats." In 2023 First International Conference on Advances in Electrical, Electronics and Computational Intelligence (ICAEECI). IEEE, 2023. http://dx.doi.org/10.1109/icaeeci58247.2023.10370916.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Klouche, Khalil, Tuukka Ruotsalo, and Giulio Jacucci. "From Hyperlinks to Hypercues." In DIS '18: Designing Interactive Systems Conference 2018. ACM, 2018. http://dx.doi.org/10.1145/3196709.3196775.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morineau, Thierry. "Hypercube algebra." In the 30th European Conference. ACM Press, 2012. http://dx.doi.org/10.1145/2448136.2448157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rostami, H., J. Habibi, and A. Rahnama. "Semantic HyperCup." In Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06). IEEE, 2006. http://dx.doi.org/10.1109/hicss.2006.430.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

"T series hypercube." In the third conference. ACM Press, 1988. http://dx.doi.org/10.1145/62297.62410.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hypercuts"

1

Dunigan, T. Hypercube clock synchronization. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/6389058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dunigan, T. H. A portable hypercube simulator. Office of Scientific and Technical Information (OSTI), 1987. http://dx.doi.org/10.2172/6120006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hastad, Johan, Tom Leighton, and Mark Newman. Fast Computation Using Faulty Hypercubes. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gropp, W. D., and I. C. Ipsen. Recursive Mesh Refinement on Hypercubes. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada198695.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Snelick, Robert D. Performance evaluation of hypercube applications:. National Institute of Standards and Technology, 1991. http://dx.doi.org/10.6028/nist.ir.4630.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pfaltz, J., S. Son, and J. French. Implementation of a hypercube database system. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/7251310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Collins, Joseph C., and III. Latin Hypercube Sampling in Sensitivity Analysis. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada285867.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dunigan, T. H. A remote host facility for Intel hypercubes. Office of Scientific and Technical Information (OSTI), 1989. http://dx.doi.org/10.2172/6024707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

French, J. C. A global time reference for hypercube multicomputers. Office of Scientific and Technical Information (OSTI), 1988. http://dx.doi.org/10.2172/6164260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Womble, D. E. The performance of asynchronous algorithms on hypercubes. Office of Scientific and Technical Information (OSTI), 1988. http://dx.doi.org/10.2172/6548901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hypercuts' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography