The hedonic price model (HPM) has been widely used to investigate the association between neighborhoods and housing prices. Empirical studies of HPM assume that mixed land use, accessibility, and housing structures generate a substantial premium in housing prices and follow linear relationships, with less attention paid to their nonlinear effects. To fill this gap, this study integrates transaction records over 57,842 housing units in Shanghai and explainable artificial intelligence methods to examine the nonlinear effects of public service amenities, private service amenities, and street view on housing prices. We identified the global threshold effects and their ranges, as well as the local explanations for the price forecast of each housing unit. Nonlinear analysis showed that all public service amenities and some private service amenities (e.g., entertainment) are positively related to housing prices within a certain range, while shopping and carting services are negatively related. Furthermore, the percentage of green pixels in street view images presented a nearly linear relation to housing prices. Residents in Shanghai have paid a premium of about 2000 yuan/m2 for a higher green view. This study contributes to a better understanding of the relationships between housing units and their neighborhoods as well as guidance for the scientific and reasonable formulation of housing prices.

In order to meet the rapid positioning of 12315 complaints, aiming at the natural language expression of telephone complaints, a semantic retrieval framework is proposed which is based on natural language parsing and geographical names ontology reasoning. Among them, a search result ranking and recommended algorithms is proposed which is regarding both geo-name conceptual similarity and spatial geometry relation similarity. The experiments show that this method can assist the operator to quickly find location of 12,315 complaints, increased industry and commerce customer satisfaction.

The rapid development of Web service technologies has dramatically increased the quantity of available web services. Hence, it becomes a challenging task to efficiently discover services that exactly match user requirements from the large and growing service library. The rule-based semantic web service discovery strategy proposed in this paper documents the formal description of semantic web service, rule, and service matching etc. Service matching which is regarded as rule-based reasoning problem in this paper achieved by knowledge-base and reasoning technologies. IO-based matching services is to discovery the user required service via matching the service's input/output and user-desired input/output. In real life, the implementation of many services need to meet the more complicated pre-conditions (Preconditions) and effects., such as the implementation of some services need to have authorization (the Authorized), also have some effect (Effects,) after the service execution.This paper use the IO-based matching service discovery algorithm as the basis and improve the service discovery's accuracy by adding the matching of the precondition and effect of service. In this paper, a rule-based reasoning mechanism is proposed to implement IOPE services matching algorithm, some experiment are conducted to verify the feasibility and effectiveness of the algorithm.

Certificateless public key cryptography reduces the difficult problem of key management in traditional public key cryptography,it also eliminates the key-escrow problem of identity-based cryptography and also preserves all of its advantages. A the lowest calculating time forward secure ring signature scheme is proposed,it can resist forgery attacks from the secret key generation center and can meet with the requirements of unconditional anonymity of signers, it can resist forgery attacks as the secret keys of signer is revealed ,so it is suitable to the application of high security and anonymity.

Embedded GPS navigation, based on embedded platform technology, through GPS and GIS and combined with handheld devices, achieves target location, path calculation, route guidance and surrounding search functions of mobile users. This paper, Symbian OS mobile phones as the terminal, background Linux servers providing the mapping service, path calculation, route guidance, networking search, location query and other functions, using GPRS, WIFI and other wireless communication modes, achieves navigation services provided by professional navigation mobile phones on lightweight thin-client, and, at the same time, takes advantage of mobile phone communication to achieve a certain degree of user interaction. Thus, based on the user interface on Symbian platform, GPS, data persistence layer, audio and network programming, an overall solution is proposed and the corresponding key technologies involved are discussed.

Viruses remain a significant threat to computer networks.The rate at which a virus can spread has risen dramatically with the increase in connectivity.Thorough researches of computer virus propagation are very important and urgently needed.But the spreading methods of computer viruses are different.One simple model is hard to describe all the types.On the contrary,different models should be proposed according to the features of different types of viruses.This article proposed a computer virus propagation model to describe those viruses spreading in the network through the method of file-sharing.This model takes the files in the sharing network as the subjects instead of the computers,which are always used in the traditional models,and analyses the influence of the ratio of specific type files in the network and the function of file accessing frequency.So the characters of virus can be analyzed more specifically.And the simulation data of this model accords with the actual statistical data very well.

The paper focuses on the BIBA strict integrity policy of the fine-grained XML documents.By analysing the hierarchical constraints of the XML document,the BIBA strict integrity policy is extended to the fine-grained XML documents with a novel rule of the XML nodes.A model of the XML document which supports the integrity property is set up,and the characteristics of the XML document structure is analyzed.An integrity label propagation rule is set up for the partially labeled XML document.The implementation of the integrity policy is discussed.

Computer viruses are great threats to the operating system and the computer network. In order to handle those emergent situations might appear in the future and make corresponding policies immediately; thorough researches of computer virus propagation are very important and urgently needed. But the spreading methods of computer viruses are different; one simple model is unable to describe all the viruses. On the contrary, different models should be proposed according to the features of different types of viruses. This article proposed a computer virus propagation model to describe those viruses spreading through the P2P file-sharing network. This model took the files in the network as subjects instead of the computers,which are always adopted in the traditional models. It also introduced the notion of hot degree and file-type suitability degree over the sharing files to illustrate the virus propagation more specifically. Valuable conclusions we regained from the model. And the simulation data of this model accorded with the actual statistical data very well.

