On Two Types of Stability of Solutions to a Pair of Damped Coupled Nonlinear Evolution Equations

The stability of a set of spatially constant plane wave solutions to a pair of damped coupled nonlinear Schrödinger evolution equations is considered. The equations could model physical phenomena arising in fluid dynamics, fibre optics or electron plasmas. The main result is that any small perturbation to the solution remains small for all time. Here small is interpreted as being both in the supremum sense and the square integrable sense.

Decision-Aiding Transit-Tracker Methodology for Bus Scheduling Using Real Time Information to Ameliorate Traffic Congestion in the Kathmandu Valley of Nepal

The bustling urban environment of Kathmandu Valley is characterized by unprecedented traffic congestion. Due to its bowel-shaped geography, gusty winds rarely remove vehicular emissions from the urban atmosphere, making Kathmandu one of Asia’s most polluted cities, 100th city in global pollution index. Over 500,000 vehicles travel daily on over 1600 km of roads covering over 675 sq·km urban area. Thousands of low occupancy vehicles are added each year to the urban public transit system (UPTS). Kathmandu faces worse and unreliable traffic from the current UPTS mostly with low occupancy vehicles. Around 4.5 million urban denizens, both permanent and transient residents, suffer from unreliable UPTS. Traffic rules and daily transportation schedules are rarely followed, resulting in frequent traffic jams and accidents. Once experienced, visitors try avoiding the UPTS. Tourism, annually contributing almost 8 percent to Nepal’s total annual GDP, also suffers from poor UPTS. Planners, policy makers, and politicians (P-actors) are seeking ways to improve sustainable UPTS to ameliorate stresses to family life and working hours for the urban majority. Aiming to help P-actors, we propose a transit-tracker model that uses real time information (RTI) in mobile phones and web-embedded devices to inform travelers, drivers, government authorities, and sub-admins. We argue that unreliability in the UPTS motivates urban elites to add more low occupancy vehicles, which in turn reduces already shrunken urban spaces and contributes more per capita air pollution than multi-occupancy vehicles. Since mobile and smart phones are capable of processing RTI to generate meaningful information and inform various stakeholders in communicable languages, we argue that replacing low occupancy vehicles with multi-occupancy buses within a Bus Rapid Transit (BRT) system, on main roads with fixed schedules and strict traffic rules, would not only improve UPTS, but also reduce pollution in the Kathmandu Valley.

Data Secure Storage Mechanism for IIoT Based on Blockchain

With the development of Industry 4.0 and big data technology,the Industrial Internet of Things(IIoT)is hampered by inherent issues such as privacy,security,and fault tolerance,which pose certain challenges to the rapid development of IIoT.Blockchain technology has immutability,decentralization,and autonomy,which can greatly improve the inherent defects of the IIoT.In the traditional blockchain,data is stored in a Merkle tree.As data continues to grow,the scale of proofs used to validate it grows,threatening the efficiency,security,and reliability of blockchain-based IIoT.Accordingly,this paper first analyzes the inefficiency of the traditional blockchain structure in verifying the integrity and correctness of data.To solve this problem,a new Vector Commitment(VC)structure,Partition Vector Commitment(PVC),is proposed by improving the traditional VC structure.Secondly,this paper uses PVC instead of the Merkle tree to store big data generated by IIoT.PVC can improve the efficiency of traditional VC in the process of commitment and opening.Finally,this paper uses PVC to build a blockchain-based IIoT data security storage mechanism and carries out a comparative analysis of experiments.This mechanism can greatly reduce communication loss and maximize the rational use of storage space,which is of great significance for maintaining the security and stability of blockchain-based IIoT.

An Efficient and Privacy-Preserving Data Aggregation Scheme Supporting Arbitrary Statistical Functions in IoT

The Internet of Things(IoT)has profoundly impacted our lives and has greatly revolutionized our lifestyle.The terminal devices in an IoT data aggregation application sense real-time data for the remote cloud server to achieve intelligent decisions.However,the high frequency of collecting user data will raise people concerns about personal privacy.In recent years,many privacy-preserving data aggregation schemes have been proposed.Unfortunately,most existing schemes cannot support either arbitrary aggregation functions,or dynamic user group management,or fault tolerance.In this paper,we propose an efficient and privacy-preserving data aggregation scheme.In the scheme,we design a lightweight encryption method to protect the user privacy by using a ring topology and a random location sequence.On this basis,the proposed scheme supports not only arbitrary aggregation functions,but also flexible dynamic user management.Furthermore,the scheme achieves faulttolerant capabilities by utilizing a future data buffering mechanism.Security analysis reveals that the scheme can achieve the desired security properties,and experimental evaluation results show the scheme's efficiency in terms of computational and communication overhead.

AN IMAGE RETRIEVAL METHOD BASED ON SPATIAL DISTRIBUTION OF COLOR

Color histogram is now widely used in image retrieval. Color histogram-based image retrieval methods are simple and efficient but without considering the spatial distribution information of the color. To overcome the shortcoming of conventional color histogram-based image retrieval methods, an image retrieval method based on Radon Transform (RT) is proposed. In order to reduce the computational complexity, wavelet decomposition is used to compress image data. Firstly, images are decomposed by Mallat algorithm. The low-frequency components are then projected by RT to generate the spatial color feature. Finally the moment feature matrices which are saved along with original images are obtained. Experimental results show that the RT based retrieval is more accurate and efficient than traditional color histogram-based method in case that there are obvious objects in images. Further more, RT based retrieval runs significantly faster than the traditional color histogram methods.

基于ROI的压缩域多谱段遥感图像的检索

根据JPEG2000对感兴趣区域优先编码,以及感兴趣区域的形状可随意选取的特点,提出了一种在JPEG2000压缩码流不完全解码的情况下,实现多谱段遥感图像感兴趣目标的检索方法,该方法利用了遥感图像的性质,根据例子图像的谱特征对感兴趣区域的内容进行分析,并设计了一套相似性度量的方法。实验结果表明,此方法有较理想的图像检索效果和很高的检索效率,解决了应用上对实时性的高要求与遥感图像库数据海量性之间的矛盾。

Distributed Secure Storage Scheme Based on Sharding Blockchain

Distributed storage can store data in multiple devices or servers to improve data security.However,in today’s explosive growth of network data,traditional distributed storage scheme is faced with some severe challenges such as insufficient performance,data tampering,and data lose.A distributed storage scheme based on blockchain has been proposed to improve security and efficiency of traditional distributed storage.Under this scheme,the following improvements have been made in this paper.This paper first analyzes the problems faced by distributed storage.Then proposed to build a new distributed storage blockchain scheme with sharding blockchain.The proposed scheme realizes the partitioning of the network and nodes by means of blockchain sharding technology,which can improve the efficiency of data verification between nodes.In addition,this paper uses polynomial commitment to construct a new verifiable secret share scheme called PolyVSS.This new scheme is one of the foundations for building our improved distributed storage blockchain scheme.Compared with the previous scheme,our new scheme does not require a trusted third party and has some new features such as homomorphic and batch opening.The security of VSS can be further improved.Experimental comparisons show that the proposed scheme significantly reduces storage and communication costs.

Erratum to:A new methodology for noninvasive measurement of local stress in soft materials[Sci.China-Phys.Mech.Astron.66,104631(2023)]

In this paper[1],Figure 1(a)is identical to,but is meant to be different from,Figure 1(b).This mistake was made in the type-setting process and missed at the proof-checking stage.The correct version of Figure 1(a)and(b)is shown below.

A new methodology for noninvasive measurement of local stress in soft materials

All materials and structures in use are under some forms of stress,and there are many situations where it is desirable to interrogate the state of such stresses non-destructively.When such prestressed materials transmit small-amplitude waves,the speed of each type of wave will be a function of the prestress as well as the material properties.This fact provides a means to determine the prestress and material properties by measuring various wave speeds(known as acoustoelasticity).

MATRIX-AGENT FRAMEWORK: A VIRTUAL PLATFORM FOR MULTI-AGENTS

Multi-agent technology has been applied extensively to many areas, including Decision Support Systems （DSS）. However, the applications of multi-agent technology in DSS are still very preliminary. Most of the current agent frameworks, such as middle-agent-based or agent-facilitator-based frameworks, are basically agent-to-agent model. These agent-based frameworks often neglect the living environment for agents and they suffer from： （i） inability to adapt to the environment, （ii） inability to self-upgrade, and （iii） inefficiency in information acquisition. Here, we introduce a recently proposed multi-agent framework, namely Agent-based Open Connectivity for Decision Support Systems （AOCD）. In this new framework, the communication and cooperation between agents are through a key component, the Matrix, which provides a virtual platform for agents. We use a unified Matrices framework to solve the bottleneck problem in the AOCD framework. Our experimental results based on different agent network topologies indicate that the hybrid topology presents superior performance compared with the centralised and decentralised topologies.

Marcinkiewicz integrals with rough kernels in H^(1)(s^(n-1))

This paper is devoted to studying the Marcinkiewicz integral operators associated to polynomial compound curves.Some new bounds for the above operators on the Lebesgue,Triebel-Lizorkin,and Besov spaces are established by assuming that their rough kernels are given byΩ∈H^(1)(s^(n-1))and h∈Δ_(γ)(R_(+))for someγ>1.It should be pointed out that the bounds are independent of h,Ω,γ,and the coefficients of the polynomials in the definition of the operators.