Relevant bibliographies by topics / Eavesdropping on the graph state

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Eavesdropping on the graph state'

Author: Grafiati
Published: 6 September 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Eavesdropping on the graph state.'

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.

Journal articles on the topic "Eavesdropping on the graph state"

1

Stuart, Jeffrey L. "The eavesdropping number of a graph." Czechoslovak Mathematical Journal 59, no. 3 (September 2009): 623–36. http://dx.doi.org/10.1007/s10587-009-0056-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Serhiienko, S. P., V. G. Krizhanovski, D. V. Chernov, and L. V. Zagoruiko. "The use of non-steady state noise interferences to counteract passive eavesdropping devices." Radiotekhnika, no. 207 (December 24, 2021): 132–38. http://dx.doi.org/10.30837/rt.2021.4.207.14.

Full text
Abstract:
The use of noise interference has become a common practice for information security. Recently appeared publications showing a potential possibility to use the noise radio frequency interference for information skimming by passive radio eavesdropping device. In particular, the vulnerability of the premises protected from eavesdropping devices is increased, if the radio frequency noising is switched on when confidential negotiations are being conducted. The use of radio noise waves energy for eavesdropping makes such devices invisible to nonlinear locators for listening devices if they activated only by noise signals. The paper shows that the use of non-steady state noise allows counteracting the unauthorized pickup of information. The analysis of non-steady state radio frequency noise effectiveness was carried out using the correlation receiver model. The correlation receiver has the highest sensitivity, and it works more efficiently with noise-like signals. It is shown that for counteracting the information pickup, it is necessary to use a noise, amplitude modulated by a random signal, whose spectrum coincides with a spectrum of a potential informational signal. Imposition a more powerful modulation noise to a weak informational signal makes impossible the information transfer. It is shown on the example of changing the power of a monochromatic signal while “beetle” transmits using steady-state and non-steady state noises, that due to the signal energy parametric redistribution over the non-steady-state noise modulation spectrum, the power of monochromatic signal is reduced by more than 10 dB compared to the transmission of the same signal using a steady-state noise. It can be concluded that the use of non-steady state noise signals for radio frequency suppression makes impossible their use for passive eavesdropping devices operation.
APA, Harvard, Vancouver, ISO, and other styles
3

Naik, D. S., C. G. Peterson, A. G. White, A. J. Berglund, and P. G. Kwiat. "Entangled State Quantum Cryptography: Eavesdropping on the Ekert Protocol." Physical Review Letters 84, no. 20 (May 15, 2000): 4733–36. http://dx.doi.org/10.1103/physrevlett.84.4733.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

YI, XIAO-JIE, JIAN-MIN WANG, and GUO-QIANG HUANG. "SPLITTING QUANTUM INFORMATION WITH FIVE-ATOM ENTANGLED STATE IN CAVITY QED." International Journal of Quantum Information 08, no. 08 (December 2010): 1289–99. http://dx.doi.org/10.1142/s0219749911007071.

Full text
Abstract:
A realizable scheme is proposed for implementing quantum information splitting with five-atom entangled state in cavity QED, where we explicitly illustrate the procedure and analyze the security against the eavesdropping. The scheme does not involve Bell-state measurement and is insensitive to the cavity and the thermal field.
APA, Harvard, Vancouver, ISO, and other styles
5

WANG, JIAN, SHENG ZHANG, QUAN ZHANG, and CHAO-JING TANG. "SEMIQUANTUM SECRET SHARING USING TWO-PARTICLE ENTANGLED STATE." International Journal of Quantum Information 10, no. 05 (August 2012): 1250050. http://dx.doi.org/10.1142/s0219749912500505.

Full text
Abstract:
We present a semiquantum secret sharing protocol by using two-particle entangled states in which quantum Alice shares a secret key with two classical parties, Bob and Charlie. Classical Bob and Charlie are restricted to measuring, preparing a particle in the computational basis, or reflecting the particles. None of them can acquire the secret unless they collaborate. We also show the protocol is secure against eavesdropping.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu Jing-Feng, Tang Zhi-Lie, Liang Rui-Sheng, Li Ling-Yan, Wei Zheng-Jun, Chen Zhi-Xin, Liao Chang-Jun, and Liu Song-Hao. "Eavesdropping on practical QKD system based on six-state protocol." Acta Physica Sinica 54, no. 2 (2005): 517. http://dx.doi.org/10.7498/aps.54.517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cirac, J. I., and N. Gisin. "Coherent eavesdropping strategies for the four state quantum cryptography protocol." Physics Letters A 229, no. 1 (April 1997): 1–7. http://dx.doi.org/10.1016/s0375-9601(97)00176-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

