An Assisted Diagnosis of Alzheimer’s Disease Incorporating Attention Mechanisms Med-3D Transfer Modeling

Alzheimer’s disease(AD)is a complex,progressive neurodegenerative disorder.The subtle and insidious onset of its pathogenesis makes early detection of a formidable challenge in both contemporary neuroscience and clinical practice.In this study,we introduce an advanced diagnostic methodology rooted in theMed-3D transfermodel and enhanced with an attention mechanism.We aim to improve the precision of AD diagnosis and facilitate its early identification.Initially,we employ a spatial normalization technique to address challenges like clarity degradation and unsaturation,which are commonly observed in imaging datasets.Subsequently,an attention mechanism is incorporated to selectively focus on the salient features within the imaging data.Building upon this foundation,we present the novelMed-3D transfermodel,designed to further elucidate and amplify the intricate features associated withADpathogenesis.Our proposedmodel has demonstrated promising results,achieving a classification accuracy of 92%.To emphasize the robustness and practicality of our approach,we introduce an adaptive‘hot-updating’auxiliary diagnostic system.This system not only enables continuous model training and optimization but also provides a dynamic platform to meet the real-time diagnostic and therapeutic demands of AD.

A fault recognition method based on clustering linear regression

Aiming at the problems of low accuracy,long time consumption,and failure to obtain quantita-tive fault identification results of existing automatic fault identification technic,a fault recognition method based on clustering linear regression is proposed.Firstly,Hough transform is used to detect the line segment of the enhanced image obtained by the coherence cube algorithm.Secondly,the endpoint of the line segment detected by Hough transform is taken as the key point,and the adaptive clustering linear regression algorithm is used to cluster the key points adaptively according to the lin-ear relationship between them.Finally,a fault is generated from each category of key points based on least squares curve fitting method to realize fault identification.To verify the feasibility and pro-gressiveness of the proposed method,it is compared with the traditional method and the latest meth-od on the actual seismic data through experiments,and the effectiveness of the proposed method is verified by the experimental results on the actual seismic data.

Bio-Inspired Optimal Dispatching of Wind Power Consumption Considering Multi-Time Scale Demand Response and High-Energy Load Participation

Bio-inspired computer modelling brings solutions fromthe living phenomena or biological systems to engineering domains.To overcome the obstruction problem of large-scale wind power consumption in Northwest China,this paper constructs a bio-inspired computer model.It is an optimal wind power consumption dispatching model of multi-time scale demand response that takes into account the involved high-energy load.First,the principle of wind power obstruction with the involvement of a high-energy load is examined in this work.In this step,highenergy load model with different regulation characteristics is established.Then,considering the multi-time scale characteristics of high-energy load and other demand-side resources response speed,a multi-time scale model of coordination optimization is built.An improved bio-inspired model incorporating particle swarm optimization is applied to minimize system operation and wind curtailment costs,as well as to find the most optimal energy configurationwithin the system.Lastly,we take an example of regional power grid in Gansu Province for simulation analysis.Results demonstrate that the suggested scheduling strategy can significantly enhance the wind power consumption level and minimize the system’s operational cost.

A PSO Improved with Imbalanced Mutation and Task Rescheduling for Task Offloading in End-Edge-Cloud Computing

To serve various tasks requested by various end devices with different requirements,end-edge-cloud(E2C)has attracted more and more attention from specialists in both academia and industry,by combining both benefits of edge and cloud computing.But nowadays,E2C still suffers from low service quality and resource efficiency,due to the geographical distribution of edge resources and the high dynamic of network topology and user mobility.To address these issues,this paper focuses on task offloading,which makes decisions that which resources are allocated to tasks for their processing.This paper first formulates the problem into binary non-linear programming and then proposes a particle swarm optimization(PSO)-based algorithm to solve the problem.The proposed algorithm exploits an imbalance mutation operator and a task rescheduling approach to improve the performance of PSO.The proposed algorithm concerns the resource heterogeneity by correlating the probability that a computing node is decided to process a task with its capacity,by the imbalance mutation.The task rescheduling approach improves the acceptance ratio for a task offloading solution,by reassigning rejected tasks to computing nodes with available resources.Extensive simulated experiments are conducted.And the results show that the proposed offloading algorithm has an 8.93%–37.0%higher acceptance ratio than ten of the classical and up-to-date algorithms,and verify the effectiveness of the imbalanced mutation and the task rescheduling.

A wireless geophone based on STM32

