Google hacking defence based on honey pages

 Many web servers contain some dangerous pages (we name them eigenpages) that can indicate their vulnerabilities. Therefore, some worms such as Santy locate their targets by searching for these eigenpages in search engines with well-crafted queries. In this paper, we focus on the modeling and containment of these special worms targeting web applications. We propose a containment system based on honey pots. We make search engines randomly insert a few honey pages that will induce visitors to the pre-established honey pots among the search results for the arriving queries. And then infectious can be detected and reported to the search engines when their malicious scans hit the honey pots. We find that the Santy worm can be well stopped by inserting no more than two honey pages in every one hundred search results. We also solve the challenging issue to dynamically generate matching honey pages for those dynamically arriving queries. Finally, a prototype is implemented to prove the technical feasibility of this system. © 2013 by CESER Publications.

Clinical trial adaptation by matching evidence in complementary patient sub-groups of auxiliary blinding questionnaire responses

Clinical trial adaptation refers to any adjustment of the trial protocol after the onset of the trial. Such adjustment may take on various forms, including the change in the dose of administered medicines, the frequency of administering an intervention, the number of trial participants, or the duration of the trial, to name just some possibilities. The main goal is to make the process of introducing new medical interventions to patients more efficient, either by reducing the cost or the time associated with evaluating their safety and efficacy. The principal challenge, which is an outstanding research problem, is to be found in the question of how adaptation should be performed so as to minimize the chance of distorting the outcome of the trial. In this paper we propose a novel method for achieving this. Unlike most of the previously published work, our approach focuses on trial adaptation by sample size adjustment i.e. by reducing the number of trial participants in a statistically informed manner. We adopt a stratification framework recently proposed for the analysis of trial outcomes in the presence of imperfect blinding and based on the administration of a generic auxiliary questionnaire that allows the participants to express their belief concerning the assigned intervention (treatment or control). We show that this data, together with the primary measured variables, can be used to make the probabilistically optimal choice of the particular sub-group a participant should be removed from if trial size reduction is desired. Extensive experiments on a series of simulated trials are used to illustrate the effectiveness of our method.

Algorithm for web services matching

UDDI is a standard for publishing and discovery of web services. UDDI registries provide keyword searches for web services. The search functionality is very simple and fails to account for relationships between web services. In this paper, we propose an algorithm which retrieves closely related web services. The proposed algorithm is based on singular value decomposition (SVD) in linear algebra, which reveals semantic relationships among web services. The preliminary evaluation shows the effectiveness and feasibility of the algorithm.

Making use of IT: web page

The use of the Web has become an essential part of teaching and learning in Australian schools. Nevertheless, many students lack knowledge of how to properly evaluate and cite Web-sourced information. This paper presents criteria, by which students can judge the reliability of Web resources, and guidelines on the citation of Web information. These strategies have been implemented successfully by the authors in their classes.

Enron. Con : “He that filches from me my good name … makes me poor indeed”

This critique functions as an introduction to this special issue of Critical Perspectives on Accounting; an edition that embraces themes pertaining to the catastrophic collapse of Enron. In an effort to place the research published in this edition in context, I provide a critical analysis of the accounting and corporate governance implications of the demise of Enron, the subsequent public outcry, and the legislative reforms to date. I conclude with an exploration of how the studies in this special issue contribute to understanding the myriad of forces behind major events such as this.

Matrix model for web page community construction

The World Wide Web is now a huge information source with its own characteristics. In most cases, traditional database-based technologies are no longer suitable for web information processing and management. For effectively processing and managing web. information, it is necessary to reveal intrinsic relationships/structures among concerned web information objects such as web pages. In this work, a set of web pages that has its own intrinsic structure is called a web page community. This paper proposes a matrix model to describe relationships among concerned web pages. Based on this model, intrinsic relationships among pages could be revealed, and in turn a web page community could be constructed. The issues that are related to this model in its application are deeply investigated and studied. Some applications based on this model are presented, which demonstrate the potential of this matrix model in different kinds of web page community construction and information processing.

Giving content to the principle of proportionality: happiness and pain as the universal currency for matching offence seriousness and penalty severity

The principle of proportionality prescribes that the punishment should equal the crime. It is one of the most important principles of sentencing. Yet, despite its widespread acceptance it offers no meaningful guide to sentencing. Hence penalty levels fluctuate greatly between jurisdictions and within jurisdictions. This is because there is no universally agreed criterion for measuring offence seriousness or penalty severity. This article suggests that the appropriate criteria for matching offence seriousness and penalty severity is the level of unhappiness or pain stemming from each of these impositions. Thus, for example, the level of pain meted out to a rape offender should equal the level of pain caused to a rape victim. Emerging scientific studies on human well-being and happiness show that human beings are similarly built in terms of the experiences that are either conducive or inimical to well-being. This commonality provides a strong foundation to be confident to make reasonably accurate predictions concerning the extent to which adverse events, such as being the victim of a criminal offence or subjected to a form of criminal sanction will stifle human flourishing. This will then allow us to match accurately offence seriousness and penalty level.

MDSM: microarray database schema matching using the Hungarian method

Current microarray databases use different terminologies and structures and thereby limit the sharing of data and collating of results between laboratories. Consequently, an effective integrated microarray data model is required. One important process to develop such an integrated database is schema matching. In this paper, we propose an effective schema matching approach called MDSM, to syntactically and semantically map attributes of different microarray schemas. The contribution from this work will be used later to create microarray global schemas. Since microarray data is complex, we use microarray ontology to improve the measuring accuracy of the similarity between attributes. The similarity relations can be represented as weighted bipartite graphs. We determine the best schema matching by computing the optimal matching in a bipartite graph using the Hungarian optimisation method. Experimental results show that our schema matching approach is effective and flexible to use in different kinds of database models such as; database schema, XML schema, and web site map. Finally, a case study on an existing public microarray schema is carried out using the proposed method.

The inhibiting effect of brand salience on brand name recall

This paper reports on a replication of Alba and Chattopadhyay’s (1986) study of the effects of substantially heightened brand salience upon the recall of competing brand names. Heightened salience was consistently shown to have an inhibiting effect on recall across a variety of experimental conditions. However, in the replication study this salience effect was not observed. Instead a trend in the reverse direction was found. This new finding is congruent with associative network model of memory and its prediction that subjects concentrating on a brand should trigger links in memory to the brand and other brands in the category.

Web page clustering : a hyperlink-based similarity and matrix-based hierarchical algorithms

This paper proposes a hyperlink-based web page similarity measurement and two matrix-based hierarchical web page clustering algorithms. The web page similarity measurement incorporates hyperlink transitivity and page importance within the concerned web page space. One clustering algorithm takes cluster overlapping into account, another one does not. These algorithxms do not require predefined similarity thresholds for clustering, and are independent of the page order. The primary evaluations show the effectiveness of the proposed algorithms in clustering improvement.

Utilizing hyperlink transitivity to improve web page clustering

The rapid increase of web complexity and size makes web searched results far from satisfaction in many cases due to a huge amount of information returned by search engines. How to find intrinsic relationships among the web pages at a higher level to implement efficient web searched information management and retrieval is becoming a challenge problem. In this paper, we propose an approach to measure web page similarity. This approach takes hyperlink transitivity and page importance into consideration. From this new similarity measurement, an effective hierarchical web page clustering algorithm is proposed. The primary evaluations show the effectiveness of the new similarity measurement and the improvement of web page clustering. The proposed page similarity, as well as the matrix-based hyperlink analysis methods, could be applied to other web-based research areas..

Image matching using TI multi-wavelet transform

A multi-resolution image matching technique based on multiwavelets followed by a coarse to fine strategy is presented. The technique addresses the estimation of optimal corresponding points and the corresponding disparity maps in the presence of occlusion, ambiguity and illuminative variations in the two perspective views taken by two different cameras or at different lighting conditions. The problem of occlusion and ambiguity is addressed by a geometric topological refining approach along with the uniqueness constraint whereas the illuminative variation is dealt by using windowed normalized correlation.

Mining more gold from web page hyperlinks

The development of the Internet has boosted prosperity of the World Wide Web, which is now a huge information source. Because of characteristics of the web, in most cases, traditional databasebased technologies are no longer suitable for web information retrieval and management. To effectively manage web information, it is necessary to reveal intrinsic relationships/structures among web information objects by eliminating noise factors. This paper proposes a mechanism that could be widely used in information processing, including web information processing and noise factor elimination for getting more intrinsic relationships. As an application case of this mechanism, one relevant web page finding algorithm is proposed to uncover intrinsic relationship among web pages from their hyperlink patterns, and find more semantic relevant web pages. The experimental evaluation shows the feasibility and effectiveness of the algorithm and demonstrates the potential of the proposed mechanism in web applications.