A new approximate cluster deletion algorithm for diamond-free graphs

2019 ◽  
Vol 39 (2) ◽  
pp. 385-411
Author(s):  
Sabrine Malek ◽  
Wady Naanaa
Keyword(s):  
Deletion Algorithm

Recursive Enumeration K-Best Decoding Algorithm in Chinese Input Method Application

2013 ◽  
Vol 846-847 ◽  
pp. 1326-1329
Author(s):  
Xue Gang Zhan ◽  
Peng Zhang
Keyword(s):  
Language Model ◽  
Experimental Results ◽  
Decoding Algorithm ◽  
Critical Part ◽  
Input Method ◽  
Deletion Algorithm ◽  
Decoding Efficiency ◽  
Better Than

The sentence transformation from phonetic to word is a very critical part of the input method. When the input method can not find the candidate through a dictionary word directly, it needs to obtain the results desired by the user through sentence transformation. In this paper, based on recursive enumeration k-best decoding algorithm is used in the input method sentence transformation , with the language model, to get the k-optimal transformation results . Experimental results show that in the input method application environment, based on a recursive enumeration k-best decoding algorithm decoding efficiency significantly better than the deletion algorithm which is the baseline.

DELETING A MARKED BASIS-STATE FROM AN EVEN SUPERPOSITION OF ALL BASIS-STATES WITH A SINGLE QUERY

2009 ◽  
Vol 07 (02) ◽  
pp. 567-572 ◽  
Author(s):  
YANG LIU ◽  
GUI LU LONG
Keyword(s):  
Classical Analog ◽  
Speed Up ◽  
Deletion Algorithm

We present a quantum deletion algorithm that deletes a marked basis-state from an even superposition of all N basis-states. This algorithm uses only a single query and achieves exponential speed-up compared with classical analog where Θ(N) queries are required.

scholarly journals A fusion data security protection scheme for sensitive E-documents in the open network environment

PLoS ONE ◽  
2021 ◽  
Vol 16 (12) ◽  
pp. e0258464
Author(s):  
Lei Liu ◽  
Mingwei Cao ◽  
Yeguo Sun
Keyword(s):  
Data Security ◽  
Prototype System ◽  
Network Environment ◽  
State Monitoring ◽  
Sensitive Data ◽  
Monitoring Method ◽  
Open Network ◽  
Protection Scheme ◽  
Fusion Data ◽  
Deletion Algorithm

E-documents are carriers of sensitive data, and their security in the open network environment has always been a common problem with the field of data security. Based on the use of encryption schemes to construct secure access control, this paper proposes a fusion data security protection scheme. This scheme realizes the safe storage of data and keys by designing a hybrid symmetric encryption algorithm, a data security deletion algorithm, and a key separation storage method. The scheme also uses file filter driver technology to design a user operation state monitoring method to realize real-time monitoring of user access behavior. In addition, this paper designs and implements a prototype system. Through the verification and analysis of its usability and security, it is proved that the solution can meet the data security protection requirements of sensitive E-documents in the open network environment.

scholarly journals Service-Oriented Load Balancing Approach to Alleviating Peak-Hour Congestion in a Metro Network Based on Multi-Path Accessibility

2019 ◽  
Vol 11 (5) ◽  
pp. 1293 ◽  
Author(s):  
Zhiyuan Huang ◽  
Ruihua Xu ◽  
Wei Fan ◽  
Feng Zhou ◽  
Wei Liu
Keyword(s):  
Load Balancing ◽  
Line Segments ◽  
Safety Risks ◽  
Effective Manner ◽  
Service Oriented ◽  
Metro Systems ◽  
Deletion Algorithm ◽  
Alternative Routes ◽  
Shanghai Metro ◽  
Metro Network

To further improve the service quality and reduce safety risks in current congested metro systems during peak hours, this paper presents a load balancing (LB) approach so that available capacity can be utilized more effectively in order to alleviate peak hour congestion. A set of under-utilized yet effective alternative routes were searched using a deletion algorithm (DA) in order to share the passenger loads on overcrowded metro line segments. An optimization model was constructed based on an improved route generalized time utility function considering the penalties of both in-vehicle congestion and transfers. A detailed load balancing solution was generated based on the proposed algorithm. A real-world example of three overloaded metro line segments in the Shanghai metro network were selected and used to verify the feasibility and validity of the developed load balancing method. The results show that the load balancing method can effectively reduce the overcrowding situation to a great extent. Finally, two prospective inducing schemes are discussed to help implement the load balancing solution in the actual metro system in an efficient and effective manner.

scholarly journals Element activation method and non-conformal dynamic remeshing strategy to model additive manufacturing

2021 ◽  
Author(s):  
Cédric Laruelle ◽  
Romain Boman ◽  
Luc Papeleux ◽  
Jean-Philippe Ponthot
Keyword(s):  
Additive Manufacturing ◽  
High Speed ◽  
Data Transfer ◽  
Computational Cost ◽  
High Speed Steel ◽  
Projection Methods ◽  
Fully Implicit ◽  
Direct Energy ◽  
Deletion Algorithm ◽  
The University

Modeling of Additive Manufacturing (AM) at the part scale involves non-linear thermo-mechanical simulations. Such a process also imposes a very fine discretization and requires altering the geometry of the models during the simulations to model the addition of matter, which is a computational challenge by itself. The first focus of this work is the addition of an additive manufacturing module in the fully implicit in-house Finite Element code Metafor [1] which is developed at the University of Liège. The implemented method to activate elements and to activate and deactivate boundary conditions during a simulation is adapted from the element deletion algorithm implemented in Metafor in the scope of crack propagation [2]. This algorithm is modified to allow the activation of elements based on a user-specified criterion (e.g. geometrical criterion, thermal criterion, etc.). The second objective of this work is to improve the efficiency of the AM simulations, in particular by using a dynamic remeshing strategy to reduce the computational cost of the simulations. This remeshing is done using non-conformal meshes, where hanging nodes are handled via the use of Lagrange multiplier constraints. The mesh data transfer used after remeshing is based on projection methods involving finite volumes [3]. The presented model is then compared against a 2D numerical simulation of Direct Energy Deposition of a High-Speed Steel thick deposit from the literature [4].

Sign in / Sign up

Export Citation Format

Share Document