Creativity, Innovation and Problem Solving

Global market and open competition forced organizations to rediscover the importance of innovative approaches to problem solving. While it is innovation that gives fillip to technology, trade and development,it is creativity that holds the key to good innovation. The combined and coordinated development of motivation, ability and creativity leads to the success of an innovation. The dawn of the information age has made innovators to look for solution methodology to their problems even in fields that are very different. This has revolutionized the way problems are seen, understood and analyzed. Several innovative problem solving techniques/tools have evolved over the years.The paper aims to present some of the innovative problem solving approaches that have come into existence. The paper also presents some the key elements like creativity and innovation, which have now become a part of inventive problem solving approaches

CO2 Emissions reduction strategies and economic development of India

This paper examines the consequences of alternative CO2 emission reduction strategies on economic development and, in particular, the implications for the poor by empirically implementing an economy-wide model for India over a 35-year time horizon. A multi-sectoral, inter-temporal model in the activity analysis framework is used for this purpose. The model with specific technological alternatives, endogenous income distribution, truly dynamic behaviour and covering the whole economy is an integrated top-down bottom-up model. The results show that CO2 emission reduction imposes costs in terms of lower GDP and higher poverty. Cumulative emission reduction targets are, however, preferable to annual reduction targets and that a dynamically optimum strategy can help reduce the burden of emission reductions. The scenarios involving compensation for the loss in welfare are not very encouraging as they require large capital inflows. Contrasted with these, scenarios involving tradable emission quota give India an incentive to be carbon efficient. It becomes a net seller for the first 25 years and because of reduction in carbon intensity it would demand less in later years when it becomes a net buyer. The results suggest that for India, and other developing countries, the window of opportunity to sell carbon quotas is the next two decades or so.

One-pot C–C/C–O bond formation: synthesis of spirocyclic lactones

An efficient and practical method for the synthesis of novel spiro(tri or tetra)cyclic lactones via the formation of C–C and C–O bonds in one-pot is presented. The method was successful under Lewis acidic (FeCl3) conditions and enabled the formation of spiro(tri or tetra)cyclic lactones from simple aliphatic exocyclic enoate esters as reacting partners with phenols. Remarkably, the usual self-aromatization of cyclohexanone based enoate esters, under such Lewis acidic conditions is overridden by intermolecular coupling. Significantly, the method was amenable to indanone derived esters as well and furnished novel spiro(tetra or penta)cyclic lactones bearing simple to dense functionalities on the aromatic rings. Notably, these novel spirocyclic systems constitute core structures of natural/unnatural compounds that show good biological properties

A facile reductive cleavage of allylic and benzylic esters with low valent titanium reagents

The reductive cleavage of allylic and benaylic esters 1a-g̲ with titanium(II) reagent derived from Mg/Hg-TiCl yielded the corresponding acids 3a-g̲ and dimeric hydro 4 carbons 2a-g̲ under mild reaction conditions

An efficient and highly selective method for deoximation of ketoximes

A combination of pyridinium dichromate/tert-butyl hydroperoxide (1:1) has been found to be an excellent reagent for the highly selective regeneration of ketones from ketoximes

NEW DYNAMIC QUERY OPTIMIZATION TECHNIQUE IN RELATIONAL DATABASE MANAGEMENT SYSTEMS

Query optimizer is an important component in the architecture of relational data base management system. This component is responsible for translating user submitted query into an efficient query evolution program which can be executed against the database. The present query evolution existing algorithm tries to find the best possible plan to execute a query with a minimum amount of time using mostly semi accurate statistical information (e.g. sizes of temporary relations, selectivity factors, and availability of resources). It is a static approach for generating optimal or close to optimal execution plan. Which in turn increases the execution cost of the query to reduce the execution cost of the query; I propose a new dynamic query optimization algorithm which is based on greedy dynamic programming algorithm uses randomized strategies and reduces the execution cost of the queries and system resources and also it works efficiently with distributed and centralized databases

A 3.4 Gbps 27-1 Pseudo Random Bit Sequence generator for Serial-Data Communications in 0.18�m CMOS

This paper presents a 3.4 Gbps Pseudo Random Bit Sequence (PRBS) generator with sequence length of 27-1. The circuit uses 7- Bit shift register with a linear current mode XOR gate and current mode D flip-flop and works up to data rates of 3.4 Gbps. The simulated data jitter of the 3.4 Gbps output is 2.75ps with full swing output voltage of 1.8V and the binary-sequence repeats itself after 127 cycles PRBS generator implemented in Cadence 0.18�m CMOS technology

Probability of Semantic Similarity and N-grams Pattern Learning for Data Classification

Semantic learning is an important mechanism for the document classification, but most classification approaches are only considered the content and words distribution. Traditional classification algorithms cannot accurately represent the meaning of a document because it does not take into account semantic relations between words. In this paper, we present an approach for classification of documents by incorporating two similarity computing score method. First, a semantic similarity method which computes the probable similarity based on the Bayes' method and second, n-grams pairs based on the frequent terms probability similarity score. Since, both semantic and N-grams pairs can play important roles in a separated views for the classification of the document, we design a semantic similarity learning (SSL) algorithm to improves the performance of document classification for a huge quantity of unclassified documents. The experiment evaluation shows an improvisation in accuracy and effectiveness of the proposal for the unclassified documents