Log in

Relevant bibliographies by topics / FLEXIBLE COMPUTATION / Journal articles

Journal articles on the topic 'FLEXIBLE COMPUTATION'

To see the other types of publications on this topic, follow the link: FLEXIBLE COMPUTATION.

Author: Grafiati

Published: 10 March 2023

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 'FLEXIBLE COMPUTATION.'

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

Kozlov, Andrei S., and Timothy Q. Gentner. "Central auditory neurons display flexible feature recombination functions." Journal of Neurophysiology 111, no. 6 (March 15, 2014): 1183–89. http://dx.doi.org/10.1152/jn.00637.2013.

Full text

Abstract:

Recognition of natural stimuli requires a combination of selectivity and invariance. Classical neurobiological models achieve selectivity and invariance, respectively, by assigning to each cortical neuron either a computation equivalent to the logical “AND” or a computation equivalent to the logical “OR.” One powerful OR-like operation is the MAX function, which computes the maximum over input activities. The MAX function is frequently employed in computer vision to achieve invariance and considered a key operation in visual cortex. Here we explore the computations for selectivity and invariance in the auditory system of a songbird, using natural stimuli. We ask two related questions: does the MAX operation exist in auditory system? Is it implemented by specialized “MAX” neurons, as assumed in vision? By analyzing responses of individual neurons to combinations of stimuli we systematically sample the space of implemented feature recombination functions. Although we frequently observe the MAX function, we show that the same neurons that implement it also readily implement other operations, including the AND-like response. We then show that sensory adaptation, a ubiquitous property of neural circuits, causes transitions between these operations in individual neurons, violating the fixed neuron-to-computation mapping posited in the state-of-the-art object-recognition models. These transitions, however, accord with predictions of neural-circuit models incorporating divisive normalization and variable polynomial nonlinearities at the spike threshold. Because these biophysical properties are not tied to a particular sensory modality but are generic, the flexible neuron-to-computation mapping demonstrated in this study in the auditory system is likely a general property.

APA, Harvard, Vancouver, ISO, and other styles

2

Sun, Jiameng, Binrui Zhu, Jing Qin, Jiankun Hu, and Jixin Ma. "Confidentiality-Preserving Publicly Verifiable Computation Schemes for Polynomial Evaluation and Matrix-Vector Multiplication." Security and Communication Networks 2018 (June 21, 2018): 1–15. http://dx.doi.org/10.1155/2018/5275132.

Full text

Abstract:

With the development of cloud services, outsourcing computation tasks to a commercial cloud server has drawn attention of various communities, especially in the Big Data era. Public verifiability offers a flexible functionality in real circumstance where the cloud service provider (CSP) may be untrusted or some malicious users may slander the CSP on purpose. However, sometimes the computational result is sensitive and is supposed to remain undisclosed in the public verification phase, while existing works on publicly verifiable computation (PVC) fail to achieve this requirement. In this paper, we highlight the property of result confidentiality in publicly verifiable computation and present confidentiality-preserving public verifiable computation (CP-PVC) schemes for multivariate polynomial evaluation and matrix-vector multiplication, respectively. The proposed schemes work efficiently under the amortized model and, compared with previous PVC schemes for these computations, achieve confidentiality of computational results, while maintaining the property of public verifiability. The proposed schemes proved to be secure, efficient, and result-confidential. In addition, we provide the algorithms and experimental simulation to show the performance of the proposed schemes, which indicates that our proposal is also acceptable in practice.

APA, Harvard, Vancouver, ISO, and other styles

3

Kwon, Dongup, Wonsik Lee, Dongryeong Kim, Junehyuk Boo, and Jangwoo Kim. "SmartFVM: A Fast, Flexible, and Scalable Hardware-based Virtualization for Commodity Storage Devices." ACM Transactions on Storage 18, no. 2 (May 31, 2022): 1–27. http://dx.doi.org/10.1145/3511213.

Full text

Abstract:

