Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Information Data Sharing Method of Electronic Files of Smart Campus Students Against Attribute Tampering

    In the smart campus environment, the sharing of student electronic file information data is crucial for improving data quality and application efficiency. However, security issues in the process of data sharing, especially the risk of tampering with data attributes, have become the main obstacle to the widespread application of data sharing. To address this issue, a smart campus student electronic file information data sharing method that is resistant to attribute tampering has been proposed. This method constructs a consortium chain network with attribute centers as nodes, records user attributes and ciphertext information through blockchain technology, achieves decentralized management of user attributes, ensures tamper proof access to attributes, enhances data security, and provides a solid foundation for subsequent data sharing. On this basis, combined with autonomously set sharing strategies, fine-grained data sharing has been achieved. By using searchable attribute encryption technology, encrypted retrieval of multiple keywords is achieved, improving the convenience and efficiency of data retrieval. At the same time, key parameters such as data elasticity and data granularity were set to known values, and the relationship between the two was determined by calculating the data storage gradient and storage intensity index, achieving cloud storage optimization for shared data. In addition, this method achieves high efficiency and stability in data sharing transmission by detecting the channel with the highest transmission rate in real-time and selecting the optimal shared link at the best time. The experimental results show that this method can not only effectively achieve data encryption and storage, but also effectively resist tampering attacks on data attributes, significantly improving the application efficiency of data.

  • articleNo Access

    TWO-SPECIES ASYMMETRIC EXCLUSION PROCESS WITH SITE SHARING

    This letter investigates the two-species asymmetric simple exclusion process (ASEP) with site sharing on a ring. The contribution of this study as compared to previous two-species ASEP models is that the oppositely moving particles do not pass each other by an exchanging mechanism but by sharing a site (characterized by sharing probability q). The model is investigated under random update and with periodic boundary conditions using Monte Carlo simulations and a cluster-based mean-field calculation. In the symmetric case (densities of two-species particles are equal), the simulation results show that there is a plateau in the current–density relationship for intermediate particle densities. The plateau corresponds to the maximal current and the plateau region shrinks with the increase of q. In the asymmetric case, the plateau is not observed. For comparison we examine the site-exchanging model which means that two-species particles can exchange their positions with a certain probability. The site-exchanging model does not exhibit such a plateau in the current–density relationship.

  • chapterNo Access

    QUESTIONS OF METHOD ON INTEROPERABILITY IN ARCHITECTURE

    Interoperability in architecture illustrates contemporary instances of innovation. It aims, through the standardization of instruments and procedures (and especially through shared languages of/in IT tools and applications), at the optimization of interactions amongst agents and the work done.

    It requires, within a consistently non-reductionist systemic approach: (1) interactions and activities of conscious government in/amongst its fundamental component parts (politics, technical aspects, semantics); (2) development of shared languages and protocols, to verify technical, poietic, etc., innovations which do not destroy accumulative effects and peculiarities (axiological, fruitional, etc.).