A VARIANCE-REDUCTION STRATEGY FOR RSM SIMULATION STUDIES

The application of optimization techniques in digital simulation experiments is frequently complicated by the presence of large experimental error variances. Two of the more widely accepted design strategies for the resolution of this problem include the assignment of common pseudorandom number streams and the assignment of antithetic pseudorandom number streams to the experimental points. When considered separately, however, each of these variance-reduction procedures has rather restrictive limitations. This paper examines the simultaneous use of these two techniques as a variance-reduction strategy in response surface methodology (RSM) analysis of simulation models. A simulation of an inventory system is used to illustrate the application and benefits of this assignment procedure, as well as the basic components of an RSM analysis.     

Life Domain Satisfaction: A Portugal–France Comparison

The study was aimed at replicating on a Portuguese sample the seven-factor model of life appraisal (physical autonomy, love life, family life, social life, occupational life, finances, and leisure life) that was suggested by Salvatore and Munoz Sastre Social Indicators Research 53:229–255 (2001). A sample of 1,111 Portuguese participants, aged 17–85, was presented with the Appraisal of Life Questionnaire. The “domain” model of life appraisal satisfactorily accounted for the data gathered on the Portuguese sample. Regarding finances and occupational life, Portuguese scores were lower than French scores. Regarding the occupational score and the leisure score, a clear linear decrease as a function of age was evidenced in the Portuguese sample. Finally, regarding the family score and the financial score, a non-linear relationship with age was found. An increase was observed from young adult age to adult age, and a decrease was observed from adult age to older age. A strong decrease in the physical autonomy scores among Portuguese females was also observed.     

缺少的分享——喜马拉雅东部(中国云南西北部)作为“整体社会事实”的分享的仪式语言

中华人民共和国成立以前,云南西北部怒江、独龙江流域居住的独龙族、怒族等邻近族群之间存在着一种共通的"议式语言".这种仪式语言通过宗教祭祀活动以及分享杀牲后的肉食过程体现出来.在这一地域社会中,各种社会、政治和经济关系都依赖于这种仪式语言展开.虽然目前这种分享的仪式日渐式微,但分享的意识依然体现着族群内部的"社会结合"方式.通过独龙族仪式语言的个案分析,旨在与利奇关于克钦社会的"仪式语言"研究进行对话.     

CEO burnout,managerial discretion,and firm performance: The role of CEO locus of control,structural power,and organizational factors

Despite the possibility of burnout resulting from dynamics in firms' upper echelons, little if any work has focused on chief executive officer's (CEO's) burnout and firm performance. Drawing on managerial discretion theory, this article analyzes the influence of CEO burnout on firm performance and the moderating roles of the individual (CEO locus of control), structural power (CEO duality and CEO tenure), and organizational characteristics (size, age, and resource availability) related to managerial discretion. Using a sample of 156 CEOs in Swedish firms, we find a negative association between CEOs who report higher burnout and firm performance. Our results confirm that CEO duality and resource availability ameliorate and firm size exacerbates the negative association between CEO burnout and firm performance. Contrary to our expectations, CEO locus of control, CEO tenure, and firm age do not influence this relationship. We discuss the implications of our research for upper echelons theory and strategic leadership theory.     

Approximability and exact resolution of the multidimensional binary vector assignment problem

In this paper we consider the multidimensional binary vector assignment problem. An input of this problem is defined by m disjoint multisets \(V^1, V^2, \ldots , V^m\), each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each multiset \(V^i\). To each m-tuple we associate a p dimensional vector by applying the bit-wise AND operation on the m vectors of the tuple. The objective is to minimize the total number of zeros in these n vectors. We denote this problem by Open image in new window , and the restriction of this problem where every vector has at most c zeros by Open image in new window . Open image in new window was only known to be Open image in new window -hard, even for Open image in new window . We show that, assuming the unique games conjecture, it is Open image in new window -hard to Open image in new window -approximate Open image in new window for any fixed Open image in new window and Open image in new window . This result is tight as any solution is a Open image in new window -approximation. We also prove without assuming UGC that Open image in new window is Open image in new window -hard even for Open image in new window . Finally, we show that Open image in new window is polynomial-time solvable for fixed Open image in new window (which cannot be extended to Open image in new window ).     

On the <Emphasis Type="Italic">m</Emphasis>-clique free interval subgraphs polytope: polyhedral analysis and applications

In this paper we study the m-clique free interval subgraphs. We investigate the facial structure of the polytope defined as the convex hull of the incidence vectors associated with these subgraphs. We also present some facet-defining inequalities to strengthen the associated linear relaxation. As an application, the generalized open-shop problem with disjunctive constraints (GOSDC) is considered. Indeed, by a projection on a set of variables, the m-clique free interval subgraphs represent the solution of an integer linear program solving the GOSDC presented in this paper. Moreover, we propose exact and heuristic separation algorithms, which are exploited into a Branch-and-cut algorithm for solving the GOSDC. Finally, we present and discuss some computational results.     

New lower bounds for the second variable Zagreb index

The aim of this paper is to obtain new sharp inequalities for a large family of topological indices, including the second variable Zagreb index \(M_2^{\alpha }\), and to characterize the set of extremal graphs with respect to them. Our main results provide lower bounds on this family of topological indices involving just the minimum and the maximum degree of the graph. These inequalities are new even for the Randi?, the second Zagreb and the modified Zagreb indices.     

On the relationship between compliance with recommendations on the audit committee of codes of good practices and financial reporting quality

Codes of good practices provide a soft alternative to the hard legislation approach to corporate governance. These codes include a set of recommendations that companies are expected to follow in order to enhance governance structures and practices. Some of these recommendations specifically aim to improve the effectiveness of the audit committee. We investigate the relationship between the level of compliance with recommendations on the audit committee of the Spanish Unified Code and financial reporting quality, as measured by discretionary accruals and by the opinion of the audit report. We use a sample of companies listed in the Spanish stock market for the years between 2007 and 2013. Results show a strong and positive relationship between the level of compliance with recommendations and the quality of financial reporting. We also report significant results for some specific recommendations. These results are robust to various checks. Therefore, the level of compliance with recommendations on the audit committee might provide a feasible and reliable indicator of the quality of financial reports released by the company.     

A feasibility approach for constructing combinatorial designs of circulant type

In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas–Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler’s table.     

Subset sum problems with digraph constraints

We introduce and study optimization problems which are related to the well-known Subset Sum problem. In each new problem, a node-weighted digraph is given and one has to select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints called digraph constraints and maximality need to be satisfied. The digraph constraint imposes that a node must belong to the solution if at least one of its predecessors is in the solution. An alternative of this constraint says that a node must belong to the solution if all its predecessors are in the solution. The maximality constraint ensures that no superset of a feasible solution is also feasible. The combination of these constraints provides four problems. We study their complexity and present some approximation results according to the type of input digraph, such as directed acyclic graphs and oriented trees.