Mobile Networks and Applications - 5G/6G communication are first generation high speed wireless communication network which integrates the aerial data, terrestrial data and maritime data via... 相似文献
This work is devoted to the stress–strain state of isotropic double curved shell with defect system. The construction is weakened by two non-through thickness (internal) cracks of different length and by a circular hole located between cracks. In this study we use the line-spring model. Within the framework of this model cracks are modeled as mathematical cuts of shell’s middle surface. This leads to a two-dimensional problem. The problem is reduced to a system of eight boundary integral equations. To ensure the uniqueness of solution an additional equation is added. In the numerical solution of the problem special quadrature formulas for singular integrals of Cauchy type and the finite difference method are applied. The influence of defects on each other for double curved shell has been investigated. The given theoretical results can be used for the calculation of structural elements with holes, cracks on the strength and fracture toughness in various branches of engineering. 相似文献
We present a new algorithm,
called MCS-M,
for computing minimal triangulations of graphs.
Lex-BFS, a seminal algorithm for recognizing chordal graphs,
was the genesis for two other classical algorithms:
LEX M and MCS.
LEX M extends the fundamental concept used in Lex-BFS,
resulting in an algorithm that not only recognizes chordality,
but also computes a minimal triangulation of an arbitrary graph.
MCS simplifies the fundamental concept used in Lex-BFS,
resulting in a simpler algorithm for recognizing chordal graphs.
The new algorithm MCS-M combines
the extension of LEX M with the simplification of MCS,
achieving all the results of LEX M in the same time complexity. 相似文献
In order to guarantee security and privacy of sensitive data, attribute-based keyword search (ABKS) enables data owners to upload their encrypted data to cloud servers, and authorizes intended data users to retrieve it. Meanwhile, ABKS outsources heavy search work to cloud servers, which makes ABKS adaptive to mobile computing environment. However, as cloud servers can both generate keyword ciphertexts and run search algorithm, the existing most ABKS schemes are vulnerable to keyword guessing attack. In this paper, we show the fundamental cause that the existing ABKS schemes do not resist keyword guessing attack is any entity can generate keyword ciphertext. To solve the above problem, in the phase of keyword ciphertext generation, we use private key of data owner to sign keyword prior to generating keyword ciphertext. Therefore, any other entity does not forge keyword ciphertext, which can resist keyword guessing attack. We give the formal definition and security model of attributed-based keyword search secure against keyword guessing attack (ABKS-SKGA). Furthermore, we provide an ABKS-SKGA scheme. The ABKS-SKGA scheme is proved secure against chosen-plaintext attack (CPA). Performance analysis shows that the proposed scheme is practical. 相似文献
Neural Computing and Applications - Lung cancer is a deadly disease if not diagnosed in its early stages. However, early detection of lung cancer is a challenging task due to the shape and size of... 相似文献
The study of criminal networks using traces from heterogeneous communication media is acquiring increasing importance in nowadays society. The usage of communication media such as mobile phones and online social networks leaves digital traces in the form of metadata that can be used for this type of analysis. The goal of this work is twofold: first we provide a theoretical framework for the problem of detecting and characterizing criminal organizations in networks reconstructed from phone call records. Then, we introduce an expert system to support law enforcement agencies in the task of unveiling the underlying structure of criminal networks hidden in communication data. This platform allows for statistical network analysis, community detection and visual exploration of mobile phone network data. It enables forensic investigators to deeply understand hierarchies within criminal organizations, discovering members who play central role and provide connection among sub-groups. Our work concludes illustrating the adoption of our computational framework for a real-word criminal investigation. 相似文献
Users are inclined to share sensitive data in a remote server if no strong security mechanism is in place. Searchable encryption satisfies the need of users to execute a search encrypted data. Previous searchable encryption methods such as “public key encryption with keyword search (PEKS)” restricted the data access to certain users, because only the assigned users were able to search the encrypted data. In this paper we will discuss the relation between Attribute Based Encryption (ABE) and searchable encryption and define a weak anonymity of the ABE scheme, named “attribute privacy”. With this weak anonymity, we propose a general transformation from ABE to Attribute Based Encryption with Keyword Search (ABEKS) and a concrete attribute private key-policy ABE (KP-ABE) scheme. We present an ABEKS scheme based on this KP-ABE scheme and permit multi-users to execute a flexible search on the remote encrypted data. 相似文献
With the increasing number of electricity consumers, production, distribution, and consumption problems of produced energy have appeared. This paper proposed an optimization method to reduce the peak demand using smart grid capabilities. In the proposed method, a hybrid Grasshopper Optimization Algorithm (GOA) with the self-adaptive Differential Evolution (DE) is used, called HGOA. The proposed method takes advantage of the global and local search strategies from Differential Evolution and Grasshopper Optimization Algorithm. Experimental results are applied in two scenarios; the first scenario has universal inputs and several appliances. The second scenario has an expanded number of appliances. The results showed that the proposed method (HGOA) got better power scheduling arrangements and better performance than other comparative algorithms using the classical benchmark functions. Moreover, according to the computational time, it runs in constant execution time as the population is increased. The proposed method got 0.26?% enhancement compared to the other methods. Finally, we found that the proposed HGOA always got better results than the original method in the worst cases and the best cases.