Certificateless cryptography eliminates the need of certificates in the Public Key Infrastructure (PKI) and solves the inherent key escrow problem. Recently, Fan Rui et al. proposed a certificateless proxy signature scheme based on a certificateless signature scheme. They claimed that their scheme satisfied the security requirements of certificateless proxy signature schemes. However, the analysis of their scheme showed that it was insecure against the two kinds of attacks in certificateless cryptosystems, i.e. public key replacement attacks and malicious Key Generating Centre (KGC) attacks. The attack methods and the defensive measures were presented.

A new formal model of security for proxy signature schemes is presented and a provably secure short proxy signature scheme is proposed from bilinear maps. The proposed proxy signature scheme is based on two short secure signature schemes. Finally, a security proof of the proposed proxy signature scheme is showed by reducing directly the security of the proxy scheme to the security of the two basic signature schemes. The proposed proxy signature scheme has the shortest proxy signatures, the proxy signature generation needs no pairing operation and verification needs just one pairing operation.

数字签名具有认证功能,是一些密码协议的重要构造模块.利用双线性映射技术设计了一个有效的在标准模型下可证安全的数字签名方案.基于强Diffie-Hellman假设证明了该签名方案对于适应性选择消息攻击是强存在性不可伪造,并给出了形式化的安全证明.在这个签名方案中,生成签名不需要配对运算,验证签名只需要两次配对运算.在同等安全水平下,这个签名方案的签名长度比基于RSA的签名方案的签名长度短.

Recently,some researchers proposed a forward secure proxy signature scheme and an improved forward-secure proxy signature scheme.This paper analyzed the security of the two proxy signature schemes and pointed out they were insecure and had not the characteristic of forward security at all.The first scheme couldn't resist forgery attack while the secret key of the proxy signer was lost.If adversary knew some public information of the second scheme,he/she could forge proxy signature.

XML's increasing popularity highlights the security need for XML documents.Researchers have paid more attention on discretional access control,role-based access control and view based technology,rather than mandatory access control.A improved mandatory access control model for XML is presented in the paper.The integrity properties for multilevel XML document are proposed in the paper.A novel approach delayed-removing is introduced in order to avoid covert channel.In the paper,the manipulation rules for typical operation of XQuery and XUpdate are created,and the security of the model is discussed.

An aggregate signature scheme is a digital signature scheme that supports aggregation: Given n ordinary signatures on n distinct messages from n distinct ordinary signers, it is possible to aggregate all these signatures into a single short signature. An aggregate proxy signature scheme permits to compress multiple proxy signatures to a single short signature. However, since the previous aggregate signature schemes cannot simultaneously aggregate ordinary signatures and proxy signatures, these schemes is referred as mono-aggregation schemes. A new aggregate scheme is proposed called the hy-brid aggregate signature scheme which supports to condense simultaneously ordinary signatures and proxy signatures to a single short signature.

The paper firstly proposes multisignature with proxy signers combining the concept of forward security. The common multisignature and proxy multisignature are specific to the signature,so the signature is more suitable for various applications.In our scheme,the former multisignature is still valid even if all signers' current secret keys is lost; the scheme is based on forward security which can makes signature more secure,efficient and improves the speed of signature.

This paper gave security analysis of the multisignature schemes——Luo et al.'s forward-secure multisignature scheme based on ElGamal type.The scheme didn't meet property of forward security while some signer's key was compromised.LUO's scheme could't resist forge attack.And finally,proposed the new improved scheme,analysed its security.The scheme can effectively resist forge attack and coordinate attacks.It's a safe,efficient,practical and forward secure multisignature scheme.

The Schnorr signature scheme is a digital signature scheme based on discrete logarithms.Recently some attacks against the Schnorr signature scheme were presented in the literature and they claimed that these new attacks had the greater success probability.However,these attacks were analyzed and the conclusion is that all these new attacks are essentially trivial exhaust search ones.Given certain system security parameters,the success probability of theses attacks is negligible.Moreover,some mistakes in the probability analysis of these attacks were pointed out.

XML’s increasing popularity highlights the security need for XML documents.Researchers have paid more attention on discretional access control,role-based access control and view based technology,rather than mandatory access control.This paper focuses on the REMOVE operation of multilevel XML under the constraint of the hierarchy and the integrity.A novel policy "delayed-removing" is proposed which can avoid convert channel and keep the availability and the secrecy of higher level data element while removing the lower level data element.The integrity constraint and the implement of the policy are also detailed.

Grid security is complicated on account of pervasive resource sharing and dynamic,heterogeneous,multi-domains computing environment.Since the public key infrastructure(PKI)-based grid security infrastructure (GSI) is figured to be not efficient enough for large scaled grid applications,and need third-party authorities keeping online,a combined public key(CPK) based certification mechanism of grid is proposed.Basing on the mathematics principle of discrete log problem,huge quantities of key pairs can be produced by a public and private key matrix,and producing and distributing of huge amount of keys can be realized.Implementing in grid applications,the efficiency of CPK is compared with that of GSI,and the CPK based certification mechanism of grid is proved to be feasible and efficient.

Multi-signature is useful in the case that plural signers generate a signature for a single message.Most previous multi-signature schemes based on RSA only support signing in a serial order.To meet the need of signing in more complex order,we proposed a structured multi-signature scheme based on RSA.The size of the multi-signature and the multi-signature verification computational cost of are the same as that of single RSA signature scheme and the computational cost of signing is proportion to the increase of signers.The security of the proposed scheme is reduced the complexity of inverting RSA.