Codes of conduct in Hong Kong organisations

This paper first reviews the literature on the role of codes of conduct for organisations in Hong Kong in their attempts to manage increasingly complex ethical problems and issues. It shows that, although valuable foundations exist upon which to build, research and understanding of the subject is at it's embryonic stage. Social Psychology literature is examined to investigate what lessons those concerned with the study of ethics may learn and the work of Hofstede, as seminal in the area of work-related values, is emphasised in this context.Following Hofstede's proposals for strategies for operationalizing¹ constructs about human values, a content analysis² was conducted on a pilot sample of codes provided by Hong Kong organisations. The results show three clearly identified clusters of organisations with common formats. The first group, described as Foreign Legal, emphasises legal compliance, has criteria for invoking penalties and consists of foreign-owned, large multinational organisations. Companies in the second cluster have codes which, except in the case of a couple of larger organisations, mainly follow the Independent Commission Against Corruption's (ICAC) standard format. The third cluster, described as the Bank Network, also appear to largely conform to a format: the Hong Kong Banking Association's guidelines.Further analysis conducted here of the Hong Kong codes indicates the important role of emic teleological values³, such as trust and reputation, amongst indigenous organisations, rather than the amorality suggested by an earlier study (Dolecheck and Bethke, 1990). These results support the proposition that Hong Kong ethical perspectives are culture bound⁴, as there appear to be different emphases than revealed in an American study (Stevens, 1994), which identified an emphasis in the US codes upon introverted organisational issues and a failure to espouse deontological values⁵.The conclusion is that designing a research programme on business values in Hong Kong requires reference to studies of values in cross-cultural psychology generally and to Hofstede's work in particular. It also supports the need for indigenous research and models in this field which avoid the ethnocentrism inherent in much Western theory and research.     

Fundamentals of Health Risk Assessment. Use,Derivation, Validity and Limitations of Safety Indices

We investigated the way results of human health risk assessments are used, and the theory used to describe those methods, sometimes called the NAS paradigm. Contrary to a key tenet of that theory, current methods have strictly limited utility. The characterizations now considered standard, Safety Indices such as Acceptable Daily Intake, Reference Dose, and so on, usefully inform only decisions that require a choice between two policy alternatives (e.g., approve a food additive or not), decided solely on the basis of a finding of safety. Risk is characterized as the quotient of one of these Safety Indices divided by an estimate of exposure: a quotient greater than one implies that the situation may be considered safe. Such decisions are very widespread, both in the U. S. federal government and elsewhere. No current method is universal; different policies lead to different practices, for example, in California's Proposition 65, where statutory provisions specify some practices. Further, an important kind of human health risk assessment is not recognized by this theory: this kind characterizes risk as likelihood of harm, given estimates of exposure consequent to various decision choices. Likelihood estimates are necessary whenever decision makers have many possible decision choices and must weigh more than two societal values, such as in EPA's implementation of conventional air pollutants. These estimates can not be derived using current methods; different methods are needed. Our analysis suggests changes needed in both the theory and practice of human health risk assessment, and how what is done is depicted.     

Acccounting and Volksgeist – Teritorial Claims on Accounting Regulation

In this paper, it is argued that international diversityin the rules governing corporate accountability is afunction of the desire to preserve local jurisdictionsby maintaining national distinctiveness. Successiveattempts at regulatory harmonisation in Europe havemet considerable resistance, starting with Savignysappeal to the spirit of the people (Volksgeist)and ending with the notion of subsidiarity. In thispaper, territorial claims on regulation are exploredin the context of the rules governing asset revaluation,where there are still almost as many required methodsof accounting in the European Union as there aremember states. The paper rejects the conventionalexplanation that such differences are culture-bound,and instead suggests that the continued existence ofnational rules in accounting reflects the pursuit ofautonomy by individual states and the self-interestof national regulators.     

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems

We consider Steiner minimum trees (SMT) in the plane, where only orientations with angle , 0 i – 1 and an integer, are allowed. The orientations define a metric, called the orientation metric, , in a natural way. In particular, ₂ metric is the rectilinear metric and the Euclidean metric can beregarded as metric. In this paper, we provide a method to find an optimal SMT for 3 or 4 points by analyzing the topology of SMT's in great details. Utilizing these results and based on the idea of loop detection first proposed in Chao and Hsu, IEEE Trans. CAD, vol. 13, no. 3, pp. 303–309, 1994, we further develop an O(n²) time heuristic for the general SMT problem, including the Euclidean metric. Experiments performed on publicly available benchmark data for 12 different metrics, plus the Euclidean metric, demonstrate the efficiency of our algorithms and the quality of our results.     

Circadian Rhythm and the Business Person

Each human being has an internal timekeeping mechanism. To date, over 100 so-called circadian rhythms have been detected. Perhaps the most significant is body temperature. There is an apparent connection between this rhythm and the efficiency with which we do things in the course of the working day. Within individuals, patterns have been discovered which give credence to the popular notions of a morning or an afternoon person, and so on. Our memory changes from morning to afternoon: short-term memory is stronger in the morning, and long-term memory stronger in the afternoon; in schools, morning students have higher grades than students who have other time-of-day preferences. Therefore, a strong case can be made in support of flexible time schedules. It is reported that productivity went up on the introduction of such a scheme. Employee stress has been seen to decline also. When flextime was offered, parents with small children took advantage of the benefit as well as unmarried employees. The only drawback is ensuring that, with so many individual variations in preferences, the needs of the company are fully met. If such a scheme can be devised, however, the research suggests that productivity and efficiency will increase.     

A comparative study of U.S. and Iraqi students

This study uses a sample comprised of U.S. students and Iraqi students to determine if differences occur over ethical perceptions based on cultural/demographic issues. Irrespective of demographics, the results of this study indicate significant cultural differences between Iraqi students and American students with regard to selected ethical issues concerning graduate education. Specifically the differences occurred in the students' perceptions of winning is everything, selling one's soul, logic before emotion, and pander to professors. Iraqi students consistently viewed these beliefs as more necessary for success in their graduate education than did their American counterparts.     

On Integrality, Stability and Composition of Dicycle Packings and Covers

Given a digraph D, the minimum integral dicycle cover problem (known also as the minimum feedback arc set problem) is to find a minimum set of arcs that intersects every dicycle; the maximum integral dicycle packing problem is to find a maximum set of pairwise arc disjoint dicycles. These two problems are NP-complete.Assume D has a 2-vertex cut. We show how to derive a minimum dicycle cover (a maximum dicycle packing) for D, by composing certain covers (packings) of the corresponding pieces. The composition of the covers is simple and was partially considered in the literature before. The main contribution of this paper is to the packing problem. Let be the value of a minimum integral dicycle cover, and * () the value of a maximum (integral) dicycle packing. We show that if = then a simple composition, similar to that of the covers, is valid for the packing problem. We use these compositions to extend an O(n³) (resp., O(n⁴)) algorithm for finding a minimum integral dicycle cover (resp., packing) from planar digraphs to K_3,3-free digraphs (i.e., digraphs not containing any subdivision of K_3,3).However, if , then such a simple composition for the packing problem is not valid. We show, that if the pieces satisfy, what we call, the stability property, then a simple composition does work. We prove that if = * holds for each piece, then the stability property holds as well. Further, we use the stability property to show that if = * holds for each piece, then = * holds for D as well.     

Examining the link between social responsibility and decision styles

The paper examines the factors that influence socially responsible decision making by individuals. The study found four social responsibility styles: Playing it Safe, Weather The Storm, Problem to Solve, and Hope it Goes Away. These styles describe individuals on the basis of decision style, propensity for risk, and coping style. The styles explain why people with different values might come to the same decision in the same circumstances.     

Ethical Futures and Public-Private Partnerships: Peering Far Down the Track

This article employs an institutional perspective in formulating predictions about the ethical futures of privatization partnerships. Although this paper focuses on ethical concerns in the U.S. public sector, it incorporates a multinational dimension in (a) comparing the meaning of privatization among societies and (b) probing privatization financing in the global economy. Five assumptions that flow from institutional reasoning are made explicit as supports for subsequent predictions. The institutional logic shifts privatization conversation away from conventional debate about competition and efficiency toward centralizing forces in both sectors in response to globalization. In that regard, this study identifies the systemic erosion of (local) community integrity as the key privatization problem of the future.     

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

A fully polynomial time approximation scheme (FPTAS) is presented for the classical 0-1 knapsack problem. The new approach considerably improves the necessary space requirements. The two best previously known approaches need O(n + 1/³) and O(n · 1/) space, respectively. Our new approximation scheme requires only O(n + 1/²) space while also reducing the running time.     

Division of Labour and the Locus of Inventive Activity

This paper argues that modularity of knowledge andtechnologies has important implications for the locusof inventive activities. This is because modularityallows for a separation of the innovation process intwo main activities: The production of basic(standardised) modules, and their combination toproduce variants of technologies or product designsthat are better suited to the special needs ofindividual users or markets. This gives rise to adivision of labour whereby the production of moduleswill be performed by specialised upstream suppliers(who enjoy economies of scale), while the combinationof modules will be performed by firms furtherdownstream or by the users themselves. We then suggestthat this pattern can explain a variety of phenomenasuch as why users co-produce their innovations, andhow small regions can support innovative activitydespite the apparent efficiency advantage of largerregions.     

Are g.p.a. and ethics related?

This article reports results of a study of some 200 college-aged students at California State University. Ethical values are measured using a subset of the well-known and frequently used Rokeach Value Survey. Using nonparametric statistical analysis, four value measures, and four different consistent tests of significance and probability, the research data, perhaps disappointedly for many observers including the authors, reveal that there is no relationship between college grade point average and student ethics. Statistical analysis was done on g.p.a. splits of less than 3.0 versus 3.0 or more and also on g.p.a. data for 2.5 or less versus 3.5 or more. In all cases, there are no significant relationships between high or low grade point averages and scores on ethical value rankings.     

