Review of CP Violation Studies with B-Mesons at LHC

The Large Hadron Collider (LHC) proposed at CERN will be the ultimate source of B-mesons. With the large number of B-mesons expected at LHC, a real precision test of CP violation in B-meson decays will become possible. There are already several efforts made to explore this possibility and a summary of those activities is presented.Comment: Standard LaTex, No figure, 10 pages Plenary talk given at 1994 International Workshop on B Physics Physics Beyond the Standard Model at the B Factory Nagoya, October 199

The suitability of N2 to replace SF6 in a triggered spark-gap switch for pulsed power applications

The high dielectric strength of sulphur hexafluoride (SF6) when compared with other gases, coupled with safety benefits such as non-flammability and non-toxicity, has seen the widespread use of SF6 for the insulation of switching components. However, SF6 is now widely recognised as a highly damaging greenhouse gas, and investigations of the switching properties of alternative gases to replace SF6 within the bounds of existing system topologies are required. In the present paper, a comparative study has been carried out on a triggered spark-gap of type presently deployed in industrial pulsed-power machines, to determine the suitability of nitrogen (N2) to replace SF6 as the switching medium, without compromising on functionality. Experiments were performed with fast-rising trigger pulses to minimise the delay time to breakdown and jitter, and three distinct operational regimes have been identified for both gases as the pressure inside the switch is increased. The static breakdown characteristics and upper pressure boundaries of operation have been determined for both gases at a range of dc charging voltages. Measurements of the time to breakdown have shown jitters as low as 1.3 ns when operating in N2, highlighting the potential of N2 to replace SF6 without the need for re-design or replacement of the presently used switch

The Role of Imagination in Social Scientific Discovery: Why Machine Discoverers Will Need Imagination Algorithms

When philosophers discuss the possibility of machines making scientific discoveries, they typically focus on discoveries in physics, biology, chemistry and mathematics. Observing the rapid increase of computer-use in science, however, it becomes natural to ask whether there are any scientific domains out of reach for machine discovery. For example, could machines also make discoveries in qualitative social science? Is there something about humans that makes us uniquely suited to studying humans? Is there something about machines that would bar them from such activity? A close look at the methodology of interpretive social science reveals several abilities necessary to make a social scientific discovery, and one capacity necessary to possess any of them is imagination. For machines to make discoveries in social science, therefore, they must possess imagination algorithms

Dynamic error characteristics of touch trigger probes used with coordinate measuring machines

This paper discusses the dynamic error characteristics of touch trigger probes used with coordinate measuring machines. During the investigation, a number of important parameters have been identified, including measurement speed, probe longitude, approach distance, probe latitude, stylus length/stylus tip diameter, probe orientation, operating mode (scanning and nonscanning), scan pitch, preload spring force (gauging force), probe type, and the surface approach angle. This paper presents the detailed experimental design and the results obtained from the systematic experiments. These results have led to some useful recommendations for the reduction of the probe dynamic errors. Some of these recommendations included the selection of the optimum measurement speed, the setting of the preload spring force, and the choice of the probe type

Property specification and static verification of UML models

We present a static verification tool (SVT), a system that performs static verification on UML models composed of UML class and state machine diagrams. Additionally, the SVT allows the user to add extra behavior specification in the form of guards and effects by defining a small action language. UML models are checked against properties written in a special-purpose property language that allows the user to specify linear temporal logic formulas that explicitly reason about UML components. Thus, the SVT provides a strong foundation for the design of reliable systems and a step towards model-driven security

Estimating the feasibility of transition paths in extended finite state machines

There has been significant interest in automating testing on the basis of an extended finite state machine (EFSM) model of the required behaviour of the implementation under test (IUT). Many test criteria require that certain parts of the EFSM are executed. For example, we may want to execute every transition of the EFSM. In order to find a test suite (set of input sequences) that achieves this we might first derive a set of paths through the EFSM that satisfy the criterion using, for example, algorithms from graph theory. We then attempt to produce input sequences that trigger these paths. Unfortunately, however, the EFSM might have infeasible paths and the problem of determining whether a path is feasible is generally undecidable. This paper describes an approach in which a fitness function is used to estimate how easy it is to find an input sequence to trigger a given path through an EFSM. Such a fitness function could be used in a search-based approach in which we search for a path with good fitness that achieves a test objective, such as executing a particular transition, and then search for an input sequence that triggers the path. If this second search fails then we search for another path with good fitness and repeat the process. We give a computationally inexpensive approach (fitness function) that estimates the feasibility of a path. In order to evaluate this fitness function we compared the fitness of a path with the ease with which an input sequence can be produced using search to trigger the path and we used random sampling in order to estimate this. The empirical evidence suggests that a reasonably good correlation (0.72 and 0.62) exists between the fitness of a path, produced using the proposed fitness function, and an estimate of the ease with which we can randomly generate an input sequence to trigger the path

Inertia compensation while scanning screw threads on coordinate-measuring machines

Usage of scanning coordinate-measuring machines for inspection of screw threads has become a common practice nowadays. Compared to touch trigger probing, scanning capabilities allow to speed up measuring process while still maintaining high accuracy. However, in some cases accuracy drasticaly depends on the scanning speed. In this paper a compensation method is proposed allowing to reduce the influence of some dynamic effects while scanning screw threads on coordinate-measuring machines