CHEN, XIU-BO, TIAN-YIN WANG, JIAN-ZHONG DU, QIAO-YAN WEN, and FU-CHEN ZHU. "CONTROLLED QUANTUM SECURE DIRECT COMMUNICATION WITH QUANTUM ENCRYPTION." International Journal of Quantum Information 06, no. 03 (June 2008): 543–51. http://dx.doi.org/10.1142/s0219749908003566.

Full text
Abstract:
Utilizing a partially entangled GHZ state, we propose a novel controlled quantum secure direct communication (QSDC) with quantum encryption. Under the supervision and help of the third side, the sender and the receiver can securely share the private quantum entanglement keys used to encrypt and decrypt the secret message. According to the results of checking the eavesdropping on decoy photons, communicators can decide whether the quantum keys are reused in the next round. Not only will eavesdropping inevitably disturb the states of the decoy photons and be detected, but arbitrary transmission errors can also be corrected.
APA, Harvard, Vancouver, ISO, and other styles
9

Zaidi, Ali Mustafa, and David Greaves. "Value State Flow Graph." ACM Transactions on Reconfigurable Technology and Systems 9, no. 2 (February 3, 2016): 1–22. http://dx.doi.org/10.1145/2807702.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bouajjani, A., J. C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. "Minimal state graph generation." Science of Computer Programming 18, no. 3 (June 1992): 247–69. http://dx.doi.org/10.1016/0167-6423(92)90018-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Eavesdropping on the graph state"

1

Lawrence, Alan Christopher. "Optimizing compilation with the value state dependence graph." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Wei. "An approach to graph-based modeling of network exploitations." Diss., Mississippi State : Mississippi State University, 2005. http://sun.library.msstate.edu/ETD-db/ETD-browse/browse.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meana, Richard William Piper. "Approximate Sub-Graph Isomorphism For Watermarking Finite State Machine Hardware." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4728.

Full text
Abstract:
We present a method of mitigating theft of sequential circuit Intellectual Property hardware designs through means of watermarking. Hardware watermarking can be performed by selectively embedding a watermark in the state encoding of the Finite State Machine. This form of watermarking can be achieved by matching a directed graph representation of the watermark with a sub-graph in state transition graph representation of the FSM. We experiment with three approaches: a brute force method that provides a proof of concept, a greedy algorithm that provides excellent runtime with a drawback of sub-optimal results, and finally a simulated annealing method that provides near optimal solutions with runtimes that meet our performance goals. The simulated annealing approach when applied on a ten benchmarks chosen from IWLS 93 benchmark suite, provides watermarking results with edge overhead of less than 6% on average with runtimes not exceeding five minutes.
APA, Harvard, Vancouver, ISO, and other styles
4

Steenken, Dominik [Verfasser]. "Verification of infinite-state graph transformation systems via abstraction / Dominik Steenken." Paderborn : Universitätsbibliothek, 2015. http://d-nb.info/106989933X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stanier, James. "Removing and restoring control flow with the Value State Dependence Graph." Thesis, University of Sussex, 2012. http://sro.sussex.ac.uk/id/eprint/7576/.

