Log in

Relevant bibliographies by topics / Distributed computation systems / Journal articles

To see the other types of publications on this topic, follow the link: Distributed computation systems.

Journal articles on the topic 'Distributed computation systems'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Distributed computation systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Wang, Jinchang, and Thomas Kaempke. "Shortest route computation in distributed systems." Computers & Operations Research 31, no. 10 (2004): 1621–33. http://dx.doi.org/10.1016/s0305-0548(03)00111-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Qing, Shengyi Ji, Peng Peng, Mingdao Li, Ping Huang, and Zheng Qin. "Optimizing Distance Computation in Distributed Graph Systems." IEEE Access 8 (2020): 191673–82. http://dx.doi.org/10.1109/access.2020.3032727.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ahuja, Mohan, and Shivakant Mishra. "Units of Computation in Fault-Tolerant Distributed Systems." Journal of Parallel and Distributed Computing 40, no. 2 (1997): 194–209. http://dx.doi.org/10.1006/jpdc.1996.1277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Evtushenko, Yuri. "Computation of exact gradients in distributed dynamic systems." Optimization Methods and Software 9, no. 1-3 (1998): 45–75. http://dx.doi.org/10.1080/10556789808805686.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

CAMPBELL, EARL T., and JOSEPH FITZSIMONS. "AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES." International Journal of Quantum Information 08, no. 01n02 (2010): 219–58. http://dx.doi.org/10.1142/s0219749910006198.

Full text

Abstract:

This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.

APA, Harvard, Vancouver, ISO, and other styles

6

Huberman, Bernardo A., and Tad Hogg. "Distributed Computation as an Economic System." Journal of Economic Perspectives 9, no. 1 (1995): 141–52. http://dx.doi.org/10.1257/jep.9.1.141.

Full text

Abstract:

As computer networks grow and blanket the planet, they become a community of concurrent processes, which, in their interactions, strategies, and lack of perfect knowledge, become analogous to human market economies. Economics may thus offer new ways of designing and understanding the behavior of distributed computer systems.

APA, Harvard, Vancouver, ISO, and other styles

7

Chiang, Chia-Chu, and Roger Lee. "Coordination Languages and Models for Open Distributed Systems." International Journal of Software Innovation 1, no. 1 (2013): 1–13. http://dx.doi.org/10.4018/ijsi.2013010101.

Full text

Abstract:

Programming open distributed systems will be of rapidly growing importance in the coming decades to the scientists and engineers that will be using these techniques to solve society’s most pressing problems. Even today, the authors see a growing number of critical applications such as MRI spin relaxometry, gene sequence analysis, climate modeling, and molecular modeling of potential bioactive compounds that require massive amounts of computation. The demands for intensive computational power will only grow in the future, as society tackles more complex problems. Existing concurrent programming

APA, Harvard, Vancouver, ISO, and other styles

8

Boldrin, Fabio, Chiara Taddia, and Gianluca Mazzini. "Web Distributed Computing Systems Implementation and Modeling." International Journal of Adaptive, Resilient and Autonomic Systems 1, no. 1 (2010): 75–91. http://dx.doi.org/10.4018/jaras.2010071705.

Full text

Abstract:

This article proposes a new approach for distributed computing. The main novelty consists in the exploitation of Web browsers as clients, thanks to the availability of JavaScript, AJAX and Flex. The described solution has two main advantages: it is client-free, so no additional programs have to be installed to perform the computation, and it requires low CPU usage, so client-side computation is no invasive for users. The solution is developed using both AJAX and Adobe®Flex® technologies embedding a pseudo-client into a Web page that hosts the computation. While users browse the hosting Web pag

APA, Harvard, Vancouver, ISO, and other styles

9

Oh, HyungSeon. "Distributed optimal power flow." PLOS ONE 16, no. 6 (2021): e0251948. http://dx.doi.org/10.1371/journal.pone.0251948.

Full text

Abstract:

Objective The objectives of this paper are to 1) construct a new network model compatible with distributed computation, 2) construct the full optimal power flow (OPF) in a distributed fashion so that an effective, non-inferior solution can be found, and 3) develop a scalable algorithm that guarantees the convergence to a local minimum. Existing challenges Due to the nonconvexity of the problem, the search for a solution to OPF problems is not scalable, which makes the OPF highly limited for the system operation of large-scale real-world power grids—“the curse of dimensionality”. The recent att

APA, Harvard, Vancouver, ISO, and other styles

10

