Готові списки джерел за темами / Log-in pair

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Log-in pair"

Автор: Grafiati

Опубліковано: 10 січня 2023

Оновлено: 28 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Log-in pair".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Log-in pair"

Kollár, János. "Semi-Normal Log Centres and Deformations of Pairs." Proceedings of the Edinburgh Mathematical Society 57, no. 1 (December 19, 2013): 191–99. http://dx.doi.org/10.1017/s0013091513000801.

Повний текст джерела

Анотація:

AbstractWe show that some of the properties of log canonical centres of a log canonical pair also hold for certain subvarieties that are close to being a log canonical centre. As a consequence, we obtain that, in working with deformations of pairs where all the coefficients of the boundary divisor are bigger than ½, embedded points never appear on the boundary divisor.

Стилі APA, Harvard, Vancouver, ISO та ін.

Lingas, Andrzej, and Anil Maheshwari. "A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree." Parallel Processing Letters 07, no. 01 (March 1997): 3–11. http://dx.doi.org/10.1142/s0129626497000036.

Повний текст джерела

Анотація:

We present optimal parallel solutions to reporting paths between pairs of nodes in an n-node tree. Our algorithms are deterministic and designed to run on an exclusive read exclusive write parallel random-access machine (EREW PRAM). In particular, we provide a simple optimal parallel algorithm for preprocessing the input tree such that the path queries can be answered efficiently. Our algorithm for preprocessing runs in O( log n) time using O(n/ log n) processors. Using the preprocessing, we can report paths between k node pairs in O( log n + log k) time using O(k + (n + S)/ log n) processors on an EREW PRAM, where S is the size of the output. In particular, we can report the path between a single pair of distinct nodes in O( log n) time using O(L/ log n) processors, where L denotes the length of the path.

Стилі APA, Harvard, Vancouver, ISO та ін.

López-García, María Nieves, Miguel Angel Sánchez-Granero, Juan Evangelista Trinidad-Segovia, Antonio Manuel Puertas, and Francisco Javier De las Nieves. "Volatility Co-Movement in Stock Markets." Mathematics 9, no. 6 (March 11, 2021): 598. http://dx.doi.org/10.3390/math9060598.

Повний текст джерела

Анотація:

The volatility and log-price collective movements among stocks of a given market are studied in this work using co-movement functions inspired by similar functions in the physics of many-body systems, where the collective motions are a signal of structural rearrangement. This methodology is aimed to identify the cause of coherent changes in volatility or price. The function is calculated using the product of the variations in volatility (or price) of a pair of stocks, averaged over all pair particles. In addition to the global volatility co-movement, its distribution according to the volatility of the stocks is also studied. We find that stocks with similar volatility tend to have a greater co-movement than stocks with dissimilar volatility, with a general decrease in co-movement with increasing volatility. On the other hand, when the average volatility (or log-price) is subtracted from the stock volatility (or log-price), the co-movement decreases notably and becomes almost zero. This result, interpreted within the background of many body physics, allows us to identify the index motion as the main source for the co-movement. Finally, we confirm that during crisis periods, the volatility and log-price co-movement are much higher than in calmer periods.

Стилі APA, Harvard, Vancouver, ISO та ін.

ADDARIO-BERRY, LOUIGI, NICOLAS BROUTIN, and GÁBOR LUGOSI. "The Longest Minimum-Weight Path in a Complete Graph." Combinatorics, Probability and Computing 19, no. 1 (June 22, 2009): 1–19. http://dx.doi.org/10.1017/s0963548309990204.

Повний текст джерела

Анотація:

We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has about α* log n edges, where α* ≈ 3.5911 is the unique solution of the equation α log α − α = 1. This answers a question posed by Janson [8].

Стилі APA, Harvard, Vancouver, ISO та ін.

Catanzaro, G., M. Gangi, M. Giarrusso, M. Munari, and F. Leone. "HD 226766: a hierarchical SB3 system with two twin Am stars." Monthly Notices of the Royal Astronomical Society 487, no. 1 (May 14, 2019): 919–27. http://dx.doi.org/10.1093/mnras/stz1312.

Повний текст джерела

Анотація:

ABSTRACT In this paper, we present a detailed revision of the orbital parameters and the first quantitative abundance analysis of the spectroscopic triple system HD 226766. By means of a simultaneous fit of the radial velocities of all the three components, we derived precise orbital parameters for the system, in particular inner pair has P(d) = 31.9187 ± 0.0001, e = 0.28 ± 0.01, and MA/MB = 1.03 ± 0.03, while the C component orbits around the inner pair with a period of P(d) = 1615 ± 59 in a very eccentric orbit (e = 0.54 ± 0.11). From the fit of the Hβ and Hα profiles, we determined the effective temperatures and surface gravities of each component of the inner pair: Teff = 8600 ± 500 K and log g = 3.8 ± 0.2 for HD 226766 A and Teff = 8500 ± 400 K and log g = 4.0 ± 0.2 for HD 226766 B. In the hypothesis that component C is a main sequence star (log g = 4.0) we derived Teff = 8000 ± 500 K. Rotational velocities have been estimated by modeling the profiles of metallic lines: v sin i = 13 ± 1 km s−1 for inner pair and v sin i = 150 ± 20 km s−1 for the C component. We find that the inner pair is heterogeneous from the point of view of the chemical composition: both stars are very similar and show chemical anomalies typical of Am stars. With some hypothesis about the masses of the components, we estimated the orbital inclination angle for the inner binary, i = (47 ± 1)○, and for the outer orbit, i = (54 ± 19)○.