Full text
Abstract:
This thesis studies the practicality of compiling with only data flow information. Specifically, we focus on the challenges that arise when using the Value State Dependence Graph (VSDG) as an intermediate representation (IR). We perform a detailed survey of IRs in the literature in order to discover trends over time, and we classify them by their features in a taxonomy. We see how the VSDG fits into the IR landscape, and look at the divide between academia and the 'real world' in terms of compiler technology. Since most data flow IRs cannot be constructed for irreducible programs, we perform an empirical study of irreducibility in current versions of open source software, and then compare them with older versions of the same software. We also study machine-generated C code from a variety of different software tools. We show that irreducibility is no longer a problem, and is becoming less so with time. We then address the problem of constructing the VSDG. Since previous approaches in the literature have been poorly documented or ignored altogether, we give our approach to constructing the VSDG from a common IR: the Control Flow Graph. We show how our approach is independent of the source and target language, how it is able to handle unstructured control flow, and how it is able to transform irreducible programs on the fly. Once the VSDG is constructed, we implement Lawrence's proceduralisation algorithm in order to encode an evaluation strategy whilst translating the program into a parallel representation: the Program Dependence Graph. From here, we implement scheduling and then code generation using the LLVM compiler. We compare our compiler framework against several existing compilers, and show how removing control flow with the VSDG and then restoring it later can produce high quality code. We also examine specific situations where the VSDG can put pressure on existing code generators. Our results show that the VSDG represents a radically different, yet practical, approach to compilation.
APA, Harvard, Vancouver, ISO, and other styles
6

Zhou, Rong. "Memory-efficient graph search applied to multiple sequence alignment." Diss., Mississippi State : Mississippi State University, 2005. http://library.msstate.edu/etd/show.asp?etd=etd-06282005-015428.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lei, Jiansheng. "Using graph theory to resolve state estimator issues faced by deregulated power systems." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

El, Musleh Mohammad. "Transformation of UML State Machine Diagram into Graph Database to Generate Test Cases." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-426060.

Full text
Abstract:
The manual approach in software testing is considered as expensive, error-prone, and time-consuming activity since it depends highly on the test engineers. As well, the process of software testing requires proper planning and resources to design the test cases. For this reason, any approach that can be used to enhance or automate the current testing process is necessary. This thesis introduces an approach to transform the Unified Modeling Language (UML) behavioral state machines diagram into a graph database inside Neo4j, a graph database software. Moreover, a framework is proposed that fetches test data from the graph database. Based on the similarity between the state machine notation and the nodes and edges (with properties) in graph databases, a set ofrules for representation is presented in this thesis. Along with a framework based on GRANDstack (full-stack framework), the framework should use the pre-built graph database together with other technologies to generate test cases from the inserted requirements specification. A proof-of-concept is implemented to demonstrate the proposed framework. By using a dedicated schema, the fetched data is matched with the expected results. The results prove that the transformation method and the proposed framework have a good potential to be developed and evaluated with a realistic test from the industry practice. Keywords: requirement, test data, UML, state machine diagram, black-box testing, test case generation, Neo4j, GraphQL API
APA, Harvard, Vancouver, ISO, and other styles
9

Black, Chelsea Lynn. "Resting-State Functional Brain Networks in Bipolar Spectrum Disorder: A Graph Theoretical Investigation." Diss., Temple University Libraries, 2016. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/393135.

Full text
Abstract:
Psychology
Ph.D.
Neurobiological theories of bipolar spectrum disorder (BSD) propose that the emotional dysregulation characteristic of BSD stems from disrupted prefrontal control over subcortical limbic structures (Strakowski et al., 2012; Depue & Iacono, 1989). However, existing neuroimaging research on functional connectivity between frontal and limbic brain regions remains inconclusive, and is unable to adequately characterize global functional network dynamics. Graph theoretical analysis provides a framework for understanding the local and global connections of the brain and comparing these connections between groups (Sporns et al., 2004). The purpose of this study was to investigate resting state functional connectivity in individuals at low and high risk for BSD based on moderate versus high reward sensitivity, both with and without a BSD diagnosis, using graph theoretical network analysis. Results demonstrated decreased connectivity in a cognitive control region (dorsolateral prefrontal cortex), but increased connectivity of a brain region involved in the detection and processing of reward (bilateral orbitofrontal cortex), among participants at high risk for BSD. Participants with BSD showed increased inter-module connectivity of the dorsal anterior cingulate cortex (ACC). Reward sensitivity was associated with decreased global and local efficiency, and interacted with BSD risk group status to predict inter-module connectivity. Findings are discussed in relation to neurobiological theories of BSD.
Temple University--Theses
APA, Harvard, Vancouver, ISO, and other styles
10

Schäfer, Alexander. "Identifying Changes of Functional Brain Networks using Graph Theory." Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-166041.

