全文获取类型
收费全文 | 211篇 |
免费 | 3篇 |
专业分类
管理学 | 36篇 |
民族学 | 2篇 |
人口学 | 11篇 |
丛书文集 | 1篇 |
理论方法论 | 23篇 |
综合类 | 6篇 |
社会学 | 102篇 |
统计学 | 33篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 9篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 8篇 |
2016年 | 8篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 29篇 |
2012年 | 16篇 |
2011年 | 9篇 |
2010年 | 12篇 |
2009年 | 16篇 |
2008年 | 4篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1973年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有214条查询结果,搜索用时 15 毫秒
1.
Nicolas Roinsard 《Sociologie du Travail》2006,48(2):159
Against a background of mass unemployment and the increasing precariousness of employment, the current changes in the labour market demand that we examine the previously central role of paid employment in social integration. If the individual now deprived of employment or having a temporary contract is by dint of this fact less included in society or is less secure by not having a permanent salary, is it to say that he embodies the face of the de-affiliated, of those who miss out on social benefits? Taking the example of the Reunion Island which has the highest level of unemployment and population covered by the minimum income (RMI: Revenu Minimum d'Insertion) in the country, this article endeavours to explain and understand how, in the context of a protective society and increasingly flexible employment market, new methods of social integration without and resulting from paid employment are being formed. 相似文献
2.
Binod Khadria Narender Thakur Imelda Nicolas Takgon Lee Jigmin Yang Ychen Jang 《International migration (Geneva, Switzerland)》2019,57(6):286-302
This article focuses on the Global Compact for Safe, Orderly and Regular Migration (GCM), a landmark international document that builds on the momentum of a decade of initiatives at the international level on migration governance, and its impact on Asia from the perspective of South Asia, Southeast Asia, China, and South Korea. While none of these countries voted against the adoption of the GCM, there are significant differences in how individual countries approached the commitments made in the GCM. These perspectives were articulated in a webinar hosted by Metropolis Asia on 20 June 2018 and in governmental statements made at the UN international conference when the GCM was adopted. This article also discusses the challenges confronting the implementation of the GCM. While the Compact resulted from inclusive and intensive negotiations and many compromises, the road towards realizing its goals will be at least as challenging as the road that led to its adoption. In spite of these challenges, the GCM is a ground‐breaking representation of the first multilateral framework for migration governance. Its success rests upon the recognition that addressing the challenges and maximizing the benefits of migration require true international cooperation, renewed commitment and meaningful action on the commitments agreed to. 相似文献
3.
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g. in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure and the complexity of certain combinatorial problems resulting from considerations based on symbolic ultrametrics, and on algorithms to solve them.This includes, the characterization of symbolic ultrametrics that additionally distinguishes between edges and non-edges of arbitrary edge-colored graphs G and thus, yielding a tree representation of G, by means of so-called cographs. Moreover, we address the problem of finding “closest” symbolic ultrametrics and show the NP-completeness of the three problems: symbolic ultrametric editing, completion and deletion. Finally, as not all graphs are cographs, and hence, do not have a tree representation, we ask, furthermore, what is the minimum number of cotrees needed to represent the topology of an arbitrary non-cograph G. This is equivalent to find an optimal cograph edge k-decomposition \(\{E_1,\dots ,E_k\}\) of E so that each subgraph \((V,E_i)\) of G is a cograph. We investigate this problem in full detail, resulting in several new open problems, and NP-hardness results.For all optimization problems proven to be NP-hard we will provide integer linear program formulations to solve them. 相似文献
4.
Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations 总被引:7,自引:0,他引:7
Håvard Rue Sara Martino Nicolas Chopin 《Journal of the Royal Statistical Society. Series B, Statistical methodology》2009,71(2):319-392
Summary. Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive regression models, latent Gaussian models , where the latent field is Gaussian, controlled by a few hyperparameters and with non-Gaussian response variables. The posterior marginals are not available in closed form owing to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, in terms of both convergence and computational time. In some practical applications, the extent of these problems is such that Markov chain Monte Carlo sampling is simply not an appropriate tool for routine analysis. We show that, by using an integrated nested Laplace approximation and its simplified version, we can directly compute very accurate approximations to the posterior marginals. The main benefit of these approximations is computational: where Markov chain Monte Carlo algorithms need hours or days to run, our approximations provide more precise estimates in seconds or minutes. Another advantage with our approach is its generality, which makes it possible to perform Bayesian analysis in an automatic, streamlined way, and to compute model comparison criteria and various predictive measures so that models can be compared and the model under study can be challenged. 相似文献
5.
The positive association between moderate alcohol consumption and wages is well documented in the economic literature. Positive
health effects as well as networking mechanisms serve as explanations for the “alcohol–income puzzle.” Using individual-based
microdata from the SOEP for 2006, we confirm that this relationship exists for Germany as well. More importantly, we shed
light on the alcohol–income puzzle by analyzing, for the first time, the association between beverage-specific drinking behavior
and wages. In our analysis, we disentangle the general wage effect of drinking into diverse effects for different types of
drinkers. Mincerian estimates reveal significant and positive relationships between wine drinkers and wages as well as between
multiple beverage drinkers and wages. When splitting the sample into age groups, the “drinking gain” disappears for employees
under the age of 35 and increases in size and significance for higher age groups. We also find a “beer gain” for the oldest
age group and male residents of rural areas as well as a “cocktail gain” for residents of urban areas. Several explanations
for our empirical results are discussed in view of the likelihood that the alcohol–income puzzle is a multicausal phenomenon.
相似文献
Markus M. GrabkaEmail: |
6.
For an integer \(k \ge 1\), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V(G) is at distance at most k from some vertex of S. The distance k-domination number \(\gamma _k(G)\) of G is the minimum cardinality of a distance k-dominating set of G. In this paper, we establish an upper bound on the distance k-domination number of a graph in terms of its order, minimum degree and maximum degree. We prove that for \(k \ge 2\), if G is a connected graph with minimum degree \(\delta \ge 2\) and maximum degree \(\Delta \) and of order \(n \ge \Delta + k - 1\), then \(\gamma _k(G) \le \frac{n + \delta - \Delta }{\delta + k - 1}\). This result improves existing known results. 相似文献
7.
Nicolas Souchon Andrew G. Livingstone Brigitte Bardin Olivier Rascle Geneviève Cabagno Gregory R. Maio 《Social Influence》2016,11(4):246-258
The influence of competition level on referees’ decision-making was investigated. Referees’ decisions in 90 handball games (30 games X 3 competition levels) were observed in different situations related to the advantage rule, and 100 referees from two different levels of expertise were subsequently asked to offer explanations for the competition-level effects from the first part of the study. Results revealed that at the highest level of competition referees intervened less frequently with sporting sanctions, but more frequently with disciplinary sanctions. These effects were apparent mainly in immediate intervention situations and unsuccessful advantage situations, but not in successful situations. Referees explained these effects of competition level in terms of a player competence stereotype, in addition to referees’ different expertise across competition level. The implications of the findings for understanding how status-related stereotypes impact on intervention behavior are discussed. 相似文献
8.
Current models of driving behavior and designs of driver support systems are not taking adequately into account the interactions between drivers. Although a driver's intended maneuver may not be physically possible at a specific time point, it may still be safely executed if the driver's intention is successfully communicated to and interpreted by another driver, who alters the own future trajectory so as to enable the maneuver execution. This paper presents some empirical findings relevant to communicative and cooperative interactions between drivers along naturalistic overtaking maneuvers on an undivided road. The cues used by drivers to interpret other drivers' intention and the drivers' interactions were extracted through video observations of the maneuvers together with the frequency of such interactions per level of traffic risk. The findings show that drivers use formal and informal cues to anticipate other drivers' intention. A significant percentage of maneuvers were performed after facilitation by other drivers. Future studies should focus on this phenomenon while future models of driving behavior should incorporate communicative and cooperative interactions among drivers, so as to design adequate cooperative support systems to enhance road safety. 相似文献
9.
Houy Nicolas 《Social Choice and Welfare》2009,33(4):691-698
We show the necessary and sufficient conditions for any two of the sets of stable, generalized stable, absorbing or admissible
sets of an abstract decision problem to coincide. We show that all these conditions can be written as depending only on the
number of predecessors or successors of some alternatives. 相似文献
10.
Nicolas W. Hengartner Marten H. Wegkamp Eric Matzner-Løber 《Journal of the Royal Statistical Society. Series B, Statistical methodology》2002,64(4):791-804
Summary. The paper presents a general strategy for selecting the bandwidth of nonparametric regression estimators and specializes it to local linear regression smoothers. The procedure requires the sample to be divided into a training sample and a testing sample. Using the training sample we first compute a family of regression smoothers indexed by their bandwidths. Next we select the bandwidth by minimizing the empirical quadratic prediction error on the testing sample. The resulting bandwidth satisfies a finite sample oracle inequality which holds for all bounded regression functions. This permits asymptotically optimal estimation for nearly any regression function. The practical performance of the method is illustrated by a simulation study which shows good finite sample behaviour of our method compared with other bandwidth selection procedures. 相似文献