Reversibility and Models for Concurrency

Intermediate representations (IRs) are fundamental to classical and quantum computing, bridging high-level quantum programming languages and the hardware-specific instructions required for execution. This paper reviews the development of quantum IRs, focusing on their evolution and the need for abstraction layers that facilitate portability and optimization. Monolithic quantum IRs, such as QIR (Lubinski et al. in Front Phys 10:940293, 2022. https://doi.org/10.3389/fphy.2022.940293), QSSA (Peduri et al. in Proceedings of the 31st ACM SIGPLAN international conference on compiler construction. CC 2022. Association for Computing Machinery, New York, 2022), or Q-MLIR (McCaskey and Nguyen in Proceedings-2021 IEEE International Conference on Quantum Computing and Engineering, QCE, 2021), their effectiveness in handling abstractions, and their hybrid support between quantum-classical operations are evaluated. However, a key limitation is their inability to address qubit locality, an essential feature for distributed quantum computing (DQC). To overcome this, InQuIR (Nishio and Wakizaka in InQuIR: Intermediate Representation for Interconnected Quantum Computers, 2023. https://arxiv.org/abs/2302.00267) was introduced as an IR specifically designed for distributed systems, providing explicit control over qubit locality and inter-node communication. While effective in managing qubit distribution, InQuIR’s dependence on manual manipulation of communication protocols increases complexity for developers. NetQIR (Vázquez-Pérez et al. in NetQIR: An Extension of QIR for Distributed Quantum Computing, 2024. https://arxiv.org/abs/2408.03712), an extension of QIR for DQC, emerges as a solution to achieve the abstraction of quantum communications protocols. This review emphasizes the need for further advancements in IRs for distributed quantum systems, which will play a crucial role in the scalability and usability of future quantum networks.

Notice of Violation of IEEE Publication Principles <br><br> “The Study on Dynamic Population Size Improvements for Classical Particle Swarm Optimization” by Chen Lei <br> in the Proceedings of the International Conference on Computer Science and Network Technology (ICCSNT), December 2011, pp.430-433 <br><br> After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE’s Publication Principles. <br><br> This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission. <br><br> Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article: <br><br> “An Evolutionary Dynamic Population Size PSO Implementation” <br> by Bassel Soudan and Mohamed Saad <br> in the Proceedings of the 3rd International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA), April 2008 <br><br> <br/> In this work we presented two dynamic population size improvements for the classical PSO. EP-PSO started with a small number of particles and increased the number of particles dynamically by iteratively duplicating the updated particles. DP-PSO started with a large number of particles then reduced the number by dropping the worst performing half iteratively. Both EP-PSO and DP-PSO reduced the execution time by 60% on average compared to the classical PSO. EP-PSO fared quite badly when convergence rate and convergence ability to the global optimum was considered. On the other hand, DP-PSO performed reasonably well compared to the classical PSO but at a much faster convergence and execution speed.

Proceedings of International Conference on Social Sciences is a peer-reviewed, open access proceedings which aims to disseminate knowledge on the field of Social Sciences to the readers by publishing original research and reviews in the related field. The scope includes issues in Social Issues, Cross Cultural Studies, Globalization, Development Studies, Psychology and philosophy, Demographic Studies and many other current issues in Social Sciences around the globe.

Notice of Violation of IEEE Publication Principles<br><br>"Modified Integer Factorization Algorithm using V-Factor Method"<br> by Prashant Sharma, Amit Kumar Gupta and Ashish Vijay<br> in the Proceedings of the Second International Conference on Advanced Computing and Communication Technology, January 2012, pp. 423-425<br><br> After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.<br><br> This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.<br><br> Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:<br><br> "VFactor: A Simple Algorithm for Integer Factorization"<br> by Vikas Pareek and Manisha Sharma<br> in the Proceedings of the International Conference on Computer Engineering and Technology (ICCET), November 2010<br><br> <br/> RSA is the asymmetric cryptography system. The security of RSA public key cryptosystem is based on the assumption that factoring of a large number (modulus). Integer Factorization is an important problem mainly due to its connection with RSA algorihm of Public key cryptography. We present a new special purpose algorithm (VFactor) for factoring. We compare this algorithm with Fermat's Factorization algorithm (FFM) and trial division algorithm (TDM) and we show that VFactor's runtime depends on the difference of factors and is independent of size of the modulus. So it's effective whenever factors are close to each other. In that case VFactor outperforms FFM and TDM. Keywords: Integer factorization, RSA algorithm, Fermat's Method of Factorization, Public key cryptography, TDM.

