Relevant bibliographies by topics / Discrete approach

Contents

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

Academic literature on the topic 'Discrete approach'

Author: Grafiati
Published: 10 March 2023

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 'Discrete approach.'

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 "Discrete approach"

1

Dias-da-Costa, D., J. Alfaiate, L. J. Sluys, and E. Júlio. "A discrete strong discontinuity approach." Engineering Fracture Mechanics 76, no. 9 (2009): 1176–201. http://dx.doi.org/10.1016/j.engfracmech.2009.01.011.

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

Djadja, M., A. Naamane, and N. Giambiasi. "Approach for discrete event simulation." Electronics Letters 34, no. 16 (1998): 1615. http://dx.doi.org/10.1049/el:19981112.

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

Kantelhardt, Jan W., H. Eduardo Roman, and Martin Greiner. "Discrete wavelet approach to multifractality." Physica A: Statistical Mechanics and its Applications 220, no. 3-4 (1995): 219–38. http://dx.doi.org/10.1016/0378-4371(95)00267-b.

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

Khosiyono, Banun Havifah cahyo. "DISCRETE AND INTEGRATED APPROACH AND THE IMPLICATIONS ON LANGUAGE TEACHING LEARNING MANAGEMENT." Prominent 4, no. 1 (2021): 19–29. http://dx.doi.org/10.24176/pro.v4i1.5755.

Full text
Abstract:
This paper describes discrete and integrated approach and the implication on language teaching learning management. Discrete approach emphasizes on the teaching and learning a language discretely, whereas integrated approach emphasizes on the whole language, namely speaking, writing, listening, reading, pronunciation, grammar, and vocabulary. In fact, both are interrelated since discrete learning is the basis for integrated learning. Both should be implemented in the teaching learning process in the classroom so that students are able to use the language well. Therefore, the curriculum or the syllabus, teaching materials, teachers’ qualification, and classroom management should be prepared well.
APA, Harvard, Vancouver, ISO, and other styles
5

do Nascimento, Roberto Quirino, Ana Flávia Uzeda dos Santos Macambira, Lucidio dos Anjos Formiga Cabral, and Renan Vicente Pinto. "The discrete ellipsoid covering problem: A discrete geometric programming approach." Discrete Applied Mathematics 164 (February 2014): 276–85. http://dx.doi.org/10.1016/j.dam.2012.10.016.

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

Prasuna, P. M., Dr Y. Ramadevi, and Dr A. Vinay Babu. "A two level approach to discretize cosmetic data using Rough set theory." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 10 (2015): 6147–52. http://dx.doi.org/10.24297/ijct.v14i10.1826.

Full text
Abstract:
Discrete values play a very prominent role in extracting knowledge. Most of the machines learning algorithms use discrete values. It is also observed that the rules discovered through discrete values are shorter and precise. The predictive accuracy is more when discrete values are used. Cosmetic industry extracts the features from the face images of the customers to analyze their facial skin problems. These values are continuous in nature. A predictive model with high accuracy is required to determine the cosmetic problems of the customers and suggest suitable cosmetic. Existing traditional discretization techniques are not sufficient for deriving discretized data from continuous valued cosmetic data as it has to balance the loss of information intrinsic to process adapted and generating a reasonable number of cut points, that is, a reasonable search space. This paper proposes a two level discretization method which is a combination of traditional k means clustering technique and rough set theory to discretize continuous features of cosmetic data.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhukovskiy, V., and L. Smirnova. "UNCERTAINTY AND DISCRETE MAXIMIN." TAURIDA JOURNAL OF COMPUTER SCIENCE THEORY AND MATHEMATICS, no. 1 (November 25, 2022): 7–31. http://dx.doi.org/10.29039/1729-3901-2021-20-1-7-31.

Full text
Abstract:
The article consists of two parts. The first part is devoted to general questions that are related to uncertainty: causes and sources of uncertainties appearance, classification of uncertainties in economic systems and approach to their assessment. In the second part the concept of maximin, based on the principle of guaranteed result (Wald’s principle) is considered. In this case, maximin is interpreted from viewpoint of two-level hierarchical game. On the basis of the maximin concept, a guaranteed solution in outcomes for K-stage positional single-criterion linear quadratic problem under uncertainty is formalized. An explicit form of the guaranteed solution for this problem is found
APA, Harvard, Vancouver, ISO, and other styles
8

