全文获取类型
收费全文 | 351篇 |
免费 | 15篇 |
专业分类
化学 | 239篇 |
晶体学 | 2篇 |
力学 | 4篇 |
数学 | 51篇 |
物理学 | 54篇 |
无线电 | 16篇 |
出版年
2023年 | 1篇 |
2022年 | 6篇 |
2021年 | 10篇 |
2020年 | 10篇 |
2019年 | 12篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 11篇 |
2015年 | 14篇 |
2014年 | 20篇 |
2013年 | 34篇 |
2012年 | 16篇 |
2011年 | 23篇 |
2010年 | 18篇 |
2009年 | 15篇 |
2008年 | 21篇 |
2007年 | 33篇 |
2006年 | 23篇 |
2005年 | 25篇 |
2004年 | 25篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1995年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有366条查询结果,搜索用时 15 毫秒
31.
Austin Buchanan Jose L. Walteros Sergiy Butenko Panos M. Pardalos 《Optimization Letters》2014,8(5):1611-1617
We describe an algorithm for the maximum clique problem that is parameterized by the graph’s degeneracy \(d\) . The algorithm runs in \(O\left( nm+n T_d \right) \) time, where \(T_d\) is the time to solve the maximum clique problem in an arbitrary graph on \(d\) vertices. The best bound as of now is \(T_d=O(2^{d/4})\) by Robson. This shows that the maximum clique problem is solvable in \(O(nm)\) time in graphs for which \(d \le 4 \log _2 m + O(1)\) . The analysis of the algorithm’s runtime is simple; the algorithm is easy to implement when given a subroutine for solving maximum clique in small graphs; it is easy to parallelize. In the case of Bianconi-Marsili power-law random graphs, it runs in \(2^{O(\sqrt{n})}\) time with high probability. We extend the approach for a graph invariant based on common neighbors, generating a second algorithm that has a smaller exponent at the cost of a larger polynomial factor. 相似文献
32.
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations 总被引:1,自引:0,他引:1
Svyatoslav Trukhanov Chitra Balasubramaniam Balabhaskar Balasundaram Sergiy Butenko 《Computational Optimization and Applications》2013,56(1):113-130
Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable. This paper proposes a general purpose exact algorithmic framework to solve this problem and investigates key algorithm design and implementation issues that are helpful in tailoring the general framework for specific graph properties. The performance of the algorithms so derived for the maximum s-plex and the maximum s-defective clique problems, which arise in network-based data mining applications, is assessed through a computational study. 相似文献
33.
Kyoung-Soon Jang Roger R. Nani Anastasia Kalli Sergiy Levin Axel Müller Sonja Hess Sarah E. Reisman William M. ClemonsJr. 《Analytical and bioanalytical chemistry》2015,407(20):6181-6190
In Campylobacterales and related ε-proteobacteria with N-linked glycosylation (NLG) pathways, free oligosaccharides (fOS) are released into the periplasmic space from lipid-linked precursors by the bacterial oligosaccharyltransferase (PglB). This hydrolysis results in the same molecular structure as the oligosaccharide that is transferred to a protein to be glycosylated. This allowed for the general elucidation of the fOS-branched structures and monosaccharides from a number of species using standard enrichment and mass spectrometry methods. To aid characterization of fOS, hydrazide chemistry has often been used for chemical modification of the reducing part of oligosaccharides resulting in better selectivity and sensitivity in mass spectrometry; however, the removal of the unreacted reagents used for the modification often causes the loss of the sample. Here, we develop a more robust method for fOS purification and characterize glycostructures using complementary tandem mass spectrometry (MS/MS) analysis. A cationic cysteine hydrazide derivative was synthesized to selectively isolate fOS from periplasmic fractions of bacteria. The cysteine hydrazide nicotinamide (Cyhn) probe possesses both thiol and cationic moieties. The former enables reversible conjugation to a thiol-activated solid support, while the latter improves the ionization signal during MS analysis. This enrichment was validated on the well-studied Campylobacter jejuni by identifying fOS from the periplasmic extracts. Using complementary MS/MS analysis, we approximated data of a known structure of the fOS from Campylobacter concisus. This versatile enrichment technique allows for the exploration of a diversity of protein glycosylation pathways. 相似文献
34.
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of “cooperative graph cuts”, for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically. 相似文献
35.
Alexander B. Rozhenko Sergiy S. Mykhaylychenko Nadiya V. Pikun Yuriy G. Shermolovich Jerzy Leszczynski 《International journal of quantum chemistry》2014,114(4):241-248
The reactions of perfluoroalkyl thioamides with trimethyl phosphine, trimethyl phosphite, and tris(dimethylamino)phosphine have been analyzed by means of quantum chemical (DFT and MP2) calculations. The reaction seems to proceed via the nucleophilic attack of the electrophilic carbon atom by the phosphorus lone pair with the formation of cyclic or acyclic adducts. The latter releases the thiophosphate molecule forming perfluoroalkylaminocarbene as the short‐lived intermediate. The reaction of the carbene with the second molecule of trialkyl phosphite yields phosphorus ylide. The ylide undergoes a migration of fluorine from carbon to phosphorus. The reactions of perfluoroalkyl thioamides with phosphines and tris(dimethylamino)phosphine probably proceeds differently. Using alkyl thioamides or amides instead of perfluoroalkyl thioamides also makes the reaction less favorable. The only combination of perfluoroalkyl thioamides with trialkyl phosphite fulfills both the kinetic requirements (moderate activation energies and relative energies for intermediates) and the thermodynamic aspects (higher stabilities of the reaction products compared with the starting materials). © 2013 Wiley Periodicals, Inc. 相似文献
36.
In this work we report very accurate variational calculations of the complete pure vibrational spectrum of the D(2) molecule performed within the framework where the Born-Oppenheimer (BO) approximation is not assumed. After the elimination of the center-of-mass motion, D(2) becomes a three-particle problem in this framework. As the considered states correspond to the zero total angular momentum, their wave functions are expanded in terms of all-particle, one-center, spherically symmetric explicitly correlated Gaussian functions multiplied by even non-negative powers of the internuclear distance. The nonrelativistic energies of the states obtained in the non-BO calculations are corrected for the relativistic effects of the order of α(2) (where α = 1/c is the fine structure constant) calculated as expectation values of the operators representing these effects. 相似文献
37.
An algorithm for the variational calculation of atomic D states employing n-electron explicitly correlated gaussians is developed and implemented. The algorithm includes formulas for the first derivatives of the hamiltonian and overlap matrix elements determined with respect to the gaussian nonlinear exponential parameters. The derivatives are used to form the energy gradient which is employed in the variational energy minimization. The algorithm is tested in the calculations of the two lowest D states of the lithium and beryllium atoms. For the lowest D state of Li the present result is lower than the best previously reported result. 相似文献
38.
39.
Reconfigurable Anisotropic Coatings via Magnetic Field‐Directed Assembly and Translocation of Locking Magnetic Chains 下载免费PDF全文
Alexander Tokarev Yu Gu Andrey Zakharchenko Oleksandr Trotsenko Igor Luzinov Konstantin G. Kornev Sergiy Minko 《Advanced functional materials》2014,24(30):4738-4745
A method for the generation of remotely reconfigurable anisotropic coatings is developed. To form these coatings, locking magnetic nanoparticles (LMNPs) made of a superparamagnetic core and a two‐component polymer shell are employed. Two different polymers form phase‐separated coaxial shells. The outer shell provides repulsive interactions between the LMNPs while the inner shell exerts attractive forces between the particles. Applying a non‐uniform magnetic field, one gathers the particles together, pushing them to come in contact when the internal shells could effectively hold the particles together. When the magnetic field is turned off, the particles remain locked due to these strong interactions between internal shells. The shells are thus made stimuli‐responsive, so this locking can be made reversible and the chains can be disintegrated on demand. In a non‐uniform magnetic field, the assembled chains translocate, bind to the solid substrate and form anisotropic coatings with a “locked” anisotropic structure. The coatings can be constructed, aligned, realigned, degraded, and generated again on demand by changing the magnetic field and particle environment. The mechanism of the coating formation is explained using experimental observations and a theoretical model. 相似文献
40.
Optimal Security Liquidation Algorithms 总被引:1,自引:0,他引:1
Sergiy Butenko Alexander Golodnikov Stanislav Uryasev 《Computational Optimization and Applications》2005,32(1-2):9-27
This paper develops trading strategies for liquidation of a financial security, which maximize the expected return. The problem is formulated as a stochastic programming problem that utilizes the scenario representation of possible returns. Two cases are considered, a case with no constraint on risk and a case when the risk of losses associated with trading strategy is constrained by Conditional Value-at-Risk (CVaR) measure. In the first case, two algorithms are proposed; one is based on linear programming techniques, and the other uses dynamic programming to solve the formulated stochastic program. The third proposed algorithm is obtained by adding the risk constraints to the linear program. The algorithms provide path-dependent strategies, i.e., the fraction of security sold depends upon price sample-path of the security up to the current moment. The performance of the considered approaches is tested using a set of historical sample-paths of prices. 相似文献