Articles de revues sur le sujet « Computational capabilities »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Computational capabilities.

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Computational capabilities ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Lin, Hai-Qing. « Boosting computational capabilities ». Nature Materials 15, no 7 (22 juin 2016) : 693–94. http://dx.doi.org/10.1038/nmat4675.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Weihe, S., et B. Kröplin. « Computational mechanics : capabilities and restrictions ». Computational Materials Science 16, no 1-4 (décembre 1999) : 10–16. http://dx.doi.org/10.1016/s0927-0256(99)00040-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Neirotti, J. P., et L. Franco. « Computational capabilities of multilayer committee machines ». Journal of Physics A : Mathematical and Theoretical 43, no 44 (18 octobre 2010) : 445103. http://dx.doi.org/10.1088/1751-8113/43/44/445103.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Scarselli, F., M. Gori, Ah Chung Tsoi, M. Hagenbuchner et G. Monfardini. « Computational Capabilities of Graph Neural Networks ». IEEE Transactions on Neural Networks 20, no 1 (janvier 2009) : 81–102. http://dx.doi.org/10.1109/tnn.2008.2005141.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

CABESSA, JÉRÉMIE, et HAVA T. SIEGELMANN. « THE SUPER-TURING COMPUTATIONAL POWER OF PLASTIC RECURRENT NEURAL NETWORKS ». International Journal of Neural Systems 24, no 08 (20 novembre 2014) : 1450029. http://dx.doi.org/10.1142/s0129065714500294.

Texte intégral
Résumé :
We study the computational capabilities of a biologically inspired neural model where the synaptic weights, the connectivity pattern, and the number of neurons can evolve over time rather than stay static. Our study focuses on the mere concept of plasticity of the model so that the nature of the updates is assumed to be not constrained. In this context, we show that the so-called plastic recurrent neural networks (RNNs) are capable of the precise super-Turing computational power — as the static analog neural networks — irrespective of whether their synaptic weights are modeled by rational or real numbers, and moreover, irrespective of whether their patterns of plasticity are restricted to bi-valued updates or expressed by any other more general form of updating. Consequently, the incorporation of only bi-valued plastic capabilities in a basic model of RNNs suffices to break the Turing barrier and achieve the super-Turing level of computation. The consideration of more general mechanisms of architectural plasticity or of real synaptic weights does not further increase the capabilities of the networks. These results support the claim that the general mechanism of plasticity is crucially involved in the computational and dynamical capabilities of biological neural networks. They further show that the super-Turing level of computation reflects in a suitable way the capabilities of brain-like models of computation.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Siegelmann, H. T., B. G. Horne et C. L. Giles. « Computational capabilities of recurrent NARX neural networks ». IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 27, no 2 (avril 1997) : 208–15. http://dx.doi.org/10.1109/3477.558801.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Priel, Avner, Marcelo Blatt, Tal Grossmann, Eytan Domany et Ido Kanter. « Computational capabilities of restricted two-layered perceptrons ». Physical Review E 50, no 1 (1 juillet 1994) : 577–95. http://dx.doi.org/10.1103/physreve.50.577.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Huang, Xin, Haotian Yin, Xin Zhang, Di Zhang, Sheng Chai, Bin Xing, Jie Zhang, Xiaoling Yu, Yu Zhou et Haixia Zheng. « Efficient and Secure Pairing Protocol for Devices with Unbalanced Computational Capabilities ». Mathematics 10, no 14 (13 juillet 2022) : 2447. http://dx.doi.org/10.3390/math10142447.

Texte intégral
Résumé :
Wearable devices that collect data about human beings are widely used in healthcare applications. Once collected, the health data will be securely transmitted to smartphones in most scenarios. Authenticated Key Exchange (AKE) can protect wireless communications between wearables and smartphones, and a typical solution is the Bluetooth Secure Simple Pairing (SSP) protocol with numeric comparison. However, this protocol requires equivalent computation on both devices, even though their computational capabilities are significantly different. This paper proposes a lightweight numeric comparison protocol for communications in which two parties have unbalanced computational capabilities, e.g., a wearable sensor and a smartphone, named UnBalanced secure Pairing using numeric comparison (UB-Pairing for short). The security of UB-Pairing is analyzed using the modified Bellare–Rogaway model (mBR). The analysis results show that UB-Pairing achieves the security goals. We also carry out a number of experiments to evaluate the performance of UB-Pairing. The results show that UB-Pairing is friendly to wearable devices, and more efficient than standard protocols when the computation capabilities of the two communication parties are highly unbalanced.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Escribano, Jesús, Francisco Botana et Miguel A. Abánades. « Adding remote computational capabilities to Dynamic Geometry Systems ». Mathematics and Computers in Simulation 80, no 6 (février 2010) : 1177–84. http://dx.doi.org/10.1016/j.matcom.2008.04.019.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Chourasiya, Neelesh L., et Neeraj Mohan. « Computational Offloading in Android Devices Using Cloud Computing Capabilities ». International Journal on Communications Antenna and Propagation (IRECAP) 8, no 1 (28 février 2018) : 9. http://dx.doi.org/10.15866/irecap.v7i6.13349.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
11