Стилі APA, Harvard, Vancouver, ISO та ін.

Onaka, Susumu, and Kunio Hayashi. "Description of Changes in Crystal Orientations by the Elements of Logarithm of a Rotation Matrix." Scanning 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/4893956.

Повний текст джерела

Анотація:

The logarithmln⁡Rof rotation matrixRis a skew symmetric tensor consisting of three independent elements of real numbers. In addition to the Euler angles and the axis/angle pair, the elements ofln⁡Rcalled the log angles are also the set of three parameters ofR. In this paper, we will show that the concept of the log angles is also useful to discuss changes in crystal orientations. The changes inRas a function of the position are given by the changes in the log angles. As an example, orientation changes caused by arrays of dislocations in a plastically deformed Cu single crystal are discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tanaka, Hiromu. "Semiample perturbations for log canonical varieties over an F-finite field containing an infinite perfect field." International Journal of Mathematics 28, no. 05 (March 21, 2017): 1750030. http://dx.doi.org/10.1142/s0129167x17500306.

Повний текст джерела

Анотація:

Let [Formula: see text] be an [Formula: see text]-finite field containing an infinite perfect field of positive characteristic. Let [Formula: see text] be a projective log canonical pair over [Formula: see text]. In this note, we show that, for a semi-ample divisor [Formula: see text] on [Formula: see text], there exists an effective [Formula: see text]-divisor [Formula: see text] such that [Formula: see text] is log canonical if there exists a log resolution of [Formula: see text].

Стилі APA, Harvard, Vancouver, ISO та ін.

NAIR, R. "Pair correlations of the leVeque sequence on the polydisc." Mathematical Proceedings of the Cambridge Philosophical Society 145, no. 1 (July 2008): 197–203. http://dx.doi.org/10.1017/s0305004108001229.

Повний текст джерела

Анотація:

AbstractWe consider a system of “forms” defined for ẕ = (zij) on a subset of $\Bbb C^d$ by where d = d1 + ⋅ ⋅ ⋅ + dl and for each pair of integers (i,j) with 1 ≤ i ≤ l, 1 ≤ j ≤ di we denote by $(v_{ij}(k))_{k=1}^{\infty}$ a strictly increasing sequence of natural numbers. Let ${\Bbb C}_1$ = {z ∈ ${\Bbb C}$ : |z| < 1} and let ${\underline X} \ = \ \times _{i=1}^l \times _{j=1}^{d_i}X_{ij}$ where for each pair (i, j) we have Xij = ${\Bbb C}\backslash {\Bbb C}_1$. We study the distribution of the sequence on the l-polydisc $({\Bbb C}_1)^l$ defined by the coordinatewise polar fractional parts of the sequence Xk(ẕ) = (L1(ẕ)(k),. . ., Ll(ẕ)(k)) for typical ẕ in ${\underline X}$ More precisely for arcs I1, . . ., I2l in $\Bbb T$, let B = I1 × ⋅ ⋅ ⋅ × I2l be a box in $\Bbb T^{2l}$ and for each N ≥ 1 define a pair correlation function by and a discrepancy by ΔN = $\sup_{B \subset \Bbb T^{2l}}${VN(B) − N(N−1)leb(B)}, where the supremum is over all boxes in $\Bbb T^{2l}$. We show, subject to a non-resonance condition on $(v_{ij}(k))_{k=1}^{\infty}$, that given ε > 0 we have ΔN = o(N$(log N)^{l + {1\over 2}}$(log log N)1+ε) for almost every $\underline x(\underline z)\in \Bbb T^{2l}$. Similar results on extremal discrepancy are also proved. Our results complement those of I. Berkes, W. Philipp, M. Pollicott, Z. Rudnick, P. Sarnak, R Tichy and the author in the real setting.

Стилі APA, Harvard, Vancouver, ISO та ін.

Janjic, Tomislav, Gordana Vuckovic, and Milenko Celap. "Application of the log k pair linearity rule and proportionality rule to the RPP mobile phase scales estimation on cyano-silica column." Journal of the Serbian Chemical Society 66, no. 3 (2001): 173–78. http://dx.doi.org/10.2298/jsc0103173j.

Повний текст джерела

Анотація:

On the basis of literature-reported log k values, the Log k pair linearity rule and the Proportionality rule were found to be also valid in the case of cyano-silica sorbent, whenmethanol, acetonitrile or propane-2-olwere used as modifiers. The RPPscales, reflecting the solvent strength, are in good linear relationship with the experimentally determined log k values. Furthermore, in the case of methanol and acetonitrile, the linear dependence: log k = f(mol%of modifier) was also established. In the function obtained in a such way, the intercept and the slope exhibit an approximate linear dependence. Finally, in the case of methanol, the experimentally obtained log k values are in a satisfactory agreement with the values calculated by the above equation.

Стилі APA, Harvard, Vancouver, ISO та ін.

HSU, F. R., R. C. CHANG, and R. C. T. LEE. "PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS." International Journal of Computational Geometry & Applications 02, no. 02 (June 1992): 135–62. http://dx.doi.org/10.1142/s0218195992000093.

Повний текст джерела

Анотація:

In this paper, we are concerned with the closest visible vertex pair problem, which is defined as follows: we are given two simple non-intersecting polygons P and Q with m and n vertices respectively, we are asked to find a closest visible pair of vertices between P and Q. We shall show that we can solve this problem in O( log (m+n)) time with O(m+n) processors in the CREW PRAM model.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Log-in pair"

Vimalachandran, Pasupathy. "Privacy and Security of Storing Patients’ Data in the Cloud." Thesis, 2019. https://vuir.vu.edu.au/40598/.

Повний текст джерела

Анотація:

A better health care service must ensure patients receive the right care, in the right place, at the right time. In enabling better health care, the impact of technology is immense. Technological breakthroughs are revolutionising the way health care is being delivered. To deliver better health care, sharing health information amongst health care providers who are involved with the care is critical. An Electronic Health Record (EHR) platform is used to share the health information among those health care providers faster, as a result of technological advancement including the Internet and the Cloud. However, when integrating such technologies to support the provision of health care, they lead to major concerns over privacy and security of health sensitive information. The privacy and security concerns include a wide range of ethical and legal issues associated with the system. These concerns need to be considered and addressed for the implementation of EHR systems. In a shared environment like EHRs, these concerns become more significant. In this thesis, the author explores and discusses the situations where these concerns do arise in a health care environment. This thesis also covers different attacks that have targeted health care information in the past, with potential solutions for every attack identified. From these findings, the proposed system is designed and developed to provide considerable security assurance for a health care organisation when using the EHR systems. Furthermore, the My Health Record (MyHR) system is introduced in Australia to allow an individual’s doctors and other health care providers to access the individual’s health information. Privacy and security in using MyHR is a major challenge that impacts its usage. Taking all these concerns into account, the author will also focus on discussing and analysing major existing access control methods, various threats for data privacy and security concerns over EHR use and the importance of data integrity while using MyHR or any other EHR systems. To preserve data privacy and security and prevent unauthorised access to the system, the author proposes a three-tier security model. In this three-tier security model, the first tier covers an access control mechanism, an Intermediate State of Databases (ISD) is included in the second tier and the third layer involves cryptography/data encryption and decryption. These three tiers, collectively, cover different forms of attacks from different sources including unauthorised access from inside a health care organisation. In every tier, a specific technique has been utilised. In tier one, an Improved Access Control Mechanism (IACM) known as log-in pair, pseudonymisation technique is proposed in tier two and a special new encryption and decryption algorithm has been developed and used for tier three in the proposed system. In addition, the design, development, and implementation of the proposed model have been described to enable and evaluate the operational protocol. Problem 1. Non-clinical staff including reception, admin staff access sensitive health clinical information (insiders). Solution 1. An improved access control mechanism named log-in pair is introduced and occupied in tier one. Problem 2. Researchers and research institutes access health data sets for research activities (outsiders). Solution 2. Pseudonymisation technique, in tier two, provides de-identified required data with relationships, not the sensitive data. Problem 3. The massive amount of sensitive health data stored with the EHR system in the Cloud becomes more vulnerable to data attacks. Solution 3. A new encryption and decryption algorithm is achieved and used in tier three to provide high security while storing the data in the Cloud.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Log-in pair"

BOOKS, J. B. My Favorite Recipes and Wines : Two Part Logbook to Track Ingredient Lists, Cooking Methods and a Wine Tasting Log Book Section for Star Ratings : A 2-In-1 Journal to Keep Track of Food Dishes, Wine Paring for Delicious Meals That Pair with Wines: Log Book. Independently Published, 2019.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Paradise, Books. Pain Monitoring Journal: Chronic Pain Journal/chronic Pain Diary Notebook/chronic Pain Log Book/chronic Pain Gifts/back Pain Journal/chronic Pain and Symptom Tracker/chronic Pain Management with 122 Pages and Perfect in Size. Independently Published, 2020.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Clements, Allison. Chronic Pain Tracker - Eat Sleep Meditate Repeat Yoga Breathe in Meditation Graphic: MEDITATE, Chronic Pain Log Book Symptom Tracker and Health Diary Journal for Pain Management with Easy to Use Daily Format Pain Management ... Treatment, Organisation An. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Doctor, Tha. Arthritis Walking Log Book: Journal Help Prevent Disability in People with Arthritis Pain, 6x9 Inches and 110 Pages. Independently Published, 2020.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

January year old Chronic Pain Tracker. Chronic Pain Tracker : Queens Are Born in January : Gifts for Grandma: Chronic Pain Log Book Symptom Tracker and Health Diary Journal for Pain Management with Easy to Use Daily Format Pain Management ... Treatment, Organisation and Management,Birthday Gifts. Independently Published, 2022.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

McCallister, May. Gout Symptom Tracker: Chronic Pain and Symptom Log Book for Tracking and Recording the Symptoms in Various Joint, Pain Scale, Impact, and Triggers - Chevron Cover Design. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

mm year old Chronic Pain Tracker. Chronic Pain Tracker : Birthday Gifts - Kings Are Born in April : Gifts for Girls: Chronic Pain Log Book Symptom Tracker and Health Diary Journal for Pain Management with Easy to Use Daily Format Pain Management ... Treatment, Organisation and Management,Bir. Independently Published, 2022.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

mm year old Chronic Pain Tracker. Chronic Pain Tracker : Birthday Gifts - Kings Are Born in November : Gifts for Him: Chronic Pain Log Book Symptom Tracker and Health Diary Journal for Pain Management with Easy to Use Daily Format Pain Management ... Treatment, Organisation and Management,Bi. Independently Published, 2022.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

McCallister, May. Gout Tracker and Log Book: Weekly Chronic Pain and Symptom Notebook for Tracking and Recording the Symptoms in Various Joint, Pain Scale, Impact, and Triggers - Black Design Cover. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Publishing, Uniwareness. Ankylosing Spondylitis Pain and Symptom Tracker: All in One Detailed Daily Pain Assessment Diary, Medication Log, Mood Tracker, Sleep Problems, Food Intake, Perfect for Chronic Autoimmune Disease Management. Independently Published, 2022.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Log-in pair"

Thießen, Thore, and Jan Vahrenhold. "Klee’s Measure Problem Made Oblivious." In LATIN 2022: Theoretical Informatics, 121–38. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-20624-5_8.

Повний текст джерела

Анотація:

AbstractWe study Klee’s measure problem — computing the volume of the union of n axis-parallel hyperrectangles in $$\mathbb {R}^d$$ R d — in the oblivious RAM (ORAM) setting. For this, we modify Chan’s algorithm [12] to guarantee memory access patterns and control flow independent of the input; this makes the resulting algorithm applicable to privacy-preserving computation over outsourced data and (secure) multi-party computation.For $$d = 2$$ d = 2 , we develop an oblivious version of Chan’s algorithm that runs in expected $$\mathcal {O}(n \log ^{5/3} n)$$ O ( n log 5 / 3 n ) time for perfect security or $$\mathcal {O}(n \log ^{3/2} n)$$ O ( n log 3 / 2 n ) time for computational security, thus improving over optimal general transformations. For $$d \ge 3$$ d ≥ 3 , we obtain an oblivious version with perfect security while maintaining the $$\mathcal {O}(n^{d/2})$$ O ( n d / 2 ) runtime, i. e., without any overhead.Generalizing our approach, we derive a technique to transform divide-and-conquer algorithms that rely on linear-scan processing into oblivious counterparts. As such, our results are of independent interest for geometric divide-and-conquer algorithms that maintain an order over the input. We apply our technique to two such algorithms and obtain efficient oblivious counterparts of algorithms for inversion counting and computing a closest pair in two dimensions.

Стилі APA, Harvard, Vancouver, ISO та ін.

Haslbeck, Maximilian P. L., and Peter Lammich. "For a Few Dollars More." In Programming Languages and Systems, 292–319. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_11.

Повний текст джерела

Анотація:

AbstractWe present a framework to verify both, functional correctness and worst-case complexity of practically efficient algorithms. We implemented a stepwise refinement approach, using the novel concept of resource currencies to naturally structure the resource analysis along the refinement chain, and allow a fine-grained analysis of operation counts. Our framework targets the LLVM intermediate representation. We extend its semantics from earlier work with a cost model. As case study, we verify the correctness and $$O(n\log n)$$ O ( n log n ) worst-case complexity of an implementation of the introsort algorithm, whose performance is on par with the state-of-the-art implementation found in the GNU C++ Library.

Стилі APA, Harvard, Vancouver, ISO та ін.

Chan, Timothy M. "All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time." In Lecture Notes in Computer Science, 318–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11534273_28.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sîrbu, Alina, and Ozalp Babaoglu. "A Holistic Approach to Log Data Analysis in High-Performance Computing Systems: The Case of IBM Blue Gene/Q." In Euro-Par 2015: Parallel Processing Workshops, 631–43. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27308-2_51.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Giacometti, Arnaud, Patrick Marcel, Elsa Negre, and Arnaud Soulet. "Query Recommendations for OLAP Discovery-Driven Analysis." In Developments in Data Extraction, Management, and Analysis, 66–90. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2148-0.ch004.