Seismic geophone is the key instrument for seismic data acquisition in the fields of oil and gas exploration and other relevant fields.It plays an important role in data quality,subsequent processing and interpretation.Aiming at the shortcomings of the existing geophones,such as large volume,heavy weight,unable to monitor in real-time,and heavy workload of data transmission and storage,this paper designs and implements a wireless geophone based on STM32 embedded microcontroller.It is mainly composed of STM32 microcontroller,acceleration sensor,global positioning system(GPS)module,Wi-Fi module and real-time seismic data receiving and processing module.Firstly,the acceleration of vibration in three directions is sensed by the acceleration sensor;secondly,the sampling and analog-to-digital conversion of the vibration data is controlled by the microcontroller;thirdly,the vibration and GPS data are sent to the personal computer(PC)through Wi-Fi,and the personal coomputer PC-side software module completes the reception,display,monitoring and storage of the seismic data;finally,the feasibility and effectiveness of the designed wireless geophone are verified through actual seismic data acquisition experiments.

基于C/S结构的分布式数字视频监控系统的设计和实现

结合当前视频技术、计算机网络技术、通信技术的发展,介绍了基于C/S结构的分布式数字视频监控系统的设计和实现,详细描述了各模块的功能与实现,对系统中的关键技术,如C/S结构、视频编码技术和网络实时传输技术等进行了讨论。

A Resistant Quantum Key Exchange Protocol and Its Corresponding Encryption Scheme

The emergence of quantum computer will threaten the security of existing public-key cryptosystems,including the Diffie Hellman key exchange protocol,encryption scheme and etc,and it makes the study of resistant quantum cryptography very urgent.This motivate us to design a new key exchange protocol and encryption scheme in this paper.Firstly,some acknowledged mathematical problems was introduced,such as ergodic matrix problem and tensor decomposition problem,the two problems have been proved to NPC hard.From the computational complexity prospective,NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them.From the algebraic structures prospective,non-commutative cryptography has been considered to resist quantum.The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures,so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures.Secondly,a new problem was constructed based on the introduced problems in this paper,then a key exchange protocol and a public key encryption scheme were proposed based on it.Finally the security analysis,efficiency,recommended parameters,performance evaluation and etc.were also been given.The two schemes has the following characteristics,provable security,security bits can be scalable,to achieve high efficiency,quantum resistance,and etc.

System Architecture and Key Technologies of Network Security Situation Awareness System YHSAS

Network Security Situation Awareness System YHSAS acquires,understands and displays the security factors which cause changes of network situation,and predicts the future development trend of these security factors.YHSAS is developed for national backbone network,large network operators,large enterprises and other large-scale network.This paper describes its architecture and key technologies:Network Security Oriented Total Factor Information Collection and High-Dimensional Vector Space Analysis,Knowledge Representation and Management of Super Large-Scale Network Security,Multi-Level,Multi-Granularity and Multi-Dimensional Network Security Index Construction Method,Multi-Mode and Multi-Granularity Network Security Situation Prediction Technology,and so on.The performance tests show that YHSAS has high real-time performance and accuracy in security situation analysis and trend prediction.The system meets the demands of analysis and prediction for large-scale network security situation.

Design and Implementation of Weibo Sentiment Analysis Based on LDA and Dependency Parsing

Information content security is a branch of cyberspace security. How to effectively manage and use Weibo comment information has become a research focus in the field of information content security. Three main tasks involved are emotion sentence identification and classification,emotion tendency classification,and emotion expression extraction. Combining with the latent Dirichlet allocation(LDA) model,a Gibbs sampling implementation for inference of our algorithm is presented,and can be used to categorize emotion tendency automatically with the computer. In accordance with the lower ratio of recall for emotion expression extraction in Weibo,use dependency parsing,divided into two categories with subject and object,summarized six kinds of dependency models from evaluating objects and emotion words,and proposed that a merge algorithm for evaluating objects can be accurately evaluated by participating in a public bakeoff and in the shared tasks among the best methods in the sub-task of emotion expression extraction,indicating the value of our method as not only innovative but practical.

“In-VM”模型的隐藏代码检测模型(英文)

