Exploring the impact of social axioms on firm reputation: a stakeholder perspective

This study proposes a model of how deeply held beliefs, known as ‘social axioms, moderate the interaction between reputation, its causes and consequences with stakeholders. It contributes to the stakeholder relational field of reputation theory by explaining why the same organizational stimuli lead to different individual stakeholder responses. The study provides a shift in reputation research from organizational-level stimuli as the root causes of stakeholder responses to exploring the interaction between individual beliefs and organizational stimuli in determining reputational consequences. Building on a conceptual model that incorporates product/service quality and social responsibility as key reputational dimensions, the authors test empirically for moderating influences, in the form of social axioms, between reputation-related antecedents and consequences, using component-based structural equation modelling (n = 204). In several model paths, significant differences are found between responses of individuals identified as either high or low on social cynicism, fate control and religiosity. The results suggest that stakeholder responses to reputation-related stimuli can be systematically predicted as a function of the interactions between the deeply held beliefs of individuals and these stimuli. The authors offer recommendations on how strategic reputation management can be approached within and across stakeholder groups at a time when firms grapple with effective management of diverse stakeholder expectations.

Relational architecture and relational capability: organisational levers to support strategic supplier relationships

The resource based view of strategy suggests that competitiveness in part derives from a firms ability to collaborate with a subset of its supply network to co-create highly valued products and services. This relational capability relies on a foundational intra and inter-organisational architecture, the manifestation of strategic, people, and process decisions facilitating the interface between the firm and its strategic suppliers. Using covariance-based structural equation modelling we examine the relationships between internal and external features of relational architecture, and their relationship with relational capability and relational quality. This is undertaken on data collected by mail survey. We find significant relationships between both internal and external relational architecture and relational capability and between relational capability and relational quality. Novel constructs for internal and external elements of relational architecture are specified to demonstrate their positive influence on relational capability and relationship quality.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Computational study of the step size parameter of the subgradient optimization method

The subgradient optimization method is a simple and flexible linear programming iterative algorithm. It is much simpler than Newton's method and can be applied to a wider variety of problems. It also converges when the objective function is non-differentiable. Since an efficient algorithm will not only produce a good solution but also take less computing time, we always prefer a simpler algorithm with high quality. In this study a series of step size parameters in the subgradient equation is studied. The performance is compared for a general piecewise function and a specific p-median problem. We examine how the quality of solution changes by setting five forms of step size parameter.

Personalised Grid Service Discovery

The authors take a broad view that ultimately Grid- or Web-services must be located via personalised, semantic-rich discovery processes. They argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. This paper presents UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. They also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, they analyse the performance of each of these contributions in our implementation.

Personalised Grid Service Discovery

We take a broad view that ultimately Grid- or Web-services must be located via personalised, semantic-rich discovery processes. We argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. This paper presents UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. We also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, we analyse the performance of each of these contributions in our implementation.

A estrutura de decisão do operador de transporte de cargas pelo usuário varejista de pequeno porte

Este trabalho tem por objetivo investigar e identificar a influência dos atributos que estruturam a escolha do transportador de carga geral fracionada pelos usuários, em uma determinada rota nacional, baseado na modelagem da demanda. xii A modelagem da demanda é efetuada com base em Modelos Comportamentais Desagregados, utilizando-se as técnicas de Preferência Declarada (Stated Preference), na obtenção dos dados. A determinação das preferências dos decisores são analisadas, buscandose assim quantificar o valor das variáveis que compõem o nível de serviço desejado pelos varejistas usuários. O estudo enfoca o comportamento do varejista usuário de serviços de transporte de cargas com relação a tomada de decisão sobre a transportadora que executará o serviço de transporte de carga. Esta tomada de decisão do varejista usuário leva em consideração que cada operador valoriza os atributos em diferentes graus e que estes fazem parte do nível de serviço de cada transportadora. As técnicas de Preferência Declarada forneceram dados para estimar as funções de Utilidade levando em consideração os diferentes níveis de atributos de cada transportadora. A partir da função de Utilidade de cada transportadora, é estimada a probabilidade de escolha de cada transportadora. A modelagem permite a realização de simulações, a partir de alterações no grau dos atributos das variáveis do modelo, na qual se determinará a parcela de mercado de cada transportadora e a sua respectiva participação no mercado em estudo. Dentre os principais resultados, pode se observar que a modelagem da demanda em transporte de cargas, apesar de pouco utilizada, é coerente com a realidade analisada, validando a metodologia utilizada neste estudo.

Implementação paralela escalável e eficiente do algoritmo simplex padrão em arquitetura multicore

This work presents a scalable and efficient parallel implementation of the Standard Simplex algorithm in the multicore architecture to solve large scale linear programming problems. We present a general scheme explaining how each step of the standard Simplex algorithm was parallelized, indicating some important points of the parallel implementation. Performance analysis were conducted by comparing the sequential time using the Simplex tableau and the Simplex of the CPLEXR IBM. The experiments were executed on a shared memory machine with 24 cores. The scalability analysis was performed with problems of different dimensions, finding evidence that our parallel standard Simplex algorithm has a better parallel efficiency for problems with more variables than constraints. In comparison with CPLEXR , the proposed parallel algorithm achieved a efficiency of up to 16 times better

IFTrace: Video segmentation of deformable objects using the Image Foresting Transform

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Optimised placement of control and protective devices in electric distribution systems through reactive tabu search algorithm

Optimised placement of control and protective devices in distribution networks allows for a better operation and improvement of the reliability indices of the system. Control devices (used to reconfigure the feeders) are placed in distribution networks to obtain an optimal operation strategy to facilitate power supply restoration in the case of a contingency. Protective devices (used to isolate faults) are placed in distribution systems to improve the reliability and continuity of the power supply, significantly reducing the impacts that a fault can have in terms of customer outages, and the time needed for fault location and system restoration. This paper presents a novel technique to optimally place both control and protective devices in the same optimisation process on radial distribution feeders. The problem is modelled through mixed integer non-linear programming (MINLP) with real and binary variables. The reactive tabu search algorithm (RTS) is proposed to solve this problem. Results and optimised strategies for placing control and protective devices considering a practical feeder are presented. (c) 2007 Elsevier B.V. All rights reserved.

Synthesis of PID controllers for a class of time delay systems

In this paper we use the Hermite-Biehler theorem to establish results on the design of proportional plus integral plus derivative (PID) controllers for a class of time delay systems. Using the property of interlacing at high frequencies of the class of systems considered and linear programming we obtain the set of all stabilizing PID controllers. As far as we know, previous results on the synthesis of PID controllers rely on the solution of transcendental equations. This paper also extends previous results on the synthesis of proportional controllers for a class of delay systems of retarded type to a larger class of delay systems. (C) 2009 Elsevier Ltd. All rights reserved.

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Efficient heuristic algorithm used for optimal capacitor placement in distribution systems

An efficient heuristic algorithm is presented in this work in order to solve the optimal capacitor placement problem in radial distribution systems. The proposal uses the solution from the mathematical model after relaxing the integrality of the discrete variables as a strategy to identify the most attractive bus to add capacitors to each step of the heuristic algorithm. The relaxed mathematical model is a nonlinear programming problem and is solved using a specialized interior point method, The algorithm still incorporates an additional strategy of local search that enables the finding of a group of quality solutions after small alterations in the optimization strategy. Proposed solution methodology has been implemented and tested in known electric systems getting a satisfactory outcome compared with metaheuristic methods.The tests carried out in electric systems known in specialized literature reveal the satisfactory outcome of the proposed algorithm compared with metaheuristic methods. (C) 2009 Elsevier Ltd. All rights reserved.