Gedanken zur Gestaltung einer professionellen Beratungsausbildung

Considerations on the design of a professional education of counselorsSome of the recently published articles about supervision-professionalizing are reflecting only sociological or psychological conceptions in order to describe and analyze professionality. In this article the authors discuss some of the mostly neglected points of view out of pedagogic and microsociologic professionalization-research (professional self, researching attitude). The existing requests of competence for supervisors are examined in order to test their teaching ability. Furthermore the content designs and didactic strategies for future counselor’s education are considered.     

On the distance paired domination of generalized Petersen graphs <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,1) and <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,2)

Let G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a k -distance paired dominating set of G if D is a k-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The minimum cardinality of a k-distance paired dominating set for graph G is the k -distance paired domination number, denoted by γ _p ^k (G). In this paper, we determine the exact k-distance paired domination number of generalized Petersen graphs P(n,1) and P(n,2) for all k≥1.     

会计电算化对会计核算模式的影响

本文从会计核算方法、会计核算程序、会计组织方式、人员配置等方面阐述了会计电算化对传统会计核算模式的影响     

A new random permutation test in ANOVA models

This paper developed an exact method of random permutations when testing both interaction and main effects in the two-way ANOVA model. The method of this paper can be regarded as a much improved model when compared with those of the previous studies such as Still and White (1981) and ter Braak (1992). We further conducted a simulation experiment in order to check the statistical performance of the proposed method. The proposed method works relatively well for small sample sizes compare with the existing methods. This work was supported by Korea Science and Engineering Foundation Grant (R14-2003-002-0100)     

骑岭三中学生学习心理状况的研究报告

我们采用心理测量法研究骑岭三中学生的学习心理状况,揭示农村初中学生的学习心理特点,为提高学生的学习质量服务.得到的结论是1)学生的总体智商平均为102.2;2)学习适应性处于中等水平,中下等、差等率略高于全国水平;3)心理问题检出率为12.038%.     

Association of educational level and child sex ratio in rural and urban India

Utilizing data from the Census of India, this study compared child sex ratio in rural and urban regions of India and analyzed whether the child sex ratio was associated with mother’s education level. The child sex ratios in the rural and urban regions throughout India were analyzed using the two-sample and paired Student’s t-test. Further, the Chi-square test for trend in binomial proportions was used to assess the association between child sex ratios and mother’s education levels in rural and urban areas. Analysis of the data showed that there was a significant difference between the child sex ratios in rural areas versus urban areas. In addition, the Chi-square test for trend showed that there was a significant association of the child sex ratio and the educational levels of their mothers. This trend occurred in both rural and urban areas.     

Extreme Copulas and the Comparison of Ordered Lists

We introduce two extreme methods to pairwisely compare ordered lists of the same length, viz. the comonotonic and the countermonotonic comparison method, and show that these methods are, respectively, related to the copula T _M (the minimum operator) and the Ł ukasiewicz copula T _L used to join marginal cumulative distribution functions into bivariate cumulative distribution functions. Given a collection of ordered lists of the same length, we generate by means of T _M and T _L two probabilistic relations Q ^M and Q ^L and identify their type of transitivity. Finally, it is shown that any probabilistic relation with rational elements on a 3-dimensional space of alternatives which possesses one of these types of transitivity, can be generated by three ordered lists and at least one of the two extreme comparison methods.     

Transparency in the European Bond Market

The European bond market is made up of many segments characterised by varying levels of liquidity and of pre- and post-trade transparency. The possibility of extending the transparency provisions envisioned in the Directive 2004/39/EC, disciplining the functioning of markets in financial instruments in Europe (MiFID), from the equity to the bond market is currently being discussed. This poses risks to the status quo through trading fragmentation and strong negotiating power of a few large dealers, particularly with respect to small retail investors. The main conclusion of the paper is that if MiFID transparency rules are to be extended to the bond market, this must be “real” transparency, meaning pre-trade dissemination of real-time executable prices and a transparent order book. Under current provisions, this kind of information is available if not directly to everybody, at least directly to dealers and indirectly to professional and retail clients through business-to-business electronic platforms.     

Online coupon consumption problem

Nowadays, it is popular that the dealer makes profits by selling a kind of discount coupons, which can be used as money to purchase commodities with total cost less than or equal to the face value of the coupon. We can purchase a coupon at a price of 0<s≤1 times its face value and the number of potential purchasable coupons is a given integer l. The customer has the option to buy the goods by cash completely or by a discount coupon. However, each piece of goods can only use one coupon and the coupon used must have enough balance for the goods. The objective is to minimize the total cost for purchasing all the goods. In this paper, we reduce the problem to a special bin packing model. We consider the online problems for all 0<s≤1 and 1≤l≤∞. We present optimal online algorithms for all 0<s≤1 when l=∞ and l=1. For 2≤l<∞, we give both a lower bound and an algorithm, and show the algorithm is optimal for l=2. A preliminary version of this paper appeared in the proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, Lecture Notes in Computer Science. Y. Jiang supported by Natural Science Foundation of Zhejiang Province (Y605316). Z. Tan supported by Natural Science Foundation of China (10671177, 60021201).