Hendrickx, Julien M., Alex Olshevsky, and John N. Tsitsiklis. "Distributed Anonymous Discrete Function Computation." IEEE Transactions on Automatic Control 56, no. 10 (2011): 2276–89. http://dx.doi.org/10.1109/tac.2011.2163874.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mohammed, Abdul-Wahid, Yang Xu, Ming Liu, and Haixiao Hu. "Semantical Markov Logic Network for Distributed Reasoning in Cyber-Physical Systems." Journal of Sensors 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/4259652.

Full text

Abstract:

The challenges associated with developing accurate models for cyber-physical systems are attributable to the intrinsic concurrent and heterogeneous computations of these systems. Even though reasoning based on interconnected domain specific ontologies shows promise in enhancing modularity and joint functionality modelling, it has become necessary to build interoperable cyber-physical systems due to the growing pervasiveness of these systems. In this paper, we propose a semantically oriented distributed reasoning architecture for cyber-physical systems. This model accomplishes reasoning through

APA, Harvard, Vancouver, ISO, and other styles

12

Rodis, Panteleimon. "On defining and modeling context-awareness." International Journal of Pervasive Computing and Communications 14, no. 2 (2018): 111–23. http://dx.doi.org/10.1108/ijpcc-d-18-00003.

Full text

Abstract:

Purpose This paper aims to present a methodology for defining and modeling context-awareness and describing efficiently the interactions between systems, applications and their context. Also, the relation of modern context-aware systems with distributed computation is investigated. Design/methodology/approach On this purpose, definitions of context and context-awareness are developed based on the theory of computation and especially on a computational model for interactive computation which extends the classical Turing Machine model. The computational model proposed here encloses interaction a

APA, Harvard, Vancouver, ISO, and other styles

13

Grusho, A. A., N. A. Grusho, and E. E. Timonina. "Information security architecture synthesis in distributed information computation systems." Automatic Control and Computer Sciences 51, no. 8 (2017): 799–804. http://dx.doi.org/10.3103/s0146411617080089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Omarov, M. A. "CF Networks for Modeling of Distributed Computation Information Systems." Telecommunications and Radio Engineering 67, no. 11 (2008): 1017–24. http://dx.doi.org/10.1615/telecomradeng.v67.i11.70.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Wolczko, Mario. "Actors: A model of concurrent computation in distributed systems." Science of Computer Programming 10, no. 2 (1988): 212–13. http://dx.doi.org/10.1016/0167-6423(88)90028-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Gałecki, Tomasz, and Wiktor Bohdan Daszczuk. "Tree-Like Distributed Computation Environment with Shapp Library." Information 11, no. 3 (2020): 143. http://dx.doi.org/10.3390/info11030143.

Full text

Abstract:

Despite the rapidly growing computing power of computers, it is often insufficient to perform mass calculations in a short time, for example, simulation of systems for various sets of parameters, the searching of huge state spaces, optimization using ant or genetic algorithms, machine learning, etc. One can solve the problem of a lack of computing power through workload management systems used in local networks in order to use the free computing power of servers and workstations. This article proposes raising such a system to a higher level of abstraction: The use in the .NET environment of a

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Chao, Padma Raghavan, Lloyd Arrowood, Donald W. Noid, Bobby G. Sumpter, and Robert E. Tuzun. "Large-Scale Normal Coordinate Analysis on Distributed Memory Parallel Systems." International Journal of High Performance Computing Applications 16, no. 4 (2002): 409–24. http://dx.doi.org/10.1177/109434200201600404.

Full text

Abstract:

Summary A parallel computational scheme for analyzing large-scale molecular vibration on distributed memory computing platforms is presented in this paper. This method combines the implicitly restarted Lanczos algorithm with a state-of-art parallel sparse direct solver to compute a set of low frequency vibrational modes for molecular systems containing tens of thousands of atoms. Although the original motivation for developing such a scheme was to overcome memory limitations on traditional sequential and shared memory machines, our computational experiments show that with a careful parallel de

APA, Harvard, Vancouver, ISO, and other styles

18

Wang, Bingchang, Xin Yu, and Dandan Pang. "Algorithm Implementation for Distributed Convex Intersection Computation." Journal of Systems Science and Complexity 33, no. 1 (2019): 15–25. http://dx.doi.org/10.1007/s11424-019-8161-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Adamski, Marcin, Krzysztof Kurowski, Marek Mika, Wojciech Piątek, and Jan Węglarz. "Security Aspects in Resource Management Systems in Distributed Computing Environments." Foundations of Computing and Decision Sciences 42, no. 4 (2017): 299–313. http://dx.doi.org/10.1515/fcds-2017-0015.