A computational storage device incorporating a computation unit inside or near its storage unit is a highly promising technology to maximize a storage server’s performance. However, to apply such computational storage devices and take their full potential in virtualized environments, server architects must resolve a fundamental challenge: cost-effective virtualization . This critical challenge can be directly addressed by the following questions: (1) how to virtualize two different hardware units (i.e., computation and storage), and (2) how to integrate them to construct virtual computational storage devices, and (3) how to provide them to users. However, the existing methods for computational storage virtualization severely suffer from their low performance and high costs due to the lack of hardware-assisted virtualization support. In this work, we propose SmartFVM-Engine , an FPGA card designed to maximize the performance and cost-effectiveness of computational storage virtualization. SmartFVM-Engine introduces three key ideas to achieve the design goals. First, it achieves high virtualization performance by applying hardware-assisted virtualization to both computation and storage units. Second, it further improves the performance by applying hardware-assisted resource orchestration for the virtualized units. Third, it achieves high cost-effectiveness by dynamically constructing and scheduling virtual computational storage devices. To the best of our knowledge, this is the first work to implement a hardware-assisted virtualization mechanism for modern computational storage devices.

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Weixiong. "Iterative state-space reduction for flexible computation." Artificial Intelligence 126, no. 1-2 (February 2001): 109–38. http://dx.doi.org/10.1016/s0004-3702(00)00066-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Lian, and Zhi Xin Huang. "Research on the Smart Grid Dispatching System Based on Cloud Computing." Applied Mechanics and Materials 385-386 (August 2013): 1730–33. http://dx.doi.org/10.4028/www.scientific.net/amm.385-386.1730.

Full text

Abstract:

Dispatching being the core of the power operation and control, intelligent dispatching is the key point of the construction of unified and strong smart grid. During the construction of smart grid dispatching technical support system, many key points and difficulties must be addressed including massive data storage and processing, huge computational applications of security and stability assessment, unified management and flexible expansion of the system, flexible deployment and dispatching operations, integration of calculation and analysis capabilities. Based on the relevant characteristics of cloud computation, there latest technologies using cloud computation and the optimization of platform in constructing smart grid dispatching technical support system were discussed.

APA, Harvard, Vancouver, ISO, and other styles

6

Murray, Megan H., and Jeffrey D. Blume. "FDRestimation: Flexible False Discovery Rate Computation in R." F1000Research 10 (June 3, 2021): 441. http://dx.doi.org/10.12688/f1000research.52999.1.

Full text

Abstract:

False discovery rates (FDR) are an essential component of statistical inference, representing the propensity for an observed result to be mistaken. FDR estimates should accompany observed results to help the user contextualize the relevance and potential impact of findings. This paper introduces a new user-friendly R pack-age for estimating FDRs and computing adjusted p-values for FDR control. The roles of these two quantities are often confused in practice and some software packages even report the adjusted p-values as the estimated FDRs. A key contribution of this package is that it distinguishes between these two quantities while also offering a broad array of refined algorithms for estimating them. For example, included are newly augmented methods for estimating the null proportion of findings - an important part of the FDR estimation procedure. The package is broad, encompassing a variety of adjustment methods for FDR estimation and FDR control, and includes plotting functions for easy display of results. Through extensive illustrations, we strongly encourage wider reporting of false discovery rates for observed findings.

APA, Harvard, Vancouver, ISO, and other styles

7

Murray, Megan H., and Jeffrey D. Blume. "FDRestimation: Flexible False Discovery Rate Computation in R." F1000Research 10 (October 19, 2021): 441. http://dx.doi.org/10.12688/f1000research.52999.2.

Full text

Abstract:

False discovery rates (FDR) are an essential component of statistical inference, representing the propensity for an observed result to be mistaken. FDR estimates should accompany observed results to help the user contextualize the relevance and potential impact of findings. This paper introduces a new user-friendly R pack-age for estimating FDRs and computing adjusted p-values for FDR control. The roles of these two quantities are often confused in practice and some software packages even report the adjusted p-values as the estimated FDRs. A key contribution of this package is that it distinguishes between these two quantities while also offering a broad array of refined algorithms for estimating them. For example, included are newly augmented methods for estimating the null proportion of findings - an important part of the FDR estimation procedure. The package is broad, encompassing a variety of adjustment methods for FDR estimation and FDR control, and includes plotting functions for easy display of results. Through extensive illustrations, we strongly encourage wider reporting of false discovery rates for observed findings.

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Yu, Jianxin Wu, Jianfei Cai, and Weiyao Lin. "Flexible Image Similarity Computation Using Hyper-Spatial Matching." IEEE Transactions on Image Processing 23, no. 9 (September 2014): 4112–25. http://dx.doi.org/10.1109/tip.2014.2344296.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bauchau, Olivier A. "Parallel computation approaches for flexible multibody dynamics simulations." Journal of the Franklin Institute 347, no. 1 (February 2010): 53–68. http://dx.doi.org/10.1016/j.jfranklin.2009.10.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fukui, Masaki, Jun Tanida, and Yoshiki Ichioka. "Flexible-structured computation based on optical array logic." Applied Optics 29, no. 11 (April 10, 1990): 1604. http://dx.doi.org/10.1364/ao.29.001604.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

DUNMUR, DAVID A., MARTIN GRAYSON, and BARRY T. PICKUP MARK R. WILSON. "The computation of molecular properties of flexible molecules." Molecular Physics 90, no. 2 (February 1997): 179–87. http://dx.doi.org/10.1080/002689797172660.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kong, Xiaoqin, Qin Li, Chunhui Wu, Fang Yu, Jinjun He, and Zhiyuan Sun. "Multiple-server Flexible Blind Quantum Computation in Networks." International Journal of Theoretical Physics 55, no. 6 (February 11, 2016): 3001–7. http://dx.doi.org/10.1007/s10773-016-2932-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Maass, Wolfgang, and Pekka Orponen. "On the Effect of Analog Noise in Discrete-Time Analog Computations." Neural Computation 10, no. 5 (July 1, 1998): 1071–95. http://dx.doi.org/10.1162/089976698300017359.

Full text

Abstract:

We introduce a model for analog computation with discrete time in the presence of analog noise that is flexible enough to cover the most important concrete cases, such as noisy analog neural nets and networks of spiking neurons. This model subsumes the classical model for digital computation in the presence of noise. We show that the presence of arbitrarily small amounts of analog noise reduces the power of analog computational models to that of finite automata, and we also prove a new type of upper bound for the VC-dimension of computational models with analog noise.

APA, Harvard, Vancouver, ISO, and other styles

14

Gu, M. F. "The flexible atomic code." Canadian Journal of Physics 86, no. 5 (May 1, 2008): 675–89. http://dx.doi.org/10.1139/p07-197.

Full text

Abstract:

We describe a complete software package for the computation of various atomic data such as energy levels; radiative transition; collisional excitation; ionization by electron impact, photoionization, autoionization; and their inverse processes radiative recombination and dielectronic capture. The atomic theoretical background and numerical techniques associated with each process are discussed in detail. Sample applications and results are presented. PACS Nos.: 31.15.–p, 32.70.Cs, 34.80.Kw, 32.80.Fb, 32.80.Dz

APA, Harvard, Vancouver, ISO, and other styles

15

Brockett, Patrick L., Linda L. Golden, and Harry H. Panjer. "Flexible Purchase Frequency Modeling." Journal of Marketing Research 33, no. 1 (February 1996): 94–107. http://dx.doi.org/10.1177/002224379603300109.

Full text

Abstract:

The authors present a general framework for purchase frequency modeling that enables flexible fitting and convenient computation. Their easily described purchase frequency distributions subsume many previous models and provide a connection between mixed Poisson marketing models and the conceptually distinct compound Poisson models. These distributions provide simple parametric equations for individual-level prediction of second-period purchase frequency based on observed first-period purchase frequencies. The results are applied to four marketing panel data sets.

APA, Harvard, Vancouver, ISO, and other styles

16

Desmet, Johan, Ian A. Wilson, Marcel Joniau, Marc De Maeyer, and Ignace Lasters. "Computation of the binding of fully flexible peptides to proteins with flexible side chains." FASEB Journal 11, no. 2 (February 1997): 164–72. http://dx.doi.org/10.1096/fasebj.11.2.9039959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Karageorgos, Ioannis, Karthik Sriram, Jan Vesely, Nick Lindsay, Xiayuan Wen, Michael Wu, Marc Powell, David Borton, Rajit Manohar, and Abhishek Bhattacharjee. "Balancing Specialized Versus Flexible Computation in Brain–Computer Interfaces." IEEE Micro 41, no. 3 (May 1, 2021): 87–94. http://dx.doi.org/10.1109/mm.2021.3065455.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Gupta, Rikin, Nathan J. Love, Rakesh K. Kapania, and David K. Schmidt. "Nonintrusive Computation of Rigid-Body/Flexible-Body Coupling Integrals." AIAA Journal 58, no. 5 (May 2020): 2330–38. http://dx.doi.org/10.2514/1.j058243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

van Kesteren, Erik–Jan, and Daniel L. Oberski. "Flexible Extensions to Structural Equation Models Using Computation Graphs." Structural Equation Modeling: A Multidisciplinary Journal 29, no. 2 (October 20, 2021): 233–47. http://dx.doi.org/10.1080/10705511.2021.1971527.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Merelo Guervós, Juan Julián, Pedro A. Castillo, and Enrique Alba. "Algorithm::Evolutionary, a flexible Perl module for evolutionary computation." Soft Computing 14, no. 10 (October 1, 2009): 1091–109. http://dx.doi.org/10.1007/s00500-009-0504-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Čufar, Matija. "Ripserer.jl: flexible and efficient persistent homology computation in Julia." Journal of Open Source Software 5, no. 54 (October 19, 2020): 2614. http://dx.doi.org/10.21105/joss.02614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Mubarak, Misbah, Seegyoung Seol, Qiukai Lu, and Mark S. Shephard. "A Parallel Ghosting Algorithm for The Flexible Distributed Mesh Database." Scientific Programming 21, no. 1-2 (2013): 17–42. http://dx.doi.org/10.1155/2013/654971.

Full text

Abstract:

Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topological order in a 1D, 2D or 3D mesh based on selected adjacencies. (2) It exploits neighborhood communication patterns during the ghost creation process thus eliminating all-to-all communication. (3) For applications that need neighbors of neighbors, the algorithm can creatennumber of ghost layers up to a point where the whole partitioned mesh can be ghosted. Strong and weak scaling results are presented for the IBM BG/P and Cray XE6 architectures up to a core count of 32,768 processors. The algorithm also leads to scalable results when used in a parallel super-convergent patch recovery error estimator, an application that frequently accesses neighborhood data to carry out computation.

APA, Harvard, Vancouver, ISO, and other styles

23

Nalini, K., Sai Suneel, and S. B. Sridevi. "A Real-Time Optimal Route Computation for Public Transport System Using Web." INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY 5, no. 1 (August 15, 2013): 417–22. http://dx.doi.org/10.24297/ijmit.v5i1.767.

Full text

Abstract:

In this work describes web-map public transport enquiry system as described in this paper, gives a good example of providing bilingual information and public transport run in the form of interactive maps and texts, as well as real time derivation of optimal travelling routes for users in terms of multiple criteria, i.e., preferred mode, least changes, shortest travelling time, or lowest fare. This paper describes a research on The Flexible Bus Systems (FBS) using SMAC as a communication medium. The Flexible Bus System is a demand responsive transit (DRT) but it is more efficient and convenient in a sense that it entertains passengers demands and gives bus locations in real time. The real time synchronization of The Flexible Bus System makes it information rich and unique as compared to other DRTs. The Flexible Bus Systems is a system that can replace the Traditional Bus Systems with its flexibility and efficiency. This paper discusses the use of wireless technologies in The Flexible Bus Systems and how to make it more reliable using short range wireless technology SMAC protocol.

APA, Harvard, Vancouver, ISO, and other styles

24

Yang, Lan, Changchuan Xie, and Chao Yang. "Geometrically exact vortex lattice and panel methods in static aeroelasticity of very flexible wing." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 234, no. 3 (November 20, 2019): 742–59. http://dx.doi.org/10.1177/0954410019885238.

Full text

Abstract:

Geometrically exact vortex lattice method and panel method are presented in this paper to deal with aerodynamic load computation for geometrically nonlinear static aeroelastic problems. They are combined with geometrically nonlinear finite element method through surface spline interpolation in the loosely-coupled iteration. From the perspective of theoretical research, both vortex lattice method and panel method are based on the full potential equation and able to model the deflection and twist of the wing, while vortex lattice method is based on the thin airfoil theory, and panel method is suitable for thick wings. Although the potential flow equation is linear, the introduction of geometrically exact boundary conditions makes it significantly different from the linear aeroelastic analysis. The numerical results of a high aspect ratio wing are provided to declare the influence of large deformation on nonlinear static aeroelastic computation compared with linear analysis. Aeroelastic analyses based on geometrically exact vortex lattice method and panel method are also compared with the results of computational fluid dynamics/computational structural dynamics coupling method and the wind tunnel test data. The nonlinear static aeroelastic analysis agrees with the measurement even in considerably large deformation situations.

APA, Harvard, Vancouver, ISO, and other styles

25

Kang, Yan, Zhong Min Wang, Ying Lin, and Yi Fan Zhang. "An Improved Genetic Algorithm for Flexible Job-Shop Scheduling Problems." Advanced Materials Research 798-799 (September 2013): 345–48. http://dx.doi.org/10.4028/www.scientific.net/amr.798-799.345.

Full text

Abstract:

The flexible job-shop scheduling algorithm with the high computational complexity is important in both fields of production management and combinatorial optimization. We developed an improved genetic approach for the flexible job-shop scheduling problem (FJSP), since it is quite difficult to achieve an optimal solution to this problem within reasonable computation time. A chromosome representation combines both routing and sequencing information is represented with genetic algorithms (GAs) commonly optimize the problem by minimizing an objective, makespan. Our algorithm selects the chromosome according to different objectives, and crossover each other to maintain the species diversity. New crossover and the mutation operators utilize the critical path with certain probability to modify assignment and sequence for preventing being trapped in a local optimum. The results obtained from the computational study have shown that the proposed algorithm is an effective approach for the FJSP.

APA, Harvard, Vancouver, ISO, and other styles

26

Sun, Fangjin, Donghan Zhu, Tiantian Liu, and Daming Zhang. "Study on Fluid-Structure Interaction of Flexible Membrane Structures in Wind-Induced Vibration." Shock and Vibration 2021 (March 17, 2021): 1–10. http://dx.doi.org/10.1155/2021/8890593.

Full text

Abstract:

A strongly coupled monolithic method was previously proposed for the computation of wind-induced fluid-structure interaction of flexible membranous structures by the authors. How to obtain the accurate solution is a key issue for the strongly coupled monolithic method. Projection methods are among the commonly used methods for the coupled solution. In the work here, to impose initial pressure boundary conditions implicitly defined in the original momentum equations in classical projection methods when dealing with large-displacement of membranous structures, a modified factor is introduced in corrector step of classical projection methods and a new modified projection method is obtained. The solution procedures of the modified projection method aimed at strongly coupled monolithic equations are given, and the related equations are derived. The proposed method is applied to the computation of a two-dimensional fluid-structure interaction benchmark case and wind-induced fluid-structure interaction of a three-dimensional flexible membranous structure. The performance and efficiency of the modified projection method are evaluated. The results show that the modified projection methods are valid in the computation of wind-induced fluid-structure interaction of flexible membranous structures, with higher accuracy and efficiency compared with traditional methods. The modified value has little effects on the computation results whereas iteration times has significant effects. Computation accuracy can be improved greatly by increasing iteration times with less increase in computation time and little effects on stability with the modified projection method.

APA, Harvard, Vancouver, ISO, and other styles

27

Ma, Jiaqi, Zhe Zhao, Jilin Chen, Ang Li, Lichan Hong, and Ed H. Chi. "SNR: Sub-Network Routing for Flexible Parameter Sharing in Multi-Task Learning." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 216–23. http://dx.doi.org/10.1609/aaai.v33i01.3301216.

Full text

Abstract:

Machine learning applications, such as object detection and content recommendation, often require training a single model to predict multiple targets at the same time. Multi-task learning through neural networks became popular recently, because it not only helps improve the accuracy of many prediction tasks when they are related, but also saves computation cost by sharing model architectures and low-level representations. The latter is critical for real-time large-scale machine learning systems. However, classic multi-task neural networks may degenerate significantly in accuracy when tasks are less related. Previous works (Misra et al. 2016; Yang and Hospedales 2016; Ma et al. 2018) showed that having more flexible architectures in multi-task models, either manually-tuned or softparameter-sharing structures like gating networks, helps improve the prediction accuracy. However, manual tuning is not scalable, and the previous soft-parameter sharing models are either not flexible enough or computationally expensive. In this work, we propose a novel framework called SubNetwork Routing (SNR) to achieve more flexible parameter sharing while maintaining the computational advantage of the classic multi-task neural-network model. SNR modularizes the shared low-level hidden layers into multiple layers of subnetworks, and controls the connection of sub-networks with learnable latent variables to achieve flexible parameter sharing. We demonstrate the effectiveness of our approach on a large-scale dataset YouTube8M. We show that the proposed method improves the accuracy of multi-task models while maintaining their computation efficiency.

APA, Harvard, Vancouver, ISO, and other styles

28

Asada, H., Z. D. Ma, and H. Tokumaru. "Inverse Dynamics of Flexible Robot Arms: Modeling and Computation for Trajectory Control." Journal of Dynamic Systems, Measurement, and Control 112, no. 2 (June 1, 1990): 177–85. http://dx.doi.org/10.1115/1.2896124.

Full text

Abstract:

The inverse dynamics of robot manipulators based on flexible arm models are considered. Actuator torques required for a flexible arm to track a given trajectory are formulated and computed by using special moving coordinate systems, called virtual rigid link coordinates. Dynamic deformations of the flexible arm can be represented in a simple and compact form with use of the virtual coordinate systems. This eliminates a number of terms involved in the equations of motion and significantly reduces complexity in the inverse dynamics computation. An efficient algorithm for computing the actuator torques is then presented on the basis of the simplified formulation, and applied to a two-link arm problem.

APA, Harvard, Vancouver, ISO, and other styles

29

Kawabe, Tomoya, Tatsushi Nishi, and Ziang Liu. "Flexible Route Planning for Multiple Mobile Robots by Combining Q–Learning and Graph Search Algorithm." Applied Sciences 13, no. 3 (January 31, 2023): 1879. http://dx.doi.org/10.3390/app13031879.

Full text

Abstract:

The use of multiple mobile robots has grown significantly over the past few years in logistics, manufacturing and public services. Conflict–free route planning is one of the major research challenges for such mobile robots. Optimization methods such as graph search algorithms are used extensively to solve route planning problems. Those methods can assure the quality of solutions, however, they are not flexible to deal with unexpected situations. In this article, we propose a flexible route planning method that combines the reinforcement learning algorithm and a graph search algorithm for conflict–free route planning problems for multiple robots. In the proposed method, Q–learning, a reinforcement algorithm, is applied to avoid collisions using off–line learning with a limited state space to reduce the total learning time. Each vehicle independently finds the shortest route using the A* algorithm, and Q–learning is used to avoid collisions. The effectiveness of the proposed method is examined by comparing it with conventional methods in terms of computation time and the quality of solutions. Computational results show that for dynamic transportation problems, the proposed method can generate the solutions with approximately 10% of the computation time compared to the conventional Q–learning approach. We found that the required computation time is linearly increased with respect to the number of vehicles and nodes in the problems.

APA, Harvard, Vancouver, ISO, and other styles

30

Fournier, Damien, Chris S. Hanson, Laurent Gizon, and Hélène Barucq. "Sensitivity kernels for time-distance helioseismology." Astronomy & Astrophysics 616 (August 2018): A156. http://dx.doi.org/10.1051/0004-6361/201833206.

Full text

Abstract:

Context. The interpretation of helioseismic measurements, such as wave travel-time, is based on the computation of kernels that give the sensitivity of the measurements to localized changes in the solar interior. These kernels are computed using the ray or the Born approximation. The Born approximation is preferable as it takes finite-wavelength effects into account, although it can be computationally expensive. Aims. We propose a fast algorithm to compute travel-time sensitivity kernels under the assumption that the background solar medium is spherically symmetric. Methods. Kernels are typically expressed as products of Green’s functions that depend upon depth, latitude, and longitude. Here, we compute the spherical harmonic decomposition of the kernels and show that the integrals in latitude and longitude can be performed analytically. In particular, the integrals of the product of three associated Legendre polynomials can be computed. Results. The computations are fast and accurate and only require the knowledge of the Green’s function where the source is at the pole. The computation time is reduced by two orders of magnitude compared to other recent computational frameworks. Conclusions. This new method allows flexible and computationally efficient calculations of a large number of kernels, required in addressing key helioseismic problems. For example, the computation of all the kernels required for meridional flow inversion takes less than two hours on 100 cores.

APA, Harvard, Vancouver, ISO, and other styles

31

Marson-Pidgeon, K., and B. L. N. Kennett. "Flexible computation of teleseismic synthetics for source and structural studies." Geophysical Journal International 143, no. 3 (December 2000): 689–99. http://dx.doi.org/10.1046/j.1365-246x.2000.00268.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

