Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Sensor network optimization of gearbox based on dependence matrix and improved discrete shuffled frog leaping algorithm
Springer Science and Business Media LLC - Tập 15 - Trang 653-664 - 2015
Zhuanzhe Zhao, Qingsong Xu, Minping Jia
This paper reports a new improved discrete shuffled frog leaping algorithm (ID-SFLA) and its application in multi-type sensor network optimization for the condition monitoring of a gearbox. A mathematical model is established to illustrate the sensor network optimization based on fault-sensor dependence matrix. The crossover and mutation operators of genetic algorithm (GA) are introduced into the ...... hiện toàn bộ
On string languages generated by spiking neural P systems with exhaustive use of rules
Springer Science and Business Media LLC - Tập 7 - Trang 535-549 - 2008
Xingyi Zhang, Xiangxiang Zeng, Linqiang Pan
We continue the study of (extended) spiking neural P systems with exhaustive use of rules by considering these computing devices as language generators. Specifically, a step is associated with a symbol according to the number of spikes emitted by the output neuron and the sequence of these symbols associated with a halting computation constitutes a string. Two cases are considered: one of them int...... hiện toàn bộ
Oblivious transfer and quantum channels as communication resources
Springer Science and Business Media LLC - Tập 12 - Trang 13-17 - 2012
Nicolas Gisin, Sandu Popescu, Valerio Scarani, Stefan Wolf, Jürg Wullschleger
We show that from a communication-complexity perspective, the primitive called oblivious transfer—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one q...... hiện toàn bộ
A parallel data-structure for modular programming of triangulated computing media.
Springer Science and Business Media LLC - Tập 22 - Trang 753-766 - 2022
Frédéric Gruau
Our long-term project involves performing general-purpose computation on 2D amorphous computing media, which consist of arbitrary many, small, identical processing elements that are homogeneously spread in 2D Euclidian space, and that communicate locally in space. While the minimal assumptions on hardware provide the fascinating perspective of arbitrary large computing power, they also make progra...... hiện toàn bộ
Computation with multiple CTCs of fixed length and width
Springer Science and Business Media LLC - Tập 11 - Trang 579-594 - 2012
A. C. Cem Say, Abuzer Yakaryılmaz
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of the classes of languages decided by polynomial time probabilistic and quantum computers that can send a single classical bit to their own past. We show that, gi...... hiện toàn bộ
Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation
Springer Science and Business Media LLC - Tập 6 - Trang 151-168 - 2006
Annalisa Marzuoli, Mario Rasetti
In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli and Rasetti, 2002, 2005a) relies on the (re)coupling theory of SU(2) angular momenta and can be viewed as a generalization to arbitrary values of the spin variables of the usual quantum-circuit model based on ‘qubits’ and Boolean gates. ...... hiện toàn bộ
A universal Brownian cellular automaton with 3 states and 2 rules
Springer Science and Business Media LLC - Tập 17 - Trang 499-509 - 2017
Teijiro Isokawa, Ferdinand Peper, Koji Ono, Nobuyuki Matsui
This paper presents a 3-state asynchronous cellular automaton (CA) that requires merely two transition rules to achieve computational universality. This universality is achieved by implementing Priese’s delay-insensitive circuit elements, called the E-element and the K-element, on the cell space of a so-called Brownian CA, which is an asynchronous CA containing local configurations that conduct a ...... hiện toàn bộ
On the solution of trivalent decision problems by quantum state identification
Springer Science and Business Media LLC - Tập 8 - Trang 539-546 - 2009
Karl Svozil, Josef Tkadlec
The trivalent functions of a trit can be grouped into equipartitions of three elements. We discuss the separation of the corresponding functional classes by quantum state identifications.
Hairpin-based state machine and conformational addressing: Design and experiment
Springer Science and Business Media LLC - Tập 4 - Trang 103-126 - 2005
Atsushi Kameda, Masahito Yamamoto, Hiroki Uejima, Masami Hagiya, Kensaku Sakamoto, Azuma Ohuchi
In this paper, we propose a new architecture for a multi-state DNA machine whose conformation of repeated hairpin structures changes sequentially in response to input oligomers. As an application of the machine, we also propose molecular memory in which the machine is used as a memory unit. Addressing in the memory is realized through state transitions of the machine. We then describe a method for...... hiện toàn bộ
On balance and dynamism in procedural content generation with self-adaptive evolutionary algorithms
Springer Science and Business Media LLC - Tập 13 - Trang 157-168 - 2014
Raúl Lara-Cabrera, Carlos Cotta, Antonio J. Fernández-Leiva
We consider search-based procedural content generation in the context of Planet Wars, an RTS game. The objective of this work is to generate maps for the aforementioned game, that result in an interesting game-play. In order to characterize interestingness we focus on the properties of balance and dynamism. The former captures the fact that no player is overwhelmed by the opponent during the game,...... hiện toàn bộ
Tổng số: 735   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10