synchronizing
Martin H. Weik · 2000
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Synchronizing”
Martin H. Weik · 2000
Cited by 0
Cerar, Matej · Repository of the University of Ljubljana (University of Ljubljana) · 2025
V magistrskem delu predstavimo usklajajoče avtomate in z njimi povezano Černyjevo domnevo. K temu problemu pristopamo s prevodom iz teorije avtomatov v teorijo permutacijskih grup, ki nam omogoča umestitev usklajajočih grup v hierhijo drugih permutacijskih grup. Osrednja tema naloge je uporaba teorije upodobitev za analizo posebnega primera Černyjeve domneve z grupno-teoretičnega vidika. Glavni izrek določi zgornjo mejo za dolžino poenostavitvene besede v usklajajočem monoidu, ki vsebuje permutacijsko grupo. Uporabnost tega izreka je nato prikazana z njegovo uporabo na več družinah grup, vključno s cikličnimi, diedrskimi, simetričnimi, afinimi in specialnimi linearnimi grupami.
Cited by 0Open access
Arthur T. Benjamin, Gary Chartrand, Ping Zhang · Princeton University Press eBooks · 2017
This chapter considers a new type of graph coloring known as edge coloring. It begins with a discussion of an idea by Scottish physicist Peter Guthrie Tait that led to edge coloring. Tait proved that the regions of every 3-regular bridgeless planar graph could be colored with four or fewer colors if and only if the edges of such a graph could be colored with three colors so that every two adjacent edges are colored differently. Tait thought that he had found a new way to solve the Four Color Problem. The chapter also examines the chromatic index of a graph, Vizing's Theorem, applications of edge colorings, and a class of numbers in graph theory called Ramsey numbers. Finally, it describes the Road Coloring Theorem which deals with traffic systems consisting only of one-way streets in which the same number of roads leave each location.
Cited by 0
SpringerReference · 2011
Cited by 0
SpringerReference · 2011
Cited by 0
Roop Kamal, Shivani Malhan · Advances in marketing, customer relationship management, and e-services book series · 2024
Neuromarketing seeks to utilize brain imaging to comprehend the neuronal connections and cognitive processes that play a role in customers' decision-making. This study aims to offer thorough examination of neuromarketing, including present utilization of neuroimaging physiological tools in the marketing mix. Additionally, it seeks to emphasize the neurological responses of consumer behavior that should be taken into account in the marketing mix. This study aims to examine the impact of recent neuromarketing techniques on marketing mix strategies. Managers can leverage these techniques to develop effective marketing strategies for specific target groups in various areas, including consumer buying behavior, pricing, advertising, the chapter explores potential use of neurological approaches in marketing management. The findings demonstrate the role of neuroscience in informing traditional marketing mix strategies and highlight the benefits of incorporating neuroscience in brand management.
Cited by 0
H. R. Swapna, Sanjeet Singh, Geetika Madaan et al. · IGI Global eBooks · 2025
Multi-brain computer interfacing (MBCI) revolutionizes human-computer interaction by enabling real-time collaboration and communication through the integration of neural signals from multiple brains. This emerging field leverages advancements in neurotechnology, signal processing, and artificial intelligence to decode and interpret neural activity, facilitating seamless interaction among individuals. MBCI holds promise across diverse applications, from enhancing collaborative decision-making in healthcare and education to enabling novel forms of communication and creativity in entertainment and arts. Key challenges include the integration and synchronization of neural signals, ensuring data privacy and ethical considerations, and optimizing the accuracy and reliability of neural decoding algorithms. As research progresses, MBCI's potential to transform human capabilities and foster new paradigms of collective intelligence underscores its importance as a frontier technology, paving the way for innovative solutions and societal advancements in the digital age.
Cited by 0
Dominique Perrin · 1993
Cited by 0
2005
Cited by 0
Nature Biotechnology · 2000
Cited by 0Open access
Nicolas Privault · Springer undergraduate mathematics series · 2024
Cited by 1
Adam Ivánek · Digital Repository (National Repository of Grey Literature) · 2013
In this thesis we study Trahtman's proof of Road coloring problem and related algorithm. For every strongly connected directed multigraph with outdegree d and period 1, there exists synchronizing coloring. Béal and Perrin prove that Trahtman's proof can be simply generalized for every period and k-synchronizing coloring. We show generalized proof too. Trahtman's proof is constructive and is based on finding coloring with nontrivial stable states. We prove if there is only one maximal tree in Pα then the coloring is with nontrivial stable states. Subgraph Pα contains all edges with same color. We show how to find such coloring. Then we describe algorithms for finding k-synchronizing coloring. First algorithm uses proposition from Trahtman's proof with time complexity O((n−k)dn2 ). Then we show Trahtman's reduction and Béal and Perrin's algorithm based on Trahtman's proof but time complexity is O((n − k)dn) where n is the number of vertices. 1
Cited by 0
Edmund W. Cheng, Samson Yuen · Cambridge University Press eBooks · 2025
Cited by 0
Pribavkina, E. V., Rodaro, E. · Electronic scientific archive of UrFU (Ural Federal University) · 2011
Cited by 0Open access
Elena V. Pribavkina, Emanuele Rodaro · Information and Computation · 2010
Cited by 16
M.D. Zoltowski, L D. W. Tufts, R. Kumaresan et al. · 2014
tion) was- 9 times larger than the average count for LMFE based upon the standard matrix inversion. This is a conservative estimate, as the computational load of LMFE is amenable to further improvement using inversion algo-rithms that exploit the centrosymmetric character [8] of the regularized modified covariance matrix. ’Ja
Cited by 0
M. Kiser, A. Zogg · 1989
Object oriented programming and parallel programming are two important and evolving areas in computer science. Much research has been carried out in each of the two programming disciplines, but little effort has been put on combining the two areas. The authors discuss a major problem of parallel programming: synchronization of concurrent processes using a shared object. Discussing the example of the bounded buffer, they demonstrate how to build a high structured shared object based on primitive constructs in an object oriented manner. They use the object oriented programming environment Smalltalk-80 which supports basic process management and synchronization tools (semaphores). The ideas presented were realized in a prototype of a distributed directory service according to the CCIT X.500 standard. >
Cited by 1
R. Kudłacik, Adam Roman, Hubert Wagner · Expert Systems with Applications · 2012
Cited by 26Open access
Pamela J. Hines · Science Signaling · 2013
In plants, day/night information is communicated from a nuclear-encoded circadian oscillator to the chloroplast.
Cited by 0
Robert M. G. Reinhart · Science · 2022
Personalized, noninvasive network-based neuromodulation aids impaired cognition.
Cited by 10Open access