作者: assent 時間: 2025-3-21 20:39 作者: Expand 時間: 2025-3-22 01:09 作者: 知道 時間: 2025-3-22 08:28
Learning Multi-class Theories in ILPhnique when dealing with multi-class domains. We show that we can learn a simple, consistent and reliable multi-class theory by combining the rules of the multiple one-vs-rest theories into one rule list or set. We experimentally show that our proposed methods produce coherent and accurate rule mode作者: disparage 時間: 2025-3-22 09:29
A Numerical Refinement Operator Based on Multi-Instance Learningis delegated to statistical multi-instance learning schemes. To each clause, there is an associated multi-instance classification model with the numerical variables of the clause as input. Clauses are built in a greedy manner, where each refinement adds new numerical variables which are used additio作者: 勤勞 時間: 2025-3-22 14:34
Not Far Away from Home: A Relational Distance-Based Approach to Understanding Images of Housesation. In this paper we tackle the problem of delimiting conceptual elements of street views based on . between lower-level components, e.g. the element ‘house’ is composed of windows and a door in a spatial arrangement. We use structured data: each concept can be seen as a graph representing spatia作者: Esalate 時間: 2025-3-22 18:30 作者: Jargon 時間: 2025-3-22 21:33
Approximate Bayesian Computation for the Parameters of PRISM Programs learning hard, even when structure is fixed and learning reduces to parameter estimation. In this paper an approximate Bayesian computation (ABC) method is presented which computes approximations to the posterior distribution over PRISM parameters. The key to ABC approaches is that the likelihood f作者: entreat 時間: 2025-3-23 01:37 作者: fledged 時間: 2025-3-23 05:40 作者: Matrimony 時間: 2025-3-23 12:42 作者: 皮薩 時間: 2025-3-23 17:17
Extending ProbLog with Continuous Distributionscify continuous distributions and that we show how ProbLog’s exact inference mechanism can be modified to cope with such distributions. The resulting inference engine combines an interval calculus with a dynamic discretization algorithm into an effective solver.作者: Cholecystokinin 時間: 2025-3-23 18:31
Multivariate Prediction for Learning on the Semantic Webe entities and almost nothing might be known for others. A popular example is the well known friend-of-a-friend data set where some members document exhaustive private and social information whereas, for privacy concerns and other reasons, almost nothing is known for other members. Although deductiv作者: Engulf 時間: 2025-3-23 23:23 作者: induct 時間: 2025-3-24 05:58 作者: 致詞 時間: 2025-3-24 09:48
BET : An Inductive Logic Programming Workbenchformat for the input data. This makes it very tedious and time consuming on the part of a user to utilize such a system for experimental purposes as it demands a thorough understanding of that system and its input specification. In the spirit of Weka [1], we present a relational learning workbench c作者: CANT 時間: 2025-3-24 12:47 作者: 劇本 時間: 2025-3-24 16:54 作者: 輪流 時間: 2025-3-24 19:08
Variation of Background Knowledge in an Industrial Application of ILPtworks. In the present paper we describe two new applications of this type in the area of plant biology. These applications are of particular interest to the agrochemical industry in which improvements in plant strains can have benefits for modelling crop development. The background knowledge in the作者: Bridle 時間: 2025-3-25 00:32
d other users, allowing sharees also to perform searches. We introduce the concept of a ., an extension of Multi-Key Searchable Encryption (NSDI ’14), that supports dynamic sharing and unsharing of documents amongst users. We also strengthen the security notion by considering a simulation-based noti作者: larder 時間: 2025-3-25 06:20 作者: overrule 時間: 2025-3-25 11:30 作者: BRIBE 時間: 2025-3-25 12:39
David Pooleof critical national infrastructure, where asset owners may not understand the security landscape and have potentially incorrect security assumptions for these closed source, operational technology (OT) systems. ICS vulnerability reports give useful information about single vulnerabilities, but ther作者: 付出 時間: 2025-3-25 19:46
Tarek Abudawood,Peter A. Flachhysical Systems, CyberICPS 2020, the Second International Workshop on Security and Privacy Requirements Engineering, SECPRE 2020, and the Third International Workshop on Attacks and Defenses for Internet-of-Things, ADIoT 2020, held in Guildford, UK, in September 2020 in conjunction with the 25th Eur作者: palpitate 時間: 2025-3-25 22:50
Erick Alphonse,Tobias Girschick,Fabian Buchwald,Stefan Krameras. However, the increasing prevalence of cyber attacks targeting them poses a growing security concern. In particular, attacks exploiting memory-safety vulnerabilities constitute a major attack vector against CPS, because embedded systems often rely on unsafe but fast programming languages to meet 作者: 宇宙你 時間: 2025-3-26 01:29
Laura Antanas,Martijn van Otterlo,José Oramas M.,Tinne Tuytelaars,Luc De Raedtominantly used to this aim. This technique aims towards maximizing completeness of discovered threats and leads to discovering a large number of threats. Many of them are eventually ranked with the lowest importance during the prioritization process, which takes place . the threat elicitation. While作者: aggravate 時間: 2025-3-26 06:20
Stefano Bragaglia,Fabrizio Riguzzinomaly detection based on meta–data (message sizes, timing, command sequence), or on the state values of the physical process. In this work we present a class of semantic network-based attacks against SCADA systems that are undetectable by the above mentioned anomaly detection. After hijacking the c作者: BOLUS 時間: 2025-3-26 09:24
James Cussensominantly used to this aim. This technique aims towards maximizing completeness of discovered threats and leads to discovering a large number of threats. Many of them are eventually ranked with the lowest importance during the prioritization process, which takes place . the threat elicitation. While作者: 狗窩 時間: 2025-3-26 16:24 作者: 刺耳的聲音 時間: 2025-3-26 20:24
Nuno A. Fonseca,Max Pereira,Vítor Santos Costa,Rui Camachoominantly used to this aim. This technique aims towards maximizing completeness of discovered threats and leads to discovering a large number of threats. Many of them are eventually ranked with the lowest importance during the prioritization process, which takes place . the threat elicitation. While作者: DAFT 時間: 2025-3-27 00:18 作者: Mindfulness 時間: 2025-3-27 03:18 作者: Constant 時間: 2025-3-27 09:02
Yi Huang,Volker Tresp,Markus Bundschus,Achim Rettinger,Hans-Peter Kriegelce is giving rise to a new generation of targeted malware characterized by a more situational awareness, in which decisions are made on the basis of factors such as the device location, the user profile, or the presence of other apps. This complicates behavioral detection, as the analyst must reprod作者: WAX 時間: 2025-3-27 10:36 作者: 夜晚 時間: 2025-3-27 13:55 作者: 不如屎殼郎 時間: 2025-3-27 21:45
Srihari Kalgi,Chirag Gosar,Prasad Gawde,Ganesh Ramakrishnan,Kekin Gada,Chander Iyer,T. V. S Kiran,Asal users to anonymously sign messages on behalf of a group of users. In ring signatures, the group, i.e. the ring, is chosen in an ad hoc manner by the signer. In group signatures, group membership is controlled by a group manager. Group signatures additionally enforce accountability by providing th作者: 敲竹杠 時間: 2025-3-28 00:52
Ond?ej Ku?elka,Filip ?eleznye literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size作者: 附錄 時間: 2025-3-28 05:20 作者: 口音在加重 時間: 2025-3-28 08:59
Stephen H. Muggleton,Jianzhong Chen,Hiroaki Watanabe,Stuart J. Dunbar,Charles Baxter,Richard Currie,s, typically by scanning a database of records for a close enough match. In this work, we investigate the privacy-preserving biometric identification outsourcing problem, where the database owner outsources both the large-scale encrypted database and the computationally intensive identification job 作者: liaison 時間: 2025-3-28 14:07 作者: CHECK 時間: 2025-3-28 16:08
Michael Kifer network communication. Due to the properties and requirements of smart grid, finding a suitable authentication scheme can be a challenging task. In this paper, we survey different cryptographic-based authentication schemes adopted in smart grids, including both traditional authentication schemes an作者: ABOUT 時間: 2025-3-28 19:55 作者: 機(jī)制 時間: 2025-3-29 02:52
David Poolelities they may find in their systems and the best ways to detect them. We validate our proposed vulnerability categories by analysing a further 6?months of ICS Advisory reports, which shows that our categories continue to dominate the reported weaknesses. We further validate our proposed detection 作者: 亞當(dāng)心理陰影 時間: 2025-3-29 05:06 作者: GRATE 時間: 2025-3-29 07:22 作者: 平淡而無味 時間: 2025-3-29 11:54
Laura Antanas,Martijn van Otterlo,José Oramas M.,Tinne Tuytelaars,Luc De Raedt a risk-first, end-to-end asset analysis. Our approach enriches the architectural model used during the threat analysis, with a particular focus on representing security assumptions and constraints about the solution space. This richer set of information is leveraged during the architectural threat 作者: 錯 時間: 2025-3-29 17:25 作者: crease 時間: 2025-3-29 23:02
James Cussens a risk-first, end-to-end asset analysis. Our approach enriches the architectural model used during the threat analysis, with a particular focus on representing security assumptions and constraints about the solution space. This richer set of information is leveraged during the architectural threat 作者: Lethargic 時間: 2025-3-30 01:59
Luc De Raedt,Ingo Thonctions. The attacks are totaly stealthy because the message sizes and timing, the command sequences, and the data values of the ICS’s state all remain legitimate..We implemented and tested several attack scenarios in the test lab of our local electric company, against a real HMI and real PLCs, separ作者: cumber 時間: 2025-3-30 08:08
Nuno A. Fonseca,Max Pereira,Vítor Santos Costa,Rui Camacho a risk-first, end-to-end asset analysis. Our approach enriches the architectural model used during the threat analysis, with a particular focus on representing security assumptions and constraints about the solution space. This richer set of information is leveraged during the architectural threat 作者: 芳香一點(diǎn) 時間: 2025-3-30 09:20 作者: theta-waves 時間: 2025-3-30 13:38
Bernd Gutmann,Manfred Jaeger,Luc De Raedterifying parties to confirm that given user credentials (i.e. OTP-keyed MACs) correspond to claimed hashed transaction details. Hashing transaction details increases user privacy. Each OTP is generated from a PIN-encrypted non-verifiable key; this makes users’ devices resilient to off-line PIN-guess作者: 機(jī)密 時間: 2025-3-30 19:52
Yi Huang,Volker Tresp,Markus Bundschus,Achim Rettinger,Hans-Peter Kriegelr-law distribution: a fact that facilitates an efficient generation of automatic testing patterns tailored for individual users, when done in conjunction with a cloud infrastructure supporting device cloning and parallel testing. We report empirical results with various representative case studies, 作者: 陶器 時間: 2025-3-30 21:34 作者: agglomerate 時間: 2025-3-31 03:54 作者: 減弱不好 時間: 2025-3-31 06:58
Srihari Kalgi,Chirag Gosar,Prasad Gawde,Ganesh Ramakrishnan,Kekin Gada,Chander Iyer,T. V. S Kiran,Asormal security model for the primitive. Our model offers strong security definitions incorporating protection against maliciously chosen keys and at the same time flexibility both in the choice of the ring and the opener. We give a generic construction using standard tools. We give a highly efficien作者: 籠子 時間: 2025-3-31 10:04
Ond?ej Ku?elka,Filip ?eleznyystem model called . revocable IBE. In our model, almost all of the workloads on users are delegated to an . server which manages users’ public keys and key updates sent by a KGC periodically. The server is untrusted in the sense that it does not possess any secret information. Our system model requ作者: Brain-Imaging 時間: 2025-3-31 15:34
Matthieu Lopez,Lionel Martin,Christel Vrainand proving at the expense of longer verification. This could be useful in apations where outsourcing files is usually done by low-power client and verifications can be done by well equipped machines (e.g.,?a third party server). We also show that the proposed scheme can support dynamic updates. At 作者: floaters 時間: 2025-3-31 19:43 作者: MERIT 時間: 2025-3-31 22:32 作者: 小平面 時間: 2025-4-1 04:14 作者: 值得尊敬 時間: 2025-4-1 08:14 作者: Pandemic 時間: 2025-4-1 13:51 作者: Glaci冰 時間: 2025-4-1 15:02 作者: 磨碎 時間: 2025-4-1 22:31
https://doi.org/10.1007/978-3-642-21295-6algorithmic learning; approximate inference; computational learning; data mining; probabilistic programm