Full text

Abstract:

Abstract In many distributed computing systems, aspects related to security are getting more and more relevant. Security is ubiquitous and could not be treated as a separated problem or a challenge. In our opinion it should be considered in the context of resource management in distributed computing environments like Grids and Clouds, e.g. scheduled computations can be much delayed because of cyber-attacks, inefficient infrastructure or users valuable and sensitive data can be stolen even in the process of correct computation. To prevent such cases there is a need to introduce new evaluation m

APA, Harvard, Vancouver, ISO, and other styles

20

Tassa, Tamir, and Ehud Gudes. "Secure distributed computation of anonymized views of shared databases." ACM Transactions on Database Systems 37, no. 2 (2012): 1–43. http://dx.doi.org/10.1145/2188349.2188353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Mäkelä, T., and S. Pohjolainen. "On the Symbolic Computation in Simulation of Distributed Parameter Systems." IFAC Proceedings Volumes 21, no. 8 (1988): 313–15. http://dx.doi.org/10.1016/s1474-6670(17)54971-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Komenda, Jan, and Tomáš Masopust. "Distributed computation of supremal conditionally controllable sublanguages." International Journal of Control 89, no. 2 (2015): 424–36. http://dx.doi.org/10.1080/00207179.2015.1079736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Luo, Zhi-Quan, and John N. Tsitsiklis. "On the communication complexity of distributed algebraic computation." Journal of the ACM 40, no. 5 (1993): 1019–47. http://dx.doi.org/10.1145/174147.174149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Valderrama Bento da Silva, Pedro Henrique, Eduardo Camponogara, Laio Oriel Seman, Gabriel Villarrubia González, and Valderi Reis Quietinho Leithardt. "Decompositions for MPC of Linear Dynamic Systems with Activation Constraints." Energies 13, no. 21 (2020): 5744. http://dx.doi.org/10.3390/en13215744.

Full text

Abstract:

The interconnection of dynamic subsystems that share limited resources are found in many applications, and the control of such systems of subsystems has fueled significant attention from scientists and engineers. For the operation of such systems, model predictive control (MPC) has become a popular technique, arguably for its ability to deal with complex dynamics and system constraints. The MPC algorithms found in the literature are mostly centralized, with a single controller receiving the signals and performing the computations of output signals. However, the distributed structure of such in

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Qihua, Huaqun Wang, Yufeng Wang, and Rui Guo. "A Distributed Access Control with Outsourced Computation in Fog Computing." Security and Communication Networks 2019 (July 8, 2019): 1–10. http://dx.doi.org/10.1155/2019/6782753.

Full text

Abstract:

With the rapid development of information technology and the Internet of Things Technology (IOT), data security and healthy privacy are getting a lot of attention. In order to store, access, and share electronic health records, storage of this data is transferred to a third-party-cloud server. The security and privacy of electronic health records stored at date center or cloud server are not guaranteed. Before being sent to date center or cloud server, this data should be encrypted. Designing an efficient and secure fine-grained access control strategy for personal health records is facing eno

APA, Harvard, Vancouver, ISO, and other styles

26

Bollauf, Maiara F., Vinay A. Vaishampayan, and Sueli I. R. Costa. "On Communication for Distributed Babai Point Computation." IEEE Transactions on Information Theory 67, no. 10 (2021): 6408–24. http://dx.doi.org/10.1109/tit.2021.3097719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Jin, Hai, Aaqif Afzaal Abbasi, and Song Wu. "Pathfinder: Application-Aware Distributed Path Computation in Clouds." International Journal of Parallel Programming 45, no. 6 (2016): 1273–84. http://dx.doi.org/10.1007/s10766-016-0469-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Berahas, Albert S., Raghu Bollapragada, Nitish Shirish Keskar, and Ermin Wei. "Balancing Communication and Computation in Distributed Optimization." IEEE Transactions on Automatic Control 64, no. 8 (2019): 3141–55. http://dx.doi.org/10.1109/tac.2018.2880407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Kirk, Donald E., and Jacques G. Verly. "An algorithm for distributed computation of FFTs." Computers & Electrical Engineering 13, no. 2 (1987): 83–96. http://dx.doi.org/10.1016/0045-7906(87)90002-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Sankaralingam, Karthikeyan, Madhulika Yalamanchi, Simha Sethumadhavan, and James C. Browne. "Pagerank Computation and Keyword Search on Distributed Systems and P2P Networks." Journal of Grid Computing 1, no. 3 (2003): 291–307. http://dx.doi.org/10.1023/b:grid.0000035202.38582.c8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Jafarinejad, Fatemeh, and Ali A. Pouyan. "Distributed Computation of Liveness-Enforcing Supervisory Control of Flexible Manufacturing Systems." Journal of Advanced Manufacturing Systems 16, no. 01 (2017): 1–15. http://dx.doi.org/10.1142/s0219686717500019.

