Search results for "etica"
showing 10 items of 14083 documents
Organocatalytic Oxa-Michael/Michael/Michael/Aldol Condensation Quadruple Domino Sequence : Asymmetric Synthesis of Tricyclic Chromanes
2018
An efficient and highly stereoselective one-pot, four-component synthesis of functionalized tricyclic chromanes has been achieved through an organocatalyzed quadruple domino reaction. The reaction sequence involves an oxa-Michael/Michael/Michael/aldol condensation between alcohols, 2 equiv of acrolein, and nitrochromenes to generate the pharmaceutically important tricyclic chromanes bearing three contiguous stereogenic centers including a chiral tetrasubstituted carbon center in good domino yields (30–70%) and excellent diastereo- and enantioselectivities (>20:1 dr and >99% ee). peerReviewed
Trzy poziomy struktur i kompozycja w wyroczniach przeciw Egiptowi Księga Ezechiela rozdziały 29–32 w świetle retoryki hebrajskiej
2022
Kontekstem badań było to, że różni komentatorzy Księgi Ezechiela proponują różniące się między sobą struktury badanych tekstów. Większość z nich pracowała (nadal pracuje) metodami diachronicznymi. Zazwyczaj ci autorzy układają wersy w grupy i tym grupom nadają tytuły. Dlatego celem badań stało się odkrycie struktur opartych o wersy tekstu biblijnego. Można wtedy wskazać konkretne wersy (lub ich części, człony), których użył starożytny autor natchniony. Dlatego zastosowano metodę biblijnej retoryki hebrajskiej, która ma 3 etapy: analizę oddolną, analizę odgórną oraz interpretację teologiczną. W wyniku przeprowadzonych badań na pierwszych dwóch etapach odkryto, że teksty wyroczni przeciw Egip…
A Cooperative Coevolution Framework for Parallel Learning to Rank
2015
We propose CCRank, the first parallel framework for learning to rank based on evolutionary algorithms (EA), aiming to significantly improve learning efficiency while maintaining accuracy. CCRank is based on cooperative coevolution (CC), a divide-and-conquer framework that has demonstrated high promise in function optimization for problems with large search space and complex structures. Moreover, CC naturally allows parallelization of sub-solutions to the decomposed sub-problems, which can substantially boost learning efficiency. With CCRank, we investigate parallel CC in the context of learning to rank. We implement CCRank with three EA-based learning to rank algorithms for demonstration. E…
A novel heuristic memetic clustering algorithm
2013
In this paper we introduce a novel clustering algorithm based on the Memetic Algorithm meta-heuristic wherein clusters are iteratively evolved using a novel single operator employing a combination of heuristics. Several heuristics are described and employed for the three types of selections used in the operator. The algorithm was exhaustively tested on three benchmark problems and compared to a classical clustering algorithm (k-Medoids) using the same performance metrics. The results show that our clustering algorithm consistently provides better clustering solutions with less computational effort.
A Hybrid Multigroup Coclustering Recommendation Framework Based on Information Fusion
2015
Collaborative Filtering (CF) is one of the most successful algorithms in recommender systems. However, it suffers from data sparsity and scalability problems. Although many clustering techniques have been incorporated to alleviate these two problems, most of them fail to achieve further significant improvement in recommendation accuracy. First of all, most of them assume each user or item belongs to a single cluster. Since usually users can hold multiple interests and items may belong to multiple categories, it is more reasonable to assume that users and items can join multiple clusters (groups), where each cluster is a subset of like-minded users and items they prefer. Furthermore, most of…
Reduced Order Models for Pricing European and American Options under Stochastic Volatility and Jump-Diffusion Models
2017
Abstract European options can be priced by solving parabolic partial(-integro) differential equations under stochastic volatility and jump-diffusion models like the Heston, Merton, and Bates models. American option prices can be obtained by solving linear complementary problems (LCPs) with the same operators. A finite difference discretization leads to a so-called full order model (FOM). Reduced order models (ROMs) are derived employing proper orthogonal decomposition (POD). The early exercise constraint of American options is enforced by a penalty on subset of grid points. The presented numerical experiments demonstrate that pricing with ROMs can be orders of magnitude faster within a give…
Scalable Hierarchical Clustering: Twister Tries with a Posteriori Trie Elimination
2015
Exact methods for Agglomerative Hierarchical Clustering (AHC) with average linkage do not scale well when the number of items to be clustered is large. The best known algorithms are characterized by quadratic complexity. This is a generally accepted fact and cannot be improved without using specifics of certain metric spaces. Twister tries is an algorithm that produces a dendrogram (i.e., Outcome of a hierarchical clustering) which resembles the one produced by AHC, while only needing linear space and time. However, twister tries are sensitive to rare, but still possible, hash evaluations. These might have a disastrous effect on the final outcome. We propose the use of a metaheuristic algor…
Context–content systems of random variables : The Contextuality-by-Default theory
2016
Abstract This paper provides a systematic yet accessible presentation of the Contextuality-by-Default theory. The consideration is confined to finite systems of categorical random variables, which allows us to focus on the basics of the theory without using full-scale measure-theoretic language. Contextuality-by-Default is a theory of random variables identified by their contents and their contexts, so that two variables have a joint distribution if and only if they share a context. Intuitively, the content of a random variable is the entity the random variable measures or responds to, while the context is formed by the conditions under which these measurements or responses are obtained. A …
Can back-projection fully resolve polarity indeterminacy of independent component analysis in study of event-related potential?
2011
a b s t r a c t In the study of event-related potentials (ERPs) using independent component analysis (ICA), it is a traditional way to project the extracted ERP component back to electrodes for correcting its scaling (magnitude and polarity) indeterminacy. However, ICA tends to be locally optimized in practice, and then, the back-projection of a component estimated by the ICA can possibly not fully correct its polarity at every electrode. We demonstrate this phenomenon from the view of the theoretical analysis and numerical simulations and suggest checking and modifying the abnormal polarity of the projected component in the electrode field before further analysis. Moreover, when several co…
High-precision measurement of the mass difference between 102Pd and 102Ru
2019
Abstract The Q-value for the neutrinoless double electron capture on 102Pd, Qϵϵ(102Pd), is determined as the atomic mass difference between 102Pd and 102Ru. A precise measurement of the Qϵϵ(102Pd) at the SHIPTRAP Penning trap showed a more than 10σ deviation to the adopted Atomic Mass Evaluation (AME) value. The reliability of the SHIPTRAP measurement was challenged because the AME value was based on numerous experiments including β and electron capture decays and very precise (n, γ) data, all agreeing with each other. To solve the discrepancy, the Qϵϵ(102Pd) has now been determined with the JYFLTRAP Penning trap at the IGISOL facility in the Accelerator Laboratory of the University of Jyva…