Повний текст джерела

Анотація:

Recommending database queries is an emerging and promising field of research and is of particular interest in the domain of OLAP systems, where the user is left with the tedious process of navigating large datacubes. In this paper, the authors present a framework for a recommender system for OLAP users that leverages former users’ investigations to enhance discovery-driven analysis. This framework recommends the discoveries detected in former sessions that investigated the same unexpected data as the current session. This task is accomplished by (1) analysing the query log to discover pairs of cells at various levels of detail for which the measure values differ significantly, and (2) analysing a current query to detect if a particular pair of cells for which the measure values differ significantly can be related to what is discovered in the log. This framework is implemented in a system that uses the open source Mondrian server and recommends MDX queries. Preliminary experiments were conducted to assess the quality of the recommendations in terms of precision and recall, as well as the efficiency of their on-line computation.

Стилі APA, Harvard, Vancouver, ISO та ін.

"Grouping of Questions From a Question Bank Using Partition-Based Clustering." In Advances in Data Mining and Database Management, 38–51. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-3772-5.ch002.

Повний текст джерела

Анотація:

During automatic test paper generation, it is necessary to detect percentage of similarity among questions and thereby avoid repetition of questions. In order to detect repeated questions, the authors have designed and implemented a similarity matrix-based grouping algorithm. Grouping algorithms are widely used in multidisciplinary fields such as data mining, image analysis, and bioinformatics. This chapter proposes the use of grouping strategy-based partition algorithm for clustering the questions in a question bank. It includes a new approach for computing the question similarity matrix and use of the matrix in clustering the questions. The grouping algorithm extracts n module-wise questions, compute n × n similarity matrix by performing n × (n-1)/2 pair-wise question vector comparisons, and uses the matrix in formulating question clusters. Grouping algorithm has been found efficient in reducing the best-case time complexity, O (n× (n-1)/2 log n) of hierarchical approach to O (n × (n-1)/2).

Стилі APA, Harvard, Vancouver, ISO та ін.

Bhayani, Sadiq, Bethany Fitzmaurice, and Alifia Tameem. "Corticosteroids." In Essential Notes in Pain Medicine, edited by Enrique Collantes Celador, Jan Rudiger, and Alifia Tameem, 209–28. Oxford University Press, 2022. http://dx.doi.org/10.1093/med/9780198799443.003.0012.

Повний текст джерела

Анотація:

This chapter describes the role of corticosteroids in pain management. The overview section discusses both the classes of steroids and the British Pain Society’s recommendations of their use in neuraxial pain interventions. This chapter further discusses comparative potencies, along with the mode of action, effects, and side effects of triamcinolone, methylprednisolone, betamethasone, dexamethasone, and hydrocortisone. Finally, this chapter also includes a ‘steroid passport’, specially useful in chronic pain patients who can keep a log of all steroid injections that they can receive.

Стилі APA, Harvard, Vancouver, ISO та ін.

Stowe, Harriet Beecher. "An Evening in Uncle Tom’s Cabin." In Uncle Tom's Cabin. Oxford University Press, 2008. http://dx.doi.org/10.1093/owc/9780199538034.003.0006.

Повний текст джерела

Анотація:

The cabin of Uncle Tom was a small log building, close adjoining to “the house,” as the negro par excellence designates his master’s dwelling. In front it had a neat garden-patch, where, every summer, strawberries, raspberries, and a variety of fruits and vegetables,...

Стилі APA, Harvard, Vancouver, ISO та ін.

Damle, Satyawan, Prachi Goyal, and Dhanashree Sakhare. "Role of Diet in Dental Caries." In Illustrated Pediatric Dentistry - Part 1, 133–64. BENTHAM SCIENCE PUBLISHERS, 2022. http://dx.doi.org/10.2174/9789815051483122010012.

Повний текст джерела

Анотація:

The importance of sugars as a cause of dental caries is underemphasized and not prominent in preventive strategies. Quantitative analysis shows a log-linear doseresponse relationship between sucrose or its monosaccharide intakes and the progressive lifelong development of caries. This results in a substantial dental health burden throughout life. Processed starches have cariogenic potential when accompanying sucrose. Dental diseases impair quality of life and hurt self-esteem, eating ability and health, causing pain, anxiety, and impaired social functioning. So, it was also thought that diet could be controlled or modified, to exert an anti-caries effect. Several experiments, studies and research have been carried out to assess the effect of diet on dental caries.

Стилі APA, Harvard, Vancouver, ISO та ін.

Gavryushina, Lidia K. "The Archpriest Habbacum." In Materials for the virtual Museum of Slavic Cultures. Issue II, 43–47. Institute of Slavic Studies, Russian Academy of Sciences, 2020. http://dx.doi.org/10.31168/0440-4.6.

Повний текст джерела

Анотація:

The article talks about Habbacum (in Rus. — Avvakum) Petrov (1620–82), a prominent figure in the Russian Old Believers who opposed church reforms that were undertaken by Patriarch Nikon in the middle of the 17th century. They particularly opposed the introduction of the three fingers sign of the cross instead of the centuries-old two fingers sign and the editing of ancient liturgical books, using new printed Greek editions. The author traces the tragic fate of the rebellious archpriest, who was brutally persecuted by the authorities and finally burned alive by their order in a wooden log house. Considerable attention in the article is paid to the literary works of the sufferer, including his autobiography, the first in the history of Russian literature.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Log-in pair"

Burton, Greg. "A Hybrid Approach to Polygon Offsetting Using Winding Numbers and Partial Computation of the Voronoi Diagram." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34303.

Повний текст джерела

Анотація:

In this paper we present a new, efficient algorithm for computing the “raw offset” curves of 2D polygons with holes. Prior approaches focus on (a) complete computation of the Voronoi Diagram, or (b) pair-wise techniques for generating a raw offset followed by removal of “invalid loops” using a sweepline algorithm. Both have drawbacks in practice. Robust implementation of Voronoi Diagram algorithms has proven complex. Sweeplines take O((n + k)log n) time and O(n + k) memory, where n is the number of vertices and k is the number of self-intersections of the raw offset curve. It has been shown that k can be O(n2) when the offset distance is greater than or equal to the local radius of curvature of the polygon, a regular occurrence in the creation of contour-parallel offset curves for NC pocket machining. Our O(n log n) recursive algorithm, derived from Voronoi diagram algorithms, computes the velocities of polygon vertices as a function of overall offset rate. By construction, our algorithm prunes a large proportion of locally invalid loops from the raw offset curve, eliminating all self-intersections in raw offsets of convex polygons and the “near-circular”, k proportional to O(n2) worst-case scenarios in non-convex polygons.

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Wei, Christopher Braman, Brian Hantz, Manish Thorat, and Brian Pettinato. "Squeeze Film Damper Bearing With Double-Ended Beam Springs: Part II — Experimental Validation." In ASME Turbo Expo 2020: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/gt2020-15491.

Повний текст джерела

Анотація:

Abstract To validate a new squeeze film damper (SFD) bearing design introduced in [1], a pair of 3.5 inch SFD bearings were manufactured and tested. Static spring compression test was conducted to prove the spring design stiffness calculated through the geometry parametric spring model. High cycle loading fatigue testing of the spring was conducted to validate the design spring fatigue limit. The entire SFD bearing assembly was inspected and checked through a SFD centering bench test before the rotor dynamic test. Unbalance response correlation and logarithmic decrement (Log. Dec.) measurement using the operational modal analysis (OMA) method were employed for the rotor-dynamic tests. An agreement was seen between the analysis and the experimental measurement. It was seen that the SFD bearing provided the extra damping as expected to suppress the unbalance vibration when passing through the critical speed and also improve the stability (Log. Dec.) of the rotor. It was found that the measured SFD damping was closer to the full film damping model when the squeeze oil film was sealed with O-rings. The SFD improved the logarithmic decrement of the rotor-bearing system from 0.07 to more than 0.21 as compared to the system without SFD.

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

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: <LXY> and <LI> respectively. The values are then used for generating a multiplier, κ = <LXY> / <LI>, 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 та ін.

Vicencio, Fernando E. C., Fábio A. Schneider, Cristiane Cozin, Fausto A. Barbuto, Marco J. Da Silva, and Rigoberto E. M. Morales. "An Experimental Characterization of Horizontal Gas-Liquid Slug Flow." In ASME 2015 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/imece2015-52064.

Повний текст джерела

Анотація:

The present work is meant to broaden the knowledge on the fluid mechanics of the two-phase slug flows in horizontal pipes by means of an experimental approach. To accomplish this goal, an experimental facility at the LACIT-UTFPR labs consisting of a 25.8 mm ID, 9-m long transparent pipeline was used. A pair of 12×12-node wire-mesh sensors based on electrical capacitance was used to identify the void fraction in each node of the mesh. Bubble velocities, unit cell frequencies, void fractions and the characteristic lengths of this kind of flow were then obtained after a proper signal processing of the experimental data. To verify the measurements, a methodology to evaluate every measurement done in this work was proposed. Due to the intermittent nature of those flows, their characteristic parameters were identified as probability distributions, and approximated by probability density functions (PDF) such as the normal or log-normal ones. Correlations depending upon the inlet superficial velocities of both liquid and gas phases were fitted for the average values and standard deviation of each parameter. Finally, those correlations were compared to the experimental data, with the aim of accurately predicting the aforementioned parameters as functions of the inlet flow variables, so that those parameters can be used in the development of theoretical models for horizontal gas-liquid slug flow.

Стилі APA, Harvard, Vancouver, ISO та ін.

Gupta, Sushmita, Sanjukta Roy, Saket Saurabh, and Meirav Zehavi. "Winning a Tournament by Any Means Necessary." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/39.

Повний текст джерела

Анотація:

In a tournament, $n$ players enter the competition. In each round, they are paired-up to compete against each other. Losers are thrown, while winners proceed to the next round, until only one player (the winner) is left. Given a prediction of the outcome, for every pair of players, of a match between them (modeled by a digraph $D$), the competitive nature of a tournament makes it attractive for manipulators. In the Tournament Fixing (TF) problem, the goal is to decide if we can conduct the competition (by controlling how players are paired-up) so that our favorite player $w$ wins. A common form of manipulation is to bribe players to alter the outcome of matches. Kim and Williams [IJCAI 2015] integrated such deceit into TF, and showed that the resulting problem is NP-hard when $\ell<(1-\epsilon)\log n$ alterations are possible (for any fixed $\epsilon>0$). For this problem, our contribution is fourfold. First, we present two operations that ``obfuscate deceit'': given one solution, they produce another solution. Second, we present a combinatorial result, stating that there is always a solution with all reversals incident to $w$ and ``elite players''. Third, we give a closed formula for the case where $D$ is a DAG. Finally, we present exact exponential-time and parameterized algorithms for the general case.

Стилі APA, Harvard, Vancouver, ISO та ін.

Smith, Bruce A. W., Paul Feenstra, and Michael Liu. "Measurement of Steam-Generator Tube Damping Caused by Anti-Vibration-Bar Supports." In ASME 2021 Pressure Vessels & Piping Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/pvp2021-62112.

Повний текст джерела

Анотація:

Abstract In 2013, Atomic Energy of Canada Limited (now Canadian Nuclear Laboratories) took vibration measurements to examine low-frequency damping associated with tube vibration parallel to anti-vibration bar supports. These tests were performed to better understand and control in-plane fluidelastic instability of tubes in the U-bend region of recirculating steam generators. In the tests, the damping ratios of a single steam generator tube vibrating parallel to a single pair of anti-vibration bars were measured using both a log-decrement and a power-based method. Non-contacting excitation and position-sensing techniques were employed to improve accuracy. The tests examined the effects of fluid (water or air), natural frequency, gap width, preload, and vibration normal to the bars. Additional tests were also done using a drilled-hole support and without supports to allow validation against previously published work. Most of the tests were performed in water. This paper describes the tests including the test apparatus, test methods, and analysis techniques. A summary of the results is presented. These results show that the damping ratios measured without any supports and with a drilled-hole support are consistent with previously published data. Contrary to an existing design guideline, the anti-vibration bars resulted in no significant additional viscous or squeeze-film damping for vibration parallel to the bars. The results also showed that anti-vibration bars can introduce significant in-plane Coulomb-type damping because of friction and impacting.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tomar, Vikas, and Min Zhou. "Characterization of Defect Nucleation and Propagation in Fe2O3+FCC-Al Nanocomposites During Uniaxial Tensile and Compressive Deformations." In ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-13629.

Повний текст джерела

Анотація:

The objective of this research is to analyze uniaxial tensile and compressive mechanical deformations of α-Fe2O3 + fcc Al nanoceramic-metal composites using classical molecular dynamics (MD). Specifically, variations in the nucleation and the propagation of defects (such as dislocations and stacking faults etc.) with variation in the nanocomposite phase morphology and their effect on observed tensile and compressive strengths of the nanocomposites are analyzed. For this purpose, a classical molecular dynamics (MD) potential that includes an embedded atom method (EAM) cluster functional, a Morse type pair function, and a second order electrostatic interaction function is developed, see Tomar and Zhou (2004) and Tomar and Zhou (2006b). The nanocrystalline structures (nanocrystalline Al, nanocrystalline Fe2O3 and the nanocomposites with 40% and 60% Al by volume) with average grain sizes of 3.9 nm, 4.7 nm, and 7.2 nm are generated using a combination of the well established Voronoi tessellation method with the Inverse Monte-Carlo method to conform to prescribed log-normal grain size distributions. For comparison purposes, nanocrystalline structures with a specific average grain size have the same grain morphologies and the same grain orientation distribution. MD simulations are performed at the room temperature (300 K). Calculations show that the deformation mechanism is affected by a combination of factors including the fraction of grain boundary (GB) atoms and the electrostatic forces between atoms. The significance of each factor is dependent on the volume fractions of the Al and Fe2O3 phases. Depending on the relative orientations of the two phases at an interface, the contribution of the interface to the defect formation varies. The interfaces have stronger effect in structures with smaller average grain sizes than in structures with larger average grain sizes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Melis, Cécile, and Guillaume Bonnaffoux. "Derivation of Wave Height and Peak Period Statistics Accounting for Physical Limitations." In ASME 2014 33rd International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/omae2014-23827.

Повний текст джерела

Анотація:

When assessing the joint-probability of significant wave height and peak period, (Hs,Tp) measured over years at a given site, it is customary to fit a log-normal distribution to assess Tp dependence on Hs. The parameters of this distribution are then used either to compute N-year return period design curves in order to compute extreme response by means of short-term analysis, or response distributions, by means of response-based analysis. The main drawback of the Log-Normal distribution to represent the variability of Tp wrt. Hs is that its lower bound is zero, while physics tell us that wave steepness cannot be infinite, hence the lower bound, Tplim(Hs) should be greater than zero. If the distribution is kept unbounded, the resulting statistical fitting tends to predict occurrences of sea-states with (Hs,Tp) pairs having unphysical or unlikely steepness. This is particularly true in the range of 10–15s, where some ship-shaped units mooring systems responses are at their maximum. Attempts have been made in the past to introduce a lower bound to the log-normal distribution, for instance by Drago et al, [1], by shifting it by a predefined value of limit steepness. By doing so, some points of the original dataset had to be discarded as they were falling below the lower bound. An evolution of their methodology is proposed in this paper, which uses the points of the dataset in a relevant region which will be defined hereafter, and then uses this limit to shift the Log-Normal distribution. The obtained environmental contours are then compared against observed data to check which one fits most accurately the original set of measured (Hs,Tp) pairs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Koebe, Mario, Dieter Bothe, Jan Pruess, and Hans-Joachim Warnecke. "3D Direct Numerical Simulation of Air Bubbles in Water at High Reynolds Number." In ASME 2002 Joint U.S.-European Fluids Engineering Division Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/fedsm2002-31143.

Повний текст джерела

Анотація:

This article presents direct numerical simulations of single air bubbles and bubble pairs in water (with log Mo = −10.6) with a highly parallelized code based on the Volume Of Fluid method (VOF). Systematical simulations of terminal velocity of single bubbles with a diameter ranging from 0.5–15 mm (ReB = 200–3750) show good agreement with experimental data from Clift et al. Bubbles with a diameter of 8 mm show strong realistic surface deformations. Initial white noise has been added to all simulations to create realistic starting conditions. Rise paths of the bubbles depend strongly on the boundary conditions and the wall distance. Small wall distances reduce the path radii of the bubbles leading to an increased wake shedding frequency. For bubble pairs with wobbling surfaces the phenomenon of shedding of vortices from the edges of the bubbles is observed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kumar, Ashutosh. "Transformer-Based Deep Learning Models for Well Log Processing and Quality Control by Modelling Global Dependence of the Complex Sequences." In Abu Dhabi International Petroleum Exhibition & Conference. SPE, 2021. http://dx.doi.org/10.2118/208109-ms.

Повний текст джерела

Анотація:

Abstract A single well from any mature field produces approximately 1.7 million Measurement While Drilling (MWD) data points. We either use cross-correlation and covariance measurement, or Long Short-Term Memory (LSTM) based Deep Learning algorithms to diagnose long sequences of extremely noisy data. LSTM's context size of 200 tokens barely accounts for the entire depth. Proposed work develops application of Transformer-based Deep Learning algorithm to diagnose and predict events in complex sequences of well-log data. Sequential models learn geological patterns and petrophysical trends to detect events across depths of well-log data. However, vanishing gradients, exploding gradients and the limits of convolutional filters, limit the diagnosis of ultra-deep wells in complex subsurface information. Vast number of operations required to detect events between two subsurface points at large separation limits them. Transformers-based Models (TbMs) rely on non-sequential modelling that uses self-attention to relate information from different positions in the sequence of well-log, allowing to create an end-to-end, non-sequential, parallel memory network. We use approximately 21 million data points from 21 wells of Volve for the experiment. LSTMs, in addition to auto-regression (AR), autoregressive moving average (ARMA) and autoregressive integrated moving average (ARIMA) conventionally models the events in the time-series well-logs. However, complex global dependencies to detect events in heterogeneous subsurface are challenging for these sequence models. In the presented work we begin with one meter depth of data from Volve, an oil-field in the North Sea, and then proceed up to 1000 meters. Initially LSTMs and ARIMA models were acceptable, as depth increased beyond a few 100 meters their diagnosis started underperforming and a new methodology was required. TbMs have already outperformed several models in large sequences modelling for natural language processing tasks, thus they are very promising to model well-log data with very large depth separation. We scale features and labels according to the maximum and minimum value present in the training dataset and then use the sliding window to get training and evaluation data pairs from well-logs. Additional subsurface features were able to encode some information in the conventional sequential models, but the result did not compare significantly with the TbMs. TbMs achieved Root Mean Square Error of 0.27 on scale of (0-1) while diagnosing the depth up to 5000 meters. This is the first paper to show successful application of Transformer-based deep learning models for well-log diagnosis. Presented model uses a self-attention mechanism to learn complex dependencies and non-linear events from the well-log data. Moreover, the experimental setting discussed in the paper will act as a generalized framework for data from ultra-deep wells and their extremely heterogeneous subsurface environment.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!