Full text

Abstract:

This paper presents a modular deadlock prevention policy for large-scale flexible manufacturing systems. It can find maximally permissive liveness-enforcing supervisory control in an efficient computational complexity manner. A vector covering approach is used to minimize essential set of legal markings and first-met bad markings. Providing that modules of system interact using choice, we will prove that monitor-based supervisory control methods can be applied distributedly. Then, choice operator of Petri net will be used to synthesis subsystems. Even if such assumption limits the application

APA, Harvard, Vancouver, ISO, and other styles

32

Qin, Yuzhen, Ming Cao, and Brian D. O. Anderson. "Lyapunov Criterion for Stochastic Systems and Its Applications in Distributed Computation." IEEE Transactions on Automatic Control 65, no. 2 (2020): 546–60. http://dx.doi.org/10.1109/tac.2019.2910948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Yin, Chao, Haitao Lv, Tongfang Li, Xiaoping Qu, Jianzong Wang, and Guangyong Gao. "A New Minimize Matrix Computation Coding Method for Distributed Storage Systems." Mathematical Problems in Engineering 2019 (November 15, 2019): 1–14. http://dx.doi.org/10.1155/2019/4163780.

Full text

Abstract:

With the number of nodes increasing in scale, the requirements of storage space enlarge sharply in distributed storage systems. Failure-tolerance schemes such as Reed–Solomon codes (RS codes in short) and Cauchy Reed–Solomon codes (CRS codes in short) are used to save storage space. However, these failure-tolerance schemes severely degrade the system performance. In this paper, we propose optimal RS codes (OptRS codes in short) based on RS codes and CRS codes that can offer better performance for encoding and decoding as well as maximizing the utilization of storage space. OptRS codes can spee

APA, Harvard, Vancouver, ISO, and other styles

34

Kowalik, Janusz. "ACTORS: A Model of Concurrent Computation in Distributed Systems (Gul Agha)." SIAM Review 30, no. 1 (1988): 146. http://dx.doi.org/10.1137/1030027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Gouveia, Bruno Duarte, David Portugal, Daniel C. Silva, and Lino Marques. "Computation Sharing in Distributed Robotic Systems: A Case Study on SLAM." IEEE Transactions on Automation Science and Engineering 12, no. 2 (2015): 410–22. http://dx.doi.org/10.1109/tase.2014.2357216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Kumar, Parveen. "A Low-Cost Hybrid Coordinated Checkpointing Protocol for Mobile Distributed Systems." Mobile Information Systems 4, no. 1 (2008): 13–32. http://dx.doi.org/10.1155/2008/982349.

Full text

Abstract:

Mobile distributed systems raise new issues such as mobility, low bandwidth of wireless channels, disconnections, limited battery power and lack of reliable stable storage on mobile nodes. In minimum-process coordinated checkpointing, some processes may not checkpoint for several checkpoint initiations. In the case of a recovery after a fault, such processes may rollback to far earlier checkpointed state and thus may cause greater loss of computation. In all-process coordinated checkpointing, the recovery line is advanced for all processes but the checkpointing overhead may be exceedingly high

APA, Harvard, Vancouver, ISO, and other styles

37

Yang, Laurence Tianruo. "THE IMPROVED PARALLEL ICGS METHOD FOR LARGE AND SPARSE UNSYMMETRIC LINEAR SYSTEMS." Parallel Processing Letters 15, no. 04 (2005): 459–67. http://dx.doi.org/10.1142/s0129626405002374.

Full text

Abstract:

For the solutions of large and sparse linear systems of equations with unsymmetric coefficient matrices, we propose an improved version of the Conjugate Gradient Squared method (ICGS) method. The algorithm is derived such that all inner products, matrix-vector multiplications and vector updates of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. Therefore, the cost of global communication on parallel distributed memory computers can be significantly reduced. The resulting ICGS algori

