scholarly journals Synchronizability of Multi-Layer-Coupled Star-Composed Networks

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2224
Author(s):  
Haiping Gao ◽  
Jian Zhu ◽  
Xianyong Li ◽  
Xing Chen
Keyword(s):  
Laplacian Matrix ◽  
Simulation Experiments ◽  
Stability Equation ◽  
Factors Affecting ◽  
Symmetrical Structure ◽  
Number Of Layers ◽  
Coupling Strengths ◽  
Graph Operation ◽  
Optimization Schemes ◽  
Simulated Images

In this paper, several multi-layer-coupled star-composed networks with similar symmetrical structures are defined by using the theory of graph operation. The supra-Laplacian matrix of the corresponding multi-layer networks is obtained according to the master stability equation (MSF). Two important indexes that reflect the synchronizability of these kinds of networks are derived in the case of bounded and unbounded synchronized regions. The relationships among the synchronizability, the number of layers, the length of the paths, the branchings, and the interlayer and intralayer coupling strengths in the two cases are studied. At the same time, the simulation experiments are carried out with the MATLAB software, and the simulated images of the two symmetrical structure networks’ synchronizability are compared. Finally, the factors affecting the synchronizability of multi-layer-coupled star-composed networks are found. On this basis, optimization schemes are given to improve the synchronizability of multi-layer-coupled star-composed networks and the influences of the number of central nodes on the networks’ synchronizability are further studied.

Psychological factors affecting market dynamics: the role of uncertainty and need satisfaction

2000 ◽  
Vol 03 (01n04) ◽  
pp. 323-334 ◽  
Author(s):  
Marco A. Janssen ◽  
Wander Jager
Keyword(s):  
Need Satisfaction ◽  
Market Dynamics ◽  
Simulation Experiments ◽  
Factors Affecting ◽  
The Social ◽  
Different Types ◽  
Agent Simulation ◽  
Cognitive Choice ◽  
Multi Agent

Markets can show different types of dynamics, ranging from stable markets dominated by one or a few products, to fluctuating markets where products are frequently being replaced by new versions. This paper explores the dynamics of markets from a psychological perspective using a multi-agent simulation model. The behavioural rules of the artificial consumers, the consumats, are based on a conceptual meta-theory from psychology. The artificial consumers have to choose each period between different products. Products remain on the market for as long as their market share exceeds a minimum level. If not, it will be replaced by a new product. Simulation experiments are being performed with a population of consumats having different preferences. Results show that the dominating type of cognitive (choice) process has large consequences for the resulting market dynamics. Moreover, the size of the social network affects the market dynamics too.

scholarly journals RELIABILITY INDEX FOR IRIS CODE MATCHING IN IRIS RECOGNITION SYSTEMS

2019 ◽  
Vol XLII-2/W12 ◽  
pp. 197-202
Author(s):  
B. H. Shekar ◽  
S. S. Bhat ◽  
A. Maysuradze
Keyword(s):  
System Reliability ◽  
Reliability Index ◽  
Iris Recognition ◽  
Recognition Accuracy ◽  
Simulation Experiments ◽  
Factors Affecting ◽  
Biometric Systems ◽  
Recognition Systems ◽  
Matching Techniques ◽  
Rejection Rates

<p><strong>Abstract.</strong> Iris code matching is an important stage of iris biometric systems which compares the input iris code with stored patterns of enrolled iris codes and classifies the code into one of classes so that, the claim is accepted or rejected. Several classifier based approaches are proposed by the researchers to improve the recognition accuracy. In this paper, we discuss the factors affecting an iris classifier’s performance and we propose a reliability index for iris matching techniques to quantitatively measure the extent of system reliability, based on false acceptance rate and false rejection rates using Monte Carlo Simulation. Experiments are carried out on benchmark databases such as, IITD, MMU v-2, CASIA v-4 Distance and UBIRIS v.2.</p>

scholarly journals Effects of pilot hole diameter and depth on screw driving torques in plywood

BioResources ◽  
2020 ◽  
Vol 15 (4) ◽  
pp. 8121-8132
Author(s):  
Onder Tor ◽  
Emre Birinci ◽  
Lingling Hu ◽  
Chen Chen
Keyword(s):  
Medium Density Fiberboard ◽  
Metal Plate ◽  
Hole Diameter ◽  
Factors Affecting ◽  
Pilot Hole ◽  
Oriented Strandboard ◽  
Number Of Layers ◽  
The Mean ◽  
Screw Driving ◽  
Main Effects

Factors affecting screw driving torques in plywood were investigated in this work. The factors were number of layers (7 and 9), pilot hole diameter (3.0 and 3.5 mm), pilot hole depth (60 and 80% of the thickness of specimen), and thickness of the metal plate (7.5 and 10 mm). Screw driving torques were studied in oriented strandboard, medium-density fiberboard, particleboard, and some wood-plastic composites. There is no such information about screw driving torques in plywood (PW). Therefore, this study focused on the plywood made of aspen (Populus tremula L.). The mean seating torque (SET) values ranged from 0.31 to 0.69 N∙m, whereas mean stripping torque (STT) values ranged from 0.50 to 4.7 N∙m. The ratios of STT/SET were between 2 and 5 in PW with seven layers, whereas the ratios were between 4 and 7 in PW with nine layers. The results indicated that the four main effects of SET and STT were statistically significant with p-values of ˂ 0.0001.

The Key Role of Interfaces in IT Outsourcing Relationships

2012 ◽  
Vol 5 (1) ◽  
pp. 37-56 ◽  
Author(s):  
Francois Duhamel ◽  
Isis Gutiérrez-Martínez ◽  
Sergio Picazo-Vela ◽  
Luis Felipe Luna-Reyes
Keyword(s):  
Knowledge Sharing ◽  
Service Providers ◽  
It Outsourcing ◽  
Simulation Experiments ◽  
Organizational Boundaries ◽  
Factors Affecting ◽  
The Right ◽  
Outsourcing Contracts ◽  
The Relationship

Many IT outsourcing operations fail, and when they do not fail they often impose renegotiations over the life of the contract between outsourcers and service providers. Possible remedies include the improvement of knowledge-sharing processes over organizational boundaries between partners, who may learn more about the problems that occur while looking at possible solutions together. Ensuring the right flow of knowledge in the two directions is central to the success of IT outsourcing operations, particularly in the transition stage of the relationship. However, these solutions do not fully acknowledge the different interrelationships between the main factors affecting knowledge transfer in outsourcing relationships in a dynamic way. In this paper, previous research on modeling knowledge-sharing across boundaries is applied to IT outsourcing contracts during the transition phase of the IT outsourcing relationship. Simulation experiments suggest that four reinforcing processes play key roles in the progress of the outsourcing relationship: trust, outsourcers’ and providers’ knowledge, commitment, and interfacing.

Modeling and Optimization of Process Parameters by Taguchi Method: Degradation of Phenolic Compounds by UV/H2O2/TiO2 Process

2011 ◽  
Vol 6 (1) ◽  
Author(s):  
Shilpa Nandwani ◽  
Arvind Kumar Mungray ◽  
Mousumi Chakraborty
Keyword(s):  
Taguchi Method ◽  
Cycle Time ◽  
Organic Pollutant ◽  
Orthogonal Experimental Design ◽  
Simulation Experiments ◽  
Factors Affecting ◽  
System Decomposition ◽  
Optimization Of Process Parameters ◽  
Analysis Technique ◽  
Significant Factors

In this study, Taguchi method was used to identify the several factors that may affect the percentage degradation of phenol and p-chlorophenol in wastewater in a UV/H2O2/TiO2 system. The percentage degradation of phenol and p-chlorophenol was greatly influenced by factors such as pH, cycle time and initial concentration of the organic pollutant. By using orthogonal experimental design and analysis technique, the UV/H2O2/TiO2 system performance can be analyzed with more objective conclusion through only a small number of simulation experiments. Analysis of variance (ANOVA) was carried out to identify the significant factors affecting the response and the best possible factor level combination was determined through. Finally, a regression model for percentage degradation of phenol and p-chlorophenol has been developed, as a function of system parameters. It was found that a UV/H2O2/TiO2 system decomposition of the organic pollutant were highly dependent on cycle time followed by pH of aqueous solution. The optimal settings of highest percentage degradation of phenol and p-chlorophenol in wastewater were also determined.

scholarly journals Spectral Clustering of Psychological Networks

2021 ◽  
Author(s):  
Michael Brusco ◽  
Douglas Steinley ◽  
Ashley L. Watts
Keyword(s):  
Spectral Clustering ◽  
Cluster Structure ◽  
Laplacian Matrix ◽  
Simulation Experiments ◽  
Number Of Clusters ◽  
Laplacian Matrices ◽  
Undirected Network ◽  
Close Relationship ◽  
Recovery Performance ◽  
Better Than

Spectral clustering is a well-known method for clustering the vertices of an undirected network. Although its use in network psychometrics has been limited, spectral clustering has a close relationship to the commonly-used walktrap algorithm. In this paper, we report results from four simulation experiments designed to evaluate the ability of spectral clustering and the walktrap algorithm to recover underlying cluster structure in networks. The salient findings include: (1) the cluster recovery performance of the walktrap algorithm can be improved slightly by using exact K-means clustering instead of hierarchical clustering; (2) K-means and K-median clustering led to comparable recovery performance when used to cluster vertices based on the eigenvectors of Laplacian matrices in spectral clustering; (3) spectral clustering using the unnormalized Laplacian matrix generally yielded inferior cluster recovery in comparison to the other methods; (4) when the correct number of clusters was provided for the methods, spectral clustering using the normalized Laplacian matrix led to better recovery than the walktrap algorithm; (5) when the number of clusters was unknown, spectral clustering using the normalized Laplacian matrix was appreciably better than the walktrap algorithm when the clusters were equally-sized, but the two methods were competitive when the clusters were not equally-sized. Overall, both the walktrap algorithm and spectral clustering of the normalized Laplacian matrix are effective for partitioning the vertices of undirected networks, with the latter performing better in most instances.

A Novel Coal Water Content Measurement Method on Conveyor Belt

2012 ◽  
Vol 503-504 ◽  
pp. 1292-1297
Author(s):  
Xue Zhen Cheng ◽  
Ji Ming Li ◽  
Qi Li ◽  
Mao Yong Cao ◽  
Laxmisha Rai
Keyword(s):  
Moisture Content ◽  
Measurement Method ◽  
Spontaneous Combustion ◽  
Local Group ◽  
Coal Dust ◽  
Conveyor Belt ◽  
Dust Storms ◽  
Simulation Experiments ◽  
Factors Affecting ◽  
Coal Rock

The coal dust storms create great harm to the environment and human health. The main source of coal dust is the low coal moisture on various types of coal conveying belt. The intensity of coal dust is heavy, especially in the coal-fired power plant, coal transportation coal conveyor belt and in areas, where various reprint point was heavy. In this paper, a measurement method on moisture content of coal conveying belt was proposed. The local group based on the probability can eliminate the factors affecting measuring accuracy such as the big piece of coal, the thickness of coal seam, and coal rock. The rationality behind the measurement was verified by simulation experiments. The proposed method gives an effective method to measure the moisture content of coal on the conveyer belt and provides technical support to prevent the spontaneous combustion and explosion of coal when the moisture content of coal is too low.

Image Encryption Method by Using Chaotic Mapping Based on Multi-Layer Parameter Disturbance

2014 ◽  
Vol 539 ◽  
pp. 479-484
Author(s):  
Shu Juan Zhang ◽  
Yun He
Keyword(s):  
Image Encryption ◽  
Operation Time ◽  
Chaotic Sequence ◽  
Simulation Experiments ◽  
Chaotic Mapping ◽  
Layer Parameter ◽  
Number Of Layers ◽  
Pixel Location ◽  
Bit Plane ◽  
Encryption Method

Bit-plane decomposition makes images obtain a number of layers. According to the amount of data information, images are encrypted, and the paper proposes image encryption method with Chaotic Mapping based on multi-layer parameter disturbance. The advantage of multi-layer parameter disturbance is that it not only scrambles pixel location of images, but also changes pixel values of images. Bit-plane decomposition can increase the space of key. And using chaotic sequence generated by chaotic system with different complexities to encrypt layers with different information content can save operation time. The simulation experiments show that using chaotic mapping in image encryption method based on multi-layer parameter disturbance can cover plaintext effectively and safely, which makes it achieve ideal encryption effect.

scholarly journals Synchronizability of Multilayer Star and Star-Ring Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-20 ◽  
Author(s):  
Yang Deng ◽  
Zhen Jia ◽  
Feimei Yang
Keyword(s):  
Structural Parameters ◽  
Interlayer Coupling ◽  
Ring Networks ◽  
Stability Function ◽  
Eigenvalue Spectrum ◽  
Number Of Layers ◽  
Analytic Expressions ◽  
Coupling Strengths ◽  
The Relationship ◽  
Theoretical Results

Synchronization of multilayer complex networks is one of the important frontier issues in network science. In this paper, we strictly derived the analytic expressions of the eigenvalue spectrum of multilayer star and star-ring networks and analyzed the synchronizability of these two networks by using the master stability function (MSF) theory. In particular, we investigated the synchronizability of the networks under different interlayer coupling strength, and the relationship between the synchronizability and structural parameters of the networks (i.e., the number of nodes, intralayer and interlayer coupling strengths, and the number of layers) is discussed. Finally, numerical simulations demonstrated the validity of the theoretical results.

The study of chained routing algorithm for WNS based on group perception

2020 ◽  
Vol 31 (04) ◽  
pp. 2050049
Author(s):  
Yunlan Wang ◽  
Fang Li
Keyword(s):  
Routing Algorithm ◽  
Collision Probability ◽  
Wireless Sensor ◽  
Message Delivery ◽  
Key Factors ◽  
Simulation Experiments ◽  
Factors Affecting ◽  
Routing Strategy ◽  
Group Perception ◽  
Opportunistic Transmission

In order to effectively solve the problem of routing efficiency in wireless sensor networks, a new chained routing algorithm based on group perception is proposed in this paper. First, the performance index parameters such as energy consumption and area coverage are given. Meanwhile, a chained routing strategy based on node utility value is established, which combines the “storage-carrying-forwarding” opportunistic transmission mode and decides whether a message needs to be forwarded to an encounter node according to a message forwarding strategy. Finally, the key factors affecting the chained routing algorithm are studied through simulation experiments. The results show that compared with random routing, the chained routing algorithm has great advantages in message delivery rate, collision probability, accuracy, etc.

Sign in / Sign up

Export Citation Format

Share Document