A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition

Breakpoint graph decomposition is a crucial step in all recent approximation algorithms for SORTING BY REVERSALS, which is one of the best-known algorithmic problems in computational molecular biology. Caprara and Rizzi recently improved the approximation ratio for breakpoint graph decomposition from to + 1.4348 + , for any positive . In this paper, we extend the techniques of Caprara and Rizzi and incorporate a balancing argument to further improve the approximation ratio to + 1.4193 + , for any positive . These improvements imply improved approximation results for SORTING BY REVERSALS for almost all random permutations.     

Approximation Algorithms for Quadratic Programming

We consider the problem of approximating the global minimum of a general quadratic program (QP) with n variables subject to m ellipsoidal constraints. For m=1, we rigorously show that an -minimizer, where error (0, 1), can be obtained in polynomial time, meaning that the number of arithmetic operations is a polynomial in n, m, and log(1/). For m 2, we present a polynomial-time (1- )-approximation algorithm as well as a semidefinite programming relaxation for this problem. In addition, we present approximation algorithms for solving QP under the box constraints and the assignment polytope constraints.     

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces

Given a set of points P in a metric space, let l(P) denote the ratio of lengths between the shortest k-edge-connected Steiner network and the shortest k-edge-connected spanning network on P, and let r = inf l(P) P for k 1. In this paper, we show that in any metric space, r 3/4 for k 2, and there exists a polynomial-time -approximation for the shortest k-edge-connected Steiner network, where = 2 for even k and = 2 + 4/(3k) for odd k. In the Euclidean plane, and .     

A Probabilistic Analysis of the Capacitated Facility Location Problem

The solution value of a stochastic version of the capacitated facility location problem is studied. It is shown that, for large numbers of customers n, the value of can be closely approximated by , where the constant is identified as a function of the parameters of the underlying stochastic model. Furthermore, an extensive probabilistic analysis is performed on the difference that includes an exponential inequality on the tail distribution, a classification of the speed of convergence and a central limit theorem.     

Inverse Polymatroidal Flow Problem

Let D = (V, A) be a directed graph, for each vertex v V, let ⁺(v) and ^– (v) denote the sets of arcs leaving and entering v, and be intersecting families on ⁺(v) and ^–(v), respectively, and and be submodular functions on intersecting pairs. A flow f : A R is feasible if

Religious Business Ethics as Interpretation: A Jewish Perspective

This paper examines the method of Jewish business ethics. MichaelWalzer, in his work, Interpretation and Social Criticism (1987), suggeststhree common and important approaches to moral philosophy. He labels thesethe path of discovery, the path of invention, and the path ofinterpretation. The first part of this paper argues that Jewish businessethics is best thought of in terms of interpretation. Without question, thereligious ethicist immediately recognizes Walzers metaphor of the moralworld as a home occupied by a single family over many generations... as his own. Ethical arguments from a Jewish perspective must of necessityhave a lived-in quality and always make reference to and are based on thememory-laden objects and artifacts. The second part of the paper exploressome of the implications of Jewish business ethics as interpretation.     

A New Subgraph of Minimum Weight Triangulations

In this paper, two sufficient conditions for identifying a subgraph ofminimum weight triangulation of a planar point set are presented. Theseconditions are based on local geometric properties of an edge to beidentified. Unlike the previous known sufficient conditions for identifyingsubgraphs, such as Keils-skeleton and Yang and Xus double circles, The localgeometric requirement in our conditions is not necessary symmetric withrespect to the edge to be identified. The identified subgraph is differentfrom all the known subgraphs including the newly discovered subgraph:so-called the intersection of local-optimal triangulations by Dickerson etal. An O(n3) time algorithm for finding this subgraph from a set ofn points is presented.     

An Edge-Splitting Algorithm in Planar Graphs

For a multigraph G = (V, E), let s V be a designated vertex which has an even degree, and let _G (V – s) denote min{c _G(X) | Ø X V – s}, where c _G(X) denotes the size of cut X. Splitting two adjacent edges (s, u) and (s, v) means deleting these edges and adding a new edge (u, v). For an integer k, splitting two edges e ₁ and e ₂ incident to s is called (k, s)-feasible if _G(V – s) k holds in the resulting graph G. In this paper, we prove that, for a planar graph G and an even k or k = 3 with k _G (V – s), there exists a complete (k, s)-feasible splitting at s such that the resulting graph G is still planar, and present an O(n ³ log n) time algorithm for finding such a splitting, where n = |V|. However, for every odd k 5, there is a planar graph G with a vertex s which has no complete (k, s)-feasible and planarity-preserving splitting. As an application of this result, we show that for an outerplanar graph G and an even integer k the problem of optimally augmenting G to a k-edge-connected planar graph can be solved in O(n ³ log n) time.