Blachowski, Bartlomiej, and Witold Gutkowski. "A hybrid continuous-discrete approach to large discrete structural optimization problems." Structural and Multidisciplinary Optimization 41, no. 6 (2009): 965–77. http://dx.doi.org/10.1007/s00158-009-0466-1.

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

Antoine, J. P., Y. B. Kouagou, D. Lambert, and B. Torrésani. "An algebraic approach to discrete dilations. Application to discrete wavelet transforms." Journal of Fourier Analysis and Applications 6, no. 2 (2000): 113–41. http://dx.doi.org/10.1007/bf02510656.

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

Hager, Kevin, and Richard Balling. "New Approach for Discrete Structural Optimization." Journal of Structural Engineering 114, no. 5 (1988): 1120–34. http://dx.doi.org/10.1061/(asce)0733-9445(1988)114:5(1120).

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

Dissertations / Theses on the topic "Discrete approach"

1

Graham, Justin W. "School choice : a discrete optimization approach." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127294.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, May, 2020<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 32-34).<br>An equitable and flexible mechanism for assigning students to schools is a major concern for many school districts. The school a student attends dramatically impacts the quality of education, access to resources, family and neighborhood cohesion, and transportation costs. Facing this intricate optimization problem, school districts often utilize to stable-matching techniques which only produce stable matchings that do not incorporate these different objectives; this can be expensive and inequitable. We present a new optimization model for the Stable Matching (SM) school choice problem which relies on an algorithm we call Price-Costs-Flexibility-and- Fairness (PCF2). Our model leverages techniques to balance competing objectives using mixed-integer optimization methods. We explore the trade-offs between stability, costs, and preferences and show that, surprisingly, there are stable solutions that decrease transportation costs by 8-17% over the Gale-Shapley solution.<br>by Justin W. Graham.<br>S.M.<br>S.M. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center
APA, Harvard, Vancouver, ISO, and other styles
2

Villa, Cristiano. "An objective Bayesian approach for discrete scenarios." Thesis, University of Kent, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.633699.

Full text
Abstract:
Objective prior distributions represent a fundamental part of Bayesian inference. Although several approaches for continuous parameter spaces have been developed, Bayesian theory lacks of a general method that allows to obtain priors for the discrete case. In the present work we propose a novel idea, based on losses, to derive objective priors for discrete parameter spaces. We objectively measure the worth of each parameter values, and link it to the prior probability by means of the self information loss function. The worth is measured by taking into consideration the surroundings of each element of the parameter space. Bayes theorem is then re-interpreted, where prior and posterior beliefs are not expressed as probabilities, but as losses. The approach allows to retain meaning from the beginning to the end of the Bayesian updating process. The prior distribution obtained with the above approach is identified as the t-Walker prior. We illustrate the approach by applyi~t.,to various scenarios. We derive objective priors for five specific models: a population size model, the Hypergeometric and multivariate Hypergeometric models, the Binomial-Beta model, and the Binomial model. We also derive the Villa- Walker prior for the number of degrees of freedom of a t distribution. An important result in this last case, is that the objective prior has to be truncated.
APA, Harvard, Vancouver, ISO, and other styles
3

Pillay, Samara. "Modelling angiogenesis : a discrete to continuum approach." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:a6f3f5a2-5f47-480d-8500-e560d46d9157.

Full text
Abstract:
Angiogenesis is the process by which new blood vessels develop from existing vessels. Angiogenesis is important in a number of conditions such as embryogenesis, wound healing and cancer. It has been modelled phenomenologically at the macroscale, using the well-known 'snail-trail' approach in which trailing endothelial cells follow the paths of other, leading endothelial cells. In this thesis, we systematically determine the collective behaviour of endothelial cells from their behaviour at the cell-level during corneal angiogenesis. We formulate an agent-based model, based on the snail-trail process, to describe the behaviour of individual cells. We incorporate cell motility through biased random walks, and include processes which produce (branching) and annihilate (anastomosis) cells to represent sprout and loop formation. We use the transition probabilities associated with the discrete model and a mean-field approximation to systematically derive a system of non-linear partial differential equations (PDEs) of population behaviour that impose physically realistic density restrictions, and are structurally different from existing snail-trail models. We use this framework to evaluate the validity of a classical snail-trail model and elucidate implicit assumptions. We then extend our framework to explicitly account for cell volume. This generates non-linear PDE models which vary in complexity depending on the extent of volume exclusion incorporated on the microscale. By comparing discrete and continuum models, we assess the extent to which continuum models, including the classical snail-trail model, account for single and multi-species exclusion processes. We also distinguish macroscale exclusion effects introduced by each cell species. Finally, we compare the predictive power of different continuum models. In summary, we develop a microscale to macroscale framework for angiogenesis based on the snail-trail process, which provides a systematic way of deriving population behaviour from individual cell behaviour and can be extended to account for more realistic and/or detailed cell interactions.
APA, Harvard, Vancouver, ISO, and other styles
4

Simpson, Andrew E. "A Discrete Model Approach to Biofilm Growth." University of Akron / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=akron1342790784.

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

Logue, James K. "The discrete, orthogonal wavelet transform, a projective approach." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1995. http://handle.dtic.mil/100.2/ADA304330.

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

Ren, Mingming. "An incremental approach for hardware discrete controller synthesis." Phd thesis, INSA de Lyon, 2011. http://tel.archives-ouvertes.fr/tel-00679296.

Full text
Abstract:
The Discrete Controller Synthesis (DCS) technique is used for automatic generation of correct-by-construction hardware controllers. For a given plant (a state-based model), and an associated control specification (a behavioral requirement), DCS generates a controller which, composed with the plant, guarantees the satisfaction of the specification. The DCS technique used relies on binary decision diagrams (BDDs). The controllers generated must be compliant with standard RTL hardware synthesis tools. Two main issues have been investigated: the combinational explosion, and the actual generation of the hardware controller. To address combinational explosion, common approaches follow the "divide and conquer" philosophy, producing modular control and/or decentralized control. Most of these approaches do not consider explicit communication between different components of a plant. Synchronization is mostly achieved by sharing of input events, and outputs are abstracted away. We propose an incremental DCS technique which also applies to communicating systems. An initial modular abstraction is followed by a sequence of progressive refinements and computations of approximate control solutions. The last step of this sequence computes an exact controller. This technique is shown to have an improved time/memory efficiency with respect to the traditional global DCS approach. The hardware controller generation addresses the control non-determinism problem in a specific way. A partially closed-loop control architecture is proposed, in order to preserve the applicability of hierarchical design. A systematic technique is proposed and illustrated, for transforming the automatically generated control equation into a vector of control functions. An application of the DCS technique to the correction of certain design errors in a real design is illustrated. To prove the efficiency of the incremental synthesis and controller implementation, a number of examples have been studied.
APA, Harvard, Vancouver, ISO, and other styles
7

Ahlbach, Connor Thomas. "A Discrete Approach to the Poincare-Miranda Theorem." Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/hmc_theses/47.

Full text
Abstract:
The Poincare-Miranda Theorem is a topological result about the existence of a zero of a function under particular boundary conditions. In this thesis, we explore proofs of the Poincare-Miranda Theorem that are discrete in nature - that is, they prove a continuous result using an intermediate lemma about discrete objects. We explain a proof by Tkacz and Turzanski that proves the Poincare-Miranda theorem via the Steinhaus Chessboard Theorem, involving colorings of partitions of n-dimensional cubes. Then, we develop a new proof of the Poincare-Miranda Theorem that relies on a polytopal generalization of Sperner's Lemma of Deloera - Peterson - Su. Finally, we extend these discrete ideas to attempt to prove the existence of a zero with the boundary condition of Morales.
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Xuecheng 1963. "Nonparametric estimation with censored data : a discrete approach." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=85570.

Full text
Abstract:
This dissertation principally addresses nonparametric maximal likelihood (NPML) estimation of the cumulative distribution function (CDF) given multivariate (arbitrarily) censored data (herein abbreviated MCD).<br>The CDF nonparametric maximal likelihood estimate (NPMLE) given MCD has support on the union of all maximal intersections of the data. The CDF NPMLE can be computed numerically using the clique matrix of the intersection graph of the data; these NPMLEs can be nonunique in both a representational and a mixture sense (see Peto 1973, Turnbull 1976, Gentleman & Vandal 2001 and Gentleman & Vandal 2002).<br>The fundamental methodology used in this dissertation consists in applying graph theory to the intersection graph of censored data and discrete mathematics to its linear algebraic representation. An optimal algorithm to determine the maximal intersections of MCD is proposed. A full discussion of measures of NPMLE mixture nonuniqueness and their computational implementations for the measures is provided. The iterative convex minorant (ICM) algorithm to obtain the NPMLE is extended to the case of MCD. The nonparametric likelihood maximization given MCD is simplified via the use of a reduction tree. The EM/X Algorithm is introduced to compute the NPMLE for large MCD set. Bounds on self-consistent estimates of the CDF (a class to which the CDF NPMLE belongs) given MCD are used to assess the degree of consistency of the CDF NPMLE. Constrained estimation and likelihood intervals computation given univariate censored data are discussed. The empirical likelihood method is also applied to construct CDF likelihood sets for MCD. An unbiased and consistent estimate is proposed for MCD with fixed censoring times.
APA, Harvard, Vancouver, ISO, and other styles
9

Sze, Chuen-kan, and 施泉根. "On framelets and their applications: a discrete approach." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29803937.

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

CARVALHO, LUCIANA CRUZ ALVES DE. "A DISCRETE TIME APPROACH OF REAL OPTIONS THEORY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=7829@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Os métodos tradicionais de avaliação de projetos vem sendo questionados por não considerarem possíveis incertezas associadas ao investimento. Neste contexto, a Teoria das Opções Reais busca aplicar o conceito de opções a ativos reais, com a finalidade de agregar o valor da flexibilidade gerencial aos métodos tradicionais de avaliação de investimentos. A avaliação por Opções Reais é considerada complexa devido à difícil modelagem de incertezas e das flexibilidades, além da necessidade de se ter mercados completos. Este estudo busca incorporar a flexibilidade gerencial à avaliação de projetos através do uso de Árvores Binomiais de Decisão, com probabilidades neutras ao risco, para a avaliação por Opções Reais em Tempo Discreto. Utilizamos programação dinâmica para a aplicação desta metodologia, a qual é computacionalmente intensa, porém de solução simples e intuitiva. A aplicação prática foi realizada através da valoração da opção de expandir e da opção de abandonar enfrentada por uma empresa de Tecnologia.<br>The traditional methods of Valuation are being questioned as they do not consider possible uncertainties related to investment decisions. In this scenario, Real Options Theory applies option`s concept to real assets, aiming to add the value of managerial flexibility to traditional Valuation techniques. The evaluation for Real Options is considered complex due to the difficulty of modeling uncertainties and flexibilities, beyond the need to have complete markets. This work aims to add the managerial flexibility to Valuation by binomial lattice and decision tree techniques, with risk neutral probabilities, in a discrete time approach to evaluation for Real Options. Using dynamic programming to apply this method, which is computationally intense, but simple and intuitive. The practical application consists in valuing an option to expand and to abandon faced by an IT company.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Discrete approach"

1

Discrete mathematics: A unified approach. McGraw-Hill, 1987.

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

Acharjya, D. P. Fundamental approach to discrete mathematics. 2nd ed. New Age International (P) Ltd., Publishers, 2009.

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

Y, Liu Regina, ed. Asset pricing: Discrete time approach. Kluwer Academic Publishers, 2003.

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

Acharjya, D. P. Fundamental Approach to Discrete Mathematics. New Age International Pvt. Ltd., Publishers, 2005.

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

Wiitala, Stephen A. Discrete mathematics: A unified approach. McGraw Hill, 1987.

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

A, Wall James, ed. Discrete event simulation: A practical approach. CRC Press, 1993.

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

Gries, David, and Fred B. Schneider. A Logical Approach to Discrete Math. Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-3837-7.

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

Pooch, Udo W. Discrete event simulation: A practical approach. CRC Press, 1993.

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

David, Gries. A logical approach to discrete math. 3rd ed. Springer-Verlag, 1995.

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

Rice, Michael. Digital communications: A discrete-time approach. Prentice Hall, 2009.

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

Book chapters on the topic "Discrete approach"

1

Borre, Kai. "Discrete Approach." In Plane Networks and their Applications. Birkhäuser Boston, 2001. http://dx.doi.org/10.1007/978-1-4612-0165-6_2.

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

Tasgetiren, Fatih, Yun-Chia Liang, Quan-Ke Pan, and Ponnuthurai Suganthan. "Discrete/Binary Approach." In Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-92151-6_6.

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

Khrennikov, Andrei. "Discrete Time Dynamics." In Contextual Approach to Quantum Formalism. Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-1-4020-9593-1_12.

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

Guex, Jean, Federico Galster, and Øyvind Hammer. "Graph Theoretical Approach." In Discrete Biochronological Time Scales. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21326-2_2.

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

Lomax, H., Thomas H. Pulliam, and David W. Zingg. "The Semi-Discrete Approach." In Fundamentals of Computational Fluid Dynamics. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04654-8_4.

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

Sundararajan, D. "The Discrete Fourier Transform." In Fourier Analysis—A Signal Processing Approach. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1693-7_2.

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

Osyczka, Andrzej, and Jerzy Montusiewicz. "A Random-Search Approach to Multicriterion Discrete Optimization." In Discrete Structural Optimization. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-85095-0_8.

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

Mockus, Jonas, William Eddy, Audris Mockus, Linas Mockus, and Gintaras Reklaitis. "Bayesian Approach to Discrete Optimization." In Nonconvex Optimization and Its Applications. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-2627-5_11.

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

Latecki, Longin Jan, and Rolf Lakämper. "Discrete Approach to Curve Evolution." In Mustererkennung 1998. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-642-72282-0_7.

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

Sundararajan, D. "The Discrete-Time Fourier Transform." In Fourier Analysis—A Signal Processing Approach. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1693-7_8.

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

Conference papers on the topic "Discrete approach"

1

Isaacson, Susana I., Susana C. Gabbanelli, and Jorge R. Busch. "Discrete wavelet approach to multifractality." In International Symposium on Optical Science and Technology, edited by Akram Aldroubi, Andrew F. Laine, and Michael A. Unser. SPIE, 2000. http://dx.doi.org/10.1117/12.408593.

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

Trautner, Andreas. "Anatomy of a top-down approach to discrete and modular flavor symmetry." In 7th Symposium on Prospects in the Physics of Discrete Symmetries, DISCRETE 2020-2021. Sissa Medialab, 2022. http://dx.doi.org/10.22323/1.405.0074.

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

Fang, Woon Siew, Sharmila Karim, and Mohd Saiful Adli Mohamad. "A variational discrete filled function approach in discrete global optimization." In INNOVATION AND ANALYTICS CONFERENCE AND EXHIBITION (IACE 2015): Proceedings of the 2nd Innovation and Analytics Conference & Exhibition. AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4937077.

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

Drakunov, S., and R. DeCarlo. "Discrete-time/discrete-event sliding mode design via Lyapunov approach." In Proceedings of 16th American CONTROL Conference. IEEE, 1997. http://dx.doi.org/10.1109/acc.1997.610878.

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

Roy, Ankur, and Sivaji Lahiri. "Quantifying Connectivity of Fracture Networks: A Lacunarity Approach." In 3rd International Discrete Fracture Network Engineering Conference. ARMA, 2022. http://dx.doi.org/10.56952/arma-dfne-22-0049.

Full text
Abstract:
Abstract Connectivity estimated by simply considering the relative number of nodes in fracture networks, i.e., cross-cutting (X), abutting (Y), and isolated (I), without regard to their spatial distributions, is often not a unique identifier of fracture geometry. This research proposes a modified, lacunarity based estimate of connectivity which considers both the spatial distribution of such nodes in a network and also their abundance. We compare three pairs of natural fracture maps from different sources, each pair with the same connectivity but very different visual appearances. A study of the flow properties of these maps using a streamline simulator and invoking the fracture continuum model showed that pairs of maps with same connectivity but different visual appearances yield distinct recovery curves and time-of-flight (TOF) plots. A MATLAB toolbox, FracPaQ, is used to identify and spatially map the three different X, Y and I-nodes in fracture networks. The spatial clustering of nodes that facilitate conductivity (X, Y) and those that hinder flow (I), are calculated separately by implementing a log-transformed lacunarity summed over a range of scales as: &amp;lt;LXY&amp;gt; and &amp;lt;LI&amp;gt; respectively. The values are then used for generating a multiplier, κ = &amp;lt;LXY&amp;gt; / &amp;lt;LI&amp;gt;, which is incorporated into a new connectivity index, L-connectivity. The results show that pairs of fracture maps that have the same apparent connectivity, but with differences in visual appearances and hence, flow properties, can be distinguished based on this new lacunarity-based connectivity index. This parameter may therefore, prove to be a unique identifier of the connectivity of fracture networks. L-connectivity may be potentially utilized for estimating the network connectivity and, as a first pass for evaluating fracture network geometry by modelers and engineers who deal in fractured petroleum reservoirs and aquifers.
APA, Harvard, Vancouver, ISO, and other styles
6

Seleznev, Igor, Evgeniy Konopatskiy, Olga Voronova, Oksana Shevchuk, and Andrey Bezditnyi. "An Approach to Comparing Multidimensional Geometric Objects." In 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-3027-682-688.

Full text
Abstract:
The paper proposes an approach to the comparison of multidimensional geometric objects, which is used to assess the variational geometric models of multifactor processes and phenomena obtained using the geometric theory of multidimensional interpolation. The proposed approach consists of two stages, the first of which consists in the discretization of multidimensional geometric objects in the form of a set of discretely given points, and the second is in comparing the obtained discrete point sets using a criterion that is essentially similar to the coefficient of determination. In this case, one of the discrete point sets is taken as a reference for comparison with another point set. For a correct comparison of multidimensional geometric models in the form of point equations, which are reduced to a system of parametric equations, it is necessary to perform interconnection of parameters. A computational experiment was carried out on the example of comparing geometric models of the physical and mechanical properties of fine-grained concrete. It showed the possibility of using the proposed approach for comparing multidimensional geometric objects and the reliability of the results obtained in comparison with scientific visualization methods. On the same example, it was found that for an accurate comparison of the investigated geometric models of the physical and mechanical properties of fine-grained concrete, it is enough to discretize 100 points. A further increase in the set of discrete points of the compared geometric objects has no significant effect on the criterion for assessing their similarity.
APA, Harvard, Vancouver, ISO, and other styles
7

Sahu, Ajay K., and Ankur Roy. "Analyzing Anisotropy in Fracture Networks: A Flow Simulation Approach." In 3rd International Discrete Fracture Network Engineering Conference. ARMA, 2022. http://dx.doi.org/10.56952/arma-dfne-22-2358.

Full text
Abstract:
Abstract Anisotropy may be observed in rock masses that contain fractures and affects several properties including flow behavior which is controlled by how fractures are clustered in space. While Rose diagrams are often used for delineating "fracture sets" in different directions, it is a challenge to quantify anisotropy in terms of fracture clustering that controls fluid flow. This research attempts to answer the question by capturing the anisotropy in fluid production rates of fracture networks and implements a modified inverted five-spot water flooding pattern. Flow simulation is done by considering the fracture continuum (FC) model and using a Darcy based streamline simulator. The results from this “dynamic modeling” approach is compared with the anisotropy in fracture clustering for a set of natural maps. Coefficient of variation that can differentiate between clustered, random, and anticlustered fractures in 1-dimensional fracture data is used for quantifying the “clustering” anisotropy in 2-dimensional fracture networks. We employ this parameter for evaluating directional clustering in such networks by moving a set of scanlines in two mutually perpendicular directions and finding the respective arithmetic averages. The results show that overall fluid production values tend to be higher in the direction of highly clustered fractures. It implies that a “dynamic” approach can be successfully used for evaluating the anisotropy of a reservoir and larger ratio in production values in two mutually perpendicular directions suggests the presence of fracture clusters. If such anisotropy is taken into account, it can help in building more realistic DFN models.
APA, Harvard, Vancouver, ISO, and other styles
8

Chmaj, Grzegorz, and Dawid Zydek. "Software Development Approach for Discrete Simulators." In 2011 21st International Conference on Systems Engineering (ICSEng). IEEE, 2011. http://dx.doi.org/10.1109/icseng.2011.56.

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

Prüll, Alexander. "Hole burning: A discrete kinetic approach." In RAREFIED GAS DYNAMICS: 22nd International Symposium. AIP, 2001. http://dx.doi.org/10.1063/1.1407543.

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

Bombelli, L. "A combinatorial approach to discrete geometry." In A CENTURY OF RELATIVITY PHYSICS: ERE 2005; XXVIII Spanish Relativity Meeting. AIP, 2006. http://dx.doi.org/10.1063/1.2218222.

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

Reports on the topic "Discrete approach"

1

Dershowitz, William S., and Trenton Cladouhos. Discrete Feature Approach for Heterogeneous Reservoir Production Enhancement. Office of Scientific and Technical Information (OSTI), 2001. http://dx.doi.org/10.2172/785909.

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

Dershowitz, William S., Brendan Curran, Herbert Einstein, Paul LaPointe, Dawn Shuttle, and Kate Klise. Discrete Feature Approach for Heterogeneous Reservoir Production Enhancement. Office of Scientific and Technical Information (OSTI), 2002. http://dx.doi.org/10.2172/797644.

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

Adda, Jerome, and Russell Cooper. The Dynamics of Car Sales: A Discrete Choice Approach. National Bureau of Economic Research, 2000. http://dx.doi.org/10.3386/w7785.

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

Nechyba, Thomas, and Robert Strauss. Community Choice and Local Public Services: A Discrete Choice Approach. National Bureau of Economic Research, 1997. http://dx.doi.org/10.3386/w5966.

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

Hitt, Darren L., and Walter J. Varhue. DEPSCOR06: A Dispersed Monopropellant Microslug Approach for Discrete Satellite Micropropulsion. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada564650.

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

Riesenfeld, Richard F., and Elaine Cohen. Discrete B-Splines as an Approach to Computer Aided Geometric Design. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada161445.

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

Etherington, David W., David Joslin, and George L. Nemhauser. Search Strategies in Large-Scale Discrete Optimization: A Joint AI/OR Approach. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada341379.

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

Samejima, Fumiko. Differential Weight Procedure of the Conditional P.D.F. Approach for Estimating the Operating Characteristics of Discrete Item Responses. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada224697.

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

Blackman, Allen, Sahan Dissanayake, Adan Martinez Cruz, Leonardo Corral, and Maja Schling. Benefits of Titling Indigenous Communities in the Peruvian Amazon: A Stated Preference Approach. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004678.

Full text
Abstract:
We conduct a discrete choice experiment with leaders of a random sample of 164 Peruvian indigenous communities (ICs) - to our knowledge, the first use of rigorous stated preference methods to analyze land titling. We find that: (i) on average, IC leaders are willing to pay US$35,000-45,000 for a title, roughly twice the per community administrative cost of titling; (ii) WTP is positively correlated with the value of IC land and the risk of land grabbing; and (iii) leaders prefer titling processes that involve indigenous representatives and titles that encompass land with cultural value.
APA, Harvard, Vancouver, ISO, and other styles
10

Das, Sanjiv Ranjan. An Efficient Generalized Discrete-Time Approach to Poisson-Gaussian Bond Option Pricing in the Heath-Jarrow-Morton Model. National Bureau of Economic Research, 1997. http://dx.doi.org/10.3386/t0212.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Discrete approach' 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