Security tools are rapidly developed as network security threat is becoming more and more serious.To overcome the fundamental limitation of traditional host-based anti-malware system which is likely to be deceived and attacked by malicious codes,VMM-based anti-malware systems have recently become a hot research field.In this article,the existing malware hiding technique is analyzed,and a detecting model for hidden process based on "In-VM" idea is also proposed.Based on this detecting model,a hidden process detection technology which is based on HOOK SwapContext on the VMM platform is also implemented successfully.This technology can guarantee the detecting method not to be attacked by malwares and also resist all the current process hiding technologies.In order to detect the malwares which use remote injection method to hide themselves,a method by hijacking sysenter instruction is also proposed.Experiments show that the proposed methods guarantee the isolation of virtual machines,can detect all malware samples,and just bring little performance loss.

Digital chaotic sequence generator based on coupled chaotic systems

Chaotic systems perform well as a new rich source of cryptography and pseudo-random coding. Unfortunately their digital dynamical properties would degrade due to the finite computing precision. Proposed in this paper is a modified digital chaotic sequence generator based on chaotic logistic systems with a coupling structure where one chaotic subsystem generates perturbation signals to disturb the control parameter of the other one. The numerical simulations show that the length of chaotic orbits, the output distribution of chaotic system, and the security of chaotic sequences have been greatly improved. Moreover the chaotic sequence period can be extended at least by one order of magnitude longer than that of the uncoupled logistic system and the difficulty in decrypting increases 2^128＊2^128 times indicating that the dynamical degradation of digital chaos is effectively improved. A field programmable gate array （FPGA） implementation of an algorithm is given and the corresponding experiment shows that the output speed of the generated chaotic sequences can reach 571.4 Mbps indicating that the designed generator can he applied to the real-time video image encryption.

Depth Similarity Enhanced Image Summarization Algorithm for Hole-Filling in Depth Image-Based Rendering

In free viewpoint video(FVV)and 3DTV,the depth image-based rendering method has been put forward for rendering virtual view video based on multi-view video plus depth(MVD) format.However,the projection with slightly different perspective turns the covered background regions into hole regions in the rendered video.This paper presents a depth enhanced image summarization generation model for the hole-filling via exploiting the texture fidelity and the geometry consistency between the hole and the remaining nearby regions.The texture fidelity and the geometry consistency are enhanced by drawing texture details and pixel-wise depth information into the energy cost of similarity measure correspondingly.The proposed approach offers significant improvement in terms of 0.2dB PSNR gain,0.06 SSIM gain and subjective quality enhancement for the hole-filling images in virtual viewpoint video.

Dependence-Induced Risk: Security Metrics and Their Measurement Framework

Despite the tremendous effort made by industry and academia,we are still searching for metrics that can characterize Cyberspace and system security risks. In this paper,we study the class of security risks that are inherent to the dependence structure in software with vulnerabilities and exhibit a "cascading" effect. We present a measurement framework for evaluating these metrics,and report a preliminary case study on evaluating the dependence-induced security risks in the Apache HTTP Server. The experiment results show that our framework can not only clearly analyze the root cause of the security risks but also quantitatively evaluate the attack consequence of the risks.

MAVP-FE:Multi-Authority Vector Policy Functional Encryption with Efficient Encryption and Decryption

In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every ciphertext is specified with an access policy,a decryptor can access the data if and only if his secret key matches with the access policy.However,the FE cannot be directly applied to construct access control scheme due to the exposure of the access policy which may contain sensitive information.In this paper,we deal with the policy privacy issue and present a mechanism named multi-authority vector policy(MAVP) which provides hidden and expressive access policy for FE.Firstly,each access policy is encoded as a matrix and decryptors can only obtain the matched result from the matrix in MAVP.Then,we design a novel function encryption scheme based on the multi-authority spatial policy(MAVPFE),which can support privacy-preserving yet non-monotone access policy.Moreover,we greatly improve the efficiency of encryption and decryption in MAVP-FE by shifting the major computation of clients to the outsourced server.Finally,the security and performance analysis show that our MAVP-FE is secure and efficient in practice.

FACOR：Flexible Access Control with Outsourceable Revocation in Mobile Clouds

Access control is a key mechanism to secure outsourced data in mobile clouds. Some existing solutions are proposed to enforce flexible access control on outsourced data or reduce the computations performed by mobile devices. However, less attention has been paid to the efficiency of revocation when there are mobile devices needed to be revoked. In this paper, we put forward a new solution, referred to as flexible access control with outsourceable revocation(FACOR) for mobile clouds. The FACOR applies the attribute-based encryption to enable flexible access control on outsourced data, and allows mobile users to outsource the time-consuming encryption and decryption computations to proxies, with only requiring attributes authorization to be fully trusted. As an advantageous feature, FACOR provides an outsourceable revocation for mobile users to reduce the complicated attribute-based revocation operations. The security analysis shows that our FACOR scheme achieves data security against collusion attacks and unauthorized accesses from revoked users. Both theoretical and experimental results confirm that our proposed scheme greatly reliefs the mobile devices from heavy encryption and decryption computations, as well as the complicated revocation of access rights in mobile clouds.

Pedestrian Attributes Recognition in Surveillance Scenarios with Hierarchical Multi-Task CNN Models

Pedestrian attributes recognition is a very important problem in video surveillance and video forensics. Traditional methods assume the pedestrian attributes are independent and design handcraft features for each one. In this paper, we propose a joint hierarchical multi-task learning algorithm to learn the relationships among attributes for better recognizing the pedestrian attributes in still images using convolutional neural networks(CNN). We divide the attributes into local and global ones according to spatial and semantic relations, and then consider learning semantic attributes through a hierarchical multi-task CNN model where each CNN in the first layer will predict each group of such local attributes and CNN in the second layer will predict the global attributes. Our multi-task learning framework allows each CNN model to simultaneously share visual knowledge among different groups of attribute categories. Extensive experiments are conducted on two popular and challenging benchmarks in surveillance scenarios, namely, the PETA and RAP pedestrian attributes datasets. On both benchmarks, our framework achieves superior results over the state-of-theart methods by 88.2% on PETA and 83.25% on RAP, respectively.

Intrusion Detection Model Based on Incomplete Information Ga me in Wireless Mesh Networks

Wireless Mesh Networks (WMNs) have many applications in homes, schools, enterprises, and public places because of their useful characteristics, such as high bandwidth, high speed, and wide coverage. However, the security of wireless mesh networks is a precondition for practical use. Intrusion detection is pivotal for increasing network security. Considering the energy limitations in wireless mesh networks, we adopt two types of nodes: Heavy Intrusion Detection Node (HIDN) and Light Intrusion Detection Node (LIDN). To conserve energy, the LIDN detects abnormal behavior according to probability, while the HIDN, which has sufficient energy, is always operational. In practice, it is very difficult to acquire accurate information regarding attackers. We propose an intrusion detection model based on the incomplete information game (ID-IIG). The ID-IIG utilizes the Harsanyi transformation and Bayesian Nash equilibrium to select the best strategies of defenders, although the exact attack probability is unknown. Thus, it can effectively direct the deployment of defenders. Through experiments, we analyze the performance of ID-IIG and verify the existence and attainability of the Bayesian Nash equilibrium.

Cryptanalysis of Cryptosystems Based on General Linear Group

Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.

Collaborative Reversing of Input Formats and Program Data Structures for Security Applications

Reversing the syntactic format of program inputs and data structures in binaries plays a vital role for understanding program behaviors in many security applications.In this paper,we propose a collaborative reversing technique by capturing the mapping relationship between input fields and program data structures.The key insight behind our paper is that program uses corresponding data structures as references to parse and access different input fields,and every field could be identified by reversing its corresponding data structure.In details,we use a finegrained dynamic taint analysis to monitor the propagation of inputs.By identifying base pointers for each input byte,we could reverse data structures and conversely identify fields based on their referencing data structures.We construct several experiments to evaluate the effectiveness.Experiment results show that our approach could effectively reverse precise input formats,and provide unique benefits to two representative security applications,exploit diagnosis and malware analysis.

Super-Resolution for Face Image with an Improved K-NN Search Strategy

Recently, neighbor embedding based face super-resolution(SR) methods have shown the ability for achieving high-quality face images, those methods are based on the assumption that the same neighborhoods are preserved in both low-resolution(LR) training set and high-resolution(HR) training set. However, due to the "one-to-many" mapping between the LR image and HR ones in practice, the neighborhood relationship of the LR patch in LR space is quite different with that of the HR counterpart, that is to say the neighborhood relationship obtained is not true. In this paper, we explore a novel and effective re-identified K-nearest neighbor(RIKNN) method to search neighbors of LR patch. Compared with other methods, our method uses the geometrical information of LR manifold and HR manifold simultaneously. In particular, it searches K-NN of LR patch in the LR space and refines the searching results by re-identifying in the HR space, thus giving rise to accurate K-NN and improved performance. A statistical analysis of the influence of the training set size and nearest neighbor number is given, experimental results on some public face databases show the superiority of our proposed scheme over state-of-the-art face hallucination approaches in terms of subjective and objective results as well as computational complexity.