Увійти

Готові списки джерел за темами / Repeated Matchings / Статті в журналах

Статті в журналах з теми "Repeated Matchings"

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Repeated Matchings.

Автор: Grafiati

Опубліковано: 6 вересня 2023

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

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

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Repeated Matchings".

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

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

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Friedman, Daniel, and Ryan Oprea. "A Continuous Dilemma." American Economic Review 102, no. 1 (February 1, 2012): 337–63. http://dx.doi.org/10.1257/aer.102.1.337.

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

Анотація:

We study prisoners' dilemmas played in continuous time with flow payoffs accumulated over 60 seconds. In most cases, the median rate of mutual cooperation is about 90 percent. Control sessions with repeated matchings over eight subperiods achieve less than half as much cooperation, and cooperation rates approach zero in one-shot sessions. In follow-up sessions with a variable number of subperiods, cooperation rates increase nearly linearly as the grid size decreases, and, with one-second subperiods, they approach continuous levels. Our data support a strand of theory that explains how capacity to respond rapidly stabilizes cooperation and destabilizes defection in the prisoner's dilemma. (JEL C72, C78, C91)

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

2

Serafine, Mary Louise, Noah Glassman, and Cornell Overbeeke. "The Cognitive Reality of Hierarchic Structure in Music." Music Perception 6, no. 4 (1989): 397–430. http://dx.doi.org/10.2307/40285440.

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

Анотація:

Six experiments examined the cognitive reality of hierarchic structure in music. The first experiment showed that subjects were only moderately able to match a performed rendition of a hierarchic structure to the piece of music from which it was derived, with performance slightly better than chance. Metric accent emerged as a significant predictor of the tones perceived by subjects as structurally important. The second experiment showed that subjects' correct matchings were unlikely to be based on aesthetic preference, because performed renditions of (rule-governed) structures were not regarded as aesthetically preferable to nonstructures. The third experiment attempted to increase subjects' matching of structures and their original pieces through various task modifications, but these modifications did not increase performance over the success rate achieved in Experiment 1. Three additional experiments determined whether evidence of the distinction between structureand surface could be obtained in various similarity judgment tasks. Pairs of musical fragments were composed so that the members of each pair embodied (1) the same structure and same surface harmony, or (2) the same structure but different surface harmony, or (3) a different structure but same surface harmony. The rating task used in Experiments 4 and 5 showed that the members of Type-2 pairs of fragments were perceived to be just as similar as the members of Type-1 pairs, but Type-3 pairs were rated significantly lower in similarity. Thus, similarity judgments were based on underlying hierarchic structure, even in the face of radical harmony differences on the surface. This effect increased in strength with repeated hearing. The results support the cognitive reality of hierarchic structure, but are influenced by the type of perception used in a particular similarity judgment task and by the experience of repeated hearings.

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

3

López-Ortiz, Alejandro. "Linear pattern matching of repeated substrings." ACM SIGACT News 25, no. 3 (September 1994): 114–21. http://dx.doi.org/10.1145/193820.193842.

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

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

4

Wark, Peter, John Holt, Mikael Rönnqvist, and David Ryan. "Aircrew schedule generation using repeated matching." European Journal of Operational Research 102, no. 1 (October 1997): 21–35. http://dx.doi.org/10.1016/s0377-2217(96)00225-1.

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

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

5

Honhon, Dorothée, and Kyle Hyndman. "Flexibility and Reputation in Repeated Prisoner’s Dilemma Games." Management Science 66, no. 11 (November 2020): 4998–5014. http://dx.doi.org/10.1287/mnsc.2019.3495.

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

Анотація:

We study how three matching institutions, differing in how relationships are dissolved, affect cooperation in a repeated prisoner’s dilemma and how cooperation rates are affected by the presence of a reputation mechanism. Although cooperation is theoretically sustainable under all institutions, we show experimentally that cooperation rates are lowest under random matching, highest under fixed matching, and intermediate in a flexible matching institution, where subjects have the option to dissolve relationships. Our results also suggest important interactions between the matching institution and reputation mechanism. Under both the random matching and flexible matching institutions, both subjective (based on subjects’ ratings) and objective (based on subjects’ actions) reputation mechanisms lead to substantial increases in cooperative behavior. However, under fixed matching, only the subjective reputation mechanism leads to higher cooperation. We argue that these differences are due to different reputation mechanisms being more forgiving of early deviations from cooperation under certain matching institutions, which gives subjects the ability to learn the value of cooperation rather than getting stuck with a bad reputation and, consequently, uncooperative relationships. This paper was accepted by Yan Chen, decision analysis.

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

6

Mingyan Wang, Mingyan Wang, Qingrong Huang Mingyan Wang, Nan Wu Qingrong Huang, and Ying Pan Nan Wu. "RDF Subgraph Matching by Means of Star Decomposition." 網際網路技術學刊 23, no. 7 (December 2022): 1613–21. http://dx.doi.org/10.53106/160792642022122307015.

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

Анотація:

