Patent intelligence and its implications for patent productivity

The prevailing hypercompetitive environment has made it essential for organizations to gather competitive intelligence from environmental scanning. The knowledge gained leads to organizational learning, which stimulates increased patent productivity. This paper highlights five practices that aid in developing patenting intelligence and empirically verifies to what extent this organizational learning leads to knowledge gains and financial gains realized from consequent higher patent productivity. The model is validated based on the perceptions of professionals with patenting experience from two of the most aggressively patenting sectors in today’s economy, viz., IT and pharmaceutical sectors (n=119). The key finding of our study suggests that although organizational learning from environmental scanning exists, the application of this knowledge for increasing patent productivity lacks due appreciation. This missing link in strategic analysis and strategy implementation has serious implications for managers which are briefly discussed in this paper.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Localization of handwritten text in documents using moment invariants and Delaunay triangulation

This paper describes an approach based on Zernike moments and Delaunay triangulation for localization of hand-written text in machine printed text documents. The Zernike moments of the image are first evaluated and we classify the text as hand-written using the nearest neighbor classifier. These features are independent of size, slant, orientation, translation and other variations in handwritten text. We then use Delaunay triangulation to reclassify the misclassified text regions. When imposing Delaunay triangulation on the centroid points of the connected components, we extract features based on the triangles and reclassify the text. We remove the noise components in the document as part of the preprocessing step so this method works well on noisy documents. The success rate of the method is found to be 86%. Also for specific hand-written elements such as signatures or similar text the accuracy is found to be even higher at 93%.

Line removal and restoration of handwritten strokes

In document images, we often find printed lines over-lapping with hand written elements especially in case of signatures. Typical examples of such images are bank cheques and payment slips. Although the detection and removal of the horizontal lines has been addressed, the restoration of the handwritten area after removal of lines, persists to be a problem of interest. lit this paper, we propose a method for line removal and restoration of the erased areas of the handwritten elements. Subjective evaluation of the results have been conducted to analyze the effectiveness of the proposed method. The results are promising with an accuracy of 86.33%. The entire Process takes less than half a second for completion on a 2.4 GHz 512 MB RAM Pentium IV PC for a document image.

Role of information and communication in redefining unmanned aerial vehicle autonomous control levels

Autonomous mission control, unlike automatic mission control which is generally pre-programmed to execute an intended mission, is guided by the philosophy of carrying out a complete mission on its own through online sensing, information processing, and control reconfiguration. A crucial cornerstone of this philosophy is the capability of intelligence and of information sharing between unmanned aerial vehicles (UAVs) or with a central controller through secured communication links. Though several mission control algorithms, for single and multiple UAVs, have been discussed in the literature, they lack a clear definition of the various autonomous mission control levels. In the conventional system, the ground pilot issues the flight and mission control command to a UAV through a command data link and the UAV transmits intelligence information, back to the ground pilot through a communication link. Thus, the success of the mission depends entirely on the information flow through a secured communication link between ground pilot and the UAV In the past, mission success depended on the continuous interaction of ground pilot with a single UAV, while present day applications are attempting to define mission success through efficient interaction of ground pilot with multiple UAVs. However, the current trend in UAV applications is expected to lead to a futuristic scenario where mission success would depend only on interaction among UAV groups with no interaction with any ground entity. However, to reach this capability level, it is necessary to first understand the various levels of autonomy and the crucial role that information and communication plays in making these autonomy levels possible. This article presents a detailed framework of UAV autonomous mission control levels in the context of information flow and communication between UAVs and UAV groups for each level of autonomy.

Selective dissemination of XML documents using GAs and SVM

XML has emerged as a medium for interoperability over the Internet. As the number of documents published in the form of XML is increasing there is a need for selective dissemination of XML documents based on user interests. In the proposed technique, a combination of Self Adaptive Migration Model Genetic Algorithm (SAMCA)[5] and multi class Support Vector Machine (SVM) are used to learn a user model. Based on the feedback from the users the system automatically adapts to the user's preference and interests. The user model and a similarity metric are used for selective dissemination of a continuous stream of XML documents. Experimental evaluations performed over a wide range of XML documents indicate that the proposed approach significantly improves the performance of the selective dissemination task, with respect to accuracy and efficiency.

Interaction of metal ions with nucleic acids and related compounds. II. Studies on Au(III)-nucleic acid system

The nature of interaction of Au(III) with nucleic acids was studied by using methods such as uv and ir spectrophotometry, viscometry, pH titrations, and melting-temperature measurements. Au(III) is found to interact slowly with nucleic acids over a period of several hours. The uv spectra of native calf-thymus DNA 9pH 5.6 acetate buffer containing (0.01M NaCIO4) showed a shift in λ max to high wavelengths and an increase in optical density at 260 nm. There was a fourfold decrease in viscosity (expressed as ηsp/c). The reaction was faster at pH 4.0 and also with denatured DNA (pH 5.6) and whole yeast RNA (pH 5.6). The order of preference of Au(III) (as deduced from the time of completion of reaction) for the nucleic acids in RNA > denatured DNA > DNA. The reaction was found to be completely reversible with respect KCN. Infrared spectra of DNA-Au(III) complexes showed binding to both the phosphate and bases of DNA. The same conclusions were also arrived at by melting-temperature studies of Au(III)-DNA system. pH titrations showed liberation of two hydroxylions at r = 0.12 [r = moles of HAuCl4 added per mole of DNA-(P)] and one hydrogen ion at r = 0.5. The probable binding sites could be N(1)/N(7) of adenine, N(7) and/or C(6)O of guanine, N(3) of cytosine and N(3) of thymine. DNAs differing in their (G = C)-contents [Clostridium perfingens DNA(G = C, 29%), salmon sperm DNA (G + C, 42%) and Micrococcus lysodeikticus DNA(G + C, 29%), salmon sperm DNA (G = C, 72%)] behaved differently toward Au(III). The hyperchromicity observed for DNAs differing in (G + C)-content and cyanide reversal titrations indicate selectivity toward ( A + T)-rich DNA at lw values of r. Chemical analysis and job's continuous variation studies indicated the existence of possible complexes above and below r = 1. The results indicate that Au(III) ions probably bind to hte phosphate group in the initial stages of the reaction, particularly at low values of r, and participation of the base interaction also increases. Cross-linking of the two strands by Au(III) may take place, but a complete collapse of the doulbe helix is not envisaged. It is probable that tilting of the bases or rotaiton of the bases around the glucosidic bond, resulting in a significant distrotion of the double helix, might take place due to binding of Au(III) to DNA.