Benchmarking best manufacturing practices: a study into four sectors of Turkish industry

Reports on a benchmarking study conducted to quantify how well companies operating in various sectors of Turkish industry match up to best practice, both in the practices they adopt and in the operational outcomes that result, and to test the hypothesis that the closer a company is to best practice, the more likely it is for that company to achieve higher business performance. The survey conducted in 1997 and 1998 included 82 companies from the Turkish electronics, cement, automotive sectors and part and component suppliers to the appliance industry. For data gathering. employs the Competitive Strategies and Best Practices Benchmarking Questionnaire, supported ly, some follow-up interviews and one-day site visits. Classifies two small groups of companies as leaders and laggers, depending on how close they were to best practice. Shows that the leaders have performed better than the laggers in adopting best manufacturing practices and in the achievement of high performance La,els. The leaders also have achieved substantially higher business performance than the laggers. Furthermore, observes that large-sized companies outperform the rest both in terms of their success in implementing best manufacturing practices and in achieving high operational outcomes and that there is no appreciable difference between industrial sectors in implementing best manufacturing practices and in achieving high operational outcomes

Asteroseismology of the {\it Kepler} target KIC\,9204718

The high precision data obtained by the {\it Kepler} satellite allows us to detect hybrid type pulsator candidates more accurately than the data obtained by ground-based observations. In this study, we present preliminary results on the new analysis of the {\it Kepler} light curve and high resolution spectroscopic observations of pulsating Am star KIC\,9204718. Our tentative analysis therefore show that the star has hybrid pulsational characteristics.Comment: 'Proceedings of Wide Field variability surveys : a 21 st Century 22nd Los Alamos Stellar Pulsation Conference San Pedro De Atacama ,Chile Nov 28-Dec 2, 2016' to be published by the EPJ Web of Conference

Distributed k-core view materialization and maintenance for large dynamic graphs

Cataloged from PDF version of article.In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’ regions of a graph. As the real world graphs such as social network graphs grow in size, the contents get richer and the topologies change dynamically, we are challenged not only to materialize k-core subgraphs for one time but also to maintain them in order to keep up with continuous updates. Adding to the challenge is that real world data sets are outgrowing the capacity of a single server and its main memory. These challenges inspired us to propose a new set of distributed algorithms for k-core view construction and maintenance on a horizontally scaling storage and computing platform. Our algorithms execute against the partitioned graph data in parallel and take advantage of k-core properties to aggressively prune unnecessary computation. Experimental evaluation results demonstrated orders of magnitude speedup and advantages of maintaining k-core incrementally and in batch windows over complete reconstruction. Our algorithms thus enable practitioners to create and maintain many k-core views on different topics in rich social network content simultaneously

A comparison of epidemic algorithms in wireless sensor networks

Cataloged from PDF version of article.We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved