Computer Aided Design of MIC layouts with Postprocessor for Photoplotter

A PC-based computer-aided design (CAD) package for designing microwave integrated circuit (MIC) printed circuit board (PCB) layout, called microwave artwork postprocessor for photoplotter (MAPP), is developed. The small size of MIC PCBs makes them suitable for defence applications. MAPP has a postprocessor which converts the MIC layout data to a format acceptable as input to a Gerber photoplotter. Photomask of the PCB is obtained from the photoplotter. This paper presents the methodology for the CAD of MIC layouts and also discusses the algorithm for filling of a general polygon with curved edges, and which lies in the real domain. This algorithm is used in the postprocessor for a photoplotter

Real Time and Continuous Detection of Phishing Websites

Web Spoofing draws the client to associate with the fake sites instead of the genuine ones. The fundamental goal of this assault is to take the delicate data from the clients. The assailant makes a "shadow" site that seems to be like the genuine site. This deceitful demonstration enables the aggressor to watch and adjust any data from the client. This paper proposes a discovery system of phishing sites in view of checking Uniform Resources Locators (URLs) of pages. The proposed arrangement can recognize the real site page and fake website page by checking the Uniform Resources Locators (URLs) of suspected pages. URLs are examined in light of specific qualities to check the phishing website pages. The identified assaults are accounted for aversion. The execution of the proposed arrangement is assessed utilizing Phistank and Yahoo catalog datasets. The got comes about demonstrate that the location instrument is deployable and competent to distinguish different sorts of phishing assaults keeping up a low rate of false alerts

A heuristic for placement of limited range wavelength converters in all-optical networks

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is a NP complete problem [K.C. Lee, V.O.K. Li, IEEE J. Lightwave Technol. 11 (1993) 962-970] in an arbitrary mesh network. In this paper, we investigate heuristics for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. The proposed heuristic is to place limited range wavelength converters at the most congested nodes, nodes which lie on the long lightpaths and nodes where conversion of optical signals is significantly high. We observe that limited range converters at few nodes can provide almost the entire improvement in the blocking probability as the full range wavelength converters placed at all the nodes. Congestion control in the network is brought about by dynamically adjusting the weights of the channels in the link thereby balancing the load and reducing the average delay of the traffic in the entire network. Simulations have been carried out on a 12-node ring network, 14-node NSFNET, 19-node European Optical Network (EON), 28-node US long haul network, hypothetical 30-node INET network and the results agree with the analysis. (C) 2001 Elsevier Science B.V, All rights reserved

Statistics in the Landscape of Intersecting Brane Models

An approach towards a statistical survey of four dimensional supersymmetric vacua in the string theory landscape is described and illustrated with three examples of ensembles of intersecting D-brane models. The question whether it is conceivable to make predictions based on statistical distributions is discussed. Especially interesting in this context are possible correlations between low energy observables. As an example we look at correlations between properties of the gauge sector of intersecting D-brane models and Gepner model constructions.Comment: Submitted for the SUSY07 proceedings, 4 pages, 2 figure

On a continued fraction of order twelve

We present some new relations between a continued fraction U(q) of order 12 (established by M. S. M. Naika et al.) and U(q n) for n = 7, 9, 11, 13.Наведено деякі нові співвідношення між ланцюговим дробом U(q) дванадцятого порядку (який описано М. С. М. Найка та іншими авторами) і U(qn) для n=7,9,11та13

Web Caching and Prefetching with Cyclic Model Analysis of Web Object Sequences

Web caching is the process in which web objects are temporarily stored to reduce bandwidth consumption, server load and latency. Web prefetching is the process of fetching web objects from the server before they are actually requested by the client. Integration of caching and prefetching can be very beneficial as the two techniques can support each other. By implementing this integrated scheme in a client-side proxy, the perceived latency can be reduced for not one but many users. In this paper, we propose a new integrated caching and prefetching policy called the WCP-CMA which makes use of a profit-driven caching policy that takes into account the periodicity and cyclic behaviour of the web access sequences for deriving prefetching rules. Our experimental results have shown a 10%-15% increase in the hit ratios of the cached objects and 5%-10% decrease in delay compared to the existing schem

Automatic Discovery and Ranking of Synonyms for Search Keywords in the Web

Search engines are an indispensable part of a web user's life. A vast majority of these web users experience difficulties caused by the keyword-based search engines such as inaccurate results for queries and irrelevant URLs even though the given keyword is present in them. Also, relevant URLs may be lost as they may have the synonym of the keyword and not the original one. This condition is known as the polysemy problem. To alleviate these problems, we propose an algorithm called automatic discovery and ranking of synonyms for search keywords in the web (ADRS). The proposed method generates a list of candidate synonyms for individual keywords by employing the relevance factor of the URLs associated with the synonyms. Then, ranking of these candidate synonyms is done using co-occurrence frequencies and various page count-based measures. One of the major advantages of our algorithm is that it is highly scalable which makes it applicable to online data on the dynamic, domain-independent and unstructured World Wide Web. The experimental results show that the best results are obtained using the proposed algorithm with WebJaccard

Similarity Based Ranking of Query Results from Real Web Databases

The information available in the World Wide Web is stored using many real Web databases (e.g. vehicle database). Accessing the information from these real Web databases has become increasingly important for the users to find the desired information. Web users search for the desired information by querying these Web databases, when the number of query results generated is large, it is very difficult for the Web user to select the most relevant information from the large result set generated. Users today, have become more and more demanding in terms of the quality of information that is provided to them while searching the Web databases. The most common solution to solve the problem involves ranking the query results returned by the Web databases. Earlier approaches have used query logs, user profiles and frequencies of database values. The problem in all of these techniques is that ranking is performed in a user and query independent manner. This paper, proposes an automated ranking of query results returned by Web databases by analyzing user, query and workload similarity. The effectiveness of this approach is discussed considering a vehicle Web database as an example

Molecular fingerprinting of Helicanthus elastica (Desr.) Danser growing on five different hosts by RAPD

AbstractMistletoes are hemiparasitic plants growing on aerial parts of other host trees. Many of the mistletoes are reported to be medicinally important. The hemiparasitic nature of these plants makes their chemical composition dependent on the host on which it grows. They are shown to exhibit morphological dissimilarities also when growing on different hosts. Helicanthus elastica (Desr.) Danser (mango mistletoe) is one such less explored medicinal mistletoe found on almost every mango tree in India. Traditionally, the leaves of this plant are used for checking abortion and for removing stones in the kidney and urinary bladder while significant antioxidant and antimicrobial properties are also attributed to this species of mistletoe. The current study was undertaken to evaluate molecular differences in the genomic DNA of the plant while growing on five different host trees using four random markers employing random amplified polymorphic DNA (RAPD) followed by similarity matrix by Jaccard’s coefficient and distance matrix by hierarchal clustering analysis. Similarity and distance matrix data employing just 4 random markers, separately and the pooled data as well, revealed significant difference in the genomic DNA of H. elastica growing on five different hosts. Pooled data of similarity from all the 4 primers cumulatively showed similarity between 0.256 and 0.311. Distance matrix ranged from of 0.256 to 0.281 on pooling the data from all the four primers. The result employing a minimum number of primers could conclude that genomic DNA of H. elastica differs depending upon the host on which it grows, hence the host must be considered while studying or utilizing this mistletoe for medicinal purposes