van Tonder, G. J., and Y. Ejima. "Flexible computation of shape symmetries within the maximal disk paradigm." IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 33, no. 3 (June 2003): 535–41. http://dx.doi.org/10.1109/tsmcb.2003.810952.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Xiong, M. H., S. B. Tor, and L. P. Khoo. "WebATP: a Web-based flexible available-to-promise computation system." Production Planning & Control 14, no. 7 (October 2003): 662–72. http://dx.doi.org/10.1080/09537280310001636628.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Snape-Jenkinson, Christopher J., Stuart Crozier, and Larry K. Forbes. "A flexible method for rapid force computation in elliptical magnets." Measurement Science and Technology 12, no. 6 (May 14, 2001): 716–22. http://dx.doi.org/10.1088/0957-0233/12/6/310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Cugini, Filippo, Gianluca Meloni, Francesco Paolucci, Nicola Sambo, Marco Secondini, Luca Gerardi, Luca Poti, and Piero Castoldi. "Demonstration of Flexible Optical Network Based on Path Computation Element." Journal of Lightwave Technology 30, no. 5 (March 2012): 727–33. http://dx.doi.org/10.1109/jlt.2011.2180361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Plasser, Felix, Matthias Ruckenbauer, Sebastian Mai, Markus Oppel, Philipp Marquetand, and Leticia González. "Efficient and Flexible Computation of Many-Electron Wave Function Overlaps." Journal of Chemical Theory and Computation 12, no. 3 (February 25, 2016): 1207–19. http://dx.doi.org/10.1021/acs.jctc.5b01148.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ferreres, Gilles, and Jean-Marc Biannic. "Reliable computation of the robustness margin for a flexible aircraft." Control Engineering Practice 9, no. 12 (December 2001): 1267–78. http://dx.doi.org/10.1016/s0967-0661(01)00039-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Wu, Jinglai, Zhen Luo, Nong Zhang, and Yunqing Zhang. "Dynamic computation of flexible multibody system with uncertain material properties." Nonlinear Dynamics 85, no. 2 (April 2, 2016): 1231–54. http://dx.doi.org/10.1007/s11071-016-2757-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Ferreres, Gilles. "Computation of a Flexible Aircraft LPV/LFT Model Using Interpolation." IEEE Transactions on Control Systems Technology 19, no. 1 (January 2011): 132–39. http://dx.doi.org/10.1109/tcst.2010.2078510.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Yilei, Shuaifeng Zhang, Yi Tang, Qingtang Su, and Beijing Chen. "Rational adversary with flexible utility in secure two-party computation." Journal of Ambient Intelligence and Humanized Computing 10, no. 8 (January 12, 2018): 2913–27. http://dx.doi.org/10.1007/s12652-017-0669-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bahtui, A., G. Alfano, H. Bahai, and S. A. Hosseini-Kordkheili. "On the multi-scale computation of un-bonded flexible risers." Engineering Structures 32, no. 8 (August 2010): 2287–99. http://dx.doi.org/10.1016/j.engstruct.2010.04.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Sun, Jintong, Fucai Zhou, Qiang Wang, Zi Jiao, and Yun Zhang. "Flexible revocation and verifiability for outsourced Private Set Intersection computation." Journal of Information Security and Applications 73 (March 2023): 103438. http://dx.doi.org/10.1016/j.jisa.2023.103438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Gong, Shufeng, Chao Tian, Qiang Yin, Wenyuan Yu, Yanfeng Zhang, Liang Geng, Song Yu, Ge Yu, and Jingren Zhou. "Automating incremental graph processing with flexible memoization." Proceedings of the VLDB Endowment 14, no. 9 (May 2021): 1613–25. http://dx.doi.org/10.14778/3461535.3461550.

Full text

Abstract:

The ever-growing amount of dynamic graph data demands efficient techniques of incremental graph processing. However, incremental graph algorithms are challenging to develop. Existing approaches usually require users to manually design nontrivial incremental operators, or choose different memoization strategies for certain specific types of computation, limiting the usability and generality. In light of these challenges, we propose Ingress, an automated system for <u>in</u>cremental <u>g</u>raph proc<u>ess</u>ing. Ingress is able to incrementalize batch vertex-centric algorithms into their incremental counterparts as a whole, without the need of redesigned logic or data structures from users. Underlying Ingress is an automated incrementalization framework equipped with four different memoization policies, to support all kinds of vertex-centric computations with optimized memory utilization. We identify sufficient conditions for the applicability of these policies. Ingress chooses the best-fit policy for a given algorithm automatically by verifying these conditions. In addition to the ease-of-use and generalization, Ingress outperforms state-of-the-art incremental graph systems by 15.93X on average (up to 147.14X) in efficiency.

APA, Harvard, Vancouver, ISO, and other styles

44

Nanjo, Takao, Naoki Sugano, and Etsujiro Imanishi. "56492 FAST SIMULATION OF FLEXIBLE MULTIBODY DYNAMICS USING IMPROVED DOMAIN DECOMPOSITION TECHNIQUE(High Performance Formalisms and Computation)." Proceedings of the Asian Conference on Multibody Dynamics 2010.5 (2010): _56492–1_—_56492–8_. http://dx.doi.org/10.1299/jsmeacmd.2010.5._56492-1_.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Subudhi, Bidyadhar, Subhakanta Ranasingh, and Ajaha Swain. "Evolutionary computation approaches to tip position controller design for a two-link flexible manipulator." Archives of Control Sciences 21, no. 3 (January 1, 2011): 269–85. http://dx.doi.org/10.2478/v10170-010-0043-2.

Full text

Abstract:

Evolutionary computation approaches to tip position controller design for a two-link flexible manipulator Controlling multi-link flexible robots is very difficult compared rigid ones due to inter-link coupling, nonlinear dynamics, distributed link flexure and under-actuation. Hence, while designing controllers for such systems the controllers should be equipped with optimal gain parameters. Evolutionary Computing (EC) approaches such as Genetic Algorithm (GA), Bacteria Foraging Optimization (BFO) are popular in achieving global parameter optimizations. In this paper we exploit these EC techniques in achieving optimal PD controller for controlling the tip position of a two-link flexible robot. Performance analysis of the EC tuned PD controllers applied to a two-link flexible robot system has been discussed with number of simulation results.

APA, Harvard, Vancouver, ISO, and other styles

46

Tailakova, Anna, Alexander Pimonov, and Daulet Mahambayev. "Evolutionary computation and genetic algorithms for designing the optimal mine haul road pavements." E3S Web of Conferences 315 (2021): 03012. http://dx.doi.org/10.1051/e3sconf/202131503012.

Full text

Abstract:

An overview of the software for designing flexible road pavements used in the USA, European countries and the Russian Federation is given, conceptual and mathematical models for designing flexible road pavements with the minimum cost per a linear meter are presented, the application of evolutionary algorithms in combination with exhaustive search and parallel computing is substantiated, the developed hybrid genetic algorithm for the optimization of flexible road pavement designs in terms of value of materials of layers is described, the results of a simulation experiment performed using the software developed within the framework of the study are presented in the article. It is proposed to use the developed software and algorithms for designing the optimal haul road pavements in terms of material cost.

APA, Harvard, Vancouver, ISO, and other styles

47

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 (September 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-agent communication and interaction. A prototype of the G-Net framework has been implemented on workstations connected by a local network.

APA, Harvard, Vancouver, ISO, and other styles

48

Mabuchi, Hiroshi, Kiyoshi Akama, Takahiko Ishikawa, and Hidekatsu Koike. "Integration of Syntactic Analysis and Semantic Interpretation Based on Equivalent Transformation." Journal of Advanced Computational Intelligence and Intelligent Informatics 7, no. 3 (October 20, 2003): 306–14. http://dx.doi.org/10.20965/jaciii.2003.p0306.

Full text

Abstract:

Making an efficient algorithm for natural language understanding by means of flexible and cooperative interaction between syntactic analysis and semantic interpretation is very difficult. In order to overcome the difficulties, the present paper proposes a new method for designing knowledge processing systems, the computation of which is based on equivalent transformation of declarative descriptions. Basic procedures for syntactic analysis and semantic interpretation are formalized as mutually independent equivalent transformation rules. Rule selection is dynamically determined flexibly during execution by a general principle independent of the domain of sentences.

APA, Harvard, Vancouver, ISO, and other styles

49

Šedivý, Dominik, Simona Fialová, Roman Klas, and Michal Kotek. "FSI Computation and Experimental Verification of Fluid Flow in Flexible Tubes." Measurement Science Review 20, no. 3 (June 1, 2020): 104–14. http://dx.doi.org/10.2478/msr-2020-0013.

Full text

Abstract:

AbstractPresented paper is focused on the experimental and computational study of fluid flow in pipes with flexible walls. One possible real example of this phenomenon is the blood flow in arteries or their substitutes in the human body. The artery material itself should be understood as anisotropic and heterogeneous. Therefore, the experiment was carried out on the deforming tube, made of silicone (polydimethylsiloxane - PDMS). Obtained results and observed events were verified by numerical FSI simulations. Due to the large deformations occurring during loading of the tube, it was necessary to work with a dynamic mesh in the CFD part. Based on experimental testing of the tube material, a non-Hookean and Mooney-Rivlin material model were considered. Blood flowing in vessels is a heterogeneous liquid and exhibits non-Newtonian properties. In the real experimental stand has been somewhat simplified. Water, chosen as the liquid, belongs to the Newtonian liquids. The results show mainly comparisons of unsteady velocity profiles between the experiment and the numerical model.

APA, Harvard, Vancouver, ISO, and other styles

50

Ding, Wenxiu, Rui Hu, Zheng Yan, Xinren Qian, Robert H. Deng, Laurence T. Yang, and Mianxiong Dong. "An Extended Framework of Privacy-Preserving Computation With Flexible Access Control." IEEE Transactions on Network and Service Management 17, no. 2 (June 2020): 918–30. http://dx.doi.org/10.1109/tnsm.2019.2952462.

Full text

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!