Skocik, Michael J., et Lyle N. Long. « On the Capabilities and Computational Costs of Neuron Models ». IEEE Transactions on Neural Networks and Learning Systems 25, no 8 (août 2014) : 1474–83. http://dx.doi.org/10.1109/tnnls.2013.2294016.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Bower, Matt, Leigh Wood, Jennifer Lai, Cathie Howe, Raymond Lister, Raina Mason, Kate Highfield et Jennifer Veal. « Improving the Computational Thinking Pedagogical Capabilities of School Teachers ». Australian Journal of Teacher Education 42, no 3 (mars 2017) : 53–72. http://dx.doi.org/10.14221/ajte.2017v42n3.4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
13

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

Texte intégral
Résumé :
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 and networking capabilities for computational machines. Findings The definition of context presented here develops a mathematical framework for working with context. Also, the modeling approach of distributed computing enables us to build robust, scalable and detailed models for systems and application with context-aware capabilities. Also, it enables us to map the procedures that support context-aware operations providing detailed descriptions about the interactions of applications with their context and other external sources. Practical implications A case study of a cloud-based context-aware application is examined using the modeling methodology described in the paper so as to demonstrate the practical usage of the theoretical framework that is presented. Originality/value The originality on the framework presented here relies on the connection of context-awareness with the theory of computation and distributed computing.
Styles APA, Harvard, Vancouver, ISO, etc.
14

Sburlan, Cristina, et Dragoş-Florin Sburlan. « Parallel Multiset Rewriting Systems with Distorted Rules ». Processes 9, no 2 (14 février 2021) : 347. http://dx.doi.org/10.3390/pr9020347.

Texte intégral
Résumé :
Most of the parallel rewriting systems which model (or which are inspired by) natural/artificial phenomena consider fixed, a priori defined sets of string/multiset rewriting rules whose definitions do not change during the computation. Here we modify this paradigm by defining level-t distorted rules—rules for which during their applications one does not know the exact multiplicities of at most t∈N species of objects in their output (although one knows that such objects will appear at least once in the output upon the execution of this type of rules). Subsequently, we define parallel multiset rewriting systems with t-distorted computations and we study their computational capabilities when level-1 distorted catalytic promoted rules are used. We construct robust systems able to cope with the level-1 distortions and prove the computational universality of the model.
Styles APA, Harvard, Vancouver, ISO, etc.
15

Bhattacharjee, Amitava. « Workshop To Be Held on Computational Capabilities for Heliophysical Science ». Space Weather 8, no 7 (juillet 2010) : n/a. http://dx.doi.org/10.1029/2010sw000608.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Attallah, Nour A., Jeffery S. Horsburgh, Arle S. Beckwith et Robb J. Tracy. « Residential Water Meters as Edge Computing Nodes : Disaggregating End Uses and Creating Actionable Information at the Edge ». Sensors 21, no 16 (6 août 2021) : 5310. http://dx.doi.org/10.3390/s21165310.

Texte intégral
Résumé :
We present a new, open source, computationally capable datalogger for collecting and analyzing high temporal resolution residential water use data. Using this device, execution of water end use disaggregation algorithms or other data analytics can be performed directly on existing, analog residential water meters without disrupting their operation, effectively transforming existing water meters into smart, edge computing devices. Computation of water use summaries and classified water end use events directly on the meter minimizes data transmission requirements, reduces requirements for centralized data storage and processing, and reduces latency between data collection and generation of decision-relevant information. The datalogger couples an Arduino microcontroller board for data acquisition with a Raspberry Pi computer that serves as a computational resource. The computational node was developed and calibrated at the Utah Water Research Laboratory (UWRL) and was deployed for testing on the water meter for a single-family residential home in Providence City, UT, USA. Results from field deployments are presented to demonstrate the data collection accuracy, computational functionality, power requirements, communication capabilities, and applicability of the system. The computational node’s hardware design and software are open source, available for potential reuse, and can be adapted to specific research needs.
Styles APA, Harvard, Vancouver, ISO, etc.
17

Cabessa, Jérémie, et Hava T. Siegelmann. « The Computational Power of Interactive Recurrent Neural Networks ». Neural Computation 24, no 4 (avril 2012) : 996–1019. http://dx.doi.org/10.1162/neco_a_00263.

Texte intégral
Résumé :
In classical computation, rational- and real-weighted recurrent neural networks were shown to be respectively equivalent to and strictly more powerful than the standard Turing machine model. Here, we study the computational power of recurrent neural networks in a more biologically oriented computational framework, capturing the aspects of sequential interactivity and persistence of memory. In this context, we prove that so-called interactive rational- and real-weighted neural networks show the same computational powers as interactive Turing machines and interactive Turing machines with advice, respectively. A mathematical characterization of each of these computational powers is also provided. It follows from these results that interactive real-weighted neural networks can perform uncountably many more translations of information than interactive Turing machines, making them capable of super-Turing capabilities.
Styles APA, Harvard, Vancouver, ISO, etc.
18

Geder, Jason D., Ravi Ramamurti, Dan Edwards, Trent Young et Marius Pruessner. « Development of an Unmanned Hybrid Vehicle Using Artificial Pectoral Fins ». Marine Technology Society Journal 51, no 5 (1 septembre 2017) : 56–70. http://dx.doi.org/10.4031/mtsj.51.5.4.

Texte intégral
Résumé :
AbstractAn unmanned vehicle has been developed for dual use as both an aircraft and a submersible. To achieve long-range emplacement of a highly maneuverable underwater asset to a target environment, the Flimmer (Flying-Swimmer) vehicle is designed for both high-speed flight and low-speed swimming. Building on previous research in bioinspired propulsion and control systems, the vehicle employs a unique set of artificial flapping fins for underwater maneuvering, which must be considered when evaluating the flight and water landing capabilities. This paper describes the computational analysis and experimental results for all three phases of vehicle operation—flight, landing, and swimming. Computational fluid dynamics simulation results predict aero- and hydrodynamic characteristics and demonstrate landing loads on and trajectory of the vehicle. Experimental data demonstrate flight and swimming performance and validate the computational results, and experimental testing of water landing provides a comparison with computations. Results and analyses of the Flimmer vehicle performance demonstrate the operational capabilities of an unmanned hybrid vehicle for long-range flight and low-speed swimming.
Styles APA, Harvard, Vancouver, ISO, etc.
19

Khan, Muhammad Asghar, Sajjad Ur Rehman, M. Irfan Uddin, Shibli Nisar, Fazal Noor, Ali Alzahrani et Insaf Ullah. « An Online-Offline Certificateless Signature Scheme for Internet of Health Things ». Journal of Healthcare Engineering 2020 (31 décembre 2020) : 1–10. http://dx.doi.org/10.1155/2020/6654063.

Texte intégral
Résumé :
The Internet of Health Things (IoHT) is an extended breed of the Internet of Things (IoT), which plays an important role in the remote sharing of data from various physical processes such as patient monitoring, treatment progress, observation, and consultation. The key benefit of the IoHT platform is the ease of time-independent interaction from geographically distant locations by offering preventive or proactive healthcare services at a lower cost. The communication, integration, computation, and interoperability in IoHT are provided by various low-power biomedical sensors equipped with limited computational capabilities. Therefore, conventional cryptographic solutions are not feasible for the majority of IoHT applications. In addition, executing computing-intensive tasks will lead to a slow response time that can deteriorate the performance of IoHT. We strive to resolve such a deficiency, and thus a new scheme has been proposed in this article, called an online-offline signature scheme in certificateless settings. The scheme divides the signing part into two phases, i.e., online and offline. In the absence of a message, the offline phase performs computationally intensive tasks, while lighter computations are executed in the online phase when there is a message. Security analyses and comparisons with the respective existing schemes are carried out to show the feasibility of the proposed scheme. The results obtained authenticate that the proposed scheme offers enhanced security with lower computational and communication costs.
Styles APA, Harvard, Vancouver, ISO, etc.
20

Annamalai, Chinnaraji. « Computation and Calculus for Combinatorial Geometric Series and Binomial Identities and Expansions ». Journal of Engineering and Exact Sciences 8, no 7 (22 septembre 2022) : 14648–01. http://dx.doi.org/10.18540/jcecvl8iss7pp14648-01i.

Texte intégral
Résumé :
Nowadays, the growing complexity of mathematical and computational modelling demands the simplicity of mathematical and computational equations for solving today’s scientific problems and challenges. This paper presents combinatorial geometric series, innovative binomial coefficients, combinatorial equations, binomial expansions, calculus with combinatorial geometric series, and innovative binomial theorems. Combinatorics involves integers, factorials, binomial coefficients, discrete mathematics, and theoretical computer science for finding solutions to the problems in computing and engineering science. The combinatorial geometric series with binomial expansions and its theorems refer to the methodological advances which are useful for researchers who are working in computational science. Computational science is a rapidly growing multi-and inter-disciplinary area where science, engineering, computation, mathematics, and collaboration use advance computing capabilities to understand and solve the most complex real-life problems.
Styles APA, Harvard, Vancouver, ISO, etc.
21

Rautenbach, Christo, Julia C. Mullarney et Karin R. Bryan. « Parallel computing efficiency of SWAN 40.91 ». Geoscientific Model Development 14, no 7 (6 juillet 2021) : 4241–47. http://dx.doi.org/10.5194/gmd-14-4241-2021.

Texte intégral
Résumé :
Abstract. Effective and accurate ocean and coastal wave predictions are necessary for engineering, safety and recreational purposes. Refining predictive capabilities is increasingly critical to reduce the uncertainties faced with a changing global wave climatology. Simulating WAves in the Nearshore (SWAN) is a widely used spectral wave modelling tool employed by coastal engineers and scientists, including for operational wave forecasting purposes. Fore- and hindcasts can span hours to decades, and a detailed understanding of the computational efficiencies is required to design optimized operational protocols and hindcast scenarios. To date, there exists limited knowledge on the relationship between the size of a SWAN computational domain and the optimal amount of parallel computational threads/cores required to execute a simulation effectively. To test the scalability, a hindcast cluster of 28 computational threads/cores (1 node) was used to determine the computation efficiencies of a SWAN model configuration for southern Africa. The model extent and resolution emulate the current operational wave forecasting configuration developed by the South African Weather Service (SAWS). We implemented and compared both OpenMP and the Message Passing Interface (MPI) distributing memory architectures. Three sequential simulations (corresponding to typical grid cell numbers) were compared to various permutations of parallel computations using the speed-up ratio, time-saving ratio and efficiency tests. Generally, a computational node configuration of six threads/cores produced the most effective computational set-up based on wave hindcasts of 1-week duration. The use of more than 20 threads/cores resulted in a decrease in speed-up ratio for the smallest computation domain, owing to the increased sub-domain communication times for limited domain sizes.
Styles APA, Harvard, Vancouver, ISO, etc.
22

