Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Several mathematical methods for identifying crucial nodes in networks  [PDF]
WenJun Zhang
Network Biology , 2012,
Abstract: Crucial nodes in a network refer to those nodes that their existence is so important in preserving topological structure of the network and they independently determine the network structure. In this study I introduced and proposed several mathematical methods for identifying crucial nodes in networks. They fall into three categories, node perturbation, network analysis, and network dynamics. Node perturbation methods include adjacency matrix index, degree or flow change index, node perturbation index, etc. Network dynamics methods include network evolution modeling, etc. Network analysis methods include node degree, criticality index, branch flourishing index, node importance index, etc. Advantages and advantages of these methods were discussed. Finally, I suggested that some of these methods may also be used to identify crucial links(connections) in networks. In this case, the change of a link refers to presence/absence of a link, or change of flow in the link, etc.
Mathematical methodologies for calculating the mass diffusion coefficient of bananas during drying
Amendola, Mariangela;Queiroz, Marlene R.;
Revista Brasileira de Engenharia Agrícola e Ambiental , 2007, DOI: 10.1590/S1415-43662007000600011
Abstract: in this work two mathematical methodologies to solve the diffusion differential equation related to the banana drying process were used in order to obtain the mass diffusion coefficient value. a simplified mathematical model was considered that was based on fick's law, with initial and boundary conditions according to the experimental procedure carried out for banana drying. the first methodology was performed by using an approximation of the analytical solution and the second by using the numerical simulation according to the implicit scheme of the finite difference method. the calculation was carried out by looking for the minimal value of the norm calculated between the experimental data and the theoretical results obtained using different values of the diffusion coefficient. the algorithms associated with these methodologies were implemented with matlab. the values of the diffusion coefficient according to the first and second methodologies were 1.65 x 10-6 [m2 h-1] and 1.58 x 10-6 [m2 h-1] respectively, with the associated minimal residual values of 0.0269 and 0.0257.
A Survey on Detecting Selfish Nodes in Wireless Sensor Networks Using Different Trust Methodologies  [PDF]
Christhu raj M.R,,G .Edwin Prem Kumar,K. Kartheek
International Journal of Engineering and Advanced Technology , 2013,
Abstract: A Wireless Sensor Networks (Wsn) Is A Network Used For Computing, Sensing. There Are Various Resource Constrains In Wsn Like Energy, Computational Power, Memory, Design Challenges. The Problem In The Sensor Nodes That Nodes May Get Compromised. The Trust Management Schemes Consist Of Effective Tools To Identify Unexpected Behavior Of Sensor Nodes In The Network. Trust Has Been Effective And Provides Secure Mechanism For Managing Each Sensor Node In Network. In This Paper We Investigated Some Trust Techniques And Present The Effective Methodologies To Calculate The Trust Of A Sensor Node To Eliminate The Selfish Or Compromised Nodes In The Network.
Mathematical Model of Optimal Empty Rail Car Distribution at Railway Transport Nodes  [PDF]
Aleksandr Rakhmangulov,Anatoliy Kolga,Nikita Osintcev,Ivan Stolpovskikh,Aleksandr Sladkowski
Mathematics , 2015,
Abstract: At present there are two trends in the market of rail freight transportation in Russia: freight owners put forward higher demands to the transportation quality (promptness of delivery) in an effort to reduce storage costs by means of reducing the size of freight shipment; the structure of railcar traffic volume of the railways of Russia is getting more complex due to the reduction of the average shipment size and due to the transfer of railcar fleet ownership to a large number of operating companies. These trends significantly complicate operational management supervision of railway stations and transport nodes. Application of typical data from the information system about the railcar location at the transportation node is not enough for the dispatchers to make the best decision concerning the car traffic management. The article is concerned with the description and development of the mathematical model of empty railcar distribution for loading at the railway transport node; this model will take into account the requirements of railcar owners in terms of their cars application, the operating work level of railroad stations of the transportation node and the possibility of adding the groups of empty railcars to the transfer trains, clean-up trains and industrial railway trains operating on a tight schedule. The developed model and the software package were implemented in the information system of the industrial railway of the major metallurgical enterprise - OJSC "Magnitogorsk Metallurgical Works", which processes up to two thousand of railcars belonging to different owners. This model made it possible to reduce the labour intensity of dispatcher operation planning the empty railcar distribution for loading and reduce the total time the railcars spend in the enterprise railway system.
Ranking the Importance Level of Intermediaries to a Criminal using a Reliance Measure  [PDF]
Pritheega Magalingam,Stephen Davis,Asha Rao
Computer Science , 2015,
Abstract: Recent research on finding important intermediate nodes in a network suspected to contain criminal activity is highly dependent on network centrality values. Betweenness centrality, for example, is widely used to rank the nodes that act as brokers in the shortest paths connecting all source and all the end nodes in a network. However both the shortest path node betweenness and the linearly scaled betweenness can only show rankings for all the nodes in a network. In this paper we explore the mathematical concept of pair-dependency on intermediate nodes, adapting the concept to criminal relationships and introducing a new source-intermediate reliance measure. To illustrate our measure, we apply it to rank the nodes in the Enron email dataset and the Noordin Top Terrorist networks. We compare the reliance ranking with Google PageRank, Markov centrality as well as betweenness centrality and show that a criminal investigation using the reliance measure, will lead to a different prioritisation in terms of possible people to investigate. While the ranking for the Noordin Top terrorist network nodes yields more extreme differences than for the Enron email transaction network, in the latter the reliance values for the set of finance managers immediately identified another employee convicted of money laundering.
Validation of the development methodologies  [PDF]
Ammar Lahlouhi
Computer Science , 2014,
Abstract: This paper argues that modelling the development methodologies can improve the multi-agents systems software engineering. Such modelling allows applying methods, techniques and practices used in the software development to the methodologies themselves. The paper discusses then the advantages of the modelling of development methodologies. It describes a model of development methodologies, uses such a model to develop a system of their partial validation, and applies such a system to multi-agent methodologies. Several benefits can be gained from such modelling, such as the improvement of the works on the development, evaluation and comparison of multi-agent development methodologies.
Quinones in analytic methodologies  [cached]
Isadora Souza Vieira,Fernando César de Macedo Junior,Henrique de Santana,Dimas Augusto Morozin Zaia
Semina : Ciências Exatas e Tecnológicas , 2008,
Abstract: In this paper is showed several uses of quinonic substances presented as mediators in analytic methodologies, based on the monitoring their reactions and the detection of their products. The potentialities of different techniques as well as mechanistic features were depicted.
Agile Software Methodologies: Strength and Weakness
Dr. Adel Hamdan Mohammad,Dr. Tariq Alwada’n,Dr. Jafar "M.Ali" Ababneh
International Journal of Engineering Science and Technology , 2013,
Abstract: Agile methodologies are great software development methodologies. No doubt that these methodologies have widespread reputation. The core of agile methodologies is people. Customer and each team member in agiledevelopment teams are the key success or failure factor in agile process. In this paper authors demonstrate strength and weakness points in agile methodologies. Also authors demonstrate how strength and weakness factors can affect the overall results of agile development process.
Methodologies and applications in Digital China
JingNong Weng,Irfan Rafique,Maissom Qanber Abbasi
Chinese Science Bulletin , 2012, DOI: 10.1007/s11434-012-5446-y
Abstract: This article portrays a concise review on an extensive range of state-of-art advancement in methodologies and applications for Digital China, which includes models, algorithms, theory framework, engineering technology, science methodology, practice applications, etc.
Gravitational constant calculation methodologies  [PDF]
V. M. Shakhparonov,O. V. Karagioz,V. P. Izmailov
Physics , 2011,
Abstract: We consider the gravitational constant calculation methodologies for a rectangular block of the torsion balance body presented in the papers Phys. Rev. Lett. 102, 240801 (2009) and Phys.Rev. D. 82, 022001 (2010). We have established the influence of non-equilibrium gas flows on the obtained values of G.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.