Quantum computing is a multidisciplinary field at the intersectionof quantum physics, computer science, and mathematics, aiming to har-ness quantum mechanical phenomena for computational advantage. Thisarticle provides a comprehensive review of both the foundational princi-ples and advanced theoretical models of quantum computing. We beginwith the basic framework of quantum computation, introducing the con-cept of qubits as two-level quantum systems, the linear algebra of Hilbertspaces, Dirac’s bra–ket notation, and the postulates of quantum mechan-ics (state superposition, unitary evolution, and projective measurement).We then discuss quantum logic gates and circuits, highlighting how clas-sical reversible computation principles extend to universal quantum gatesets. Next, we survey key quantum algorithms (from Shor’s factoring toGrover’s searching and beyond) and the complexity-theoretic implicationsof quantum computers, contrasting the class BQP with classical complex-ity classes. We cover the theoretical foundations of quantum error cor-rection and fault tolerance, explaining how quantum information can beprotected from decoherence using redundancy and how fault-tolerant pro-tocols can, in principle, allow scalable quantum computation despite noisyhardware. We then explore advanced models and paradigms of quantumcomputation, including measurement-based quantum computing (one-wayquantum computing), topological quantum computation with anyons, adi-abatic quantum computing and quantum annealing, continuous-variablequantum computing, and related approaches. We also provide an overviewof quantum information theory as it relates to computation, discussingentanglement, quantum entropy, and information-theoretic limits like theHolevo bound. Finally, we review the leading physical implementations(quantum hardware models) of quantum computers—trapped ions, super-conducting circuits, photonic systems, solid-state spin qubits, and oth-ers—outlining the challenges and achievements of each approach.

Agents (adaptive or intelligent agents and multi-agent systems) are one of the most prominent and attractive technologies in Computer Science at the beginning of the new century. Agent and MAS technologies, methods, and theories are currently contributing to many diverse domains such as information retrieval, user interface design, robotics, electronic commerce, computer mediated collaboration, computer games, education and training, smart environments, ubiquitous computers, social simulation, etc.Agents are not only a very promising technology, they are emerging as a new way of thinking, a conceptual paradigm for analyzing problems and for designing systems, for dealing with complexity, distribution and interactivity, and perhaps a new perspective on computing and intelligence. Yet to realize this promise further advances are required in agent architectures, languages, theories, and design techniques.To accept this challenge, three very successful and high level events, AA (the International Conference on Autonomous Agents), ICMAS (the International Conference on Multi-Agent Systems), and ATAL (the International Workshop on Agent Theories, Architectures, and Languages), decided to build on their past successes and converge in 2002 in a Joint Conference.The aims of this joint venture are:to strengthen the relationships within the broader Agent community,to enhance quality while promoting innovation,to encourage richer exchanges between theoretical and experimental research and applications, modeling and engineering, and between the micro and the macro levels of agent design, and to foster collaboration between information science and technology and the cognitive and social sciences.The theme of the conference is Bringing People and Agents Together. As agent-based computing becomes ever more widespread, it is increasingly important for agents to interact effectively with people and with other agents. In addition to the normal research topics of the component conferences, we particularly encouraged submissions that address issues of how to improve interaction and collaboration among agents and people.Response to the new conference was very favorable. The over 500 papers were submitted to the conference. Some of these were selected for publication as full papers, and others were selected for presentation as posters. The acceptance rate for full papers was 27%, low enough to ensure high quality, yet high enough to include a variety of topics and perspectives. The paper and poster summaries are included in this proceedings, which is divided into three volumes, one for each day of the conference.

Proceedings of the 13th international conference on Modularity

Adiabatic quantum computing (AQC) is a model of computation that uses quantum mechanical processes operating under adiabatic conditions. As a form of universal quantum computation, AQC employs the principles of superposition, tunneling, and entanglement that manifest in quantum physical systems. The AQC model of quantum computing is distinguished by the use of dynamical evolution that is slow with respect to the time and energy scales of the underlying physical systems. This adiabatic condition enforces the promise that the quantum computational state will remain well-defined and controllable thus enabling the development of new algorithmic approaches. Several notable algorithms developed within the AQC model include methods for solving unstructured search and combinatorial optimization problems. In an idealized setting, the asymptotic complexity analyses of these algorithms indicate computational speed-ups may be possible relative to state-of-the-art conventional methods. However, the presence of non-ideal conditions, including non-adiabatic dynamics, residual thermal excitations, and physical noise complicate the assessment of the potential computational performance. A relaxation of the adiabatic condition is captured in the complementary computational heuristic of quantum annealing, which accommodates physical systems operating at finite temperature and in open environments. While quantum annealing (QA) provides a more accurate model for the behavior of actual quantum physical systems, the possibility of non-adiabatic effects obscures a clear separation with conventional computing complexity. A series of technological advances in the control of quantum physical systems have enabled experimental AQC and QA. Prominent examples include demonstrations using superconducting electronics, which encode quantum information in the magnetic flux induced by a weak current operating at cryogenic temperatures. A family of devices developed specifically for unconstrained optimization problems has been applied to solve problems in specific domains including logistics, finance, material science, machine learning, and numerical analysis. An accompanying infrastructure has also developed to support these experimental demonstrations and to enable access of a broader community of users. Although AQC is most commonly applied in superconducting technologies, alternative approaches include optically trapped neutral atoms and ion-trap systems. The significant progress in the understanding of AQC has revealed several open topics that continue to motivate research into this model of quantum computation. Foremost is the development of methods for fault-tolerant operation that will ensure the scalability of AQC for solving large-scale problems. In addition, unequivocal experimental demonstrations that differentiate the computational power of AQC and its variants from conventional computing approaches are needed. This will also require advances in the fabrication and control of quantum physical systems under the adiabatic restrictions.

"Bulletin of Islamic Medicine. Vol. 1, Second Ed., Proceedings of the First International Conference on Islamic Medicine celebrating the advent of the 15th Hijri Century,ed. Abdul Rahman Abdullah Al-Awadi. Kuwait, Ministry of Public Health, National Council for Culture, Arts and Letters, Rabie Awwal 1401 (1981), 789 pp., illus., (no price stated). Bulletin of Islamic Medicine. Vol. 2, Proceedings of the Second International Conference on Islamic Medicine, ed. Abdul Rahman Abdullah AI-Awadi and Ahmed Ragai El-Gindy. Kuwait (s.a.) 1402 (1982), 797 pp. (no price stated)." published on 01 Jan 1983 by Brill.

Get PDF Email Share Share with Facebook Tweet This Post on reddit Share with LinkedIn Add to CiteULike Add to Mendeley Add to BibSonomy Get Citation Copy Citation Text , "Proceedings of the Second International Conference on Spectrochemistry," J. Opt. Soc. Am. 43, 624-624 (1953) Export Citation BibTex Endnote (RIS) HTML Plain Text Citation alert Save article

M. Petyt H.F. Wolfe Proceedings of the second international conference on recent advances in structural dynamics Volume 1 1984 University of Southampton Southampton SO9 5NH; Edited by M. Petyt H.F. Wolfe Proceedings of the second international conference on recent advances in structural dynamics Volume 2 1984 University of Southampton Southampton SO9 5NH 892+xi pp. Price (two volumes): UK π35·00; overseas

Aquaculture Nutrition Get access Proceedings of the First International Conference on Aquaculture Nutrition (14–15 October 1975), edited by Price Kent S.Jr. Shaw William N. Danberg Karin S.. Sea Grant Program, University of Delaware, Newark, 1976, 323 p., illus., $3.00 (Paper). Robert C. May Robert C. May Hawaii Institute of Marine Biology, P.O. Box 1346, Kaneohe, HI 96744 Search for other works by this author on: Oxford Academic Google Scholar BioScience, Volume 27, Issue 10, October 1977, Page 688, https://doi.org/10.2307/1297558 Published: 01 October 1977

Notice of Violation of IEEE Publication Principles<br><br>"An Effective Defense Against Distributed Denial of Service in Grid"<br>by Mohan H.S. and A. Raji Reddy,<br>in the Proceedings of the First International Conference on Integrated Intelligent Computing, August 2010, pp. 84-89<br><br>After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.<br><br>This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.<br><br>Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:<br><br>"An Effective Defense Against Distributed Denial of Service in Grid"<br>by N. Venkatesu, V. Deepan Chakravarthy, D. Sathya<br> in the Proceedings of the First International Conference on Emerging Trends in Engineering and Technology, July 2008, pp. 373-378<br><br> <br/> IP spoofing has been exploited by Distributed Denial of Service (DDoS) attacks to conceal flooding sources and localities in flooding traffic, and prevent legitimate hosts into becoming reflectors, redirecting and amplifying flooding traffic. Thus, the ability to filter spoofed IP packets near victims is essential to their own protection as well as to their avoidance of becoming congestion and involuntary DoS reflectors. Although an attacker can forge any field in the IP header, he or she cannot falsify the number of hops an IP packet takes to reach its destination. This hop count information can be inferred from the Time- to-Live (TTL) value in the IP header. Using a mapping between IP addresses and their hop-counts to an Internet server, the server can distinguish spoofed IP packets from legitimate ones. Based on this observation, we present a novel filtering technique that is immediately deployable to weed out spoofed IP packets. We have an IP to Hop Count Mapping Table (IP2HC) to store the Hop Count Values. We implement HCF in the Linux kernel, demonstrating its benefits using experimental measurements. We deploy the security mechanism in Globus Toolkit (GT4) to ensure that HCF can identify the spoofed packet in a Grid Environment.

The mystery of the Holy Trinity in the Fathers of the Church. The proceedings of the fourth international patristic conference, Maynooth, 1999. Edited by D. Vincent Twomey and Lewis Ayres. (Irish Theological Quarterly Monograph Ser., 3.) Pp. 199. Dublin: Four Courts Press, 2007. £50. 978 1 85182 859 3 - Volume 59 Issue 4

&amp;lt;p&amp;gt;Ageing infrastructure alongside with extreme climatic conditions pose a major threat for the sustainability of civil infrastructure systems with significant societal and economic impacts [1]. A main issue also arises from the fact that past and existing methods that incorporate the risk of climatic hazards into infrastructure design and assessment methods are based on historical records [2].&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;Major flood incidents are the factor of evolving geomorphological processes, which cause a drastic reduction in the safe capacity of structures (e.g. bridges, dams). Many efforts focused on the development and application of monitoring techniques to provide real-time assessment of geomorphological conditions around structural elements [1, 3, 4]. However, the current qualitative visual inspection practice cannot provide reliable assessment of geomorphological effects at bridges and other water infrastructure.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;This work presents an analysis of the useful experience and lessons learnt from past monitoring efforts applied to assess geomorphological conditions at bridges and other types of water infrastructure. The main advantages and limitations of each monitoring method is summarized and compared, alongside with the key issues behind the failure of existing instrumentation to provide a solution. Finally, future directions on scour monitoring is presented focusing on latest advances in soil and remote sensing methods to provide modern and reliable alternatives for real-time monitoring and prediction [5, 6] of climatic hazards of infrastructure at risk.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;&amp;amp;#160;&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;References&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;[1] Michalis, P., Konstantinidis, F. and Valyrakis, M. (2019) The road towards Civil Infrastructure 4.0 for proactive asset management of critical infrastructure systems. Proceedings of the 2nd International Conference on Natural Hazards &amp;amp; Infrastructure (ICONHIC2019), Chania, Greece, 23&amp;amp;#8211;26 June 2019.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;[2] Pytharouli, S., Michalis, P. and Raftopoulos, S. (2019) From Theory to Field Evidence: Observations on the Evolution of the Settlements of an Earthfill Dam, over Long Time Scales. Infrastructures 2019, 4, 65.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;[3] Koursari, E., Wallace, S., Valyrakis, M. and Michalis, P. (2019). The need for real time and robust sensing of infrastructure risk due to extreme hydrologic events, 2019 UK/ China Emerging Technologies (UCET), Glasgow, United Kingdom, 2019, pp. 1-3.&amp;amp;#160;doi: 10.1109/UCET.2019.8881865&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;[4] Michalis, P., Saafi, M. and M.D. Judd. (2012) Integrated Wireless Sensing Technology for Surveillance and Monitoring of Bridge Scour. Proceedings of the 6th International Conference on Scour and Erosion, France, Paris, pp. 395-402.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;[5] Valyrakis, M., Diplas, P., and Dancey, C.L. (2011) Prediction of coarse particle movement with adaptive neuro-fuzzy inference systems, Hydrological Processes, 25 (22). pp. 3513-3524. ISSN 0885-6087, doi:10.1002/hyp.8228.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;[6] Valyrakis, M., Michalis, P. and Zhang, H. (2015) A new system for bridge scour monitoring and prediction. Proceedings of the 36th IAHR World Congress, The Hague, the Netherlands, pp. 1-4.&amp;lt;/p&amp;gt;