英汉文化趋同与语言文化差异

文章从文化与语言两方面论述了中西文化的趋同现象,在文化趋同的过程中语言文化差异必然存在.不同的文化在趋同中发展,在差异中共存.     

大学生心理健康与体育锻炼

文章通过对大学生心理现状和影响因素的分析,结合对体育锻炼功能的探讨,得出体育锻炼对大学生心理健康有积极作用的结论.     

Determinants of short-term value creation for the bidder: evidence from France

This paper analyses bidder short-term returns of 58 takeover bids that occur between 1997 and 2005 on the French market. Furthermore, the determinants of this performance are examined to improve understanding of the sources of value creation or destruction arising from M&A. This study reports that M&A are typically friendly, horizontal transaction, and relate to the entire target capital. The event study methodology is used to estimate bidder value creation. Three findings are shown in this study. First, we find strong evidence that the announcement of a takeover bid generates significant, high returns for the bidder with prebid blockholder position in the target (toehold) versus the bidder without toehold. In this case, there is a strong presumption that the synergies’ motive is the prime reason for the offer. Second, these results show that bidders with low potential growth positively influence share price around the bid announcement. In addition, the growth profile of the target is associated with value creation for the bidder.     

Shareholder activism among portfolio managers: rational decisions or 15 minutes of fame?

This paper investigates shareholder activism by observing Swedish portfolio managers’ behavior at firms’ annual general meetings. Institutional shareholders’ voting behavior and tendencies for raising opinions at the general meetings are related to firm characteristics, suggested by both agency theory and institutional perspectives. The results show that institutional shareholders are more likely to be active in large firms, which appear a lot in media, and have a large proportion of institutional ownership. Portfolio managers appear not to consider bad firm performance as a reason for targeting firms. Instead, managers’ behavior is consistent with the institutional notion that they benefit from the activism themselves, without trying to improve target firms’ performance. In view of this notion, it is rational for managers to be active in large firms, with large media coverage, achieving their 15 minutes of fame at the general meetings.     

An improved time-space lower bound for tautologies

We show that for all reals c and d such that c ² d<4 there exists a positive real e such that tautologies of length n cannot be decided by both a nondeterministic algorithm that runs in time n ^c , and a nondeterministic algorithm that runs in time n ^d and space n ^e . In particular, for every \(d<\sqrt[3]{4}\) there exists a positive e such that tautologies cannot be decided by a nondeterministic algorithm that runs in time n ^d and space n ^e .     

Modeling Network Management: An Examination of Internal and External Strategies

Within the last decade scholars have begun to emphasize the importance of exploring management within an inter-organizational context (O’Toole and Laurence Public Administration Review 57(1):45-52, 1997; Agranoff and McGuire 1999; O’Toole and Meier Journal of Public Administration Research and Theory 9(4): 505-526, 1999). These studies have demonstrated the importance of network management on organizational performance. However, McGuire (2002) argues that the literature on networking does not demonstrate the intricate activities of network management that lead to increased performance, asserting case studies are necessary to achieve this goal. This work uses large-n data and presents the concepts of internal and external networking as a framework for understanding how network management contributes to improved organizational performance.     

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Given a simple, undirected graph G=(V,E) and a weight function w:E→ℤ⁺, we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all vertices is minimized. It has previously been shown that the unweighted version of the problem is solvable in polynomial time while the weighted version is (weakly) NP-hard. In this paper, we strengthen these results as follows: (1) We prove that the weighted version is strongly NP-hard even if all edge weights belong to the set {1,k}, where k is any fixed integer greater than or equal to 2, and that there exists no pseudo-polynomial time approximation algorithm for this problem whose approximation ratio is smaller than (1+1/k) unless P = NP; (2) we present a new polynomial-time algorithm that approximates the general version of the problem within a ratio of (2−1/k), where k is the maximum weight of an edge in G; (3) we show how to approximate the special case in which all edge weights belong to {1,k} within a ratio of 3/2 for k=2 (note that this matches the inapproximability bound above), and (2−2/(k+1)) for any k≥3, respectively, in polynomial time.