Hybridizing the cross-entropy method: An application to the max-cut problem

Cross-entropy has been recently proposed as a heuristic method for solving combinatorial optimization problems. We briefly review this methodology and then suggest a hybrid version with the goal of improving its performance. In the context of the well-known max-cut problem, we compare an implementation of the original cross-entropy method with our proposed version. The suggested changes are not particular to the max-cut problem and could be considered for future applications to other combinatorial optimization problems.     

Bottleneck flows in unit capacity networks

The bottleneck network flow problem (BNFP) is a generalization of several well-studied bottleneck problems such as the bottleneck transportation problem (BTP), bottleneck assignment problem (BAP), bottleneck path problem (BPP), and so on. The BNFP can easily be solved as a sequence of O(logn) maximum flow problems on almost unit capacity networks. We observe that this algorithm runs in O(min{m3/2,n2/3m}logn) time by showing that the maximum flow problem on an almost unit capacity graph can be solved in O(min{m3/2,n2/3m}) time. We then propose a faster algorithm to solve the unit capacity BNFP in time, an improvement by a factor of at least . For dense graphs, the improvement is by a factor of . On unit capacity simple graphs, we show that BNFP can be solved in time, an improvement by a factor of . As a consequence we have an algorithm for the BTP with unit arc capacities.     

Mutation Operators for Spreadsheets

Based on (1) research into mutation testing for general purpose programming languages, and (2) spreadsheet errors that have been reported in the literature, we have developed a suite of mutation operators for spreadsheets. We present an evaluation of the mutation adequacy of du-adequate test suites generated by a constraint-based automatic test-case generation system we have developed in previous work. The results of the evaluation suggest additional constraints that can be incorporated into the system to target mutation adequacy. In addition to being useful in mutation testing of spreadsheets, the operators can be used in the evaluation of error-detection tools and also for seeding spreadsheets with errors for empirical studies. We describe two case studies where the suite of mutation operators helped us carry out such empirical evaluations. The main contribution of this paper is a suite of mutation operators for spreadsheets that can be used for carrying out empirical evaluations of spreadsheet tools to indicate ways in which the tools can be improved.     

Organizational Learning Mechanisms and Creative Climate: Insights from an Italian Fashion Design Company

This paper investigates the relationship between different types of organizational learning mechanisms and creative climate. In the context of an action research study, this paper focuses on insights from a survey that was administered to all the employees of the Product Design and Development unit of the company. The results demonstrate that the three different types of organizational learning mechanisms considered in the study (cognitive, structural and procedural mechanisms) are associated with creative climate. The study generates new scientific knowledge about the role of organizational learning mechanisms and provides specific recommendations for organizations that aim to enhance creative climate.     

Beyond utilitarian factors: User experience and travel company website successes

Travel websites are extensively used by travelers for their travel bookings, yet little is known about the hedonic effectiveness of such experiences for the customer. The end users of these websites are customers who may not always be sophisticated information system (IS) users. Further, traditional utility based measures of customer evaluation are dated with respect to the interactive nature of the technology in use and the hedonic benefits that may result from the use of the technology. The evaluation of IS needs to include hedonic measures facilitated by the interactive technology in addition to the traditional utility based measures. We propose and test an evaluation model for retail travel websites that combines the traditional utility based measures with hedonic measures which collectively create a more comprehensive measure for the IS evaluation of consumer focused websites. Thus rooted in theory, the model extends DeLone and McLean’s model of IS Success by adding the construct of User Experience. The model was tested on a sample of 255 customers of travel websites targeted at the Indian market. The results indicate that both utility based and hedonic measures are important factors for customer IS (travel website in this study) evaluation. The larger implications for theory and practice of IS evaluation are explained.     

Using RFID for the management of pharmaceutical inventory — system optimization and shrinkage control

Motivated by a case study at a radiology practice, we analyze the incremental benefits of RFID technology over barcodes for managing pharmaceutical inventories. Unlike barcode technology, RFID enables accurate real-time visibility, which in turn enables several process improvements. We analyze the impact of automatic counting and discuss the system redesign critical to optimizing the inventory policy and eliminating shrinkage. We show that continuous review is superior to periodic review whenever accurate real-time information is available at no additional cost. We explain how RFID-enabled strategies vary with inventory parameters and provide a cost-benefit analysis for the implementation of RFID for the radiology practice.     

Fast and versatile texture-based wireframe rendering

This paper revisits the problem of wireframe rendering, which, at first, appears to be an easily solved problem. However, the conventional solution is inefficient and does not result in high-quality images. Recently, graphics hardware programming has been employed to achieve high-quality solid line rendering. In this paper, we present a simpler and faster technique for wireframe rendering based on texture mapping. Our technique does not require (but can benefit from) graphics hardware programming and thus can be easily integrated into existing rendering engines, while resulting in fast, accurate, high-quality, anti-aliased, and still versatile, wireframe drawing. For topologically structured meshes, our approach allows the rendering of wireframe decoupled from the underlying mesh, making possible the rendering of original wireframes on top of decimated meshes.     

Structural, electronic, and magnetic properties of heterofullerene C(58)Si with odd number of atoms and a near planar tetracoordinate Si atom

Density functional calculations and minimization techniques have been employed to characterize the structural and electronic properties of [5,6]-heterofullerene-C₅₈Si-C_2v. Since it has odd number of atoms and a near planar tetracoordinate Si atom on the skeleton of the cage, it has odd number of atoms assembling a cage and is a novel molecule. Vibrational frequencies of the molecule have been calculated at the B3LYP/6-31G* level of theory. The absence of imaginary vibrational frequency confirms that the molecule corresponds to a true minimum on the potential energy hypersurface. Sixteen ¹³C nuclear magnetic resonance (NMR) spectral signals of C₅₈Si are characterized, and its heat of formation was estimated in this work.     

Automatic Clustering Using an Improved Differential Evolution Algorithm

Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the automatic clustering of large unlabeled data sets. In contrast to most of the existing clustering techniques, the proposed algorithm requires no prior knowledge of the data to be classified. Rather, it determines the optimal number of partitions of the data "on the run." Superiority of the new method is demonstrated by comparing it with two recently developed partitional clustering techniques and one popular hierarchical clustering algorithm. The partitional clustering algorithms are based on two powerful well-known optimization algorithms, namely the genetic algorithm and the particle swarm optimization. An interesting real-world application of the proposed method to automatic segmentation of images is also reported.     

On Conducting Simultaneous Versus Sequential Engineering Activities in Risky R&D

We consider development projects in which the activities can be classified in two types: uncertainty resolving R&D efforts that accumulate in the form of knowledge to eventually give rise to a discovery; and routine technical investments which aim at improving the profitability of the project once the discovery has been made. The advantage of initiating routine preparatory activities prior to the achievement of a technological breakthrough in such projects, sometimes termed as 'concurrent engineering', is analyzed within a suitable dynamic optimization framework. The optimal double expenditure policy is compared with the conservative delayed investment policy, under which all the routine engineering activities are delayed until the risky R&D efforts culminate in a breakthrough. A criterion for the optimality of the latter policy is developed on the basis of the probability distribution of the discovery date. The application of the criterion is illustrated for a variety of specifications regarding the uncertainty associated with the R&D process. We find that simultaneous investment is the optimal policy for a large class of probability distributions. However, if the conditional probability of immediate discovery is always below some critical value, it is optimal to delay the preparatory activities until the discovery.