In the preceding comment of Sato et al., these authors claim that only the rebonded SB step edge is found on the stepped Ge(001) surface. In our paper [1] we have concluded that the SB step on the Ge(001) surface exhibits both the rebonded as well as the nonbonded configuration [2]. Sato and coworkers agree with us in so far that they also discern two configurations in their STM images, namely ...

Determining the complexity of perfect information trick-taking card games is a long standing open problem. This question is worth addressing not only because of the popularity of these games among human players, e.g., DOUBLE DUMMY BRIDGE, but also because of its practical importance as a building block in state-of-the-art playing engines for CONTRACT BRIDGE, SKAT, HEARTS, and SPADES. We define ...

The culturally widespread verbal count list (“one, two, three...”), deployed in accord with what Gelman & Gallistel (1978) call the “counting principles,” represents the positive integers1. The counting principles provide an account of how the count list encodes the successor function; i.e. if a numeral “n” refers to cardinal value n and “p” immediately follows “n” in the count list then “p” re...

This paper compares two projects that adopted social bookmarking (SB) technology in different educational contexts at the same institution, a large, research-intensive university in the north of England. The first study used social bookmarking in a multicultural postgraduate class to increase interactivity within the whole class and to produce an archive of course-related online resources to en...

A class A of graphs is called weakly addable (or bridge-addable) if for any G ∈ A and any two distinct components C1 and C2 in G, any graph that can be obtained by adding an edge between C1 and C2 is also in A. McDiarmid, Steger and Welsh conjectured in [6] that a graph chosen uniformly at random among all graphs with n vertices in a weakly addable A is connected with probability at least e−1/2...

The following is proved: if every bridgeless graph G has a cycle cover of length at most 7/51€(G)I, then every bridgeless graph G has a cycle cover of length at most 7/51€(G)I such that any edge of G is covered once or twice.

Fig. 1.1 Shows the circuit configuration for a 19-level (lineto-neutral) H-bridge StatCom (H-StatCom). Each stack ofH-bridges essentially forms one phase of a threephase currentcontrolledvoltage source. The purpose of the H-StatCom isto modulate the voltage at the output of each stack so thatthe current through the inductors can be controlled to providepower factor correction, compensate for sy...

Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs with a circuit missing only one vertex and bridgeless cubic graphs with a 2-factor consisting of two circuits. The first part of this result implies that Berge ...

Nowadays, there are many online file storage services providing convienent, accessible and giant clouds for people’s daily usage. However, the convenience always comes with trust issues. There are many hackers around the world, sometimes your precious even private information is under peeking. This kind of hackers can also be extended to business services, e.g. data mining, machine learning, an...