Full text
Abstract:
This thesis gives an overview on how to estimate changes in functional brain networks using graph theoretical measures. It explains the assessment and definition of functional brain networks derived from fMRI data. More explicitly, this thesis provides examples and newly developed methods on the measurement and visualization of changes due to pathology, external electrical stimulation or ongoing internal thought processes. These changes can occur on long as well as on short time scales and might be a key to understanding brain pathologies and their development. Furthermore, this thesis describes new methods to investigate and visualize these changes on both time scales and provides a more complete picture of the brain as a dynamic and constantly changing network.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Eavesdropping on the graph state"

1

Service included: Four-star secrets of an eavesdropping waiter. New York: William Morrow, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

New Jersey. Legislature. General Assembly. Independent Authorities Committee. Public hearing before Assembly Labor Committee Assembly Bill no. 210 (prohibits abuses of workplace electronic monitoring): April 30, 1990, State House Annex, Room 368, Trenton, New Jersey. Trenton, N.J: The Unit, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vladas, Sidoravicius, and Smirnov S. (Stanislav) 1970-, eds. Probability and statistical physics in St. Petersburg: St. Petersburg School in Probability and Statistical Physics : June 18-29, 2012 : St. Petersburg State University, St. Petersburg, Russia. Providence, Rhode Island: American Mathematical Society, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gdanskiy, Nikolay. Fundamentals of the theory and algorithms on graphs. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/978686.

Full text
Abstract:
The textbook describes the main theoretical principles of graph theory, the main tasks to be solved using graph structures, and General methods of their solution and specific algorithms, with estimates of their complexity. I covered a lot of the examples given questions to test knowledge and tasks for independent decisions. Along with the control tasks to verify the theoretical training provided practical assignments to develop programs to study topics of graph theory. Meets the requirements of Federal state educational standards of higher education of the last generation. Designed for undergraduate and graduate programs, studying information technology, for in-depth training in analysis and design of systems of complex structure. Also the guide can be useful to specialists of the IT sphere in the study of algorithmic aspects of graph theory.
APA, Harvard, Vancouver, ISO, and other styles
5

Schurz, Henri, Philip J. Feinsilver, Gregory Budzban, and Harry Randolph Hughes. Probability on algebraic and geometric structures: International research conference in honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea, June 5-7, 2014, Southern Illinois University, Carbondale, Illinois. Edited by Mohammed Salah-Eldin 1946- and Mukherjea Arunava 1941-. Providence, Rhode Island: American Mathematical Society, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mikov, Aleksandr. Generalized graphs and grammars. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1013698.

Full text
Abstract:
The textbook deals with ordinary graphs and their generalizations-hypergraphs, hierarchical structures, geometric graphs, random and dynamic graphs. Graph grammars are considered in detail. Meets the requirements of the federal state educational standards of higher education of the latest generation. For master's students studying in the areas of the 02.00.00 group "Computer and Information Sciences", and can also be used in senior bachelor's courses and other areas in the field of computer science and computer engineering.
APA, Harvard, Vancouver, ISO, and other styles
7

Seslavin, Andrey. Theory of automatic control. Linear, continuous systems. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1014654.

Full text
Abstract:
The textbook presents the basics of the classical theory of automatic control, based on mathematical models of real systems, given in the form of systems of linear differential equations with constant coefficients. Methods based on Laplace and Fourier transforms, stability, controllability, and observability theory, as well as directed graph theory and linear algebra are used. Meets the requirements of the federal state educational standards of higher education of the latest generation. For students of higher educational institutions studying in the areas of training and specialties 15.00.00 "Mechanical Engineering", 27.00.00 "Management in technical systems".
APA, Harvard, Vancouver, ISO, and other styles
8

Koldaev, Viktor. Theoretical and methodological aspects of the use of information technologies in education. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1014651.

Full text
Abstract:
The article summarizes the experience of implementing a personality-oriented approach to the formation of a structural and content model of the educational process at the university. The results of the introduction of information technologies and their services in the field of education are presented, as well as the impact of computerization on the quality of education in the framework of the modern educational paradigm. The priority directions of innovative educational strategies of the university are identified and a graph model of the individual educational route of the student is proposed in order to predict the state of the educational system and adopt optimal learning strategies. Meets the requirements of the federal state educational standards of higher education of the latest generation. For graduate students and university teachers in the design of variable models of training in any areas of training and specialties. It will be useful for advanced training on the problems of innovative educational strategies.
APA, Harvard, Vancouver, ISO, and other styles
9

