Asymmetric multivariate normal mixture GARCH

An asymmetric multivariate generalization of the recently proposed class of normal mixture GARCH models is developed. Issues of parametrization and estimation are discussed. Conditions for covariance stationarity and the existence of the fourth moment are derived, and expressions for the dynamic correlation structure of the process are provided. In an application to stock market returns, it is shown that the disaggregation of the conditional (co)variance process generated by the model provides substantial intuition. Moreover, the model exhibits a strong performance in calculating out-of-sample Value-at-Risk measures.     

A comparison of tools for teaching formal software verification

We compare four tools regarding their suitability for teaching formal software verification, namely the Frege Program Prover, the Key system, Perfect Developer, and the Prototype Verification System (PVS). We evaluate them on a suite of small programs, which are typical of courses dealing with Hoare-style verification, weakest preconditions, or dynamic logic. Finally we report our experiences with using Perfect Developer in class.     

QQL: A DB&;IR Query Language

Traditional database query languages are based on set theory and crisp first order logic. However, many applications require retrieval-like queries which return result objects associated with a degree of being relevant to the query. Historically, retrieval systems estimate relevance by exploiting hidden object semantics whereas query processing in database systems relies on matching select-conditions with attribute values. Thus, different mechanisms were developed for database and information retrieval systems. In consequence, there is a lack of support for queries involving both retrieval and database search terms. In this work, we introduce the quantum query language (QQL). Its underlying unifying theory is based on the mathematical formalism of quantum mechanics and quantum logic. Van Rijsbergen already discussed the strong relation between the formalism of quantum mechanics and information retrieval. In this work, we interrelate concepts from database query processing to concepts from quantum mechanics and logic. As result, we obtain a common theory which allows us to incorporate seamlessly retrieval search into traditional database query processing.     

A Comparison of Free BDDs and Transformed BDDs

Ordered binary decision diagrams (OBDDs) introduced by Bryant (IEEE Trans. on Computers, Vol. 35, pp. 677–691, 1986) have found a lot of applications in verification and CAD. Their use is limited if the OBDD size of the considered functions is too large. Therefore, a variety of generalized BDD models has been presented, among them FBDDs (free BDDs) and TBDDs (transformed BDDs). Here the quite tight relations between these models are revealed and their advantages and disadvantages are discussed.     

Spherical sample holders to improve the susceptibility measurement of superparamagnetic materials

The design of two custom sample holders with a spherical cavity for commercial vibrating sample magnetometer systems is described. For such cavities, the magnetization M[over ->] and the internal magnetic field H(i)[over ->] of a sample are both homogeneous. Consequently, the material parameter M(H(i)) of a sample can be determined even for liquids and powders with a high magnetic susceptibility.     

Hybrid routing in ad hoc networks with a dynamic virtual backbone

Virtual backbone routing (VBR) is a scalable hybrid routing framework for ad hoc networks, which combines local proactive and global reactive routing components over a variable-sized zone hierarchy. The zone hierarchy is maintained through a novel distributed virtual backbone maintenance scheme, termed the distributed database coverage heuristic (DDCH), also presented in this paper. Borrowing from the design philosophy of the zone routing protocol, VBR limits the proactive link information exchange to the local routing zones only. Furthermore, the reactive component of VBR restricts the route queries to within the virtual backbone only, thus improving the overall routing efficiency. Our numerical results suggest that the cost of the hybrid VBR scheme can be a small fraction of that of either one of the purely proactive or purely reactive protocols, with or without route caching. Since the data routes do not necessarily pass through the virtual backbone nodes, traffic congestion is considerably reduced. Yet, the average length of the VBR routes tends to be close to optimal. Compared with the traditional one-hop hierarchical protocols, our results indicate that, for a network of moderate to large size, VBR with an optimal zone radius larger than one can significantly reduce the routing traffic. Furthermore, we demonstrate VBR's improved scalability through analysis and simulations.     

Gossip-based ad hoc routing

Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations of flooding, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes. Our results suggest that the improvement should be even more significant in larger networks.     

Preparation and Luminescent Properties of Eu^3＋ Doped Calcium Phosphate Nanocrystalline

The nanocrystalline Eu^3＋ doped calcium phosphate was prepared by calcining precursors, which were got by precipitation method combined with ultrasound treatment and some polysaccharide. The existence of Eu^3＋ inhibited the reaction of Na^＋ ion and SO4^2- radical with apatite and resulted in the transformation of HAP to β- TCP by replacing the calcium ions. The strongest excitation peak was at 393 nm, and other lower peaks were at 361 nm, 375 nm, 381 nm, 418nm. The strongest emission spectrum appeared at about 618nm. The emission peak （579 nm） showed that Eu^3＋ ions distributed on Ca^2＋ sites of the apatitic structure.     

Considering Prework on Industrial Projects

Prefabrication, preassembly, modularization, and off-site fabrication, collectively termed as prework have become more viable with recent advances in design and information technologies. These construction methods offer a substantial opportunity to improve project performance when circumstances merit. Successful implementation of these methods on a particular project requires systematic analysis and early decision making based on specific factors of the project. This paper identifies those factors influencing decisions on the use of prework, and current industry practices for evaluating the applicability of prework on industrial projects. It then presents a decision framework to assist industry practitioners with evaluating the applicability of prework on their project, and describes a computerized tool to aid project teams in the decision-making process. The developed framework and tool are useful and effective in the decision-making process, and easy to use, as validated by practitioners in the industry.