APA, Harvard, Vancouver, ISO, and other styles

38

Gharbi, Atef. "A Social Multi-Agent Cooperation System Based on Planning and Distributed Task Allocation." Information 11, no. 5 (2020): 271. http://dx.doi.org/10.3390/info11050271.

Full text

Abstract:

Planning and distributed task allocation are considered challenging problems. To address them, autonomous agents called planning agents situated in a multi-agent system should cooperate to achieve planning and complete distributed tasks. We propose a solution for distributed task allocation where agents dynamically allocate the tasks while they are building the plans. We model and verify some properties using computation tree logic (CTL) with the model checker its-ctl. Lastly, simulations are performed to verify the effectiveness of our proposed solution. The result proves that it is very effi

APA, Harvard, Vancouver, ISO, and other styles

39

Luo, Siqiang. "Distributed PageRank Computation: An Improved Theoretical Study." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 4496–503. http://dx.doi.org/10.1609/aaai.v33i01.33014496.

Full text

Abstract:

PageRank is a classic measure that effectively evaluates the node importance in large graphs, and has been applied in numerous applications ranging from data mining, Web algorithms, recommendation systems, load balancing, search, and identifying connectivity structures. Computing PageRank for large graphs is challenging and this has motivated the studies of distributed algorithms to compute PageRank. Previously, little works have been spent on the distributed PageRank algorithms with provably desired complexity and accuracy. Given a graph with n nodes and if we model the distributed computatio

APA, Harvard, Vancouver, ISO, and other styles

40

DENG, YI, and SHI-KUO CHANG. "A FRAMEWORK FOR THE MODELING AND PROTOTYPING OF DISTRIBUTED INFORMATION SYSTEMS." International Journal of Software Engineering and Knowledge Engineering 01, no. 03 (1991): 203–26. http://dx.doi.org/10.1142/s0218194091000172.

Full text

Abstract:

The major issues in designing Distributed Information Systems (DIS) include localization of control and data, inherent concurrency, intensive interactions among computation agents, history sensitivity, dynamic configuration and continuous system change and evolution. We propose a framework, called the G-Net model, for the specification, modeling and prototyping of DIS. The G-Net model not only provides a flexible notation to represent the executable specification of DIS through G-Net instantiation, but also offers a novel style of decentralized concurrent computation, allowing flexible inter-a

APA, Harvard, Vancouver, ISO, and other styles

41

Tan, C. A., and C. H. Chung. "Transfer Function Formulation of Constrained Distributed Parameter Systems, Part I: Theory." Journal of Applied Mechanics 60, no. 4 (1993): 1004–11. http://dx.doi.org/10.1115/1.2900967.

Full text

Abstract:

Analysis of constrained distributed parameter systems by the transfer function formulation is presented. The methodology is suitable for symbolic computation coding. The distributed system is an assembly of distributed elements. A generalized displacement method (GDM) is developed to evaluate the free and forced responses of the system. It is shown that, while classical methods require the satisfaction of both the displacement and force boundary conditions at the subsystem interfaces, GDM only needs to impose generalized force constraints. The continuity of generalized displacements at the int

APA, Harvard, Vancouver, ISO, and other styles

42

Younas, Umair, B. Khan, S. M. Ali, and Alfredo Vaccaro. "Fast Performance Computing Model for Smart Distributed Power Systems." Sukkur IBA Journal of Computing and Mathematical Sciences 1, no. 1 (2017): 78. http://dx.doi.org/10.30537/sjcms.v1i1.10.

Full text

Abstract:

Plug-in Electric Vehicles (PEVs) are becoming the more prominent solution compared to fossil fuels cars technology due to its significant role in Greenhouse Gas (GHG) reduction, flexible storage, and ancillary service provision as a Distributed Generation (DG) resource in Vehicle to Grid (V2G) regulation mode. However, large-scale penetration of PEVs and growing demand of energy intensive Data Centers (DCs) brings undesirable higher load peaks in electricity demand hence, impose supply-demand imbalance and threaten the reliability of wholesale and retail power market. In order to overcome the

APA, Harvard, Vancouver, ISO, and other styles

43

Sumana M. and Hareesha K.S. "Accurate Classification Models for Distributed Mining of Privately Preserved Data." International Journal of Information Security and Privacy 10, no. 4 (2016): 58–73. http://dx.doi.org/10.4018/ijisp.2016100104.

Full text

Abstract:

Data maintained at various sectors, needs to be mined to derive useful inferences. Larger part of the data is sensitive and not to be revealed while mining. Current methods perform privacy preservation classification either by randomizing, perturbing or anonymizing the data during mining. These forms of privacy preserving mining work well for data centralized at a single site. Moreover the amount of information hidden during mining is not sufficient. When perturbation approaches are used, data reconstruction is a major challenge. This paper aims at modeling classifiers for data distributed acr

APA, Harvard, Vancouver, ISO, and other styles

44

Naz, Najia, Abdul Haseeb Malik, Abu Bakar Khurshid, et al. "Efficient Processing of Image Processing Applications on CPU/GPU." Mathematical Problems in Engineering 2020 (October 10, 2020): 1–14. http://dx.doi.org/10.1155/2020/4839876.

Full text

Abstract:

Heterogeneous systems have gained popularity due to the rapid growth in data and the need for processing this big data to extract useful information. In recent years, many healthcare applications have been developed which use machine learning algorithms to perform tasks such as image classification, object detection, image segmentation, and instance segmentation. The increasing amount of big visual data requires images to be processed efficiently. It is common that we use heterogeneous systems for such type of applications, as processing a huge number of images on a single PC may take months o

APA, Harvard, Vancouver, ISO, and other styles

45

Sefidgaran, Milad, and Aslan Tchamkerten. "Distributed Function Computation Over a Rooted Directed Tree." IEEE Transactions on Information Theory 62, no. 12 (2016): 7135–52. http://dx.doi.org/10.1109/tit.2016.2530398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Huberman, Bernardo A. "THE COLLECTIVE BRAIN." International Journal of Neural Systems 01, no. 01 (1989): 41–45. http://dx.doi.org/10.1142/s012906578900044x.

Full text

Abstract:

Since their invention, computers have been designed, used and improved using the human mind as metaphor. The appearance of a distributed form of computation in large networks in shifting the emphasis towards social structures as a source of inspiration for the design of new systems. I suggest that a reverse strategy could prove to be useful as well. If our results are any indication of future developments, the workings of distributed computational systems could provide a flexible and controlled environment for the study of complex interactions that are seldom accessible in the natural world.

APA, Harvard, Vancouver, ISO, and other styles

47

Asperti, Andrea. "Causal dependencies in multiplicative linear logic with MIX." Mathematical Structures in Computer Science 5, no. 3 (1995): 351–80. http://dx.doi.org/10.1017/s0960129500000797.

Full text

Abstract:

A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with the MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical flow of information inside a proof, that is, roughly speaking, a distributed version of Girard's token trip. Proof Nets are then characterised as deadlock free Proof Structures (deadlock free distributed systems). This result follows by explicitly considering th

APA, Harvard, Vancouver, ISO, and other styles

48

Kang, Qin Ma, Hong He, and Hai Ning Jiang. "An Iterated Local Search Algorithm for Task Assignment in Distributed Computing Systems." Advanced Materials Research 588-589 (November 2012): 1308–11. http://dx.doi.org/10.4028/www.scientific.net/amr.588-589.1308.

Full text

Abstract:

This paper considers the problem of task assignment in heterogeneous distributed computing systems with the goal of minimizing the total execution and communication costs. An iterated local search algorithm is proposed for finding the suboptimal task assignment in a reasonable amount of computation time. We study the performance of the proposed algorithm over a wide range of parameters such as the problem scales, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness of the algorithm is manifested by comparing it wit

APA, Harvard, Vancouver, ISO, and other styles

49

Slotine, Jean-Jacques E. "Modular stability tools for distributed computation and control." International Journal of Adaptive Control and Signal Processing 17, no. 6 (2003): 397–416. http://dx.doi.org/10.1002/acs.754.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ruan, Yali, Yingting Luo, and Yunmin Zhu. "Globally Optimal Distributed Kalman Filtering for Multisensor Systems with Unknown Inputs." Sensors 18, no. 9 (2018): 2976. http://dx.doi.org/10.3390/s18092976.

Full text

Abstract:

In this paper, the state estimation for dynamic system with unknown inputs modeled as an autoregressive AR (1) process is considered. We propose an optimal algorithm in mean square error sense by using difference method to eliminate the unknown inputs. Moreover, we consider the state estimation for multisensor dynamic systems with unknown inputs. It is proved that the distributed fused state estimate is equivalent to the centralized Kalman filtering using all sensor measurement; therefore, it achieves the best performance. The computation complexity of the traditional augmented state algorithm

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!