<p>With the continuous development of the network, the scale of RDF data is becoming larger and larger. In the face of large-scale RDF data processing, the traditional database query method has been unable to meet the needs. Due to the limited characteristics of subgraph matching, most existing algorithms often have the phenomenon that many subgraphs are repeatedly traversed during the query process, resulting in a large number of intermediate result sets and low query efficiency. The core problem to be solved is how to efficiently match subgraphs. In order to improve the query efficiency of RDF subgraphs in massive RDF data graphs and solve the problem of repeated calculation of some graphs in the query process of RDF subgraphs, an RDF subgraph query algorithm based on star decomposition is proposed in this paper. The algorithm uses graph structure to decompose RDF subgraphs into stars and uses a custom node cost model to calculate the query order of the star subgraphs. By decomposing, the amount of communication among subgraphs is reduced, and the communication cost for query processing is lowered. Moreover, utilizing the query order for RDF subgraph matching can effectively reduce the generation of intermediate result sets and accelerate the efficiency of subgraph matching. On this basis, the performances of the proposed algorithm and several other widely used algorithms are compared and analyzed on two different datasets. Experiments show that the proposed algorithm has better advantages in database recreation, memory size, and execution efficiency. </p> <p> </p>

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

7

Schumacher, Heiner. "On Repeated Games with Endogenous Matching Decision." Journal of Institutional and Theoretical Economics 171, no. 3 (2015): 544. http://dx.doi.org/10.1628/093245615x14302136524716.

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

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

8

Bishop, Nicholas, Hau Chan, Debmalya Mandal, and Long Tran-Thanh. "Sequential Blocked Matching." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 4834–42. http://dx.doi.org/10.1609/aaai.v36i5.20411.

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

Анотація:

We consider a sequential blocked matching (SBM) model where strategic agents repeatedly report ordinal preferences over a set of services to a central planner. The planner's goal is to elicit agents' true preferences and design a policy that matches services to agents in order to maximize the expected social welfare with the added constraint that each matched service can be blocked or unavailable for a number of time periods. Naturally, SBM models the repeated allocation of reusable services to a set of agents where each allocated service becomes unavailable for a fixed duration. We first consider the offline SBM setting, where the strategic agents are aware of their true preferences. We measure the performance of any policy by distortion, the worst-case multiplicative approximation guaranteed by any policy. For the setting with s services, we establish lower bounds of Ω(s) and Ω(√s) on the distortions of any deterministic and randomised mechanisms, respectively. We complement these results by providing approximately truthful, measured by incentive ratio, deterministic and randomised policies based on random serial dictatorship which match our lower bounds. Our results show that there is a significant improvement if one considers the class of randomised policies. Finally, we consider the online SBM setting with bandit feedback where each agent is initially unaware of her true preferences, and the planner must facilitate each agent in the learning of their preferences through the matching of services over time. We design an approximately truthful mechanism based on the explore-then-commit paradigm, which achieves logarithmic dynamic approximate regret.

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

9

Kim, Hee Chun. "Repeated Two-Sided Matching with Multi-Attribute Preference." Korean Journal of Industrial Organization 27, no. 4 (December 31, 2019): 87–121. http://dx.doi.org/10.36354/kjio.27.4.3.

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

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

10

Xu, Zhenzhen, and John D. Kalbfleisch. "Repeated Randomization and Matching in Multi-Arm Trials." Biometrics 69, no. 4 (October 17, 2013): 949–59. http://dx.doi.org/10.1111/biom.12077.

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

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

11

Wark, Peter, and John Holt. "A Repeated Matching Heuristic for the Vehicle Routeing Problem." Journal of the Operational Research Society 45, no. 10 (October 1994): 1156. http://dx.doi.org/10.2307/2584478.

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

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

12

Wark, Peter, and John Holt. "A Repeated Matching Heuristic for the Vehicle Routeing Problem." Journal of the Operational Research Society 45, no. 10 (October 1994): 1156–67. http://dx.doi.org/10.1057/jors.1994.185.

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

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

13

Nayar, Gayathri R. "Advanced Partial Palmprint Matching Based on Repeated Adjoining Minutiae." International Journal on Recent and Innovation Trends in Computing and Communication 3, no. 1 (2015): 378–81. http://dx.doi.org/10.17762/ijritcc2321-8169.150175.

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

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

14

Deb, Joyee, Julio González-Díaz, and Jérôme Renault. "Uniform folk theorems in repeated anonymous random matching games." Games and Economic Behavior 100 (November 2016): 1–23. http://dx.doi.org/10.1016/j.geb.2016.08.006.

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

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

15

Deb, Joyee, Takuo Sugaya, and Alexander Wolitzky. "The Folk Theorem in Repeated Games With Anonymous Random Matching." Econometrica 88, no. 3 (2020): 917–64. http://dx.doi.org/10.3982/ecta16680.

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

Анотація:

We prove the folk theorem for discounted repeated games with anonymous random matching. We allow non‐uniform matching, include asymmetric payoffs, and place no restrictions on the stage game other than full dimensionality. No record‐keeping or communication devices—including cheap talk communication and public randomization—are necessary.

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

16

Neuringer, Allen. "Choosing to Vary and Repeat." Psychological Science 3, no. 4 (July 1992): 246–51. http://dx.doi.org/10.1111/j.1467-9280.1992.tb00037.x.

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

Анотація:

Can animals choose to vary their behaviors or to repeat them, depending on the rewards they earn for behaving variably versus repetitively? To answer this question, pigeons were rewarded for four-response sequences made to left (L) and right (R) disks. A “varied” sequence differed from each of the previous three sequences, and a “repeated” sequence was the same as some one of the previous three. For example, if a pigeon had generated sequences LLLL. LLLR, and LLRR in that order, then an RRRR sequence in the next trial was defined as a variation, whereas LLLL was a repetition. Two experiments showed that frequencies of varied and repeated sequences depended on the frequencies with which they were reinforced, with a “matching” relationship accounting for the results. It was concluded that pigeons' choices to vary or repeat parallel their choices between simpler response alternatives, a result consistent with the hypothesis that behavioral variability is influenced by its consequences. This finding may help to explain the “voluntary” or “free” nature of operant behavior.

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

17

Anshelevich, Elliot, Meenal Chhabra, Sanmay Das, and Matthew Gerrior. "On the Social Welfare of Mechanisms for Repeated Batch Matching." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 60–66. http://dx.doi.org/10.1609/aaai.v27i1.8666.

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

Анотація:

We study hybrid online-batch matching problems, where agents arrive continuously, but are only matched in periodic rounds, when many of them can be considered simultaneously. Agents not getting matched in a given round remain in the market for the next round. This setting models several scenarios of interest, including many job markets as well as kidney exchange mechanisms. We consider the social utility of two commonly used mechanisms for such markets: one that aims for stability in each round (greedy), and one that attempts to maximize social utility in each round (max-weight). Surprisingly, we find that in the long term, the social utility of the greedy mechanism can be higher than that of the max-weight mechanism. We hypothesize that this is because the greedy mechanism behaves similarly to a soft threshold mechanism, where all connections below a certain threshold are rejected by the participants in favor of waiting until the next round. Motivated by this observation, we propose a method to approximately calculate the optimal threshold for an individual agent to use based on characteristics of the other agents participating, and demonstrate experimentally that social utility is high when all agents use this strategy. Thresholding can also be applied by the mechanism itself to improve social welfare; we demonstrate this with an example on graphs that model pairwise kidney exchange.

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

18

Xiao, Yuanzhang, Florian Dorfler, and Mihaela van der Schaar. "Incentive Design in Peer Review: Rating and Repeated Endogenous Matching." IEEE Transactions on Network Science and Engineering 6, no. 4 (October 1, 2019): 898–908. http://dx.doi.org/10.1109/tnse.2018.2877578.

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

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

19

Jackson, Matthew O., and Alison Watts. "Social games: Matching and the play of finitely repeated games." Games and Economic Behavior 70, no. 1 (September 2010): 170–91. http://dx.doi.org/10.1016/j.geb.2008.02.004.

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

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

20

Liu, Huajun, Shuang Yin, Haigang Sui, Qingye Yang, Dian Lei, and Wei Yang. "Accurate Matching of Invariant Features Derived from Irregular Curves." Remote Sensing 14, no. 5 (February 28, 2022): 1198. http://dx.doi.org/10.3390/rs14051198.

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

Анотація:

High-quality feature matching is a critical prerequisite in a wide range of applications. Most contemporary methods concentrate on detecting keypoints or line features for matching, which have achieved adequate results. However, in some low-texture environments where these features are both lacking, previously used approaches may result in an insufficient number of matches. Besides, in repeated-texture environments, feature matching is also a challenging task. As a matter of fact, there exist numerous irregular curves that can be detected in all kinds of images, including low-texture and repeated-texture scenes, which inspires us to move a step further and dig into the research of curves. In this paper, we propose an accurate method to match invariant features from irregular curves. Our method consists of two stages, the first of which is to match the curves as accurately as possible by an elaborate three-step matching strategy. The second is to extract the matching features with the presented self-adaptive curve fitting approach. Experiments have shown that the matching performances of our features in ordinary scenes are comparable to previous keypoints. Particularly, our features can outperform the keypoints in low-texture and repeated-texture scenes.

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

21

KONO, Akari, Takuya NAKAZATO, and Toru NAMERIKAWA. "Optimal Electric Vehicle Charging Scheduling by Matching Theory and Repeated Game." Transactions of the Society of Instrument and Control Engineers 56, no. 11 (2020): 495–503. http://dx.doi.org/10.9746/sicetr.56.495.

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

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

22

Haruvy, Ernan, and M. Utku Ünver. "Equilibrium selection and the role of information in repeated matching markets." Economics Letters 94, no. 2 (February 2007): 284–89. http://dx.doi.org/10.1016/j.econlet.2006.07.002.

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

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

23

Eliaz, Kfir, and Ariel Rubinstein. "Edgar Allan Poe's riddle: Framing effects in repeated matching pennies games." Games and Economic Behavior 71, no. 1 (January 2011): 88–99. http://dx.doi.org/10.1016/j.geb.2009.05.010.

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

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

24

Matsushima, Hitoshi. "Long-term partnership in a repeated prisoner's dilemma with random matching." Economics Letters 34, no. 3 (November 1990): 245–48. http://dx.doi.org/10.1016/0165-1765(90)90125-k.

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

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

25

Hantula, Donald A., and Charles R. Crowell. "Matching and Behavioral Contrast in a Two-Option Repeated Investment Simulation." Managerial and Decision Economics 37, no. 4-5 (May 18, 2015): 294–305. http://dx.doi.org/10.1002/mde.2717.

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

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

26

McMillen, Daniel P. "Repeat Sales as a Matching Estimator." Real Estate Economics 40, no. 4 (September 3, 2012): 745–73. http://dx.doi.org/10.1111/j.1540-6229.2012.00343.x.

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

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

27

Renoult, Louis, and J. Bruno Debruille. "N400-like Potentials and Reaction Times Index Semantic Relations between Highly Repeated Individual Words." Journal of Cognitive Neuroscience 23, no. 4 (April 2011): 905–22. http://dx.doi.org/10.1162/jocn.2009.21410.

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

Анотація:

The N400 ERP is an electrophysiological index of semantic processing. Its amplitude varies with the semantic category of words, their concreteness, or whether their meaning matches that of a preceding context. The results of a number of studies suggest that these effects could be markedly reduced or suppressed for stimuli that are repeated. Nevertheless, we have recently shown that significant effects of semantic matching and category could be obtained on N400-like potentials elicited by massively repeated target words in a prime–target semantic categorization task. If such effects could be obtained when primes also are repeated, it would then be possible to study the semantic associations between individual words. The present study thus aimed to test this hypothesis while (1) controlling for a potential contribution of physical matching to the processing of repeated targets and (2) testing if the N400-like effects obtained in these conditions are modulated by task instruction, as are classic N400 effects. Two category words were used as primes and two exemplars as targets. In one block of trials, subjects had to respond according to the semantic relation between prime and target (semantic instruction) and, in another block, they had to report changes in letter case (physical instruction). Results showed that the amplitude of the N400-like ERP obtained was modulated by semantic matching and category but not by letter case. The effect of semantic matching was observed only in the semantic instruction block. Interestingly, the effect of category was not modulated by task instruction. An independent component analysis showed that the component that made the greatest contribution to the effect of semantic matching in the time window of the N400-like potential had a scalp distribution similar to that reported for the N400 and was best fit as a bilateral generator in the superior temporal gyrus. The use of repetition could thus allow, at least in explicit semantic tasks, a drastic simplification of N400 protocols. Highly repeated individual words could be used to study semantic relations between individual concepts.

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

28

Rönnqvist, Mikael, Suda Tragantalerngsak, and John Holt. "A repeated matching heuristic for the single-source capacitated facility location problem." European Journal of Operational Research 116, no. 1 (July 1999): 51–68. http://dx.doi.org/10.1016/s0377-2217(98)00045-9.

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

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

29

Hasker, Kevin. "Social norms and choice: a weak folk theorem for repeated matching games." International Journal of Game Theory 36, no. 1 (April 5, 2007): 137–46. http://dx.doi.org/10.1007/s00182-007-0078-1.

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

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

30

Annen, Kurt. "Lies and slander: truth-telling in repeated matching games with private monitoring." Social Choice and Welfare 37, no. 2 (August 20, 2010): 269–85. http://dx.doi.org/10.1007/s00355-010-0493-2.

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

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

31

Qiao, Xiang Chen. "Research on the Algorithm of Image Matching Based on Improved SIFT." Applied Mechanics and Materials 686 (October 2014): 348–53. http://dx.doi.org/10.4028/www.scientific.net/amm.686.348.

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

Анотація:

The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching more points, high matching accuracy, no repeated points and higher advantage of matching efficiency based on keeping the basic characteristics of SIFT algorithm unchanged, and provides precise matching point to generate precise image stitching and other related fields of the follow-up product. At the same time, this method was applied to the layout optimization and achieved good results.

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

32

Huang, Zedong, Jinan Gu, Jing Li, and Xuefei Yu. "A stereo matching algorithm based on the improved PSMNet." PLOS ONE 16, no. 8 (August 19, 2021): e0251657. http://dx.doi.org/10.1371/journal.pone.0251657.

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

Анотація:

Deep learning based on a convolutional neural network (CNN) has been successfully applied to stereo matching. Compared with the traditional method, the speed and accuracy of this method have been greatly improved. However, the existing stereo matching framework based on a CNN often encounters two problems. First, the existing stereo matching network has many parameters, which leads to the matching running time being too long. Second, the disparity estimation is inadequate in some regions where reflections, repeated textures, and fine structures may lead to ill-posed problems. Through the lightweight improvement of the PSMNet (Pyramid Stereo Matching Network) model, the common matching effect of ill-conditioned areas such as repeated texture areas and weak texture areas is solved. In the feature extraction part, ResNeXt is introduced to learn unitary feature extraction, and the ASPP (Atrous Spatial Pyramid Pooling) module is trained to extract multiscale spatial feature information. The feature fusion module is designed to effectively fuse the feature information of different scales to construct the matching cost volume. The improved 3D CNN uses the stacked encoding and decoding structure to further regularize the matching cost volume and obtain the corresponding relationship between feature points under different parallax conditions. Finally, the disparity map is obtained by a regression. We evaluate our method on the Scene Flow, KITTI 2012, and KITTI 2015 stereo datasets. The experiments show that the proposed stereo matching network achieves a comparable prediction accuracy and much faster running speed compared with PSMNet.

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

33

Ding, Jing, Zhigang Yan, and Xuchen We. "High-Accuracy Recognition and Localization of Moving Targets in an Indoor Environment Using Binocular Stereo Vision." ISPRS International Journal of Geo-Information 10, no. 4 (April 6, 2021): 234. http://dx.doi.org/10.3390/ijgi10040234.

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

Анотація:

To obtain effective indoor moving target localization, a reliable and stable moving target localization method based on binocular stereo vision is proposed in this paper. A moving target recognition extraction algorithm, which integrates displacement pyramid Horn–Schunck (HS) optical flow, Delaunay triangulation and Otsu threshold segmentation, is presented to separate a moving target from a complex background, called the Otsu Delaunay HS (O-DHS) method. Additionally, a stereo matching algorithm based on deep matching and stereo vision is presented to obtain dense stereo matching points pairs, called stereo deep matching (S-DM). The stereo matching point pairs of the moving target were extracted with the moving target area and stereo deep matching point pairs, then the three dimensional coordinates of the points in the moving target area were reconstructed according to the principle of binocular vision’s parallel structure. Finally, the moving target was located by the centroid method. The experimental results showed that this method can better resist image noise and repeated texture, can effectively detect and separate moving targets, and can match stereo image points in repeated textured areas more accurately and stability. This method can effectively improve the effectiveness, accuracy and robustness of three-dimensional moving target coordinates.

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

34

Kinscher, J. L., F. De Santis, N. Poiata, P. Bernard, K. H. Palgunadi, and I. Contrucci. "Seismic repeaters linked to weak rock-mass creep in deep excavation mining." Geophysical Journal International 222, no. 1 (April 2, 2020): 110–31. http://dx.doi.org/10.1093/gji/ggaa150.

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

Анотація:

SUMMARY Seismic repeaters are a phenomenon rarely observed in mining environments. In this study, we show that repeaters and associated aseismic slip can be the governing mechanism behind seismic triggering in response to excavation mining, providing new perspectives for rethinking and improving standard procedures for seismic rock burst hazard assessment and mining monitoring. Evidence comes from an extensive multiplet analysis on dense spatiotemporal microseismic event clusters (−2.5 < Mw < 1) that was recorded by a local microseismic network at the Lappberget orebody in the Garpenberg mine in Sweden at around 1 km depth. Analysis involved template matching, clustering, double-difference relocation, source parameter and mechanism estimation, as well as interevent time analysis. The results show that almost 80 per cent of the analysed events can be interpreted as seismic repeaters. Source mechanisms demonstrate systematic strike-slip faulting with a significant reverse faulting component, indicating that triggering of the repeaters is sensitive to increases in the horizontal compressive stresses. We suggest that seismic repeaters represent brittle frictional parts (asperity) of creeping, planar shaped, pre-exiting structures of several metres composed of weak rock-mass materials (e.g. talc) associated with strengthening friction behaviours. This repeater model and the here used definition of asperity thus slightly differs from its meaning in classical seismological models where repeating events are related to the locked fault patches along a creeping fault. In addition, we identified different asperity types for the different repeater families that we interpret as different friction properties. Some multiplet families represent rather a transitional case between multiplet and repeater occurrences that might imply a mixture of weakening and strengthening friction processes, that is, creep and brittle rupture along neighboured plane shaped anisotropies in a heterogeneous rock mass. The exact nature of asperities and seismic and aseismic coupling of the rock mass as well as the propagation mechanism of strain and stress associated with short-term (days to weeks) and long-term (months to years) post-blast creep remains uncertain and needs to be addressed by future investigations. The understanding of these processes is particularly important for assessing hazard of larger dynamic ruptures.

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

35

Kääb, Andreas, Bernard Lefauconnier, and Kjetil Melvold. "Flow field of Kronebreen, Svalbard, using repeated Landsat 7 and ASTER data." Annals of Glaciology 42 (2005): 7–13. http://dx.doi.org/10.3189/172756405781812916.

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

Анотація:

AbstractKnowledge about the spatio-temporal distribution of fast-flowing Arctic glaciers is still limited. Kronebreen, Svalbard, in particular, includes the confluence − and the dynamic interplay − of the fast-flowing Kronebreen and the currently slow-flowing Kongsvegen. In this study, image-matching techniques on the basis of repeated Landsat 7 Enhanced Thematic Mapper Plus (ETM+) pan and Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) satellite data are applied in order to derive surface velocity fields of the lowermost 10 km of Kronebreen for the annual periods 1999/2000, 2000/01, 2001/02 and a 40 day period around July 2001. This work perfectly complements differential synthetic aperture radar interferometry (DInSAR) studies available for Kronebreen. A complete surface velocity field is now available from combining the DInSAR studies for the upper part of the glacier and the optical image-matching study presented here. The data obtained within this study are also compared to velocity data of 1964, 1986, 1990 and 1996. As also suggested by previous studies, a significant spatio-temporal variability of the spring/summer and annual ice speeds becomes evident.

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

36

Liang, Xuzhi, and Jijia Li. "Optimize Statistical Analysis via Propensity Score Matching and Repeated-Measures Analysis of Variance." JACC: Cardiovascular Interventions 16, no. 3 (February 2023): 361–62. http://dx.doi.org/10.1016/j.jcin.2022.11.017.

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

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

37

Xi, Tanping. "Design of English Diagnostic Practice Sentence Repetition Recognition System Based on Matching Tree and Edge Computing." Wireless Communications and Mobile Computing 2021 (February 9, 2021): 1–8. http://dx.doi.org/10.1155/2021/6651145.

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

Анотація:

English reading ability is an important indicator to measure learners’ English ability. However, because reading ability cannot be directly observed, people usually take tests to judge the reading ability of learners. Therefore, it is very necessary to design a reasonable diagnostic practice sentence repetition recognition system to analyze and test, inform learners of the advantages and disadvantages in reading, and give corresponding countermeasures. In order to properly solve the problem of repeated recognition of English diagnostic sentences, we have developed a new recognition system combined with matching tree and edge computing technology. First, the matching tree algorithm is used for the repetitive diagnosis of English sentences. The algorithm has achieved good results in the repetitive diagnosis and matching. Secondly, an English diagnostic practice sentence repetition recognition system architecture is built through edge computing algorithms, which improves the efficiency of the English diagnostic system. Finally, through the simulation test of the English diagnostic practice system, the applicability of the established repeated recognition model is verified.

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

38

Béna, Jérémy, Adrien Mierop, Douglas Bancu, Christian Unkelbach, and Olivier Corneille. "The Role of Valence Matching in the Truth-by-Repetition Effect." Social Cognition 41, no. 2 (April 2023): 193–207. http://dx.doi.org/10.1521/soco.2023.41.2.193.

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

Анотація:

People judge repeated information as truer than new information, a “truth-by-repetition” effect. Because repetition increases processing fluency, which is assumed to elicit positive affect, participants may match their positive experience associated with repeated information with a positive (“true”) rather than negative (“false”) response. We tested this valence-matching hypothesis in a preregistered experiment by manipulating the affective congruency of the response format. Specifically, in the congruent condition, participants had to select a positive (negative) picture to respond “true” (“false”). In the incongruent condition, we reversed these associations. In line with the valence matching hypothesis, the truth-by-repetition effect was larger in the congruent than incongruent condition. However, the effect was small, and Bayesian analyses were inconclusive. In addition, the truth-by-repetition effect was significant in both response format conditions. The results suggest a possible contribution of a valence matching process to the truth-by-repetition effect, but one that does not challenge extant models.

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

39

Shi, Zhao Ming, Bo Ying Geng, Zhong Hong Wu, and Yin Wen Dong. "An Image Matching Method Based on SIFT Feature." Applied Mechanics and Materials 170-173 (May 2012): 2855–59. http://dx.doi.org/10.4028/www.scientific.net/amm.170-173.2855.

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

Анотація:

Aiming at problems about repeat matching and wrong matching appeared when traditional SIFT algorithm was used in image matching, an image matching method based on SIFT feature was put forward. Firstly, SIFT features were extracted by traditional SIFT algorithm and candidate matching point pairs were obtained by the nearest neighbor rule. Secondly, lateral matching method was used to remove repeat matched dot-pairs. Finally, Mahalanobis distance as a similarity measurement was used to remove wrong matched dot-pairs. Experiment shows this method can achieve image matching effectively with high accuracy.

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

40

Abbas, A., and S. Ghuffar. "ROBUST FEATURE MATCHING IN TERRESTRIAL IMAGE SEQUENCES." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-3 (April 30, 2018): 3–7. http://dx.doi.org/10.5194/isprs-archives-xlii-3-3-2018.

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

Анотація:

From the last decade, the feature detection, description and matching techniques are most commonly exploited in various photogrammetric and computer vision applications, which includes: 3D reconstruction of scenes, image stitching for panoramic creation, image classification, or object recognition etc. However, in terrestrial imagery of urban scenes contains various issues, which include duplicate and identical structures (i.e. repeated windows and doors) that cause the problem in feature matching phase and ultimately lead to failure of results specially in case of camera pose and scene structure estimation. In this paper, we will address the issue related to ambiguous feature matching in urban environment due to repeating patterns.

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

41

Elangovan, Naveen, Amanda Herrmann, and Jürgen Konczak. "Assessing Proprioceptive Function: Evaluating Joint Position Matching Methods Against Psychophysical Thresholds." Physical Therapy 94, no. 4 (April 1, 2014): 553–61. http://dx.doi.org/10.2522/ptj.20130103.

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

Анотація:

Background The importance of assessing proprioceptive function for rehabilitation after neurological or orthopedic injury has long been recognized. Yet, neither the validity nor the accuracy of the available tests is firmly established. Testing typically involves repeated matching of a given joint position with the same or opposite limb where the difference between the 2 positions indicates proprioceptive acuity. Objectives The aim of this study was to compare position sense acuity between ipsilateral and contralateral matching methods against a psychophysical threshold method to establish the accuracy and relationships between these models. Design A repeated-measures design was used. Method Assessment of forearm position sense for a 10-degree reference position in 27 young adults who were healthy. Results Psychophysical thresholds were revealed to be the most precise and least variable acuity measure. The mean (±SD) threshold (1.05°±0.47°) was significantly lower than mean position errors obtained by both joint position matching tasks (ipsilateral: 1.51°±0.64°; contralateral: 1.84°±0.73°)—a 44% to 75% difference in measurement accuracy. Individual participant position errors correlated poorly with respective thresholds, indicating a lack of concurrent validity. Position errors for both matching methods correlated only mildly with each other. Limitations The data represent performance of a healthy, young adult cohort. Differences between methods will likely be more pronounced in aging and clinical populations. Conclusions Threshold testing and joint position matching methods examine different physiological aspects of proprioceptive function. Because threshold testing is based on passive motion, it most closely reflects afferent sensory feedback processing (ie, proprioception). Matching methods require active motion and are consequently influenced by additional sensorimotor processes. Factors such as working memory and transmission between brain hemispheres also influence joint matching task outcomes.

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

42

Yao, Yi Yong, and Li Ping Zhao. "Analysis on the Positioning Errors of Ink-Jet Printing Equipments Oriented to Three-Dimensional Microstructure." Key Engineering Materials 480-481 (June 2011): 950–55. http://dx.doi.org/10.4028/www.scientific.net/kem.480-481.950.

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

Анотація:

The repeated positioning accuracy of ink-jet printing equipments is the key influencing factor for the dimensional stability of flexible three-dimensional microstructure. To resolve the question of repeated positioning, this paper presents a matching recognition method of cross-circle’s center based on floating template, and introduces the formulas for positioning errors. Consequently, the present method can give a technical support for analysis on the dimensional stability of flexible three-dimensional microstructure.

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

43

Lee, Taemin, and Sanghyun Seo. "Painting-Emotion Matching Technology Learning System through Repetition." Sustainability 11, no. 16 (August 20, 2019): 4507. http://dx.doi.org/10.3390/su11164507.

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

Анотація:

People’s interest in paintings has increased as artists have easier access to an audience. However, at times, laypersons may not understand the significance of a painting. With the development of computer science, it has become possible to analyze paintings using machines, but some limitations remain. In this paper, we present a learning tool to help analyze the sensitivity of a given painting. To this end, the proposed system provides users with the ability to predict the emotions expressed by a painting through repeated learning of a matched painting. Using this learning tool, users can improve their ability to understand paintings.

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

44

Nazzi, Vittoria, Angelo Franzini, Giuseppe Messina, and Giovanni Broggi. "Carpal tunnel syndrome: matching minimally invasive surgical techniques." Journal of Neurosurgery 108, no. 5 (May 2008): 1033–36. http://dx.doi.org/10.3171/jns/2008/108/5/1033.

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

Анотація:

✓In the past few years, several different minimally invasive surgical techniques have been proposed to decompress the median nerve at the wrist. Use of these techniques has become widespread due to fewer local complications, faster functional recovery, and reduced surgical time. In this paper the authors compare 3 different minimally invasive surgical techniques used at their institution in the past 13 years. Between January 1994 and January 2007, 891 patients underwent 1272 surgeries at the authors' institution for carpal tunnel syndrome (CTS), for which a minimally invasive technique was used. In 473 cases (Group A), the transillumination technique with a single wrist incision and a “carpalotome” (a modified Paine retinaculotome) was used; in 216 cases (Group B), transillumination was abandoned and a single linear wrist incision for access with the carpalotome was performed; and in 583 cases (Group C), the techniques were further modified by making a second incision in the palm using the carpalotome. All 3 groups of patients were homogeneous for age, sex, and duration of the symptomatology. In 90% of the patients in Group A, in 88% of those in Group B, and 99.8% of patients in Group C, complete remission of symptoms was obtained. Due to persistence of symptoms, 44 patients in Group A, 24 in Group B, and only 1 in Group C underwent a repeated operation with the open technique. The only surgical complication requiring repeated operation of the 1272 operations was a lesion of the primitive median artery (1 patient in Group C). The technique of median nerve decompression at the wrist that was used for patients in Group C represents a valid alternative for treatment of CTS.

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

45

Cardany, Audrey Berger. "Favorite Children’s Books for Vocal Exploration and Pitch-Matching Activities." General Music Today 30, no. 3 (January 10, 2017): 22–25. http://dx.doi.org/10.1177/1048371316687607.

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

Анотація:

In this article, the author shares favorite children’s books and stories for integrating language and music during shared-book experiences. The music activities described are aimed to contribute to the overall singing development for children in preschool and primary grades. Music and reading teachers will enjoy sharing these books with early readers in ways that foster expressive speaking and singing through vocal exploration and singing repeated melodic patterns.

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

46

Wunderlich, Robert, Alwina Stein, Alva Engell, Pia Lau, Lea Waasem, Alex Shaykevich, Claudia Rudack, and Christo Pantev. "Evaluation of iPod-Based Automated Tinnitus Pitch Matching." Journal of the American Academy of Audiology 26, no. 02 (February 2015): 205–12. http://dx.doi.org/10.3766/jaaa.26.2.9.

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

Анотація:

Background: Tinnitus is the perception of sound unrelated to any external source. Diagnostic approaches to assess tinnitus characteristics such as tinnitus pitch are crucial for new attempts of tinnitus therapy. Purpose: The purpose of this study was to develop and evaluate reliable tinnitus pitch-matching procedures. Existing procedures usually require audiometric equipment and are time consuming. However, some patients with tinnitus find it hard to match their tinnitus in one single session. Therefore, we developed an iPod-based application for self-administered tinnitus pitch matching and compared it with a standardized audiometric procedure. Study Sample: A total of 17 patients with chronic tonal tinnitus participated in two sessions including both pitch-matching procedures. Method: In the conventional audiometric test, the investigator adjusted the frequency and loudness of pure tones led by the responses of the patient. For the iPod-based procedure, we used a recursive two-interval forced-choice test that required no interaction with an investigator. Both procedures included loudness matching and testing for octave confusion. Results: The iPod-based procedure resulted in lower pitch matches as compared with the conventional audiometry. Psychometric qualities such as test-retest reliability of both methods were comparable. Participants rated the iPod-based procedure as easier to perform and more comfortable to use. Conclusions: In conclusion, we find that the use of self-administered tinnitus pitch-matching procedures on a mobile device is feasible and easier in practice without any loss of reliability and validity. A major advantage is the possibility of repeated measurements without expensive equipment and experienced staff. Repeated measurements of tinnitus pitch can provide more information about the stability of the tinnitus perception and may improve the ability of participants to match their tinnitus.

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

47

Bolle, Friedel, and Philipp E. Otto. "Matching as a Stochastic Process." Jahrbücher für Nationalökonomie und Statistik 236, no. 3 (May 1, 2016): 323–48. http://dx.doi.org/10.1515/jbnst-2015-1017.

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

Анотація:

Abstract Results of multi-party bargaining are usually described by concepts from cooperative game theory, in particular by the core. In one-on-one matching, core allocations are stable in the sense that no pair of unmatched or otherwise matched players can improve their incomes by forming a match. Because of incomplete information and bounded rationality, it is difficult to adopt a core allocation immediately. Theoretical investigations cope with the problem of whether core allocations can be adopted in a stochastic process with repeated re-matching. In this paper, we investigate sequences of matching with data from an experimental 2×2 labor market with wage negotiations. This market has seven possible matching structures (states) and is additionally characterized by the negotiated wages and profits. First, we describe the stochastic process of transitions from one state to another including the average transition times. Second, we identify different influences on the process parameters as, for example, the difference of incomes in a match. Third, allocations in the core should be completely durable or at least more durable than comparable out-of-core allocations, but they are not. Final bargaining results (induced by a time limit) appear as snapshots of a stochastic process without absorbing states and with only weak systematic influences.

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

48

Yang, Xu, Xiao Long Liu, Ji Ming Liu, Shi Jun Ji, Xing Tian Qu, and Zhi Yu Zhang. "Matching Algorithm for Profile Error Calculation of Blade Surface." Advanced Materials Research 1136 (January 2016): 630–35. http://dx.doi.org/10.4028/www.scientific.net/amr.1136.630.

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

Анотація:

The blade is one of the key part of aero engine because its shape precision and surface quality significantly influence the performance, efficiency and reliability of the engine. The blade surface is generally obtained by precision finishing process, which is a repeated work of profile error measurement, profile error calculation and error correction manufacturing. For profile error calculation, the matching of measurement points and ideal blade surface must be firstly performed. However there is few detailed work reported on matching algorithm. In this paper, a new matching algorithm for profile error calculation was proposed. Firstly, the coarse matching method based on characteristics of blade section curves between measurement points and its corresponding ideal section curve was studied. Then the Sigular Value Decomposition (SVD)-Iterative Closest Point (ICP) precision matching method was adopted to improve the matching precision. After that, the weight calculation method was applied to balance the profile errors among different section curves. Simulation work was performed to validate the proposed matching algorithm. Results shows that micrometer-order matching accuracy of the blade section curves could be obtained through the above-mentioned three matching steps.

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

49

RICE, STEPHEN V., JUNICHI KANAI, and THOMAS A. NARTKER. "AN ALGORITHM FOR MATCHING OCR-GENERATED TEXT STRINGS." International Journal of Pattern Recognition and Artificial Intelligence 08, no. 05 (October 1994): 1259–68. http://dx.doi.org/10.1142/s0218001494000632.

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

Анотація:

When optical character recognition (OCR) devices process the same page image, they generate similar text strings. Differences are due to recognition errors. A page of text rarely contains long repeated substrings; therefore, N strings generated by OCR devices can be quickly matched by detecting long common substrings. An algorithm for matching an arbitrary number of strings based on this principle is presented. Although its worst-case performance is O(Nn2), its performance in practice has been observed to be O(Nn log n), where n is the length of a string. This algorithm has been successfully used to study OCR errors, to determine the accuracy of OCR devices, and to implement a voting algorithm.

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

50

Lindsey, B. G., K. F. Morris, R. Shannon, and G. L. Gerstein. "Repeated Patterns of Distributed Synchrony in Neuronal Assemblies." Journal of Neurophysiology 78, no. 3 (September 1, 1997): 1714–19. http://dx.doi.org/10.1152/jn.1997.78.3.1714.

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

Анотація:

Lindsey, B. G., K. F. Morris, R. Shannon, and G. L. Gerstein. Repeated patterns of distributed synchrony in neuronal assemblies. J. Neurophysiol. 78: 1714–1719, 1997. Models of brain function predict that the recurrence of a process or state will be reflected in repeated patterns of correlated activity. Previous work on medullary raphe assembly dynamics revealed transient changes inimpulse synchrony. This study tested the hypothesis that these variations in synchrony include distributed nonrandom patterns of association. Spike trains were recorded simultaneously in the ventrolateral medulla, n. raphe obscurus, and n. raphe magnus of four anesthetized (Dial), vagotomized, paralyzed, and artificially ventilated adult cats. The “gravitational” representation of spike trains was used to detect moments of impulse synchrony in neuronal assemblies visualized as variations in the aggregation velocities of particles corresponding to each neuron. Template matching algorithms were developed to identify excessively repeating patterns of particle condensation rates. Repeating patterns weredetected in each animal. The reiterated patterns represented anemergent property not apparent in either corresponding firing rate histograms or conventional gravity representations. Overlapping subsets of neurons represented in different patterns were unmasked when the template resolution was changed. The results demonstrate repeated transient network configurations defined by the tightness and duration of synchrony in different combinations of neurons and suggest that multiple information streams are conveyed concurrently by fluctuations in the synchrony of on-going activity.

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

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