Kumar, Vijay. « Computational materials science : The emergence of predictive capabilities of material behaviour ». Sadhana 28, no 3-4 (juin 2003) : 815–31. http://dx.doi.org/10.1007/bf02706461.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Kirchner, Jan H., et Julijana Gjorgjieva. « Emergence of synaptic organization and computation in dendrites ». Neuroforum 28, no 1 (31 décembre 2021) : 21–30. http://dx.doi.org/10.1515/nf-2021-0031.

Texte intégral
Résumé :
Abstract Single neurons in the brain exhibit astounding computational capabilities, which gradually emerge throughout development and enable them to become integrated into complex neural circuits. These capabilities derive in part from the precise arrangement of synaptic inputs on the neurons’ dendrites. While the full computational benefits of this arrangement are still unknown, a picture emerges in which synapses organize according to their functional properties across multiple spatial scales. In particular, on the local scale (tens of microns), excitatory synaptic inputs tend to form clusters according to their functional similarity, whereas on the scale of individual dendrites or the entire tree, synaptic inputs exhibit dendritic maps where excitatory synapse function varies smoothly with location on the tree. The development of this organization is supported by inhibitory synapses, which are carefully interleaved with excitatory synapses and can flexibly modulate activity and plasticity of excitatory synapses. Here, we summarize recent experimental and theoretical research on the developmental emergence of this synaptic organization and its impact on neural computations.
Styles APA, Harvard, Vancouver, ISO, etc.
24

Rynkovskaya, Marina I., Timur Elberdov, Enes Sert et Andreas Öchsner. « Study of modern software capabilities for complex shell analysis ». Structural Mechanics of Engineering Constructions and Buildings 16, no 1 (15 décembre 2020) : 45–53. http://dx.doi.org/10.22363/1815-5235-2020-16-1-45-53.

Texte intégral
Résumé :
Relevance. In design and calculation of civil engineering structures, several standard commercial software packages, which are successfully applied to solve everyday engineering problems, are traditionally used. However, when it is necessary to design the models of complex shape shell structures with defining surfaces based on parametric equations, such programs often have certain drawbacks. The aim of the work - analysis of existing types of commercial computational software packages in order to check which allow to design finite element models for shell structures with median surfaces of complex geometry given by parametric equations. Methods. The analysis of commercial computational software packages is carried out by studying the software manuals, and by building and calculating a model in the shape of a right helicoid as a test example. To evaluate the results of the stress-strain state of a shell with a middle surface in the form of a right helicoid, an analytical calculation method based on the Reissner’s equations and Fourier series expansion is used. Results. A review of modern commercial computational software packages as applied to models defined by parametric equations is carried out. A model for a shell structure with a median surface in the form of right helicoid is built. The numerical results of stress-strain behavior of the right helicoid are obtained and analyzed in comparison with the analytical solutions obtained using the Reissner’s equations with Fourier series expansion. The pros and cons of several popular means of software are presented.
Styles APA, Harvard, Vancouver, ISO, etc.
25

Tanaka, Kazuo. « Advanced Computational Intelligence in Control Theory and Applications ». Journal of Advanced Computational Intelligence and Intelligent Informatics 3, no 2 (20 avril 1999) : 67. http://dx.doi.org/10.20965/jaciii.1999.p0067.

Texte intégral
Résumé :
We are witnessing a rapidly growing interest in the field of advanced computational intelligence, a "soft computing" technique. As Prof. Zadeh has stated, soft computing integrates fuzzy logic, neural networks, evolutionary computation, and chaos. Soft computing is the most important technology available for designing intelligent systems and control. The difficulties of fuzzy logic involve acquiring knowledge from experts and finding knowledge for unknown tasks. This is related to design problems in constructing fuzzy rules. Neural networks and genetic algorithms are attracting attention for their potential in raising the efficiency of knowledge finding and acquisition. Combining the technologies of fuzzy logic and neural networks and genetic algorithms, i.e., soft computing techniques will have a tremendous impact on the fields of intelligent systems and control design. To explain the apparent success of soft computing, we must determine the basic capabilities of different soft computing frameworks. Give the great amount of research being done in these fields, this issue addresses fundamental capabilities. This special issue is devoted to advancing computational intelligence in control theory and applications. It contains nine excellent papers dealing with advanced computational intelligence in control theory and applications such as fuzzy control and stability, mobile robot control, neural networks, gymnastic bar action, petroleum plant control, genetic programming, Petri net, and modeling and prediction of complex systems. As editor of this special issue, I believe that the excellent research results it contains provide the basis for leadership in coming research on advanced computational intelligence in control theory and applications.
Styles APA, Harvard, Vancouver, ISO, etc.
26

Drikakis, Dimitris, Dochan Kwak et Cetin C. Kiris. « Computational aerodynamics : Advances and challenges ». Aeronautical Journal 120, no 1223 (janvier 2016) : 13–36. http://dx.doi.org/10.1017/aer.2015.2.

Texte intégral
Résumé :
ABSTRACTComputational aerodynamics, which complement more expensive empirical approaches, are critical for developing aerospace vehicles. During the past three decades, computational aerodynamics capability has improved remarkably, following advances in computer hardware and algorithm development. However, most of the fundamental computational capability realised in recent applications is derived from earlier advances, where specific gaps in solution procedures have been addressed only incrementally. The present article presents our view of the state of the art in computational aerodynamics and assessment of the issues that drive future aerodynamics and aerospace vehicle development. Requisite capabilities for perceived future needs are discussed, and associated grand challenge problems are presented.
Styles APA, Harvard, Vancouver, ISO, etc.
27

