Power Profile of Effective Managers: An Exploration among the Branch Managers of a Commercial Bank in Kerala

Managers are central to any fuction in a complex and developed society. Their talents are reckoned to be cardinal in developed economies and a basic yearning of all developing economies.In order to survive and produce results in a turbulent and transient environment, the task is to understand the nature of factors contributing to managerial effectiveness. This study is an attempt towards this core issue of the present from a different perspective. This study tries to focus attention on a group of managers functioning in the field of banking, a core sector in the country's economy. The gamut of economic activities in Kerala being predominantly service-oriented, importance of commercial banking is almost indisputable. Though economists would argue that the disproportionate development of service sector is anomalous when viewed against the hazy scenarios in the primary and secondary sectors of the state’s economy, the extent and pace of growth in the banking sector has had its dole meted out by ambitious and productive managers fiinctioning in the field. Researcher’s attempt here is to thresh the grain and chaff among bank managers in terms of their effectiveness and to account for the variations in the light of their ability to affect the thoughts and actions of their subordinates. To put it succinctly, the attempt herein is to explain the effectiveness of bank managers in the light of their ‘Power Profile’ taken to be comprising Power Differentials, Power Bases, their Visibility and Credibility in the organisation and, the Power Styles typically used by them for influencing subordinates.

Branch and price solution approach for order acceptance and capacity planning in make -to -order operations

The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards make-to-order (MTO) operations. Increasing global competition, lower profit margins, and higher customer expectations force the MTO firms to plan its capacity by managing the effective demand. The goal of this research was to maximize the operational profits of a make-to-order operation by selectively accepting incoming customer orders and simultaneously allocating capacity for them at the sales stage. ^ For integrating the two decisions, a Mixed-Integer Linear Program (MILP) was formulated which can aid an operations manager in an MTO environment to select a set of potential customer orders such that all the selected orders are fulfilled by their deadline. The proposed model combines order acceptance/rejection decision with detailed scheduling. Experiments with the formulation indicate that for larger problem sizes, the computational time required to determine an optimal solution is prohibitive. This formulation inherits a block diagonal structure, and can be decomposed into one or more sub-problems (i.e. one sub-problem for each customer order) and a master problem by applying Dantzig-Wolfe’s decomposition principles. To efficiently solve the original MILP, an exact Branch-and-Price algorithm was successfully developed. Various approximation algorithms were developed to further improve the runtime. Experiments conducted unequivocally show the efficiency of these algorithms compared to a commercial optimization solver.^ The existing literature addresses the static order acceptance problem for a single machine environment having regular capacity with an objective to maximize profits and a penalty for tardiness. This dissertation has solved the order acceptance and capacity planning problem for a job shop environment with multiple resources. Both regular and overtime resources is considered. ^ The Branch-and-Price algorithms developed in this dissertation are faster and can be incorporated in a decision support system which can be used on a daily basis to help make intelligent decisions in a MTO operation.^

Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations

The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards make-to-order (MTO) operations. Increasing global competition, lower profit margins, and higher customer expectations force the MTO firms to plan its capacity by managing the effective demand. The goal of this research was to maximize the operational profits of a make-to-order operation by selectively accepting incoming customer orders and simultaneously allocating capacity for them at the sales stage. For integrating the two decisions, a Mixed-Integer Linear Program (MILP) was formulated which can aid an operations manager in an MTO environment to select a set of potential customer orders such that all the selected orders are fulfilled by their deadline. The proposed model combines order acceptance/rejection decision with detailed scheduling. Experiments with the formulation indicate that for larger problem sizes, the computational time required to determine an optimal solution is prohibitive. This formulation inherits a block diagonal structure, and can be decomposed into one or more sub-problems (i.e. one sub-problem for each customer order) and a master problem by applying Dantzig-Wolfe’s decomposition principles. To efficiently solve the original MILP, an exact Branch-and-Price algorithm was successfully developed. Various approximation algorithms were developed to further improve the runtime. Experiments conducted unequivocally show the efficiency of these algorithms compared to a commercial optimization solver. The existing literature addresses the static order acceptance problem for a single machine environment having regular capacity with an objective to maximize profits and a penalty for tardiness. This dissertation has solved the order acceptance and capacity planning problem for a job shop environment with multiple resources. Both regular and overtime resources is considered. The Branch-and-Price algorithms developed in this dissertation are faster and can be incorporated in a decision support system which can be used on a daily basis to help make intelligent decisions in a MTO operation.

A SEARCH FOR FIELD HORIZONTAL-BRANCH STARS NEAR THE SOUTH GALACTIC POLE

Searches for field horizontal-branch (FHB) stars in the halo of the Galaxy in the past have been carried out by several techniques, such as objective-prism surveys and visual or infrared photometric surveys. By choosing adequate color criteria, it is possible to improve the efficiency of identifying bona fide FHB stars among the other objects that exhibit similar characteristics, such as main-sequence A-stars, blue stragglers, subdwarfs, etc. In this work, we report the results of a spectroscopic survey carried out near the south Galactic pole intended to validate FHB stars originally selected from the HK objective-prism survey of Beers and colleagues, based on near-infrared color indices. A comparison between the stellar spectra obtained in this survey with theoretical stellar atmosphere models allows us to determine T(eff), log g, and [Fe/H] for 13 stars in the sample. Stellar temperatures were calculated from measured (B-V)(o), when this measurement was available (16 stars). The color index criteria adopted in this work are shown to correctly classify 30% of the sample as FHB, 25% as non-FHB (main-sequence stars and subdwarfes), whereas 40% could not be distinguished between FHB and main-sequence stars. We compare the efficacy of different color criteria in the literature intended to select FHB stars, and discuss the use of the Mg II 4481 line to estimate the metallicity.

Li-rich red giant branch stars in the Galactic bulge

Aims. We present lithium abundance determination for a sample of K giant stars in the Galactic bulge. The stars presented here are the only 13 stars with a detectable lithium line (6767.18 angstrom) among similar to 400 stars for which we have spectra in this wavelength range, half of them in Baade's Window (b = -4 degrees) and half in a field at b = -6 degrees. Methods. The stars were observed with the GIRAFFE spectrograph of FLAMES mounted on VLT, with a spectral resolution of R similar to 20 000. Abundances were derived from spectral synthesis and the results are compared with those of stars with similar parameters, but no detectable Li line. Results. We find 13 stars with a detectable Li line, among which 2 have abundances A(Li) > 2.7. No clear correlations were found between the Li abundance and those of other elements. With the exception of the two most Li rich stars, the others follow a fairly tight A(Li) - T(eff) correlation. Conclusions. There is strong indication of a Li production phase during the red giant branch (RGB), acting either on a very short timescale, or selectively only in some stars. That the proposed Li production phase is associated with the RGB bump cannot be excluded, although our targets are significantly brighter than the predicted RGB bump magnitude for a population at 8 kpc.

Offline Detection, Identification, and Correction of Branch Parameter Errors Based on Several Measurement Snapshots

This paper proposes a three-stage offline approach to detect, identify, and correct series and shunt branch parameter errors. In Stage 1 the branches suspected of having parameter errors are identified through an Identification Index (II). The II of a branch is the ratio between the number of measurements adjacent to that branch, whose normalized residuals are higher than a specified threshold value, and the total number of measurements adjacent to that branch. Using several measurement snapshots, in Stage 2 the suspicious parameters are estimated, in a simultaneous multiple-state-and-parameter estimation, via an augmented state and parameter estimator which increases the V - theta state vector for the inclusion of suspicious parameters. Stage 3 enables the validation of the estimation obtained in Stage 2, and is performed via a conventional weighted least squares estimator. Several simulation results (with IEEE bus systems) have demonstrated the reliability of the proposed approach to deal with single and multiple parameter errors in adjacent and non-adjacent branches, as well as in parallel transmission lines with series compensation. Finally the proposed approach is confirmed on tests performed on the Hydro-Quebec TransEnergie network.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Dorsal cutaneous branch of the ulnar nerve: a light and electron microscopy histometric study

This study describes the normal morphology and morphometry of the dorsal cutaneous branch of the ulnar nerve (DCBU) in humans. Fourteen nerves of eight donors were prepared by conventional techniques for paraffin and epoxy resin embedding. Semiautomatic morphometric analysis was performed by means of specific computer software. Histograms of the myelinated and unmyelinated fiber population and the G-ratio distribution of fibers were plotted. Myelinated fiber density per nerve varied from 5,910 to 10,166 fibers/mm(2), with an average of 8,170 +/- 393 fibers/mm(2). The distribution was bimodal with peaks at 4.0 and 9.5 mu m. Unmyelinated fiber density per nerve varied from 50,985 to 127,108, with an average of 78,474 +/- 6, 610 fibers/mm(2), with a unimodal distribution displaying a peak at 0.8 mu m. This study thus adds information about the fascicles and myelinated and unmyelinated fibers of DCBU nerves in normal people, which may be useful in further studies concerning ulnar nerve neuropathies, mainly leprosy neuropathy.

Accounting and the “Doctor-Manager Relationship”

The adoption of the “new public management” in the hospital sector brought about greater presence and power to professional managers in hospitals, thus increasing the risk of conflict in the doctor-manager relationship. Aiming to enrich the discussion on the factors that could be the bases for this conflict and considering the role of accounting, the study presented here corresponds, basically, to what we call “content analysis” of qualitative studies. The results demonstrate that the Portuguese doctors as the sample studied accept, in essence, the principles of enterprise management and recognize the use of accounting information in the scope of their functions as long as they are called to participate as legitimate actors, and authorities respect their desires to preserve a practice which they consider of quality.

Estudo para a implementação do método no ramo acidentes de trabalho

Mestrado em Contabilidade e Gestão das Instituições Financeiras

Genus for knots and links in renormalizable templates with several branch nodes

We apply kneading theory to describe the knots and links generated by the iteration of renormalizable nonautonomous dynamical systems with reducible kneading invariants, in terms of the links corresponding to each factor. As a consequence we obtain explicit formulas for the genus for this kind of knots and links.

NoC contention analysis using a branch-and-prune algorithm

“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the traversal time of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.

Innovation assessment of a Portuguese railway branch of a foreign multinational - a case study

Paper developed for the unit “Innovation Economics and Management” of the PhD programme in Technology Assessment at the Universidade Nova de Lisboa in 2009-10 under the supervision of Prof. Maria Luísa Ferreira

Accessibility in portuguese public administration : manager's point of view

Apresentação realizada na LivingAll European Conference, em Valência, Espanha, de 15-16 janeiro de 2009