Moore, Daniel R; Young, Mark; Phillips, Stuart M
2012-04-01
Training exclusively with eccentric (lengthening) contractions can result in greater muscular adaptations than training with concentric (shortening) contractions. We aimed to determine whether training-induced increases in muscle size and strength differed between muscles performing maximal lengthening (LC) or maximal shortening (SC) contractions when total external work is equivalent. Nine healthy young males completed a 9-week isokinetic (0.79 rad/s) resistance training program of the elbow flexors whereby they performed LC with one arm and an equivalent volume of total external work with the contralateral arm as SC. Training increased isometric peak torque for both LC (~10%) and SC (~20%) with no difference (P = 0.14) between conditions. There were also similar increases in isokinetic peak torque at both slow (0.79 rad/s) and fast (5.24 rad/s) shortening and lengthening peak torque for both LC (~8-10%) and SC (~9-20%). Training increased work per repetition similarly for both LC (~17%) and SC (~22%), in spite of ~40% greater work per repetition with LC. The increase in muscle cross-sectional area with training was also similar (P = 0.37) between LC (~6.5%) and SC (~4.6%). We conclude that increases in muscle size and strength with short-term unilateral resistance training are unrelated to muscle contraction type when matched for both exercise intensity (i.e. maximal contractions) and total external work.
Limiting distribution of maximal crossing and nesting of Poissonized random matchings
Baik, Jinho
2011-01-01
The notion of r-crossing and r-nesting of a complete match- ing was introduced and a symmetry property was proved by Chen, Deng, Du, Stanley and Yan in 2007. We consider random matchings of large size and study the maximal crossing and the maximal nesting. It is known that the marginal distribution of each of them converges to the GOE Tracy-Widom distribution. We show that the maximal crossing and the maximal nesting becomes independent asymptotically, and eval- uate the joint distribution for the Poissonized random matchings explic- itly to the first correction term. This leads to an evaluation of the asymptotic of the covariance. Furthermore, we compute the explicit second correction term of the distributions function of two ob jects: (a) the length of the longest increasing subsequence of Poissonized random permutation and (b) the maximal crossing, and hence also the maximal nesting, of Poissonized random matching.
Maximizing switching current of superconductor nanowires via improved impedance matching
Zhang, Labao; Yan, Xiachao; Jia, Xiaoqing; Chen, Jian; Kang, Lin; Wu, Peiheng
2017-02-01
The temporary resistance triggered by phase slips will result in the switching of a superconductor nanowire to a permanent normal state, decreasing the switching current. In this letter, we propose an improved impedance matching circuit that releases the transition triggered by phase slips to the load resistor through the radio frequency (RF) port of a bias tee. The transportation properties with different load resistors indicate that the switching current decreases due to the reflection caused by impedance mismatching, and it is maximized by optimized impedance matching. Compared to the same setup without the impedance matching circuit, the switching current was increased from 8.0 μA to 12.2 μA in a niobium nitride nanowire after releasing the temporary transition triggered by phase slips. The leakage process with impedance matching outputs a voltage pulse, which enables the user to directly register the transition triggered by phase slips. The technique for maximizing the switching current has a potential practical application in superconductor devices, and the technique for counting phase slips may be applied to explore the behavior of phase slips.
Maximal pore size in UF membranes
Arkhangelsky, E.; Duek, A.; Gitis, V.
2012-01-01
The ultrafiltration membrane rejection capability is most often characterized by molecular weight cutoff (MWCO). The value is found by rejection of organic solutes and the evaluation of particle retention requires a conversion of either MWCO to pore size or particle diameter to molecular weight. The
Anton Antonov
Full Text Available BACKGROUND: Avian brood parasites and their hosts are involved in complex offence-defense coevolutionary arms races. The most common pair of reciprocal adaptations in these systems is egg discrimination by hosts and egg mimicry by parasites. As mimicry improves, more advanced host adaptations evolve such as decreased intra- and increased interclutch variation in egg appearance to facilitate detection of parasitic eggs. As interclutch variation increases, parasites able to choose hosts matching best their own egg phenotype should be selected, but this requires that parasites know their own egg phenotype and select host nests correspondingly. METHODOLOGY/PRINCIPAL FINDINGS: We compared egg mimicry of common cuckoo Cuculus canorus eggs in naturally parasitized marsh warbler Acrocephalus palustris nests and their nearest unparasitized conspecific neighbors having similar laying dates and nest-site characteristics. Modeling of avian vision and image analyses revealed no evidence that cuckoos parasitize nests where their eggs better match the host eggs. Cuckoo eggs were as good mimics, in terms of background and spot color, background luminance, spotting pattern and egg size, of host eggs in the nests actually exploited as those in the neighboring unparasitized nests. CONCLUSIONS/SIGNIFICANCE: We reviewed the evidence for brood parasites selecting better-matching host egg phenotypes from several relevant studies and argue that such selection probably cannot exist in host-parasite systems where host interclutch variation is continuous and overall low or moderate. To date there is also no evidence that parasites prefer certain egg phenotypes in systems where it should be most advantageous, i.e., when both hosts and parasites lay polymorphic eggs. Hence, the existence of an ability to select host nests to maximize mimicry by brood parasites appears unlikely, but this possibility should be further explored in cuckoo-host systems where the host has evolved
Khan, Zia; Bloom, Joshua S.; Kruglyak, Leonid; Singh, Mona
2009-01-01
Motivation: High-throughput sequencing technologies place ever increasing demands on existing algorithms for sequence analysis. Algorithms for computing maximal exact matches (MEMs) between sequences appear in two contexts where high-throughput sequencing will vastly increase the volume of sequence data: (i) seeding alignments of high-throughput reads for genome assembly and (ii) designating anchor points for genome–genome comparisons.
Harteveld, M.L. van
2007-01-01
Optimization of total body irradiation: the match between (maximal) leukemic cell kill and (minimal) late effects: In this thesis, cataract formation and renal dysfunction as late effects of high-dose total body irradiation (TBI) as part of the conditioning before hematological stem cell transplanta
Method of Word Segmentation in Laos Based on Maximal Matching of Syllables
Huo Wenjie
2017-01-01
Full Text Available Word segmentation is an important support of semantic analysis, Machine Translation, QA, knowledge mapping research work, mainly used in information retrieval, text processing, data processing and many other areas of Natural Language Processing. Therefore, the realization of word segmentation is a very meaningful work. The method of this paper is to segment the syllables of the text corpus of Lao language and complete the maximal matching of syllables and dictionaries. Then match the results of the word segmentation and the error dictionary, and correct some wrong words by the error dictionary. Finally, we use regular expressions to match the corresponding word strings in segmentation results and correct the wrong words by some artificially formulated rules of the alphabet, numbers, etc. in the Lao language. It can improve the efficiency and accuracy rate of Laos Word Segmentation.
Size matching in lung transplantation using predicted total lung capacity
Ouwens, JP; van der Mark, TW; van der Bij, W; Koeter, GH
2002-01-01
Height is used in allocation of donor lungs as an indirect estimate of thoracic size. Total lung capacity (TLC), determined by both height and sex, could be a more accurate functional estimation of thoracic size. Size-matching criteria based on height versus predicted TLC was retrospectively evaluat
Size matching in lung transplantation using predicted total lung capacity
Ouwens, JP; van der Mark, TW; van der Bij, W; Koeter, GH
2002-01-01
Height is used in allocation of donor lungs as an indirect estimate of thoracic size. Total lung capacity (TLC), determined by both height and sex, could be a more accurate functional estimation of thoracic size. Size-matching criteria based on height versus predicted TLC was retrospectively
Size matching in lung transplantation using predicted total lung capacity
Ouwens, JP; van der Mark, TW; van der Bij, W; Koeter, GH
2002-01-01
Height is used in allocation of donor lungs as an indirect estimate of thoracic size. Total lung capacity (TLC), determined by both height and sex, could be a more accurate functional estimation of thoracic size. Size-matching criteria based on height versus predicted TLC was retrospectively evaluat
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.
Huan-Kai Peng
Full Text Available In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.
Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu
2016-01-01
In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.
Distributed Matching Algorithms: Maximizing Secrecy in the Presence of Untrusted Relay
B. Ali
2017-06-01
Full Text Available In this paper, we propose a secrecy sum-rate maximization based matching algorithm between primary transmitters and secondary cooperative jammers in the presence of an eavesdropper. More explicitly, we consider an untrusted relay scenario, where the relay is a potential eavesdropper. We first show the achievable secrecy regions employing a friendly jammer in a cooperative scenario with employing an untrusted relay. Then, we provide results for the secrecy regions for two scenarios, where in the first case we consider no direct transmission between the source and the destination, while in the second case we include a source to destination direct link in our communication system. Furthermore, a friendly jammer helps to send a noise signal during the first phase of the cooperative transmission, for securing the information transmitted from the source. In our matching algorithm, the selected cooperative jammer or the secondary user, is rewarded with the spectrum allocation for a fraction of time slot from the source which is the primary user. The Conventional Distributed Algorithm (CDA and the Pragmatic Distributed Algorithm (PDA, which were originally designed for maximising the user’s sum rate, are modified and adapted for maximizing the secrecy sum-rate for the primary user. Instead of assuming perfect modulation and/or perfect channel coding, we have also investigated our proposed schemes when practical channel coding and modulation schemes are invoked.
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Kanizo, Yossi; Keslassy, Isaac
2010-01-01
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash storing the elements that cannot fit into the main hash table due to collisions. However, the exact required size of the stash and the tradeoff between its size and the memory over-provisioning of the hash table are still unknown. We settle this question by investigating the equivalent maximum matching size of a random bipartite graph, with a constant left-side vertex degree $d=2$. Specifically, we provide an exact expression for the expected maximum matching size and show that its actual size is close to its mean, with high probability. This result relies on decomposing the bipartite graph into connected components, and then separately evaluating the distribution of the matching size in each of these components. In particular, we provide an exact expression for any finite bipartite graph size and also deduce asymptotic results as the nu...
Maximal sequence length of exact match between members from a gene family during early evolution
WEN Xiao; GUO Xing-yi; FAN Long-jiang
2005-01-01
Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In this work, MALE changes between members of 26 gene families from four representative species (Arabidopsis thaliana, Oryza sativa, Mus musculus and Homo sapiens) were investigated. Comparative study ofparalogous' MALE and amino acid substitution rate (dA＜0.5)indicated that a close relationship existed between them. The results suggested that MALE could be a sound evolutionary scale for the divergent time for paralogous genes during their early evolution. A reference table between MALE and divergent time for the four species was set up, which would be useful widely, for large-scale genome alignment and comparison. As an example, detection of large-scale duplication events of rice genome based on the table was illustrated.
Size matters: abundance matching, galaxy sizes, and the Tully-Fisher relation in EAGLE
Ferrero, Ismael; Abadi, Mario G; Sales, Laura V; Bower, Richard G; Crain, Robert A; Frenk, Carlos S; Schaller, Matthieu; Schaye, Joop; Theuns, Tom
2016-01-01
The Tully-Fisher relation (TFR) links the stellar mass of a disk galaxy, $M_{\\rm str}$, to its rotation speed: it is well approximated by a power law, shows little scatter, and evolves weakly with redshift. The relation has been interpreted as reflecting the mass-velocity scaling ($M\\propto V^3$) of dark matter halos, but this interpretation has been called into question by abundance-matching (AM) models, which predict the galaxy-halo mass relation to be non-monotonic and rapidy evolving. We study the TFR of luminous spirals and its relation to AM using the EAGLE set of $\\Lambda$CDM cosmological simulations. Matching both relations requires disk sizes to satisfy constraints given by the concentration of halos and their response to galaxy assembly. EAGLE galaxies approximately match these constraints and show a tight mass-velocity scaling that compares favourably with the observed TFR. The TFR is degenerate to changes in galaxy formation efficiency and the mass-size relation; simulations that fail to match the...
The rank-size scaling law and entropy-maximizing principle
Chen, Yanguang
2012-02-01
The rank-size regularity known as Zipf's law is one of the scaling laws and is frequently observed in the natural living world and social institutions. Many scientists have tried to derive the rank-size scaling relation through entropy-maximizing methods, but they have not been entirely successful. By introducing a pivotal constraint condition, I present here a set of new derivations based on the self-similar hierarchy of cities. First, I derive a pair of exponent laws by postulating local entropy maximizing. From the two exponential laws follows a general hierarchical scaling law, which implies the general form of Zipf's law. Second, I derive a special hierarchical scaling law with the exponent equal to 1 by postulating global entropy maximizing, and this implies the pure form of Zipf's law. The rank-size scaling law has proven to be one of the special cases of the hierarchical scaling law, and the derivation suggests a certain scaling range with the first or the last data point as an outlier. The entropy maximization of social systems differs from the notion of entropy increase in thermodynamics. For urban systems, entropy maximizing suggests the greatest equilibrium between equity for parts/individuals and efficiency of the whole.
El-Alayli, Amani
2006-12-01
Previous research has shown that matching person variables with achievement contexts can produce the best motivational outcomes. The current study examines whether this is also true when matching entity and incremental beliefs with the appropriate motivational climate. Participants were led to believe that a personal attribute was fixed (entity belief) or malleable (incremental belief). After thinking that they failed a test that assessed the attribute, participants performed a second (related) task in a context that facilitated the pursuit of either performance or learning goals. Participants were expected to exhibit greater effort on the second task in the congruent conditions (entity belief plus performance goal climate and incremental belief plus learning goal climate) than in the incongruent conditions. These results were obtained, but only for participants who either valued competence on the attribute or had high achievement motivation. Results are discussed in terms of developing strategies for optimizing motivation in achievement settings.
The Rank-Size Scaling Law and Entropy-Maximizing Principle
Chen, Yanguang
2011-01-01
The rank-size regularity known as Zipf's law is one of scaling laws and frequently observed within the natural living world and in social institutions. Many scientists tried to derive the rank-size scaling relation by entropy-maximizing methods, but the problem failed to be resolved thoroughly. By introducing a pivotal constraint condition, I present here a set of new derivations based on the self-similar hierarchy of cities. First, I derive a pair of exponent laws by postulating local entropy maximizing. From the two exponential laws follows a general hierarchical scaling law, which implies general Zipf's law. Second, I derive a special hierarchical scaling law with exponent equal to 1 by postulating global entropy maximizing, and this implies the strong form of Zipf's law. The rank-size scaling law proved to be one of the special cases of the hierarchical law, and the derivation suggests a certain scaling range with the first or last data point as an outlier. The entropy maximization of social systems diffe...
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average
Blelloch, Guy; Shun, Julian
2012-01-01
The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in arbitrary order adding a vertex to the resulting set if and only if no previous neighboring vertex has been added. In this loop, as in many sequential loops, each iterate will only depend directly on a subset of the previous iterates (i.e. knowing that any one of a vertices neighbors is in the MIS or knowing that it has no previous neighbors is sufficient to decide its fate). This leads to a dependence structure among the iterates. If this structure is shallow then running the iterates in parallel while respecting the dependencies can lead to an efficient parallel implementation mimicking the sequential algorithm. In this paper, we show that for any graph, and for a random ordering of the vertices, the dependence depth of the sequential greedy MIS algorithm is polylogarithmic (O(log^2 n) with high probability). Our results extend previous results that show polylogarithmic bounds only for random graphs. We show similar...
Flight and size constraints: hovering performance of large hummingbirds under maximal loading.
Chai, P; Millard, D
1997-11-01
As the smallest birds, hummingbirds are the only birds capable of prolonged hovering. This suggests that hovering locomotion scales unfavourably with size. Is the hovering performance of larger hummingbird species more constrained by size than that of smaller ones? Maximal load-lifting capacities of the two largest species of hummingbirds found in the United States, the blue-throated (Lampornis clemenciae, 8.4 g) and magnificent (Eugenes fulgens, 7.4 g) hummingbird, as well as the two other local small species, the black-chinned (Archilochus alexandri, 3.0 g) and rufus (Selasphorus rufus, 3.3 g) hummingbird, were determined under conditions of short-burst performance. The power reserves of hummingbirds are substantial relative to normal hovering performance. The two large species lifted maximal loads close to twice their body mass for a very brief duration of over 0.4 s. The small species lifted maximal loads approximately equal to their own mass with a longer duration of over 0.6 s. For the two large species under maximal loading, estimates of burst muscle mass-specific mechanical power output assuming perfect elastic energy storage averaged 309 W kg-1, compared with 75 W kg-1 during free hovering without loading. For the two small species, these values were 228 W kg-1 and 88 W kg-1, respectively. The differences in aerodynamic force production and power output between the large and small size classes occur despite their similar wing stroke velocity. This indicates that, during burst performance in these hummingbirds, the larger ones had a higher load-lifting capacity and generated more muscle power. In spite of the twofold difference in body mass, both large and small hummingbirds have evolved to become potent aerial competitors in order to exploit their common food resource, nectar. Both size classes have evolved to cope with the multi-dimensional effects of size constraining their aerodynamics, muscle mechanics, metabolism and ecology.
Improved particle size estimation in digital holography via sign matched filtering.
Lu, Jiang; Shaw, Raymond A; Yang, Weidong
2012-06-04
A matched filter method is provided for obtaining improved particle size estimates from digital in-line holograms. This improvement is relative to conventional reconstruction and pixel counting methods for particle size estimation, which is greatly limited by the CCD camera pixel size. The proposed method is based on iterative application of a sign matched filter in the Fourier domain, with sign meaning the matched filter takes values of ±1 depending on the sign of the angular spectrum of the particle aperture function. Using simulated data the method is demonstrated to work for particle diameters several times the pixel size. Holograms of piezoelectrically generated water droplets taken in the laboratory show greatly improved particle size measurements. The method is robust to additive noise and can be applied to real holograms over a wide range of matched-filter particle sizes.
Natural female mating rate maximizes hatchling size in a marine invertebrate.
Sprenger, D; Faber, J; Michiels, N K; Anthes, N
2008-07-01
1. Males and females often differ in their optimal mating rates, resulting potentially in conflicts over remating. In species with separate sexes, females typically have a lower optimal mating rate than males, and can regulate contacts with males accordingly. The realized mating rate may therefore be closer to the female's optimum. In simultaneous hermaphrodites, however, it has been suggested that the intraindividual optimization between 'male' and 'female' interests generates more 'male'-driven mating rates. 2. In order to assess the consequences of variation in mating rate on 'female' reproductive output, we exposed the simultaneously hermaphroditic sea slug Chelidonura sandrana to four mating rate regimes and recorded the effects on a variety of fitness components. 3. In focal 'females', we found (i) a slight but significant linear decrease in fecundity with mating rate, whereas (ii) maternal investment in egg capsule volume peaked at an intermediate mating rate. 4. Combining the observed fecundity cost with the apparent benefits of larger offspring size suggests that total female fitness is maximized at an intermediate mating rate. With the latter being close to the natural mating rate of C. sandrana in the field, our findings challenge the assumption of 'male'-driven mating systems in simultaneous hermaphrodites. 5. Our study provides experimental evidence for various mathematical models in which female fitness is maximized at intermediate mating rates.
Zhang, Chi; Wang, Long-Fei; Yue, Yuan; Yu, Lian-Chun
2015-01-01
Energy efficiency is closely related to the evolution of biological systems and is important to their information processing. In this paper, we calculated the excitation probability of a simple model of a bistable biological unit in response to pulsatile inputs, and its spontaneous excitation rate due to noise perturbation. Then we analytically calculated the mutual information, energy cost, and energy efficiency of an array of these bistable units. We found that the optimal number of units could maximize this array's energy efficiency in encoding pulse inputs, which depends on the fixed energy cost. We conclude that demand for energy efficiency in biological systems may strongly influence the size of these systems under the pressure of natural selection.
PROFIT MAXIMIZATION AND OPTIMAL SIZING OF RENEWABLE ENERGY SOURCES IN A HYBRID SYSTEM
YAJVENDER PAL VERMA
2010-09-01
Full Text Available The renewable energy sources wind, solar etc. have become very essential and important in the generation mix as a result of rising energy demand and environmental reasons. In addition tax is being imposed on high carbon emission. But the uncertainty and variability associated with renewable such as wind may result in economical andtechnical problems in the power system. In order to compensate wind intermittency, generation resources such as gas plant, pumped storage unit etc. are employed due to their lesser start up time, lower operating cost and good ramping capabilities. This paper proposes a model which investigates the combined operation of thermal, wind andpumped storage units for the profit maximization in varying wind, load, and price scenarios. The optimal size of the pumped storage unit to be used has been obtained after putting the system to different operating conditions such as varying wind power and load demand, imposing tax on carbon emission and varying ramping limits etc. The model has been applied on IEEE-30 bus test data and satisfactory results have been obtained for optimal hybrid systemoperation.
Jan Kubanek
2015-10-01
Full Text Available When faced with a choice, humans and animals commonly distribute their behavior in proportion to the frequency of payoff of each option. Such behavior is referred to as matching and has been captured by the matching law. However, matching is not a general law of economic choice. Matching in its strict sense seems to be specifically observed in tasks whose properties make matching an optimal or a near-optimal strategy. We engaged monkeys in a foraging task in which matching was not the optimal strategy. Over-matching the proportions of the mean offered reward magnitudes would yield more reward than matching, yet, surprisingly, the animals almost exactly matched them. To gain insight into this phenomenon, we modeled the animals' decision-making using a mechanistic model. The model accounted for the animals' macroscopic and microscopic choice behavior. When the models' three parameters were not constrained to mimic the monkeys' behavior, the model over-matched the reward proportions and in doing so, harvested substantially more reward than the monkeys. This optimized model revealed a marked bottleneck in the monkeys' choice function that compares the value of the two options. The model featured a very steep value comparison function relative to that of the monkeys. The steepness of the value comparison function had a profound effect on the earned reward and on the level of matching. We implemented this value comparison function through responses of simulated biological neurons. We found that due to the presence of neural noise, steepening the value comparison requires an exponential increase in the number of value-coding neurons. Matching may be a compromise between harvesting satisfactory reward and the high demands placed by neural noise on optimal neural computation.
Clemente, Christofer J; Withers, Philip C; Thompson, Graham
2012-01-01
Studies of locomotor performance often link variation in morphology with ecology. While maximum sprint speed is a commonly used performance variable, the absolute limits for this performance trait are not completely understood. Absolute maximal speed has often been shown to increase linearly with body size, but several comparative studies covering a large range of body sizes suggest that maximal speed does not increase indefinitely with body mass but rather reaches an optimum after which speed declines. Because of the comparative nature of these studies, it is difficult to determine whether this decrease is due to biomechanical constraints on maximal speed or is a consequence of phylogenetic inertia or perhaps relaxed selection for lower maximal speed at large body size. To explore this issue, we have examined intraspecific variations in morphology, maximal sprint speed, and kinematics for the yellow-spotted monitor lizard Varanus panoptes, which varied in body mass from 0.09 to 5.75 kg. We show a curvilinear relationship between body size and absolute maximal sprint speed with an optimal body mass with respect to speed of 1.245 kg. This excludes the phylogenetic inertia hypothesis, because this effect should be absent intraspecifically, while supporting the biomechanical constraints hypothesis. The relaxed selection hypothesis cannot be excluded if there is a size-based behavioral shift intraspecifically, but the biomechanical constraints hypothesis is better supported from kinematic analyses. Kinematic measurements of hind limb movement suggest that the distance moved by the body during the stance phase may limit maximum speed. This limit is thought to be imposed by a decreased ability of the bones and muscles to support body mass for larger lizards.
Dalton, Brian H; Power, Geoffrey A; Paturel, Justin R; Rice, Charles L
2015-06-01
The underlying factors related to the divergent findings of age-related fatigue for dynamic tasks are not well understood. The purpose here was to investigate age-related fatigability and recovery between a repeated constrained (isokinetic) and an unconstrained velocity (isotonic) task, in which participants performed fatiguing contractions at the velocity (isokinetic) or resistance (isotonic) corresponding with maximal power. To compare between tasks, isotonic torque-power relationships were constructed prior to and following both fatiguing tasks and during short-term recovery. Contractile properties were recorded from 9 old (~75 years) and 11 young (~25 years) men during three testing sessions. In the first session, maximal power was assessed, and sessions 2 and 3 involved an isokinetic or an isotonic concentric fatigue task performed until maximal power was reduced by 40 %. Compared with young, the older men performed the same number of contractions to task failure for the isokinetic task (~45 contractions), but 20 % fewer for the isotonic task (p contraction strength, angular velocity, and power were reduced by ~30, ~13, and ~25 %, respectively, immediately following task failure, and only isometric torque was not recovered fully by 10 min. In conclusion, older men are more fatigable than the young when performing a repetitive maximal dynamic task at a relative resistance (isotonic) but not an absolute velocity (isokinetic), corresponding to maximal power.
2011-01-01
International audience; In this paper, we studied the potential of thermoelectric generation from human body heat. The main objective is to maximize the thermoelectric productivity while minimizing the volume of the generator incorporating or not a heat sink, with a view to charging an accumulator which itself supplies a consumer electronic device such as a communicating sensor. The sizing of such a device should be done with a system-level approach where the thermal coupling with the environ...
Brendle, Joerg
2016-01-01
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with countable levels. Our results answer several questions of Campero, Cancino, Hrusak, and Miranda.
Naparstek, Oshri; Leshem, Amir
2013-01-01
In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of the auction algorithm for bipartite matching is $O\\left(\\frac{N\\log^2(N)}{\\log\\left(Np\\right)}\\right)$ on sequential machines. This is equivalent to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with $O(\\log(N))$ processors an...
Brian H. Dalton; Geoffrey A Power; Paturel, Justin R.; Rice, Charles L.
2015-01-01
The underlying factors related to the divergent findings of age-related fatigue for dynamic tasks are not well understood. The purpose here was to investigate age-related fatigability and recovery between a repeated constrained (isokinetic) and an unconstrained velocity (isotonic) task, in which participants performed fatiguing contractions at the velocity (isokinetic) or resistance (isotonic) corresponding with maximal power. To compare between tasks, isotonic torque–power relationships were...
Crystalline capsules: metal-organic frameworks locked by size-matching ligand bolts.
Wang, Hao; Xu, Jian; Zhang, Da-Shuai; Chen, Qiang; Wen, Rong-Mei; Chang, Ze; Bu, Xian-He
2015-05-11
Metal-organic frameworks (MOFs) are shown to be good examples of a new class of crystalline porous materials for guest encapsulation. Since the encapsulation/release of guest molecules in MOF hosts is a reversible process in nature, how to prevent the leaching of guests from the open pores with minimal and nondestructive modifications of the structure is a critical issue. To address this issue, we herein propose a novel strategy of encapsulating guests by introducing size-matching organic ligands as bolts to lock the pores of the MOFs through deliberately anchoring onto the open metal sites in the pores. Our proposed strategy provides a mechanical way to prevent the leaching of guests and thereby has less dependence on the specific chemical environment of the hosts, thus making it applicable for a wide variety of existing MOFs once the size-matching ligands are employed.
Prof. Nar Singh
2016-05-01
Full Text Available In area of video compression, Motion Estimation is one of the most important modules and play an important role to design and implementation of any the video encoder. It consumes more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. Various block matching methods have been developed to minimize the search time. In this context, Adaptive Rood Pattern Search is one of the less expensive block matching methods, which is widely acceptable for better Motion Estimation in video data processing. In this paper we have proposed to optimize the macro block size used in adaptive rood pattern search method for improvement in motion estimation.
The Tully$-$Fisher and Mass$-$Size Relations from Halo Abundance Matching
Desmond, Harry
2015-01-01
The Tully$-$Fisher relation (TFR) expresses the connection between rotating galaxies and the dark matter haloes they inhabit, and therefore contains a wealth of information about galaxy formation. We construct a general framework to investigate whether models based on halo abundance matching are able to reproduce the observed stellar mass TFR and mass$-$size relation (MSR), and use the data to constrain galaxy formation parameters. Our model tests a range of plausible scenarios, differing in the response of haloes to disc formation, the relative angular momentum of baryons and dark matter, the impact of selection effects, and the abundance matching parameters. We show that agreement with the observed TFR puts an upper limit on the scatter between galaxy and halo properties, requires weak or reversed halo contraction, and favours selection effects that preferentially eliminate fast-rotating galaxies. The MSR constrains the ratio of the disc to halo specific angular momentum to be approximately in the range 0.6...
Maximizing prosthetic valve size with the Top Hat supra-annular aortic valve
Aagaard, Jan; Geha, Alexander S.
2007-01-01
BACKGROUND AND AIM OF THE STUDY: The CarboMedics Top Hat supra-annular aortic valve allows a one-size (and often two-size) increase over the standard intra-annular valve. This advantage should minimize the risk of patient-prosthesis mismatch, where the effective prosthetic valve orifice area...
Koichi, Shungo; Arisaka, Masaki; Koshino, Hiroyuki; Aoki, Atsushi; Iwata, Satoru; Uno, Takeaki; Satoh, Hiroko
2014-04-28
Computer-assisted chemical structure elucidation has been intensively studied since the first use of computers in chemistry in the 1960s. Most of the existing elucidators use a structure-spectrum database to obtain clues about the correct structure. Such a structure-spectrum database is expected to grow on a daily basis. Hence, the necessity to develop an efficient structure elucidation system that can adapt to the growth of a database has been also growing. Therefore, we have developed a new elucidator using practically efficient graph algorithms, including the convex bipartite matching, weighted bipartite matching, and Bron-Kerbosch maximal clique algorithms. The utilization of the two matching algorithms especially is a novel point of our elucidator. Because of these sophisticated algorithms, the elucidator exactly produces a correct structure if all of the fragments are included in the database. Even if not all of the fragments are in the database, the elucidator proposes relevant substructures that can help chemists to identify the actual chemical structures. The elucidator, called the CAST/CNMR Structure Elucidator, plays a complementary role to the CAST/CNMR Chemical Shift Predictor, and together these two functions can be used to analyze the structures of organic compounds.
Skylarks trade size and energy content in weed seeds to maximize total ingested lipid biomass.
Gaba, Sabrina; Collas, Claire; Powolny, Thibaut; Bretagnolle, François; Bretagnolle, Vincent
2014-10-01
The trade-off between forage quality and quantity has been particularly studied in herbivore organisms, but much less for seed eating animals, in particular seed-eating birds which constitute the bulk of wintering passerines in European farmlands. The skylark is one of the commonest farmland birds in winter, mainly feeding on seeds. We focus on weed seeds for conservation and management purposes. Weed seeds form the bulk of the diet of skylarks during winter period, and although this is still a matter for discussion, weed seed predation by granivorous has been suggested as an alternative to herbicides used to regulate weed populations in arable crops. Our objectives were to identify whether weed seed traits govern foraging decisions of skylarks, and to characterize key seed traits with respect to size, which is related to searching and handling time, and lipid content, which is essential for migratory birds. We combined a single-offer experiment and a multiple-offer one to test for feeding preferences of the birds by estimating seed intake on weed seed species differing in their seed size and seed lipid content. Our results showed (1) a selective preference for smaller seeds above a threshold of seed size or seed size difference in the pair and, (2) a significant effect of seed lipid biomass suggesting a trade-off between foraging for smaller seeds and selecting seeds rich in lipids. Skylarks foraging decision thus seems to be mainly based on seed size, that is presumably a 'proxy' for weed seed energy content. However, there are clearly many possible combinations of morphological and physiological traits that must play crucial role in the plant-bird interaction such as toxic compound or seed coat. Copyright © 2014 Elsevier B.V. All rights reserved.
Kazemi, A.; Hosseinipoor, N.A. [Iran Univ. of Science and Technology, Tehran (Iran, Islamic Republic of)
2010-07-01
A series FACTS device such as a thyristor controlled series compensator (TCSC) has the ability to directly control the power flow and can be effective in improving the operation of a transmission network. This paper examined the optimal locating and sizing of a TCSC, for congestion management in competitive power markets. It proposed an algorithm for congestion management based on an optimal power flow (OPF) framework. The paper discussed the TCSC model and described the proposed method and formulation of an OPF framework. It was solved with the objective function of maximizing the social welfare by using a genetic algorithm for optimal fine-tuning generation and loads schedule and location-sizing of one unit TCSC. The simulation results were tested on the IEEE 14-bus and IEEE 30-bus system. It was validated through comparison of obtained social welfare with and without TCSC. It was concluded that this device was appropriate for long-term congestion management. 12 refs., 5 tabs.
Carolina Bonet Bub
2016-02-01
Full Text Available ABSTRACT Background: Successful transfusion of platelet refractory patients is a challenge. Many potential donors are needed to sustain human leukocyte antigen matched-platelet transfusion programs because of the different types of antigens and the constant needs of these patients. For a highly mixed population such as the Brazilian population, the pool size required to provide adequate platelet support is unknown. Methods: A mathematical model was created to estimate the appropriate size of an unrelated donor pool to provide human leukocyte antigen-compatible platelet support for a Brazilian population. A group of 154 hematologic human leukocyte antigen-typed patients was used as the potential patient population and a database of 65,500 human leukocyte antigen-typed bone marrow registered donors was used as the donor population. Platelet compatibility was based on the grading system of Duquesnoy. Results: Using the mathematical model, a pool containing 31,940, 1710 and 321 donors would be necessary to match more than 80% of the patients with at least five completely compatible (no cross-reactive group, partial compatible (one cross-reactive group or less compatible (two cross-reactive group donors, respectively. Conclusion: The phenotypic diversity of the Brazilian population has probably made it more difficulty to find completely compatible donors. However, this heterogeneity seems to have facilitated finding donors when cross-reactive groups are accepted as proposed by the grading system of Duquesnoy. The results of this study may help to establish unrelated human leukocyte antigen-compatible platelet transfusions, a procedure not routinely performed in most Brazilian transfusion services.
Gene M Heyman
2016-03-01
Full Text Available We tested whether principles that describe the allocation of overt behavior, as in choice experiments, also describe the allocation of cognition, as in attention experiments. Our procedure is a cognitive version of the two-armed bandit choice procedure. The two-armed bandit procedure has been of interest to psychologists and economists because it tends to support patterns of responding that are suboptimal. Each of two alternatives provides rewards according to fixed probabilities. The optimal solution is to choose the alternative with the higher probability of reward on each trial. However, subjects often allocate responses so that the probability of a response approximates its probability of reward. Although it is this result which has attracted most interest, probability matching is not always observed. As a function of monetary incentives, practice, and individual differences, subjects tend to deviate from probability matching toward exclusive preference, as predicted by maximizing. In our version of the two-armed bandit procedure, the monitor briefly displayed two, small adjacent stimuli that predicted correct responses according to fixed probabilities, as in a two-armed bandit procedure. We show that in this setting, a simple linear equation describes the relationship between attention and correct responses, and that the equation’s solution is the allocation of attention between the two stimuli. The calculations showed that attention allocation varied as a function of the degree to which the stimuli predicted correct responses. Linear regression revealed a strong correlation (r ¬= 0.99 between the predictiveness of a stimulus and the probability of attending to it. Nevertheless there were deviations from probability matching, and although small, they were systematic and statistically significant. As in choice studies, attention allocation deviated toward maximizing as a function of practice, feedback, and incentives. Our approach also
Yu, Lianchun; Liu, Liwei
2014-03-01
The generation and conduction of action potentials (APs) represents a fundamental means of communication in the nervous system and is a metabolically expensive process. In this paper, we investigate the energy efficiency of neural systems in transferring pulse signals with APs. By analytically solving a bistable neuron model that mimics the AP generation with a particle crossing the barrier of a double well, we find the optimal number of ion channels that maximizes the energy efficiency of a neuron. We also investigate the energy efficiency of a neuron population in which the input pulse signals are represented with synchronized spikes and read out with a downstream coincidence detector neuron. We find an optimal number of neurons in neuron population, as well as the number of ion channels in each neuron that maximizes the energy efficiency. The energy efficiency also depends on the characters of the input signals, e.g., the pulse strength and the interpulse intervals. These results are confirmed by computer simulation of the stochastic Hodgkin-Huxley model with a detailed description of the ion channel random gating. We argue that the tradeoff between signal transmission reliability and energy cost may influence the size of the neural systems when energy use is constrained.
Laluce, Cecilia; Tognolli, João Olimpio; de Oliveira, Karen Fernanda; Souza, Crisla Serra; Morais, Meline Rezende
2009-06-01
Aiming to obtain rapid fermentations with high ethanol yields and a retention of high final viabilities (responses), a 2(3) full-factorial central composite design combined with response surface methodology was employed using inoculum size, sucrose concentration, and temperature as independent variables. From this statistical treatment, two well-fitted regression equations having coefficients significant at the 5% level were obtained to predict the viability and ethanol production responses. Three-dimensional response surfaces showed that increasing temperatures had greater negative effects on viability than on ethanol production. Increasing sucrose concentrations improved both ethanol production and viability. The interactions between the inoculum size and the sucrose concentrations had no significant effect on viability. Thus, the lowering of the process temperature is recommended in order to minimize cell mortality and maintain high levels of ethanol production when the temperature is on the increase in the industrial reactor. Optimized conditions (200 g/l initial sucrose, 40 g/l of dry cell mass, 30 degrees C) were experimentally confirmed and the optimal responses are 80.8 +/- 2.0 g/l of maximal ethanol plus a viability retention of 99.0 +/- 3.0% for a 4-h fermentation period. During consecutive fermentations with cell reuse, the yeast cell viability has to be kept at a high level in order to prevent the collapse of the process.
Ravlo, Kristian; Chhoden, Tashi; Søndergaard, Peter
2012-01-01
Kidney transplantation from a large donor to a small recipient, as in pediatric transplantation, is associated with an increased risk of thrombosis and DGF. We established a porcine model for renal transplantation from an adult donor to a small or size-matched recipient with a high risk of DGF...... and studied GFR, RPP using MRI, and markers of kidney injury within 10 h after transplantation. After induction of BD, kidneys were removed from ∼63-kg donors and kept in cold storage for ∼22 h until transplanted into small (∼15 kg, n = 8) or size-matched (n = 8) recipients. A reduction in GFR was observed...
Jung, Woo Sang; Haam, Seokjin; Shin, Jae Min; Han, Kyunghwa; Park, Chul Hwan; Byun, Min Kwang; Chang, Yoon Soo; Kim, Hyung Jung; Kim, Tae Hoon
2016-07-01
Donor-recipient size matching in lung transplantation (LTx) by computed tomography lung volume (CTvol) may be a reasonable approach because size matching is an anatomical issue. The purpose of this study is to evaluate the feasibility of CTvol as a surrogate marker of size matching in LTx by comparing CTvol and predicted total lung capacity (pTLC) to reference total lung capacity (TLC) values.From January to December 2014, data from 400 patients who underwent plethysmography, pulmonary function testing (PFT), and chest computed tomography scans were reviewed retrospectively. Enrolled 264 patients were divided into 3 groups according to PFT results: Group I, obstructive pattern; Group II, restrictive pattern; Group III, normal range. The correlations between pTLC and TLC and between CTvol and TLC were analyzed, and the linear correlation coefficients were compared. The percentage error rates of pTLC and CTvol were calculated and absolute error rates were compared.The correlation coefficient between CTvol and TLC in Group I was larger than that of pTLC and TLC (0.701 vs 0.432, P = 0.002). The absolute percentage error rate between CTvol and pTLC was lower than that of pTLC in Group II (15.3% ± 11.9% vs 42.2% ± 28.1%, P matching in LTx.
Horne, C.R.; Hirst, Andrew G.; Atkinson, D.
2015-01-01
of these gradients to date, and find that their direction and magnitude co-vary among 12 arthropod orders (r2 = 0.72). Body size in aquatic species generally reduces with both warming and decreasing latitude, whereas terrestrial species have much reduced and even opposite gradients. These patterns support...... the prediction that oxygen limitation is a major controlling factor in water, but not in air. Furthermore, voltinism explains much of the variation in T-S and L-S patterns in terrestrial but not aquatic species. While body size decreases with warming and with decreasing latitude in multivoltine terrestrial...
Borcherding, Jost; Beeck, Peter; DeAngelis, Donald L.; Scharf, Werner R.
2010-01-01
Summary 1. In gape-limited predators, body size asymmetries determine the outcome of predator-prey interactions. Due to ontogenetic changes in body size, the intensity of intra- and interspecific interactions may change rapidly between the match situation of a predator-prey system and the mismatch situation in which competition, including competition with the prey, dominates. 2. Based on a physiologically structured population model using the European perch (Perca fluviatilis), analysis was performed on how prey density (bream, Abramis brama), initial size differences in the young-of-the-year (YOY) age cohort of the predator, and phenology (time-gap in hatching of predator and prey) influence the size structure of the predator cohort. 3. In relation to the seasonality of reproduction, the match situation of the predator-prey system occurred when perch hatched earlier than bream and when no gape-size limitations existed, leading to decreased size divergence in the predator age cohort. Decreased size divergence was also found when bream hatched much earlier than perch, preventing perch predation on bream occurring, which, in turn, increased the competitive interaction of the perch with bream for the common prey, zooplankton; i.e. the mismatch situation in which also the mean size of the age cohort of the predator decreased. 4. In between the total match and the mismatch, however, only the largest individuals of the perch age cohort were able to prey on the bream, while smaller conspecifics got trapped in competition with each other and with bream for zooplankton, leading to enlarged differences in growth that increased size divergence. 5. The modelling results were combined with 7 years of field data in a lake, where large differences in the length-frequency distribution of YOY perch were observed after their first summer. These field data corroborate that phenology and prey density per predator are important mechanisms in determining size differences within the YOY
de'Angelis, Nicola; Genova, Pietro; Amiot, Aurelien; Charpy, Cecile; Disabato, Mara; Belgaumkar, Ajay P; Chahrour, Ali; Legou, Francois; Azoulay, Daniel; Brunetti, Francesco
2017-02-01
This study compared robotic (RR) and laparoscopic resection (LR) for primary gastrointestinal stromal tumors (GISTs) of the stomach >5 cm. Twelve consecutive patients who underwent RR from 2012 to 2015 were matched for tumor size and location with 24 patients who underwent LR from 2000 to 2012. The median tumor size was 7.1 cm (range, 5.5 to 11.5). GISTs were resected by wedge resection (91.7%) or distal gastrectomy. The median RR operative time was longer than that of LR (162.5 vs. 130 min, respectively; P=0.004). Only 1 LR patient required conversion. The time to flatus and hospital stay were similar between groups. Overall, 3 patients developed minor postoperative complications that were medically treated. Mortality was nil. All resections were R0. No difference was observed in the incidence of recurrence. RR was significantly more expensive (+21.6%) than LR. RR appears to be safe and feasible for GISTs>5 cm, but is associated with longer operative times and greater costs.
Rosenkilde Larsen, Mads; Morville, Thomas; Riis Andersen, Peter
2015-01-01
.02) after cycling. CONCLUSIONS: Older male cyclists sustained near-maximal rates of EE during prolonged cycling but were unable to upregulate EI to maintain energy balance. Despite the presence of increased motivation to eat, a more profound counteracting physiologic stimulus inhibiting increases in EI...
Cai, Li; Hayes, Nancy L.; Takahashi, Takao; Caviness, Verne S Jr; Nowakowski, Richard S.
2002-01-01
Mechanisms that regulate neuron production in the developing mouse neocortex were examined by using a retroviral lineage marking method to determine the sizes of the lineages remaining in the proliferating population of the ventricular zone during the period of neuron production. The distribution of clade sizes obtained experimentally in four different injection-survival paradigms (E11-E13, E11-E14, E11-E15, and E12-E15) from a total of over 500 labeled lineages was compared with that obtained from three models in which the average behavior of the proliferating population [i.e., the proportion of cells remaining in the proliferative population (P) vs. that exiting the proliferative population (Q)] was quantitatively related to lineage size distribution. In model 1, different proportions of asymmetric, symmetric terminal, and symmetric nonterminal cell divisions coexisted during the entire developmental period. In model 2, the developmental period was divided into two epochs: During the first, asymmetric and symmetric nonterminal cell divisions occurred, but, during the second, asymmetric and symmetric terminal cell divisions occurred. In model 3, the shifts in P and Q are accounted for by changes in the proportions of the two types of symmetric cell divisions without the inclusion of any asymmetric cell divisions. The results obtained from the retroviral experiments were well accounted for by model 1 but not by model 2 or 3. These findings demonstrate that: 1) asymmetric and both types of symmetric cell divisions coexist during the entire period of neurogenesis in the mouse, 2) neuron production is regulated in the proliferative population by the independent decisions of the two daughter cells to reenter S phase, and 3) neurons are produced by both asymmetric and symmetric terminal cell divisions. In addition, the findings mean that cell death and/or tangential movements of cells in the proliferative population occur at only a low rate and that there are no
Influence of graft size matching on outcomes of infantile living donor liver transplantation.
Wan, Ping; Li, Qigen; Zhang, Jianjun; Shen, Conghuan; Luo, Yi; Chen, Qimin; Chen, Xiaosong; Zhang, Ming; Han, Longzhi; Xia, Qiang
2015-12-01
We aimed to assess the impact of size mismatching between grafts and recipients on outcomes of infants or small children after LDLT. Between October 2006 and December 2014, 129 LDLT recipients weighing no more than 8 kg were retrospectively analyzed. The entire cohort was categorized into three groups by GRWR: GRWR graft survival rates were 89.5%, 86.6%, and 81.6%, respectively (p = 0.846). In conclusion, GRWR between 1.9% and 5.8% would not cause noticeable adverse events for infantile LDLT recipients ≤ 8 kg. However, there is still a role for considering reduction in the graft mass as an applicable strategy in selected cases.
Coutinho, Y. A.; Rooney, S. C. K.; Payton, E. J.
2017-03-01
Grain size data from electron backscatter diffraction (EBSD) maps are often reported as the mean of the circle equivalent diameters of the measured grain areas. Circle equivalent diameters are not directly comparable to the lineal intercept measurements more historically common for grain size characterization in analog optical microscopy. While the value of mean lineal intercept is the same in 2D and 3D for a given probe direction, the mean 2D circle equivalent section diameter is not directly related to any 3D property. Estimation of mean lineal intercept from circle equivalent diameter is usually carried out by again assuming feature circularity, despite the obvious corners that are inherent to grains from the requirements of space filling. A direct conversion between section areas and lineal intercepts can be performed if the grain perimeters are known. In the present work, a novel pattern matching library approach is investigated for measurement of grain perimeters using simulated 2D EBSD maps. The results are compared to alternative approaches for perimeter measurement and assessed with respect to spatial resolution, grain size distribution parameters, and relevant ASTM and ISO measurement standards. The benefits and drawbacks of each approach are discussed. Empirical estimators for conversion between lineal intercept, circle equivalent diameter, and ASTM grain size number are presented.
Hua, Xiu-Ni; Qin, Lan; Yan, Xiao-Zhi; Yu, Lei; Xie, Yi-Xin; Han, Lei, E-mail: hanlei@nbu.edu.cn
2015-12-15
Hydrothermal reactions of N-auxiliary flexible exo-bidentate ligand 1,3-bis(4-pyridyl)propane (bpp) and carboxylates ligands naphthalene-2,6-dicarboxylic acid (2,6-H{sub 2}ndc) or 4,4′-(hydroxymethylene)dibenzoic acid (H{sub 2}hmdb), in the presence of cadmium(II) salts have given rise to two novel metal-organic frameworks based on flexible ligands (FL-MOFs), namely, [Cd{sub 2}(2,6-ndc){sub 2}(bpp)(DMF)]·2DMF (1) and [Cd{sub 3}(hmdb){sub 3}(bpp)]·2DMF·2EtOH (2) (DMF=N,N-Dimethylformamide). Single-crystal X-ray diffraction analyses revealed that compound 1 exhibits a three-dimensional self-penetrating 6-connected framework based on dinuclear cluster second building unit. Compound 2 displays an infinite three-dimensional ‘Lucky Clover’ shape (2,10)-connected network based on the trinuclear cluster and V-shaped organic linkers. The flexible bpp ligand displays different conformations in 1 and 2, which are successfully controlled by size-matching mixed ligands during the self-assembly process. - Graphical abstract: Compound 1 exhibits a 3D self-penetrating 6-connected framework based on dinuclear cluster, and 2 displays an infinite 3D ‘Lucky Clover’ shape (2,10)-connected network based on the trinuclear cluster. The flexible 1,3-bis(4-pyridyl)propane ligand displays different conformations in 1 and 2, which successfully controlled by size-matching mixed ligands during the self-assembly process.
Vyas, Seema; Heise, Lori
2014-11-01
Estimates of the effect of employment on women's risk of partner violence in cross-sectional studies are subject to potential "self-selection bias." Women's personal choice of whether to pursue employment or not may create fundamental differences between the group of women who are employed and those who are not employed that standard regression methods cannot account for even after adjusting for confounding. The aim of this study is to demonstrate the utility of propensity score matching (PSM), a technique used widely in econometrics, to address this bias in cross-sectional studies. We use PSM to estimate an unbiased effect-size of women's employment on their risk of experiencing partner violence in urban and rural Tanzania using data from the 2010 Tanzania Demographic and Health Survey (DHS). Three different measures of women's employment were analyzed: whether they had engaged in any productive work outside of the home in the past year, whether they received payment in cash for this productive work, and whether their employment was stable. Women who worked outside of the home were significantly different from those who did not. In both urban and rural Tanzania, women's risk of violence appears higher among women who worked in the past year than among those who did not, even after using PSM to account for underlying differences in these two groups of women. Being paid in cash reversed this effect in rural areas whereas stability of employment reduced this risk in urban centers. The estimated size of effect varied by type of matching estimator, but the direction of the association remained largely consistent. This study's findings suggest substantial self-selection into employment. PSM methods, by compensating for this bias, appear to be a useful tool for estimating the relationship between women's employment and partner violence in cross-sectional studies.
Kirst, Henning; Formighieri, Cinzia; Melis, Anastasios
2014-10-01
A phycocyanin-deletion mutant of Synechocystis (cyanobacteria) was generated upon replacement of the CPC-operon with a kanamycin resistance cassette. The Δcpc transformant strains (Δcpc) exhibited a green phenotype, compared to the blue-green of the wild type (WT), lacked the distinct phycocyanin absorbance at 625nm, and had a lower Chl per cell content and a lower PSI/PSII reaction center ratio compared to the WT. Molecular and genetic analyses showed replacement of all WT copies of the Synechocystis DNA with the transgenic version, thereby achieving genomic DNA homoplasmy. Biochemical analyses showed the absence of the phycocyanin α- and β-subunits, and the overexpression of the kanamycin resistance NPTI protein in the Δcpc. Physiological analyses revealed a higher, by a factor of about 2, intensity for the saturation of photosynthesis in the Δcpc compared to the WT. Under limiting intensities of illumination, growth of the Δcpc was slower than that of the WT. This difference in the rate of cell duplication diminished gradually as growth irradiance increased. Identical rates of cell duplication of about 13h for both WT and Δcpc were observed at about 800μmolphotonsm(-2)s(-1) or greater. Culture productivity analyses under simulated bright sunlight and high cell-density conditions showed that biomass accumulation by the Δcpc was 1.57-times greater than that achieved by the WT. Thus, the work provides first-time direct evidence of the applicability of the Truncated Light-harvesting Antenna (TLA)-concept in cyanobacteria, entailing substantial improvements in the photosynthetic efficiency and productivity of mass cultures upon minimizing the phycobilisome light-harvesting antenna size.
Oehlschlägel, Jens
2007-01-01
Cluster matching by permuting cluster labels is important in many clustering contexts such as cluster validation and cluster ensemble techniques. The classic approach is to minimize the euclidean distance between two cluster solutions which induces inappropriate stability in certain settings. Therefore, we present the truematch algorithm that introduces two improvements best explained in the crisp case. First, instead of maximizing the trace of the cluster crosstable, we propose to maximize a chi-square transformation of this crosstable. Thus, the trace will not be dominated by the cells with the largest counts but by the cells with the most non-random observations, taking into account the marginals. Second, we suggest a probabilistic component in order to break ties and to make the matching algorithm truly random on random data. The truematch algorithm is designed as a building block of the truecluster framework and scales in polynomial time. First simulation results confirm that the truematch algorithm give...
Parsons, Sam; Kriwoken, Lorne K
2010-05-01
Small to medium-sized enterprises (SMEs) in Hobart, Tasmania, Australia face many barriers to recycling participation. This study first investigated the volumes and types of waste produced by SMEs. Significant barriers were then identified and key motivators to recycle examined. Using the Australia New Zealand Standard of Industrial Classification, stratified sampling of SMEs (n = 436) was undertaken. Inadequate storage space, paucity of readily available information on recycling services and the lack of staff allocated to sort and recycle were identified as major barriers. Cardboard, paper and plastic waste were produced in large volumes with only a small percentage being recycled and these were identified as target areas for local government. Recommendations include the appointment of a dedicated recycling officer to maximize recycling participation for the reduction of waste to landfill and to undertake further research on minimizing recycling costs.
Matching, Demand, Maximization, and Consumer Choice
Wells, Victoria K.; Foxall, Gordon R.
2013-01-01
The use of behavioral economics and behavioral psychology in consumer choice has been limited. The current study extends the study of consumer behavior analysis, a synthesis between behavioral psychology, economics, and marketing, to a larger data set. This article presents the current work and results from the early analysis of the data. We…
Matching, Demand, Maximization, and Consumer Choice
Wells, Victoria K.; Foxall, Gordon R.
2013-01-01
The use of behavioral economics and behavioral psychology in consumer choice has been limited. The current study extends the study of consumer behavior analysis, a synthesis between behavioral psychology, economics, and marketing, to a larger data set. This article presents the current work and results from the early analysis of the data. We…
K B Athreya
2009-09-01
It is shown that (i) every probability density is the unique maximizer of relative entropy in an appropriate class and (ii) in the class of all pdf that satisfy $\\int fh_id_=_i$ for $i=1,2,\\ldots,\\ldots k$ the maximizer of entropy is an $f_0$ that is proportional to $\\exp(\\sum c_i h_i)$ for some choice of $c_i$. An extension of this to a continuum of constraints and many examples are presented.
Matching Through Position Auctions
Terence Johnson
2009-01-01
This paper studies how an intermediary should design two-sided matching markets when agents are privately informed about their quality as a partner and can make payments to the intermediary. Using a mechanism design approach, I derive sufficient conditions for assortative matching to be profit- or welfare-maximizing, and then show how to implement the optimal match and payments through two-sided position auctions. This sharpens our understanding of intermediated matching markets by clarifying...
Kirst, Henning; Melis, Anastasios
2014-01-01
The concept of the Truncated Light-harvesting chlorophyll Antenna (TLA) size, as a tool by which to maximize sunlight utilization and photosynthetic productivity in microalgal mass cultures or high-density plant canopies, is discussed. TLA technology is known to improve sunlight-to-product energy conversion efficiencies and is hereby exemplified by photosynthetic productivity estimates of wild type and a TLA strain under simulated mass culture conditions. Recent advances in the generation of TLA-type mutants by targeting genes of the chloroplast signal-recognition particle (CpSRP) pathway, affecting the thylakoid membrane assembly of light-harvesting proteins, are also summarized. Two distinct CpSRP assembly pathways are recognized, one entailing post-translational, the other a co-translational mechanism. Differences between the post-translational and co-translational integration mechanisms are outlined, as these pertain to the CpSRP-mediated assembly of thylakoid membrane protein complexes in higher plants and green microalgae. The applicability of the CpSRP pathway genes in efforts to generate TLA-type strains with enhanced solar energy conversion efficiency in photosynthesis is evaluated.
Nielsen, Joachim; Krustrup, Peter; Nybo, Lars
2012-01-01
Whole muscle glycogen levels remain low for a prolonged period following a soccer match. The present study was conducted to investigate how this relates to glycogen content and particle size in distinct subcellular localizations. Seven high-level male soccer players had a vastus lateralis muscle...... biopsy collected immediately after and 24, 48, 72 and 120 h after a competitive soccer match. Transmission electron microscopy was used to estimate the subcellular distribution of glycogen and individual particle size. During the first day of recovery, glycogen content increased by ~60% in all...... subcellular localizations, but during the subsequent second day of recovery glycogen content located within the myofibrils (Intramyofibrillar glycogen, a minor deposition constituting 10-15% of total glycogen) did not increase further compared with an increase in subsarcolemmal glycogen (-7 vs. +25...
Bergenfeldt, Henrik; Stehlik, Josef; Höglund, Peter; Andersson, Bodil; Nilsson, Johan
2017-09-01
The International Society for Heart and Lung Transplantation (ISHLT) guidelines advise against inappropriate weight match (IWM) for heart transplant, defined as donor weight 30. The end-points were all-cause 30-day mortality and cumulative mortality. IWM was associated with increased 30-day mortality (odds ratio [OR] = 1.20, 95% confidence interval [CI] 1.01 to 1.43, p = 0.041) and cumulative mortality (hazard ratio [HR] = 1.14, 95% CI 1.07 to 1.22, p < 0.001). In non-obese recipients, IWM was associated with increased 30-day mortality (OR = 1.89, 95% CI 1.48 to 2.41, p < 0.001) as well as cumulative mortality (HR = 1.27, 95% CI 1.15 to 1.41, p < 0.001), whereas, for obese recipients, IWM was not associated with 30-day or cumulative mortality. Male recipients of female allografts (HR = 1.08, 95% CI 1.04 to 1.12, p < 0.001) as well as female recipients of male allografts (HR = 1.07, 95% CI 1.02 to 1.13, p = 0.003) had increased cumulative mortality compared with gender-matched transplants. There was no interaction between IWM and gender mismatch. Our results indicate that donor weight <70% of recipient weight increases mortality in non-obese heart transplant recipients, but not in obese transplant recipients. Gender mismatch increases mortality independently of weight match. Copyright © 2017 International Society for the Heart and Lung Transplantation. Published by Elsevier Inc. All rights reserved.
Nonlinear trading models through Sharpe Ratio maximization.
Choey, M; Weigend, A S
1997-08-01
While many trading strategies are based on price prediction, traders in financial markets are typically interested in optimizing risk-adjusted performance such as the Sharpe Ratio, rather than the price predictions themselves. This paper introduces an approach which generates a nonlinear strategy that explicitly maximizes the Sharpe Ratio. It is expressed as a neural network model whose output is the position size between a risky and a risk-free asset. The iterative parameter update rules are derived and compared to alternative approaches. The resulting trading strategy is evaluated and analyzed on both computer-generated data and real world data (DAX, the daily German equity index). Trading based on Sharpe Ratio maximization compares favorably to both profit optimization and probability matching (through cross-entropy optimization). The results show that the goal of optimizing out-of-sample risk-adjusted profit can indeed be achieved with this nonlinear approach.
Shatz, Whitney; Hass, Philip E; Mathieu, Mary; Kim, Hok Seon; Leach, Kim; Zhou, Michelle; Crawford, Yongping; Shen, Amy; Wang, Kathryn; Chang, Debby P; Maia, Mauricio; Crowell, Susan R; Dickmann, Leslie; Scheer, Justin M; Kelley, Robert F
2016-09-01
We have developed a tool Fab fragment of a rabbit monoclonal antibody that is useful for early evaluation in rabbit models of technologies for long acting delivery (LAD) of proteins to the eye. Using this Fab we show that vitreal clearance can be slowed through increased hydrodynamic size. Fab (G10rabFab) and Fab' (G10rabFab') fragments of a rabbit monoclonal antibody (G10rabIgG) were expressed in Chinese hamster ovary (CHO) cells and purified using antigen-based affinity chromatography. G10rabFab retains antigen-binding upon thermal stress (37 °C) for 8 weeks in phosphate-buffered saline (PBS) and can be detected in rabbit tissues using an antigen-based ELISA. Hydrodynamic radius, measured using quasi-elastic light scattering (QELS), was increased through site-specific modification of the G10rabFab' free cysteine with linear methoxy-polyethylene glycol(PEG)-maleimide of 20000 or 40000 molecular weight. Pharmacokinetic studies upon intravitreal dosing in New Zealand white rabbits were conducted on the G10rabFab and PEGylated G10rabFab'. Results of single and multidose pharmacokinetic experiments yield reproducible results and a vitreal half-life for G10rabFab of 3.2 days. Clearance from the eye is slowed through increased hydrodynamic size, with vitreal half-life showing a linear dependence on hydrodynamic radius (RH). A linear dependence of vitreal half-life on RH suggests that molecule diffusivity makes an important contribution to vitreal clearance. A method for prediction of vitreal half-life from RH measurements is proposed.
Karsten Köhler
Full Text Available It has been suggested that receptor-ligand complexes segregate or co-localise within immune synapses according to their size, and this is important for receptor signaling. Here, we set out to test the importance of receptor-ligand complex dimensions for immune surveillance of target cells by human Natural Killer (NK cells. NK cell activation is regulated by integrating signals from activating receptors, such as NKG2D, and inhibitory receptors, such as KIR2DL1. Elongating the NKG2D ligand MICA reduced its ability to trigger NK cell activation. Conversely, elongation of KIR2DL1 ligand HLA-C reduced its ability to inhibit NK cells. Whereas normal-sized HLA-C was most effective at inhibiting activation by normal-length MICA, only elongated HLA-C could inhibit activation by elongated MICA. Moreover, HLA-C and MICA that were matched in size co-localised, whereas HLA-C and MICA that were different in size were segregated. These results demonstrate that receptor-ligand dimensions are important in NK cell recognition, and suggest that optimal integration of activating and inhibitory receptor signals requires the receptor-ligand complexes to have similar dimensions.
Zak, Michail
2008-01-01
A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).
文开庭
2009-01-01
In this paper, new Ky Fan matching theorems for transfer compactly open covers are established. As applications, a new Fan-Browder coincidence theorem, a fixed point theorem and a maximal element theorem are obtained.%建立了转移紧开覆盖的两个新的Ky Fan匹配定理.作为应用,获得了新的Fan-Browder重合定理、不动点定理和极大元定理.
Silverstein, Steven M
2008-07-01
While cognitive impairment in schizophrenia is easy to demonstrate, it has been much more difficult to measure a specific cognitive process unconfounded by the influence of other cognitive processes and noncognitive factors (eg, sedation, low motivation) that affect test scores. With the recent interest in the identification of neurophysiology-linked cognitive probes for clinical trials, the issue of isolating specific cognitive processes has taken on increased importance. Recent advances in research design and psychometric theory regarding cognition research in schizophrenia demonstrate the importance of (1) maximizing between-group differences via reduction of measurement error during both test development and subsequent research and (2) the development and use of process-specific tasks in which theory-driven performance indices are derived across multiple conditions. Use of these 2 strategies can significantly advance both our understanding of schizophrenia and measurement sensitivity for clinical trials. Novel data-analytic strategies for analyzing change across multiple conditions and/or multiple time points also allow for increased reliability and greater measurement sensitivity than traditional strategies. Following discussion of these issues, trade-offs inherent to attempts to address psychometric issues in schizophrenia research are reviewed. Finally, additional considerations for maximizing sensitivity and real-world significance in clinical trials are discussed.
Nielsen, Joachim; Krustrup, Peter; Nybo, Lars;
2012-01-01
biopsy collected immediately after and 24, 48, 72 and 120 h after a competitive soccer match. Transmission electron microscopy was used to estimate the subcellular distribution of glycogen and individual particle size. During the first day of recovery, glycogen content increased by ~60% in all...... subcellular localizations, but during the subsequent second day of recovery glycogen content located within the myofibrils (Intramyofibrillar glycogen, a minor deposition constituting 10-15% of total glycogen) did not increase further compared with an increase in subsarcolemmal glycogen (-7 vs. +25......%, respectively, P = 0.047). Conversely, from the second to the fifth day of recovery, glycogen content increased (53%) within the myofibrils compared to no change in subsarcolemmal or intermyofibrillar glycogen (P ...
Plummer, MD
1986-01-01
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.
A. Hak (Tony); J. Dul (Jan)
2009-01-01
textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern
Hak, Tony; Dul, Jan
2009-01-01
textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern of measured values) with an “expected pattern” (a hypothesis), and deciding whether these patterns match (resulting in a confirmation of the hypothesis) or do not match (resulting in a disconfirmat...
Melis, A.; Neidhardt, J.; Benemann, J.R. [Univ. of California, Berkeley, CA (United States). Dept. of Plant and Microbial Biology
1998-08-01
The solar conversion efficiency and productivity of photosynthesis in light-acclimated Dunaliella salina (green algae) were analyzed. Cells were grown under continuous low-light (LL; 100 {micro}mol photons/m{sup 2} s) or high-light (HL; 2,000 {micro}mol photons/m{sup 2} s) conditions. HL-grown cells exhibited signs of chronic photoinhibition, i.e., a lower pigment content, a highly truncated chlorophyll (Chl) antenna size for the photosystems, and accumulation of photodamaged photosystem-II (PSII) reaction centers in the chloroplast thylakoids. In spite of these deficiencies, high-light-grown cells showed photosynthetic productivity (300 mmol O{sub 2}/(mol Chl) s) that was {approximately} 3 times greater than that of the normally pigmented LL-grown cells ({approximately} 100 mmol O{sub 2}/(mol Chl) s). Recovery from photoinhibition in the HL-grown cells, induced in the absence of a light-harvesting Chl antenna size enlargement, increased photosynthetic productivity further to {approximately} 650 mmol O{sub 2}/(mol Chl) s. It is shown that, under moderate to high light conditions, D. salina with a highly truncated Chl antenna size will display superior photosynthetic productivity, solar conversion efficiency and H{sub 2} production when compared to the normally pigmented control cells. Estimates of H{sub 2} production in mass culture suggest an average of 200 L H{sub 2}/m{sup 2} d for the cells with the truncated Chl antenna, and less than 50 L H{sub 2}/m{sup 2} d for the normally pigmented cells.
Ghosh, Sirshendu; Saha, Manas; Paul, Sumana; De, S K
2015-11-21
High quality nearly monodisperse colloidal WO3-x nanorods with an aspect ratio ∼18 were synthesized using the thermal decomposition technique. The effects of a capping agent and an activating agent on the nanorod aspect ratio have been studied. Excess carrier concentration due to large oxygen vacancy and smaller width of the nanorods compared to the Bohr exciton radius gives rise to an increase of the band gap. Shape anisotropy in nanorods results in two plasmonic absorbance bands at about 890 nm and 5900 nm corresponding to short axis and long axis plasmon modes. The short axis mode reveals an excellent plasmonic sensitivity of ∼345 nm per refractive index. A plasmonic photocatalysis process based on WO3-x nanorods has been developed to synthesize Ag/WO3-x heterostructures consisting of multiple Ag dots with ∼2 nm size, randomly decorated on the surface of the WO3-x nanorods. Long time irradiation leads to an increase in the size (5 nm) of Ag nanocrystals concomitant with decrease in the number of Ag nanocrystals attached per WO3-x nanorod. Plasmonic photocatalysis followed by thermal annealing produces only one Ag nanocrystal of size ∼10 nm on each WO3-x nanorod. Red shifting and broadening of plasmon bands of Ag nanocrystals and WO3-x nanorods confirm the formation of heterostructures between the metal and semiconductor. Detailed transmission electron micrograph analysis indicates the epitaxial growth of Ag nanocrystals onto WO3-x nanorods. A high photocurrent gain of about 4000 is observed for Ag (10 nm)/WO3-x heterostructures. The photodegradation rate for Rhodamine-B and methylene blue is maximum for Ag (10 nm)/WO3-x heterostructures due to efficient electron transfer from WO3-x nanorods to Ag nanocrystals. Metal plasmon-semiconductor exciton coupling, prominent plasmon absorbance of metal nanoparticles, and formation of an epitaxial interface are found to be the important factors to achieve the maximum photocatalytic activity and fabrication of a
Goldstuck N
2015-01-01
Full Text Available Intrauterine devices (IUD are long-acting reversible contraceptive methods that are independent from daily attention. Unlike methods that need daily motivation, IUDs are forgettable methods that are also highly effective. They are, therefore, advocated by all major organizations to prevent unintended pregnancy. However, current IUD use often leads to early discontinuation, even within 3 or 6 months following insertion. It is known for many years that IUDs perform best, leading to high continuation of use, if attention is given to geometric factors such as size and shape of the host uterine cavity prior to inserting an IUD. Continuation of use, for the full claimed duration of action, will usually remain low if the relationship between IUD and uterine cavity is out of proportion.
Doyle, L R; Kozhevnikov, V P; Oetiker, B; Martín, E L; Blue, J E; Rottler, L; Stone, R P S; Ninkov, Z; Jenkins, J M; Schneider, J; Dunham, E W; Doyle, M F; Paleologou, E V; Doyle, Laurance R.; Deeg, Hans J.; Kozhevnikov, Valerij P.; Oetiker, Brian; Martin, Eduardo L.; Rottler, Lee; Stone, Remington P.S.; Ninkov, Zoran; Jenkins, Jon M.; Schneider, Jean; Dunham, Edward W.; Doyle, Moira F.; Paleologou, Efthimious
2000-01-01
A lightcurve of the eclipsing binary CM Draconis has been analyzed for the presence of transits of planets of size >= 2.5 Earth-radii (Re), with periods of 60 days or less, and in co-planar orbits around the binary system. About 400 million model lightcurves, representing transits from planets with periods ranging from 7 to 60 days, have been matched/correlated against these data. This process we call the "transit detection algorithm" or TDA. The resulting `transit-statistics' for each planet candidate allow the quantification of detection probabilities, and of false alarm rates. Our current lightcurve of CM Dra has a coverage of 1014 hours with 26,043 individual points, at a photometric precision between 0.2% and 0.7%. Planets significantly larger then 3Re would constitute a `supra-noise' detection, and for periods of 60 days or less, they would have been detected with a probability of 90%. `Subnoise' detections of smaller planets are more constrained. For example, 2.5 Re planets with 10-day periods or less ...
Lim, S J; Sun, J-H; Kekatpure, A L; Chun, J-M; Jeon, I-H
2017-09-01
Aims This study aimed to compare the clinical outcomes of rotator cuff repair in patients with rheumatoid arthritis with those of patients who have no known history of the disease. We hypothesised that the functional outcomes are comparable between patients and without rheumatoid arthritis and may be affected by the level of disease activity, as assessed from C-reactive protein (CRP) level and history of systemic steroid intake. Patients and methods We conducted a retrospective review of the institutional surgical database from May 1995 to April 2012. Twenty-nine patients with rheumatoid arthritis who had rotator cuff repair were enrolled as the study group. Age, sex, and tear size matched patients with no disease who were selected as the control group. The mean duration of follow-up was 46 months (range 24-92 months). Clinical outcomes were assessed with the American Shoulder and Elbow Surgeons (ASES) questionnaire, Constant score and visual analogue scale (VAS). All data were recorded preoperatively and at regular postoperative follow-up visits. CRP was measured preoperatively as the disease activity marker for rheumatoid arthritis. Medication history was thoroughly reviewed in the study group. Results In patients with rheumatoid arthritis, all shoulder functional scores improved after surgery (ASES 56.1-78.1, Constant 50.8-70.5 and VAS 5.2-2.5; P rheumatoid arthritis was comparable to that of the control group (difference with control: ASES 78.1 vs. 85.5, P = 0.093; Constant 70.5 vs. 75.9, P = 0.366; VAS 2.5 vs. 1.8, P = 0.108). Patients with rheumatoid arthritis who had an elevated CRP level (> 1 mg/dl) showed inferior clinical outcomes than those with normal CRP levels. Patients with a history of systemic steroid intake showed inferior functional outcomes than those who had not taken steroids. Conclusions Surgical intervention for rotator cuff tear in patients with rheumatoid arthritis improved the shoulder functional outcome comparable to that in
Profit maximization mitigates competition
Dierker, Egbert; Grodal, Birgit
1996-01-01
We consider oligopolistic markets in which the notion of shareholders' utility is well-defined and compare the Bertrand-Nash equilibria in case of utility maximization with those under the usual profit maximization hypothesis. Our main result states that profit maximization leads to less price...... competition than utility maximization. Since profit maximization tends to raise prices, it may be regarded as beneficial for the owners as a whole. Moreover, if profit maximization is a good proxy for utility maximization, then there is no need for a general equilibrium analysis that takes the distribution...... of profits among consumers fully into account and partial equilibrium analysis suffices...
Hartelius, Karsten; Carstensen, Jens Michael
2003-01-01
A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which...... nodes and the arc prior models variations in row and column spacing across the grid. Grid matching is done by placing an initial rough grid over the image and applying an ensemble annealing scheme to maximize the posterior distribution of the grid. The method can be applied to noisy images with missing...
Optimizing Antenna Size to Maximize Photosynthetic Efficiency
The theoretical upper limit for the operational efficiency of plant photosynthesis has been estimated from a detailed stepwise analysis of the biophysical and biochemical subprocesses to be about 4.6% for C3 and 6.0% C4 plants. The highest short term efficiencies observed for plants in the field, as...
Maximally incompatible quantum observables
Heinosaari, Teiko, E-mail: teiko.heinosaari@utu.fi [Turku Centre for Quantum Physics, Department of Physics and Astronomy, University of Turku, FI-20014 Turku (Finland); Schultz, Jussi, E-mail: jussi.schultz@gmail.com [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Toigo, Alessandro, E-mail: alessandro.toigo@polimi.it [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, I-20133 Milano (Italy); Ziman, Mario, E-mail: ziman@savba.sk [RCQI, Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 84511 Bratislava (Slovakia); Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno (Czech Republic)
2014-05-01
The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.
Extremal Matching Energy of Complements of Trees
Wu Tingzeng
2016-08-01
Full Text Available Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the 1970s. Let T be a tree with n vertices. In this paper, we characterize the trees whose complements have the maximal, second-maximal and minimal matching energy. Furthermore, we determine the trees with edge-independence number p whose complements have the minimum matching energy for p = 1, 2, . . . , [n/2]. When we restrict our consideration to all trees with a perfect matching, we determine the trees whose complements have the second-maximal matching energy.
Theiler, James P [Los Alamos National Laboratory
2009-01-01
Following an analogous distinction in statistical hypothesis testing, we investigate variants of machine learning where the training set comes in matched pairs. We demonstrate that even conventional classifiers can exhibit improved performance when the input data has a matched-pair structure. Online algorithms, in particular, converge quicker when the data is presented in pairs. In some scenarios (such as the weak signal detection problem), matched pairs can be generated from independent samples, with the effect not only doubling the nominal size of the training set, but of providing the structure that leads to better learning. A family of 'dipole' algorithms is introduced that explicitly takes advantage of matched-pair structure in the input data and leads to further performance gains. Finally, we illustrate the application of matched-pair learning to chemical plume detection in hyperspectral imagery.
Parker, Andrew M.; Wandi Bruine de Bruin; Baruch Fischhoff
2007-01-01
Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions...
Swanepoel, Konrad J
2011-01-01
A subset of a normed space X is called equilateral if the distance between any two points is the same. Let m(X) be the smallest possible size of an equilateral subset of X maximal with respect to inclusion. We first observe that Petty's construction of a d-dimensional X of any finite dimension d >= 4 with m(X)=4 can be generalised to show that m(X\\oplus_1\\R)=4 for any X of dimension at least 2 which has a smooth point on its unit sphere. By a construction involving Hadamard matrices we then show that both m(\\ell_p) and m(\\ell_p^d) are finite and bounded above by a function of p, for all 1 1 such that m(X) <= d+1 for all d-dimensional X with Banach-Mazur distance less than c from \\ell_p^d. Using Brouwer's fixed-point theorem we show that m(X) <= d+1 for all d-\\dimensional X with Banach-Mazur distance less than 3/2 from \\ell_\\infty^d. A graph-theoretical argument furthermore shows that m(\\ell_\\infty^d)=d+1. The above results lead us to conjecture that m(X) <= 1+\\dim X.
Freitas, Ayres; Plehn, Tilman
2016-01-01
Effective Lagrangians are a useful tool for a data-driven approach to physics beyond the Standard Model at the LHC. However, for the new physics scales accessible at the LHC, the effective operator expansion is only relatively slowly converging at best. For tree-level processes, it has been found that the agreement between the effective Lagrangian and a range of UV-complete models depends sensitively on the appropriate definition of the matching. We extend this analysis to the one-loop level, which is relevant for electroweak precision data and Higgs decay to photons. We show that near the scale of electroweak symmetry breaking the validity of the effective theory description can be systematically improved through an appropriate matching procedure. In particular, we find a significant increase in accuracy when including suitable terms suppressed by the Higgs vacuum expectation value in the matching.
Ming Yi WANG; Guo ZHAO
2005-01-01
A right R-module E over a ring R is said to be maximally injective in case for any maximal right ideal m of R, every R-homomorphism f : m → E can be extended to an R-homomorphism f' : R → E. In this paper, we first construct an example to show that maximal injectivity is a proper generalization of injectivity. Then we prove that any right R-module over a left perfect ring R is maximally injective if and only if it is injective. We also give a partial affirmative answer to Faith's conjecture by further investigating the property of maximally injective rings. Finally, we get an approximation to Faith's conjecture, which asserts that every injective right R-module over any left perfect right self-injective ring R is the injective hull of a projective submodule.
Andrew M. Parker
2007-12-01
Full Text Available Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007. Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002, we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions, more avoidance of decision making, and greater tendency to experience regret. Contrary to predictions, self-reported maximizers were more likely to report spontaneous decision making. However, the relationship between self-reported maximizing and worse life outcomes is largely unaffected by controls for measures of other decision-making styles, decision-making competence, and demographic variables.
Brüstle, Thomas; Pérotin, Matthieu
2012-01-01
Maximal green sequences are particular sequences of quiver mutations which were introduced by Keller in the context of quantum dilogarithm identities and independently by Cecotti-Cordova-Vafa in the context of supersymmetric gauge theory. Our aim is to initiate a systematic study of these sequences from a combinatorial point of view. Interpreting maximal green sequences as paths in various natural posets arising in representation theory, we prove the finiteness of the number of maximal green sequences for cluster finite quivers, affine quivers and acyclic quivers with at most three vertices. We also give results concerning the possible numbers and lengths of these maximal green sequences. Finally we describe an algorithm for computing maximal green sequences for arbitrary valued quivers which we used to obtain numerous explicit examples that we present.
2017-03-08
member of grain #1. The crystal misorientation between the seed point and its neighbors is checked, and it is assumed that the adjacent pixel is a member...than circles, and whether the performance is a function of grain size dispersion . The EBSD technique-specific ASTM standard, E2627,[17] generally builds...of realistic looking microstructures with varied grain size dispersions and the ability to apply different pixel sampling resolutions to instances of
Rossi, Giulia; Ferrando, Riccardo; Rapallo, Arnaldo; Fortunelli, Alessandro; Curley, Benjamin C.; Lloyd, Lesley D.; Johnston, Roy L.
2005-05-01
Genetic algorithm global optimization of Ag-Pd, Ag-Au, and Pd-Pt clusters is performed. The 34- and 38-atom clusters are optimized for all compositions. The atom-atom interactions are modeled by a semiempirical potential. All three systems are characterized by a small size mismatch and a weak tendency of the larger atoms to segregate at the surface of the smaller ones. As a result, the global minimum structures exhibit a larger mixing than in Ag-Cu and Ag-Ni clusters. Polyicosahedral structures present generally favorable energetic configurations, even though they are less favorable than in the case of the size-mismatched systems. A comparison between all the systems studied here and in the previous paper (on size-mismatched systems) is presented.
Rudiger Bubner
1998-12-01
Full Text Available Even though the maxims' theory is not at thecenter of Kant's ethics, it is the unavoidable basis of the categoric imperative's formulation. Kant leanson the transmitted representations of modem moral theory. During the last decades, the notion of maxims has deserved more attention, due to the philosophy of language's debates on rules, and due to action theory's interest in this notion. I here by brietly expound my views in these discussions.
There has been increased interest in intensification of cow-calf production due to an increasing world population and red meat demand along with reductions in available grazing lands. Over the last 40 years, mature cow size has increased by over 30%, increasing their metabolizable energy requirement...
Beeping a Maximal Independent Set
Afek, Yehuda; Alon, Noga; Bar-Joseph, Ziv; Cornejo, Alejandro; Haeupler, Bernhard; Kuhn, Fabian
2012-01-01
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot...
Akinwande, Olaguoke K., E-mail: gokeakin@gmail.com [University of Louisville Hospital, Department of Interventional Radiology (United States); Philips, Prejesh, E-mail: prejesh.philips@louisville.edu [University of Louisville, Division of Surgical Oncology, Department of Surgery (United States); Duras, Petr, E-mail: durasp@seznam.cz [Fakultní nemocnice Plzeň (Czech Republic); Pluntke, Stefan, E-mail: stefan.pluntke@t-online.de [Onkologe bei Kliniken Essen-Mitte (Germany); Scoggins, Charles, E-mail: charles.scoggins@louisville.edu; Martin, Robert C. G., E-mail: Robert.Martin@louisville.edu [University of Louisville, Division of Surgical Oncology, Department of Surgery (United States)
2015-04-15
PurposeTo compare the feasibility, safety, and efficacy with small and large irinotecan drug-eluting beads (DEBIRI) for treating hepatic colorectal metastases.MethodsUsing our prospectively maintained, multi-center, intra-arterial therapy registry, we identified 196 patients treated with a combination of large beads (100–300 to 500–700 μm) and patients treated with a combination of small beads (70–150 to 100–300 μm). To minimize selection bias, a propensity score analysis was performed to compare both groups.ResultsUnadjusted analysis consisted of 196 and 30 patients treated with large and small beads, respectively. The adjusted analysis consisted of 19 patients each. Unadjusted analysis showed decreased all-grade (p = <0.001) and high-grade adverse effects (p = 0.02) in the small bead group, with a persisting trend toward decreased overall side effects in the adjusted analysis favoring small beads (p = 0.09) The adjusted analysis showed the percentage dose delivered (delivered dose/intended dose) was significantly greater in the small bead group compared to the large bead group (96 vs 79 %; p = 0.005). There were also a lower percentage of treatments terminating in complete stasis in the adjusted analysis (0.0035). Adjusted analysis also showed increased objective response rate (ORR) at 12 months (p = 0.04), with a corresponding trend also seen in the unadjusted analysis (0.09).ConclusionSmaller beads result in increased dose delivery probably due to less propensity to reach complete stasis. It may also lead to more durable long-term efficacy. Smaller beads also demonstrate similarly low toxicity compared to large-sized beads with a trend toward less toxicity.
Janusz Brzozowski
2014-05-01
Full Text Available The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We introduce a new class of regular languages, called the maximally atomic languages, consisting of all languages meeting these bounds. We prove the following result: If L is a regular language of quotient complexity n and G is the subgroup of permutations in the transition semigroup T of the minimal DFA of L, then L is maximally atomic if and only if G is transitive on k-subsets of 1,...,n for 0 <= k <= n and T contains a transformation of rank n-1.
Andersen, Klaus Ejner
1985-01-01
Guinea pig maximization tests (GPMT) with chlorocresol were performed to ascertain whether the sensitization rate was affected by minor changes in the Freund's complete adjuvant (FCA) emulsion used. Three types of emulsion were evaluated: the oil phase was mixed with propylene glycol, saline with...... to the saline/oil emulsion. Placing of the challenge patches affected the response, as simultaneous chlorocresol challenge on the flank located 2 cm closer to the abdomen than the usual challenge site gave decreased reactions....
Hwang, Eui Jin; Park, Chang Min; Kim, Young Tae; Kim, Hyungjin; Goo, Jin Mo
2016-04-01
The purpose of the present study was to compare the frequency of microscopic invasions, disease-free-survival (DFS), and the frequency and pattern of disease recurrence between stage I pulmonary adenocarcinomas appearing as solid nodules and those appearing as part-solid ground-glass nodules (GGNs) after matching their solid parts' size (D(solid)) and patients' age. Among 501 patients who underwent curative surgery for stage I pulmonary adenocarcinomas between 2003 and 2011, 172 patients (86 with solid nodules [M: F = 36: 50; mean age, 62.8 years] and 86 with part-solid GGNs [M:F = 30:56; mean age, 63.0 years]) matched for D(solid) and patients' age were included. DFS, frequency of microscopic invasions, recurrence, and recurrence pattern were compared between the two groups. No significant difference was observed in the frequency of microscopic invasions between the two groups (visceral pleural invasion, 30.23% vs. 29.07%, P = 0.867; lymphatic invasion, 5.81% vs. 3.49%, P = 0.720; vascular invasion, 1.16% vs. 0%, P = 1.000; solid nodules vs. part-slid GGNs, respectively) and DFS (estimated 5-year DFS, 83.6% vs. 81.9%, P = 0.744; solid nodules vs. part-slid GGNs, respectively). As for recurrence and recurrence pattern, there were no significant differences between the solid nodule group (14/86), and part-solid GGN group (12/86) (P = 0.670). Lung parenchymal nodules were the most frequent pattern of disease recurrence in both groups, followed by pleural seeding. In conclusion, after matching D(solid) and patients' age, there was no significant difference in the frequency of microscopic invasions, DFS, and the frequency and pattern of recurrence between stage I pulmonary adenocarcinomas appearing as solid nodules and part-solid GGNs.
The maximal energy of classes of integral circulant graphs
Sander, Jürgen W
2012-01-01
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count $n$ and a set $\\cal D$ of divisors of $n$ in such a way that they have vertex set $\\mathbb{Z}_n$ and edge set ${{a,b}: a,b\\in\\mathbb{Z}_n, \\gcd(a-b,n)\\in {\\cal D}}$. For a fixed prime power $n=p^s$ and a fixed divisor set size $|{\\cal D}| =r$, we analyze the maximal energy among all matching integral circulant graphs. Let $p^{a_1} < p^{a_2} < ... < p^{a_r}$ be the elements of ${\\cal D}$. It turns out that the differences $d_i=a_{i+1}-a_{i}$ between the exponents of an energy maximal divisor set must satisfy certain balance conditions: (i) either all $d_i$ equal $q:=\\frac{s-1}{r-1}$, or at most the two differences $[q]$ and $[q+1]$ may occur; %(for a certain $d$ depending on $r$ and $s$) (ii) there are rules governing the sequence $d_1,...,d_{r-1}$ of consecutive differences. For particular ...
Social group utility maximization
Gong, Xiaowen; Yang, Lei; Zhang, Junshan
2014-01-01
This SpringerBrief explains how to leverage mobile users' social relationships to improve the interactions of mobile devices in mobile networks. It develops a social group utility maximization (SGUM) framework that captures diverse social ties of mobile users and diverse physical coupling of mobile devices. Key topics include random access control, power control, spectrum access, and location privacy.This brief also investigates SGUM-based power control game and random access control game, for which it establishes the socially-aware Nash equilibrium (SNE). It then examines the critical SGUM-b
Brandes, U; Gaertler, M; Goerke, R; Hoefer, M; Nikoloski, Z; Wagner, D
2006-01-01
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to emphasize the plausibility of results, none of these algorithms has been shown to actually compute optimal partitions. We here settle the unknown complexity status of modularity maximization by showing that the corresponding decision version is NP-complete in the strong sense. As a consequence, any efficient, i.e. polynomial-time, algorithm is only heuristic and yields suboptimal partitions on many instances.
Maximizing without difficulty: A modified maximizing scale and its correlates
Linda Lai
2010-01-01
This article presents several studies that replicate and extend previous research on maximizing. A modified scale for measuring individual maximizing tendency is introduced. The scale has adequate psychometric properties and reflects maximizers' aspirations for high standards and their preference for extensive alternative search, but not the decision difficulty aspect included in several previous studies. Based on this scale, maximizing is positively correlated with optimism, need for cogniti...
Maximizing band gaps in plate structures
Halkjær, Søren; Sigmund, Ole; Jensen, Jakob Søndergaard
2006-01-01
Band gaps, i.e., frequency ranges in which waves cannot propagate, can be found in elastic structures for which there is a certain periodic modulation of the material properties or structure. In this paper, we maximize the band gap size for bending waves in a Mindlin plate. We analyze an infinite...... periodic plate using Bloch theory, which conveniently reduces the maximization problem to that of a single base cell. Secondly, we construct a finite periodic plate using a number of the optimized base cells in a postprocessed version. The dynamic properties of the finite plate are investigated...
HEMI: Hyperedge Majority Influence Maximization
Gangal, Varun; Narayanam, Ramasuri
2016-01-01
In this work, we consider the problem of influence maximization on a hypergraph. We first extend the Independent Cascade (IC) model to hypergraphs, and prove that the traditional influence maximization problem remains submodular. We then present a variant of the influence maximization problem (HEMI) where one seeks to maximize the number of hyperedges, a majority of whose nodes are influenced. We prove that HEMI is non-submodular under the diffusion model proposed.
Andersen, Klaus Ejner
1985-01-01
Guinea pig maximization tests (GPMT) with chlorocresol were performed to ascertain whether the sensitization rate was affected by minor changes in the Freund's complete adjuvant (FCA) emulsion used. Three types of emulsion were evaluated: the oil phase was mixed with propylene glycol, saline...... with 30% (v/v) ethanol or saline, respectively. Relative viscosity was used as one measure of physical properties of the emulsion. Higher degrees of sensitization (but not rates) were obtained at the 48 h challenge reading with the oil/propylene glycol and oil/saline + ethanol emulsions compared...... to the saline/oil emulsion. Placing of the challenge patches affected the response, as simultaneous chlorocresol challenge on the flank located 2 cm closer to the abdomen than the usual challenge site gave decreased reactions....
Fast and compact regular expression matching
Bille, Philip; Farach-Colton, Martin
2008-01-01
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...
Beeping a Maximal Independent Set
Afek, Yehuda; Bar-Joseph, Ziv; Cornejo, Alejandro; Haeupler, Bernhard; Kuhn, Fabian
2012-01-01
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one of its neighbors beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and find an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possi...
Matching Supernovae to Galaxies
Kohler, Susanna
2016-12-01
developed a new automated algorithm for matching supernovae to their host galaxies. Their work builds on currently existing algorithms and makes use of information about the nearby galaxies, accounts for the uncertainty of the match, and even includes a machine learning component to improve the matching accuracy.Gupta and collaborators test their matching algorithm on catalogs of galaxies and simulated supernova events to quantify how well the algorithm is able to accurately recover the true hosts.Successful MatchingThe matching algorithms accuracy (purity) as a function of the true supernova-host separation, the supernova redshift, the true hosts brightness, and the true hosts size. [Gupta et al. 2016]The authors find that when the basic algorithm is run on catalog data, it matches supernovae to their hosts with 91% accuracy. Including the machine learning component, which is run after the initial matching algorithm, improves the accuracy of the matching to 97%.The encouraging results of this work which was intended as a proof of concept suggest that methods similar to this could prove very practical for tackling future survey data. And the method explored here has use beyond matching just supernovae to their host galaxies: it could also be applied to other extragalactic transients, such as gamma-ray bursts, tidal disruption events, or electromagnetic counterparts to gravitational-wave detections.CitationRavi R. Gupta et al 2016 AJ 152 154. doi:10.3847/0004-6256/152/6/154
MAXIMS VIOLATIONS IN LITERARY WORK
Widya Hanum Sari Pertiwi
2015-12-01
Full Text Available This study was qualitative research action that focuses to find out the flouting of Gricean maxims and the functions of the flouting in the tales which are included in collection of children literature entitled My Giant Treasury of Stories and Rhymes. The objective of the study is generally to identify the violation of maxims of quantity, quality, relevance, and manner in the data sources and also to analyze the use of the flouting in the tales which are included in the book. Qualitative design using categorizing strategies, specifically coding strategy, was applied. Thus, the researcher as the instrument in this investigation was selecting the tales, reading them, and gathering every item which reflects the violation of Gricean maxims based on some conditions of flouting maxims. On the basis of the data analysis, it was found that the some utterances in the tales, both narration and conversation, flouting the four maxims of conversation, namely maxim of quality, maxim of quantity, maxim of relevance, and maxim of manner. The researcher has also found that the flouting of maxims has one basic function that is to encourage the readers’ imagination toward the tales. This one basic function is developed by six others functions: (1 generating specific situation, (2 developing the plot, (3 enlivening the characters’ utterance, (4 implicating message, (5 indirectly characterizing characters, and (6 creating ambiguous setting. Keywords: children literature, tales, flouting maxims
Trinocular Stereo Matching Based on Correlations Between Baselines and Disparities
GUANYepeng; GUWeikang
2004-01-01
Gray correlation technique is utilized to take the multi-peak feature points with gray correlation coefficients less than a certain range of maximal correlation coefficient as a potential candidate matching set. There exists the maximal correlation between the correct disparities and their corresponding baselines. A trinocular stereo matching algorithm is proposed based on correlations between the baselines and disparities. After computing the correlations between the baselines and disparities, the unique matches can be determined by maximal correlation coefficient. It is proved that the algorithm proposed is valid and credible by 3-D reconstruction on two pairs of actual natural stereo images.
Unified Maximally Natural Supersymmetry
Huang, Junwu
2016-01-01
Maximally Natural Supersymmetry, an unusual weak-scale supersymmetric extension of the Standard Model based upon the inherently higher-dimensional mechanism of Scherk-Schwarz supersymmetry breaking (SSSB), possesses remarkably good fine tuning given present LHC limits. Here we construct a version with precision $SU(2)_{\\rm L} \\times U(1)_{\\rm Y} $ unification: $\\sin^2 \\theta_W(M_Z) \\simeq 0.231$ is predicted to $\\pm 2\\%$ by unifying $SU(2)_{\\rm L} \\times U(1)_{\\rm Y} $ into a 5D $SU(3)_{\\rm EW}$ theory at a Kaluza-Klein scale of $1/R_5 \\sim 4.4\\,{\\rm TeV}$, where SSSB is simultaneously realised. Full unification with $SU(3)_{\\rm C}$ is accommodated by extending the 5D theory to a $N=4$ supersymmetric $SU(6)$ gauge theory on a 6D rectangular orbifold at $1/R_6 \\sim 40 \\,{\\rm TeV}$. TeV-scale states beyond the SM include exotic charged fermions implied by $SU(3)_{\\rm EW}$ with masses lighter than $\\sim 1.2\\,{\\rm TeV}$, and squarks in the mass range $1.4\\,{\\rm TeV} - 2.3\\,{\\rm TeV}$, providing distinct signature...
Online uniform machine covering with the known largest size
无
2007-01-01
This paper investigates the semi-online scheduling problem with the known largest size on two uniform machines. The objective is to maximize the minimum machine completion time. Both lower bounds and algorithms are given. Algorithms are optimal for the majority values of s≥1, where s is the speed ratio of the two machines. The largest gap between the competitive ratio and the lower bound is about 0. 064. Moreover, the overall competitive ratio 2 matches the overall lower bound.
李建军; 张雨晨
2014-01-01
小微经济体在我国国民经济体系中发挥着基础性的作用，但长期以来一直面临着融资难、融资贵的困境。尤其处于初创期的小微经济体，融资途径狭窄，发展被严重制约。国内外研究表明，信息不对称是导致中小微经济体融资难的主要原因之一。近年来，互联网众筹出现快速发展趋势，在解决小微经济体融资方面具有一定的优势。从理论与现实运行机制的研究发现，现众筹与初创期小微经济体融资具有较好的匹配性，它可以有效缓解小微经济体与出资人之间的信息不对称问题，降低融资搜寻成本。%Small and micro-sized economic entity plays a fundamental role in the national economic system of our country, but it has long been faced with the plight of difficulty and high cost of financing. Especially for newly established small and micro-sized economic entities, financing channels are so narrow that their development has been restricted seriously. Both the domestic and foreign research shows that information asymmetry is one of the leading causes of small and micro-sized eco-nomic entity's financing difficulty. In recent years, crowd funding has been developing rapidly and it shows a certain advan-tage in solving the financing problem of small and micro-sized economic entity. So, looking from the theoretical point of view and practical operational mechanism, now crowd funding and start-up financing of small and micro economies have better matching ,it can effectively alleviate the problem of information asymmetry small and micro economies and among investors, reduce the cost of financing the search.
Maximal subgroups of finite groups
S. Srinivasan
1990-01-01
Full Text Available In finite groups maximal subgroups play a very important role. Results in the literature show that if the maximal subgroup has a very small index in the whole group then it influences the structure of the group itself. In this paper we study the case when the index of the maximal subgroups of the groups have a special type of relation with the Fitting subgroup of the group.
Approximate Matching of Hierarchial Data
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...
Finding Maximal Quasiperiodicities in Strings
Brodal, Gerth Stølting; Pedersen, Christian N. S.
2000-01-01
of length n in time O(n log n) and space O(n). Our algorithm uses the suffix tree as the fundamental data structure combined with efficient methods for merging and performing multiple searches in search trees. Besides finding all maximal quasiperiodic substrings, our algorithm also marks the nodes......Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log2 n). In this paper we give an algorithm that finds all maximal quasiperiodic substrings in a string...
Maximizing Entropy over Markov Processes
Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis
2013-01-01
computation reduces to finding a model of a specification with highest entropy. Entropy maximization for probabilistic process specifications has not been studied before, even though it is well known in Bayesian inference for discrete distributions. We give a characterization of global entropy of a process...... as a reward function, a polynomial algorithm to verify the existence of an system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...
Maximizing entropy over Markov processes
Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis
2014-01-01
computation reduces to finding a model of a specification with highest entropy. Entropy maximization for probabilistic process specifications has not been studied before, even though it is well known in Bayesian inference for discrete distributions. We give a characterization of global entropy of a process...... as a reward function, a polynomial algorithm to verify the existence of a system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...
Influence of a Prolonged Tennis Match Play on Serve Biomechanics.
Martin, Caroline; Bideau, Benoit; Delamarche, Paul; Kulpa, Richard
2016-01-01
The aim of this study was to quantify kinematic, kinetic and performance changes that occur in the serve throughout a prolonged tennis match play. Serves of eight male advanced tennis players were recorded with a motion capture system before, at mid-match, and after a 3-hour tennis match. Before and after each match, electromyographic data of 8 upper limb muscles obtained during isometric maximal voluntary contraction were compared to determine the presence of muscular fatigue. Vertical ground reaction forces, rating of perceived exertion, ball speed, and ball impact height were measured. Kinematic and upper limb kinetic variables were computed. The results show decrease in mean power frequency values for several upper limb muscles that is an indicator of local muscular fatigue. Decreases in serve ball speed, ball impact height, maximal angular velocities and an increase in rating of perceived exertion were also observed between the beginning and the end of the match. With fatigue, the majority of the upper limb joint kinetics decreases at the end of the match. No change in timing of maximal angular velocities was observed between the beginning and the end of the match. A prolonged tennis match play may induce fatigue in upper limb muscles, which decrease performance and cause changes in serve maximal angular velocities and joint kinetics. The consistency in timing of maximal angular velocities suggests that advanced tennis players are able to maintain the temporal pattern of their serve technique, in spite of the muscular fatigue development.
Gonzalez-Sanchez, Jon
2010-01-01
Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\\{w (g_1,...,g_n)^{\\pm 1} | g_i \\in G, 1\\leq i\\leq n \\}$ of all $w$-values in $G$. We say that a (finite) group $G$ is $w$-maximal if $|G:w(G)|> |H:w(H)|$ for all proper subgroups $H$ of $G$ and that $G$ is hereditarily $w$-maximal if every subgroup of $G$ is $w$-maximal. In this text we study $w$-maximal and hereditarily $w$-maximal (finite) groups.
Maximizing without difficulty: A modified maximizing scale and its correlates
Lai, Linda
2010-01-01
... included in several previous studies. Based on this scale, maximizing is positively correlated with optimism, need for cognition, desire for consistency, risk aversion, intrinsic motivation, self-efficacy and perceived workload, whereas...
Maximizing and customer loyalty: Are maximizers less loyal?
Linda Lai
2011-06-01
Full Text Available Despite their efforts to choose the best of all available solutions, maximizers seem to be more inclined than satisficers to regret their choices and to experience post-decisional dissonance. Maximizers may therefore be expected to change their decisions more frequently and hence exhibit lower customer loyalty to providers of products and services compared to satisficers. Findings from the study reported here (N = 1978 support this prediction. Maximizers reported significantly higher intentions to switch to another service provider (television provider than satisficers. Maximizers' intentions to switch appear to be intensified and mediated by higher proneness to regret, increased desire to discuss relevant choices with others, higher levels of perceived knowledge of alternatives, and higher ego involvement in the end product, compared to satisficers. Opportunities for future research are suggested.
Are maximizers really unhappy? The measurement of maximizing tendency,
Dalia L. Diab
2008-06-01
Full Text Available Recent research suggesting that people who maximize are less happy than those who satisfice has received considerable fanfare. The current study investigates whether this conclusion reflects the construct itself or rather how it is measured. We developed an alternative measure of maximizing tendency that is theory-based, has good psychometric properties, and predicts behavioral outcomes. In contrast to the existing maximization measure, our new measure did not correlate with life (dissatisfaction, nor with most maladaptive personality and decision-making traits. We conclude that the interpretation of maximizers as unhappy may be due to poor measurement of the construct. We present a more reliable and valid measure for future researchers to use.
Principles of maximally classical and maximally realistic quantum mechanics
S M Roy
2002-08-01
Recently Auberson, Mahoux, Roy and Singh have proved a long standing conjecture of Roy and Singh: In 2-dimensional phase space, a maximally realistic quantum mechanics can have quantum probabilities of no more than + 1 complete commuting cets (CCS) of observables coexisting as marginals of one positive phase space density. Here I formulate a stationary principle which gives a nonperturbative deﬁnition of a maximally classical as well as maximally realistic phase space density. I show that the maximally classical trajectories are in fact exactly classical in the simple examples of coherent states and bound states of an oscillator and Gaussian free particle states. In contrast, it is known that the de Broglie–Bohm realistic theory gives highly nonclassical trajectories.
Maximizing ROI with yield management
Neil Snyder
2001-01-01
.... the technology is based on the concept of yield management, which aims to sell the right product to the right customer at the right price and the right time therefore maximizing revenue, or yield...
Are CEOs Expected Utility Maximizers?
John List; Charles Mason
2009-01-01
Are individuals expected utility maximizers? This question represents much more than academic curiosity. In a normative sense, at stake are the fundamental underpinnings of the bulk of the last half-century's models of choice under uncertainty. From a positive perspective, the ubiquitous use of benefit-cost analysis across government agencies renders the expected utility maximization paradigm literally the only game in town. In this study, we advance the literature by exploring CEO's preferen...
Gaussian maximally multipartite entangled states
Facchi, Paolo; Lupo, Cosmo; Mancini, Stefano; Pascazio, Saverio
2009-01-01
We introduce the notion of maximally multipartite entangled states (MMES) in the context of Gaussian continuous variable quantum systems. These are bosonic multipartite states that are maximally entangled over all possible bipartitions of the system. By considering multimode Gaussian states with constrained energy, we show that perfect MMESs, which exhibit the maximum amount of bipartite entanglement for all bipartitions, only exist for systems containing n=2 or 3 modes. We further numerically investigate the structure of MMESs and their frustration for n <= 7.
All maximally entangling unitary operators
Cohen, Scott M. [Department of Physics, Duquesne University, Pittsburgh, Pennsylvania 15282 (United States); Department of Physics, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213 (United States)
2011-11-15
We characterize all maximally entangling bipartite unitary operators, acting on systems A and B of arbitrary finite dimensions d{sub A}{<=}d{sub B}, when ancillary systems are available to both parties. Several useful and interesting consequences of this characterization are discussed, including an understanding of why the entangling and disentangling capacities of a given (maximally entangling) unitary can differ and a proof that these capacities must be equal when d{sub A}=d{sub B}.
Salvio, Alberto; Strumia, Alessandro; Urbano, Alfredo
2016-01-01
Motivated by the 750 GeV diphoton excess found at LHC, we compute the maximal width into $\\gamma\\gamma$ that a neutral scalar can acquire through a loop of charged fermions or scalars as function of the maximal scale at which the theory holds, taking into account vacuum (meta)stability bounds. We show how an extra gauge symmetry can qualitatively weaken such bounds, and explore collider probes and connections with Dark Matter.
Statistics of polarisation matching
Naus, H.W.L.; Zwamborn, A.P.M.
2014-01-01
The reception of electromagnetic signals depends on the polarisation matching of the transmitting and receiving antenna. The practical matching differs from the theoretical one because of the noise deterioration of the transmitted and eventually received electromagnetic field. In other applications,
Doppler Compensation by using of Segmented Match Filter
2008-01-01
Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “...
Hierarchical model of matching
Pedrycz, Witold; Roventa, Eugene
1992-01-01
The issue of matching two fuzzy sets becomes an essential design aspect of many algorithms including fuzzy controllers, pattern classifiers, knowledge-based systems, etc. This paper introduces a new model of matching. Its principal features involve the following: (1) matching carried out with respect to the grades of membership of fuzzy sets as well as some functionals defined on them (like energy, entropy,transom); (2) concepts of hierarchies in the matching model leading to a straightforward distinction between 'local' and 'global' levels of matching; and (3) a distributed character of the model realized as a logic-based neural network.
Simulating Entangling Unitary Operator Using Non-maximally Entangled States
LI Chun-Xian; WANG Cheng-Zhi; NIE Liu-Ying; LI Jiang-Fan
2009-01-01
We use non-maximally entangled states (NMESs) to simulate an entangling unitary operator (EUO) w/th a certain probability. Given entanglement resources, the probability of the success we achieve is a decreasing function of the parameters of the EUO. Given an EUO, for certain entanglement resources the result is optimal, i.e., the probability obtains a maximal value, and for optimal result higher parameters of the EUO match more amount of entanglement resources. The probability of the success we achieve is higher than the known results under some condition.
Symmetry and approximability of submodular maximization problems
Vondrak, Jan
2011-01-01
A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem. These results hold typically in the value oracle model, where the objective function is accessible via a black box returning f(S) for a given S. We present a general approach to deriving inapproximability results in the value oracle model, based on the notion of symmetry gap. Our main result is that for any fixed instance that exhibits a certain symmetry gap in its multilinear relaxation, there is a naturally related class of instances for which a better approximation factor than the symmetry gap would require exponentially many oracle queries. This unifies several known hardness results for submodular maximization, and implies several new ones. In particular, we prove that there is no constant-factor approximation for the problem of maximizing a non-negative submodular function over the bases of a matroid. We also provide a closely matching approximation algorithm for...
A. Garmroodi Asil
2017-09-01
To further reduce the sulfur dioxide emission of the entire refining process, two scenarios of acid gas or air preheats are investigated when either of them is used simultaneously with the third enrichment scheme. The maximum overall sulfur recovery efficiency and highest combustion chamber temperature is slightly higher for acid gas preheats but air preheat is more favorable because it is more benign. To the best of our knowledge, optimization of the entire GTU + enrichment section and SRU processes has not been addressed previously.
Best matching theory & applications
Moghaddam, Mohsen
2017-01-01
Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Design...
Monetary Exchange with Multilateral Matching
Julien, Benoît; Kennes, John; King, Ian
. In particular, surplus maximization can be achieved in this setting, in equilibrium, with a positive money supply. Moreover, with flexible prices and directed search, the first best allocation can be attained through price posting or through auctions with lotteries, but not through auctions without lotteries......This paper analyzes monetary exchange in a search model allowing for multilateral matches to be formed, according to a standard urn-ballprocess. We consider three physical environments: indivisible goods and money, divisible goods and indivisible money, and divisible goods and money. We compare....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....
Jiang, Nan; Dang, Yijie; Wang, Jian
2016-09-01
Quantum image processing (QIP) means the quantum-based methods to speed up image processing algorithms. Many quantum image processing schemes claim that their efficiency is theoretically higher than their corresponding classical schemes. However, most of them do not consider the problem of measurement. As we all know, measurement will lead to collapse. That is to say, executing the algorithm once, users can only measure the final state one time. Therefore, if users want to regain the results (the processed images), they must execute the algorithms many times and then measure the final state many times to get all the pixels' values. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image matching algorithm. Unlike most of the QIP algorithms, our scheme interests only one pixel (the target pixel) instead of the whole image. It modifies the probability of pixels based on Grover's algorithm to make the target pixel to be measured with higher probability, and the measurement step is executed only once. An example is given to explain the algorithm more vividly. Complexity analysis indicates that the quantum scheme's complexity is O(2n) in contradistinction to the classical scheme's complexity O(2^{2n+2m}), where m and n are integers related to the size of images.
D2-brane Chern-Simons theories: F-maximization = a-maximization
Fluder, Martin
2015-01-01
We study a system of N D2-branes probing a generic Calabi-Yau three-fold singularity in the presence of a non-zero quantized Romans mass n. We argue that the low-energy effective N = 2 Chern-Simons quiver gauge theory flows to a superconformal fixed point in the IR, and construct the dual AdS_4 solution in massive IIA supergravity. We compute the free energy F of the gauge theory on S^3 using localization. In the large N limit we find F = c(nN)^{1/3}a^{2/3}, where c is a universal constant and a is the a-function of the "parent" four-dimensional N = 1 theory on N D3-branes probing the same Calabi-Yau singularity. It follows that maximizing F over the space of admissible R-symmetries is equivalent to maximizing a for this class of theories. Moreover, we show that the gauge theory result precisely matches the holographic free energy of the supergravity solution, and provide a similar matching of the VEV of a BPS Wilson loop operator.
Algebraic curves of maximal cyclicity
Caubergh, Magdalena; Dumortier, Freddy
2006-01-01
The paper deals with analytic families of planar vector fields, studying methods to detect the cyclicity of a non-isolated closed orbit, i.e. the maximum number of limit cycles that can locally bifurcate from it. It is known that this multi-parameter problem can be reduced to a single-parameter one, in the sense that there exist analytic curves in parameter space along which the maximal cyclicity can be attained. In that case one speaks about a maximal cyclicity curve (mcc) in case only the number is considered and of a maximal multiplicity curve (mmc) in case the multiplicity is also taken into account. In view of obtaining efficient algorithms for detecting the cyclicity, we investigate whether such mcc or mmc can be algebraic or even linear depending on certain general properties of the families or of their associated Bautin ideal. In any case by well chosen examples we show that prudence is appropriate.
Telleman, G.; Meijer, H. J. A.; Vissink, A.; Raghoebar, G. M.
2013-01-01
ObjectiveTo assess the performance of short nanorough implants (8.5mm in length) provided with either a platform-matched or a platform-switched implant-abutment connection, placed in the resorbed posterior region of partially dentate patients. Materials and MethodsA total of 149 implants with a dual
BOUNDEDNESS OF MAXIMAL SINGULAR INTEGRALS
CHEN JIECHENG; ZHU XIANGRONG
2005-01-01
The authors study the singular integrals under the Hormander condition and the measure not satisfying the doubling condition. At first, if the corresponding singular integral is bounded from L2 to itseff, it is proved that the maximal singu lar integral is bounded from L∞ to RBMO except that it is infinite μ-a.e. on Rd. A sufficient condition and a necessary condition such that the maximal singular integral is bounded from L2 to itself are also obtained. There is a small gap between the two conditions.
Robust Face Image Matching under Illumination Variations
Yang Chyuan-Huei Thomas
2004-01-01
Full Text Available Face image matching is an essential step for face recognition and face verification. It is difficult to achieve robust face matching under various image acquisition conditions. In this paper, a novel face image matching algorithm robust against illumination variations is proposed. The proposed image matching algorithm is motivated by the characteristics of high image gradient along the face contours. We define a new consistency measure as the inner product between two normalized gradient vectors at the corresponding locations in two images. The normalized gradient is obtained by dividing the computed gradient vector by the corresponding locally maximal gradient magnitude. Then we compute the average consistency measures for all pairs of the corresponding face contour pixels to be the robust matching measure between two face images. To alleviate the problem due to shadow and intensity saturation, we introduce an intensity weighting function for each individual consistency measure to form a weighted average of the consistency measure. This robust consistency measure is further extended to integrate multiple face images of the same person captured under different illumination conditions, thus making our robust face matching algorithm. Experimental results of applying the proposed face image matching algorithm on some well-known face datasets are given in comparison with some existing face recognition methods. The results show that the proposed algorithm consistently outperforms other methods and achieves higher than 93% recognition rate with three reference images for different datasets under different lighting conditions.
Gal, Avigdor
2011-01-01
Schema matching is the task of providing correspondences between concepts describing the meaning of data in various heterogeneous, distributed data sources. Schema matching is one of the basic operations required by the process of data and schema integration, and thus has a great effect on its outcomes, whether these involve targeted content delivery, view integration, database integration, query rewriting over heterogeneous sources, duplicate data elimination, or automatic streamlining of workflow activities that involve heterogeneous data sources. Although schema matching research has been o
Understanding maximal repetitions in strings
Crochemore, Maxime
2008-01-01
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach, the stronger result concerning the linearity of the sum of exponents of all runs follows easily.
E. J. Farrell
1987-01-01
Full Text Available Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown. Tables of the polynomials are given for each type of graph. Explicit formulae are then obtained for the number of defect-d matchings in the graphs, for various values of d. In particular, formulae are derived for the number of perfect matchings in all three types of graphs. Finally, results are given for the total number of matchings in the graphs.
Towards optimal packed string matching
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2014-01-01
In the packed string matching problem, it is assumed that each machine word can accommodate up to α characters, thus an n-character string occupies n/α memory words.(a) We extend the Crochemore–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real......-time, achieving a factor α speedup over traditional algorithms that examine each character individually. Our macro-level algorithm only uses the standard AC0 instructions of the word-RAM model (i.e. no integer multiplication) plus two specialized micro-level AC0 word-size packed-string instructions. The main word...... matching work.(b) We also consider the complexity of the packed string matching problem in the classical word-RAM model in the absence of the specialized micro-level instructions wssm and wslm. We propose micro-level algorithms for the theoretically efficient emulation using parallel algorithms techniques...
Optimal technique for maximal forward rotating vaults in men's gymnastics.
Hiley, Michael J; Jackson, Monique I; Yeadon, Maurice R
2015-08-01
In vaulting a gymnast must generate sufficient linear and angular momentum during the approach and table contact to complete the rotational requirements in the post-flight phase. This study investigated the optimization of table touchdown conditions and table contact technique for the maximization of rotation potential for forwards rotating vaults. A planar seven-segment torque-driven computer simulation model of the contact phase in vaulting was evaluated by varying joint torque activation time histories to match three performances of a handspring double somersault vault by an elite gymnast. The closest matching simulation was used as a starting point to maximize post-flight rotation potential (the product of angular momentum and flight time) for a forwards rotating vault. It was found that the maximized rotation potential was sufficient to produce a handspring double piked somersault vault. The corresponding optimal touchdown configuration exhibited hip flexion in contrast to the hyperextended configuration required for maximal height. Increasing touchdown velocity and angular momentum lead to additional post-flight rotation potential. By increasing the horizontal velocity at table touchdown, within limits obtained from recorded performances, the handspring double somersault tucked with one and a half twists, and the handspring triple somersault tucked became theoretically possible. Copyright © 2015 Elsevier B.V. All rights reserved.
Ontology Matching Across Domains
2010-05-01
matching include GMO [1], Anchor-Prompt [2], and Similarity Flooding [3]. GMO is an iterative structural matcher, which uses RDF bipartite graphs to...AFRL under contract# FA8750-09-C-0058. References [1] Hu, W., Jian, N., Qu, Y., Wang, Y., “ GMO : a graph matching for ontologies”, in: Proceedings of
Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J
2008-01-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...
Note on maximal distance separable codes
YANG Jian-sheng; WANG De-xiu; JIN Qing-fang
2009-01-01
In this paper, the maximal length of maximal distance separable(MDS)codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.
Maximization, learning, and economic behavior.
Erev, Ido; Roth, Alvin E
2014-07-22
The rationality assumption that underlies mainstream economic theory has proved to be a useful approximation, despite the fact that systematic violations to its predictions can be found. That is, the assumption of rational behavior is useful in understanding the ways in which many successful economic institutions function, although it is also true that actual human behavior falls systematically short of perfect rationality. We consider a possible explanation of this apparent inconsistency, suggesting that mechanisms that rest on the rationality assumption are likely to be successful when they create an environment in which the behavior they try to facilitate leads to the best payoff for all agents on average, and most of the time. Review of basic learning research suggests that, under these conditions, people quickly learn to maximize expected return. This review also shows that there are many situations in which experience does not increase maximization. In many cases, experience leads people to underweight rare events. In addition, the current paper suggests that it is convenient to distinguish between two behavioral approaches to improve economic analyses. The first, and more conventional approach among behavioral economists and psychologists interested in judgment and decision making, highlights violations of the rational model and proposes descriptive models that capture these violations. The second approach studies human learning to clarify the conditions under which people quickly learn to maximize expected return. The current review highlights one set of conditions of this type and shows how the understanding of these conditions can facilitate market design.
When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings
Bansal, Nikhil; Nagarajan, Viswanath; Rudra, Atri
2010-01-01
Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. We are just given these numbers $p_e$, and want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it--and if the edge is indeed present in the graph, we are forced to add it to our matching. Further, each vertex $i$ is allowed to be queried at most $t_i$ times. How should we adaptively query the edges to maximize the expected weight of the matching? We consider several matching problems in this general framework (some of which arise in kidney exchanges and online dating, and others arise in modeling online advertisements); we give LP-rounding based constant-factor approximation algorithms for these problems.
Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J
2009-06-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Jain, Anil K; Feng, Jianjiang
2011-01-01
Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.
Optimal Packed String Matching
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2011-01-01
In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speedup...... over traditional algorithms that examine each character individually. Our solution can be efficiently implemented, unlike prior theoretical packed string matching work. We adapt the standard RAM model and only use its AC0 instructions (i.e., no multiplication) plus two specialized AC0 packed string...
Maximizing production rates of the Linde Hampson machine
Maytal, B.-Z.
2006-01-01
In contrast to the ideal case of unlimited size recuperator, any real Linde-Hampson machine of finite size recuperator can be optimized to reach the extreme rates of performance. The group of cryocoolers sharing the same size recuperator is optimized in a closed form by determining the corresponding flow rate which maximizes its rate of cold production. For a similar group of liquefiers an optimal flow rate is derived to maximize the rate of production of liquid cryogen. The group of cryocoolers sharing a constant and given flow rate is optimized by shortening the recuperator for reaching a maximum compactness measured by the cooling power per unit size of the recuperator. The optimum conditions are developed for nitrogen and argon. The relevance of this analysis is discussed in the context of practice of fast cooldown Joule-Thomson cryocooling.
Infographic explaining NCI-COG Pediatric MATCH, a cancer treatment clinical trial for children and adolescents, from 1 to 21 years of age, that is testing the use of precision medicine for pediatric cancers.
Data Matching Imputation System
National Oceanic and Atmospheric Administration, Department of Commerce — The DMIS dataset is a flat file record of the matching of several data set collections. Primarily it consists of VTRs, dealer records, Observer data in conjunction...
Brooks, Martin; And Others
1983-01-01
The Cognitive Levels Matching Project trains teachers to guide students' skill acquisition and problem-solving processes by assessing students' cognitive levels and adapting their teaching materials accordingly. (MLF)
Increased high-intensity activity in elite Australian football finals matches.
Aughey, Robert J
2011-09-01
Australian football (AF) is a highly intermittent sport, requiring athletes to accelerate hundreds of times with repeated bouts of high-intensity running (HIR). Players aim to be in peak physical condition for finals, with anecdotal evidence of increased speed and pressure of these games. However, no data exists on the running demands of finals games, and therefore the aim of this study was to compare the running demands of finals to regular season games with matched players and opponents. Player movement was recorded by GPS at 5 Hz and expressed per period of the match (rotation), for total distance, high-intensity running (HIR, 4.17-10.00 m·s-1) and maximal accelerations (2.78-10.00 m·s-2). All data was compared for regular season and finals games and the magnitude of effects was analyzed with the effect size (ES) statistic and expressed with confidence intervals. Each of the total distance (11%; ES: 0.78 ± 0.30), high-intensity running distance (9%; ES: 0.29 ± 0.25) and number of maximal accelerations (97%; ES: 1.30 ± 0.20) increased in finals games. The largest percentage increases in maximal accelerations occurred from a commencement velocity of between 3-4 (47%; ES: 0.56 ± 0.21) and 4-5 m·s-1 (51%; ES: 0.72 ± 0.26), and with players nearly double the number of maximal accelerations in finals compared with regular season games. This large increase is superimposed on requirements to cover a greater total distance and spend more time at high velocity during finals games. Players can be effectively conditioned to cope with these increased demands, even during a long competitive season.
MAXIMIZING THE BENEFITS OF ERP SYSTEMS
Paulo André da Conceição Menezes
2010-04-01
Full Text Available The ERP (Enterprise Resource Planning systems have been consolidated in companies with different sizes and sectors, allowing their real benefits to be definitively evaluated. In this study, several interactions have been studied in different phases, such as the strategic priorities and strategic planning defined as ERP Strategy; business processes review and the ERP selection in the pre-implementation phase, the project management and ERP adaptation in the implementation phase, as well as the ERP revision and integration efforts in the post-implementation phase. Through rigorous use of case study methodology, this research led to developing and to testing a framework for maximizing the benefits of the ERP systems, and seeks to contribute for the generation of ERP initiatives to optimize their performance.
MAXIMIZING THE BENEFITS OF ERP SYSTEMS
Paulo André Da Conceiçao Menezes
2010-04-01
Full Text Available The ERP (Enterprise Resource Planning systems have been consolidated in companies with different sizes and sectors, allowing their real benefits to be definitively evaluated. In this study, several interactions have been studied in different phases, such as the strategic priorities and strategic planning defined as ERP Strategy; business processes review and the ERP selection in the pre-implementation phase, the project management and ERP adaptation in the implementation phase, as well as the ERP revision and integration efforts in the post-implementation phase. Through rigorous use of case study methodology, this research led to developing and to testing a framework for maximizing the benefits of the ERP systems, and seeks to contribute for the generation of ERP initiatives to optimize their performance.
Asymptotics of robust utility maximization
Knispel, Thomas
2012-01-01
For a stochastic factor model we maximize the long-term growth rate of robust expected power utility with parameter $\\lambda\\in(0,1)$. Using duality methods the problem is reformulated as an infinite time horizon, risk-sensitive control problem. Our results characterize the optimal growth rate, an optimal long-term trading strategy and an asymptotic worst-case model in terms of an ergodic Bellman equation. With these results we propose a duality approach to a "robust large deviations" criterion for optimal long-term investment.
Multivariate residues and maximal unitarity
Søgaard, Mads; Zhang, Yang
2013-12-01
We extend the maximal unitarity method to amplitude contributions whose cuts define multidimensional algebraic varieties. The technique is valid to all orders and is explicitly demonstrated at three loops in gauge theories with any number of fermions and scalars in the adjoint representation. Deca-cuts realized by replacement of real slice integration contours by higher-dimensional tori encircling the global poles are used to factorize the planar triple box onto a product of trees. We apply computational algebraic geometry and multivariate complex analysis to derive unique projectors for all master integral coefficients and obtain compact analytic formulae in terms of tree-level data.
Maximal Congruences on Some Semigroups
Jintana Sanwong; R.P. Sullivan
2007-01-01
In 1976 Howie proved that a finite congruence-free semigroup is a simple group if it has at least three elements but no zero elementInfinite congruence-free semigroups are far more complicated to describe, but some have been constructed using semigroups of transformations (for example, by Howie in 1981 and by Marques in 1983)Here, forcertain semigroups S of numbers and of transformations, we determine all congruences p on S such that S/p is congruence-free, that is, we describe all maximal congruences on such semigroups S.
Knowledge discovery by accuracy maximization.
Cacciatore, Stefano; Luchinat, Claudio; Tenori, Leonardo
2014-04-01
Here we describe KODAMA (knowledge discovery by accuracy maximization), an unsupervised and semisupervised learning algorithm that performs feature extraction from noisy and high-dimensional data. Unlike other data mining methods, the peculiarity of KODAMA is that it is driven by an integrated procedure of cross-validation of the results. The discovery of a local manifold's topology is led by a classifier through a Monte Carlo procedure of maximization of cross-validated predictive accuracy. Briefly, our approach differs from previous methods in that it has an integrated procedure of validation of the results. In this way, the method ensures the highest robustness of the obtained solution. This robustness is demonstrated on experimental datasets of gene expression and metabolomics, where KODAMA compares favorably with other existing feature extraction methods. KODAMA is then applied to an astronomical dataset, revealing unexpected features. Interesting and not easily predictable features are also found in the analysis of the State of the Union speeches by American presidents: KODAMA reveals an abrupt linguistic transition sharply separating all post-Reagan from all pre-Reagan speeches. The transition occurs during Reagan's presidency and not from its beginning.
Inapproximability of maximal strip recovery
Jiang, Minghui
2009-01-01
In comparative genomic, the first step of sequence analysis is usually to decompose two or more genomes into syntenic blocks that are segments of homologous chromosomes. For the reliable recovery of syntenic blocks, noise and ambiguities in the genomic maps need to be removed first. Maximal Strip Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff for reliably recovering syntenic blocks from genomic maps in the midst of noise and ambiguities. Given $d$ genomic maps as sequences of gene markers, the objective of \\msr{d} is to find $d$ subsequences, one subsequence of each genomic map, such that the total length of syntenic blocks in these subsequences is maximized. For any constant $d \\ge 2$, a polynomial-time 2d-approximation for \\msr{d} was previously known. In this paper, we show that for any $d \\ge 2$, \\msr{d} is APX-hard, even for the most basic version of the problem in which all gene markers are distinct and appear in positive orientation in each genomic map. Moreover, we provi...
Maximal right smooth extension chains
Huang, Yun Bao
2010-01-01
If $w=u\\alpha$ for $\\alpha\\in \\Sigma=\\{1,2\\}$ and $u\\in \\Sigma^*$, then $w$ is said to be a \\textit{simple right extension}of $u$ and denoted by $u\\prec w$. Let $k$ be a positive integer and $P^k(\\epsilon)$ denote the set of all $C^\\infty$-words of height $k$. Set $u_{1},\\,u_{2},..., u_{m}\\in P^{k}(\\epsilon)$, if $u_{1}\\prec u_{2}\\prec ...\\prec u_{m}$ and there is no element $v$ of $P^{k}(\\epsilon)$ such that $v\\prec u_{1}\\text{or} u_{m}\\prec v$, then $u_{1}\\prec u_{2}\\prec...\\prec u_{m}$ is said to be a \\textit{maximal right smooth extension (MRSE) chains}of height $k$. In this paper, we show that \\textit{MRSE} chains of height $k$ constitutes a partition of smooth words of height $k$ and give the formula of the number of \\textit{MRSE} chains of height $k$ for each positive integer $k$. Moreover, since there exist the minimal height $h_1$ and maximal height $h_2$ of smooth words of length $n$ for each positive integer $n$, we find that \\textit{MRSE} chains of heights $h_1-1$ and $h_2+1$ are good candidates t...
Doppler Compensation by using of Segmented Match Filter
Nader Ghadimi
2008-09-01
Full Text Available Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “Mixer Array” and “Segmented Match Filter” are proposed for Doppler compensation. The operation of these two methods as Doppler compensation techniques are considered theoretically. The simulation is used to demonstrate the Doppler compensation performance of new techniques compared to conventional methods.
Approaches for Stereo Matching
Takouhi Ozanian
1995-04-01
Full Text Available This review focuses on the last decade's development of the computational stereopsis for recovering three-dimensional information. The main components of the stereo analysis are exposed: image acquisition and camera modeling, feature selection, feature matching and disparity interpretation. A brief survey is given of the well known feature selection approaches and the estimation parameters for this selection are mentioned. The difficulties in identifying correspondent locations in the two images are explained. Methods as to how effectively to constrain the search for correct solution of the correspondence problem are discussed, as are strategies for the whole matching process. Reasons for the occurrence of matching errors are considered. Some recently proposed approaches, employing new ideas in the modeling of stereo matching in terms of energy minimization, are described. Acknowledging the importance of computation time for real-time applications, special attention is paid to parallelism as a way to achieve the required level of performance. The development of trinocular stereo analysis as an alternative to the conventional binocular one, is described. Finally a classification based on the test images for verification of the stereo matching algorithms, is supplied.
Muscle mitochondrial capacity exceeds maximal oxygen delivery in humans
Boushel, Robert Christopher; Gnaiger, Erich; Calbet, Jose A L
2011-01-01
Across a wide range of species and body mass a close matching exists between maximal conductive oxygen delivery and mitochondrial respiratory rate. In this study we investigated in humans how closely in-vivo maximal oxygen consumption (VO(2) max) is matched to state 3 muscle mitochondrial...... respiration. High resolution respirometry was used to quantify mitochondrial respiration from the biopsies of arm and leg muscles while in-vivo arm and leg VO(2) were determined by the Fick method during leg cycling and arm cranking. We hypothesized that muscle mitochondrial respiratory rate exceeds...... that of systemic oxygen delivery. The state 3 mitochondrial respiration of the deltoid muscle (4.3±0.4 mmol o(2)kg(-1) min(-1)) was similar to the in-vivo VO(2) during maximal arm cranking (4.7±0.5 mmol O(2) kg(-1) min(-1)) with 6 kg muscle. In contrast, the mitochondrial state 3 of the quadriceps was 6.9±0.5 mmol...
Key Frame Extraction for Text Based Video Retrieval Using Maximally Stable Extremal Regions
Werachard Wattanarachothai
2015-04-01
Full Text Available This paper presents a new approach for text-based video content retrieval system. The proposed scheme consists of three main processes that are key frame extraction, text localization and keyword matching. For the key-frame extraction, we proposed a Maximally Stable Extremal Region (MSER based feature which is oriented to segment shots of the video with different text contents. In text localization process, in order to form the text lines, the MSERs in each key frame are clustered based on their similarity in position, size, color, and stroke width. Then, Tesseract OCR engine is used for recognizing the text regions. In this work, to improve the recognition results, we input four images obtained from different pre-processing methods to Tesseract engine. Finally, the target keyword for querying is matched with OCR results based on an approximate string search scheme. The experiment shows that, by using the MSER feature, the videos can be segmented by using efficient number of shots and provide the better precision and recall in comparison with a sum of absolute difference and edge based method.
Mode matching for optimal plasmonic nonlinear generation
O'Brien, Kevin; Suchowski, Haim; Rho, Jun Suk; Kante, Boubacar; Yin, Xiaobo; Zhang, Xiang
2013-03-01
Nanostructures and metamaterials have attracted interest in the nonlinear optics community due to the possibility of engineering their nonlinear responses; however, the underlying physics to describe nonlinear light generation in nanostructures and the design rules to maximize the emission are still under debate. We study the geometry dependence of the second harmonic and third harmonic emission from gold nanostructures, by designing arrays of nanostructures whose geometry varies from bars to split ring resonators. We fix the length (and volume) of the nanostructure on one axis, and change the morphology from a split ring resonator on the other axis. We observed that the optimal second harmonic generation does not occur at the morphology indicated by a nonlinear oscillator model with parameters derived from the far field transmission and is not maximized by a spectral overlap of the plasmonic modes; however, we find a near field overlap integral and mode matching considerations accurately predict the optimal geometry.
Bellahsene, Zohra; Rahm, Erhard
2011-01-01
Requiring heterogeneous information systems to cooperate and communicate has now become crucial, especially in application areas like e-business, Web-based mash-ups and the life sciences. Such cooperating systems have to automatically and efficiently match, exchange, transform and integrate large data sets from different sources and of different structure in order to enable seamless data exchange and transformation. The book edited by Bellahsene, Bonifati and Rahm provides an overview of the ways in which the schema and ontology matching and mapping tools have addressed the above requirements
Middle matching mining algorithm
GUO Ping; CHEN Li
2003-01-01
A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.
The maximal D = 4 supergravities
Wit, Bernard de [Institute for Theoretical Physics and Spinoza Institute, Utrecht University, Postbus 80.195, NL-3508 TD Utrecht (Netherlands); Samtleben, Henning [Laboratoire de Physique, ENS Lyon, 46 allee d' Italie, F-69364 Lyon CEDEX 07 (France); Trigiante, Mario [Dept. of Physics, Politecnico di Torino, Corso Duca degli Abruzzi 24, I-10129 Turin (Italy)
2007-06-15
All maximal supergravities in four space-time dimensions are presented. The ungauged Lagrangians can be encoded in an E{sub 7(7)}-Sp(56; R)/GL(28) matrix associated with the freedom of performing electric/magnetic duality transformations. The gauging is defined in terms of an embedding tensor {theta} which encodes the subgroup of E{sub 7(7)} that is realized as a local invariance. This embedding tensor may imply the presence of magnetic charges which require corresponding dual gauge fields. The latter can be incorporated by using a recently proposed formulation that involves tensor gauge fields in the adjoint representation of E{sub 7(7)}. In this formulation the results take a universal form irrespective of the electric/magnetic duality basis. We present the general class of supersymmetric and gauge invariant Lagrangians and discuss a number of applications.
Maximizing profit using recommender systems
Das, Aparna; Ricketts, Daniel
2009-01-01
Traditional recommendation systems make recommendations based solely on the customer's past purchases, product ratings and demographic data without considering the profitability the items being recommended. In this work we study the question of how a vendor can directly incorporate the profitability of items into its recommender so as to maximize its expected profit while still providing accurate recommendations. Our approach uses the output of any traditional recommender system and adjust them according to item profitabilities. Our approach is parameterized so the vendor can control how much the recommendation incorporating profits can deviate from the traditional recommendation. We study our approach under two settings and show that it achieves approximately 22% more profit than traditional recommendations.
The maximal D=5 supergravities
de Wit, Bernard; Trigiante, M; Wit, Bernard de; Samtleben, Henning; Trigiante, Mario
2007-01-01
The general Lagrangian for maximal supergravity in five spacetime dimensions is presented with vector potentials in the \\bar{27} and tensor fields in the 27 representation of E_6. This novel tensor-vector system is subject to an intricate set of gauge transformations, describing 3(27-t) massless helicity degrees of freedom for the vector fields and 3t massive spin degrees of freedom for the tensor fields, where the (even) value of t depends on the gauging. The kinetic term of the tensor fields is accompanied by a unique Chern-Simons coupling which involves both vector and tensor fields. The Lagrangians are completely encoded in terms of the embedding tensor which defines the E_6 subgroup that is gauged by the vectors. The embedding tensor is subject to two constraints which ensure the consistency of the combined vector-tensor gauge transformations and the supersymmetry of the full Lagrangian. This new formulation encompasses all possible gaugings.
Constraint Propagation as Information Maximization
Abdallah, A Nait
2012-01-01
Dana Scott used the partial order among partial functions for his mathematical model of recursively defined functions. He interpreted the partial order as one of information content. In this paper we elaborate on Scott's suggestion of regarding computation as a process of information maximization by applying it to the solution of constraint satisfaction problems. Here the method of constraint propagation can be interpreted as decreasing uncertainty about the solution -- that is, as gain in information about the solution. As illustrative example we choose numerical constraint satisfaction problems to be solved by interval constraints. To facilitate this approach to constraint solving we formulate constraint satisfaction problems as formulas in predicate logic. This necessitates extending the usual semantics for predicate logic so that meaning is assigned not only to sentences but also to formulas with free variables.
Neuromuscular fatigue after maximal exercise in patients with cystic fibrosis.
Vallier, J M; Gruet, M; Mely, L; Pensini, M; Brisswalter, J
2011-04-01
The aim of this study was to determine whether patients with cystic fibrosis (CF), despite their ventilatory limitation, would develop neuromuscular fatigue of quadriceps muscles following a maximal cycling exercise. Eleven adults with CF (age=26.8±6.9years; forced expiratory volume in 1s=54.1±12.8% predicted) and 11 age-matched healthy subjects performed a maximal incremental cycle test with respiratory gas exchange measurements. Maximal voluntary contraction (MVC) and electromyographic (EMG) activity of the vastus medialis muscle were recorded before and after exercise. Neural and contractile properties of the quadriceps were also investigated using femoral nerve electrical stimulation. Patients had lower exercise capacity, peak oxygen uptake and MVC than controls. MVC fell significantly postexercise in both groups (CF: -20±10%, controls: -19±6%; ppattern (-38.4±14.4%, -42.1±14.7% and -15±20.4%) but the statistical significance was not reached for the maximal rate of twitch torque relaxation. In conclusion, CF patients demonstrated lower limb fatigue following symptom-limited cycle exercise, which was comparable to that exhibited by healthy controls. This fatigue may be due to contractile impairments and not to transmission failure. Further studies should be conducted in a larger sample to confirm these preliminary results.
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
彭硕
2002-01-01
It was a Saturday morning, our school football team was going to have a match with the No. 28 Middle Schooh They were really a strong team. But we weren't afraid of them. We had many mare good players on our team, so we were stronger than ever before.
Herrnstein, R. J.
1979-01-01
The matching law for reinforced behavior solves a differential equation relating infinitesimal changes in behavior to infinitesimal changes in reinforcement. The equation expresses plausible conceptions of behavior and reinforcement, yields a simple nonlinear operator model for acquisition, and suggests a alternative to the economic law of…
Claesson, Anders
2010-01-01
We show that there are n! matchings on 2n points without, so called, left (neighbor) nestings. We also define a set of naturally labeled (2+2)-free posets, and show that there are n! such posets on n elements. Our work was inspired by Bousquet-M\\'elou, Claesson, Dukes and Kitaev [arXiv:0806.0666]. They gave bijections between four classes of combinatorial objects: matchings with no neighbor nestings (due to Stoimenow), unlabeled (2+2)-free posets, permutations avoiding a specific pattern, and so called ascent sequences. We believe that certain statistics on our matchings and posets could generalize the work of Bousquet-M\\'elou et al.\\ and we make a conjecture to that effect. We also identify natural subsets of matchings and posets that are equinumerous to the class of unlabeled (2+2)-free posets. We give bijections that show the equivalence of (neighbor) restrictions on nesting arcs with (neighbor) restrictions on crossing arcs. These bijections are thought to be of independent interest. One of the bijections...
'Wiggle matching' radiocarbon dates
Ramsey, CB; van der Plicht, J; Weninger, B
2001-01-01
This paper covers three different methods of matching radiocarbon dates to the 'wiggles' of the calibration curve in those situations where the age difference between the C-14 dates is known. These methods are most often applied to tree-ring sequences. The simplest approach is to use a classical Chi
Jeuring, J.T.
2007-01-01
The pattern matching problem can be informally specified as follows: given a pattern and a text, find all occurrences of the pattern in the text. The pattern and the text may both be lists, or they may both be trees, or they may both be multi-dimensional arrays, etc. This paper describes a general p
[Propensity score matching in SPSS].
Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli
2015-11-01
To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.
Design of New SAW DQPSK Matched Filter
无
2006-01-01
A new surface acoustic wave differential quadraphase shift key(SAW DQPSK) spread spectrum(SS) signal matched filter based on the fusion of SS and differential modulation is reported. The design of multi-phase coded SAW matched filter is proposed rather than another design of SAW DQPSK filter, which can cut in a half of the delay time of SAW DQPSK matched filter and SAW fixed delay line(FDL) used for differential demodulation. This breakthrough is made the system largely reduce a size and process much easily. This method can also be feasible in other SAW MPSK matched filter design especially when the modulation phase number is larger than 4. The design example and its experimental results are given.
Fast algorithm on string cross pattern matching
Liu Gongshen; Li Jianhua; Li Shenghong
2005-01-01
Given a set U which is consisted of strings defined on alphabet ∑ , string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplication of strings.This paper presents a fast string cross pattern matching algorithm based on extracting high frequency strings. Compared with existing algorithms including single-pattern algorithms and multi-pattern matching algorithms, this algorithm is featured by both low time complexityand low space complexity. Because Chinese alphabet is large and the average length of Chinese words is much short, this algorithm is more suitable to process the text written by Chinese, especially when the size of ∑ is large and the number of strings is far more than the maximum length of strings of set U.
Graphical models and point pattern matching.
Caetano, Tibério S; Caelli, Terry; Schuurmans, Dale; Barone, Dante A C
2006-10-01
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.
Maximal switchability of centralized networks
Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu
2016-08-01
We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.
A Maximally Supersymmetric Kondo Model
Harrison, Sarah; Kachru, Shamit; Torroba, Gonzalo; /Stanford U., Phys. Dept. /SLAC
2012-02-17
We study the maximally supersymmetric Kondo model obtained by adding a fermionic impurity to N = 4 supersymmetric Yang-Mills theory. While the original Kondo problem describes a defect interacting with a free Fermi liquid of itinerant electrons, here the ambient theory is an interacting CFT, and this introduces qualitatively new features into the system. The model arises in string theory by considering the intersection of a stack of M D5-branes with a stack of N D3-branes, at a point in the D3 worldvolume. We analyze the theory holographically, and propose a dictionary between the Kondo problem and antisymmetric Wilson loops in N = 4 SYM. We perform an explicit calculation of the D5 fluctuations in the D3 geometry and determine the spectrum of defect operators. This establishes the stability of the Kondo fixed point together with its basic thermodynamic properties. Known supergravity solutions for Wilson loops allow us to go beyond the probe approximation: the D5s disappear and are replaced by three-form flux piercing a new topologically non-trivial S3 in the corrected geometry. This describes the Kondo model in terms of a geometric transition. A dual matrix model reflects the basic properties of the corrected gravity solution in its eigenvalue distribution.
Resurgence matches quantization
Couso-Santamaría, Ricardo; Mariño, Marcos; Schiappa, Ricardo
2017-04-01
The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi–Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local {{{P}}2} toric Calabi–Yau threefold, the present work shows how the Borel–Padé–Écalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.
Resurgence Matches Quantization
Couso-Santamaría, Ricardo; Schiappa, Ricardo
2016-01-01
The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi-Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local P2 toric Calabi-Yau threefold, the present work shows how the Borel-Pade-Ecalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.
Bordenave, Charles; Salez, Justin
2011-01-01
We prove that the local weak convergence of a sequence of graphs is enough to guarantee the convergence of their normalized matching numbers. The limiting quantity is described by a local recursion defined on the weak limit of the graph sequence. However, this recursion may admit several solutions, implying non-trivial long-range dependencies between the edges of a largest matching. We overcome this lack of correlation decay by introducing a perturbative parameter called the temperature, which we let progressively go to zero. When the local weak limit is a unimodular Galton-Watson tree, the recursion simplifies into a distributional equation, resulting into an explicit formula that considerably extends the well-known one by Karp and Sipser for Erd\\"os-R\\'enyi random graphs.
Characteristic Evolution and Matching
Winicour Jeffrey
2005-12-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. A prime application of characteristic evolution is to compute waveforms via Cauchy-characteristic matching, which is also reviewed.
Nielsen, J R; Mickley, H; Damsgaard, E M
1990-01-01
A maximal exercise test was performed in 54 patients with acute myocardial infarction (AMI) before discharge and in 49 age-matched control subjects. The long-term prognosis was assessed after an average follow-up of 7.6 years in AMI patients and 5.8 years in control subjects. The maximal work...... capacity and systolic blood pressure increase in AMI patients was 59% that of control subjects (p less than 0.001). Seventeen AMI patients had significant ST-segment shifts, 13 with ST depression and 4 with ST elevation. In AMI patients experiencing a cardiac death during follow-up the maximal work...... were of no significant value. In this study maximal work capacity turned out to be the best single exercise variable for identifying groups of AMI patients with very low and relative high risk of cardiac death. When all 3 exercise variables were combined, the predischarge maximal exercise test...
Bengtsson, Håkan; Ekstrand, Jan; Waldén, Markus; Hägglund, Martin
2013-07-01
Player activities in soccer matches are influenced by the match result and match venue. It is not known whether injury rates are influenced by these factors. To investigate whether there are associations between injury rates and the match result, venue, and type of competition in male soccer. Cohort study; Level of evidence, 3. Twenty-six professional clubs from 10 countries were followed prospectively during 9 seasons (2001-2002 to 2009-2010). All matches, and injuries occurring in these matches, were registered by the team's medical staff. An injury was registered if it resulted in player absence from training or matches. Information about match result, venue, and type of competition for all reported matches was gathered by the authors from online databases. Injury rates in matches with varying match characteristics were compared by use of generalized estimating equations. Odds ratios (ORs) with 95% confidence intervals (CIs) were calculated. A total of 2738 injuries during 6010 matches were registered. There were no associations between odds of 1 injury occurrence and match result or type of competition, whereas the odds were decreased in matches played away compared with home matches (OR, 0.89; 95% CI, 0.80-0.99). The odds of 2 or more injury occurrences in a match were increased in matches resulting in a draw (OR, 1.39; 95% CI, 1.15-1.69) or loss (OR, 1.66; 95% CI, 1.38-1.98) compared with matches won and were decreased in other cup matches compared with league matches (OR, 0.57; 95% CI, 0.39-0.84) and in matches played away compared with home matches (OR, 0.70; 95% CI, 0.60-0.82). Finally, injuries with more than 1 week's absence occurred more frequently in Champions League matches compared with league matches both for matches with 1 injury (OR, 1.26; 95% CI, 1.09-1.45) and matches with 2 or more injuries (OR, 1.57; 95% CI, 1.13-2.20). The odds of 2 or more injury occurrences in professional soccer were higher in matches resulting in a loss or a draw compared
Maximal inequalities for demimartingales and their applications
WANG XueJun; HU ShuHe
2009-01-01
In this paper,we establish some maximal inequalities for demimartingales which generalize and improve the results of Christofides.The maximal inequalities for demimartingales are used as key inequalities to establish other results including Doob's type maximal inequality for demimartingales,strong laws of large numbers and growth rate for demimartingales and associated random variables.At last,we give an equivalent condition of uniform integrability for demisubmartingales.
Maximal inequalities for demimartingales and their applications
无
2009-01-01
In this paper, we establish some maximal inequalities for demimartingales which generalize and improve the results of Christofides. The maximal inequalities for demimartingales are used as key inequalities to establish other results including Doob’s type maximal inequality for demimartingales, strong laws of large numbers and growth rate for demimartingales and associated random variables. At last, we give an equivalent condition of uniform integrability for demisubmartingales.
One-Match and All-Match Categories for Keywords Matching in Chatbot
Abbas S. Lokman
2010-01-01
Full Text Available Problem statement: Artificial intelligence chatbot is a technology that makes interactions between men and machines using natural language possible. From literature of chatbots keywords/pattern matching techniques, potential issues for improvement had been discovered. The discovered issues are in the context of keywords arrangement for matching precedence and keywords variety for matching flexibility. Approach: Combining previous techniques/mechanisms with some additional adjustment, new technique to be used for keywords matching process is proposed. Using newly developed chatbot named ViDi (abbreviation for Virtual Diabetes physician which is a chatbot for diabetes education activity as a testing medium, the proposed technique named One-Match and All-Match Categories (OMAMC is being used to test the creation of possible keywords surrounding one sample input sentence. The result for possible keywords created by this technique then being compared to possible keywords created by previous chatbots techniques surrounding the same sample sentence in matching precedence and matching flexibility context. Results: OMAMC technique is found to be improving previous matching techniques in matching precedence and flexibility context. This improvement is seen to be useful for shortening matching time and widening matching flexibility within the chatbots keywords matching process. Conclusion: OMAMC for keywords matching in chatbot is shown to be an improvement over previous techniques in the context of keywords arrangement for matching precedence and keywords variety for matching flexibility.
Oncoplastic Breast Reduction: Maximizing Aesthetics and Surgical Margins
Michelle Milee Chang
2012-01-01
Full Text Available Oncoplastic breast reduction combines oncologically sound concepts of cancer removal with aesthetically maximized approaches for breast reduction. Numerous incision patterns and types of pedicles can be used for purposes of oncoplastic reduction, each tailored for size and location of tumor. A team approach between reconstructive and breast surgeons produces positive long-term oncologic results as well as satisfactory cosmetic and functional outcomes, rendering oncoplastic breast reduction a favorable treatment option for certain patients with breast cancer.
Maximizing exosome colloidal stability following electroporation.
Hood, Joshua L; Scott, Michael J; Wickline, Samuel A
2014-03-01
Development of exosome-based semisynthetic nanovesicles for diagnostic and therapeutic purposes requires novel approaches to load exosomes with cargo. Electroporation has previously been used to load exosomes with RNA. However, investigations into exosome colloidal stability following electroporation have not been considered. Herein, we report the development of a unique trehalose pulse media (TPM) that minimizes exosome aggregation following electroporation. Dynamic light scattering (DLS) and RNA absorbance were employed to determine the extent of exosome aggregation and electroextraction post electroporation in TPM compared to common PBS pulse media or sucrose pulse media (SPM). Use of TPM to disaggregate melanoma exosomes post electroporation was dependent on both exosome concentration and electric field strength. TPM maximized exosome dispersal post electroporation for both homogenous B16 melanoma and heterogeneous human serum-derived populations of exosomes. Moreover, TPM enabled heavy cargo loading of melanoma exosomes with 5nm superparamagnetic iron oxide nanoparticles (SPION5) while maintaining original exosome size and minimizing exosome aggregation as evidenced by transmission electron microscopy. Loading exosomes with SPION5 increased exosome density on sucrose gradients. This provides a simple, label-free means of enriching exogenously modified exosomes and introduces the potential for MRI-driven theranostic exosome investigations in vivo.
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Bansal, Nikhil; Li, Jian; Mestre, Julian; Nagarajan, Viswanath; Rudra, Atri
2010-01-01
Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it, and if the edge is indeed present in the graph, we are forced to add it to our matching. Further, each vertex $i$ is allowed to be queried at most $t_i$ times. How should we adaptively query the edges to maximize the expected weight of the matching? We consider several matching problems in this general framework (some of which arise in kidney exchanges and online dating, and others arise in modeling online advertisements); we give LP-rounding based constant-factor approximation algorithms for these problems. Our main results are the following: We give a 4 approximation for weighted stochastic matching on general graphs, and a 3 approximation on bipartite graphs. This answers an open question from [Chen etal ICALP ...
Task-oriented maximally entangled states
Agrawal, Pankaj; Pradhan, B, E-mail: agrawal@iopb.res.i, E-mail: bpradhan@iopb.res.i [Institute of Physics, Sachivalaya Marg, Bhubaneswar, Orissa 751 005 (India)
2010-06-11
We introduce the notion of a task-oriented maximally entangled state (TMES). This notion depends on the task for which a quantum state is used as the resource. TMESs are the states that can be used to carry out the task maximally. This concept may be more useful than that of a general maximally entangled state in the case of a multipartite system. We illustrate this idea by giving an operational definition of maximally entangled states on the basis of communication tasks of teleportation and superdense coding. We also give examples and a procedure to obtain such TMESs for n-qubit systems.
Inflation in maximal gauged supergravities
Kodama, Hideo [Theory Center, KEK,Tsukuba 305-0801 (Japan); Department of Particles and Nuclear Physics,The Graduate University for Advanced Studies,Tsukuba 305-0801 (Japan); Nozawa, Masato [Dipartimento di Fisica, Università di Milano, and INFN, Sezione di Milano,Via Celoria 16, 20133 Milano (Italy)
2015-05-18
We discuss the dynamics of multiple scalar fields and the possibility of realistic inflation in the maximal gauged supergravity. In this paper, we address this problem in the framework of recently discovered 1-parameter deformation of SO(4,4) and SO(5,3) dyonic gaugings, for which the base point of the scalar manifold corresponds to an unstable de Sitter critical point. In the gauge-field frame where the embedding tensor takes the value in the sum of the 36 and 36’ representations of SL(8), we present a scheme that allows us to derive an analytic expression for the scalar potential. With the help of this formalism, we derive the full potential and gauge coupling functions in analytic forms for the SO(3)×SO(3)-invariant subsectors of SO(4,4) and SO(5,3) gaugings, and argue that there exist no new critical points in addition to those discovered so far. For the SO(4,4) gauging, we also study the behavior of 6-dimensional scalar fields in this sector near the Dall’Agata-Inverso de Sitter critical point at which the negative eigenvalue of the scalar mass square with the largest modulus goes to zero as the deformation parameter s approaches a critical value s{sub c}. We find that when the deformation parameter s is taken sufficiently close to the critical value, inflation lasts more than 60 e-folds even if the initial point of the inflaton allows an O(0.1) deviation in Planck units from the Dall’Agata-Inverso critical point. It turns out that the spectral index n{sub s} of the curvature perturbation at the time of the 60 e-folding number is always about 0.96 and within the 1σ range n{sub s}=0.9639±0.0047 obtained by Planck, irrespective of the value of the η parameter at the critical saddle point. The tensor-scalar ratio predicted by this model is around 10{sup −3} and is close to the value in the Starobinsky model.
Matching relations for optimal entanglement concentration and purification.
Kong, Fan-Zhen; Xia, Hui-Zhi; Yang, Ming; Yang, Qing; Cao, Zhuo-Liang
2016-05-18
The bilateral controlled NOT (CNOT) operation plays a key role in standard entanglement purification process, but the CNOT operation may not be the optimal joint operation in the sense that the output entanglement is maximized. In this paper, the CNOT operations in both the Schmidt-projection based entanglement concentration and the entanglement purification schemes are replaced with a general joint unitary operation, and the optimal matching relations between the entangling power of the joint unitary operation and the non-maximal entangled channel are found for optimizing the entanglement in- crement or the output entanglement. The result is somewhat counter-intuitive for entanglement concentration. The output entanglement is maximized when the entangling power of the joint unitary operation and the quantum channel satisfy certain relation. There exist a variety of joint operations with non-maximal entangling power that can induce a maximal output entanglement, which will greatly broaden the set of the potential joint operations in entanglement concentration. In addition, the entanglement increment in purification process is maximized only by the joint unitary operations (including CNOT) with maximal entangling power.
Cristian GEORGESCU
2005-01-01
Full Text Available The goal of this paper is to investigate how such a pattern matching could be performed on models,including the definition of the input language as well as the elaboration of efficient matchingalgorithms. Design patterns can be considered reusable micro-architectures that contribute to anoverall system architecture. Frameworks are also closely related to design patterns. Componentsoffer the possibility to radically change the behaviors and services offered by an application bysubstitution or addition of new components, even a long time after deployment. Software testing isanother aspect of reliable development. Testing activities mainly consist in ensuring that a systemimplementation conforms to its specifications.
1997-01-01
Apfel's excellent match: This series of photos shows a water drop containing a surfactant (Triton-100) as it experiences a complete cycle of superoscillation on U.S. Microgravity Lab-2 (USML-2; October 1995). The time in seconds appears under the photos. The figures above the photos are the oscillation shapes predicted by a numerical model. The time shown with the predictions is nondimensional. Robert Apfel (Yale University) used the Drop Physics Module on USML-2 to explore the effect of surfactants on liquid drops. Apfel's research of surfactants may contribute to improvements in a variety of industrial processes, including oil recovery and environmental cleanup.
Alba Avilés, Manuel
2015-01-01
WhereIsTheMatch is a very ambitious project that consists of developing my own social network mobile app for Android. This app is focused on easily finding people and places to play sports. The main idea of this project is create a first step to a final product and my own developing style. I knew from the beginning that this would be a very hard and a very demanding task because of the several areas that are involved in the development of a mobile app, such as database implementation, interfa...
Faust, Sebastian; Hazay, Carmit; Venturi, Daniele
2013-01-01
on concrete and important functionalities and give the first protocol for the pattern matching problem in the cloud. Loosely speaking, this problem considers a text T that is outsourced to the cloud S by a client C T . In a query phase, clients C 1, …, C l run an efficient protocol with the server S...... that contain confidential data (e.g., health related data about patient history). Our constructions offer simulation-based security in the presence of semi-honest and malicious adversaries (in the random oracle model) and limit the communication in the query phase to O(m) bits plus the number of occurrences...
Variability of soccer referees' match performances.
Weston, M; Drust, B; Atkinson, G; Gregson, W
2011-03-01
The aim of the present study was to determine the between-match variability in soccer referees' match performances. 1 269 individual match observations were undertaken on 59 referees (range 2-79 games per referee) officiating in the English Premier League and Championship from 2003/2004 to 2007/2008 using a computerised tracking system (Prozone (®), Leeds, England). Between-match coefficients of variation (CV) were calculated for all games and then compared between referee age and experience groups. High mean CVs were observed for high-speed running distance (25.9±10.1%), recovery time (32.7±13.8%), explosive sprints (34.3±16.6%), total number of sprints (54.0±20.7%) and number of match fouls (28±4.6%). Smaller CVs were observed for total distance covered (3.8±1.5%), top sprinting speed (5.6±10.9%), distance from the ball (4.2±1.9%) and the distance from fouls (9.9±4.3%). Variability in match activities was not influenced by referee age or experience. The present study's findings demonstrate that variability in soccer referees' match performances is high in some variables and not dependent on referee age or experience. Such variability means that research requires large sample sizes to detect real systematic changes in a number of performance characteristics when studied during matches. © Georg Thieme Verlag KG Stuttgart · New York.
Generalized Orthogonal Matching Pursuit
Wang, Jian; Shim, Byonghyo
2011-01-01
As a greedy algorithm to recover sparse signals from compressed measurements, the orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the orthogonal matching pursuit (gOMP) for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple indices are identified per iteration. Owing to the selection of multiple "correct" indices, the gOMP algorithm is finished with much smaller number of iterations compared to the OMP. We show that the gOMP can perfectly reconstruct any $K$-sparse signals ($K > 1$), provided that the sensing matrix satisfies the RIP with $\\delta_{NK} < \\frac{\\sqrt{N}}{\\sqrt{K} + 2 \\sqrt{N}}$. We also demonstrate by empirical simulations that the gOMP has excellent recovery performance comparable to $\\ell_1$-minimization technique with fast processing speed and competitive computational com...
Improved Algorithms OF CELF and CELF++ for Influence Maximization
Jiaguo Lv
2014-06-01
Full Text Available Motivated by the wide application in some fields, such as viral marketing, sales promotion etc, influence maximization has been the most important and extensively studied problem in social network. However, the most classical KK-Greedy algorithm for influence maximization is inefficient. Two major sources of the algorithm’s inefficiency were analyzed in this paper. With the analysis of algorithms CELF and CELF++, all nodes in the influenced set of u would never bring any marginal gain when a new seed u was produced. Through this optimization strategy, a lot of redundant nodes will be removed from the candidate nodes. Basing on the strategy, two improved algorithms of Lv_CELF and Lv_CELF++ were proposed in this study. To evaluate the two algorithms, the two algorithms with their benchmark algorithms of CELF and CELF++ were conducted on some real world datasets. To estimate the algorithms, influence degree and running time were employed to measure the performance and efficiency respectively. Experimental results showed that, compared with benchmark algorithms of CELF and CELF++, matching effects and higher efficiency were achieved by the new algorithms Lv_CELF and Lv_CELF++. Solutions with the proposed optimization strategy can be useful for the decisionmaking problems under the scenarios related to the influence maximization problem.
Computing Maximally Supersymmetric Scattering Amplitudes
Stankowicz, James Michael, Jr.
This dissertation reviews work in computing N = 4 super-Yang--Mills (sYM) and N = 8 maximally supersymmetric gravity (mSUGRA) scattering amplitudes in D = 4 spacetime dimensions in novel ways. After a brief introduction and overview in Ch. 1, the various techniques used to construct amplitudes in the remainder of the dissertation are discussed in Ch. 2. This includes several new concepts such as d log and pure integrand bases, as well as how to construct the amplitude using exactly one kinematic point where it vanishes. Also included in this chapter is an outline of the Mathematica package on shell diagrams and numerics.m (osdn) that was developed for the computations herein. The rest of the dissertation is devoted to explicit examples. In Ch. 3, the starting point is tree-level sYM amplitudes that have integral representations with residues that obey amplitude relations. These residues are shown to have corresponding residue numerators that allow a double copy prescription that results in mSUGRA residues. In Ch. 4, the two-loop four-point sYM amplitude is constructed in several ways, showcasing many of the techniques of Ch. 2; this includes an example of how to use osdn. The two-loop five-point amplitude is also presented in a pure integrand representation with comments on how it was constructed from one homogeneous cut of the amplitude. On-going work on the two-loop n-point amplitude is presented at the end of Ch. 4. In Ch. 5, the three-loop four-point amplitude is presented in the d log representation and in the pure integrand representation. In Ch. 6, there are several examples of four- through seven-loop planar diagrams that illustrate how considerations of the singularity structure of the amplitude underpin dual-conformal invariance. Taken with the previous examples, this is additional evidence that the structure known to exist in the planar sector extends to the full theory. At the end of this chapter is a proof that all mSUGRA amplitudes have a pole at
Are all maximally entangled states pure?
Cavalcanti, D; Terra-Cunha, M O
2005-01-01
In this Letter we study if all maximally entangled states are pure through several entanglement monotones. Our conclusions allow us to generalize the idea of monogamy of entanglement. Then we propose a polygamy of entanglement, which express that if a general multipartite state is maximally entangled it is necessarily factorized by any other system.
Sampling and Representation Complexity of Revenue Maximization
Dughmi, Shaddin; Han, Li; Nisan, Noam
2014-01-01
We consider (approximate) revenue maximization in auctions where the distribution on input valuations is given via "black box" access to samples from the distribution. We observe that the number of samples required -- the sample complexity -- is tightly related to the representation complexity of an approximately revenue-maximizing auction. Our main results are upper bounds and an exponential lower bound on these complexities.
Lisonek, Petr
1996-01-01
our classifications confirmthe maximality of previously known sets, the results in E^7 and E^8are new. Their counterpart in dimension larger than 10is a set of unit vectors with only two values of inner products in the Lorentz space R^{d,1}.The maximality of this set again follows from a bound due...
An ethical justification of profit maximization
Koch, Carsten Allan
2010-01-01
In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing b...
Alternative trailer configurations for maximizing payloads
Jason D. Thompson; Dana Mitchell; John Klepac
2017-01-01
In order for harvesting contractors to stay ahead of increasing costs, it is imperative that they employ all options to maximize productivity and efficiency. Transportation can account for half the cost to deliver wood to a mill. Contractors seek to maximize truck payload to increase productivity. The Forest Operations Research Unit, Southern Research Station, USDA...
Cohomology of Weakly Reducible Maximal Triangular Algebras
董浙; 鲁世杰
2000-01-01
In this paper, we introduce the concept of weakly reducible maximal triangular algebras φwhich form a large class of maximal triangular algebras. Let B be a weakly closed algebra containing 5φ, we prove that the cohomology spaces Hn(φ, B) (n≥1) are trivial.
Unification and Matching on Compressed Terms
Gascón, Adrià; Schmidt-Schauß, Manfred
2010-01-01
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called Singleton Tree Grammars (STG), have recently drawn considerable attention. Using STGs, terms of exponential size and height can be represented in linear space. Furthermore, the term representation by directed acyclic graphs (dags) can be efficiently simulated. The present paper is the result of an investigation on term unification and matching when the terms given as input are represented using different compression mechanisms for terms such as dags and Singleton Tree Grammars. We describe a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. For the same problem, NP-completeness is obtained when the terms are represented using the more general formalism of Singleton Tree Grammars. For first-order unification and matching polynom...
Inclusive fitness maximization: An axiomatic approach.
Okasha, Samir; Weymark, John A; Bossert, Walter
2014-06-07
Kin selection theorists argue that evolution in social contexts will lead organisms to behave as if maximizing their inclusive, as opposed to personal, fitness. The inclusive fitness concept allows biologists to treat organisms as akin to rational agents seeking to maximize a utility function. Here we develop this idea and place it on a firm footing by employing a standard decision-theoretic methodology. We show how the principle of inclusive fitness maximization and a related principle of quasi-inclusive fitness maximization can be derived from axioms on an individual׳s 'as if preferences' (binary choices) for the case in which phenotypic effects are additive. Our results help integrate evolutionary theory and rational choice theory, help draw out the behavioural implications of inclusive fitness maximization, and point to a possible way in which evolution could lead organisms to implement it. Copyright © 2014 Elsevier Ltd. All rights reserved.
Maximal Hypersurfaces in Spacetimes with Translational Symmetry
Bulawa, Andrew
2016-01-01
We consider four-dimensional vacuum spacetimes which admit a free isometric spacelike R-action. Taking a quotient with respect to the R-action produces a three-dimensional quotient spacetime. We establish several results regarding maximal hypersurfaces (spacelike hypersurfaces of zero mean curvature) in quotient spacetimes. First, we show that complete noncompact maximal hypersurfaces must either be flat cylinders S^1 x R or conformal to the Euclidean plane. Second, we establish a positive mass theorem for certain maximal hypersurfaces. Finally, while it is meaningful to use a bounded lapse when adopting the maximal hypersurface gauge condition in the four-dimensional (asymptotically flat) setting, it is shown here that nontrivial quotient spacetimes admit the maximal hypersurface gauge only with an unbounded lapse.
Characteristic Evolution and Matching
Winicour Jeffrey
2009-04-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to eliminate the role of this artificial outer boundary via Cauchy-characteristic matching, by which the radiated waveform can be computed at null infinity. Progress in this direction is discussed.
Costello, Kevin; Tripathi, Pushkar
2012-01-01
We consider the following stochastic optimization problem first introduced by Chen et al. in \\cite{chen}. We are given a vertex set of a random graph where each possible edge is present with probability p_e. We do not know which edges are actually present unless we scan/probe an edge. However whenever we probe an edge and find it to be present, we are constrained to picking the edge and both its end points are deleted from the graph. We wish to find the maximum matching in this model. We compare our results against the optimal omniscient algorithm that knows the edges of the graph and present a 0.573 factor algorithm using a novel sampling technique. We also prove that no algorithm can attain a factor better than 0.898 in this model.
Naama Goren-Inbar
Full Text Available Cylindrical objects made usually of fired clay but sometimes of stone were found at the Yarmukian Pottery Neolithic sites of Sha'ar HaGolan and Munhata (first half of the 8(th millennium BP in the Jordan Valley. Similar objects have been reported from other Near Eastern Pottery Neolithic sites. Most scholars have interpreted them as cultic objects in the shape of phalli, while others have referred to them in more general terms as "clay pestles," "clay rods," and "cylindrical clay objects." Re-examination of these artifacts leads us to present a new interpretation of their function and to suggest a reconstruction of their technology and mode of use. We suggest that these objects were components of fire drills and consider them the earliest evidence of a complex technology of fire ignition, which incorporates the cylindrical objects in the role of matches.
Goren-Inbar, Naama; Freikman, Michael; Garfinkel, Yosef; Goring-Morris, A Nigel; Goring-Morris, Nigel A; Grosman, Leore
2012-01-01
Cylindrical objects made usually of fired clay but sometimes of stone were found at the Yarmukian Pottery Neolithic sites of Sha'ar HaGolan and Munhata (first half of the 8(th) millennium BP) in the Jordan Valley. Similar objects have been reported from other Near Eastern Pottery Neolithic sites. Most scholars have interpreted them as cultic objects in the shape of phalli, while others have referred to them in more general terms as "clay pestles," "clay rods," and "cylindrical clay objects." Re-examination of these artifacts leads us to present a new interpretation of their function and to suggest a reconstruction of their technology and mode of use. We suggest that these objects were components of fire drills and consider them the earliest evidence of a complex technology of fire ignition, which incorporates the cylindrical objects in the role of matches.
A novel vehicle navigation map matching algorithm based on fuzzy logic and its application
TONG Xiao-hua; WU Song-chun; WU Shu-qing; LIU Da-jie
2005-01-01
A new real-time map matching algorithm based on fuzzy logic is proposed. 3 main factors affecting the reliability of map matching, including the distance between the vehicle location and the matching road segment, the angle between the vehicle direction and the road segment direction and the road connectivity are discussed. Fuzzy rules for the distance, angle and connectivity are presented to calculate the matching reliability. 2 indicators for estimating the matching reliability are then derived, one is the lower limit of the reliability, and the other is the limit error of the difference between the maximal value and the second-maximal value of the reliability. A real-time map-matching system based on fuzzy logic is therefore developed. Using the real data of global positioning system(GIS) based navigation and geographic information system(GPS) based road map, the method is verified and the results prove the effectiveness of the proposed method.
Malone, Shane; Roe, Mark; Doran, Dominic A; Gabbett, Tim J; Collins, Kieran
2017-03-01
To examine the relationship between chronic training loads, number of exposures to maximal velocity, the distance covered at maximal velocity, percentage of maximal velocity in training and match-play and subsequent injury risk in elite Gaelic footballers. Prospective cohort design. Thirty-seven elite Gaelic footballers from one elite squad were involved in a one-season study. Training and game loads (session-RPE multiplied by duration in min) were recorded in conjunction with external match and training loads (using global positioning system technology) to measure the distance covered at maximal velocity, relative maximal velocity and the number of player exposures to maximal velocity across weekly periods during the season. Lower limb injuries were also recorded. Training load and GPS data were modelled against injury data using logistic regression. Odds ratios (OR) were calculated based on chronic training load status, relative maximal velocity and number of exposures to maximal velocity with these reported against the lowest reference group for these variables. Players who produced over 95% maximal velocity on at least one occasion within training environments had lower risk of injury compared to the reference group of 85% maximal velocity on at least one occasion (OR: 0.12, p=0.001). Higher chronic training loads (≥4750AU) allowed players to tolerate increased distances (between 90 to 120m) and exposures to maximal velocity (between 10 to 15 exposures), with these exposures having a protective effect compared to lower exposures (OR: 0.22 p=0.026) and distance (OR=0.23, p=0.055). Players who had higher chronic training loads (≥4750AU) tolerated increased distances and exposures to maximal velocity when compared to players exposed to low chronic training loads (≤4750AU). Under- and over-exposure of players to maximal velocity events (represented by a U-shaped curve) increased the risk of injury. Copyright © 2016 Sports Medicine Australia. Published by
Optimizing Transmission Line Matching Circuits
Novak, S.
1996-01-01
When designing transmission line matching circuits, there exist often overlooked, additional, not much used, degree of choice in the selection of the transmission line impedance. In this work are presented results of CAD analysis for the two element transmission line matching networks, demonstrating that selecting matching circuits transmission lines with higher impedance, than usually used 50 or 75 ohms, can in most cases substantially decrease the physical dimension of the final matching ci...
A review on compressed pattern matching
Surya Prakash Mishra
2016-09-01
Full Text Available Compressed pattern matching (CPM refers to the task of locating all the occurrences of a pattern (or set of patterns inside the body of compressed text. In this type of matching, pattern may or may not be compressed. CPM is very useful in handling large volume of data especially over the network. It has many applications in computational biology, where it is useful in finding similar trends in DNA sequences; intrusion detection over the networks, big data analytics etc. Various solutions have been provided by researchers where pattern is matched directly over the uncompressed text. Such solution requires lot of space and consumes lot of time when handling the big data. Various researchers have proposed the efficient solutions for compression but very few exist for pattern matching over the compressed text. Considering the future trend where data size is increasing exponentially day-by-day, CPM has become a desirable task. This paper presents a critical review on the recent techniques on the compressed pattern matching. The covered techniques includes: Word based Huffman codes, Word Based Tagged Codes; Wavelet Tree Based Indexing. We have presented a comparative analysis of all the techniques mentioned above and highlighted their advantages and disadvantages.
Fast Legendre moment computation for template matching
Li, Bing C.
2017-05-01
Normalized cross correlation (NCC) based template matching is insensitive to intensity changes and it has many applications in image processing, object detection, video tracking and pattern recognition. However, normalized cross correlation implementation is computationally expensive since it involves both correlation computation and normalization implementation. In this paper, we propose Legendre moment approach for fast normalized cross correlation implementation and show that the computational cost of this proposed approach is independent of template mask sizes which is significantly faster than traditional mask size dependent approaches, especially for large mask templates. Legendre polynomials have been widely used in solving Laplace equation in electrodynamics in spherical coordinate systems, and solving Schrodinger equation in quantum mechanics. In this paper, we extend Legendre polynomials from physics to computer vision and pattern recognition fields, and demonstrate that Legendre polynomials can help to reduce the computational cost of NCC based template matching significantly.
Banking on a bad bet. Probability matching in risky choice is linked to expectation generation.
James, Greta; Koehler, Derek J
2011-06-01
Probability matching is the tendency to match choice probabilities to outcome probabilities in a binary prediction task. This tendency is a long-standing puzzle in the study of decision making under risk and uncertainty, because always predicting the more probable outcome across a series of trials (maximizing) would yield greater predictive accuracy and payoffs. In three experiments, we tied the predominance of probability matching over maximizing to a generally adaptive cognitive operation that generates expectations regarding the aggregate outcomes of an upcoming sequence of events. Under conditions designed to diminish the generation or perceived applicability of such expectations, we found that the frequency of probability-matching behavior dropped substantially and maximizing became the norm.
Are all maximally entangled states pure?
Cavalcanti, D.; Brandão, F. G. S. L.; Terra Cunha, M. O.
2005-10-01
We study if all maximally entangled states are pure through several entanglement monotones. In the bipartite case, we find that the same conditions which lead to the uniqueness of the entropy of entanglement as a measure of entanglement exclude the existence of maximally mixed entangled states. In the multipartite scenario, our conclusions allow us to generalize the idea of the monogamy of entanglement: we establish the polygamy of entanglement, expressing that if a general state is maximally entangled with respect to some kind of multipartite entanglement, then it is necessarily factorized of any other system.
An ethical justification of profit maximization
Koch, Carsten Allan
2010-01-01
In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing...... behaviour. It is argued that some form of consequential ethics must be applied, and that both profit seeking and profit maximization can be defended from a rule-consequential point of view. It is noted, however, that the result does not apply unconditionally, but requires that certain form of profit (and...
Robust utility maximization in a discontinuous filtration
Jeanblanc, Monique; Ngoupeyou, Armand
2012-01-01
We study a problem of utility maximization under model uncertainty with information including jumps. We prove first that the value process of the robust stochastic control problem is described by the solution of a quadratic-exponential backward stochastic differential equation with jumps. Then, we establish a dynamic maximum principle for the optimal control of the maximization problem. The characterization of the optimal model and the optimal control (consumption-investment) is given via a forward-backward system which generalizes the result of Duffie and Skiadas (1994) and El Karoui, Peng and Quenez (2001) in the case of maximization of recursive utilities including model with jumps.
Bid Optimization in Broad-Match Ad auctions
Even-dar, Eyal; Mirrokni, Vahab; Muthukrishnan, S; Nadav, Uri
2009-01-01
Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the {\\em bid optimization problem} which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present an linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any ...
An HLA matched donor! An HLA matched donor? What do you mean by: HLA matched donor?
van Rood, J J; Oudshoorn, M
1998-07-01
The term 'an HLA matched donor' is in general used without giving exact information on the level of resolution of the HLA typing. This can lead to misunderstandings. A proposal is formulated to agree on using six match categories according to the HLA typing technique used to indicate the level of confidence of the matching.
Characteristic Evolution and Matching
Jeffrey Winicour
2012-01-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial-value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D-axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black-hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black-hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to extend such simulations to null infinity where the waveform from the binary inspiral and merger can be unambiguously computed. This has now been accomplished by Cauchy-characteristic extraction, where data for the characteristic evolution is supplied by Cauchy data on an extraction worldtube inside the artificial outer boundary. The ultimate application of characteristic evolution is to eliminate the role of this outer boundary by constructing a global solution via Cauchy-characteristic matching. Progress in this direction is discussed.
Jois, Manjunath Holaykoppa Nanjunda
The conventional Influence Maximization problem is the problem of finding such a team (a small subset) of seed nodes in a social network that would maximize the spread of influence over the whole network. This paper considers a lottery system aimed at maximizing the awareness spread to promote energy conservation behavior as a stochastic Influence Maximization problem with the constraints ensuring lottery fairness. The resulting Multi-Team Influence Maximization problem involves assigning the probabilities to multiple teams of seeds (interpreted as lottery winners) to maximize the expected awareness spread. Such a variation of the Influence Maximization problem is modeled as a Linear Program; however, enumerating all the possible teams is a hard task considering that the feasible team count grows exponentially with the network size. In order to address this challenge, we develop a column generation based approach to solve the problem with a limited number of candidate teams, where new candidates are generated and added to the problem iteratively. We adopt a piecewise linear function to model the impact of including a new team so as to pick only such teams which can improve the existing solution. We demonstrate that with this approach we can solve such influence maximization problems to optimality, and perform computational study with real-world social network data sets to showcase the efficiency of the approach in finding lottery designs for optimal awareness spread. Lastly, we explore other possible scenarios where this model can be utilized to optimally solve the otherwise hard to solve influence maximization problems.
HEALTH INSURANCE: CONTRIBUTIONS AND REIMBURSEMENT MAXIMAL
HR Division
2000-01-01
Affected by both the salary adjustment index on 1.1.2000 and the evolution of the staff members and fellows population, the average reference salary, which is used as an index for fixed contributions and reimbursement maximal, has changed significantly. An adjustment of the amounts of the reimbursement maximal and the fixed contributions is therefore necessary, as from 1 January 2000.Reimbursement maximalThe revised reimbursement maximal will appear on the leaflet summarising the benefits for the year 2000, which will soon be available from the divisional secretariats and from the AUSTRIA office at CERN.Fixed contributionsThe fixed contributions, applicable to some categories of voluntarily insured persons, are set as follows (amounts in CHF for monthly contributions):voluntarily insured member of the personnel, with complete coverage:815,- (was 803,- in 1999)voluntarily insured member of the personnel, with reduced coverage:407,- (was 402,- in 1999)voluntarily insured no longer dependent child:326,- (was 321...
Maximizing throughput by evaluating critical utilization paths
Weeda, P.J.
1991-01-01
Recently the relationship between batch structure, bottleneck machine and maximum throughput has been explored for serial, convergent and divergent process configurations consisting of two machines and three processes. In three of the seven possible configurations a multiple batch structure maximize
Relationship between maximal exercise parameters and individual ...
Relationship between maximal exercise parameters and individual time trial ... It is widely accepted that the ventilatory threshold (VT) is an important ... This study investigated whether the physiological responses during a 20km time trial (TT) ...
Flouting maxim by sherlock holmes and dr. Watson in tv series Of sherlock season
Lina Affifatusholihah
2017-04-01
In running daily activities, people will always meet and interact with other people, and language is a medium that is used by humans to interact with each other. In a conversation or discussion, everyone should pay attention to the four maxims in order that there are no errors in communication. However, it is not uncommon that the four rules above are breached by the speakers. This is called non-observance of the maxims, and one of a non-observance of the maxims that often occurs in is flouting maxim. The aims of this paper are to describe types of maxims that are flouted by Sherlock Holmes and dr. Watson as well as to describe how the maxims are flouted in Sherlock TV series season 1. This research used qualitative descriptive method. The researcher classifies the utterances to know what kind of maxim which are flouted, categorizes those into the category based on the Grice’s theory of Cooperative Principle, namely: maxim of quantity, quality, relation and manner. The research procedure begin by searching the script in the internet, matching the utterances in the script and in film and sorting the utterances between Sherlock Holmes and dr. Watson as well observing every word or sentence which are flouted by the main characters. The findings find that all kinds of maxims are flouted by Sherlock and dr. Watson. The result of analysis shows that the maxim flouted when the speakers say something irrelevant; something roguishness or lied to hide the truth in the form of rhetorical question; the information becomes more or too informative than what is required; and something obscurity of expression, ambiguity, or unnecessary prolixity.
Simple technique for maximal thoracic muscle harvest.
Marshall, M Blair; Kaiser, Larry R; Kucharczuk, John C
2004-04-01
We present a modification of technique for standard muscle flap harvest, the placement of cutaneous traction sutures. This technique allows for maximal dissection of the thoracic muscles even through minimal incisions. Through improved exposure and traction, complete dissection of the muscle bed can be performed and the tissue obtained maximized. Because more muscle bulk is obtained with this technique, the need for a second muscle may be prevented.
MAXIMAL POINTS OF A REGULAR TRUTH FUNCTION
Every canonical linearly separable truth function is a regular function, but not every regular truth function is linearly separable. The most...promising method of determining which of the regular truth functions are linearly separable r quires finding their maximal and minimal points. In this...report is developed a quick, systematic method of finding the maximal points of any regular truth function in terms of its arithmetic invariants. (Author)
Maximal Subgroups of Skew Linear Groups
M. Mahdavi-Hezavehi
2002-01-01
Let D be an infinite division algebra of finite dimension over its centre Z(D) = F, and n a positive integer. The structure of maximal subgroups of skew linear groups are investigated. In particular, assume N is a normal subgroup of GLn(D) and M is a maximal subgroup of N containing Z(N). It is shown that if M/Z(N) is finite, then N is central.
Additive Approximation Algorithms for Modularity Maximization
Kawase, Yasushi; Matsui, Tomomi; Miyauchi, Atsushi
2016-01-01
The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph $G=(V,E)$, we are asked to find a partition $\\mathcal{C}$ of $V$ that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical approximation guarantee. Recently, to overcome this issue, the design of modularity max...
Maximal Frequent Itemset Generation Using Segmentation Apporach
M.Rajalakshmi
2011-09-01
Full Text Available Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining.Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequentitemsets. When the length of frequent itemsets to be found is large, the traditional algorithms find all thefrequent itemsets from 1-length to n-length, which is a difficult process. This problem can be solved bymining only the Maximal Frequent Itemsets (MFS. Maximal Frequent Itemsets are frequent itemsets whichhave no proper frequent superset. Thus, the generation of only maximal frequent itemsets reduces thenumber of itemsets and also time needed for the generation of all frequent itemsets as each maximal itemsetof length m implies the presence of 2m-2 frequent itemsets. Furthermore, mining only maximal frequentitemset is sufficient in many data mining applications like minimal key discovery and theory extraction. Inthis paper, we suggest a novel method for finding the maximal frequent itemset from huge data sourcesusing the concept of segmentation of data source and prioritization of segments. Empirical evaluationshows that this method outperforms various other known methods.
Natural selection and the maximization of fitness.
Birch, Jonathan
2016-08-01
The notion that natural selection is a process of fitness maximization gets a bad press in population genetics, yet in other areas of biology the view that organisms behave as if attempting to maximize their fitness remains widespread. Here I critically appraise the prospects for reconciliation. I first distinguish four varieties of fitness maximization. I then examine two recent developments that may appear to vindicate at least one of these varieties. The first is the 'new' interpretation of Fisher's fundamental theorem of natural selection, on which the theorem is exactly true for any evolving population that satisfies some minimal assumptions. The second is the Formal Darwinism project, which forges links between gene frequency change and optimal strategy choice. In both cases, I argue that the results fail to establish a biologically significant maximization principle. I conclude that it may be a mistake to look for universal maximization principles justified by theory alone. A more promising approach may be to find maximization principles that apply conditionally and to show that the conditions were satisfied in the evolution of particular traits.
Betting on Illusory Patterns: Probability Matching in Habitual Gamblers.
Gaissmaier, Wolfgang; Wilke, Andreas; Scheibehenne, Benjamin; McCanney, Paige; Barrett, H Clark
2016-03-01
Why do people gamble? A large body of research suggests that cognitive distortions play an important role in pathological gambling. Many of these distortions are specific cases of a more general misperception of randomness, specifically of an illusory perception of patterns in random sequences. In this article, we provide further evidence for the assumption that gamblers are particularly prone to perceiving illusory patterns. In particular, we compared habitual gamblers to a matched sample of community members with regard to how much they exhibit the choice anomaly 'probability matching'. Probability matching describes the tendency to match response proportions to outcome probabilities when predicting binary outcomes. It leads to a lower expected accuracy than the maximizing strategy of predicting the most likely event on each trial. Previous research has shown that an illusory perception of patterns in random sequences fuels probability matching. So does impulsivity, which is also reported to be higher in gamblers. We therefore hypothesized that gamblers will exhibit more probability matching than non-gamblers, which was confirmed in a controlled laboratory experiment. Additionally, gamblers scored much lower than community members on the cognitive reflection task, which indicates higher impulsivity. This difference could account for the difference in probability matching between the samples. These results suggest that gamblers are more willing to bet impulsively on perceived illusory patterns.
Schulze, Christin; Newell, Ben R
2016-07-01
Cognitive load has previously been found to have a positive effect on strategy selection in repeated risky choice. Specifically, whereas inferior probability matching often prevails under single-task conditions, optimal probability maximizing sometimes dominates when a concurrent task competes for cognitive resources. We examined the extent to which this seemingly beneficial effect of increased task demands hinges on the effort required to implement each of the choice strategies. Probability maximizing typically involves a simple repeated response to a single option, whereas probability matching requires choice proportions to be tracked carefully throughout a sequential choice task. Here, we flipped this pattern by introducing a manipulation that made the implementation of maximizing more taxing and, at the same time, allowed decision makers to probability match via a simple repeated response to a single option. The results from two experiments showed that increasing the implementation effort of probability maximizing resulted in decreased adoption rates of this strategy. This was the case both when decision makers simultaneously learned about the outcome probabilities and responded to a dual task (Exp. 1) and when these two aspects were procedurally separated in two distinct stages (Exp. 2). We conclude that the effort involved in implementing a choice strategy is a key factor in shaping repeated choice under uncertainty. Moreover, highlighting the importance of implementation effort casts new light on the sometimes surprising and inconsistent effects of cognitive load that have previously been reported in the literature.
Matching theory for wireless networks
Han, Zhu; Saad, Walid
2017-01-01
This book provides the fundamental knowledge of the classical matching theory problems. It builds up the bridge between the matching theory and the 5G wireless communication resource allocation problems. The potentials and challenges of implementing the semi-distributive matching theory framework into the wireless resource allocations are analyzed both theoretically and through implementation examples. Academics, researchers, engineers, and so on, who are interested in efficient distributive wireless resource allocation solutions, will find this book to be an exceptional resource. .
Maximizing Information Diffusion in the Cyber-physical Integrated Network
Hongliang Lu
2015-11-01
Full Text Available Nowadays, our living environment has been embedded with smart objects, such as smart sensors, smart watches and smart phones. They make cyberspace and physical space integrated by their abundant abilities of sensing, communication and computation, forming a cyber-physical integrated network. In order to maximize information diffusion in such a network, a group of objects are selected as the forwarding points. To optimize the selection, a minimum connected dominating set (CDS strategy is adopted. However, existing approaches focus on minimizing the size of the CDS, neglecting an important factor: the weight of links. In this paper, we propose a distributed maximizing the probability of information diffusion (DMPID algorithm in the cyber-physical integrated network. Unlike previous approaches that only consider the size of CDS selection, DMPID also considers the information spread probability that depends on the weight of links. To weaken the effects of excessively-weighted links, we also present an optimization strategy that can properly balance the two factors. The results of extensive simulation show that DMPID can nearly double the information diffusion probability, while keeping a reasonable size of selection with low overhead in different distributed networks.
Maximizing Information Diffusion in the Cyber-physical Integrated Network.
Lu, Hongliang; Lv, Shaohe; Jiao, Xianlong; Wang, Xiaodong; Liu, Juan
2015-11-11
Nowadays, our living environment has been embedded with smart objects, such as smart sensors, smart watches and smart phones. They make cyberspace and physical space integrated by their abundant abilities of sensing, communication and computation, forming a cyber-physical integrated network. In order to maximize information diffusion in such a network, a group of objects are selected as the forwarding points. To optimize the selection, a minimum connected dominating set (CDS) strategy is adopted. However, existing approaches focus on minimizing the size of the CDS, neglecting an important factor: the weight of links. In this paper, we propose a distributed maximizing the probability of information diffusion (DMPID) algorithm in the cyber-physical integrated network. Unlike previous approaches that only consider the size of CDS selection, DMPID also considers the information spread probability that depends on the weight of links. To weaken the effects of excessively-weighted links, we also present an optimization strategy that can properly balance the two factors. The results of extensive simulation show that DMPID can nearly double the information diffusion probability, while keeping a reasonable size of selection with low overhead in different distributed networks.
Maximal air bubble entrainment at liquid drop impact
Bouwhuis, Wilco; Tran, Tuan; Keij, Diederik L; Winkels, Koen G; Peters, Ivo R; van der Meer, Devaraj; Sun, Chao; Snoeijer, Jacco H; Lohse, Detlef
2012-01-01
At impact of a liquid drop on a solid surface an air bubble can be entrapped. Here we show that two competing effects minimize the (relative) size of this entrained air bubble: For large drop impact velocity and large droplets the inertia of the liquid flattens the entrained bubble, whereas for small impact velocity and small droplets capillary forces minimize the entrained bubble. However, we demonstrate experimentally, theoretically, and numerically that in between there is an optimum, leading to maximal air bubble entrapment. Our results have a strong bearing on various applications in printing technology, microelectronics, immersion lithography, diagnostics, or agriculture.
Welfare-maximizing and revenue-maximizing tariffs with a few domestic firms
Bruno Larue; Jean-Philippe Gervais
2002-01-01
In this paper we compare the orthodox optimal tariff formula with the appropriate welfare-maximizing tariff when there are a few producing or importing firms. The welfare-maximizing tariff can be very low, voire negative in some cases, while in others it can even exceed the maximum-revenue tariff. The relationship between the welfare-maximizing tariff and the number of firms need not be monotonically increasing, because the tariff is not strictly used to internalize terms of trade externality...
Tofari, Paul; Kemp, Justin; Cormack, Stuart
2017-02-23
Assessing responses to soccer match-play is limited by match variability or unrealistic simulations. To address this, the biological, perceptual, and performance response were assessed using a self-paced, simulated soccer match protocol using a non-motorized treadmill. Twelve male team-sport athletes performed the 90-min simulation. Match activity; quadriceps twitch interpolation [voluntary activation (%VA) and potentiated twitch (POT)]; biochemical markers; strength and power performance; rating of perceived exertion (RPE) and self-report wellness were collected pre-, half-time, post-, and 2, 24, 48, 72 and 96-h post-match. Change compared to pre-match was calculated using effect size (ES) ±90% confidence limit, and relationships were assessed using regression analysis. Subjects covered 12445.8±768.7 m at 87.1±3.2% maximal HR (mean±SD). Reductions in %VA and POT was present at half-time (-0.38±0.46 and -0.79±0.30, respectively), and persisted post-match. Squat jump height decreased at half-time (-0.42±0.31) and was decreased until Post96. Perceptual fatigue, soreness (-0.92±0.88 and -1.49±0.76, respectively) and creatine kinase (CK, 1.11±0.43) peaked at Post24. Pre-test strength (N.kg) correlated with changes in CK (r=-0.58 to -0.81), peak oxygen consumption (V˙ O2peak) correlated with reduced perceived wellness at Post24 (r=0.44 to 0.58) and RPE post (r=-0.71±0.28). High-speed running correlated with soreness (r=0.42) and very high speed running with reduced POT (r=0.61). Previously unreported half-time reductions in %VA and POT plateaued by post-match, suggesting a role in regulating second-half performance. Perceptual and neuromuscular responses appear related to running intensity. Greater lower-body strength and V˙ O2peak were associated with less CK (i.e., muscle damage) and perceptual responses post-match, respectively, suggesting a training focus should be placed on these capacities.
Wireless multi-hop network scenario emulation by controlling maximal error
Huizhou ZHAO; Xiaoming LI; Wei YAN
2009-01-01
A fundamental problem about Ad-hoc network emulation is how to emulate a wireless multi-hop network scenario in a fixed testbed, which, however, is scarcely discussed in depth by existing radio frequency (RF)control wireless network emulators. Therefore, in this article, we first formulate the wireless multi-hop scenario emulation problem based on RF-control, take controlling the maximal error as the solution mentality, and present an algorithm called the matching exact-solution condition algorithm. The experiment results show that the algorithm can solve the wireless multi-hop network scenario emulation problem and maximal error can be achieved.
Maximizing Complementary Quantities by Projective Measurements
M. Souza, Leonardo A.; Bernardes, Nadja K.; Rossi, Romeu
2017-04-01
In this work, we study the so-called quantitative complementarity quantities. We focus in the following physical situation: two qubits ( q A and q B ) are initially in a maximally entangled state. One of them ( q B ) interacts with a N-qubit system ( R). After the interaction, projective measurements are performed on each of the qubits of R, in a basis that is chosen after independent optimization procedures: maximization of the visibility, the concurrence, and the predictability. For a specific maximization procedure, we study in detail how each of the complementary quantities behave, conditioned on the intensity of the coupling between q B and the N qubits. We show that, if the coupling is sufficiently "strong," independent of the maximization procedure, the concurrence tends to decay quickly. Interestingly enough, the behavior of the concurrence in this model is similar to the entanglement dynamics of a two qubit system subjected to a thermal reservoir, despite that we consider finite N. However, the visibility shows a different behavior: its maximization is more efficient for stronger coupling constants. Moreover, we investigate how the distinguishability, or the information stored in different parts of the system, is distributed for different couplings.
Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
Yong HE; Yi Wei JIANG; Hao ZHOU
2007-01-01
In this paper, we consider the semi-online preemptive scheduling problem with known largest job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time zero) when both machines are busy, which is equivalent to maximizing the minimummachine completion time if idle time is not introduced. We design optimal deterministic semi-onlinealgorithms for every machine speed ratio s ∈ [1, ∞), and show that idle time is required to achieve the optimality during the assignment procedure of the algorithm for any s (s2 + 3s + 1)/(s2 + 2s + 1).The competitive ratio of the algorithms is (s2 + 3s + 1)/(s2 + 2s + 1), which matches the randomized lower bound for every s ≥ 1. Hence randomization does not help for the discussed preemptive scheduling problem.
Polyploidy Induction of Pteroceltis tatarinowii Maxim
Lin ZHANG; Feng WANG; Zhongkui SUN; Cuicui ZHU; Rongwei CHEN
2015-01-01
3%Objective] This study was conducted to obtain tetraploid Pteroceltis tatari-nowi Maxim. with excel ent ornamental traits. [Method] The stem apex growing points of Pteroceltis tatarinowi Maxim. were treated with different concentrations of colchicine solution for different hours to figure out a proper method and obtain poly-ploids. [Result] The most effective induction was obtained by treatment with 0.6%-0.8% colchicine for 72 h with 34.2% mutation rate. Flow cytometry and chromosome observation of the stem apex growing point of P. tatarinowi Maxim. proved that the tetraploid plants were successful y obtained with chromosome number 2n=4x=36. [Conclusion] The result not only fil s the blank of polyploid breeding of P. tatarinowi , but also provides an effective way to broaden the methods of cultivation of fast-growing, high-quality, disease-resilience, new varieties of Pteroceltis.
Quantum theory allows for absolute maximal contextuality
Amaral, Barbara; Cunha, Marcelo Terra; Cabello, Adán
2015-12-01
Contextuality is a fundamental feature of quantum theory and a necessary resource for quantum computation and communication. It is therefore important to investigate how large contextuality can be in quantum theory. Linear contextuality witnesses can be expressed as a sum S of n probabilities, and the independence number α and the Tsirelson-like number ϑ of the corresponding exclusivity graph are, respectively, the maximum of S for noncontextual theories and for the theory under consideration. A theory allows for absolute maximal contextuality if it has scenarios in which ϑ /α approaches n . Here we show that quantum theory allows for absolute maximal contextuality despite what is suggested by the examination of the quantum violations of Bell and noncontextuality inequalities considered in the past. Our proof is not constructive and does not single out explicit scenarios. Nevertheless, we identify scenarios in which quantum theory allows for almost-absolute-maximal contextuality.
The maximal process of nonlinear shot noise
Eliazar, Iddo; Klafter, Joseph
2009-05-01
In the nonlinear shot noise system-model shots’ statistics are governed by general Poisson processes, and shots’ decay-dynamics are governed by general nonlinear differential equations. In this research we consider a nonlinear shot noise system and explore the process tracking, along time, the system’s maximal shot magnitude. This ‘maximal process’ is a stationary Markov process following a decay-surge evolution; it is highly robust, and it is capable of displaying both a wide spectrum of statistical behaviors and a rich variety of random decay-surge sample-path trajectories. A comprehensive analysis of the maximal process is conducted, including its Markovian structure, its decay-surge structure, and its correlation structure. All results are obtained analytically and in closed-form.
Energy Band Calculations for Maximally Even Superlattices
Krantz, Richard; Byrd, Jason
2007-03-01
Superlattices are multiple-well, semiconductor heterostructures that can be described by one-dimensional potential wells separated by potential barriers. We refer to a distribution of wells and barriers based on the theory of maximally even sets as a maximally even superlattice. The prototypical example of a maximally even set is the distribution of white and black keys on a piano keyboard. Black keys may represent wells and the white keys represent barriers. As the number of wells and barriers increase, efficient and stable methods of calculation are necessary to study these structures. We have implemented a finite-element method using the discrete variable representation (FE-DVR) to calculate E versus k for these superlattices. Use of the FE-DVR method greatly reduces the amount of calculation necessary for the eigenvalue problem.
Pattern recognition and string matching
Cheng, Xiuzhen
2002-01-01
The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and practical attention. String matching is also an important topic in combinatorial optimization. This book is devoted to recent advances in pattern recognition and string matching. It consists of twenty eight chapters written by different authors, addressing a broad range of topics such as those from classifica tion, matching, mining, feature selection, and applications. Each chapter is self-contained, and presents either novel methodological approaches or applications of existing theories and techniques. The aim, intent, and motivation for publishing this book is to pro vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way. This includes student...
Matching conditions in relativistic astrophysics
Quevedo, Hernando
2012-01-01
We present an exact electrovacuum solution of Einstein-Maxwell equations with infinite sets of multipole moments which can be used to describe the exterior gravitational field of a rotating charged mass distribution. We show that in the special case of a slowly rotating and slightly deformed body, the exterior solution can be matched to an interior solution belonging to the Hartle-Thorne family of approximate solutions. To search for exact interior solutions, we propose to use the derivatives of the curvature eigenvalues to formulate a $C^3-$matching condition from which the minimum radius can be derived at which the matching of interior and exterior spacetimes can be carried out. We prove the validity of the $C^3-$matching in the particular case of a static mass with a quadrupole moment. The corresponding interior solution is obtained numerically and the matching with the exterior solution gives as a result the minimum radius of the mass configuration.
Flexible Hardware-Based Stereo Matching
2009-02-01
Full Text Available To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.
Flexible Hardware-Based Stereo Matching
Steininger Andreas
2008-01-01
Full Text Available Abstract To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.
Absence of parasympathetic reactivation after maximal exercise.
de Oliveira, Tiago Peçanha; de Alvarenga Mattos, Raphael; da Silva, Rhenan Bartels Ferreira; Rezende, Rafael Andrade; de Lima, Jorge Roberto Perrout
2013-03-01
The ability of the human organism to recover its autonomic balance soon after physical exercise cessation has an important impact on the individual's health status. Although the dynamics of heart rate recovery after maximal exercise has been studied, little is known about heart rate variability after this type of exercise. The aim of this study is to analyse the dynamics of heart rate and heart rate variability recovery after maximal exercise in healthy young men. Fifteen healthy male subjects (21·7 ± 3·4 years; 24·0 ± 2·1 kg m(-2) ) participated in the study. The experimental protocol consisted of an incremental maximal exercise test on a cycle ergometer, until maximal voluntary exhaustion. After the test, recovery R-R intervals were recorded for 5 min. From the absolute differences between peak heart rate values and the heart rate values at 1 and 5 min of the recovery, the heart rate recovery was calculated. Postexercise heart rate variability was analysed from calculations of the SDNN and RMSSD indexes, in 30-s windows (SDNN(30s) and RMSSD(30s) ) throughout recovery. One and 5 min after maximal exercise cessation, the heart rate recovered 34·7 (±6·6) and 75·5 (±6·1) bpm, respectively. With regard to HRV recovery, while the SDNN(30s) index had a slight increase, RMSSD(30s) index remained totally suppressed throughout the recovery, suggesting an absence of vagal modulation reactivation and, possibly, a discrete sympathetic withdrawal. Therefore, it is possible that the main mechanism associated with the fall of HR after maximal exercise is sympathetic withdrawal or a vagal tone restoration without vagal modulation recovery. © 2012 The Authors Clinical Physiology and Functional Imaging © 2012 Scandinavian Society of Clinical Physiology and Nuclear Medicine.
Chinese license plate character segmentation using multiscale template matching
Tian, Jiangmin; Wang, Guoyou; Liu, Jianguo; Xia, Yuanchun
2016-09-01
Character segmentation (CS) plays an important role in automatic license plate recognition and has been studied for decades. A method using multiscale template matching is proposed to settle the problem of CS for Chinese license plates. It is carried out on a binary image integrated from maximally stable extremal region detection and Otsu thresholding. Afterward, a uniform harrow-shaped template with variable length is designed, by virtue of which a three-dimensional matching space is constructed for searching of candidate segmentations. These segmentations are detected at matches with local minimum responses. Finally, the vertical boundaries of each single character are located for subsequent recognition. Experiments on a data set including 2349 license plate images of different quality levels show that the proposed method can achieve a higher accuracy at comparable time cost and is robust to images in poor conditions.
Jackson J Fyfe
2016-11-01
Full Text Available We determined the effect of concurrent training incorporating either high-intensity interval training (HIT or moderate-intensity continuous training (MICT on maximal strength, counter-movement jump (CMJ performance, and body composition adaptations, compared with single-mode resistance training (RT. Twenty-three recreationally-active males (mean ± SD: age, 29.6 ± 5.5 y; V ̇O 2peak, 44 ± 11 mL∙kg-1•min-1 were ranked by one-repetition maximum (1-RM leg press strength and randomly allocated tounderwent 8 weeks (3 sessions•wk-1 of either: 1 HIT combined with RT (HIT+RT group, n=8, 2 work-matched MICT combined with RT (MICT+RT group, n=7, or 3 RT performed alone (RT group, n=8. Measures of aerobic capacity, maximal (1-RM strength, counter-movement jump (CMJ performance and body composition (DXA were obtained before (PRE, mid-way (MID, and after (POST eight weeks of training. Maximal (one-repetition maximum [1-RM] leg press strength was improved from PRE to POST for RT (mean change ±90% confidence interval; 38.5 ±8.5%; effect size [ES] ±90% confidence interval; 1.26 ±0.24; P<0.001, HIT+RT (28.7 ±5.3%; ES, 1.17 ±0.19; P<0.001 and MICT+RT (27.5 ±4.6%, ES, 0.81 ±0.12; P<0.001; however, the magnitude of this change was greater for RT vs. both HIT+RT (7.4 ±8.7%; ES, 0.40 ±0.40 and MICT+RT (8.2 ±9.9%; ES, 0.60 ±0.45. There were no substantial between-group differences in 1-RM bench press strength gain. RT induced greater changes in peak CMJ force vs. HIT+RT (6.8 ±4.5%; ES, 0.41 ±0.28 and MICT+RT (9.9 ±11.2%; ES, 0.54 ±0.65, and greater improvements in maximal CMJ rate of force development (RFD vs. HIT+RT (24.1 ±26.1%; ES, 0.72 ±0.88. Lower-body lean mass was similarly increased for RT (4.1 ±2.0%; ES; 0.33 ±0.16; P=0.023 and MICT+RT (3.6 ±2.4%; ES; 0.45 ±0.30; P=0.052; however, this change was attenuated for HIT+RT (1.8 ±1.6%; ES; 0.13 ±0.12; P=0.069. We conclude that concurrent training incorporating either HIT or work-matched
Maximal and Minimal Congruences on Some Semigroups
Jintana SANWONG; Boorapa SINGHA; R.P.SULLIVAN
2009-01-01
In 2006,Sanwong and Sullivan described the maximal congruences on the semigroup N consisting of all non-negative integers under standard multiplication,and on the semigroup T(X) consisting of all total transformations of an infinite set X under composition. Here,we determine all maximal congruences on the semigroup Zn under multiplication modulo n. And,when Y X,we do the same for the semigroup T(X,Y) consisting of all elements of T(X) whose range is contained in Y. We also characterise the minimal congruences on T(X,Y).
Maximizing oil yields may not optimize economics
1987-03-01
The Los Alamos National Laboratory has used the ASPEN computer code to calculate the economics of different hydroretorting conditions. When the oil yield was maximized and a oil shale plant designed around this process, the costs turned out much higher than expected. However, calculations based on runs of less than maximum yields showed lower cost estimates. It is recommended that future efforts should be concentrated on minimizing production costs rather than maximizing yields. An oil shale plant has been designed around minimum production cost, but has not been able to be tested experimentally.
Maximal Inequalities for Dependent Random Variables
Hoffmann-Jorgensen, Jorgen
2016-01-01
Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X-k. Then a......Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X...
Singularity Structure of Maximally Supersymmetric Scattering Amplitudes
Arkani-Hamed, Nima; Bourjaily, Jacob L.; Cachazo, Freddy
2014-01-01
We present evidence that loop amplitudes in maximally supersymmetric (N=4) Yang-Mills theory (SYM) beyond the planar limit share some of the remarkable structures of the planar theory. In particular, we show that through two loops, the four-particle amplitude in full N=4 SYM has only logarithmic ...... singularities and is free of any poles at infinity—properties closely related to uniform transcendentality and the UV finiteness of the theory. We also briefly comment on implications for maximal (N=8) supergravity theory (SUGRA)....
Local Exact Pattern Matching for Non-Fixed RNA Structures.
Amit, Mika; Backofen, Rolf; Heyne, Steffen; Landau, Gad M; Möhl, Mathias; Otto, Christina; Will, Sebastian
2014-01-01
Detecting local common sequence-structure regions of RNAs is a biologically important problem. Detecting such regions allows biologists to identify functionally relevant similarities between the inspected molecules. We developed dynamic programming algorithms for finding common structure-sequence patterns between two RNAs. The RNAs are given by their sequence and a set of potential base pairs with associated probabilities. In contrast to prior work on local pattern matching of RNAs, we support the breaking of arcs. This allows us to add flexibility over matching only fixed structures; potentially matching only a similar subset of specified base pairs. We present an O(n(3)) algorithm for local exact pattern matching between two nested RNAs, and an O(n(3) log n) algorithm for one nested RNA and one bounded-unlimited RNA. In addition, an algorithm for approximate pattern matching is introduced that for two given nested RNAs and a number k, finds the maximal local pattern matching score between the two RNAs with at most k mismatches in O(n(3)k(2)) time. Finally, we present an O(n(3)) algorithm for finding the most similar subforest between two nested RNAs.
Statistical methods for history matching
Johansen, Kent
Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history m...... history matching metode. Den foreslåede metode forsøger at forbedre konvergensen af traditionel probability perturbation ved at inkludere kvalitativ gradient information.......Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history...... matching dækker over arbejdsprocessen, hvor de fysiske parametre i en reservoirsimuleringsmodel bliver justeret således, at en simulering af olieproduktionen stemmer overens med egentlige målte produktionsdata. Mange history matching metoder er baseret på et geostatistisk fundament, hvilket også gør sig...
Pattern Matching in Multiple Streams
Clifford, Raphael; Porat, Ely; Sach, Benjamin
2012-01-01
We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m+s) words of space. For the k-mismatch and k-differences problems we give O(k) time solutions that require O(m+ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.
Wang, Song; Gardner, Joseph K; Gordon, John J; Li, Weidong; Clews, Luke; Greer, Peter B; Siebers, Jeffrey V
2009-08-01
The aim of this study is to present an efficient method to generate imager-specific Monte Carlo (MC)-based dose kernels for amorphous silicon-based electronic portal image device dose prediction and determine the effective backscattering thicknesses for such imagers. EPID field size-dependent responses were measured for five matched Varian accelerators from three institutions with 6 MV beams at the source to detector distance (SDD) of 105 cm. For two imagers, measurements were made with and without the imager mounted on the robotic supporting arm. Monoenergetic energy deposition kernels with 0-2.5 cm of water backscattering thicknesses were simultaneously computed by MC to a high precision. For each imager, the backscattering thickness required to match measured field size responses was determined. The monoenergetic kernel method was validated by comparing measured and predicted field size responses at 150 cm SDD, 10 x 10 cm2 multileaf collimator (MLC) sliding window fields created with 5, 10, 20, and 50 mm gaps, and a head-and-neck (H&N) intensity modulated radiation therapy (IMRT) patient field. Field size responses for the five different imagers deviated by up to 1.3%. When imagers were removed from the robotic arms, response deviations were reduced to 0.2%. All imager field size responses were captured by using between 1.0 and 1.6 cm backscatter. The predicted field size responses by the imager-specific kernels matched measurements for all involved imagers with the maximal deviation of 0.34%. The maximal deviation between the predicted and measured field size responses at 150 cm SDD is 0.39%. The maximal deviation between the predicted and measured MLC sliding window fields is 0.39%. For the patient field, gamma analysis yielded that 99.0% of the pixels have gamma < 1 by the 2%, 2 mm criteria with a 3% dose threshold. Tunable imager-specific kernels can be generated rapidly and accurately in a single MC simulation. The resultant kernels are imager position
2010-10-01
...) Wax “Vesta” matches are matches that can be ignited by friction either on a prepared surface or on a solid surface. (c) Safety matches and wax “Vesta” matches must be tightly packed in securely closed... packaging with any material other than safety matches or wax “Vesta” matches, which must be packed...
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching;
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...
Gradient dynamics and entropy production maximization
Janečka, Adam
2016-01-01
Gradient dynamics describes irreversible evolution by means of a dissipation potential, which leads to several advantageous features like Maxwell--Onsager relations, distinguishing between thermodynamic forces and fluxes or geometrical interpretation of the dynamics. Entropy production maximization is a powerful tool for predicting constitutive relations in engineering. In this paper, both approaches are compared and their shortcomings and advantages are discussed.
Robust Utility Maximization Under Convex Portfolio Constraints
Matoussi, Anis, E-mail: anis.matoussi@univ-lemans.fr [Université du Maine, Risk and Insurance institut of Le Mans Laboratoire Manceau de Mathématiques (France); Mezghani, Hanen, E-mail: hanen.mezghani@lamsin.rnu.tn; Mnif, Mohamed, E-mail: mohamed.mnif@enit.rnu.tn [University of Tunis El Manar, Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l’Ingénieur, ENIT (Tunisia)
2015-04-15
We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle.
Maximizing the Motivated Mind for Emergent Giftedness.
Rea, Dan
2001-01-01
This article explains how the theory of the motivated mind conceptualizes the productive interaction of intelligence, creativity, and achievement motivation and how this theory can help educators to maximize students' emergent potential for giftedness. It discusses the integration of cold-order thinking and hot-chaotic thinking into fluid-adaptive…
The Winning Edge: Maximizing Success in College.
Schmitt, David E.
This book offers college students ideas on how to maximize their success in college by examining the personal management techniques a student needs to succeed. Chapters are as follows: "Getting and Staying Motivated"; "Setting Goals and Tapping Your Resources"; "Conquering Time"; "Think Yourself to College Success"; "Understanding and Remembering…
MAXIMAL ELEMENTS AND EQUILIBRIUM OF ABSTRACT ECONOMY
刘心歌; 蔡海涛
2001-01-01
An existence theorem of maximal elements for a new type of preference correspondences which are Qθ-majorized is given. Then some existence theorems of equilibrium for abstract economy and qualitative game in which the constraint or preference correspondences are Qθ-majorized are obtained in locally convex topological vector spaces.
DNA solution of the maximal clique problem.
Ouyang, Q; Kaplan, P D; Liu, S; Libchaber, A
1997-10-17
The maximal clique problem has been solved by means of molecular biology techniques. A pool of DNA molecules corresponding to the total ensemble of six-vertex cliques was built, followed by a series of selection processes. The algorithm is highly parallel and has satisfactory fidelity. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
Maximal workload capacity on moving platforms
Heus, R.; Wertheim, A.H.
1996-01-01
Physical tasks on a moving platform required more energy than the same tasks on a non-moving platform. In this study the maximum aerobic performance (defined as V_O2max) of people working on a moving floor was established compared to the maximal aerobic performance on a non-moving floor. The main
Maximal workload capacity on moving platforms
Heus, R.; Wertheim, A.H.
1996-01-01
Physical tasks on a moving platform required more energy than the same tasks on a non-moving platform. In this study the maximum aerobic performance (defined as V_O2max) of people working on a moving floor was established compared to the maximal aerobic performance on a non-moving floor. The main qu
Maximizing Resource Utilization in Video Streaming Systems
Alsmirat, Mohammad Abdullah
2013-01-01
Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…
Maximizing throughput in an automated test system
朱君
2007-01-01
@@ Overview This guide is collection of whitepapers designed to help you develop test systems that lower your cost, increase your test throughput, and can scale with future requirements. This whitepaper provides strategies for maximizing system throughput. To download the complete developers guide (120 pages), visit ni. com/automatedtest.
The gaugings of maximal D=6 supergravity
Bergshoeff, E.; Samtleben, H.; Sezgin, E.
2008-01-01
We construct the most general gaugings of the maximal D = 6 supergravity. The theory is ( 2, 2) supersymmetric, and possesses an on-shell SO( 5, 5) duality symmetry which plays a key role in determining its couplings. The field content includes 16 vector fields that carry a chiral spinor representat
WEIGHTED BOUNDEDNESS OF A ROUGH MAXIMAL OPERATOR
无
2000-01-01
In this note the authors give the weighted Lp-boundedness fora class of maximal singular integral operators with rough kernel.The result in this note is an improvement and extension ofthe result obtained by Chen and Lin in 1990.
Maximizing the Range of a Projectile.
Brown, Ronald A.
1992-01-01
Discusses solutions to the problem of maximizing the range of a projectile. Presents three references that solve the problem with and without the use of calculus. Offers a fourth solution suitable for introductory physics courses that relies more on trigonometry and the geometry of the problem. (MDH)
Ehrenfest's Lottery--Time and Entropy Maximization
Ashbaugh, Henry S.
2010-01-01
Successful teaching of the Second Law of Thermodynamics suffers from limited simple examples linking equilibrium to entropy maximization. I describe a thought experiment connecting entropy to a lottery that mixes marbles amongst a collection of urns. This mixing obeys diffusion-like dynamics. Equilibrium is achieved when the marble distribution is…
Testing maximality in muon neutrino flavor mixing
Choubey, S; Choubey, Sandhya; Roy, Probir
2003-01-01
The small difference between the survival probabilities of muon neutrino and antineutrino beams, traveling through earth matter in a long baseline experiment such as MINOS, is shown to be an important measure of any possible deviation from maximality in the flavor mixing of those states.
Average utility maximization: A preference foundation
A.V. Kothiyal (Amit); V. Spinu (Vitalie); P.P. Wakker (Peter)
2014-01-01
textabstractThis paper provides necessary and sufficient preference conditions for average utility maximization over sequences of variable length. We obtain full generality by using a new algebraic technique that exploits the richness structure naturally provided by the variable length of the sequen
On the Hardy-Littlewood maximal theorem
Shinji Yamashita
1982-01-01
Full Text Available The Hardy-Littlewood maximal theorem is extended to functions of class PL in the sense of E. F. Beckenbach and T. Radó, with a more precise expression of the absolute constant in the inequality. As applications we deduce some results on hyperbolic Hardy classes in terms of the non-Euclidean hyperbolic distance in the unit disk.
Maximal Cartel Pricing and Leniency Programs
Houba, H.E.D.; Motchenkova, E.; Wen, Q.
2008-01-01
For a general class of oligopoly models with price competition, we analyze the impact of ex-ante leniency programs in antitrust regulation on the endogenous maximal-sustainable cartel price. This impact depends upon industry characteristics including its cartel culture. Our analysis disentangles the
How to Generate Good Profit Maximization Problems
Davis, Lewis
2014-01-01
In this article, the author considers the merits of two classes of profit maximization problems: those involving perfectly competitive firms with quadratic and cubic cost functions. While relatively easy to develop and solve, problems based on quadratic cost functions are too simple to address a number of important issues, such as the use of…
Ehrenfest's Lottery--Time and Entropy Maximization
Ashbaugh, Henry S.
2010-01-01
Successful teaching of the Second Law of Thermodynamics suffers from limited simple examples linking equilibrium to entropy maximization. I describe a thought experiment connecting entropy to a lottery that mixes marbles amongst a collection of urns. This mixing obeys diffusion-like dynamics. Equilibrium is achieved when the marble distribution is…
Maximally entangled mixed states made easy
Aiello, A; Voigt, D; Woerdman, J P
2006-01-01
We show that, contrarily to a recent claim [M. Ziman and V. Bu\\v{z}ek, Phys. Rev. A. \\textbf{72}, 052325 (2005)], it is possible to achieve maximally entangled mixed states of two qubits from the singlet state via the action of local nonunital quantum channels. Moreover, we present a simple, feasible linear optical implementation of one of such channels.
Maximizing Resource Utilization in Video Streaming Systems
Alsmirat, Mohammad Abdullah
2013-01-01
Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…
Maximizing scientific knowledge from randomized clinical trials
Gustafsson, Finn; Atar, Dan; Pitt, Bertram
2010-01-01
Trialists have an ethical and financial responsibility to plan and conduct clinical trials in a manner that will maximize the scientific knowledge gained from the trial. However, the amount of scientific information generated by randomized clinical trials in cardiovascular medicine is highly...
Maximal Heat Generation in Nanoscale Systems
ZHOU Li-Ling; LI Shu-Shen; ZENG Zhao-Yang
2009-01-01
We investigate the heat generation in a nanoscale system coupled to normal leads and find that it is maximal when the average occupation of the electrons in the nanoscale system is 0.5,no matter what mechanism induces the heat generation.
MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.
Eeckhout, Jan; Munshi, Kaivan
2010-09-01
This paper analyzes an informal financial institution that brings heterogeneous agents together in groups. We analyze decentralized matching into these groups, and the equilibrium composition of participants that consequently arises. We find that participants sort remarkably well across the competing groups, and that they re-sort immediately following an unexpected exogenous regulatory change. These findings suggest that the competitive matching model might have applicability and bite in other settings where matching is an important equilibrium phenomenon. (JEL: O12, O17, G20, D40).
Understanding violations of Gricean maxims in preschoolers and adults.
Okanda, Mako; Asada, Kosuke; Moriguchi, Yusuke; Itakura, Shoji
2015-01-01
This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants' understanding of the following maxims was assessed: be informative (first maxim of quantity), avoid redundancy (second maxim of quantity), be truthful (maxim of quality), be relevant (maxim of relation), avoid ambiguity (second maxim of manner), and be polite (maxim of politeness). Sensitivity to violations of Gricean maxims increased with age: 4-year-olds' understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner), and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.
Understanding Violations of Gricean Maxims in Preschoolers and Adults
Mako eOkanda
2015-07-01
Full Text Available This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants’ understanding of the following maxims was assessed: be informative (first maxim of quantity, avoid redundancy (second maxim of quantity, be truthful (maxim of quality, be relevant (maxim of relation, avoid ambiguity (second maxim of manner, and be polite (maxim of politeness. Sensitivity to violations of Gricean maxims increased with age: 4-year-olds’ understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner, and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.
A novel algorithm for a rotation invariant template matching
LEI Ming; ZHANG Guang-jun
2008-01-01
A novel algorithm for a rotation invariant template matching is proposed when the fluctuating scope of the rotation angle is limited within the region of [-20°,20°]. The matching candidates are selected using a computationally low cost improved correlation algorithm. "AND" operation is adopted to reduce the computational cost. Therefore the algorithm improves the matching speed consumedly. The simulation results verify the efficiency of the proposed method. Moreover, when the size of reference image is fixed, the advantage of this time-saving algorithm is more obvious as the increase of the size of the real time image. The matching speed of the proposed method is over 20 times faster than the speed of the two-level pyramid decomposing accelerating method.
Iris Matching Based On a Stack Like Structure Graph Approach
Roushdi Mohamed FAROUK
2012-12-01
Full Text Available In this paper, we present the elastic bunch graph matching as a new approach for iris recognition. The task is difficult because of iris variation in terms of position, size, and partial occlusion. We have used the circular Hough transform to determine the iris boundaries. Individual segmented irises are represented as labeled graphs. We have combined a representative set of individual model graphs into a stack like structure called an iris bunch graph (IBG. Finally, a bunch graph similarity function is proposed to compare a test graph with the IBG. Recognition results are given for galleries of irises from CASIA version and UBIRIS databases. The numerical results show that, the elastic bunch graph matching is an effective technique for iris matching. We also compare our results with previous results and find that, the elastic bunch graph matching is an effective matching performance.
Edge-Matching Problems with Rotations
Ebbesen, Martin; Fischer, Paul; Witt, Carsten
2011-01-01
Edge-matching problems, also called puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II...... puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so...
Cardiac Function in Patients with Early Cirrhosis during Maximal Beta-Adrenergic Drive
Krag, Aleksander; Bendtsen, Flemming; Dahl, Emilie Kristine
2014-01-01
with cirrhosis and controls had an equal stress response, the heart rate and ejection fraction increased similarly and maximal heart rate was reached in all. At rest CO was higher in Child B patients than controls. During maximal stress, Child B patients had higher CO (10.6±2.7 vs. 8.0±1.8 L/min), left ventricle...... A and B cirrhosis (9 with non-alcoholic cirrhosis) and 7 matched controls were included. We used cardiac magnetic resonance imaging to assess left ventricular volumes and cardiac output (CO) at rest and during maximal heart rate induced by increasing dosages of dobutamine and atropine. RESULTS: Patients...... stress induced by dobutamine is normal. With progression of the disease, the mass of the heart increases along with increase in cardiac volumes....
Bandholm, Thomas; Rasmussen, Lars; Aagaard, Per
2006-01-01
We investigated the effects of the subacromial impingement syndrome (SIS) on shoulder sensory-motor control and maximal shoulder muscle strength. It was hypothesized that both would be impaired due to chronic shoulder pain associated with the syndrome. Nine subjects with unilateral SIS who remained...... physically active in spite of shoulder pain and nine healthy matched controls were examined to determine isometric and isokinetic submaximal shoulder-abduction force steadiness at target forces corresponding to 20%, 27.5%, and 35% of the maximal shoulder abductor torque, and maximal shoulder muscle strength...... (MVC). Electromyographic (EMG) activity was assessed using surface and intramuscular recordings from eight shoulder muscles. Force steadiness was impaired in SIS subjects during concentric contractions at the highest target force level only, with muscle activity largely unaffected. No between...
Matched Spectral Filter Imager Project
National Aeronautics and Space Administration — OPTRA proposes the development of an imaging spectrometer for greenhouse gas and volcanic gas imaging based on matched spectral filtering and compressive imaging....
Improved bounds for stochastic matching
Li, Jian
2010-01-01
In this paper we study stochastic matching problems that are motivated by applications in online dating and kidney exchange programs. We consider two probing models: edge probing and matching probing. Our main result is an algorithm that finds a matching-probing strategy attaining a small constant approximation ratio. An interesting aspect of our approach is that we compare the cost our solution to the best edge-probing strategy. Thus, we indirectly show that the best matching-probing strategy is only a constant factor away from the best edge-probing strategy. Even though our algorithm has a slightly worse approximation ratio than a greedy algorithm for edge-probing strategies, we show that the two algorithms can be combined to get improved approximations.
Vidal, Rene Victor Valqui
1994-01-01
The paper studies the problem of determining the number and dimensions of sizes of apparel so as to maximize profits. It develops a simple one-variable bisection search algorithm that gives the optimal solution. An example is solved interactively using a Macintosh LC and Math CAD, a mathematical ...
An Efficient Pattern Matching Algorithm
Sleit, Azzam; Almobaideen, Wesam; Baarah, Aladdin H.; Abusitta, Adel H.
In this study, we present an efficient algorithm for pattern matching based on the combination of hashing and search trees. The proposed solution is classified as an offline algorithm. Although, this study demonstrates the merits of the technique for text matching, it can be utilized for various forms of digital data including images, audio and video. The performance superiority of the proposed solution is validated analytically and experimentally.
Review og pattern matching approaches
Manfaat, D.; Duffy, Alex; Lee, B. S.
1996-01-01
This paper presents a review of pattern matching techniques. The application areas for pattern matching are extensive, ranging from CAD systems to chemical analysis and from manufacturing to image processing. Published techniques and methods are classified and assessed within the context of three...... key issues: pattern classes, similiarity types and mathing methods. It has been shown that the techniques and approaches are as diverse and varied as the applications....
2-Jump DNA Search Multiple Pattern Matching Algorithm
Raju Bhukya; D. V. L. N. Somayajulu
2011-01-01
Pattern matching in a DNA sequence or searching a pattern from a large data base is a major research area in computational biology. To extract pattern match from a large sequence it takes more time, in order to reduce searching time we have proposed an approach that reduces the search time with accurate retrieval of the matched pattern in the sequence. As performance plays a major role in extracting patterns from a given DNA sequence or from a database independent of the size of the sequence....
Compressed Subsequence Matching and Packed Tree Coloring
Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li
2017-01-01
We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log N......\\log w\\cdot occ)\\) or \\(O(n+\\frac{n\\sigma }{w}\\log w+m\\log N\\cdot occ)\\) time. Here w is the word size and occ is the number of minimal occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for \\(occ=o(\\frac{n}{\\log N})\\) occurrences. The algorithm uses...... a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings....
Dense real-time stereo matching using memory efficient semi-global-matching variant based on FPGAs
Buder, Maximilian
2012-06-01
This paper presents a stereo image matching system that takes advantage of a global image matching method. The system is designed to provide depth information for mobile robotic applications. Typical tasks of the proposed system are to assist in obstacle avoidance, SLAM and path planning. Mobile robots pose strong requirements about size, energy consumption, reliability and output quality of the image matching subsystem. Current available systems either rely on active sensors or on local stereo image matching algorithms. The first are only suitable in controlled environments while the second suffer from low quality depth-maps. Top ranking quality results are only achieved by an iterative approach using global image matching and color segmentation techniques which are computationally demanding and therefore difficult to be executed in realtime. Attempts were made to still reach realtime performance with global methods by simplifying the routines. The depth maps are at the end almost comparable to local methods. An equally named semi-global algorithm was proposed earlier that shows both very good image matching results and relatively simple operations. A memory efficient variant of the Semi-Global-Matching algorithm is reviewed and adopted for an implementation based on reconfigurable hardware. The implementation is suitable for realtime execution in the field of robotics. It will be shown that the modified version of the efficient Semi-Global-Matching method is delivering equivalent result compared to the original algorithm based on the Middlebury dataset. The system has proven to be capable of processing VGA sized images with a disparity resolution of 64 pixel at 33 frames per second based on low cost to mid-range hardware. In case the focus is shifted to a higher image resolution, 1024×1024-sized stereo frames may be processed with the same hardware at 10 fps. The disparity resolution settings stay unchanged. A mobile system that covers preprocessing, matching
Local Search Approaches in Stable Matching Problems
Toby Walsh
2013-10-01
Full Text Available The stable marriage (SM problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order over the members of the other sex. Solving an SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI (Stable Marriage with Ties and Incomplete lists where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists, and we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We empirically evaluate our algorithm for SM problems by measuring its runtime behavior and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behavior and its ability to find a maximum cardinality stable marriage. Experimental results suggest that for SM problems, the number of steps of our algorithm grows only as O(n log(n, and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages. Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size, despite the
Measurable Maximal Energy and Minimal Time Interval
Dahab, Eiman Abou El
2014-01-01
The possibility of finding the measurable maximal energy and the minimal time interval is discussed in different quantum aspects. It is found that the linear generalized uncertainty principle (GUP) approach gives a non-physical result. Based on large scale Schwarzshild solution, the quadratic GUP approach is utilized. The calculations are performed at the shortest distance, at which the general relativity is assumed to be a good approximation for the quantum gravity and at larger distances, as well. It is found that both maximal energy and minimal time have the order of the Planck time. Then, the uncertainties in both quantities are accordingly bounded. Some physical insights are addressed. Also, the implications on the physics of early Universe and on quantized mass are outlined. The results are related to the existence of finite cosmological constant and minimum mass (mass quanta).
Maximal temperature in a simple thermodynamical system
Dai, De-Chang
2016-01-01
Temperature in a simple thermodynamical system is not limited from above. It is also widely believed that it does not make sense talking about temperatures higher than the Planck temperature in the absence of the full theory of quantum gravity. Here, we demonstrate that there exist a maximal achievable temperature in a system where particles obey the laws of quantum mechanics and classical gravity before we reach the realm of quantum gravity. Namely, if two particles with a given center of mass energy come at the distance shorter than the Schwarzschild diameter apart, according to classical gravity they will form a black hole. It is possible to calculate that a simple thermodynamical system will be dominated by black holes at a critical temperature which is about three times lower than the Planck temperature. That represents the maximal achievable temperature in a simple thermodynamical system.
Hamiltonian formalism and path entropy maximization
Davis, Sergio; González, Diego
2015-10-01
Maximization of the path information entropy is a clear prescription for constructing models in non-equilibrium statistical mechanics. Here it is shown that, following this prescription under the assumption of arbitrary instantaneous constraints on position and velocity, a Lagrangian emerges which determines the most probable trajectory. Deviations from the probability maximum can be consistently described as slices in time by a Hamiltonian, according to a nonlinear Langevin equation and its associated Fokker-Planck equation. The connections unveiled between the maximization of path entropy and the Langevin/Fokker-Planck equations imply that missing information about the phase space coordinate never decreases in time, a purely information-theoretical version of the second law of thermodynamics. All of these results are independent of any physical assumptions, and thus valid for any generalized coordinate as a function of time, or any other parameter. This reinforces the view that the second law is a fundamental property of plausible inference.
Predicting Contextual Sequences via Submodular Function Maximization
Dey, Debadeepta; Hebert, Martial; Bagnell, J Andrew
2012-01-01
Sequence optimization, where the items in a list are ordered to maximize some reward has many applications such as web advertisement placement, search, and control libraries in robotics. Previous work in sequence optimization produces a static ordering that does not take any features of the item or context of the problem into account. In this work, we propose a general approach to order the items within the sequence based on the context (e.g., perceptual information, environment description, and goals). We take a simple, efficient, reduction-based approach where the choice and order of the items is established by repeatedly learning simple classifiers or regressors for each "slot" in the sequence. Our approach leverages recent work on submodular function maximization to provide a formal regret reduction from submodular sequence optimization to simple cost-sensitive prediction. We apply our contextual sequence prediction algorithm to optimize control libraries and demonstrate results on two robotics problems: ...
Maximally Symmetric Spacetimes emerging from thermodynamic fluctuations
Bravetti, A; Quevedo, H
2015-01-01
In this work we prove that the maximally symmetric vacuum solutions of General Relativity emerge from the geometric structure of statistical mechanics and thermodynamic fluctuation theory. To present our argument, we begin by showing that the pseudo-Riemannian structure of the Thermodynamic Phase Space is a solution to the vacuum Einstein-Gauss-Bonnet theory of gravity with a cosmological constant. Then, we use the geometry of equilibrium thermodynamics to demonstrate that the maximally symmetric vacuum solutions of Einstein's Field Equations -- Minkowski, de-Sitter and Anti-de-Sitter spacetimes -- correspond to thermodynamic fluctuations. Moreover, we argue that these might be the only possible solutions that can be derived in this manner. Thus, the results presented here are the first concrete examples of spacetimes effectively emerging from the thermodynamic limit over an unspecified microscopic theory without any further assumptions.
Consistent 4-form fluxes for maximal supergravity
Godazgar, Hadi; Krueger, Olaf; Nicolai, Hermann
2015-01-01
We derive new ansaetze for the 4-form field strength of D=11 supergravity corresponding to uplifts of four-dimensional maximal gauged supergravity. In particular, the ansaetze directly yield the components of the 4-form field strength in terms of the scalars and vectors of the four-dimensional maximal gauged supergravity---in this way they provide an explicit uplift of all four-dimensional consistent truncations of D=11 supergravity. The new ansaetze provide a substantially simpler method for uplifting d=4 flows compared to the previously available method using the 3-form and 6-form potential ansaetze. The ansatz for the Freund-Rubin term allows us to conjecture a `master formula' for the latter in terms of the scalar potential of d=4 gauged supergravity and its first derivative. We also resolve a long-standing puzzle concerning the antisymmetry of the flux obtained from uplift ansaetze.
Modularity maximization using completely positive programming
Yazdanparast, Sakineh; Havens, Timothy C.
2017-04-01
Community detection is one of the most prominent problems of social network analysis. In this paper, a novel method for Modularity Maximization (MM) for community detection is presented which exploits the Alternating Direction Augmented Lagrangian (ADAL) method for maximizing a generalized form of Newman's modularity function. We first transform Newman's modularity function into a quadratic program and then use Completely Positive Programming (CPP) to map the quadratic program to a linear program, which provides the globally optimal maximum modularity partition. In order to solve the proposed CPP problem, a closed form solution using the ADAL merged with a rank minimization approach is proposed. The performance of the proposed method is evaluated on several real-world data sets used for benchmarks community detection. Simulation results shows the proposed technique provides outstanding results in terms of modularity value for crisp partitions.
Utility maximization in incomplete markets with default
Lim, Thomas
2008-01-01
We adress the maximization problem of expected utility from terminal wealth. The special feature of this paper is that we consider a financial market where the price process of risky assets can have a default time. Using dynamic programming, we characterize the value function with a backward stochastic differential equation and the optimal portfolio policies. We separately treat the cases of exponential, power and logarithmic utility.
Operational Modal Analysis using Expectation Maximization Algorithm
Cara Cañas, Francisco Javier; Carpio Huertas, Jaime; Juan Ruiz, Jesús; Alarcón Álvarez, Enrique
2011-01-01
This paper presents a time-domain stochastic system identification method based on Maximum Likelihood Estimation and the Expectation Maximization algorithm. The effectiveness of this structural identification method is evaluated through numerical simulation in the context of the ASCE benchmark problem on structural health monitoring. Modal parameters (eigenfrequencies, damping ratios and mode shapes) of the benchmark structure have been estimated applying the proposed identification method...
Revenue Maximizing Head Starts in Contests
Franke, Jörg; Leininger, Wolfgang; Wasser, Cédric
2014-01-01
We characterize revenue maximizing head starts for all-pay auctions and lottery contests with many heterogeneous players. We show that under optimal head starts all-pay auctions revenue-dominate lottery contests for any degree of heterogeneity among players. Moreover, all-pay auctions with optimal head starts induce higher revenue than any multiplicatively biased all-pay auction or lottery contest. While head starts are more effective than multiplicative biases in all-pay auctions, they are l...
Approximate Revenue Maximization in Interdependent Value Settings
Chawla, Shuchi; Fu, Hu; Karlin, Anna
2014-01-01
We study revenue maximization in settings where agents' values are interdependent: each agent receives a signal drawn from a correlated distribution and agents' values are functions of all of the signals. We introduce a variant of the generalized VCG auction with reserve prices and random admission, and show that this auction gives a constant approximation to the optimal expected revenue in matroid environments. Our results do not require any assumptions on the signal distributions, however, ...
Optimal decision making and matching are tied through diminishing returns.
Kubanek, Jan
2017-08-08
How individuals make decisions has been a matter of long-standing debate among economists and researchers in the life sciences. In economics, subjects are viewed as optimal decision makers who maximize their overall reward income. This framework has been widely influential, but requires a complete knowledge of the reward contingencies associated with a given choice situation. Psychologists and ecologists have observed that individuals tend to use a simpler "matching" strategy, distributing their behavior in proportion to relative rewards associated with their options. This article demonstrates that the two dominant frameworks of choice behavior are linked through the law of diminishing returns. The relatively simple matching can in fact provide maximal reward when the rewards associated with decision makers' options saturate with the invested effort. Such saturating relationships between reward and effort are hallmarks of the law of diminishing returns. Given the prevalence of diminishing returns in nature and social settings, this finding can explain why humans and animals so commonly behave according to the matching law. The article underscores the importance of the law of diminishing returns in choice behavior.
A. J. Perez-Diaz
2010-08-01
Full Text Available Fingerprint verification is the most important step in the fingerprint-based biometric systems. The matching score islinked to the chance of identifying a person. Nowadays, two fingerprint matching methods are the most popular: thecorrelation-based method and the minutiae-based method. In this work, three biometric systems were evaluated:Neurotechnology Verifinger 6.0 Extended, Innovatrics IDKit SDK and Griaule Fingerprint SDK 2007. The evaluationwas performed according to the experiments of the Fingerprint Verification Competition (FVC. The influence of thefingerprint rotation degrees on false match rate (FMR and false non-match rate (FNMR was evaluated. The resultsshowed that the FMR values increase as rotation degrees increase too, meanwhile, the FNMR values decrease.Experimental results demonstrate that Verifinger SDK shows good performance on false non-match testing, with anFNMR mean of 7%, followed by IDKit SDK (6.71% ~ 13.66% and Fingerprint SDK (50%. However, Fingerprint SDKdemonstrates a better performance on false match testing, with an FMR mean of ~0%, followed by Verifinger SDK(7.62% - 9% and IDKit SDK (above 28%. As result of the experiments, Verifinger SDK had, in general, the bestperformance. Subsequently, we calculated the regression functions to predict the behavior of FNMR and FMR fordifferent threshold values with different rotation degrees.
Maximal supersymmetry and B-mode targets
Kallosh, Renata; Linde, Andrei; Wrase, Timm; Yamada, Yusuke
2017-04-01
Extending the work of Ferrara and one of the authors [1], we present dynamical cosmological models of α-attractors with plateau potentials for 3 α = 1, 2, 3, 4, 5, 6, 7. These models are motivated by geometric properties of maximally supersymmetric theories: M-theory, superstring theory, and maximal N = 8 supergravity. After a consistent truncation of maximal to minimal supersymmetry in a seven-disk geometry, we perform a two-step procedure: 1) we introduce a superpotential, which stabilizes the moduli of the seven-disk geometry in a supersymmetric minimum, 2) we add a cosmological sector with a nilpotent stabilizer, which breaks supersymmetry spontaneously and leads to a desirable class of cosmological attractor models. These models with n s consistent with observational data, and with tensor-to-scalar ratio r ≈ 10-2 - 10-3, provide natural targets for future B-mode searches. We relate the issue of stability of inflationary trajectories in these models to tessellations of a hyperbolic geometry.
Maximal respiratory pressures among adolescent swimmers.
Rocha Crispino Santos, M A; Pinto, M L; Couto Sant'Anna, C; Bernhoeft, M
2011-01-01
Maximal inspiratory pressures (MIP) and maximal expiratory pressures (MEP) are useful indices of respiratory muscle strength in athletes. The aims of this study were: to describe the strength of the respiratory muscles of Olympic junior swim team, at baseline and after a standard physical training; and to determine if there is a differential inspiratory and expiratory pressure response to the physical training. A cross-sectional study evaluated 28 international-level swimmers with ages ranging from 15 to 17 years, 19 (61 %) being males. At baseline, MIP was found to be lower in females (P = .001). The mean values reached by males and females were: MIP(cmH2O) = M: 100.4 (± 26.5)/F: 67.8 (± 23.2); MEP (cmH2O) = M: 87.4 (± 20.7)/F: 73.9 (± 17.3). After the physical training they reached: MIP (cmH2O) = M: 95.3 (± 30.3)/F: 71.8 (± 35.6); MEP (cmH2O) = M: 82.8 (± 26.2)/F: 70.4 (± 8.3). No differential pressure responses were observed in either males or females. These results suggest that swimmers can sustain the magnitude of the initial maximal pressures. Other studies should be developed to clarify if MIP and MEP could be used as a marker of an athlete's performance.
Understanding Y haplotype matching probability.
Brenner, Charles H
2014-01-01
The Y haplotype population-genetic terrain is better explored from a fresh perspective rather than by analogy with the more familiar autosomal ideas. For haplotype matching probabilities, versus for autosomal matching probabilities, explicit attention to modelling - such as how evolution got us where we are - is much more important while consideration of population frequency is much less so. This paper explores, extends, and explains some of the concepts of "Fundamental problem of forensic mathematics - the evidential strength of a rare haplotype match". That earlier paper presented and validated a "kappa method" formula for the evidential strength when a suspect matches a previously unseen haplotype (such as a Y-haplotype) at the crime scene. Mathematical implications of the kappa method are intuitive and reasonable. Suspicions to the contrary raised in rest on elementary errors. Critical to deriving the kappa method or any sensible evidential calculation is understanding that thinking about haplotype population frequency is a red herring; the pivotal question is one of matching probability. But confusion between the two is unfortunately institutionalized in much of the forensic world. Examples make clear why (matching) probability is not (population) frequency and why uncertainty intervals on matching probabilities are merely confused thinking. Forensic matching calculations should be based on a model, on stipulated premises. The model inevitably only approximates reality, and any error in the results comes only from error in the model, the inexactness of the approximation. Sampling variation does not measure that inexactness and hence is not helpful in explaining evidence and is in fact an impediment. Alternative haplotype matching probability approaches that various authors have considered are reviewed. Some are based on no model and cannot be taken seriously. For the others, some evaluation of the models is discussed. Recent evidence supports the adequacy of
Matching illumination of solid objects.
Pont, Sylvia C; Koenderink, Jan J
2007-04-01
The appearance of objects is determined by their surface reflectance and roughness and by the light field. Conversely, human observers might derive properties of the light field from the appearance of objects. The inverse problem has no unique solution, so perceptual interactions between reflectance, roughness, and lightfield are to be expected. In two separate experiments, we tested whether observers are able to match the illumination of spheres under collimated illumination only (matching of illumination direction) and under more or less diffuse illumination (matching of illumination direction and directedness of the beam). We found that observers are quite able to match collimated illumination directions of two rendered Lambertian spheres. Matching of the collimated beam directions of a Lambertian sphere and that of a real object with arbitrary reflectance and roughness properties resulted in similar results for the azimuthal angle, but in higher variance for the polar angle. Translucent objects and a tennis ball were found to be systematic outliers. If the directedness of the beam was also varied, the direction settings showed larger variance for more diffuse illumination. The directedness settings showed an overall quite large variance and, interestingly, interacted with the polar angle settings. We discuss possible photometrical mechanisms behind these effects.
Cardiorespiratory Coordination in Repeated Maximal Exercise
Sergi Garcia-Retortillo
2017-06-01
Full Text Available Increases in cardiorespiratory coordination (CRC after training with no differences in performance and physiological variables have recently been reported using a principal component analysis approach. However, no research has yet evaluated the short-term effects of exercise on CRC. The aim of this study was to delineate the behavior of CRC under different physiological initial conditions produced by repeated maximal exercises. Fifteen participants performed 2 consecutive graded and maximal cycling tests. Test 1 was performed without any previous exercise, and Test 2 6 min after Test 1. Both tests started at 0 W and the workload was increased by 25 W/min in males and 20 W/min in females, until they were not able to maintain the prescribed cycling frequency of 70 rpm for more than 5 consecutive seconds. A principal component (PC analysis of selected cardiovascular and cardiorespiratory variables (expired fraction of O2, expired fraction of CO2, ventilation, systolic blood pressure, diastolic blood pressure, and heart rate was performed to evaluate the CRC defined by the number of PCs in both tests. In order to quantify the degree of coordination, the information entropy was calculated and the eigenvalues of the first PC (PC1 were compared between tests. Although no significant differences were found between the tests with respect to the performed maximal workload (Wmax, maximal oxygen consumption (VO2 max, or ventilatory threshold (VT, an increase in the number of PCs and/or a decrease of eigenvalues of PC1 (t = 2.95; p = 0.01; d = 1.08 was found in Test 2 compared to Test 1. Moreover, entropy was significantly higher (Z = 2.33; p = 0.02; d = 1.43 in the last test. In conclusion, despite the fact that no significant differences were observed in the conventionally explored maximal performance and physiological variables (Wmax, VO2 max, and VT between tests, a reduction of CRC was observed in Test 2. These results emphasize the interest of CRC
Cardiorespiratory Coordination in Repeated Maximal Exercise.
Garcia-Retortillo, Sergi; Javierre, Casimiro; Hristovski, Robert; Ventura, Josep L; Balagué, Natàlia
2017-01-01
Increases in cardiorespiratory coordination (CRC) after training with no differences in performance and physiological variables have recently been reported using a principal component analysis approach. However, no research has yet evaluated the short-term effects of exercise on CRC. The aim of this study was to delineate the behavior of CRC under different physiological initial conditions produced by repeated maximal exercises. Fifteen participants performed 2 consecutive graded and maximal cycling tests. Test 1 was performed without any previous exercise, and Test 2 6 min after Test 1. Both tests started at 0 W and the workload was increased by 25 W/min in males and 20 W/min in females, until they were not able to maintain the prescribed cycling frequency of 70 rpm for more than 5 consecutive seconds. A principal component (PC) analysis of selected cardiovascular and cardiorespiratory variables (expired fraction of O2, expired fraction of CO2, ventilation, systolic blood pressure, diastolic blood pressure, and heart rate) was performed to evaluate the CRC defined by the number of PCs in both tests. In order to quantify the degree of coordination, the information entropy was calculated and the eigenvalues of the first PC (PC1) were compared between tests. Although no significant differences were found between the tests with respect to the performed maximal workload (Wmax), maximal oxygen consumption (VO2 max), or ventilatory threshold (VT), an increase in the number of PCs and/or a decrease of eigenvalues of PC1 (t = 2.95; p = 0.01; d = 1.08) was found in Test 2 compared to Test 1. Moreover, entropy was significantly higher (Z = 2.33; p = 0.02; d = 1.43) in the last test. In conclusion, despite the fact that no significant differences were observed in the conventionally explored maximal performance and physiological variables (Wmax, VO2 max, and VT) between tests, a reduction of CRC was observed in Test 2. These results emphasize the interest of CRC evaluation in
Advanced gradient-index lens design tools to maximize system performance and reduce SWaP
Campbell, Sawyer D.; Nagar, Jogender; Brocker, Donovan E.; Easum, John A.; Turpin, Jeremiah P.; Werner, Douglas H.
2016-05-01
GRadient-INdex (GRIN) lenses have long been of interest due to their potential for providing levels of performance unachievable with traditional homogeneous lenses. While historically limited by a lack of suitable materials, rapid advancements in manufacturing techniques, including 3D printing, have recently kindled a renewed interest in GRIN optics. Further increasing the desire for GRIN devices has been the advent of Transformation Optics (TO), which provides the mathematical framework for representing the behavior of electromagnetic radiation in a given geometry by "transforming" it to an alternative, usually more desirable, geometry through an appropriate mapping of the constituent material parameters. Using TO, aspherical lenses can be transformed to simpler spherical and flat geometries or even rotationally-asymmetric shapes which result in true 3D GRIN profiles. Meanwhile, there is a critical lack of suitable design tools which can effectively evaluate the optical wave propagation through 3D GRIN profiles produced by TO. Current modeling software packages for optical lens systems also lack advanced multi-objective global optimization capability which allows the user to explicitly view the trade-offs between all design objectives such as focus quality, FOV, ▵nand focal drift due to chromatic aberrations. When coupled with advanced design methodologies such as TO, wavefront matching (WFM), and analytical achromatic GRIN theory, these tools provide a powerful framework for maximizing SWaP (Size, Weight and Power) reduction in GRIN-enabled optical systems. We provide an overview of our advanced GRIN design tools and examples which minimize the presence of mono- and polychromatic aberrations in the context of reducing SWaP.
Foxall, Gordon R; Oliveira-Castro, Jorge M; Schrezenmaier, Teresa C
2004-06-30
Purchasers of fast-moving consumer goods generally exhibit multi-brand choice, selecting apparently randomly among a small subset or "repertoire" of tried and trusted brands. Their behavior shows both matching and maximization, though it is not clear just what the majority of buyers are maximizing. Each brand attracts, however, a small percentage of consumers who are 100%-loyal to it during the period of observation. Some of these are exclusively buyers of premium-priced brands who are presumably maximizing informational reinforcement because their demand for the brand is relatively price-insensitive or inelastic. Others buy exclusively the cheapest brands available and can be assumed to maximize utilitarian reinforcement since their behavior is particularly price-sensitive or elastic. Between them are the majority of consumers whose multi-brand buying takes the form of selecting a mixture of economy -- and premium-priced brands. Based on the analysis of buying patterns of 80 consumers for 9 product categories, the paper examines the continuum of consumers so defined and seeks to relate their buying behavior to the question of how and what consumers maximize.
Approximating Graphic TSP by Matchings
Mömke, Tobias
2011-01-01
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
Oflazer, K
1996-01-01
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. The algorithm has been implemented on SparcStations, and for large randomly generated synthetic tree databases (some having tens of thousands of trees) it can associatively search for trees with a small error, in a matter of tenths of a second to few seconds.
Memristor-based pattern matching
Klimo, Martin; Such, Ondrej; Skvarek, Ondrej; Fratrik, Milan
2014-10-01
Pattern matching is a machine learning area that requires high-performance hardware. It has been hypothesized that massively parallel designs, which avoid von Neumann architecture, could provide a significant performance boost. Such designs can advantageously use memristive switches. This paper discusses a two-stage design that implements the induced ordered weighted average (IOWA) method for pattern matching. We outline the circuit structure and discuss how a functioning circuit can be achieved using metal oxide devices. We describe our simulations of memristive circuits and illustrate their performance on a vowel classification task.
Rethinking the Match: A Proposal for Modern Match-Making.
Ray, Chris; Bishop, Steven E; Dow, Alan W
2017-06-27
Since the 1950s, the National Resident Matching Program, or "the Match," has governed the placement of medical students into residencies. The Match was created to protect students in an era when residency positions outnumbered applicants and hospitals pressured students early in their academic careers to commit to a residency position. Now, however, applicants outnumber positions, applicants are applying to increasing numbers of programs, and the costs of the Match for applicants and programs are high. Meanwhile, medical education is evolving toward a competency-based approach, a U.S. physician shortage is predicted, and some researchers describe a "July effect"-worse clinical outcomes correlated with the mass entry of new residents.Against this background, the authors argue for adopting a more modern, free-market approach to residency match-making that might better suit the needs of applicants, programs, and the public. They propose allowing students who have been identified by their medical schools as having achieved graduation-level competency to apply to residency programs at any point during the year. Residency programs would set their own application timetables and extend offers in an ongoing fashion. Students, counseled by their schools, would accept or decline offers as desired. The authors argue this approach would better support competency-based education while allowing applicants and programs more choice regarding how they engage and adapt within the selection process. The approach's staggered start times for new residents might attenuate the July effect and improve outcomes for patients. Medical students might also enter and thereby complete residency earlier, increasing the physician workforce.
Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution
Borgs, Christian; Chayes, Jennifer; Lucier, Brendan
2012-01-01
Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so that the expected size of the resulting cascade is maximized, under the standard independent cascade model of network diffusion. Our main result is an algorithm for the influence maximization problem that obtains the near-optimal approximation factor of (1 - 1/e - epsilon), for any epsilon > 0, in time O((m+n)log(n) / epsilon^3) where n and m are the number of vertices and edges in the network. Our algorithm is nearly runtime-optimal (up to a logarithmic factor) as we establish a lower bound of Omega(m+n) on the runtime required to obtain a constant approximation. Our method also allows a provable tradeoff between solution quality and runtime: we obtain an O(1/beta)-approximation in time O(n log^3(n) * a(G) / beta) for any beta > 1, where a(G) denotes the arboricity of the d...
A New Algorithm to Optimize Maximal Information Coefficient.
Yuan Chen
Full Text Available The maximal information coefficient (MIC captures dependences between paired variables, including both functional and non-functional relationships. In this paper, we develop a new method, ChiMIC, to calculate the MIC values. The ChiMIC algorithm uses the chi-square test to terminate grid optimization and then removes the restriction of maximal grid size limitation of original ApproxMaxMI algorithm. Computational experiments show that ChiMIC algorithm can maintain same MIC values for noiseless functional relationships, but gives much smaller MIC values for independent variables. For noise functional relationship, the ChiMIC algorithm can reach the optimal partition much faster. Furthermore, the MCN values based on MIC calculated by ChiMIC can capture the complexity of functional relationships in a better way, and the statistical powers of MIC calculated by ChiMIC are higher than those calculated by ApproxMaxMI. Moreover, the computational costs of ChiMIC are much less than those of ApproxMaxMI. We apply the MIC values tofeature selection and obtain better classification accuracy using features selected by the MIC values from ChiMIC.
Marshall, Wallace F.
2015-01-01
All of the same conceptual questions about size in organisms apply equally at the level of single cells. What determines the size, not only of the whole cell, but of all of its parts? What ensures that subcellular components are properly proportioned relative to the whole cell? How does alteration in organelle size affect biochemical function? Answering such fundamental questions requires us to understand how the size of individual organelles and other cellular structures is determined. Knowledge of organelle biogenesis and dynamics has advanced rapidly in recent years. Does this knowledge give us enough information to formulate reasonable models for organelle size control, or are we still missing something? PMID:25957302
Relaxation matching algorithm for moving photogrammetry
Guo, Lei; Liu, Ke; Miao, Yinxiao; Zhu, Jigui
2015-02-01
Moving photogrammetry is an application of close range photogrammetry in industrial measurement to realize threedimensional coordinate measurement within large-scale volume. This paper describes an approach of relaxation matching algorithm applicable to moving photogrammetry according to the characteristics of accurate matching result of different measuring images. This method uses neighborhood matching support to improve the matching rate after coarse matching based on epipolar geometry constraint and precise matching using three images. It reflects the overall matching effect of all points, that means when a point is matched correctly, the matching results of those points round it must be correct. So for one point considered, the matching results of points round it are calculated to judge whether its result is correct. Analysis indicates that relaxation matching can eliminate the mismatching effectively and acquire 100% rate of correct matching. It will play a very important role in moving photogrammetry to ensure the following implement of ray bundle adjustment.
An Efficient Parallel Graph Edge Matching Algorithm and Its Applications
MA Jun; MA Shaohan
1999-01-01
A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graph G(V,E) is proposed. It runs inO (log n) time with O (m/log n+n) processors on an EREW PRAM for aclass of graph set Π, where n=|V|,m=|E| and Π includesat least (i) planar graphs;(ii) graphs of bounded genus; and (iii)graphs of bounded maximum degree and so on. Our algorithm improves thepreviously known best algorithms by a factor of logn in the timecomplexity with linear number of processors on EREW PRAMs when the inputis limited to Π.
Algorithms for k-Colouring and Finding Maximal Independent Sets
Byskov, Jesper Makholm
2003-01-01
In this extended abstract, we construct algorithms that decide for a graph with n vertices whether there exists a 4-, 5- or 6-colouring of the vertices running in time O(1.7504n), O(2.1592 n) and O(2.3289n), respectively, using polynomial space. For 6- or 7-colouring we construct algorithms running...... in time (9(2.2680 n) and O(2.4023n), respectively, using exponential space. To do this, we prove that the number of maximal independent sets of size at most k (k-MIS's) in a graph is at most (d -1)dk - n am-(d -1)k for any d > 4. Eppstein shows the same bound for d = 4....
Maximizing sparse matrix vector product performance in MIMD computers
McLay, R.T.; Kohli, H.S.; Swift, S.L.; Carey, G.F.
1994-12-31
A considerable component of the computational effort involved in conjugate gradient solution of structured sparse matrix systems is expended during the Matrix-Vector Product (MVP), and hence it is the focus of most efforts at improving performance. Such efforts are hindered on MIMD machines due to constraints on memory, cache and speed of memory-cpu data transfer. This paper describes a strategy for maximizing the performance of the local computations associated with the MVP. The method focuses on single stride memory access, and the efficient use of cache by pre-loading it with data that is re-used while bypassing it for other data. The algorithm is designed to behave optimally for varying grid sizes and number of unknowns per gridpoint. Results from an assembly language implementation of the strategy on the iPSC/860 show a significant improvement over the performance using FORTRAN.
The performance of modularity maximization in practical contexts
Good, Benjamin H; Clauset, Aaron
2009-01-01
Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood. Here, we present a broad and systematic characterization of its performance in practical situations. First, we generalize and clarify the recently identified resolution limit phenomenon. Second, we show that the modularity function Q exhibits extreme degeneracies: that is, the modularity landscape admits an exponential number of distinct high-scoring solutions and does not typically exhibit a clear global maximum. Third, we derive the limiting behavior of the maximum modularity Q_max for infinitely modular networks, showing that it depends strongly on the size of the network and the number of module-like subgraphs it contains. Finally, using three real-world examples of metabolic networks, we show that the degenerate solutions can fundamentally disagree on the composition of even the largest modules. Together, these results significantly extend and c...
Postactivation Potentiation Biases Maximal Isometric Strength Assessment
Leonardo Coelho Rabello Lima
2014-01-01
Full Text Available Postactivation potentiation (PAP is known to enhance force production. Maximal isometric strength assessment protocols usually consist of two or more maximal voluntary isometric contractions (MVCs. The objective of this study was to determine if PAP would influence isometric strength assessment. Healthy male volunteers (n=23 performed two five-second MVCs separated by a 180-seconds interval. Changes in isometric peak torque (IPT, time to achieve it (tPTI, contractile impulse (CI, root mean square of the electromyographic signal during PTI (RMS, and rate of torque development (RTD, in different intervals, were measured. Significant increases in IPT (240.6 ± 55.7 N·m versus 248.9 ± 55.1 N·m, RTD (746 ± 152 N·m·s−1versus 727 ± 158 N·m·s−1, and RMS (59.1 ± 12.2% RMSMAX versus 54.8 ± 9.4% RMSMAX were found on the second MVC. tPTI decreased significantly on the second MVC (2373 ± 1200 ms versus 2784 ± 1226 ms. We conclude that a first MVC leads to PAP that elicits significant enhancements in strength-related variables of a second MVC performed 180 seconds later. If disconsidered, this phenomenon might bias maximal isometric strength assessment, overestimating some of these variables.
Gallo-Salazar, Cesar; Del Coso, Juan; Barbado, David; Lopez-Valenciano, Alejandro; Santos-Rosa, Francisco Javier; Sanz-Rivas, David; Moya, Manuel; Fernandez-Fernandez, Jaime
2017-07-01
The purpose of this study was to analyze the effects of playing 2 tennis matches on the same day on physical performance in young tennis players. Twelve well-trained young tennis players took part in a simulated tennis competition consisting of 2 tennis matches on the same day (morning and afternoon sessions). Before and the day after the competition, physical performance was measured using a battery of countermovement jumps; a 10 m sprint; the 5-0-5 agility test; hip, grip and shoulder maximal isometric strength; shoulder range of motion; and a serve velocity test. Postcompetition results showed reduced performance in 10 m (-3.3%, effect size (ES) = small), dominant and nondominant 5-0-5 agility test (-4.6%, ES = moderate; -4.2%, ES = moderate, respectively), bilateral (-5.2%, ES = small), and unilateral countermovement jumps (dominant leg: -7.2%, ES = small; non-dominant leg: -9.1%, ES = small). Both dominant and nondominant shoulder external rotation range of motion increased (12.2%, ES = moderate; 5.6%, ES = small), whereas internal rotation decreased (-4.2%, ES = small; -3.3%, ES = small) in the postcompetition tests, together with the dominant shoulder external rotation (-10.7%, ES = moderate) and internal rotation (-9.3%, ES = small) strength. Physical impairments occurred in neuromuscular performance variables involving lower (e.g., jumping, sprinting, and change of direction) and upper (e.g., isometric strength and range of motion) limbs the day after playing a competition with 2 consecutive matches on the same day. These alterations in neuromuscular and sport-specific performance need to be taken into consideration when planning tournament schedules for young tennis players, as well as preparing match and recovery strategies.
Maximizing versus satisficing: happiness is a matter of choice.
Schwartz, Barry; Ward, Andrew; Monterosso, John; Lyubomirsky, Sonja; White, Katherine; Lehman, Darrin R
2002-11-01
Can people feel worse off as the options they face increase? The present studies suggest that some people--maximizers--can. Study 1 reported a Maximization Scale, which measures individual differences in desire to maximize. Seven samples revealed negative correlations between maximization and happiness, optimism, self-esteem, and life satisfaction, and positive correlations between maximization and depression, perfectionism, and regret. Study 2 found maximizers less satisfied than nonmaximizers (satisficers) with consumer decisions, and more likely to engage in social comparison. Study 3 found maximizers more adversely affected by upward social comparison. Study 4 found maximizers more sensitive to regret and less satisfied in an ultimatum bargaining game. The interaction between maximizing and choice is discussed in terms of regret, adaptation, and self-blame.
Matchings with Externalities and Attitudes
Branzei, Simina; Michalak, Tomasz; Rahwan, Talal;
2013-01-01
Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real-life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas ...
Fuzzy private matching (extended abstract)
Chmielewski, L.; Hoepman, J.H.
2008-01-01
In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain
An Implementation of Bigraph Matching
Glenstrup, Arne John; Damgaard, Troels Christoffer; Birkedal, Lars
We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model...
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...... on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing...
ON THE SPACES OF THE MAXIMAL POINTS
梁基华; 刘应明
2003-01-01
For a continuous domain D, some characterization that the convex powerdomain CD is adomain hull of Max(CD) is given in terms of compact subsets of D. And in this case, it isproved that the set of the maximal points Max(CD) of CD with the relative Scott topology ishomeomorphic to the set of all Scott compact subsets of Max(D) with the topology induced bythe Hausdorff metric derived from a metric on Max(D) when Max(D) is metrizable.
Understanding of English Contracts though Relation Maxims
XU Chi-ying; JIANG Li-hui
2013-01-01
Contract is the legal evidence of the concerning parties of business. And this lead to its unique characteristics:technical terms, archaism, borrowed words, juxtaposition, and abbreviation. The understanding of contracts is of vital importance for each party, because it concerns the share of interests. In order to avoid ambiguity that some words or sentence in English contracts may lead to, and achieve“best relevance and least effort”of communication, this paper, by applying relation maxim, deeply analyze how to understand English contracts though selection of words, modification, the complexity and simplicity of sentence.
Maximizing results in reconstruction of cheek defects.
Mureau, Marc A M; Hofer, Stefan O P
2009-07-01
The face is exceedingly important, as it is the medium through which individuals interact with the rest of society. Reconstruction of cheek defects after trauma or surgery is a continuing challenge for surgeons who wish to reliably restore facial function and appearance. Important in aesthetic facial reconstruction are the aesthetic unit principles, by which the face can be divided in central facial units (nose, lips, eyelids) and peripheral facial units (cheeks, forehead, chin). This article summarizes established options for reconstruction of cheek defects and provides an overview of several modifications as well as tips and tricks to avoid complications and maximize aesthetic results.
Maximizing policy learning in international committees
Nedergaard, Peter
2007-01-01
, this article demonstrates that valuable lessons can be learned about policy learning, in practice and theoretically, by analysing the cooperation in the OMC committees. Using the Advocacy Coalition Framework as the starting point of analysis, 15 hypotheses on policy learning are tested. Among other things......, it is concluded that in order to maximize policy learning in international committees, empirical data should be made available to committees and provided by sources close to the participants (i.e. the Commission). In addition, the work in the committees should be made prestigious in order to attract well...
Analysis of matches and partial-matches in a Danish STR data set
Tvedebrink, Torben; Eriksen, Poul Svante; Curan, James Michael;
2012-01-01
Over the recent years, the national databases of STR profiles have grown in size due to the success of forensic DNA analysis in solving crimes. The accumulation of DNA profiles implies that the probability of a random match or near match of two randomly selected DNA profiles in the database...... increases. We analysed 53,295 STR profiles from individuals investigated in relation to crime case investigations at the Department of Forensic Medicine, Faculty of Health Sciences, University of Copenhagen, Denmark. Incomplete STR profiles (437 circa 0.8% of the total), 48 redundant STR profiles from...... other, i.e. 1.3 × 109 comparisons. With these large number of comparisons, it is likely to observe DNA profiles that coincide on many loci, which has concerned some commentators and raised questions about “overstating” the power of DNA evidence. We used the method of Weir [11] and [12] and Curran et al...
Shadow Areas Robust Matching Among Image Sequence in Planetary Landing
Ruoyan, Wei; Xiaogang, Ruan; Naigong, Yu; Xiaoqing, Zhu; Jia, Lin
2017-01-01
In this paper, an approach for robust matching shadow areas in autonomous visual navigation and planetary landing is proposed. The approach begins with detecting shadow areas, which are extracted by Maximally Stable Extremal Regions (MSER). Then, an affine normalization algorithm is applied to normalize the areas. Thirdly, a descriptor called Multiple Angles-SIFT (MA-SIFT) that coming from SIFT is proposed, the descriptor can extract more features of an area. Finally, for eliminating the influence of outliers, a method of improved RANSAC based on Skinner Operation Condition is proposed to extract inliers. At last, series of experiments are conducted to test the performance of the approach this paper proposed, the results show that the approach can maintain the matching accuracy at a high level even the differences among the images are obvious with no attitude measurements supplied.
Conformal couplings and "azimuthal matching" of QCD Pomerons
Marchal, N
2000-01-01
Using the asymptotic conformal invariance of perturbative QCD we derive the expression of the coupling of external states to all conformal spin-p components of the forward elastic amplitude. Using the wave-function formalism for structure functions at small x, we derive the perturbative coupling of the virtual photon for p= 1, which is maximal for linear transverse polarization. The non-perturbative coupling to the proton is discussed in terms of ``azimuthal matching'' between the proton color dipoles and the quark- antiquark configurations of the photon. As an application, the recent conjecture of a second QCD Pomeron related to the conformal spin-1 component is shown to rely upon a strong azimuthal matching of the p= 1 component in gamma* -proton scattering.
A zero-one programming approach to Gulliksen's matched random subtests method
van der Linden, Willem J.; Boekkooi-Timminga, Ellen
1986-01-01
In order to estimate the classical coefficient of test reliability, parallel measurements are needed. H. Gulliksen's matched random subtests method, which is a graphical method for splitting a test into parallel test halves, has practical relevance because it maximizes the alpha coefficient as a low
A zero-one programming approach to Gulliksen's matched random subtests method
Linden, van der Wim J.; Boekkooi-Timminga, Ellen
1988-01-01
Gulliksen’s matched random subtests method is a graphical method to split a test into parallel test halves. The method has practical relevance because it maximizes coefficient α as a lower bound to the classical test reliability coefficient. In this paper the same problem is formulated as a zero-one
The rate of lactate removal after maximal exercise: the effect of intensity during active recovery.
Riganas, C S; Papadopoulou, Z; Psichas, N; Skoufas, D; Gissis, I; Sampanis, M; Paschalis, V; Vrabas, I S
2015-10-01
The aim of the present investigation was to determine the greater rate of lactate removal after a maximal rowing test using different intensities during active recovery. Thirty elite male rowers performed a simulated incremental exercise protocol on rowing ergometer to determine their maximal oxygen uptake and they divided into three equal sized group according to the type of the recovery that followed the assessment. The first group (N.=10) subjected to 20 min of passive recovery, while the second (N.=10) and the third (N.=10) groups performed 20 min of active recovery using the 25% and the 50% of each individual’s maximal power output, respectively. During the recovery period, every two min were performed measurements for the assessment of blood lactate, oxygen consumption and heart rate (HR). It was found that after 10 min of active recovery at 50% and 25% of maximal power output lactate concentration reduced by 43% and 15%, respectively, while during passive recovery lactate concentration found to be slightly elevated by 1%. It was also found that during recovery period, HR, oxygen consumption and pulmonary ventilation was significant elevated at higher exercise intensity compared to lower exercise intensity and passive recovery. It is concluded that in elite male rowers the active recovery provided higher rate of lactate removal compared to passive recovery. Moreover, active recovery at 50% of maximal power output had better results in lactate clearance compared to the active recovery of lower intensity (25% of maximal power output).
Maximal subbundles, quot schemes, and curve counting
Gillam, W D
2011-01-01
Let $E$ be a rank 2, degree $d$ vector bundle over a genus $g$ curve $C$. The loci of stable pairs on $E$ in class $2[C]$ fixed by the scaling action are expressed as products of $\\Quot$ schemes. Using virtual localization, the stable pairs invariants of $E$ are related to the virtual intersection theory of $\\Quot E$. The latter theory is extensively discussed for an $E$ of arbitrary rank; the tautological ring of $\\Quot E$ is defined and is computed on the locus parameterizing rank one subsheaves. In case $E$ has rank 2, $d$ and $g$ have opposite parity, and $E$ is sufficiently generic, it is known that $E$ has exactly $2^g$ line subbundles of maximal degree. Doubling the zero section along such a subbundle gives a curve in the total space of $E$ in class $2[C]$. We relate this count of maximal subbundles with stable pairs/Donaldson-Thomas theory on the total space of $E$. This endows the residue invariants of $E$ with enumerative significance: they actually \\emph{count} curves in $E$.
Maximal coherence in a generic basis
Yao, Yao; Dong, G. H.; Ge, Li; Li, Mo; Sun, C. P.
2016-12-01
Since quantum coherence is an undoubted characteristic trait of quantum physics, the quantification and application of quantum coherence has been one of the long-standing central topics in quantum information science. Within the framework of a resource theory of quantum coherence proposed recently, a fiducial basis should be preselected for characterizing the quantum coherence in specific circumstances, namely, the quantum coherence is a basis-dependent quantity. Therefore, a natural question is raised: what are the maximum and minimum coherences contained in a certain quantum state with respect to a generic basis? While the minimum case is trivial, it is not so intuitive to verify in which basis the quantum coherence is maximal. Based on the coherence measure of relative entropy, we indicate the particular basis in which the quantum coherence is maximal for a given state, where the Fourier matrix (or more generally, complex Hadamard matrices) plays a critical role in determining the basis. Intriguingly, though we can prove that the basis associated with the Fourier matrix is a stationary point for optimizing the l1 norm of coherence, numerical simulation shows that it is not a global optimal choice.
Jurisdiction Size and Local Democracy
Lassen, David Dreyer; Serritslew, Søren
2011-01-01
Optimal jurisdiction size is a cornerstone of government design. A strong tradition in political thought argues that democracy thrives in smaller jurisdictions, but existing studies of the effects of jurisdiction size, mostly cross-sectional in nature, yield ambiguous results due to sorting effects...... and problems of endogeneity. We focus on internal political efficacy, a psychological condition that many see as necessary for high-quality participatory democracy. We identify a quasiexperiment, a large-scale municipal reform in Denmark, which allows us to estimate a causal effect of jurisdiction size......-in-difference and matching estimators, that jurisdiction size has a causal and sizeable detrimental effect on citizens' internal political efficacy....
On the use of INS to improve Feature Matching
Masiero, A.; Guarnieri, A.; Vettore, A.; Pirotti, F.
2014-11-01
The continuous technological improvement of mobile devices opens the frontiers of Mobile Mapping systems to very compact systems, i.e. a smartphone or a tablet. This motivates the development of efficient 3D reconstruction techniques based on the sensors typically embedded in such devices, i.e. imaging sensors, GPS and Inertial Navigation System (INS). Such methods usually exploits photogrammetry techniques (structure from motion) to provide an estimation of the geometry of the scene. Actually, 3D reconstruction techniques (e.g. structure from motion) rely on use of features properly matched in different images to compute the 3D positions of objects by means of triangulation. Hence, correct feature matching is of fundamental importance to ensure good quality 3D reconstructions. Matching methods are based on the appearance of features, that can change as a consequence of variations of camera position and orientation, and environment illumination. For this reason, several methods have been developed in recent years in order to provide feature descriptors robust (ideally invariant) to such variations, e.g. Scale-Invariant Feature Transform (SIFT), Affine SIFT, Hessian affine and Harris affine detectors, Maximally Stable Extremal Regions (MSER). This work deals with the integration of information provided by the INS in the feature matching procedure: a previously developed navigation algorithm is used to constantly estimate the device position and orientation. Then, such information is exploited to estimate the transformation of feature regions between two camera views. This allows to compare regions from different images but associated to the same feature as seen by the same point of view, hence significantly easing the comparison of feature characteristics and, consequently, improving matching. SIFT-like descriptors are used in order to ensure good matching results in presence of illumination variations and to compensate the approximations related to the estimation
Weyland, Mathias; Fellermann, Harold; Hadorn, Maik
2013-01-01
In this paper, we propose the MATCHIT Automaton (MA), a theoretical framework that shows how to improve the yield of the synthesis of chemical polymer reactions. This is achieved by separating sub-steps of the path of syn- thesis into compartments. We use chemical containers (chemtainers) to carr...... reticulum and the Golgi apparatus, and we show how this compartmentalization can be exploited for the synthesis of branched polymers. Lastly, we show exam- ples of artificial branched polymers and discuss how the MA can be configured to synthesize them with maximal yield....
Hahn, D; Bakenecker, P; Zinke, F
2016-12-28
Torque production during maximal voluntary explosive contractions is considered to be a functionally more relevant neuromuscular measure than steady-state torque, but little is known about accelerated concentric contractions. This study investigated torque, muscle activity, and fascicle behavior during isometric and fast concentric contractions of quadriceps femoris. Ten participants performed maximal voluntary explosive isometric, isovelocity, and additional concentric knee extensions at angular accelerations ranging from 700 to 4000° s(-2) that resulted in an angular velocity of 300° s(-1) at 40° knee flexion. Concentric torque at 40° knee flexion was corrected for inertia, and the corresponding isometric torque was matched to the time when the target knee angle of 40° was reached during concentric contractions. Electromyography of quadriceps femoris and hamstrings and ultrasound of vastus lateralis were measured to determine muscle activity, fascicle length, and fascicle velocity (FV). The faster the acceleration, the more torque was produced during concentric contractions at 40° knee flexion, which was accompanied by a reduction in FV. In comparison with isometric conditions, concentric quadriceps muscle activity was increased and torque during accelerations ≥3000° s(-2) equaled the time-matched isometric torque. Our results provide novel evidence that acceleration influences torque production during maximal voluntary explosive concentric contractions. This is suggested to be due to series elasticity and reduced force depression.
Matching of equivalent field regions
Appel-Hansen, Jørgen; Rengarajan, S.B.
2005-01-01
screen, having the same homogeneous medium on both sides and an impressed current on one aide, an alternative procedure is relevant. We make use of the fact that in the aperture the tangential component of the magnetic field due to the induced currents in the screen is zero. The use of such a procedure......In aperture problems, integral equations for equivalent currents are often found by enforcing matching of equivalent fields. The enforcement is made in the aperture surface region adjoining the two volumes on each side of the aperture. In the case of an aperture in a planar perfectly conducting...... shows that equivalent currents can be found by a consideration of only one of the two volumes into which the aperture plane divides the space. Furthermore, from a consideration of an automatic matching at the aperture, additional information about tangential as well as normal field components...
Impedance-matched Marx generators
W. A. Stygar
2017-04-01
Full Text Available We have conceived a new class of prime-power sources for pulsed-power accelerators: impedance-matched Marx generators (IMGs. The fundamental building block of an IMG is a brick, which consists of two capacitors connected electrically in series with a single switch. An IMG comprises a single stage or several stages distributed axially and connected in series. Each stage is powered by a single brick or several bricks distributed azimuthally within the stage and connected in parallel. The stages of a multistage IMG drive an impedance-matched coaxial transmission line with a conical center conductor. When the stages are triggered sequentially to launch a coherent traveling wave along the coaxial line, the IMG achieves electromagnetic-power amplification by triggered emission of radiation. Hence a multistage IMG is a pulsed-power analogue of a laser. To illustrate the IMG approach to prime power, we have developed conceptual designs of two ten-stage IMGs with LC time constants on the order of 100 ns. One design includes 20 bricks per stage, and delivers a peak electrical power of 1.05 TW to a matched-impedance 1.22-Ω load. The design generates 113 kV per stage and has a maximum energy efficiency of 89%. The other design includes a single brick per stage, delivers 68 GW to a matched-impedance 19-Ω load, generates 113 kV per stage, and has a maximum energy efficiency of 90%. For a given electrical-power-output time history, an IMG is less expensive and slightly more efficient than a linear transformer driver, since an IMG does not use ferromagnetic cores.
Template Matching on Parallel Architectures,
1985-07-01
memory. The processors run asynchronously. Thus according to Hynn’s categories the Butterfl . is a MIMD machine. The processors of the Butterfly are...Generalized Butterfly Architecture This section describes timings for pattern matching on the generalized Butterfl .. Ihe implementations on the Butterfly...these algorithms. Thus the best implementation of the techniques on the generalized Butterfl % are the same as the implementation on the real Butterfly
Monetary Exchange with Multilateral Matching
Julien, Benoît; Kennes, John; King, Ian
the results with Kiyotaki and Wright (1993), Trejos and Wright (1995), and Lagos and Wright (2005) respectively. We find that the multilateral matching setting generates very simple and intuitive equilibrium allocations that are similar to those in the other papers, but which have important differences....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....
Duplicate-based Schema Matching
Bilke, Alexander
2007-01-01
Die Integration unabhängig voneinander entwickelter Datenquellen stellt uns vor viele Probleme, die das Ergebnis verschiedener Arten von Heterogenität sind. Eine der größten Herausforderungen ist Schema Matching: der halb-automatische Prozess, in dem semantische Beziehungen zwischen Attributen in heterogenen Schemata erkannt werden. Verschiedene Lösungen, die Schemainformationen ausnutzen oder spezifische Eigenschaften aus Attributwerten extrahieren, wurden in der Literatur beschrieben. In di...
Spurring Innovation with Matching Grants
2015-01-01
Matching grants are one of the most common tools used in private sector development programs in developing countries and have been included in more than 60 World Bank projects totaling over US$1.2 billion, funding over 100,000 micro, small and medium enterprises. The Enterprise Revitalization and Employment Pilot (EREP) was designed as a two year pilot project aimed at improving firm capab...
Matching Games with Additive Externalities
Branzei, Simina; Michalak, Tomasz; Rahwan, Talal
2012-01-01
Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas......, optimistic, and pessimistic behaviour, and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes....
Ribeiro, Flavio F; Qin, Jian G
2013-01-01
This study quantified size-dependent cannibalism in barramundi Lates calcarifer through coupling a range of prey-predator pairs in a different range of fish sizes. Predictive models were developed using morphological traits with the alterative assumption of cannibalistic polyphenism. Predictive models were validated with the data from trials where cannibals were challenged with progressing increments of prey sizes. The experimental observations showed that cannibals of 25-131 mm total length could ingest the conspecific prey of 78-72% cannibal length. In the validation test, all predictive models underestimate the maximum ingestible prey size for cannibals of a similar size range. However, the model based on the maximal mouth width at opening closely matched the empirical observations, suggesting a certain degree of phenotypic plasticity of mouth size among cannibalistic individuals. Mouth size showed allometric growth comparing with body depth, resulting in a decreasing trend on the maximum size of ingestible prey as cannibals grow larger, which in parts explains why cannibalism in barramundi is frequently observed in the early developmental stage. Any barramundi has the potential to become a cannibal when the initial prey size was cannibal body length, but fish could never become a cannibal when prey were >58% of their size, suggesting that 50% of size difference can be the threshold to initiate intracohort cannibalism in a barramundi population. Cannibalistic polyphenism was likely to occur in barramundi that had a cannibalistic history. An experienced cannibal would have a greater ability to stretch its mouth size to capture a much larger prey than the models predict. The awareness of cannibalistic polyphenism has important application in fish farming management to reduce cannibalism.
Flavio F Ribeiro
Full Text Available This study quantified size-dependent cannibalism in barramundi Lates calcarifer through coupling a range of prey-predator pairs in a different range of fish sizes. Predictive models were developed using morphological traits with the alterative assumption of cannibalistic polyphenism. Predictive models were validated with the data from trials where cannibals were challenged with progressing increments of prey sizes. The experimental observations showed that cannibals of 25-131 mm total length could ingest the conspecific prey of 78-72% cannibal length. In the validation test, all predictive models underestimate the maximum ingestible prey size for cannibals of a similar size range. However, the model based on the maximal mouth width at opening closely matched the empirical observations, suggesting a certain degree of phenotypic plasticity of mouth size among cannibalistic individuals. Mouth size showed allometric growth comparing with body depth, resulting in a decreasing trend on the maximum size of ingestible prey as cannibals grow larger, which in parts explains why cannibalism in barramundi is frequently observed in the early developmental stage. Any barramundi has the potential to become a cannibal when the initial prey size was 58% of their size, suggesting that 50% of size difference can be the threshold to initiate intracohort cannibalism in a barramundi population. Cannibalistic polyphenism was likely to occur in barramundi that had a cannibalistic history. An experienced cannibal would have a greater ability to stretch its mouth size to capture a much larger prey than the models predict. The awareness of cannibalistic polyphenism has important application in fish farming management to reduce cannibalism.
Edge-Matching Problems with Rotations
Ebbesen, Martin; Fischer, Paul; Witt, Carsten
2011-01-01
Edge-matching problems, also called puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II...... puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so...... far. We show that some problems have polynomial time algorithms while others are NP-complete. Especially we show that allowing rotations in one-row puzzles makes the problem NP-hard. We moreover show that many commonly considered puzzles can be emulated by simple puzzles with quadratic pieces, so...
On String Matching with Mismatches
Marius Nicolae
2015-05-01
Full Text Available In this paper, we consider several variants of the pattern matching with mismatches problem. In particular, given a text \\(T=t_1 t_2\\cdots t_n\\ and a pattern \\(P=p_1p_2\\cdots p_m\\, we investigate the following problems: (1 pattern matching with mismatches: for every \\(i, 1\\leq i \\leq n-m+1\\ output, the distance between \\(P\\ and \\(t_i t_{i+1}\\cdots t_{i+m-1}\\; and (2 pattern matching with \\(k\\ mismatches: output those positions \\(i\\ where the distance between \\(P\\ and \\(t_i t_{i+1}\\cdots t_{i+m-1}\\ is less than a given threshold \\(k\\. The distance metric used is the Hamming distance. We present some novel algorithms and techniques for solving these problems. We offer deterministic, randomized and approximation algorithms. We consider variants of these problems where there could be wild cards in either the text or the pattern or both. We also present an experimental evaluation of these algorithms. The source code is available at http://www.engr.uconn.edu/\\(\\sim\\man09004/kmis.zip.
Incremental pattern matching for regular expressions
Jalali, Arash; Ghamarian, Amir Hossein; Rensink, Arend; Fish, Andrew; Lambers, Leen
2012-01-01
Graph pattern matching lies at the heart of any graph transformation-based system. Incremental pattern matching is one approach proposed for reducingthe overall cost of pattern matching over successive transformations by preserving the matches that stay relevant after a rule application. An importan
32 CFR 806b.50 - Computer matching.
2010-07-01
... 32 National Defense 6 2010-07-01 2010-07-01 false Computer matching. 806b.50 Section 806b.50... PROGRAM Disclosing Records to Third Parties § 806b.50 Computer matching. Computer matching programs... on forms used in applying for benefits. Coordinate computer matching statements on forms with...
Maximal lattice free bodies, test sets and the Frobenius problem
Jensen, Anders Nedergaard; Lauritzen, Niels; Roune, Bjarke Hammersholt
Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for computing the maximal lattice free bodies of an integral...... method is inspired by the novel algorithm by Einstein, Lichtblau, Strzebonski and Wagon and the Groebner basis approach by Roune....
Maximizing scientific knowledge from randomized clinical trials
Gustafsson, Finn; Atar, Dan; Pitt, Bertram;
2010-01-01
Trialists have an ethical and financial responsibility to plan and conduct clinical trials in a manner that will maximize the scientific knowledge gained from the trial. However, the amount of scientific information generated by randomized clinical trials in cardiovascular medicine is highly...... variable. Generation of trial databases and/or biobanks originating in large randomized clinical trials has successfully increased the knowledge obtained from those trials. At the 10th Cardiovascular Trialist Workshop, possibilities and pitfalls in designing and accessing clinical trial databases were......, in particular with respect to collaboration with the trial sponsor and to analytic pitfalls. The advantages of creating screening databases in conjunction with a given clinical trial are described; and finally, the potential for posttrial database studies to become a platform for training young scientists...
Characterizing maximally singular phase-space distributions
Sperling, J.
2016-07-01
Phase-space distributions are widely applied in quantum optics to access the nonclassical features of radiations fields. In particular, the inability to interpret the Glauber-Sudarshan distribution in terms of a classical probability density is the fundamental benchmark for quantum light. However, this phase-space distribution cannot be directly reconstructed for arbitrary states, because of its singular behavior. In this work, we perform a characterization of the Glauber-Sudarshan representation in terms of distribution theory. We address important features of such distributions: (i) the maximal degree of their singularities is studied, (ii) the ambiguity of representation is shown, and (iii) their dual space for nonclassicality tests is specified. In this view, we reconsider the methods for regularizing the Glauber-Sudarshan distribution for verifying its nonclassicality. This treatment is supported with comprehensive examples and counterexamples.
Maximization of eigenvalues using topology optimization
Pedersen, Niels Leergaard
2000-01-01
Topology optimization is used to optimize the eigenvalues of plates. The results are intended especially for MicroElectroMechanical Systems (MEMS) but call be seen as more general. The problem is not formulated as a case of reinforcement of an existing structure, so there is a problem related...... to localized modes in low density areas. The topology optimization problem is formulated using the SIMP method. Special attention is paid to a numerical method for removing localized eigenmodes in low density areas. The method is applied to numerical examples of maximizing the first eigenfrequency, One example...... is a practical MEMS application; a probe used in an Atomic Force Microscope (AFM). For the AFM probe the optimization is complicated by a constraint on the stiffness and constraints on higher order eigenvalues....
Reflection Quasilattices and the Maximal Quasilattice
Boyle, Latham
2016-01-01
We introduce the concept of a {\\it reflection quasilattice}, the quasiperiodic generalization of a Bravais lattice with irreducible reflection symmetry. Among their applications, reflection quasilattices are the reciprocal (i.e. Bragg diffraction) lattices for quasicrystals and quasicrystal tilings, such as Penrose tilings, with irreducible reflection symmetry and discrete scale invariance. In a follow-up paper, we will show that reflection quasilattices can be used to generate tilings in real space with properties analogous to those in Penrose tilings, but with different symmetries and in various dimensions. Here we prove that reflection quasilattices only exist in dimensions two, three and four, and we prove that there is a unique reflection quasilattice in dimension four: the "maximal reflection quasilattice" in terms of dimensionality and symmetry. We further show that, unlike crystallographic Bravais lattices, all reflection quasilattices are invariant under rescaling by certain discrete scale factors. W...
Distributed Maximality based CTL Model Checking
Djamel Eddine Saidouni
2010-05-01
Full Text Available In this paper we investigate an approach to perform a distributed CTL Model checker algorithm on a network of workstations using Kleen three value logic, the state spaces is partitioned among the network nodes, We represent the incomplete state spaces as a Maximality labeled Transition System MLTS which are able to express true concurrency. we execute in parallel the same algorithm in each node, for a certain property on an incomplete MLTS , this last compute the set of states which satisfy or which if they fail are assigned the value .The third value mean unknown whether true or false because the partial state space lacks sufficient information needed for a precise answer concerning the complete state space .To solve this problem each node exchange the information needed to conclude the result about the complete state space. The experimental version of the algorithm is currently being implemented using the functional programming language Erlang.
Evolution of correlated multiplexity through stability maximization
Dwivedi, Sanjiv K
2016-01-01
Investigating relation between various structural patterns found in real-world networks and stability of underlying systems is crucial to understand importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising of anti-symmetric couplings in one layer, depicting predator-prey relation, and symmetric couplings in the other, depicting mutualistic (or competitive) relation, based on stability maximization through the largest eigenvalue. We find that the correlated multiplexity emerges as evolution progresses. The evolved values of the correlated multiplexity exhibit a dependence on the inter-link coupling strength. Furthermore, the inter-layer coupling strength governs the evolution of disassortativity property in the individual layers. We provide analytical understanding to these findings by considering star like networks in both the layers. The model and tools used here are useful for understanding the principles governing the stability as well as importance of such patterns in ...
Witten spinors on maximal, conformally flat hypersurfaces
Frauendiener, Jörg; Szabados, László B
2011-01-01
The boundary conditions that exclude zeros of the solutions of the Witten equation (and hence guarantee the existence of a 3-frame satisfying the so-called special orthonormal frame gauge conditions) are investigated. We determine the general form of the conformally invariant boundary conditions for the Witten equation, and find the boundary conditions that characterize the constant and the conformally constant spinor fields among the solutions of the Witten equations on compact domains in extrinsically and intrinsically flat, and on maximal, intrinsically globally conformally flat spacelike hypersurfaces, respectively. We also provide a number of exact solutions of the Witten equation with various boundary conditions (both at infinity and on inner or outer boundaries) that single out nowhere vanishing spinor fields on the flat, non-extreme Reissner--Nordstr\\"om and Brill--Lindquist data sets. Our examples show that there is an interplay between the boundary conditions, the global topology of the hypersurface...
Greedy Maximal Scheduling in Wireless Networks
Li, Qiao
2010-01-01
In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.
Dispatch Scheduling to Maximize Exoplanet Detection
Johnson, Samson; McCrady, Nate; MINERVA
2016-01-01
MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.
A New Biflavone from Selaginella pulvinata Maxim
XU Kang-Ping; XU Zhi; DENG Yin-Hua; LI Fu-Shuang; ZHOU Ying-Jun; HU Gao-Yun; TAN Gui-Shan
2003-01-01
@@ Selaginella pulvinata Maxim. distributes all over the country of China and is used for the treatment for haemor rhage. [1] We studied on the chemical constituents of S. pulvinata in order to find the active compounds. Dried stems and leaves of S. pulvinata (6.5 kg) were extracted with 70% ethanol twice. The extract was evaporated under vacuum and than suspended in water, extracted with petroleum and EtOAc sequentially. The EtOAc extract was chromatographed on silica gel, eluted with CHCl3-MeOH. As a result, a novel biflavone, named pulvinatabiflavone, was obtained from fractions 75 ～ 78. Its structure was determined on the basis of spectroscopic analysis as 5,5″, 4′″ trihydroxy-7,7″-dimethoxy-[4′-O-6″]-biflavone (compound 1).
Maximal energy extraction under discrete diffusive exchange
Hay, M. J., E-mail: hay@princeton.edu [Department of Astrophysical Sciences, Princeton University, Princeton, New Jersey 08544 (United States); Schiff, J. [Department of Mathematics, Bar-Ilan University, Ramat Gan 52900 (Israel); Fisch, N. J. [Department of Astrophysical Sciences, Princeton University, Princeton, New Jersey 08544 (United States); Princeton Plasma Physics Laboratory, Princeton, New Jersey 08543 (United States)
2015-10-15
Waves propagating through a bounded plasma can rearrange the densities of states in the six-dimensional velocity-configuration phase space. Depending on the rearrangement, the wave energy can either increase or decrease, with the difference taken up by the total plasma energy. In the case where the rearrangement is diffusive, only certain plasma states can be reached. It turns out that the set of reachable states through such diffusive rearrangements has been described in very different contexts. Building upon those descriptions, and making use of the fact that the plasma energy is a linear functional of the state densities, the maximal extractable energy under diffusive rearrangement can then be addressed through linear programming.
Maximal energy extraction under discrete diffusive exchange
Hay, Michael J; Fisch, Nathaniel J
2015-01-01
Waves propagating through a bounded plasma can rearrange the densities of states in the six-dimensional velocity-configuration phase space. Depending on the rearrangement, the wave energy can either increase or decrease, with the difference taken up by the total plasma energy. In the case where the rearrangement is diffusive, only certain plasma states can be reached. It turns out that the set of reachable states through such diffusive rearrangements has been described in very different contexts. Building upon those descriptions, and making use of the fact that the plasma energy is a linear functional of the state densities, the maximal extractable energy under diffusive rearrangement can then be addressed through linear programming.
Maximizing Tumor Immunity With Fractionated Radiation
Schaue, Doerthe, E-mail: dschaue@mednet.ucla.edu [Department of Radiation Oncology, David Geffen School of Medicine at UCLA, Los Angeles, CA (United States); Ratikan, Josephine A.; Iwamoto, Keisuke S.; McBride, William H. [Department of Radiation Oncology, David Geffen School of Medicine at UCLA, Los Angeles, CA (United States)
2012-07-15
Purpose: Technologic advances have led to increased clinical use of higher-sized fractions of radiation dose and higher total doses. How these modify the pathways involved in tumor cell death, normal tissue response, and signaling to the immune system has been inadequately explored. Here we ask how radiation dose and fraction size affect antitumor immunity, the suppression thereof, and how this might relate to tumor control. Methods and Materials: Mice bearing B16-OVA murine melanoma were treated with up to 15 Gy radiation given in various-size fractions, and tumor growth followed. The tumor-specific immune response in the spleen was assessed by interferon-{gamma} enzyme-linked immunospot (ELISPOT) assay with ovalbumin (OVA) as the surrogate tumor antigen and the contribution of regulatory T cells (Tregs) determined by the proportion of CD4{sup +}CD25{sup hi}Foxp3{sup +} T cells. Results: After single doses, tumor control increased with the size of radiation dose, as did the number of tumor-reactive T cells. This was offset at the highest dose by an increase in Treg representation. Fractionated treatment with medium-size radiation doses of 7.5 Gy/fraction gave the best tumor control and tumor immunity while maintaining low Treg numbers. Conclusions: Radiation can be an immune adjuvant, but the response varies with the size of dose per fraction. The ultimate challenge is to optimally integrate cancer immunotherapy into radiation therapy.
Maximally reliable Markov chains under energy constraints.
Escola, Sean; Eisele, Michael; Miller, Kenneth; Paninski, Liam
2009-07-01
Signal-to-noise ratios in physical systems can be significantly degraded if the outputs of the systems are highly variable. Biological processes for which highly stereotyped signal generations are necessary features appear to have reduced their signal variabilities by employing multiple processing steps. To better understand why this multistep cascade structure might be desirable, we prove that the reliability of a signal generated by a multistate system with no memory (i.e., a Markov chain) is maximal if and only if the system topology is such that the process steps irreversibly through each state, with transition rates chosen such that an equal fraction of the total signal is generated in each state. Furthermore, our result indicates that by increasing the number of states, it is possible to arbitrarily increase the reliability of the system. In a physical system, however, an energy cost is associated with maintaining irreversible transitions, and this cost increases with the number of such transitions (i.e., the number of states). Thus, an infinite-length chain, which would be perfectly reliable, is infeasible. To model the effects of energy demands on the maximally reliable solution, we numerically optimize the topology under two distinct energy functions that penalize either irreversible transitions or incommunicability between states, respectively. In both cases, the solutions are essentially irreversible linear chains, but with upper bounds on the number of states set by the amount of available energy. We therefore conclude that a physical system for which signal reliability is important should employ a linear architecture, with the number of states (and thus the reliability) determined by the intrinsic energy constraints of the system.
Wyse, Adam E.; Babcock, Ben
2016-01-01
A common suggestion made in the psychometric literature for fixed-length classification tests is that one should design tests so that they have maximum information at the cut score. Designing tests in this way is believed to maximize the classification accuracy and consistency of the assessment. This article uses simulated examples to illustrate…
From entropy-maximization to equality-maximization: Gauss, Laplace, Pareto, and Subbotin
Eliazar, Iddo
2014-12-01
The entropy-maximization paradigm of statistical physics is well known to generate the omnipresent Gauss law. In this paper we establish an analogous socioeconomic model which maximizes social equality, rather than physical disorder, in the context of the distributions of income and wealth in human societies. We show that-on a logarithmic scale-the Laplace law is the socioeconomic equality-maximizing counterpart of the physical entropy-maximizing Gauss law, and that this law manifests an optimized balance between two opposing forces: (i) the rich and powerful, striving to amass ever more wealth, and thus to increase social inequality; and (ii) the masses, struggling to form more egalitarian societies, and thus to increase social equality. Our results lead from log-Gauss statistics to log-Laplace statistics, yield Paretian power-law tails of income and wealth distributions, and show how the emergence of a middle-class depends on the underlying levels of socioeconomic inequality and variability. Also, in the context of asset-prices with Laplace-distributed returns, our results imply that financial markets generate an optimized balance between risk and predictability.
THE EFFECTS MAXIMAL AND SUB MAXIMAL AEROBIC EXERCISE ON THE BRONCHOSPASM INDICES IN NON ATHLETIC
Amir GANJİ
2012-08-01
Full Text Available Background: Exercise-induced bronchospasm (EIB is a transient airway obstruction that occurs during and after the exercise. Exercise-induced bronchospasm is observed in healthy individuals as well as the asthmatic and allergic rhinitis patients. Research question: The study compared the effects of one session of submaximal aerobic exercise and a maximal one on the prevalence of exercise-induced bronchospasm in non-athletic students. Type of study: An experimental study, using human subjects, was designed. Methods: 20 non-athletic male students participated in two sessions of aerobic exercise. The prevalence of EIB was investigated among them. The criteria for assessing exercise-induced bronchospasm were ≥10% fall in FEV1, ≥15% fall in FEF25-75%, or ≥25% fall in PEFR. Results: The results revealed that the maximal exercise did not affect FEF25-75% and PEF, but it led to a meaningful reduction in FEV1. Contrarily, the submaximal exercise affected none of these indices. That is, in both protocols the same result was obtained for PEF and FEF25-75. Moreover, the prevalence of EIB was 15% in the submaximal exercise and 20% in the maximal one. Actually, this difference was significant. Conclusion: This study demonstrated that in contrast to the subjects who performed submaximal exercise, those who participated in the maximal protocol showed more changes in the pulmonary function indices and the prevalence of EIB was greater among them.
Maximal elements of non necessarily acyclic binary relations
Josep Enric Peris Ferrando; Begoña Subiza Martínez
1992-01-01
The existence of maximal elements for binary preference relations is analyzed without imposing transitivity or convexity conditions. From each preference relation a new acyclic relation is defined in such a way that some maximal elements of this new relation characterize maximal elements of the original one. The result covers the case whereby the relation is acyclic.
Image Segmentation, Registration, Compression, and Matching
Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina
2011-01-01
A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity
Maximal Neighbor Similarity Reveals Real Communities in Networks
Žalik, Krista Rizman
2015-12-01
An important problem in the analysis of network data is the detection of groups of densely interconnected nodes also called modules or communities. Community structure reveals functions and organizations of networks. Currently used algorithms for community detection in large-scale real-world networks are computationally expensive or require a priori information such as the number or sizes of communities or are not able to give the same resulting partition in multiple runs. In this paper we investigate a simple and fast algorithm that uses the network structure alone and requires neither optimization of pre-defined objective function nor information about number of communities. We propose a bottom up community detection algorithm in which starting from communities consisting of adjacent pairs of nodes and their maximal similar neighbors we find real communities. We show that the overall advantage of the proposed algorithm compared to the other community detection algorithms is its simple nature, low computational cost and its very high accuracy in detection communities of different sizes also in networks with blurred modularity structure consisting of poorly separated communities. All communities identified by the proposed method for facebook network and E-Coli transcriptional regulatory network have strong structural and functional coherence.
Match between school furniture dimensions and children's anthropometry.
Gouvali, M K; Boudolos, K
2006-11-01
The purpose of the study was to examine whether school furniture dimensions match children's anthropometry. Children aged 6-18 years (n=274), divided into 3 groups on the basis of the used furniture size, were subjected into anthropometric measurements (shoulder, elbow, knee and popliteal height, buttock-popliteal length and hip breadth). Combinational equations defined the acceptable furniture dimensions according to anthropometry and match percentages were computed, according to either the existing situation--where children use the size assigned for their grade--or assuming that they could use the most appropriate of the sizes available. Desk and seat height were bigger than the accepted limits for most children (81.8% and 71.5%, respectively), while seat depth was appropriate for only 38.7% of children. In conclusion, the assumption that children could use the most appropriate yet available size significantly improved the match, indicating that the limited provision of one size per cluster of grades does not accommodate the variability of anthropometry even among children of the same age.
Oliveira, Felipe B D; Oliveira, Anderson S C; Rizatto, Guilherme F; Denadai, Benedito S
2013-01-01
The aim of the present study was to verify whether strength training designed to improve explosive and maximal strength would influence rate of force development (RFD). Nine men participated in a 6-week knee extensors resistance training program and 9 matched subjects participated as controls. Throughout the training sessions, subjects were instructed to perform isometric knee extension as fast and forcefully as possible, achieving at least 90% maximal voluntary contraction as quickly as possible, hold it for 5 s, and relax. Fifteen seconds separated each repetition (6-10), and 2 min separated each set (3). Pre- and post-training measurements were maximal isometric knee extensor (MVC), RFD, and RFD relative to MVC (i.e., %MVC·s(-1)) in different time-epochs varying from 10 to 250 ms from the contraction onset. The MVC (Nm) increased by 19% (275.8 ± 64.9 vs. 329.8 ± 60.4, p force can be differently influenced by resistance training. Thus, the resistance training programs should consider the specific neuromuscular demands of each sport.In active non-strength trained individuals, a short-term resistance training program designed to increase both explosive and maximal strength seems to reduce the adaptive response (i.e. increased RFDMAX) evoked by training with an intended ballistic effort (i.e. high-RFD contraction).
... Romaine lettuce) One medium baked potato is a computer mouse To control your portion sizes when you ... M. is also a founding member of Hi-Ethics and subscribes to the principles of the Health ...
Multiple Pattern Matching Algorithm using Pair-count
Raju Bhukya
2011-07-01
Full Text Available Pattern matching occurs in various applications, ranging from simple text searching in word processors to identification of common motifs in DNA sequences in computational biology. The problem of exact pattern matching has been well studied and a number of efficient algorithms already exist. However these exact pattern matching algorithms are of little help when they are applied to finding patterns in DNA sequences. Pattern matching in a DNA sequence or pattern searching from a large data base is a major research area in computational biology. To extract pattern from a large sequence it takes more time, in order to reduce searching time we have proposed an approach that reduces the search time with accurate retrieval of the matched pattern from the given sequence of any size of a file. Executing patterns from a large DNA or protein data is a computationally intensive task. As performance plays a major role in extracting patterns from a given DNA sequence or from a large database independent of the size of the sequence. More efficient approaches related to multiple pattern matching techniques are becoming more important for finding the functional as well as the structural properties of the proteins and genes. One of the major problems in genomic field is to perform pattern comparison on DNA and protein sequences. In the current approach we explore a new technique which avoids unnecessary comparisons in the DNA sequence and gives the accurate retrieval of the pattern called a multiple pattern matching algorithm using pair count. The proposed technique gives very good performance related to DNA sequence analysis for querying of publicly available genome sequence data. By using this method the number of comparisons gradually decreases and comparison per character ratio of the proposed algorithm reduces accordingly when compared to the some of the existing popular methods. The experimental results show that there is considerable amount of performance
MATCHING AERIAL IMAGES TO 3D BUILDING MODELS BASED ON CONTEXT-BASED GEOMETRIC HASHING
J. Jung
2016-06-01
Full Text Available In this paper, a new model-to-image framework to automatically align a single airborne image with existing 3D building models using geometric hashing is proposed. As a prerequisite process for various applications such as data fusion, object tracking, change detection and texture mapping, the proposed registration method is used for determining accurate exterior orientation parameters (EOPs of a single image. This model-to-image matching process consists of three steps: 1 feature extraction, 2 similarity measure and matching, and 3 adjustment of EOPs of a single image. For feature extraction, we proposed two types of matching cues, edged corner points representing the saliency of building corner points with associated edges and contextual relations among the edged corner points within an individual roof. These matching features are extracted from both 3D building and a single airborne image. A set of matched corners are found with given proximity measure through geometric hashing and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on co-linearity equations. The result shows that acceptable accuracy of single image's EOP can be achievable by the proposed registration approach as an alternative to labour-intensive manual registration process.
Matching Aerial Images to 3d Building Models Based on Context-Based Geometric Hashing
Jung, J.; Bang, K.; Sohn, G.; Armenakis, C.
2016-06-01
In this paper, a new model-to-image framework to automatically align a single airborne image with existing 3D building models using geometric hashing is proposed. As a prerequisite process for various applications such as data fusion, object tracking, change detection and texture mapping, the proposed registration method is used for determining accurate exterior orientation parameters (EOPs) of a single image. This model-to-image matching process consists of three steps: 1) feature extraction, 2) similarity measure and matching, and 3) adjustment of EOPs of a single image. For feature extraction, we proposed two types of matching cues, edged corner points representing the saliency of building corner points with associated edges and contextual relations among the edged corner points within an individual roof. These matching features are extracted from both 3D building and a single airborne image. A set of matched corners are found with given proximity measure through geometric hashing and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on co-linearity equations. The result shows that acceptable accuracy of single image's EOP can be achievable by the proposed registration approach as an alternative to labour-intensive manual registration process.
Alkjær, Tine; Simonsen, Erik B; Magnusson, S Peter
2012-01-01
INTRODUCTION: Coactivation of the hamstring muscles during dynamic knee extension may compensate for increased knee joint laxity in anterior cruciate ligament (ACL) deficient subjects. This study examined if antagonist muscle coactivation during maximal dynamic knee extension was elevated...... in subjects with anterior cruciate ligament (ACL) deficiency compared to age-matched healthy controls. METHODS: Electromyography (EMG) and net knee joint moments were recorded during maximal concentric quadriceps and eccentric hamstring contractions, performed in an isokinetic dynamometer (ROM: 90......-10°, angular speed: 30°/s). Hamstring antagonist EMG recorded during concentric quadriceps contraction was converted into antagonist moment based on the EMG-moment relationship observed during eccentric agonist contractions. RESULTS: The magnitude of antagonist hamstring EMG was 65.5% higher in ACL deficient...
Global haplotype partitioning for maximal associated SNP pairs
Pezeshk Hamid
2009-08-01
Full Text Available Abstract Background Global partitioning based on pairwise associations of SNPs has not previously been used to define haplotype blocks within genomes. Here, we define an association index based on LD between SNP pairs. We use the Fisher's exact test to assess the statistical significance of the LD estimator. By this test, each SNP pair is characterized as associated, independent, or not-statistically-significant. We set limits on the maximum acceptable proportion of independent pairs within all blocks and search for the partitioning with maximal proportion of associated SNP pairs. Essentially, this model is reduced to a constrained optimization problem, the solution of which is obtained by iterating a dynamic programming algorithm. Results In comparison with other methods, our algorithm reports blocks of larger average size. Nevertheless, the haplotype diversity within the blocks is captured by a small number of tagSNPs. Resampling HapMap haplotypes under a block-based model of recombination showed that our algorithm is robust in reproducing the same partitioning for recombinant samples. Our algorithm performed better than previously reported models in a case-control association study aimed at mapping a single locus trait, based on simulation results that were evaluated by a block-based statistical test. Compared to methods of haplotype block partitioning, we performed best on detection of recombination hotspots. Conclusion Our proposed method divides chromosomes into the regions within which allelic associations of SNP pairs are maximized. This approach presents a native design for dimension reduction in genome-wide association studies. Our results show that the pairwise allelic association of SNPs can describe various features of genomic variation, in particular recombination hotspots.
Multiple Sink Positioning and Routing to Maximize the Lifetime of Sensor Networks
Kim, Haeyong; Kwon, Taekyoung; Mah, Pyeongsoo
In wireless sensor networks, the sensor nodes collect data, which are routed to a sink node. Most of the existing proposals address the routing problem to maximize network lifetime in the case of a single sink node. In this paper, we extend this problem into the case of multiple sink nodes. To maximize network lifetime, we consider the two problems: (i) how to position multiple sink nodes in the area, and (ii) how to route traffic flows from sensor nodes to sink nodes. In this paper, the solutions to these problems are formulated into a Mixed Integer Linear Programming (MILP) model. However, it is computationally difficult to solve the MILP formulation as the size of sensor network grows because MILP is NP-hard. Thus, we propose a heuristic algorithm, which produces a solution in polynomial time. From our experiments, we found out that the proposed heuristic algorithm provides a near-optimal solution for maximizing network lifetime in dense sensor networks.
A short note on the maximal point-biserial correlation under non-normality.
Cheng, Ying; Liu, Haiyan
2016-11-01
The aim of this paper is to derive the maximal point-biserial correlation under non-normality. Several widely used non-normal distributions are considered, namely the uniform distribution, t-distribution, exponential distribution, and a mixture of two normal distributions. Results show that the maximal point-biserial correlation, depending on the non-normal continuous variable underlying the binary manifest variable, may not be a function of p (the probability that the dichotomous variable takes the value 1), can be symmetric or non-symmetric around p = .5, and may still lie in the range from -1.0 to 1.0. Therefore researchers should exercise caution when they interpret their sample point-biserial correlation coefficients based on popular beliefs that the maximal point-biserial correlation is always smaller than 1, and that the size of the correlation is always further restricted as p deviates from .5. © 2016 The British Psychological Society.
Matching polytopes and Specht modules
Liu, Ricky Ini
2009-01-01
We prove that the dimension of the Specht module of a forest $G$ is the same as the normalized volume of the matching polytope of $G$. We also associate to $G$ a symmetric function $s_G$ (analogous to the Schur symmetric function $s_\\lambda$ for a partition $\\lambda$) and investigate its combinatorial and representation-theoretic properties in relation to the Specht module and Schur module of $G$. We then use this to define notions of standard and semistandard tableaux for forests.
ExpFinder: Finding experts by graph pattern matching
Fan, Wenfei; Wang, Xin; Wu, Yinghui
2013-01-01
We present ExpFinder, a system for finding experts in social networks based on graph pattern matching. We demonstrate (1) how ExpFinder identifies top-K experts in a social network by supporting bounded simulation of graph patterns, and by ranking the matches based on a metric for social impact; (2) how it copes with the sheer size of real-life social graphs by supporting incremental query evaluation and query preserving graph compression, and (3) how the GUI of ExpFinder interacts with users...
Analysis of matches and partial-matches in a Danish STR data set.
Tvedebrink, Torben; Eriksen, Poul Svante; Curran, James Michael; Mogensen, Helle Smidt; Morling, Niels
2012-05-01
Over the recent years, the national databases of STR profiles have grown in size due to the success of forensic DNA analysis in solving crimes. The accumulation of DNA profiles implies that the probability of a random match or near match of two randomly selected DNA profiles in the database increases. We analysed 53,295 STR profiles from individuals investigated in relation to crime case investigations at the Department of Forensic Medicine, Faculty of Health Sciences, University of Copenhagen, Denmark. Incomplete STR profiles (437 circa 0.8% of the total), 48 redundant STR profiles from monozygotic twins (0.09%), 6 redundant STR profiles of unknown cause and 1283 STR profiles from repeated testing of individuals were removed leaving 51,517 complete 10 locus STR profiles for analysis. The number corresponds to approximately 1% of the Danish population. We compared all STR profiles to each other, i.e. 1.3×10(9) comparisons. With these large number of comparisons, it is likely to observe DNA profiles that coincide on many loci, which has concerned some commentators and raised questions about "overstating" the power of DNA evidence. We used the method of Weir [11,12] and Curran et al. [3] to compare the observed and expected number of matches and near matches in the data set. We extended the methods by computing the covariance matrix of the summary statistic and used it for the estimation of the identical-by-descent parameter, θ. The analysis demonstrated a number of close relatives in the Danish data set and substructure. The main contribution to the substructure comes from close relatives. An overall θ-value of 1% compensated for the observed substructure, when close familial relationships were accounted for.
Maximization Paradox: Result of Believing in an Objective Best.
Luan, Mo; Li, Hong
2017-05-01
The results from four studies provide reliable evidence of how beliefs in an objective best influence the decision process and subjective feelings. A belief in an objective best serves as the fundamental mechanism connecting the concept of maximizing and the maximization paradox (i.e., expending great effort but feeling bad when making decisions, Study 1), and randomly chosen decision makers operate similar to maximizers once they are manipulated to believe that the best is objective (Studies 2A, 2B, and 3). In addition, the effect of a belief in an objective best on the maximization paradox is moderated by the presence of a dominant option (Study 3). The findings of this research contribute to the maximization literature by demonstrating that believing in an objective best leads to the maximization paradox. The maximization paradox is indeed the result of believing in an objective best.
Muscle damage produced during a simulated badminton match in competitive male players.
Abián, Pablo; Del Coso, Juan; Salinero, Juan José; Gallo-Salazar, César; Areces, Francisco; Ruiz-Vicente, Diana; Lara, Beatriz; Soriano, Lidón; Muñoz, Victor; Lorenzo-Capella, Irma; Abián-Vicén, Javier
2016-01-01
The purpose of the study was to assess the occurrence of muscle damage after a simulated badminton match and its influence on physical and haematological parameters. Sixteen competitive male badminton players participated in the study. Before and just after a 45-min simulated badminton match, maximal isometric force and badminton-specific running/movement velocity were measured to assess muscle fatigue. Blood samples were also obtained before and after the match. The badminton match did not affect maximal isometric force or badminton-specific velocity. Blood volume and plasma volume were significantly reduced during the match and consequently haematite, leucocyte, and platelet counts significantly increased. Blood myoglobin and creatine kinase concentrations increased from 26.5 ± 11.6 to 197.3 ± 70.2 µg·L(-1) and from 258.6 ± 192.2 to 466.0 ± 296.5 U·L(-1), respectively. In conclusion, a simulated badminton match modified haematological parameters of whole blood and serum blood that indicate the occurrence of muscle fibre damage. However, the level of muscle damage did not produce decreased muscle performance.
MONITORING EXTERNAL AND INTERNAL LOADS OF BRAZILIAN SOCCER REFEREES DURING OFFICIAL MATCHES
Eduardo C. Costa
2013-09-01
Full Text Available This study aimed to assess the external and internal loads of Brazilian soccer referees during official matches. A total of 11 field referees (aged 36.2 ± 7.5 years were monitored during 35 matches. The external (distance covered, mean and maximal speed and internal load parameters (session ratings of perceived exertion [RPE] training load [TL], Edwards' TL, and time spent in different heart rate [HR] zones were assessed in 3-4 matches per referee. External load parameters were measured using a wrist Global Positioning System (GPS receiver. No differences in distance covered (5.219 ± 205 vs. 5.230 ± 237 m and maximal speed (19.3 ± 1.0 vs. 19.4 ± 1.4 km·h-1 were observed between the halves of the matches (p > 0.05. However, the mean speed was higher in the first half of the matches (6.6 ± 0.4 vs. 6.4 ± 0.3 km·h-1 (p 80% of HRmax. Nonetheless, the time spent at 90-100% of HRmax was higher in the first half (59.9 vs. 52.3% (p < 0.05. Significant correlations between session RPE TL and distance covered at 90-100% of HRmax (r = 0.62 and session RPE TL and maximal speed (r = 0.54 (p < 0.05 were noted. Furthermore, there was a positive correlation between session RPE TL and Edwards' TL (r = 0.61 (p < 0.05. Brazilian soccer referees demonstrated high external and internal load demands during official matches. The portable GPS/HR monitors and session RPE method can provide relevant information regarding the magnitude of the physiological strain during official matches
EXPLANATORY VARIANCE IN MAXIMAL OXYGEN UPTAKE
Jacalyn J. Robert McComb
2006-06-01
Full Text Available The purpose of this study was to develop a prediction equation that could be used to estimate maximal oxygen uptake (VO2max from a submaximal water running protocol. Thirty-two volunteers (n =19 males, n = 13 females, ages 18 - 24 years, underwent the following testing procedures: (a a 7-site skin fold assessment; (b a land VO2max running treadmill test; and (c a 6 min water running test. For the water running submaximal protocol, the participants were fitted with an Aqua Jogger Classic Uni-Sex Belt and a Polar Heart Rate Monitor; the participants' head, shoulders, hips and feet were vertically aligned, using a modified running/bicycle motion. A regression model was used to predict VO2max. The criterion variable, VO2max, was measured using open-circuit calorimetry utilizing the Bruce Treadmill Protocol. Predictor variables included in the model were percent body fat (% BF, height, weight, gender, and heart rate following a 6 min water running protocol. Percent body fat accounted for 76% (r = -0.87, SEE = 3.27 of the variance in VO2max. No other variables significantly contributed to the explained variance in VO2max. The equation for the estimation of VO2max is as follows: VO2max ml.kg-1·min-1 = 56.14 - 0.92 (% BF.
Reflection quasilattices and the maximal quasilattice
Boyle, Latham; Steinhardt, Paul J.
2016-08-01
We introduce the concept of a reflection quasilattice, the quasiperiodic generalization of a Bravais lattice with irreducible reflection symmetry. Among their applications, reflection quasilattices are the reciprocal (i.e., Bragg diffraction) lattices for quasicrystals and quasicrystal tilings, such as Penrose tilings, with irreducible reflection symmetry and discrete scale invariance. In a follow-up paper, we will show that reflection quasilattices can be used to generate tilings in real space with properties analogous to those in Penrose tilings, but with different symmetries and in various dimensions. Here we explain that reflection quasilattices only exist in dimensions two, three, and four, and we prove that there is a unique reflection quasilattice in dimension four: the "maximal reflection quasilattice" in terms of dimensionality and symmetry. Unlike crystallographic Bravais lattices, all reflection quasilattices are invariant under rescaling by certain discrete scale factors. We tabulate the complete set of scale factors for all reflection quasilattices in dimension d >2 , and for all those with quadratic irrational scale factors in d =2 .
Viral quasispecies assembly via maximal clique enumeration.
Töpfer, Armin; Marschall, Tobias; Bull, Rowena A; Luciani, Fabio; Schönhuth, Alexander; Beerenwinkel, Niko
2014-03-01
Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples. We develop a statistical model for paired-end reads accounting for mutations, insertions, and deletions. Using an iterative maximal clique enumeration approach, read pairs are assembled into haplotypes of increasing length, eventually enabling global haplotype assembly. The performance of our quasispecies assembly method is assessed on simulated data for varying population characteristics and sequencing technology parameters. Owing to its paired-end handling, HaploClique compares favorably to state-of-the-art haplotype inference methods. It can reconstruct error-free full-length haplotypes from low coverage samples and detect large insertions and deletions at low frequencies. We applied HaploClique to sequencing data derived from a clinical hepatitis C virus population of an infected patient and discovered a novel deletion of length 357±167 bp that was validated by two independent long-read sequencing experiments. HaploClique is available at https://github.com/armintoepfer/haploclique. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.
Network channel allocation and revenue maximization
Hamalainen, Timo; Joutsensalo, Jyrki
2002-09-01
This paper introduces a model that can be used to share link capacity among customers under different kind of traffic conditions. This model is suitable for different kind of networks like the 4G networks (fast wireless access to wired network) to support connections of given duration that requires a certain quality of service. We study different types of network traffic mixed in a same communication link. A single link is considered as a bottleneck and the goal is to find customer traffic profiles that maximizes the revenue of the link. Presented allocation system accepts every calls and there is not absolute blocking, but the offered data rate/user depends on the network load. Data arrival rate depends on the current link utilization, user's payment (selected CoS class) and delay. The arrival rate is (i) increasing with respect to the offered data rate, (ii) decreasing with respect to the price, (iii) decreasing with respect to the network load, and (iv) decreasing with respect to the delay. As an example, explicit formula obeying these conditions is given and analyzed.
Evolution of correlated multiplexity through stability maximization
Dwivedi, Sanjiv K.; Jalan, Sarika
2017-02-01
Investigating the relation between various structural patterns found in real-world networks and the stability of underlying systems is crucial to understand the importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising antisymmetric couplings in one layer depicting predator-prey relationship and symmetric couplings in the other depicting mutualistic (or competitive) relationship, based on stability maximization through the largest eigenvalue of the corresponding adjacency matrices. We find that there is an emergence of the correlated multiplexity between the mirror nodes as the evolution progresses. Importantly, evolved values of the correlated multiplexity exhibit a dependence on the interlayer coupling strength. Additionally, the interlayer coupling strength governs the evolution of the disassortativity property in the individual layers. We provide analytical understanding to these findings by considering starlike networks representing both the layers. The framework discussed here is useful for understanding principles governing the stability as well as the importance of various patterns in the underlying networks of real-world systems ranging from the brain to ecology which consist of multiple types of interaction behavior.
Viral quasispecies assembly via maximal clique enumeration.
Armin Töpfer
2014-03-01
Full Text Available Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples. We develop a statistical model for paired-end reads accounting for mutations, insertions, and deletions. Using an iterative maximal clique enumeration approach, read pairs are assembled into haplotypes of increasing length, eventually enabling global haplotype assembly. The performance of our quasispecies assembly method is assessed on simulated data for varying population characteristics and sequencing technology parameters. Owing to its paired-end handling, HaploClique compares favorably to state-of-the-art haplotype inference methods. It can reconstruct error-free full-length haplotypes from low coverage samples and detect large insertions and deletions at low frequencies. We applied HaploClique to sequencing data derived from a clinical hepatitis C virus population of an infected patient and discovered a novel deletion of length 357±167 bp that was validated by two independent long-read sequencing experiments. HaploClique is available at https://github.com/armintoepfer/haploclique. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.
Maximal respiratory pressure in healthy Japanese children
Tagami, Miki; Okuno, Yukako; Matsuda, Tadamitsu; Kawamura, Kenta; Shoji, Ryosuke; Tomita, Kazuhide
2017-01-01
[Purpose] Normal values for respiratory muscle pressures during development in Japanese children have not been reported. The purpose of this study was to investigate respiratory muscle pressures in Japanese children aged 3–12 years. [Subjects and Methods] We measured respiratory muscle pressure values using a manovacuometer without a nose clip, with subjects in a sitting position. Data were collected for ages 3–6 (Group I: 68 subjects), 7–9 (Group II: 86 subjects), and 10–12 (Group III: 64 subjects) years. [Results] The values for respiratory muscle pressures in children were significantly higher with age in both sexes, and were higher in boys than in girls. Correlation coefficients were significant at values of 0.279 to 0.471 for each gender relationship between maximal respiratory pressure and age, height, and weight, respectively. [Conclusion] In this study, we showed pediatric respiratory muscle pressure reference value for each age. In the present study, values for respiratory muscle pressures were lower than Brazilian studies. This suggests that differences in respiratory muscle pressures vary with ethnicity. PMID:28356644
Hybrid Schema Matching for Deep Web
Chen, Kerui; Zuo, Wanli; He, Fengling; Chen, Yongheng
Schema matching is the process of identifying semantic mappings, or correspondences, between two or more schemas. Schema matching is a first step and critical part of data integration. For schema matching of deep web, most researches only interested in query interface, while rarely pay attention to abundant schema information contained in query result pages. This paper proposed a mixed schema matching technique, which combines attributes that appeared in query structures and query results of different data sources, and mines the matched schemas inside. Experimental results prove the effectiveness of this method for improving the accuracy of schema matching.
Automatic milking systems, farm size, and milk production.
Rotz, C A; Coiner, C U; Soder, K J
2003-12-01
Automatic milking systems (AMS) offer relief from the demanding routine of milking. Although many AMS are in use in Europe and a few are used in the United States, the potential benefit for American farms is uncertain. A farm-simulation model was used to determine the long-term, whole-farm effect of implementing AMS on farm sizes of 30 to 270 cows. Highest farm net return to management and unpaid factors was when AMS were used at maximal milking capacity. Adding stalls to increase milking frequency and possibly increase production generally did not improve net return. Compared with new traditional milking systems, the greatest potential economic benefit was a single-stall AMS on a farm size of 60 cows at a moderate milk production level (8600 kg/cow). On other farm sizes using single-stall type robotic units, losses in annual net return of 0 dollars to 300 dollars/cow were projected, with the greatest losses on larger farms and at high milk production (10,900 kg/cow). Systems with one robot serving multiple stalls provided a greater net return than single-stall systems, and this net return was competitive with traditional parlors for 50- to 130-cow farm sizes. The potential benefit of AMS was improved by 100 dollars/cow per year if the AMS increased production an additional 5%. A 20% reduction in initial equipment cost or doubling milking labor cost also improved annual net return of an AMS by up to 100 dollars/cow. Annual net return was reduced by 110 dollars/cow, though, if the economic life of the AMS was reduced by 3 yr for a more rapid depreciation than that normally used with traditional milking systems. Thus, under current assumptions, the economic return for an AMS was similar to that of new parlor systems on smaller farms when the milking capacity of the AMS was well matched to herd size and milk production level.
Continuous or discrete attractors in neural circuits? A self-organized switch at maximal entropy
Bernacchia, Alberto
2007-01-01
A recent experiment suggests that neural circuits may alternatively implement continuous or discrete attractors, depending on the training set up. In recurrent neural network models, continuous and discrete attractors are separately modeled by distinct forms of synaptic prescriptions (learning rules). Here, we report a solvable network model, endowed with Hebbian synaptic plasticity, which is able to learn either discrete or continuous attractors, depending on the frequency of presentation of stimuli and on the structure of sensory coding. A continuous attractor is learned when experience matches sensory coding, i.e. when the distribution of experienced stimuli matches the distribution of preferred stimuli of neurons. In that case, there is no processing of sensory information and neural activity displays maximal entropy. If experience goes beyond sensory coding, processing is initiated and the continuous attractor is destabilized into a set of discrete attractors.
Reducing the likelihood of long tennis matches.
Barnett, Tristan; Alan, Brown; Pollard, Graham
2006-01-01
Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.
Phonon impedance matching: minimizing interfacial thermal resistance of thin films
Polanco, Carlos; Zhang, Jingjie; Ghosh, Avik
2014-03-01
The challenge to minimize interfacial thermal resistance is to allow a broad band spectrum of phonons, with non-linear dispersion and well defined translational and rotational symmetries, to cross the interface. We explain how to minimize this resistance using a frequency dependent broadening matrix that generalizes the notion of acoustic impedance to the whole phonon spectrum including symmetries. We show how to ``match'' two given materials by joining them with a single atomic layer, with a multilayer material and with a graded superlattice. Atomic layer ``matching'' requires a layer with a mass close to the arithmetic mean (or spring constant close to the harmonic mean) to favor high frequency phonon transmission. For multilayer ``matching,'' we want a material with a broadening close to the geometric mean to maximize transmission peaks. For graded superlattices, a continuous sequence of geometric means translates to an exponentially varying broadening that generates a wide-band antireflection coating for both the coherent and incoherent limits. Our results are supported by ``first principles'' calculations of thermal conductance for GaAs / Gax Al1 - x As / AlAs thin films using the Non-Equilibrium Greens Function formalism coupled with Density Functional Perturbation Theory. NSF-CAREER (QMHP 1028883), NSF-IDR (CBET 1134311), XSEDE.
Spot the match – wildlife photo-identification using information theory
Meekan Mark G
2007-01-01
Full Text Available Abstract Background Effective approaches for the management and conservation of wildlife populations require a sound knowledge of population demographics, and this is often only possible through mark-recapture studies. We applied an automated spot-recognition program (I3S for matching natural markings of wildlife that is based on a novel information-theoretic approach to incorporate matching uncertainty. Using a photo-identification database of whale sharks (Rhincodon typus as an example case, the information criterion (IC algorithm we developed resulted in a parsimonious ranking of potential matches of individuals in an image library. Automated matches were compared to manual-matching results to test the performance of the software and algorithm. Results Validation of matched and non-matched images provided a threshold IC weight (approximately 0.2 below which match certainty was not assured. Most images tested were assigned correctly; however, scores for the by-eye comparison were lower than expected, possibly due to the low sample size. The effect of increasing horizontal angle of sharks in images reduced matching likelihood considerably. There was a negative linear relationship between the number of matching spot pairs and matching score, but this relationship disappeared when using the IC algorithm. Conclusion The software and use of easily applied information-theoretic scores of match parsimony provide a reliable and freely available method for individual identification of wildlife, with wide applications and the potential to improve mark-recapture studies without resorting to invasive marking techniques.
Biological motion distorts size perception
Veto, Peter; Einhäuser, Wolfgang; Troje, Nikolaus F.
2017-02-01
Visual illusions explore the limits of sensory processing and provide an ideal testbed to study perception. Size illusions - stimuli whose size is consistently misperceived - do not only result from sensory cues, but can also be induced by cognitive factors, such as social status. Here we investigate, whether the ecological relevance of biological motion can also distort perceived size. We asked observers to judge the size of point-light walkers (PLWs), configurations of dots whose movements induce the perception of human movement, and visually matched control stimuli (inverted PLWs). We find that upright PLWs are consistently judged as larger than inverted PLWs, while static point-light figures do not elicit the same effect. We also show the phenomenon using an indirect paradigm: observers judged the relative size of a disc that followed an inverted PLW larger than a disc following an upright PLW. We interpret this as a contrast effect: The upright PLW is perceived larger and thus the subsequent disc is judged smaller. Together, these results demonstrate that ecologically relevant biological-motion stimuli are perceived larger than visually matched control stimuli. Our findings present a novel case of illusory size perception, where ecological importance leads to a distorted perception of size.
Biological motion distorts size perception
Veto, Peter; Einhäuser, Wolfgang; Troje, Nikolaus F.
2017-01-01
Visual illusions explore the limits of sensory processing and provide an ideal testbed to study perception. Size illusions – stimuli whose size is consistently misperceived – do not only result from sensory cues, but can also be induced by cognitive factors, such as social status. Here we investigate, whether the ecological relevance of biological motion can also distort perceived size. We asked observers to judge the size of point-light walkers (PLWs), configurations of dots whose movements induce the perception of human movement, and visually matched control stimuli (inverted PLWs). We find that upright PLWs are consistently judged as larger than inverted PLWs, while static point-light figures do not elicit the same effect. We also show the phenomenon using an indirect paradigm: observers judged the relative size of a disc that followed an inverted PLW larger than a disc following an upright PLW. We interpret this as a contrast effect: The upright PLW is perceived larger and thus the subsequent disc is judged smaller. Together, these results demonstrate that ecologically relevant biological-motion stimuli are perceived larger than visually matched control stimuli. Our findings present a novel case of illusory size perception, where ecological importance leads to a distorted perception of size. PMID:28205639
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
Faro, Simone
2010-01-01
This paper addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text t. It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 80 string matching algorithms have been proposed, and more than 50% of them in the last ten years. In this note we present a comprehensive list of all string matching algorithms and present experimental results in order to compare them from a practical point of view. From our experimental evaluation it turns out that the performance of the algorithms are quite different for different alphabet sizes and pattern length.
Efficient target control of complex networks based on preferential matching
Zhang, Xizhe; Lv, Tianyang
2016-01-01
Controlling a complex network towards a desire state is of great importance in many applications. Existing works present an approximate algorithm to find the driver nodes used to control partial nodes of the network. However, the driver nodes obtained by this algorithm depend on the matching order of nodes and cannot get the optimum results. Here we present a novel algorithm to find the driver nodes for target control based on preferential matching. The algorithm elaborately arrange the matching order of nodes in order to minimize the size of the driver nodes set. The results on both synthetic and real networks indicate that the performance of proposed algorithm are better than the previous one. The algorithm may have various application in controlling complex networks.
Extremal sizes of subspace partitions
Heden, Olof; Nastase, Esmeralda; Sissokho, Papa
2011-01-01
A subspace partition $\\Pi$ of $V=V(n,q)$ is a collection of subspaces of $V$ such that each 1-dimensional subspace of $V$ is in exactly one subspace of $\\Pi$. The size of $\\Pi$ is the number of its subspaces. Let $\\sigma_q(n,t)$ denote the minimum size of a subspace partition of $V$ in which the largest subspace has dimension $t$, and let $\\rho_q(n,t)$ denote the maximum size of a subspace partition of $V$ in which the smallest subspace has dimension $t$. In this paper, we determine the values of $\\sigma_q(n,t)$ and $\\rho_q(n,t)$ for all positive integers $n$ and $t$. Furthermore, we prove that if $n\\geq 2t$, then the minimum size of a maximal partial $t$-spread in $V(n+t-1,q)$ is $\\sigma_q(n,t)$.
Brand, Judith, Ed.
1995-01-01
"Exploring" is a magazine of science, art, and human perception that communicates ideas museum exhibits cannot demonstrate easily by using experiments and activities for the classroom. This issue concentrates on size, examining it from a variety of viewpoints. The focus allows students to investigate and discuss interconnections among…
Hansen, Pelle Guldborg; Jespersen, Andreas Maaløe; Skov, Laurits Rhoden
2015-01-01
Objectives We examined how a reduction in plate size would affect the amount of food waste from leftovers in a field experiment at a standing lunch for 220 CEOs. Methods A standing lunch for 220 CEOs in the Danish Opera House was arranged to feature two identical buffets with plates of two differ...
Matching conditions on capillary ripples
Rodriguez, Aresky H.; Marin Antuna, J.; Rodriguez Coppola, H. [Universidad de La Habana, La Habana (Cuba)
2001-12-01
The physics of the oscillatory motion in the interface between two immiscible viscous fluids is presented based on a detailed analysis of the matching conditions. These conditions are almost completely derived from the dynamical equations of the system. This unusual approach in graduated courses in hydrodynamics, is proposed as an alternative. The role of viscosity in the modes of oscillation of the interface is also clearly shown. [Spanish] Se explica la fisica de las oscilaciones de la interfase de dos fluidos viscosos no miscibles a partir del analisis detallado de las condiciones de empalme que se derivan casi completamente del sistema de ecuaciones dinamicas que lo rigen. Ese enfoque, no habitual en los cursos de doctorado de esta materia, se propone como alternativa para estos cursos. Se explica tambien de forma clara el posible papel de la viscosidad en los modos de oscilacion de la interfase.
Making Palm Print Matching Mobile
Fang, Li; Chian, Cheng Shao
2009-01-01
With the growing importance of personal identification and authentication in todays highly advanced world where most business and personal tasks are being replaced by electronic means, the need for a technology that is able to uniquely identify an individual and has high fraud resistance see the rise of biometric technologies. Making biometric based solution mobile is a promising trend. A new RST invariant square based palm print ROI extraction method was successfully implemented and integrated into the current application suite. A new set of palm print image database captured using embedded cameras in mobile phone was created to test its robustness. Comparing to those extraction methods that are based on boundary tracking of the overall hand shape that has limitation of being unable to process palm print images that has one or more fingers closed, the system can now effectively handle the segmentation of palm print images with varying finger positioning. The high flexibility makes palm print matching mobile ...
Nsiri Benayad
2010-01-01
Full Text Available This article investigates a new method of motion estimation based on block matching criterion through the modeling of image blocks by a mixture of two and three Gaussian distributions. Mixture parameters (weights, means vectors, and covariance matrices are estimated by the Expectation Maximization algorithm (EM which maximizes the log-likelihood criterion. The similarity between a block in the current image and the more resembling one in a search window on the reference image is measured by the minimization of Extended Mahalanobis distance between the clusters of mixture. Performed experiments on sequences of real images have given good results, and PSNR reached 3 dB.
Common mechanisms in apparent motion perception and visual pattern matching.
Larsen, Axel; Bundesen, Claus
2009-12-01
Common mechanisms in apparent motion perception and visual pattern matching. Scandinavian Journal of Psychology, 50, 526-534.There are close functional similarities between apparent motion perception and visual pattern matching. In particular, striking functional similarities have been demonstrated between perception of rigid objects in apparent motion and purely mental transformations of visual size and orientation used in comparisons of objects with respect to shape but regardless of size and orientation. In both cases, psychophysical data suggest that differences in visual size are resolved as differences in depth, such that transformation of size is done by translation in depth. Furthermore, the process of perceived or imagined translation appears to be stepwise additive such that a translation over a long distance consists of a sequence of smaller translations, the durations of these steps being additive. Both perceived and imagined rotation also appear to be stepwise additive, and combined transformations of size and orientation appear to be done by alternation of small steps of pure translation and small steps of pure rotation. The functional similarities suggest that common mechanisms underlie perception of apparent motion and purely mental transformations. In line with this suggestion, functional brain imaging has isolated neural structures in motion area MT used in mental transformation of size.
Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair
Su-juan ZHENG
2009-06-01
Full Text Available Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair
Su-juan ZHENG; Xiu-ming YU; Li-qing CAO
2009-01-01
Solving the absent assignment problern of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
Bonding and impedance matching of acoustic transducers using silver epoxy.
Son, Kyu Tak; Lee, Chin C
2012-04-01
Silver epoxy was selected to bond transducer plates on glass substrates. The properties and thickness of the bonding medium affect the electrical input impedance of the transducer. Thus, the thickness of the silver epoxy bonding layer was used as a design parameter to optimize the structure for the transducer input impedance to match the 50 Ω output impedance of most radio frequency (RF) generators. Simulation and experimental results show that nearly perfect matching is achieved without using any matching circuit. At the matching condition, the transducer operates at a frequency band a little bit below the half-wavelength resonant frequency of the piezoelectric plate. In experiments, lead titanate (PT) piezoelectric plates were employed. Both full-size, 11.5 mm × 2 mm × 0.4 mm, and half-size, 5.75 mm × 2 mm × 0.4 mm, can be well matched using optimal silver epoxy thickness. The transducer assemblies demonstrate high efficiency. The conversion loss from electrical power to acoustic power in soda-lime glass is 4.3 dB. This loss is low considering the fact that the transducers operate at off-resonance by 12%. With proper choice of silver epoxy thickness, the transducer can be matched at the fundamental, the 3rd and 5th harmonic frequencies. This leads to the possible realization of triple-band transducers. Reliability was assessed with thermal cycling test according to Telcordia GR-468-Core recommendation. Of the 30 transducer assemblies tested, none broke until 2900 cycles and 27 have sustained beyond 4050 cycles.
Genetic Programming Framework for Fingerprint Matching
Ismail, Ismail A; Abd-ElWahid, Mohammed A; ElKafrawy, Passent M; Nasef, Mohammed M
2009-01-01
A fingerprint matching is a very difficult problem. Minutiae based matching is the most popular and widely used technique for fingerprint matching. The minutiae points considered in automatic identification systems are based normally on termination and bifurcation points. In this paper we propose a new technique for fingerprint matching using minutiae points and genetic programming. The goal of this paper is extracting the mathematical formula that defines the minutiae points.
A Two-Sided Matching Decision Model Based on Uncertain Preference Sequences
Xiao Liu
2015-01-01
Full Text Available Two-sided matching is a hot issue in the field of operation research and decision analysis. This paper reviews the typical two-sided matching models and their limitations in some specific contexts, and then puts forward a new decision model based on uncertain preference sequences. In this model, we first design a data processing method to get preference ordinal value in uncertain preference sequence, then compute the preference distance of each matching pair based on these certain preference ordinal values, set the optimal objectives as maximizing matching number and minimizing total sum of preference distances of all the matching pairs under the lowest threshold constraint of matching effect, and then solve it with branch-and-bound algorithm. Meanwhile, we take two numeral cases as examples and analyze the different matching solutions with one-norm distance, two-norm distance, and positive-infinity-norm distance, respectively. We also compare our decision model with two other approaches, and summarize their characteristics on two-sided matching.
Derivations of fractal models of city hierarchies using entropy-maximization principle
无
2002-01-01
A pair of models of fractal recursion on city hierarchy, fm=f1r1-mf and Pm=P1rm-1p, are derived using entropy-maximizing methods, and the relationship of inverse proportion between the number (fm) of cities at a given level of the urban hierarchy and the average population size (Pm) of the fm cities is established, i.e fm∝1/P. It is demonstrated that the underlying rationale of both the scale law of city rank-size distribution and the Zipf dimension value in standard state (dz=lnrp/lnrf=1) rests with maximization of information entropy of city hierarchies.
Sample evaluation of ontology-matching systems
Hage, W.R. van; Isaac, A.; Aleksovski, Z.
2007-01-01
Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on
Sample evaluation of ontology-matching systems
Hage, W.R. van; Isaac, A.; Aleksovski, Z.
2007-01-01
Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on
DEFICIENT CUBIC SPLINES WITH AVERAGE SLOPE MATCHING
V. B. Das; A. Kumar
2005-01-01
We obtain a deficient cubic spline function which matches the functions with certain area matching over a greater mesh intervals, and also provides a greater flexibility in replacing area matching as interpolation. We also study their convergence properties to the interpolating functions.
2010-04-01
... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Match credit. 92.221 Section 92.221... INVESTMENT PARTNERSHIPS PROGRAM Program Requirements Matching Contribution Requirement § 92.221 Match credit. (a) When credit is given. Contributions are credited on a fiscal year basis at the time the...
Connections between the matching and chromatic polynomials
E. J. Farrell
1992-01-01
Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
Concerns on Monotonic Imbalance Bounding Matching Methods
Yatracos, Yannis G.
2013-01-01
Concerns are expressed for the Monotonic Imbalance Bounding (MIB) property (Iacus et al. 2011) and for MIB matching because i) the definition of the MIB property leads to inconsistencies and the nature of the imbalance measure is not clearly defined, ii) MIB property does not generalize Equal Percent Bias Reducing (EPBR) property, iii) MIB matching does not provide statistical information available with EPBR matching.
13 CFR 130.450 - Matching funds.
2010-01-01
... in the budget proposal. Cash sources shall be identified by name and account. All applicants must... received by the SBDC during the budget period, as long as the total Cash Match provided by the SBDC is 50... to the total amount of SBA funding. At least 50% of the Matching Funds must be Cash Match....
13 CFR 102.40 - Computer matching.
2010-01-01
... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Computer matching. 102.40 Section... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer matching. The OCIO will enforce the computer matching provisions of the Privacy Act. The FOI/PA Office...
39 CFR 266.10 - Computer matching.
2010-07-01
... 39 Postal Service 1 2010-07-01 2010-07-01 false Computer matching. 266.10 Section 266.10 Postal... Computer matching. (a) General. Any agency or Postal Service component that wishes to use records from a... records must submit its proposal to the Postal Service Manager Records Office. Computer matching...
Catalan Number and Enumeration of Maximal Outerplanar Graphs
无
2000-01-01
Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means of the compressing graph and group theory method are given first. Then the relationships between Catalan numbers and the numbers of labeled and unlabeled maximal outerplanar graphs are presented. The computed results verified these formulas.
Maximality-Based Structural Operational Semantics for Petri Nets
Saīdouni, Djamel Eddine; Belala, Nabil; Bouneb, Messaouda
2009-03-01
The goal of this work is to exploit an implementable model, namely the maximality-based labeled transition system, which permits to express true-concurrency in a natural way without splitting actions on their start and end events. One can do this by giving a maximality-based structural operational semantics for the model of Place/Transition Petri nets in terms of maximality-based labeled transition systems structures.
Relative advantage, queue jumping, and welfare maximizing wealth distribution
2006-01-01
Suppose individuals get utilities from the total amount of wealth they hold and from their wealth relative to those immediately below them. This paper studies the distribution of wealth that maximizes an additive welfare function made up of these utilities. It interprets wealth distribution in a control theory framework to show that the welfare maximizing distribution may have unexpected properties. In some circumstances it requires that inequality be maximized at the poorest and richest ends...
Maximizers versus satisficers: Decision-making styles, competence, and outcomes
Parker, Andrew M.; Wändi Bruine de Bruin; Baruch Fischhoff
2007-01-01
Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al.\\ (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decision...
Maximally entangled states in pseudo-telepathy games
Mančinska, Laura
2015-01-01
A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangled states suffice. In particular, we show that maximally entangled states suffice for weak projection...
Between match variation in professional rugby league competition.
Kempton, Thomas; Sirotic, Anita C; Coutts, Aaron J
2014-07-01
To assess between match variability of physical performance measures over both the total and sub sections of the match in professional rugby league competition. Longitudinal observational study. Global positioning system (GPS) data were collected from 24 players from the same team competing in the National Rugby League (NRL) competition over 23 matches during 2011 season. The GPS data were categorised into total distance, high-speed running (>15kmh(-1)) and very high-speed running (>21kmh(-1)) distance for discrete reference periods (10min, 20min, 40min and 80min). The data was then log transformed to provide the coefficient of variation (CV) and the between subject standard deviation (both expressed as percentages). The data show that the between match variability is greater for high-speed (CV 14.6%) and very-high speed (CV 37.0%) running compared to total distance (CV 3.6%). Within each speed category, the variability of performance tended to increase as the duration of the reference period decreased. The results show that while global measures of physical performance such as total distance are relatively stable, higher-speed activities exhibit a large degree of between match variability. In addition, when segmenting the match into short periods of time for analysis, all physical performance measures increased in variability. These findings have implications for determining sample size, identifying reliable performance measures and selecting appropriate time periods for future applied studies that involve observational match analysis. Copyright © 2013 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.
A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs
Halappanavar, Mahantesh; Feo, John T.; Dempsey, Kathryn; Ali, Hesham; Bhowmick, Sanjukta
2012-10-25
Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the minimum fill-in, the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In this paper, we present a novel multithreaded algorithm to extract a maximal chordal subgraph from a general graph. Our algorithm is based on an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it. We implement our algorithm on two different multithreaded architectures – Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a testset of carefully generated synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies. We demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.
Local Stereo Matching Based on Information Entropy of Image
Geng, Yingnan
2016-09-01
Adaptive support-window algorithm is one of the simplest local algorithms for stereo matching. An important problem for adaptive support-window algorithm is to determine the appropriate support-window size, which is always hard to do and limits the validity of adaptive support-window algorithm. An appropriate support-window size must be selected adaptively based on image features. In this paper, information entropy of image is defined for stereo matching in the RGB vector space. Based on adaptive support-window, a new support-window selection algorithm, which uses information entropy of image to quantify image features such as illumination color and number of object contained in an image, is proposed. Experimental results evaluated on the Middlebury stereo benchmark show that our algorithm outperforms the conventional adaptive support-window algorithms.
Forst, Michael
2012-11-01
The shakeout in the solar cell and module industry is in full swing. While the number of companies and production locations shutting down in the Western world is increasing, the capacity expansion in the Far East seems to be unbroken. Size in combination with a good sales network has become the key to success for surviving in the current storm. The trade war with China already looming on the horizon is adding to the uncertainties. (orig.)
Sums of magnetic eigenvalues are maximal on rotationally symmetric domains
Laugesen, Richard S; Roy, Arindam
2011-01-01
The sum of the first n energy levels of the planar Laplacian with constant magnetic field of given total flux is shown to be maximal among triangles for the equilateral triangle, under normalization of the ratio (moment of inertia)/(area)^3 on the domain. The result holds for both Dirichlet and Neumann boundary conditions, with an analogue for Robin (or de Gennes) boundary conditions too. The square similarly maximizes the eigenvalue sum among parallelograms, and the disk maximizes among ellipses. More generally, a domain with rotational symmetry will maximize the magnetic eigenvalue sum among all linear images of that domain. These results are new even for the ground state energy (n=1).
Sums of Laplace eigenvalues - rotationally symmetric maximizers in the plane
Laugesen, R S
2010-01-01
The sum of the first $n \\geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio $\\text{(area)}^3/\\text{(moment of inertia)}$ for the domain is fixed. This result holds for both Dirichlet and Neumann eigenvalues, and similar conclusions are derived for Robin boundary conditions and Schr\\"odinger eigenvalues of potentials that grow at infinity. A key ingredient in the method is the tight frame property of the roots of unity. For general convex plane domains, the disk is conjectured to maximize sums of Neumann eigenvalues.
Astley, H C; Abbott, E M; Azizi, E; Marsh, R L; Roberts, T J
2013-11-01
Maximal performance is an essential metric for understanding many aspects of an organism's biology, but it can be difficult to determine because a measured maximum may reflect only a peak level of effort, not a physiological limit. We used a unique opportunity provided by a frog jumping contest to evaluate the validity of existing laboratory estimates of maximum jumping performance in bullfrogs (Rana catesbeiana). We recorded video of 3124 bullfrog jumps over the course of the 4-day contest at the Calaveras County Jumping Frog Jubilee, and determined jump distance from these images and a calibration of the jump arena. Frogs were divided into two groups: 'rental' frogs collected by fair organizers and jumped by the general public, and frogs collected and jumped by experienced, 'professional' teams. A total of 58% of recorded jumps surpassed the maximum jump distance in the literature (1.295 m), and the longest jump was 2.2 m. Compared with rental frogs, professionally jumped frogs jumped farther, and the distribution of jump distances for this group was skewed towards long jumps. Calculated muscular work, historical records and the skewed distribution of jump distances all suggest that the longest jumps represent the true performance limit for this species. Using resampling, we estimated the probability of observing a given jump distance for various sample sizes, showing that large sample sizes are required to detect rare maximal jumps. These results show the importance of sample size, animal motivation and physiological conditions for accurate maximal performance estimates.
Matching network for RF plasma source
Pickard, Daniel S.; Leung, Ka-Ngo
2007-11-20
A compact matching network couples an RF power supply to an RF antenna in a plasma generator. The simple and compact impedance matching network matches the plasma load to the impedance of a coaxial transmission line and the output impedance of an RF amplifier at radio frequencies. The matching network is formed of a resonantly tuned circuit formed of a variable capacitor and an inductor in a series resonance configuration, and a ferrite core transformer coupled to the resonantly tuned circuit. This matching network is compact enough to fit in existing compact focused ion beam systems.
Image matching navigation based on fuzzy information
田玉龙; 吴伟仁; 田金文; 柳健
2003-01-01
In conventional image matching methods, the image matching process is mostly based on image statistic information. One aspect neglected by all these methods is that there is much fuzzy information contained in these images. A new fuzzy matching algorithm based on fuzzy similarity for navigation is presented in this paper. Because the fuzzy theory is of the ability of making good description of the fuzzy information contained in images, the image matching method based on fuzzy similarity would look forward to producing good performance results. Experimental results using matching algorithm based on fuzzy information also demonstrate its reliability and practicability.
Effects of string stiffness on muscle fatigue after a simulated tennis match.
Fabre, Jean Bernard; Martin, Vincent; Borelli, Gil; Theurel, Jean; Grélot, Laurent
2014-06-01
We tested the influence of string stiffness on the occurrence of forearm muscle fatigue during a tennis match. Sixteen tennis players performed two prolonged simulated tennis matches with low-stiffness or high-stiffness string. Before and immediately after exercise, muscle fatigability was evaluated on the forearm muscles during a maximal intermittent gripping task. Groundstroke ball speeds and the profile of acceleration of the racquet frame at collision were recorded during each match. The peak-to-peak amplitude of acceleration and the resonant frequency of the frame were significantly greater with high- (5060 ± 1892 m/s(2) and 204 ± 29 Hz, respectively) than with low-stiffness string (4704 ± 1671 m/s(2) and 191 ± 16 Hz, respectively). The maximal and the averaged gripping forces developed during the gripping task were significantly reduced after the tennis match with high- (-15 ± 14%, and -22 ± 14%, respectively), but not with low-stiffness string. The decrease of ball speed during the simulated matches tended to be greater with high- than with low-stiffness string (P = .06). Hence, playing tennis with high-stiffness string promotes forearm muscle fatigue development, which could partly contribute to the groundstroke ball speed decrement during the game.
Matching roots to their environment.
White, Philip J; George, Timothy S; Gregory, Peter J; Bengough, A Glyn; Hallett, Paul D; McKenzie, Blair M
2013-07-01
Plants form the base of the terrestrial food chain and provide medicines, fuel, fibre and industrial materials to humans. Vascular land plants rely on their roots to acquire the water and mineral elements necessary for their survival in nature or their yield and nutritional quality in agriculture. Major biogeochemical fluxes of all elements occur through plant roots, and the roots of agricultural crops have a significant role to play in soil sustainability, carbon sequestration, reducing emissions of greenhouse gasses, and in preventing the eutrophication of water bodies associated with the application of mineral fertilizers. This article provides the context for a Special Issue of Annals of Botany on 'Matching Roots to Their Environment'. It first examines how land plants and their roots evolved, describes how the ecology of roots and their rhizospheres contributes to the acquisition of soil resources, and discusses the influence of plant roots on biogeochemical cycles. It then describes the role of roots in overcoming the constraints to crop production imposed by hostile or infertile soils, illustrates root phenotypes that improve the acquisition of mineral elements and water, and discusses high-throughput methods to screen for these traits in the laboratory, glasshouse and field. Finally, it considers whether knowledge of adaptations improving the acquisition of resources in natural environments can be used to develop root systems for sustainable agriculture in the future.
Towards Robust Image Matching Algorithms
Parsons, Timothy J.
1984-12-01
The rapid advance in digital electronics during recent years has enabled the real-time hardware implementation of many basic image processing techniques and these methods are finding increasing use in both commercial and military applications where a superiority to existing systems can be demonstrated. The potential superiority of an entirely passive, automatic image processing based navigation system over the less accurate and active navigation systems based on radar, for example "TERCOM", is evident. By placing a sensor on board an aircraft or missile together with the appropriate processing power and enough memory to store a reference image or a map of the planned route, large scale features extracted from the scene available to the sensor can be compared with the same feature stored in memory. The difference between the aircraft's actual position and its desired position can then be evaluated and the appropriate navigational correction undertaken. This paper summaries work carried out at British Aerospace Hatfield to investigate various classes of algorithms and solutions which would render a robust image matching system viable for such an automatic system flying at low level with a thermal I.R. sensor.
Orthogonal Matching Pursuit with Replacement
Jain, Prateek; Dhillon, Inderjit S
2011-01-01
In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of the family yields well known hard thresholding algorithms like ITI (Iterative Thresholding with Inversion) and HTP (Hard Thresholding Pursuit), the other end of the spectrum leads to a novel algorithm that we call Orthogonal Matching Pursuit with Replacement (OMPR). OMPR, like the classic greedy algorithm OMP, adds exactly one coordinate to the support at each iteration, based on the correlation with the current residual. However, unlike OMP, OMPR also removes one coordinate from the support. This simple change allows us to prove that OMPR has the best known guarantees for sparse recovery in terms of the Restricted Isometry Property (a condition on the measurement matrix). In contrast, OMP is kn...
Maximum Matchings via Glauber Dynamics
Jindal, Anant; Pal, Manjish
2011-01-01
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs $G = (V, E)$. The best known algorithm for this problem till date runs in $O(m \\sqrt{n})$ time due to Micali and Vazirani \\cite{MV80}. Even for general bipartite graphs this is the best known running time (the algorithm of Karp and Hopcroft \\cite{HK73} also achieves this bound). For regular bipartite graphs one can achieve an $O(m)$ time algorithm which, following a series of papers, has been recently improved to $O(n \\log n)$ by Goel, Kapralov and Khanna (STOC 2010) \\cite{GKK10}. In this paper we present a randomized algorithm based on the Markov Chain Monte Carlo paradigm which runs in $O(m \\log^2 n)$ time, thereby obtaining a significant improvement over \\cite{MV80}. We use a Markov chain similar to the \\emph{hard-core model} for Glauber Dynamics with \\emph{fugacity} parameter $\\lambda$, which is used to sample independent sets in a graph from the Gibbs Distribution \\cite{V99}, to design a faster algori...
Holography and Conformal Anomaly Matching
Cabo-Bizet, Alejandro; Narain, K S
2013-01-01
We discuss various issues related to the understanding of the conformal anomaly matching in CFT from the dual holographic viewpoint. First, we act with a PBH diffeomorphism on a generic 5D RG flow geometry and show that the corresponding on-shell bulk action reproduces the Wess-Zumino term for the dilaton of broken conformal symmetry, with the expected coefficient aUV-aIR. Then we consider a specific 3D example of RG flow whose UV asymptotics is normalizable and admits a 6D lifting. We promote a modulus \\rho appearing in the geometry to a function of boundary coordinates. In a 6D description {\\rho} is the scale of an SU(2) instanton. We determine the smooth deformed background up to second order in the space-time derivatives of \\rho and find that the 3D on-shell action reproduces a boundary kinetic term for the massless field \\tau= log(\\rho) with the correct coefficient \\delta c=cUV-cIR. We further analyze the linearized fluctuations around the deformed background geometry and compute the one-point functions ...
Voice Matching Using Genetic Algorithm
Abhishek Bal
2014-03-01
Full Text Available In this paper, the use of Genetic Algorithm (GA for voice recognition is described. The practical application of Genetic Algorithm (GA to the solution of engineering problem is a rapidly emerging approach in the field of control engineering and signal processing. Genetic algorithms are useful for searching a space in multi-directional way from large spaces and poorly defined space. Voice is a signal of infinite information. Digital processing of voice signal is very important for automatic voice recognition technology. Nowadays, voice processing is very much important in security mechanism due to mimicry characteristic. So studying the voice feature extraction in voice processing is very necessary in military, hospital, telephone system, investigation bureau and etc. In order to extract valuable information from the voice signal, make decisions on the process, and obtain results, the data needs to be manipulated and analyzed. In this paper, if the instant voice is not matched with same person’s reference voices in the database, then Genetic Algorithm (GA is applied between two randomly chosen reference voices. Again the instant voice is compared with the result of Genetic Algorithm (GA which is used, including its three main steps: selection, crossover and mutation. We illustrate our approach with different sample of voices from human in our institution.
Impedance matching at arterial bifurcations.
Brown, N
1993-01-01
Reflections of pulse waves will occur in arterial bifurcations unless the impedance is matched continuously through changing geometric and elastic properties. A theoretical model is presented which minimizes pulse wave reflection through bifurcations. The model accounts for the observed linear changes in area within the bifurcation, generalizes the theory to asymmetrical bifurcations, characterizes changes in elastic properties from parent to daughter arteries, and assesses the effect of branch angle on the mechanical properties of daughter vessels. In contradistinction to previous models, reflections cannot be minimized without changes in elastic properties through bifurcations. The theoretical model predicts that in bifurcations with area ratios (beta) less than 1.0 Young's moduli of daughter vessels may be less than that in the parent vessel if the Womersley parameter alpha in the parent vessel is less than 5. Larger area ratios in bifurcations are accompanied by greater increases in Young's moduli of branches. For an idealized symmetric aortic bifurcation (alpha = 10) with branching angles theta = 30 degrees (opening angle 60 degrees) Young's modulus of common iliac arteries relative to that of the distal abdominal aorta has an increase of 1.05, 1.68 and 2.25 for area ratio of 0.8, 1.0 and 1.15, respectively. These predictions are consistent with the observed increases in Young's moduli of peripheral vessels.(ABSTRACT TRUNCATED AT 250 WORDS)
Explicit pattern matching assignment algorithm
Levedahl, Mark
2002-08-01
Sharing data between two tracking systems frequently involves use of an object map: the transmitting system sends a frame of data with multiple observations, and the receiving system uses an assignment algorithm to correlate the information with its local observation data base. The usual prescription for this problem is an optimal assignment algorithm (such as JVC or auction) using a cost matrix based upon chi-squared distances between the local and remote observation data. The optimal assignment algorithm does not actually perform pattern matching, so this approach is not robust to large registration errors between the two systems when there exist differences in the number of observations held by both systems. Performance of a new assignment algorithm that uses a cost function including terms for both registration errors and track to track random errors is presented: the cost function explicitly includes a bias between the two observation sets and thus provides a maximum likelihood solution to the assignment problem. In practice, this assignment approach provides near perfect assignment accuracy in cases where the bias errors exceed the dimension of the transmitted object map and there exist mismatches in the numbers of observations made by the two systems. This performance extends to many cases where the optimal assignment algorithm methodology produces errors nearly 100% of the time. The paper includes the theoretical foundation of the assignment problem solved and comparison of achieved accuracy with existing optimal assignment approaches.
Activity and recovery profiles of state-of-origin and national rugby league match-play.
Gabbett, Tim J
2015-03-01
State-of-Origin is the highest standard of rugby league competition played anywhere in the world. This study investigated the activity profiles of State-of-Origin and compared them against regular National Rugby League (NRL) fixture matches. Video footage from State-of-Origin and NRL matches were coded for activity and recovery cycles. Time when the ball was continuously in play was considered activity, whereas any stoppages during matches were considered recovery. Ball-in-play periods in matches of different playing standards were analyzed by comparing State-of-Origin matches, NRL matches (with representative players available), and NRL matches (with representative players unavailable). The mean, maximum, and total ball-in-play time of State-of-Origin matches were longer than NRL matches (effect size [ES] ≥ 0.75) with and without the availability of representative players. State-of-Origin matches were associated with a greater proportion (ES ≥ 1.54) of long duration (46-300 seconds) ball-in-play periods, and a smaller proportion (ES ≥ 1.69) of short duration (rugby league players to perform prolonged passages of high-intensity exercise during match-play.
Best Practices for NPT Transit Matching
Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)
2016-09-01
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity s experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
Best Practices for NPT Transit Matching
Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)
2016-09-01
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
Activity cycles of National Rugby League and National Youth Competition matches.
Gabbett, Tim J
2012-06-01
Examination of ball-in-play periods (i.e., match activity cycles) is a method used to provide insight into the physical demands of team sport competition. However, to date, no study has investigated the ball-in-play time of rugby league matches. This study investigated the activity cycles (i.e., ball-in-play periods) of elite National Rugby League (NRL) and National Youth Competition (NYC) matches. Video recordings of 393 NRL matches and 388 NYC matches were coded for activity and recovery cycles. Time when the ball was continuously in play was considered activity, whereas any stoppages during the match (e.g., for scrums, penalties, line drop-outs, tries, and video referee decisions) were considered recovery. The total time the ball was in play for NRL and NYC matches was approximately 55 minutes and 50 minutes, respectively. In comparison with NYC matches, NRL matches had longer average activity cycles (81.2 ± 16.1 vs. 72.0 ± 14.7 seconds, effect size [ES] = 0.60). The average longest activity cycle was also higher (ES = 0.48) in NRL (318.3 ± 65.4 seconds) than in NYC (288.9 ± 57.5 seconds) matches. The longest activity cycle from any match was 667 and 701 seconds for NRL and NYC matches, respectively. The NRL matches had a smaller proportion of short duration (91-600 seconds) activity cycles. In conclusion, meaningful differences in activity cycles were observed between NRL and NYC matches, with NRL competition demonstrating longer ball-in-play periods, a smaller proportion of short duration activity cycles, and a larger proportion of longer duration activity cycles. These findings suggest that the ability to perform prolonged high-intensity exercise, coupled with the capacity to recover during brief stoppages in play, is a critical requirement of professional rugby league match play.