Addobea, Abigail Akosua, Jun Hou et Qianmu Li. « MHCOOS : An Offline-Online Certificateless Signature Scheme for M-Health Devices ». Security and Communication Networks 2020 (28 janvier 2020) : 1–12. http://dx.doi.org/10.1155/2020/7085623.

Texte intégral
Résumé :
Current trends of mobile technology have seen a tremendous growth in its application in smart healthcare. This has resulted in the adoption and implementation of mobile health (m-health) systems by providing health assistance to the aging population. Despite its advantageous benefits, its computational complexities cannot be overlooked. M-health devices are portable processing tiny equipment with limited computational capabilities thereby making them complex for the implementation of public key cryptosystems. In spite of this, an Offline-Online signature scheme called the MHCOOS has been proposed to solve the difficulties in the computational ability. The scheme enjoys the following benefits by splitting the signing part into both offline and online phases. The offline phase performs heavy computations when a message is absent, whereas lighter computations are performed at the online stage when a message is present. Secondly, the online computations are extremely fast due to the already computed offline signature value and lighter pairings involved. Our performance analysis demonstrates how the proposed scheme outperforms other schemes. Finally, the hardness of the scheme is proven under the Bilinear Diffie–Hellman (BDH) and Computational Diffie–Hellman (CDH) problem in the random oracle model.
Styles APA, Harvard, Vancouver, ISO, etc.
28

Gharachamani Asl, Yashar, Mohammad Baharvand et Sahar Toofan. « Recognition of how to Computational Simulate the Formation Processes of Biological Phenomena in Algorithmic Architecture ». European Journal of Sustainable Development 8, no 2 (1 juin 2019) : 404. http://dx.doi.org/10.14207/ejsd.2019.v8n2p404.

Texte intégral
Résumé :
There is a long history behind the idea of contemplating the natural world and paying attention to the ways biological phenomena develop and grow rather than trying to merely imitate them in a superficial manner. However, until recently the scientific and technological capabilities had not advanced enough to implement this concept. This was perhaps the result of a superficial selection of complex and ungraspable subjects that could not be implemented due to a lack of scientific knowledge and technical capabilities. However, nowadays it is possible to have a deeper understanding of the principles of form creation thanks to the technical and scientific developments in the past few decades. The patterning and imitation processes go beyond the formal scope to encompass the entire knowledge of how biological components are formed, providing valuable area for pattern generation. Such a new method of imitating nature can be found in algorithmic design, which is to make use of computation as the main part of computer activities through algorithms and codes and programs, like a genome in nature. The main goal of this research is to provide a clear framework and a systematic approach to the role of computational generative systems in the form generation process. For this purpose, the present study uses a descriptive-analytical method based on library research, to study and categorize and describe characteristics, mechanism of the computational systems used in form creation and Compare them. It concludes that computational systems inspired by biological principles can play an important role in the process of computational form generation in architecture. Keywords: Algorithmic Architecture, generative systems, biological systems, growth pattern, computation.
Styles APA, Harvard, Vancouver, ISO, etc.
29

Attene, Marco, Franca Giannini, Marios Pitikakis et Michela Spagnuolo. « The VISIONAIR Infrastructure Capabilities to Support Research ». Computer-Aided Design and Applications 10, no 5 (janvier 2013) : 851–62. http://dx.doi.org/10.3722/cadaps.2013.851-862.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
30

KOUMOUTSAKOS, PETROS, BASIL BAYATI, FLORIAN MILDE et GERARDO TAURIELLO. « PARTICLE SIMULATIONS OF MORPHOGENESIS ». Mathematical Models and Methods in Applied Sciences 21, supp01 (avril 2011) : 955–1006. http://dx.doi.org/10.1142/s021820251100543x.

Texte intégral
Résumé :
The simulation of the creation and evolution of biological forms requires the development of computational methods that are capable of resolving their hierarchical, spatial and temporal complexity. Computations based on interacting particles, provide a unique computational tool for discrete and continuous descriptions of morphogenesis of systems ranging from the molecular to the organismal level. The capabilities of particle methods hinge on the simplicity of their formulation which enables the formulation of a unifying computational framework encompassing deterministic and stochastic models. In this paper, we discuss recent advances in particle methods for the simulation of biological systems at the mesoscopic and the macroscale level. We present results from applications of particle methods including reaction–diffusion on deforming surfaces, deterministic and stochastic descriptions of tumor growth and angiogenesis and discuss successes and challenges of this approach.
Styles APA, Harvard, Vancouver, ISO, etc.
31

Gladkikh, A. A., et G. G. Malinetskii. « Study of dynamical systems from the viewpoint of complexity and computational capabilities ». Differential Equations 52, no 7 (juillet 2016) : 897–905. http://dx.doi.org/10.1134/s0012266116070090.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
32

Dhar, Joydip, et Ashok Ranganathan. « Machine learning capabilities in medical diagnosis applications : computational results for hepatitis disease ». International Journal of Biomedical Engineering and Technology 17, no 4 (2015) : 330. http://dx.doi.org/10.1504/ijbet.2015.069398.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
33

Frasconi, P., et M. Gori. « Computational capabilities of local-feedback recurrent networks acting as finite-state machines ». IEEE Transactions on Neural Networks 7, no 6 (novembre 1996) : 1521–25. http://dx.doi.org/10.1109/72.548181.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
34

Rafique, M. Mustafa, Ali R. Butt et Dimitrios S. Nikolopoulos. « A capabilities-aware framework for using computational accelerators in data-intensive computing ». Journal of Parallel and Distributed Computing 71, no 2 (février 2011) : 185–97. http://dx.doi.org/10.1016/j.jpdc.2010.09.004.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
35

Brehm, C., M. F. Barad et C. C. Kiris. « Development of immersed boundary computational aeroacoustic prediction capabilities for open-rotor noise ». Journal of Computational Physics 388 (juillet 2019) : 690–716. http://dx.doi.org/10.1016/j.jcp.2019.02.011.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
36

Vielma, Juan Pablo, Alan T. Murray, David M. Ryan et Andres Weintraub. « Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems ». European Journal of Operational Research 176, no 2 (janvier 2007) : 1246–64. http://dx.doi.org/10.1016/j.ejor.2005.09.016.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
37

Jones, P. J., et G. E. Whittle. « Computational fluid dynamics for building air flow prediction—current status and capabilities ». Building and Environment 27, no 3 (juillet 1992) : 321–38. http://dx.doi.org/10.1016/0360-1323(92)90033-l.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
38

Cabessa, Jérémie, et Olivier Finkel. « Computational capabilities of analog and evolving neural networks over infinite input streams ». Journal of Computer and System Sciences 101 (mai 2019) : 86–99. http://dx.doi.org/10.1016/j.jcss.2018.11.003.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
39

Saa, Pedro A., María P. Cortés, Javiera López, Diego Bustos, Alejandro Maass et Eduardo Agosin. « Expanding Metabolic Capabilities Using Novel Pathway Designs : Computational Tools and Case Studies ». Biotechnology Journal 14, no 9 (juillet 2019) : 1800734. http://dx.doi.org/10.1002/biot.201800734.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
40

Madej, Jerzy, et Mateusz Śliwka. « Modern capabilities of research and simulation strength of metal structures ». Mechanik 90, no 1 (9 janvier 2017) : 84–86. http://dx.doi.org/10.17814/mechanik.2017.1.24.

Texte intégral
Résumé :
The use of modern measurement techniques and computing methods opens up new possibilities for the calculation and testing of metal structures. This article presents research conducted using measuring set MTS to verify the computational model of the structure of the roof protection on industrial buildings.
Styles APA, Harvard, Vancouver, ISO, etc.
41

Napassorn Kerdpitak, Chayanan Kerdpitak,. « Marketing Capabilities Model for Pharmaceutical Business in Thailand ». Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no 6 (5 avril 2021) : 1421–30. http://dx.doi.org/10.17762/turcomat.v12i6.2681.

Texte intégral
Résumé :
There are few studies in the past which have worked on evaluating the capability of the marketing teams as the means of generating an effective strategy in terms of competiveness in the market and creation of advantage that is held by a firm in the market. However, the aim behind conducting this research is to find an effective mechanism or formula to have better performance in the export field, internationalization success, and marketing communication mainly by analyzing the role that is played by the marketing capabilities. Moreover, the researcher has mapped the relationship which exists between the capabilities and communication with the mediating impact of competitive strategy has also been evaluated in this research paper. The population of this study was the employees of different pharmaceutical firms of Thailand, and the sample was 300 entrepreneur of pharmaceutical business. The results and findings show that the impact of marketing capabilities has been favorable to enhance the export performance of the sector. Furthermore, the findings also indicate that the mediating variable of competitive strategy also positively mediates the relationship that exists between the variables of marketing capabilities and marketing communication. This study has significant implications on MC and export performance.
Styles APA, Harvard, Vancouver, ISO, etc.
42

Seisa, Achilleas Santi, Sumeet Gajanan Satpute, Björn Lindqvist et George Nikolakopoulos. « An Edge-Based Architecture for Offloading Model Predictive Control for UAVs ». Robotics 11, no 4 (6 août 2022) : 80. http://dx.doi.org/10.3390/robotics11040080.

Texte intégral
Résumé :
Thanks to the development of 5G networks, edge computing has gained popularity in several areas of technology in which the needs for high computational power and low time delays are essential. These requirements are indispensable in the field of robotics, especially when we are thinking in terms of real-time autonomous missions in mobile robots. Edge computing will provide the necessary resources in terms of computation and storage, while 5G technologies will provide minimal latency. High computational capacity is crucial in autonomous missions, especially for cases in which we are using computationally demanding high-level algorithms. In the case of Unmanned Aerial Vehicles (UAVs), the onboard processors usually have limited computational capabilities; therefore, it is necessary to offload some of these tasks to the cloud or edge, depending on the time criticality of the application. Especially in the case of UAVs, the requirement to have large payloads to cover the computational needs conflicts with other payload requirements, reducing the overall flying time and hindering autonomous operations from a regulatory perspective. In this article, we propose an edge-based architecture for autonomous UAV missions in which we offload the high-level control task of the UAV’s trajectory to the edge in order to take advantage of the available resources and push the Model Predictive Controller (MPC) to its limits. Additionally, we use Kubernetes to orchestrate our application, which runs on the edge and presents multiple experimental results that prove the efficacy of the proposed novel scheme.
Styles APA, Harvard, Vancouver, ISO, etc.
43

Eger, Markus, Camille Barot et R. Young. « Merits of a Temporal Modal Logic for Narrative Discourse Generation ». Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 11, no 4 (24 juin 2021) : 23–29. http://dx.doi.org/10.1609/aiide.v11i4.12836.

Texte intégral
Résumé :
Just as there exists varied uses for computational models of narrative, there exists a wide variety of languages aimed at representing stories. A number of them have historic roots in automated generation, for which these languages have to be limited in order to make the generation process computationally feasible. Other are focused on story understanding, with close ties to natural language making many reasoning processes computationally intractable. In this paper, we discuss the trade-off between expressivity and computational complexity of the reasoning process and argue that Impulse, a temporal, modal logic provides more expressivity than languages historically associated with story generation, while still affording reasoning capabilities. We show that these properties enable certain aspects of narrative discourse generation by using two examples from different genres, and claim that this generalizes to a broader class of problems.
Styles APA, Harvard, Vancouver, ISO, etc.
44

Turchi, Marco, Tijl De Bie, Cyril Goutte et Nello Cristianini. « Learning to Translate : A Statistical and Computational Analysis ». Advances in Artificial Intelligence 2012 (22 avril 2012) : 1–15. http://dx.doi.org/10.1155/2012/484580.

Texte intégral
Résumé :
We present an extensive experimental study of Phrase-based Statistical Machine Translation, from the point of view of its learning capabilities. Very accurate Learning Curves are obtained, using high-performance computing, and extrapolations of the projected performance of the system under different conditions are provided. Our experiments confirm existing and mostly unpublished beliefs about the learning capabilities of statistical machine translation systems. We also provide insight into the way statistical machine translation learns from data, including the respective influence of translation and language models, the impact of phrase length on performance, and various unlearning and perturbation analyses. Our results support and illustrate the fact that performance improves by a constant amount for each doubling of the data, across different language pairs, and different systems. This fundamental limitation seems to be a direct consequence of Zipf law governing textual data. Although the rate of improvement may depend on both the data and the estimation method, it is unlikely that the general shape of the learning curve will change without major changes in the modeling and inference phases. Possible research directions that address this issue include the integration of linguistic rules or the development of active learning procedures.
Styles APA, Harvard, Vancouver, ISO, etc.
45

Qiu, Xueting, Venkata R. Duvvuri et Justin Bahl. « Computational Approaches and Challenges to Developing Universal Influenza Vaccines ». Vaccines 7, no 2 (28 mai 2019) : 45. http://dx.doi.org/10.3390/vaccines7020045.

Texte intégral
Résumé :
The traditional design of effective vaccines for rapidly-evolving pathogens, such as influenza A virus, has failed to provide broad spectrum and long-lasting protection. With low cost whole genome sequencing technology and powerful computing capabilities, novel computational approaches have demonstrated the potential to facilitate the design of a universal influenza vaccine. However, few studies have integrated computational optimization in the design and discovery of new vaccines. Understanding the potential of computational vaccine design is necessary before these approaches can be implemented on a broad scale. This review summarizes some promising computational approaches under current development, including computationally optimized broadly reactive antigens with consensus sequences, phylogenetic model-based ancestral sequence reconstruction, and immunomics to compute conserved cross-reactive T-cell epitopes. Interactions between virus-host-environment determine the evolvability of the influenza population. We propose that with the development of novel technologies that allow the integration of data sources such as protein structural modeling, host antibody repertoire analysis and advanced phylodynamic modeling, computational approaches will be crucial for the development of a long-lasting universal influenza vaccine. Taken together, computational approaches are powerful and promising tools for the development of a universal influenza vaccine with durable and broad protection.
Styles APA, Harvard, Vancouver, ISO, etc.
46

M. LONGA, VíCTOR. « Making Prehistoric Lines Speak : Inferring Language and Mental Computations from ‘Natural’ Lines of Parietal Art1 ». Philology 4, no 2018 (1 janvier 2019) : 243–78. http://dx.doi.org/10.3726/phil042019.7.

Texte intégral
Résumé :
Abstract According to many archaeologists and paleoanthropologists, the presence of symbolism in the prehistoric archaeological record indicates complex language. Therefore, archaeological remains have usually been analyzed from the perspective of the behavior (in this case, symbolic) they could be associated with. This paper proposes a very different approach, arising from formal linguistics and mathematical theory of computation: to analyze archaeological remains from the perspective of the computational processes and capabilities required for their production. This approach is not concerned with the ‘semantics’ of the pieces (symbolism, etc.), but with the analysis of purely formal features revealing a language-like computational complexity. I will exemplify this approach through the computational analysis of representations of Upper Palaeolithic parietal art, concentrating on the use of ‘natural’ lines, i.e. lines preexisting in the rocks (cracks, fissures, etc.), which were used as anchorage points for many representations. This use of natural lines will be shown to reveal a high computational complexity.
Styles APA, Harvard, Vancouver, ISO, etc.
47

Kotukh, E. V., O. V. Severinov, A. V. Vlasov, L. S. Kozina, A. O. Tenytska et E. O. Zarudna. « Methods of construction and properties of logariphmic signatures ». Radiotekhnika, no 205 (2 juillet 2021) : 94–99. http://dx.doi.org/10.30837/rt.2021.2.205.09.

Texte intégral
Résumé :
Development and promising areas of research in the construction of practical models of quantum computers contributes to the search and development of effective cryptographic primitives. Along with the growth of the practical possibilities of using quantum computing, the threat to classical encryption and electronic signature schemes using classical mathematical problems as a basis, being overcome by the computational capabilities of quantum computers. This fact motivates the study of fundamental theorems concerning the mathematical and computational aspects of candidate post-quantum cryptosystems. Development of a new quantum-resistant asymmetric cryptosystem is one of the urgent problems. The use of logarithmic signatures and coverings of finite groups a promising direction in the development of asymmetric cryptosystems. The current state of this area and the work of recent years suggest that the problem of factorizing an element of a finite group in the theory of constructing cryptosystems based on non-Abelian groups using logarithmic signatures is computationally complex; it potentially provides the necessary level of cryptographic protection against attacks using the capabilities of quantum calculations. The paper presents logarithmic signatures as a special type of factorization in finite groups; it also considers their properties and construction methods.
Styles APA, Harvard, Vancouver, ISO, etc.
48

Rodríguez-Pascual, Manuel, Christos Kanellopoulos, Antonio Juan Rubio-Montero, Diego Darriba, Ognjen Prnjat, David Posada et Rafael Mayo-García. « Adapting Reproducible Research Capabilities to Resilient Distributed Calculations ». International Journal of Grid and High Performance Computing 8, no 1 (janvier 2016) : 58–69. http://dx.doi.org/10.4018/ijghpc.2016010105.

Texte intégral
Résumé :
Nowadays, computing calculations are becoming more and more demanding due to the huge pool of resources available. This demand must be satisfied in terms of computational efficiency and resilience, which is compromised in distributed and heterogeneous platforms. Not only this, data obtained are often either reused by other researchers or recalculated. In this work, a set of tools to overcome the problem of creating and executing fault tolerant distributed applications on dynamic environments is presented. Such a set also ensures the reproducibility of the performed experiments providing a portable, unattended and resilient framework that encapsulates the infrastructure-dependent operations away from the application developers and users, allowing performing experiments based on Open Access data repositories. In this way, users can seamlessly search and lately access datasets that can be automatically retrieved as input data into a code already integrated in the proposed workflow. Such a search is based on metadata standards and relies on Persistent Identifiers (PID) to assign specific repositories. The applications profit from Distributed Toolbox, a framework devoted to the creation and execution of distributed applications and includes tools for unattended cluster and grid execution, where a total fault tolerance is provided. By decoupling the definition of the remote tasks from its execution and control, the development, execution and maintenance of distributed applications is significantly simplified with respect to previous solutions, increasing their robustness and allowing running them on different computational platforms with little effort. The integration with Open Access databases and employment of PIDs for long-lasting references ensures that the data related to the experiments will persist, closing a complete research circle of data access/processing/storage/dissemination of results.
Styles APA, Harvard, Vancouver, ISO, etc.
49

Vuong, Quan-Hoang. « Computational entrepreneurship : from economic complexities to interdisciplinary research ». Problems and Perspectives in Management 17, no 1 (27 février 2019) : 117–29. http://dx.doi.org/10.21511/ppm.17(1).2019.11.

Texte intégral
Résumé :
The development of technology is unbelievably rapid. From limited local networks to high speed Internet, from crude computing machines to powerful semi-conductors, the world had changed drastically compared to just a few decades ago. In the constantly renewing process of adapting to such an unnaturally high-entropy setting, innovations as well as entirely new concepts, were often born. In the business world, one such phenomenon was the creation of a new type of entrepreneurship. This paper proposes a new academic discipline of computational entrepreneurship, which centers on: (i) an exponentially growing (and less expensive) computing power, to the extent that almost everybody in a modern society can own and use that; (ii) omnipresent high-speed Internet connectivity, wired or wireless, representing our modern day’s economic connectomics; (iii) growing concern of exploiting “serendipity” for a strategic commercial advantage; and (iv) growing capabilities of lay people in performing calculations for their informed decisions in taking fast-moving entrepreneurial opportunities. Computational entrepreneurship has slowly become a new mode of operation for business ventures and will likely bring the academic discipline of entrepreneurship back to mainstream economics.
Styles APA, Harvard, Vancouver, ISO, etc.
50

García, Enol, José R. Villar, Qing Tan, Javier Sedano et Camelia Chira. « An efficient multi-robot path planning solution using A* and coevolutionary algorithms ». Integrated Computer-Aided Engineering 30, no 1 (24 novembre 2022) : 41–52. http://dx.doi.org/10.3233/ica-220695.

Texte intégral
Résumé :
Multi-robot path planning has evolved from research to real applications in warehouses and other domains; the knowledge on this topic is reflected in the large amount of related research published in recent years on international journals. The main focus of existing research relates to the generation of efficient routes, relying the collision detection to the local sensory system and creating a solution based on local search methods. This approach implies the robots having a good sensory system and also the computation capabilities to take decisions on the fly. In some controlled environments, such as virtual labs or industrial plants, these restrictions overtake the actual needs as simpler robots are sufficient. Therefore, the multi-robot path planning must solve the collisions beforehand. This study focuses on the generation of efficient collision-free multi-robot path planning solutions for such controlled environments, extending our previous research. The proposal combines the optimization capabilities of the A* algorithm with the search capabilities of co-evolutionary algorithms. The outcome is a set of routes, either from A* or from the co-evolutionary process, that are collision-free; this set is generated in real-time and makes its implementation on edge-computing devices feasible. Although further research is needed to reduce the computational time, the computational experiments performed in this study confirm a good performance of the proposed approach in solving complex cases where well-known alternatives, such as M* or WHCA, fail in finding suitable solutions.
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie