cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Amphiuridae Ljungman 1866
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Amphiuridae

description: Family: Amphiuridae
Acrocnida brachiata (Montagu, 1804)
Amphiura (Amphiura) grandisquama Lyman, 1869 Amphiura cherbonnieri Guille, 1972
Amphiura chiajei Forbes, 1843
Amphiura filiformis (O.F. Müller, 1776)
Amphiura mediterranea Lyman, 1882
Amphiura (Ophiopeltis) securigera (Düben & Koren, 1846) Amphipholis squamata (Delle Chiaje, 1828)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 105, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Foliaro nº 35 (Reveno al Francio) (p. 11)
Creators: name: Péraire, Lucien
name: CNRS
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2023

description: Priskribo de mia vivo sur ŝipo Takoma-Maru: libereco ĉion viziti
Black-Box Attacks against Signed Graph Analysis via Balance Poisoning
Creators: name: Zhou, Jialong
name: Lai, Yuni
name: Ren, Jian
name: Zhou, Kai
Publisher: name: arXiv
Year: 2023
Subjects: subject: Cryptography and Security (cs.CR)
subject: Social and Information Networks (cs.SI)
subject: FOS: Computer and information sciences

description: Signed graphs are well-suited for modeling social networks as they capture both positive and negative relationships. Signed graph neural networks (SGNNs) are commonly employed to predict link signs (i.e., positive and negative) in such graphs due to their ability to handle the unique structure of signed graphs. However, real-world signed graphs are vulnerable to malicious attacks by manipulating edge relationships, and existing adversarial graph attack methods do not consider the specific structure of signed graphs. SGNNs often incorporate balance theory to effectively model the positive and negative links. Surprisingly, we find that the balance theory that they rely on can ironically be exploited as a black-box attack. In this paper, we propose a novel black-box attack called balance-attack that aims to decrease the balance degree of the signed graphs. We present an efficient heuristic algorithm to solve this NP-hard optimization problem. We conduct extensive experiments on five popular SGNN models and four real-world datasets to demonstrate the effectiveness and wide applicability of our proposed attack method. By addressing these challenges, our research contributes to a better understanding of the limitations and resilience of robust models when facing attacks on SGNNs. This work contributes to enhancing the security and reliability of signed graph analysis in social network modeling. Our PyTorch implementation of the attack is publicly available on GitHub: https://github.com/JialongZhou666/Balance-Attack.git.
Ophiacanthidae
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Ophiacanthidae

description: Family: Ophiacanthidae
Ophiacantha setosa (Bruzelius, 1805)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 105, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Rustic Capital Writing in Herculaneum papyri
Creators: name: Marichal, Robert
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2015

description: vue 162
description: "Study of the following Latin papyri classified under the name 'Capitale rustique classique': P.Herc. 1066, 1067, 1070, 1472, 1475, 1484, 1535, 1558, 1644 (the folder contains a brief description of P.Herc 1066). All the mentioned papyri are listed on the cover page of the main folder together with all the papyri studied in 4MAR_9_2_5-12 (classified as 'Capitale livresque'). The numbers of the papyri studied in 4MAR_9_2_5-12 are marking in different ink meaning 'recopié'; some numbers are accompanied by the indication 'micro' (in different ink). In addition to some bibliographical notes, the indication 'Vu 54 - fini - Revue 58' is written at the end of the list. The study related to each papyrus is enclosed in one folder with the number of the papyrus written on the upper right corner; in some cases the sheets related to two papyri are inserted in one single folder, and one of the two numbers is written in a different ink."
description: Source: 4MAR_9_2_5-16
description: Relation: 4MAR_2_5-12,
description: created: n.d., 1957
Ophiocomidae Ljungman 1867
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Ophiocomidae

description: Family: Ophiocomidae
Ophiopsila annulosa (M. Sars, 1859) Ophiopsila aranea Forbes, 1843
Ophiopsila guineensis Koehler, 1914
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 105, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Privacy-Preserving Quantum Two-Party Geometric Intersection
Creators: name: Liu, Wen-Jie
name: Xu, Yong
name: Yang, James C. N.
name: Yu, Wen-Bin
name: Chi, Lian-Hua
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. As an important field, the privacy-preserving geometric intersection (PGI) problem is when each of the multiple parties has a private geometric graph and seeks to determine whether their graphs intersect or not without revealing their private information. In this study, through representing Alice's (Bob's) private geometric graph G_A (G_B) as the set of numbered grids S_A (S_B), an efficient privacy-preserving quantum two-party geometric intersection (PQGI) protocol is proposed. In the protocol, the oracle operation O_A (O_B) is firstly utilized to encode the private elements of S_A=(a_0, a_1, ..., a_(M-1)) (S_B=(b_0, b_1, ..., b_(N-1))) into the quantum states, and then the oracle operation O_f is applied to obtain a new quantum state which includes the XOR results between each element of S_A and S_B. Finally, the quantum counting is introduced to get the amount (t) of the states |a_i+b_j> equaling to |0>, and the intersection result can be obtained by judging t>0 or not. Compared with classical PGI protocols, our proposed protocol not only has higher security, but also holds lower communication complexity.
Erica cinerea L.
Creators: name: Info Flora
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Plantae
Tracheophyta
Magnoliopsida
Ericales
Ericaceae
Erica
Erica cinerea

description: Erica cinerea L.
Art ISFS: 152450 Checklist: 1017410 Ericaceae Erica Erica cinerea L.
ZusammenfassungKEINE ANGABE
Ökologie
Lebensraum Lebensraumnach Delarze & al. 2015
KEINE ANGABE
Ökologische Zeigerwerte nach Landolt & al. (2010)
BodenfaktorenKlimafaktorenSalztoleranzFeuchtezahl F--Lichtzahl L--Salzzeichen--Reaktionszahl R--Temperaturzahl T--Nährstoffzahl N--Kontinentalitätszahl K--
Nomenklatur
Gültiger Name (Checklist 2017):Erica cinereaL.
Volksname
Deutscher Name: -- Nom français: -- Nome italiano: --
Übereinstimmung mit anderen Referenzwerken
RelationNomReferenzwerkeNo=Erica cinerea L.SISF/ISFS 2152450
= Taxon stimmt mit akzeptiertem Taxon überein (Checklist 2017)  Taxon enthält (neben anderen) auch das akzeptierte Taxon (Checklist 2017)
Status Indigenat: -
Liste der gefährdeten Pflanzen IUCN(nach Walter & Gillett 1997): Nein
description: Published as part of Info Flora, 2021,
title: Venclova_4
Creators: name: Dreslerová, Dagmar
name: Venclová, Natalie
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2021
Subjects: subject: Chronology
subject: Trade
subject: Interactions
subject: Economy
subject: Politics
subject: Statuary
subject: Mobilities
subject: Oppida
subject: Hillforts
subject: Architecture
subject: FOS: Civil engineering
subject: Production
subject: âge du Fer
subject: Europe
subject: Hallstatt
subject: La Tène
subject: Celtes
subject: Celts
subject: Fortifications
subject: agglomérations
subject: urbanisation
subject: fermes
subject: histoire
subject: archéologie
subject: religion
subject: rites
subject: Protohistoire
subject: Historiographie
subject: Gaulois
subject: chronologie
subject: commerce
subject: échanges
subject: économie
subject: politique
subject: statuaire
subject: mobilités
subject: oppida Hillforts
subject: architecture
subject: production
subject: environnement
subject: aristocratie
subject: carpollogie
subject: archéozoologie
subject: céramologie
subject: Méditerranée
subject: Atlantique
subject: nécropole
subject: numismatique
subject: textes
subject: art
subject: archéométrie
subject: romanisation
subject: anthropologie
subject: guerre
subject: militaire
subject: Jules César
subject: Iron Age
subject: Agglomerations
subject: Urbanization
subject: Farms
subject: History
subject: Archaeology
subject: Religion
subject: Protohistory
subject: Historiography
subject: Gauls

description: The Říčansko region. Modelled La Tène period settlement areas : 
1. Area of settlements, fields, pastures and exploited forest; Hypothetical increase of exploitation of wood for the production of charcoal;
2. An increase of exploitation 40x in 25 years (10 ha per unit); 
3. An increase of exploitation 400x in 25 years (100 ha per unit);
4. Forest reserve.
Ophiodermatidae Ljungman 1867
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Ophiodermatidae

description: Family: Ophiodermatidae
Ophioconis forbesi (Heller, 1862)
Ophioderma longicauda (Bruzelius, 1805)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 105, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States
Creators: name: Liu, Wen-Jie
name: Xu, Yong
name: Yang, Ching-Nung
name: Gao, Pei-Pei
name: Yu, Wen-Bin
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al.(Quantum Inf. Process. 13(11), 2391-2405, 2014). However, Zhu et al. pointed out that there are some security flaws and proposed an improved version (Quantum Inf. Process. 14(11), 4245-4254, 2015). In this study, we will show Zhu et al.'s improvement still exists some security problems, and its efficiency is not high enough. For solving these problems, we utilize four Pauli operations {I, Z, X, Y } to encode two bits instead of the original two operations {I,X} to encode one bit, and then propose an efficient and secure arbitrary N-party quantum key agreement protocol. In the protocol, the channel checking with decoy single photons is introduced to avoid the eavesdropper's flip attack, and a post-measurement mechanism is used to prevent against the collusion attack. The security analysis shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement.
description: 13 pages, 5 figures
Cerberus: Attribute-based person re-identification using semantic IDs
Creators: name: Eom, Chanho
name: Lee, Geon
name: Cho, Kyunghwan
name: Jung, Hyeonseok
name: Jin, Moonsub
name: Ham, Bumsub
Publisher: name: arXiv
Year: 2024
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: FOS: Computer and information sciences

description: We introduce a new framework, dubbed Cerberus, for attribute-based person re-identification (reID). Our approach leverages person attribute labels to learn local and global person representations that encode specific traits, such as gender and clothing style. To achieve this, we define semantic IDs (SIDs) by combining attribute labels, and use a semantic guidance loss to align the person representations with the prototypical features of corresponding SIDs, encouraging the representations to encode the relevant semantics. Simultaneously, we enforce the representations of the same person to be embedded closely, enabling recognizing subtle differences in appearance to discriminate persons sharing the same attribute labels. To increase the generalization ability on unseen data, we also propose a regularization method that takes advantage of the relationships between SID prototypes. Our framework performs individual comparisons of local and global person representations between query and gallery images for attribute-based reID. By exploiting the SID prototypes aligned with the corresponding representations, it can also perform person attribute recognition (PAR) and attribute-based person search (APS) without bells and whistles. Experimental results on standard benchmarks on attribute-based person reID, Market-1501 and DukeMTMC, demonstrate the superiority of our model compared to the state of the art.
Quantum All-Subkeys-Recovery Attacks on 6-round Feistel-2* Structure Based on Multi-Equations Quantum Claw Finding
Creators: name: Liu, Wenjie
name: Wang, Mengting
name: Li, Zixian
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: Emerging Technologies (cs.ET)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Exploiting quantum mechanisms, quantum attacks have the potential ability to break the cipher structure. Recently, Ito et al. proposed a quantum attack on Feistel-2* structure (Ito et al.'s attack) based onthe Q2 model. However, it is not realistic since the quantum oracle needs to be accessed by the adversary, and the data complexityis high. To solve this problem, a quantum all-subkeys-recovery (ASR) attack based on multi-equations quantum claw-finding is proposed, which takes a more realistic model, the Q1 model, as the scenario, and only requires 3 plain-ciphertext pairs to quickly crack the 6-round Feistel-2* structure. First, we proposed a multi-equations quantum claw-finding algorithm to solve the claw problem of finding multiple equations. In addition, Grover's algorithm is used to speedup the rest subkeys recovery. Compared with Ito et al.'s attack, the data complexity of our attack is reduced from O(2^n) to O(1), while the time complexity and memory complexity are also significantly reduced.
description: 18 pages, 4 figures
Erica tetralix L.
Creators: name: Info Flora
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Plantae
Tracheophyta
Magnoliopsida
Ericales
Ericaceae
Erica
Erica tetralix

description: Erica tetralix L.
Glockenheide
Art ISFS: 152600 Checklist: 1017420 Ericaceae Erica Erica tetralix L.
Zusammenfassung
Artbeschreibung (nach Lauber & al. 2018): Sträuchlein mit bis 30 cm hohen Zweigen. Blätter nadelförmig, immergrün, meist zu 4 quirlständig, 6-10 mm lang. Stängel, Blätter und Kelch mit abstehenden weissen Haaren. Blütenstand kopfig, 5-15 blütig, Krone rosa, 6-8 mm lang, ca. 3mal so lang wie die Kelchblätter, Staubbeutel die Krone nicht überragend. Blütenstiele höchstens so lang wie die Blüten. Frucht bleibt in der Krone eingeschlossen. Vgl. E. carnea, Nr. 1323.
Blütezeit (nach Lauber & al. 2018): 7
Standort und Verbreitung in der Schweiz (nach Lauber & al. 2018): Torfmoore / montan / BE, LU (Entlebuch), SG, im 20. Jahrhundert eingeführt
Verbreitung global (nach Lauber & al. 2018): Westeuropäisch
Ökologische Zeigerwerte (nach Landolt & al. 2010) 4w11-431.z.2n=24
Ökologie
Lebensform Verholzter Chamaephyt
Lebensraum Lebensraumnach Delarze & al. 2015
2.4.1 - Offene Hochmoore (Sphagnion magellanici)
fett Dominante Art, welche das Aussehen des Lebensraumes mitprägt Charakterart Weniger strikt an den Lebensraum gebundene Art
Ökologische Zeigerwerte nach Landolt & al. (2010)
BodenfaktorenKlimafaktorenSalztoleranzFeuchtezahl Fsehr feucht; Feuchtigkeit mässig wechselnd (± 1-2 Stufen)Lichtzahl LhellSalzzeichen--Reaktionszahl Rstark sauer (pH 2.5-5.5)Temperaturzahl Tmontan (Wälder mit Buche, Weisstanne, in den Zentralalpen mit Waldföhre)Nährstoffzahl Nsehr nährstoffarmKontinentalitätszahl Kozeanisch (sehr hohe Luftfeuchtigkeit, sehr geringe Temperaturschwankungen, milde Winter)
Nomenklatur
Gültiger Name (Checklist 2017):Erica tetralixL.
Volksname Deutscher Name: Glockenheide Nom français: Bruyère à quatre angles Nome italiano: Erica a quattro angoli
Übereinstimmung mit anderen Referenzwerken
RelationNomReferenzwerkeNo=Erica tetralix L.Checklist 2017152600=Erica tetralix L.Flora Helvetica 2001797=Erica tetralix L.Flora Helvetica 20121325=Erica tetralix L.Flora Helvetica 20181325=Erica tetralix L.Index synonymique 1996152600=Erica tetralix L.Landolt 19772273=Erica tetralix L.Landolt 19911849=Erica tetralix L.SISF/ISFS 2152600=Erica tetralix L.Welten & Sutter 19821215
= Taxon stimmt mit akzeptiertem Taxon überein (Checklist 2017)  Taxon enthält (neben anderen) auch das akzeptierte Taxon (Checklist 2017)
Status Indigenat: Neophyt: nach der Entdeckung von Amerika in der Region aufgetreten (nach 1500)
Liste der gefährdeten Pflanzen IUCN(nach Walter & Gillett 1997): Nein
description: Published as part of Info Flora, 2021,
Quantum Privacy-Preserving Price E-Negotiation
Creators: name: Liu, Wen-Jie
name: Li, Chun-Tang
name: Zheng, Yu
name: Xu, Yong
name: Xu, Yin-Song
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: Emerging Technologies (cs.ET)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Privacy-preserving price e-negotiation (3PEN) is an important topic of secure multi-party computation (SMC) in the electronic commerce field, and the key point of its security is to guarantee the privacy of seller's and buyer's prices. In this study, a novel and efficient quantum solution to the 3PEN problem is proposed, where the oracle operation and the qubit comparator are utilized to obtain the comparative results of buyer's and seller's prices, and then quantum counting is executed to summarize the total number of products which meets the trading conditions. Analysis shows that our solution not only guarantees the correctness and the privacy of 3PEN, but also has lower communication complexity than those classical ones.
description: 13 pages, 6 figures
Ophiomyxidae
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Ophiomyxidae

description: Family: Ophiomyxidae
Ophiomyxa pentagona (Lamarck, 1816)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 105, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation
Creators: name: Liu, Wenjie
name: Xu, Yinsong
name: Liu, Wen
name: Wang, Haibin
name: Lei, Zhibin
Publisher: name: arXiv
Year: 2023
Subjects: subject: Emerging Technologies (cs.ET)
subject: Cryptography and Security (cs.CR)
subject: Quantum Physics (quant-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences

description: Searchable encryption (SE) is a positive way to protect users sensitive data in cloud computing setting, while preserving search ability on the server side, i.e., it allows the server to search encrypted data without leaking information about the plaintext data. In this paper, a multi-client universal circuit-based full-blind quantum computation (FBQC) model is proposed. In order to meet the requirements of multi-client accessing or computing encrypted cloud data, all clients with limited quantum ability outsource the key generation to a trusted key center and upload their encrypted data to the data center. Considering the feasibility of physical implementation, all quantum gates in the circuit are replaced with the combination of π/8 rotation operator set {Rz(π/4), Ry(π/4), CRz(π/4), CRy(π/4), CCRz(π/4), CCRy(π/4)}. In addition, the data center is only allowed to perform one π/8 rotation operator each time, but does not know the structure of the circuit (i.e., quantum computation), so it can guarantee the blindness of computation. Then, through combining this multi-client FBQC model and Grover searching algorithm, we continue to propose a quantum searchable encryption scheme for cloud data. It solves the problem of multi-client access mode under searchable encryption in the cloud environment, and has the ability to resist against some quantum attacks. To better demonstrate our scheme, an example of our scheme to search on encrypted 2-qubit state is given in detail. Furthermore, the security of our scheme is analysed from two aspects: external attacks and internal attacks, and the result indicates that it can resist against such kinds of attacks and also guarantee the blindness of data and computation.
description: 20 pages, 13 figures
An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
Creators: name: Liu, Wenjie
name: Wu, Qingshan
name: Shen, Jiahao
name: Zhao, Jiaojiao
name: Zidan, Mohammed
name: Tong, Lian
Publisher: name: arXiv
Year: 2023
Subjects: subject: Emerging Technologies (cs.ET)
subject: Data Structures and Algorithms (cs.DS)
subject: Quantum Physics (quant-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences

description: Finding a minimum is an essential part of mathematical models, and it plays an important role in some optimization problems. Durr and Hoyer proposed a quantum searching algorithm (DHA), with a certain probability of success, to achieve quadratic speed than classical ones. In this paper, we propose an optimized quantum minimum searching algorithm with sure-success probability, which utilizes Grover-Long searching to implement the optimal exact searching, and the dynamic strategy to reduce the iterations of our algorithm. Besides, we optimize the oracle circuit to reduce the number of gates by the simplified rules. The performance evaluation including the theoretical success rate and computational complexity shows that our algorithm has higher accuracy and efficiency than DHA algorithm. Finally, a simulation experiment based on Cirq is performed to verify its feasibility.
description: 15 pages, 8 figures. arXiv admin note: text overlap with arXiv:1908.07943 by other authors
Ophiotrichidae Ljungman 1867
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Ophiotrichidae

description: Family: Ophiotrichidae
Ophiothrix fragilis (Abildgaard in O.F. Müller, 1789) Ophiothrix quinquemaculata (Delle Chiaje, 1828)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Ophiuridae
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Ophiuroidea
Ophiurida
Ophiuridae

description: Family: Ophiuridae
Ophiura albida Forbes, 1839
Ophiura grubei Heller, 1863
Ophiura ophiura (Linnaeus, 1758)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Open access library of aeronautical Al alloys - Deliverable D2.3
Creators: name: Brunet Magali
Publisher: name: Zenodo
Year: 2023
Subjects: PROCRAFT
Cultural Heritage
Aircraft
Archaeology
WWII
Aluminium Alloy
Duralumin
Aviation Archaeology

description: The deliverable reports on the recording of valuable information, i.e. data collected during the PROCRAFT project, in relation with the task 2.4 of WP2: «Library of reference of Al alloys used in WWII aeronautics») and the deposit of the data into an open-access online repository.
Latin Majuscule Writing with inclined axis in Herculaneum papyri
Creators: name: Marichal, Robert
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2015

description: vue 48
description: "Study of the following Latin papyri: P.Herc. 78, 217, 219, 279, 395, 396, 506, 525, 1208 (cornice 2), 1763. All papyri are listed on the cover page of the main folder; some papyri are marked with the word 'micro' written with a different (pink) ink ; the indication 'Vu 58' is written at the bottom of the list (same ink), and a bibliographical reference is quoted in relation to P.Herc. 217"
description: Source: 4MAR_9_2_5-14
description: Relation: 4MAR_42_4-5
description: created: n.d., 1957
GENEX Project – Overview and Composite Repair related Innovations
Creators: name: Calvo-Echenique, Andrea
Publisher: name: Zenodo
Year: 2024

description: The GENEX project was featured at the Composite Repair Seminar & Experts Forum for MRO 2024, held at Republic Polytechnic in Singapore on September 24. GMI AERO, a proud beneficiary of GENEX, was one of the key organizers of the seminar. Andrea Calvo-Echenique (ITA), the coordinator of the GENEX EU Project, presented the technical progress of the project. The event was organized by the Singapore Institute of Aerospace Engineers (SIAE), Alexander Melchers BBM, Republic Polytechnic, and GMI AERO. A dedicated article about the event was published in CompositesWorld magazine.
Infeasibility of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state
Creators: name: Liu, Wenjie
name: Li, Zixian
name: Yuan, Gonglin
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Data Structures and Algorithms (cs.DS)
subject: Emerging Technologies (cs.ET)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: In this paper, we present a polynomial-complexity algorithm to construct a special orthogonal matrix for the deterministic remote state preparation (DRSP) of an arbitrary n-qubit state, and prove that if n>3, such matrices do not exist. Firstly, the construction problem is split into two sub-problems, i.e., finding a solution of a semi-orthogonal matrix and generating all semi-orthogonal matrices. Through giving the definitions and properties of the matching operators, it is proved that the orthogonality of a special matrix is equivalent to the cooperation of multiple matching operators, and then the construction problem is reduced to the problem of solving an XOR linear equation system, which reduces the construction complexity from exponential to polynomial level. Having proved that each semi-orthogonal matrix can be simplified into a unique form, we use the proposed algorithm to confirm that the unique form does not have any solution when n>3, which means it is infeasible to construct such a special orthogonal matrix for the DRSP of an arbitrary n-qubit state.
description: 31 figures
A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets
Creators: name: Liu, Wenjie
name: Gao, Peipei
name: Wang, Yuxiang
name: Yu, Wenbin
name: Zhang, Maojun
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Artificial Intelligence (cs.AI)
subject: Emerging Technologies (cs.ET)
subject: Machine Learning (cs.LG)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: In order to solve the problem of non-ideal training sets (i.e., the less-complete or over-complete sets) and implement one-iteration learning, a novel efficient quantum perceptron algorithm based on unitary weights is proposed, where the singular value decomposition of the total weight matrix from the training set is calculated to make the weight matrix to be unitary. The example validation of quantum gates {H, S, T, CNOT, Toffoli, Fredkin} shows that our algorithm can accurately implement arbitrary quantum gates within one iteration. The performance comparison between our algorithm and other quantum perceptron algorithms demonstrates the advantages of our algorithm in terms of applicability, accuracy, and availability. For further validating the applicability of our algorithm, a quantum composite gate which consists of several basic quantum gates is also illustrated.
description: 12 pages, 5 figures
GOUT AND ITS ASSOCIATION WITH BIOCHEMICAL MARKERS
Creators: name: Rakhmatov, A.M.
Publisher: name: Zenodo
Year: 2024

description: Gout is a chronic metabolic disorder that arises due to persistent hyperuricemia, a condition where uric acid levels in the blood are abnormally elevated. This leads to the deposition of monosodium urate crystals in tissues and joints, causing acute and chronic inflammation. While the condition is primarily recognized for its impact on joints, it can also result in systemic complications, including gouty nephropathy—a form of kidney dysfunction caused by the prolonged accumulation of uric acid crystals in the renal tubules.
Poupard, Paul, Wozu ein Papst? Von Petrus zu Johannes Paul II., Paderborn 1982
Creators: name: Henseler, Rudolf
Publisher: name: Ordenskorrespondenz
Year: 1970

description: Ordenskorrespondenz, Bd. 23 (1982): Ordenskorrespondenz: Zeitschrift für Fragen des Ordenslebens, Band 23
Catalogo chronologico, historico, genealogico e critico das rainhas de Portugal e seris philos...
Creators: name: Barbosa, José
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2020

description: Source: Bibliothèque patrimoniale Villon (Rouen), fonds Liber, Mt g 189
Arbaciidae Gray 1855
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Echinoidea
Arbacioida
Arbaciidae

description: Family: Arbaciidae
Arbacia lixula (Linnaeus, 1758)
Arbaciella elegans Mortensen, 1910
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Quantum forgery attacks on COPA,AES-COPA and marble authenticated encryption algorithms
Creators: name: Xu, Yinsong
name: Liu, Wenjie
name: Yu, Wenbin
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: Emerging Technologies (cs.ET)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: The classic forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms need to query about 2^(n/2) times, and their success probability is not high. To solve this problem, the corresponding quantum forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms are presented. In the quantum forgery attacks on COPA and AES-COPA, we use Simon's algorithm to find the period of the tag generation function in COPA and AES-COPA by querying in superposition, and then generate a forged tag for a new message. In the quantum forgery attack on Marble, Simon's algorithm is used to recover the secret parameter L, and the forged tag can be computed with L. Compared with classic forgery attacks on COPA, AES-COPA and Marble, our attack can reduce the number of queries from O(2^(n/2)) to O(n) and improve success probability close to 100%.
description: 21 pages, 11 figures
MUVAFFAQIYATGA ERISHISHNING ILMIY ASOSLARI
Creators: name: Rahmiddinova, Mohinur
Publisher: name: Zenodo
Year: 2024

description: Muvaffaqiyat inson hayotining ajralmas qismi bo‘lib, har bir kishi uni o‘z hayotida erishilishi lozim bo‘lgan maqsad sifatida ko‘radi. Ammo muvaffaqiyatning ta'rifi har bir shaxs uchun turlicha bo‘lishi mumkin. Kimdir uchun bu moddiy boylik, boshqalar uchun esa ma'naviy o‘sish yoki jamiyatga foyda keltirishdir. Ushbu maqolaning asosiy maqsadi – muvaffaqiyatga erishishning ilmiy asoslarini yoritish va unga erishishda ta'sir ko‘rsatadigan omillarni tadqiq qilishdir.
Report on the characterisation of collected materials on historical aircraft - Deliverable D2.2
Creators: name: Brunet Magali
Publisher: name: Zenodo
Year: 2023
Subjects: PROCRAFT
Cultural Heritage
Aircraft
Archaeology
WWII
Aluminium Alloy
Duralumin
Corrosion
Aviation Archaeology

description: The present deliverable reports on the study of reference wrecks and their constituent materials carried out in Tasks 2.1 and 2.2 of WP2. It aims at characterizing materials collected on selected aircraft/wrecks including the study of the metallic Al alloys, their original protective coatings and their alteration (mainly corrosion).
Secure and Efficient Two-party Quantum Scalar Product Protocol With Application to Privacy-preserving Matrix Multiplication
Creators: name: Liu, Wen-Jie
name: Li, Zi-Xian
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: Emerging Technologies (cs.ET)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Secure two-party scalar product (S2SP) is a promising research area within secure multiparty computation (SMC), which can solve a range of SMC problems, such as intrusion detection, data analysis, and geometric computations. However, existing quantum S2SP protocols are not efficient enough, and the complexity is usually close to exponential level. In this paper, a novel secure two-party quantum scalar product (S2QSP) protocol based on Fourier entangled states is proposed to achieve higher efficiency. Firstly, the definition of unconditional security under malicious models is given. And then, an honesty verification method called Entanglement Bondage is proposed, which is used in conjunction with the modular summation gate to resist malicious attacks. The property of Fourier entangled states is used to calculate the scalar product with polynomial complexity. The unconditional security of our protocol is proved, which guarantees the privacy of all parties. In addition, we design a privacy-preserving quantum matrix multiplication protocol based on S2QSP protocol. By transforming matrix multiplication into a series of scalar product processes, the product of two private matrices is calculated without revealing any privacy. Finally, we show our protocol's feasibility in IBM Qiskit simulator.
description: 15 pages, 4 figures
Echinidae J.E. Gray 1825
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Echinoidea
Camarodonta
Echinidae

description: Family: Echinidae
Echinus melo Lamarck, 1816
Gracilechinus acutus (Lamarck, 1816)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
A Quantum States Preparation Method Based on Difference-Driven Reinforcement Learning
Creators: name: Liu, Wenjie
name: Xu, Jing
name: Wang, Bosi
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Artificial Intelligence (cs.AI)
subject: Emerging Technologies (cs.ET)
subject: Machine Learning (cs.LG)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Due to the large state space of the two-qubit system, and the adoption of ladder reward function in the existing quantum state preparation methods, the convergence speed is slow and it is difficult to prepare the desired target quantum state with high fidelity under limited conditions. To solve the above problems, a difference-driven reinforcement learning (RL) algorithm for quantum state preparation of two-qubit system is proposed by improving the reward function and action selection strategy. Firstly, a model is constructed for the problem of preparing quantum states of a two-qubit system, with restrictions on the type of quantum gates and the time for quantum state evolution. In the preparation process, a weighted differential dynamic reward function is designed to assist the algorithm quickly obtain the maximum expected cumulative reward. Then, an adaptive e-greedy action selection strategy is adopted to achieve a balance between exploration and utilization to a certain extent, thereby improving the fidelity of the final quantum state. The simulation results show that the proposed algorithm can prepare quantum state with high fidelity under limited conditions. Compared with other algorithms, it has different degrees of improvement in convergence speed and fidelity of the final quantum state.
description: 12 pages, 9 figures
Quantum Privacy-preserving Two-party Circle Intersection Protocol Based on Phase-encoded Query
Creators: name: Li, Zi-Xian
name: Yang, Qi
name: Feng, Bao
name: Liu, Wen-Jie
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: Cryptography and Security (cs.CR)
subject: Emerging Technologies (cs.ET)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: Privacy-preserving geometric intersection (PGI) is an important issue in Secure multiparty computation (SMC). The existing quantum PGI protocols are mainly based on grid coding, which requires a lot of computational complexity. The phase-encoded query method which has been used in some Quantum SMC protocols is suitable to solve the decision problem, but it needs to apply high dimensional Oracle operators. In this paper, we use the principle of phase-encoded query to solve an important PGI problem, namely privacy-preserving two-party circle intersection. We study the implementation of Oracle operator in detail, and achieve polynomial computational complexity by decompsing it into quantum arithmetic operations. Performance analysis shows that our protocol is correct and efficient, and can protect the privacy of all participants against internal and external attacks.
description: 16 pages, 2 figures
A hybrid quantum-classical conditional generative adversarial network algorithm for human-centered paradigm in cloud
Creators: name: Liu, Wenjie
name: Zhang, Ying
name: Deng, Zhiliang
name: Zhao, Jiaojiao
name: Tong, Lian
Publisher: name: arXiv
Year: 2023
Subjects: subject: Machine Learning (cs.LG)
subject: Emerging Technologies (cs.ET)
subject: Quantum Physics (quant-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences

description: As an emerging field that aims to bridge the gap between human activities and computing systems, human-centered computing (HCC) in cloud, edge, fog has had a huge impact on the artificial intelligence algorithms. The quantum generative adversarial network (QGAN) is considered to be one of the quantum machine learning algorithms with great application prospects, which also should be improved to conform to the human-centered paradigm. The generation process of QGAN is relatively random and the generated model does not conform to the human-centered concept, so it is not quite suitable for real scenarios. In order to solve these problems, a hybrid quantum-classical conditional generative adversarial network (QCGAN) algorithm is proposed, which is a knowledge-driven human-computer interaction computing mode that can be implemented in cloud. The purposes of stabilizing the generation process and realizing the interaction between human and computing process are achieved by inputting artificial conditional information in the generator and discriminator. The generator uses the parameterized quantum circuit with an all-to-all connected topology, which facilitates the tuning of network parameters during the training process. The discriminator uses the classical neural network, which effectively avoids the "input bottleneck" of quantum machine learning. Finally, the BAS training set is selected to conduct experiment on the quantum cloud computing platform. The result shows that the QCGAN algorithm can effectively converge to the Nash equilibrium point after training and perform human-centered classification generation tasks.
description: 17 pages, 9 figures
Parechinidae Mortensen 1903
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Echinoidea
Camarodonta
Parechinidae

description: Family: Parechinidae
Paracentrotus lividus (Lamarck, 1816)
Psammechinus microtuberculatus (Blainville, 1825)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Milla_Villena_fiche38
Creators: name: Milla Villena, Carlos
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2021

description: Carlos Milla Villena, Inventario de un Desierto. Prospección, Inventario y Catastro Arqueológico del Desierto de Sechura y el Bajo Piura, Pontificia Universidad Católica del Perú, Lima, 1989.
title: Cursive script
title: Cursive
titleType: AlternativeTitle
title: Zabūr
titleType: AlternativeTitle
Creators: name: :Unkn
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2024
Subjects: Cursive script
Arabia
Pre-Islamic period
Script
Epigraphy
Inscription

description: s.n. 2023. "Cursive script". Thematic Dictionary of Ancient Arabia. Online edition 2023.
description: s.n. 2023. "Cursive script". Thematic Dictionary of Ancient Arabia. Online edition 2023.
Toxopneustidae Troschel 1872
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Echinoidea
Camarodonta
Toxopneustidae

description: Family: Toxopneustidae
Sphaerechinus granularis (Lamarck, 1816)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Selected wrecks and report on their condition state - Deliverable D2.1
Creators: name: Brunet Magali
Publisher: name: Zenodo
Year: 2023
Subjects: PROCRAFT
Cultural Heritage
Aircraft
Archaeology
WWII
Aluminium alloy
Duralumin
Corrosion
Aviation Archaeology

description: This deliverable is written to report on the work carried out in Task 2.1 of WP2 (Wrecks), which concerns the identification and selection of WWII aircraft wrecks (corpus), their constituent materials and their main conservation problems.
Quantum-Based Feature Selection for Multi-classification Problem in Complex Systems with Edge Computing
Creators: name: Liu, Wenjie
name: Chen, Junxiu
name: Wang, Yuxiang
name: Gao, Peipei
name: Lei, Zhibin
name: Ma, Xu
Publisher: name: arXiv
Year: 2023
Subjects: subject: Machine Learning (cs.LG)
subject: Artificial Intelligence (cs.AI)
subject: Emerging Technologies (cs.ET)
subject: Quantum Physics (quant-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences

description: The complex systems with edge computing require a huge amount of multi-feature data to extract appropriate insights for their decision making, so it is important to find a feasible feature selection method to improve the computational efficiency and save the resource consumption. In this paper, a quantum-based feature selection algorithm for the multi-classification problem, namely, QReliefF, is proposed, which can effectively reduce the complexity of algorithm and improve its computational efficiency. First, all features of each sample are encoded into a quantum state by performing operations CMP and R_y, and then the amplitude estimation is applied to calculate the similarity between any two quantum states (i.e., two samples). According to the similarities, the Grover-Long method is utilized to find the nearest k neighbor samples, and then the weight vector is updated. After a certain number of iterations through the above process, the desired features can be selected with regards to the final weight vector and the threshold τ. Compared with the classical ReliefF algorithm, our algorithm reduces the complexity of similarity calculation from O(MN) to O(M), the complexity of finding the nearest neighbor from O(M) to O(sqrt(M)), and resource consumption from O(MN) to O(MlogN). Meanwhile, compared with the quantum Relief algorithm, our algorithm is superior in finding the nearest neighbor, reducing the complexity from O(M) to O(sqrt(M)). Finally, in order to verify the feasibility of our algorithm, a simulation experiment based on Rigetti with a simple example is performed.
description: 22 pages, 11 figures
Trigonocidaridae Mortensen 1903
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Echinoidea
Camarodonta
Trigonocidaridae

description: Family: Trigonocidaridae
Genocidaris maculata A. Agassiz, 1869
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560
Cidaridae Gray 1825
Creators: name: Despalatović, Marija
name: Cvitković, Ivan
name: Žuljević, Ante
Publisher: name: Zenodo
Year: 2017
Subjects: Biodiversity
Taxonomy
Animalia
Echinodermata
Echinoidea
Cidaroida
Cidaridae

description: Family: Cidaridae
Cidaris cidaris (Linnaeus, 1758)
Stylocidaris affinis (Philippi, 1845)
description: Published as part of Despalatović, Marija, Cvitković, Ivan & Žuljević, Ante, 2017, Checklist of the echinoderm fauna of the Adriatic Sea, pp. 101-116 in Zootaxa 4353 (1) on page 106, DOI: 10.11646/zootaxa.4353.1.6, http://zenodo.org/record/1064560