The increasing reliance on information gathered from the web and other internet technologies raise the issue of trust. Through the development of semantic Web, One major difficulty is that, by its very nature, the semantic web is a large, uncensored system to which anyone may contribute. This raises the question of how much credence to give each resource. Each user knows the trustworthiness of ...

The technological revolution has spread over today's world, and it is clearly seen in banking, especially electronic banking. E-Banking has many dimensions, criteria, and components, and judging its progress based on dimensions leads to difficulty and bias. There is also a lack of comprehensive information references in the literature. Therefore, introducing a combinational index to accurately ...

Search task difficulty refers to a user’s assessment about the amount of effort required to complete a search task. Our goal in this work is to learn predictive models of search task difficulty. We evaluate features derived from the user’s interaction with the search engine as well as features derived from the user’s level of interest in the task and level of prior knowledge in the task domain....

In this paper we discuss our work on using the incongruity measure from psychological literature to scale the difficulty level of a game online to the capabilities of the human player. Our approach has been implemented in a small game called Glove.

We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if PNP[1] = PNP[2], then the polynomial-time hierarchy collapses to Sp2 ⊆ Σp2∩Πp2. Even showing that the hierarchy collapsed to Σp2 remained open p...

We characterize the collapse of Buss’ bounded arithmetic in terms of the prov­ able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.

We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the k th level of the Boolean hierarchy over Σ2 . This is an improvement over the known results [3], which show that the polynomial hierarchy would collapse to P [O(log . This result is significant in two ways. First, the theorem says that a deeper collapse of the Boole...

The weak connection performances between the waterproof adhesive layer, bridge deck, and asphalt pavement are important factors that cause deck slippage upheaval affect safety durability of bridge. In this paper, styrene-butadiene-styrene- (SBS-) modified asphalt, SBS-emulsified rubber-modified AMP-100 materials selected to study performance layer in seasonal frozen region. shear strength bond ...