Lowe, David, and Simon Hale-Ross. Terrorism and State Surveillance of Communications. Taylor & Francis Group, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lowe, David, and Simon Hale-Ross. Terrorism and State Surveillance of Communications. Taylor & Francis Group, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Eavesdropping on the graph state"

1

Turaev, Vladimir, and Alexis Virelizier. "The state sum graph TQFT." In Monoidal Categories and Topological Field Theory, 321–98. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49834-8_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Turaev, Vladimir, and Alexis Virelizier. "Properties of the state sum graph TQFT." In Monoidal Categories and Topological Field Theory, 399–429. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49834-8_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rensink, Arend. "Explicit State Model Checking for Graph Grammars." In Concurrency, Graphs and Models, 114–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-68679-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Best, Eike, Raymond Devillers, and Uli Schlachter. "A Graph-Theoretical Characterisation of State Separation." In SOFSEM 2017: Theory and Practice of Computer Science, 163–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51963-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gregoire, Jean. "State space compression with graph encoded sets." In The SPIN Verification System, 1–15. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/032/01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gebremedhin, Assefaw H., Fredrik Manne, and Tom Woods. "Speeding up Parallel Graph Coloring." In Applied Parallel Computing. State of the Art in Scientific Computing, 1079–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11558958_130.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Makhlouta, Jad, Fadi Zaraket, and Hamza Harkous. "Arabic Entity Graph Extraction Using Morphology, Finite State Machines, and Graph Transformations." In Computational Linguistics and Intelligent Text Processing, 297–310. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28604-9_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Clarisó, Robert, and Jordi Cabot. "Diverse Scenario Exploration in Model Finders Using Graph Kernels and Clustering." In Rigorous State-Based Methods, 27–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48077-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ślusarczyk, Grażyna, and Piotr Augustyniak. "A Graph Representation of Subject’s Time-State Space." In Advances in Intelligent and Soft Computing, 379–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13105-9_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Belahyane, Imane, Mouad Mammass, Hasna Abioui, and Ali Idarrou. "Graph-Based Image Retrieval: State of the Art." In Lecture Notes in Computer Science, 299–307. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51935-3_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Eavesdropping on the graph state"

1

Zhang, Yuchen, Sa Xiao, Jianquan Wang, Xiaojun Yuan, and Wanbin Tang. "Covert Communications under Multiple-Antenna Eavesdropping without Channel State Information." In MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM). IEEE, 2021. http://dx.doi.org/10.1109/milcom52596.2021.9652954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gallicchio, Claudio, and Alessio Micheli. "Graph Echo State Networks." In 2010 International Joint Conference on Neural Networks (IJCNN). IEEE, 2010. http://dx.doi.org/10.1109/ijcnn.2010.5596796.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pirandola, Stefano, Stefano Mancini, Seth Lloyd, and Samuel L. Braunstein. "Eavesdropping of Two-Way Coherent-State Quantum Cryptography via Gaussian Quantum Cloning Machines." In 2009 Third International Conference on Quantum, Nano and Micro Technologies (ICQNM). IEEE, 2009. http://dx.doi.org/10.1109/icqnm.2009.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tortorella, Domenico, and Alessio Micheli. "Dynamic Graph Echo State Networks." In ESANN 2021 - European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. Louvain-la-Neuve (Belgium): Ciaco - i6doc.com, 2021. http://dx.doi.org/10.14428/esann/2021.es2021-70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xie, Wenbo, Wenhan Dai, and Don Towsley. "Graph State Distribution: Integer Formulation." In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2021. http://dx.doi.org/10.1109/qce52317.2021.00085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lei, Qing, Yajie Li, Haokun Song, Wei Wang, Yongli Zhao, Jie Zhang, and Yongyuan Liu. "Multi-intensity Bending Eavesdropping Detection and Identification Scheme Based on the State of Polarization." In 2023 Opto-Electronics and Communications Conference (OECC). IEEE, 2023. http://dx.doi.org/10.1109/oecc56963.2023.10209623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bhaumik, Himangsu, and S. B. Santra. "Dissipative sandpile on growing random graph." In SOLID STATE PHYSICS: Proceedings of the 56th DAE Solid State Physics Symposium 2011. AIP, 2012. http://dx.doi.org/10.1063/1.4709954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

You, Hongyuan, Adam Liska, Nathan Russell, and Payel Das. "Automated brain state identification using graph embedding." In 2017 International Workshop on Pattern Recognition in Neuroimaging (PRNI). IEEE, 2017. http://dx.doi.org/10.1109/prni.2017.7981508.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yeom, Sungwoong, Chulwoong Choi, Shivani Sanjay Kolekar, and Kyungbaek Kim. "Graph Convolutional Network based Link State Prediction." In 2021 22nd Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, 2021. http://dx.doi.org/10.23919/apnoms52696.2021.9562682.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yan, Lei, Peng Luo, Hanyu Cui, Ronghua Shi, and Ying Guo. "Quantum Route Selection based on Graph State." In 2016 4th International Conference on Machinery, Materials and Computing Technology. Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icmmct-16.2016.224.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Eavesdropping on the graph state"

1

Gallagher, B. The State of the Art in Graph-Based Pattern Matching. Office of Scientific and Technical Information (OSTI), March 2006. http://dx.doi.org/10.2172/895418.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Qi, Fei, Zhaohui Xia, Gaoyang Tang, Hang Yang, Yu Song, Guangrui Qian, Xiong An, Chunhuan Lin, and Guangming Shi. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, December 2020. http://dx.doi.org/10.37686/ser.v1i2.77.

Full text
Abstract:
As an emerging field, Automated Machine Learning (AutoML) aims to reduce or eliminate manual operations that require expertise in machine learning. In this paper, a graph-based architecture is employed to represent flexible combinations of ML models, which provides a large searching space compared to tree-based and stacking-based architectures. Based on this, an evolutionary algorithm is proposed to search for the best architecture, where the mutation and heredity operators are the key for architecture evolution. With Bayesian hyper-parameter optimization, the proposed approach can automate the workflow of machine learning. On the PMLB dataset, the proposed approach shows the state-of-the-art performance compared with TPOT, Autostacker, and auto-sklearn. Some of the optimized models are with complex structures which are difficult to obtain in manual design.
APA, Harvard, Vancouver, ISO, and other styles
3

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipeline from raw fMRI data to hypothesis testing, including spatial coregistration, ART-based scrubbing, aCompCor strategy for control of physiological and movement confounds, first-level connectivity estimation, and second-level random-effect analyses and hypothesis testing.
APA, Harvard, Vancouver, ISO, and other styles
4

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipeline from raw fMRI data to hypothesis testing, including spatial coregistration, ART-based scrubbing, aCompCor strategy for control of physiological and movement confounds, first-level connectivity estimation, and second-level random-effect analyses and hypothesis testing.
APA, Harvard, Vancouver, ISO, and other styles
5

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipeline from raw fMRI data to hypothesis testing, including spatial coregistration, ART-based scrubbing, aCompCor strategy for control of physiological and movement confounds, first-level connectivity estimation, and second-level random-effect analyses and hypothesis testing.
APA, Harvard, Vancouver, ISO, and other styles
6

Mikhaleva, E., E. Babikova, G. Bezhashvili, M. Ilina, and I. Samkova. VALUE STREAM PROGRAM. Sverdlovsk Regional Medical College, December 2022. http://dx.doi.org/10.12731/er0618.03122022.

Full text
Abstract:
In order to increase the efficiency of the work of a medical organization, it is necessary to train medical workers, employees of medical organizations, students of educational organizations in the techniques and methods of lean production, followed by the application of the acquired skills directly at the workplace in a medical organization. The purpose of the training under the program is to acquire new competencies necessary to perform professional tasks using lean manufacturing tools - mapping the value stream to ensure maximum operational efficiency of production processes. The program provides for independent work: mapping the value stream of the current, ideal and target states of the process, analysis of the value stream of the current state of the process (problem identification: spaghetti method, pyramid of problems, graph-links, summary table of root causes and contribution of the solution), development of a plan measures to achieve the target state of the process.
APA, Harvard, Vancouver, ISO, and other styles
7

Соловйов, В. М., and В. В. Соловйова. Моделювання мультиплексних мереж. Видавець Ткачук О.В., 2016. http://dx.doi.org/10.31812/0564/1253.

Full text
Abstract:
From the standpoint of interdisciplinary self-organization theories and synergetics analyzes current approaches to modeling socio-economic systems. It is shown that the complex network paradigm is the foundation on which to build predictive models of complex systems. We consider two algorithms to transform time series or a set of time series to the network: recurrent and graph visibility. For the received network designed dynamic spectral, topological and multiplex measures of complexity. For example, the daily values the stock indices show that most of the complexity measures behaving in a characteristic way in time periods that characterize the different phases of the behavior and state of the stock market. This fact encouraged to use monitoring and prediction of critical and crisis states in socio-economic systems.
APA, Harvard, Vancouver, ISO, and other styles
8

Shah, Ayesha, Jan Olek, and Rebecca S. McDaniel. Real Life Experience with Major Pavement Types. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317371.

Full text
Abstract:
Pavement performance is a complex issue which depends on many contributing factors. Examining the performance of real-life pavements across the state determines what the actual service lives are for the pavements. For the purposes of this study, only selected LTPP projects were examined, along with a database containing all the historic repair projects completed in Indiana. Pertinent information present in the Indiana Historic Contracts Database was extracted concerning the types of pavement repair and treatments options commonly employed within the state, the time between repairs, etc. These data were used to determine descriptive statistical parameters and was summarized in graph form. Similarly, data about selected LTPP GPS and SPS sites were downloaded from the online website, LTPP InfoPave and a comparative study between companion sites was performed. These data included study site and pavement-related information, such as construction dates, pavement structure details, maintenance and repair history, and pavement distress surveys. These data were used to draw conclusions about the impact of treatment applications, climatic and geologic factors, traffic volume, and pavement structures on pavement performance. Gaps in knowledge about pavement failure modes, distress data, and effectiveness of treatment applications mentioned in the contracts database file hampered efforts to form a complete picture of the effectiveness of treatment options and their timely (or untimely) application. Similarly, details about pavement mixture design and differentiating factors between companion sites prevented researchers from narrowing down the causes leading to the observed pavement distress.
APA, Harvard, Vancouver, ISO, and other styles
9

Cram, Jana, Mary Levandowski, Kaci Fitzgibbon, and Andrew Ray. Water resources summary for the Snake River and Jackson Lake Reservoir in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway: Preliminary analysis of 2016 data. National Park Service, June 2021. http://dx.doi.org/10.36967/nrr-2285179.

Full text
Abstract:
This report summarizes discharge and water quality monitoring data for the Snake River and Jackson Lake reservoir levels in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway for calendar year 2016. Annual and long-term discharge summaries and an evaluation of chemical conditions relative to state and federal water quality standards are presented. These results are considered provisional, and may be subject to change. River Discharge: Hydrographs for the Snake River at Flagg Ranch, WY, and Moose, WY, exhibit a general pattern of high early summer flows and lower baseflows occurring in late summer and fall. During much of 2016, flows at the Flagg Ranch monitoring location were similar to the 25th percentile of daily flows at that site. Peak flows at Flagg Ranch were similar to average peak flow from 1983 to 2015 but occurred eleven days earlier in the year compared to the long-term average. Peak flows and daily flows at the Moose monitoring station were below the long-term average. Peak flows occurred four days later than the long-term average. During summer months, the unnatural hydro-graph at the Moose monitoring location exhibited signs of flow regulation associated with the management of Jackson Lake. Water Quality Monitoring in the Snake River: Water quality in the Snake River exhibited seasonal variability over the sampling period. Specifically, total iron peaked during high flows. In contrast, chloride, sulfate, sodium, magnesium, and calcium levels were at their annual minimum during high flows. Jackson Lake Reservoir: Reservoir storage dynamics in Jackson Lake exhibit a pattern of spring filling associated with early snowmelt runoff reaching maximum storage in mid-summer (on or near July 1). During 2016, filling water levels and reservoir storage began to increase in Jackson Lake nearly two weeks earlier than the long-term average and coincident with increases in runoff-driven flows in the Snake River. Although peak storage in Jackson Lake was larger and occurred earlier than the long-term average, minimum storage levels were similar to the long-term average.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Eavesdropping on the graph state' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography