Decidability and complexity of Petri nets with unordered data

We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We encode ν-PN into Petri Data Nets, so that coverability, termination and boundedness are decidable. Moreover, we obtain Ackermann-hardness results for all our decidable decision problems. Then we consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. Here we prove that its complexity is also non-primitive recursive. Then we prove undecidability of depth-boundedness. Finally, we prove that the corresponding “place version” of all the boundedness problems is undecidable for ν-PN. These results carry over to Petri Data Nets.     

Face tracking with automatic model construction

This paper describes an active model with a robust texture model built on-line. The model uses one camera and it is able to operate without active illumination. The texture model is defined by a series of clusters, which are built in a video sequence using previously encountered samples. This model is used to search for the corresponding element in the following frames. An on-line clustering method, named leaderP is described and evaluated on an application of face tracking. A 20-point shape model is used. This model is built offline, and a robust fitting function is used to restrict the position of the points. Our proposal is to serve as one of the stages in a driver monitoring system. To test it, a new set of sequences of drivers recorded outdoors and in a realistic simulator has been compiled. Experimental results for typical outdoor driving scenarios, with frequent head movement, turns and occlusions are presented. Our approach is tested and compared with the Simultaneous Modeling and Tracking (SMAT) [1], and the recently presented Stacked Trimmed Active Shape Model (STASM) [2], and shows better results than SMAT and similar fitting error levels to STASM, with much faster execution times and improved robustness.     

Probabilistic approximations of ODEs based bio-pathway dynamics

Bio-chemical networks are often modeled as systems of ordinary differential equations (ODEs). Such systems will not admit closed form solutions and hence numerical simulations will have to be used to perform analyses. However, the number of simulations required to carry out tasks such as parameter estimation can become very large. To get around this, we propose a discrete probabilistic approximation of the ODEs dynamics. We do so by discretizing the value and the time domain and assuming a distribution of initial states w.r.t. the discretization. Then we sample a representative set of initial states according to the assumed initial distribution and generate a corresponding set of trajectories through numerical simulations. Finally, using the structure of the signaling pathway we encode these trajectories compactly as a dynamic Bayesian network.This approximation of the signaling pathway dynamics has several advantages. First, the discretized nature of the approximation helps to bridge the gap between the accuracy of the results obtained by ODE simulation and the limited precision of experimental data used for model construction and verification. Second and more importantly, many interesting pathway properties can be analyzed efficiently through standard Bayesian inference techniques instead of resorting to a large number of ODE simulations. We have tested our method on ODE models of the EGF-NGF signaling pathway [1] and the segmentation clock pathway [2]. The results are very promising in terms of accuracy and efficiency.     

生物特征计算进展

生物特征计算旨在实现人体生物特征的自动感知与分析,建立生物特征与人的身份、情感、行为、健康情况和美学评价的对应关系的可计算模型.结合作者近十余年来在生物特征计算方面的研究,从生物特征识别、医学和美学生物特征计算三个方面对生物特征计算的进展和趋势进行了介绍和展望.     

Dynamic Network User Equilibrium with State-Dependent Time Lags

This paper recasts the Friesz et al. (1993) measure theoretic model of dynamic network user equibrium as a controlled variational inequality problem involving Riemann integrals. This restatement is done to make the model and its foundations accessible to a wider audience by removing the need to have a background in functional analysis. Our exposition is dependent on previously unavailable necessary conditions for optimal control problems with state-dependent time lags. These necessary conditions, derived in an Appendix, are employed to show that a particular variational inequality control problem has solutions that are dynamic network user equilibria. Our analysis also shows that use of proper flow propagation constraints obviates the need to explicitly employ the arc exit time functions that have complicated numerical implementations of the Friesz et al. (1993) model heretofore. We close by describing the computational implications of numerically determining dynamic user equilibria from formulations based on state-dependent time lags.     

Binding Virtual Environments to Toolkit Capabilities

There are many toolkits and development environments that aid the process of constructing virtual environment applications. Many of these development environments encourage customising a virtual environment's design while rapid prototyping within the confines of a toolkit's capabilities. Thus the choice of the technology and its associated support has been made independent of the end-use requirements of the final system. This can bias a virtual environment's design by implementation based constraints. We propose that an alternative approach is the consideration of virtual environment requirements in the context of an inspectable design model, to identify the requirements that a toolkit will need to support. In the context of an example, we present a selection of design requirements that we consider important for virtual environment design in general. We explore how these requirements might be mapped to different capabilities using Virtual Reality Modelling Language (VRML) as a concrete example of a platform technology.     

The Changing Face of International Cryptography Policy: Part 16 — Export Control Regulation in the United States

In my September and November contributions, I deviated slightly from my usual theme and examined several of the technical and procedural matters associated with Digital Signature technology. Of course, Digital Signature represents one of the less politically sensitive applications of cryptographic technology, although it is undoubtedly destined to become one of the most pervasive.     

The Ins and Outs of Intrusion Detection

The information available both as input to, and as output from, any given intrusion detection apparatus is a function of where it is placed in a network architecture. In particular, placing an intrusion detection apparatus on the inside (i.e. between one’s perimeter defenses and one’s inner operations) will yield significantly different results than placing that same apparatus on the outside (i.e. between one’s perimeter defenses and the rest of the world). This writing examines these differences.     

QoS Filtering and Resource Reservation in an Internet Environment

Multimedia group applications often operate in an environment where the various participants are located on systems and communication links with different capabilities. Mechanisms are required that ensure full-quality media for high-performance workstations but lower-quality media for playout at low-end systems. QoS filters have been proposed as a way to adapt QoS to the user specified level by changing the structure of a media stream in a well defined way. Resource reservation and QoS filter instantiation should be closely integrated since both represent one particular aspect of the provision of individualistic QoS for heterogeneous users in multipeer communications. The Internet reservation protocol RSVP is receiver oriented and allows each receiver to specify its resource requirements. However, no actual mechanisms are defined that adapt the data stream to the receiver specified QoS requirements.In this paper we present an enhanced version of RSVP (called RSVP++) that integrates resource reservation and QoS filter control. In order to achieve this integration we extend the RSVP functional model and define a new QoS service class. RSVP++ can coexist with common RSVP systems, thus, openness and interoperability of the system are ensured.     

Computer-aided development of a real-time program

The refinement calculus is a well-established theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how refinement theory and tool support can be extended for a program with real-time constraints. The approach adapts a timed variant of the refinement calculus and makes corresponding enhancements to a theorem-prover based refinement tool.