Investigating novelty-outcome relationships in engineering design

Design creativity involves developing novel and useful solutions to design problems The research in this article is an attempt to understand how novelty of a design resulting from a design process is related to the kind of outcomes. described here as constructs, involved in the design process A model of causality, the SAPPhIRE model, is used as the basis of the analysis The analysis is based on previous research that shows that designing involves development and exploration of the seven basic constructs of the SAPPhIRE model that constitute the causal connection between the various levels of abstraction at which a design can be described The constructs am state change, action, parts. phenomenon. input. organs. and effect The following two questions are asked. Is there a relationship between novelty and the constructs? If them is a relationship, what is the degree of this relationship? A hypothesis is developed to answer the questions an increase in the number and variety of ideas explored while designing should enhance the variety of concept space. leading to an increase in the novelty of the concept space Eight existing observational studies of designing sessions are used to empirically validate the hypothesis Each designing session involves an individual designer. experienced or novice. solving a design problem by producing concepts and following a think-aloud protocol. The results indicate dependence of novelty of concept space on variety of concept space and dependence of variety of concept space on variety of idea space. thereby validating the hypothesis The Jesuits also reveal a strong correlation between novelty and the constructs, correlation value decreases as the abstraction level of the constructs reduces. signifying the importance of using constructs at higher abstraction levels for enhancing novelty

On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations

It is important to identify the ``correct'' number of topics in mechanisms like Latent Dirichlet Allocation(LDA) as they determine the quality of features that are presented as features for classifiers like SVM. In this work we propose a measure to identify the correct number of topics and offer empirical evidence in its favor in terms of classification accuracy and the number of topics that are naturally present in the corpus. We show the merit of the measure by applying it on real-world as well as synthetic data sets(both text and images). In proposing this measure, we view LDA as a matrix factorization mechanism, wherein a given corpus C is split into two matrix factors M-1 and M-2 as given by C-d*w = M1(d*t) x Q(t*w).Where d is the number of documents present in the corpus anti w is the size of the vocabulary. The quality of the split depends on ``t'', the right number of topics chosen. The measure is computed in terms of symmetric KL-Divergence of salient distributions that are derived from these matrix factors. We observe that the divergence values are higher for non-optimal number of topics - this is shown by a `dip' at the right value for `t'.

Segmenting point-sampled surfaces

Extracting features from point-based representations of geometric surface models is becoming increasingly important for purposes such as model classification, matching, and exploration. In an earlier paper, we proposed a multiphase segmentation process to identify elongated features in point-sampled surface models without the explicit construction of a mesh or other surface representation. The preliminary results demonstrated the strength and potential of the segmentation process, but the resulting segmentations were still of low quality, and the segmentation process could be slow. In this paper, we describe several algorithmic improvements to overcome the shortcomings of the segmentation process. To demonstrate the improved quality of the segmentation and the superior time efficiency of the new segmentation process, we present segmentation results obtained for various point-sampled surface models. We also discuss an application of our segmentation process to extract ridge-separated features in point-sampled surfaces of CAD models.

A fast algorithm for finding frequent episodes in event streams

Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the frequency of an episode is some suitable measure of how often the episode occurs in the data sequence. Recently,we proposed a new frequency measure for episodes based on the notion of non-overlapped occurrences of episodes in the event sequence, and showed that, such a definition, in addition to yielding computationally efficient algorithms, has some important theoretical properties in connecting frequent episode discovery with HMM learning. This paper presents some new algorithms for frequent episode discovery under this non-overlapped occurrences-based frequency definition. The algorithms presented here are better (by a factor of N, where N denotes the size of episodes being discovered) in terms of both time and space complexities when compared to existing methods for frequent episode discovery. We show through some simulation experiments, that our algorithms are very efficient. The new algorithms presented here have arguably the least possible orders of spaceand time complexities for the task of frequent episode discovery.

Clustering Based Large Margin Classification: A Scalable Approach using SOCP Formulation

This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture distributions, where each component of the mixture has a spherical covariance, the second order statistics of the components can be estimated efficiently using clustering algorithms like BIRCH. For each cluster, the second order moments are used to derive a second order cone constraint via a Chebyshev-Cantelli inequality. This constraint ensures that any data point in the cluster is classified correctly with a high probability. This leads to a large margin SOCP formulation whose size depends on the number of clusters rather than the number of training data points. Hence, the proposed formulation scales well for large datasets when compared to the state-of-the-art classifiers, Support Vector Machines (SVMs). Experiments on real world and synthetic datasets show that the proposed algorithm outperforms SVM solvers in terms of training time and achieves similar accuracies.

Diversity in ranking via resistive graph centers

Users can rarely reveal their information need in full detail to a search engine within 1--2 words, so search engines need to "hedge their bets" and present diverse results within the precious 10 response slots. Diversity in ranking is of much recent interest. Most existing solutions estimate the marginal utility of an item given a set of items already in the response, and then use variants of greedy set cover. Others design graphs with the items as nodes and choose diverse items based on visit rates (PageRank). Here we introduce a radically new and natural formulation of diversity as finding centers in resistive graphs. Unlike in PageRank, we do not specify the edge resistances (equivalently, conductances) and ask for node visit rates. Instead, we look for a sparse set of center nodes so that the effective conductance from the center to the rest of the graph has maximum entropy. We give a cogent semantic justification for turning PageRank thus on its head. In marked deviation from prior work, our edge resistances are learnt from training data. Inference and learning are NP-hard, but we give practical solutions. In extensive experiments with subtopic retrieval, social network search, and document summarization, our approach convincingly surpasses recently-published diversity algorithms like subtopic cover, max-marginal relevance (MMR), Grasshopper, DivRank, and SVMdiv.

Cognitive radio implementation for a frequency hopping primary signal

Frequency hopping communications, used in the military present significant opportunities for spectrum reuse via the cognitive radio technology. We propose a MAC which incorporates hop instant identification, and supports network discovery and formation, QOS Scheduling and secondary communications. The spectrum sensing algorithm is optimized to deal with the problem of spectral leakage. The algorithms are implemented in a SDR platform based test bed and measurement results are presented.

Biological sulfate reduction of a sulfate-rich industrial waste liquor using sulfate reducing bacteria

An industrial waste liquor having high sulfate concentrations was subjected to biological treatment using the sulfate-reducing bacteria (SRB) Desulfovibrio desulfuricans. Toxicity levels of different sulfate, cobalt and nickel concentrations toward growth of the SRB with respect to biological sulfate reduction kinetics was initially established. Optimum sulfate concentration to promote SRB growth amounted to 0.8 - 1 g/L. The strain of D. desulfuricans used in this study initially tolerated up to 4 -5 g/L of sulfate or 50 mg/L of cobalt and nickel, while its tolerance could be further enhanced through adaptation by serial subculturing in the presence of increasing concentrations of sulfate, cobalt and nickel. From the waste liquor, more than 70% of sulfate and 95% of cobalt and nickel could be precipitated as sulfides, using a preadapted strain of D. desulfuricans. Probable mechanisms involving biological sulfide precipitation and metal adsorption onto precipitates and bacterial cells are discussed.

Pd-Catalyzed Cross-Coupling Reactions of Hydrazones: Regioselective Synthesis of Highly Branched Dienes

The regioselective formation of highly branched dienes is a challenging task. Design and exploration of alternative working models to achieve such a regioselectivity to accomplish highly branched dienes is considered to be a historical advancement of Heck reaction to construct branched dienes. On the basis of the utility of carbene transfer reactions, in the reaction of hydrazones with Pd(II) under oxidative conditions, we envisioned obtaining a Pd-bis-carbene complex with alpha-hydrogens, which can lead to branched dienes. Herein, we report a novel Pd-catalyzed selective coupling reaction of hydrazones in the presence of t-BuOLi and benzoquinone to form the corresponding branched dienes. The utility of the Pd catalyst for the cross-coupling reactions for synthesizing branched conjugated dienes is rare. The reaction is very versatile and compatible with a variety of functional groups and is useful in synthesizing heterocyclic molecules. We anticipate that this Pd-catalyzed cross-coupling reaction will open new avenues for synthesizing useful compounds.

PocketMatch (version 2.0): A parallel algorithm for the detection of structural similarities between protein ligand binding-sites

Knowledge of protein-ligand interactions is essential to understand several biological processes and important for applications ranging from understanding protein function to drug discovery and protein engineering. Here, we describe an algorithm for the comparison of three-dimensional ligand-binding sites in protein structures. A previously described algorithm, PocketMatch (version 1.0) is optimised, expanded, and MPI-enabled for parallel execution. PocketMatch (version 2.0) rapidly quantifies binding-site similarity based on structural descriptors such as residue nature and interatomic distances. Atomic-scale alignments may also be obtained from amino acid residue pairings generated. It allows an end-user to compute database-wide, all-to-all comparisons in a matter of hours. The use of our algorithm on a sample dataset, performance-analysis, and annotated source code is also included.

Advances in the molecular design of potential anticancer agents via targeting of human telomeric DNA

Telomerases are an attractive drug target to develop new generation drugs against cancer. A telomere appears from the chromosomal termini and protects it from double-stranded DNA degradation. A short telomere promotes genomic instability, like end-to-end fusion and regulates the over-expression of the telomere repairing enzyme, telomerase. The telomerase maintains the telomere length, which may lead to genetically abnormal situations, leading to cancer. Thus, the design and synthesis of an efficient telomerase inhibitor is a viable strategy toward anticancer drugs development. Accordingly, small molecule induced stabilization of the G-quadruplex structure, formed by the human telomeric DNA, is an area of contemporary scientific art. Several such compounds efficiently stabilize the G-quadruplex forms of nucleic acids, which often leads to telomerase inhibition. This Feature article presents the discovery and development of the telomere structure, function and evolution in telomere targeted anticancer drug design and incorporates the recent advances in this area, in addition to discussing the advantages and disadvantages in the methods, and prospects for the future.