標(biāo)題: Titlebook: Language and Automata Theory and Applications; 6th International Co Adrian-Horia Dediu,Carlos Martín-Vide Conference proceedings 2012 Sprin [打印本頁(yè)] 作者: choleric 時(shí)間: 2025-3-21 19:55
書(shū)目名稱(chēng)Language and Automata Theory and Applications影響因子(影響力)
書(shū)目名稱(chēng)Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Language and Automata Theory and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications被引頻次
書(shū)目名稱(chēng)Language and Automata Theory and Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications年度引用
書(shū)目名稱(chēng)Language and Automata Theory and Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications讀者反饋
書(shū)目名稱(chēng)Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: Chameleon 時(shí)間: 2025-3-21 22:51 作者: HEED 時(shí)間: 2025-3-22 01:42
words. Rather than a technical enforcing measure, CBMT is a framework that provides information security training to users when they are in a situation where the training is directly relevant. The study is carried out in two steps. First, a survey is used to measure how well users understand passwor作者: gerontocracy 時(shí)間: 2025-3-22 07:09
correspond to TCP connections can be multiplexed over a single circuit. By default, circuits are used for about ten minutes before switching to new circuits. Once that time limit is reached the circuit cannot be used for any new streams. This time-window is called the maximum circuit dirtiness (MCD作者: 確定方向 時(shí)間: 2025-3-22 12:37 作者: Adj異類(lèi)的 時(shí)間: 2025-3-22 13:55 作者: 污穢 時(shí)間: 2025-3-22 17:50 作者: Chagrin 時(shí)間: 2025-3-22 23:12 作者: 隼鷹 時(shí)間: 2025-3-23 02:41
Vikraman Arvind,Yadu Vasudevttacked by adversarial examples, and many attackers add perturbations to features of malicious traffic to escape ML-based IDSs. Unfortunately, most attack methods add perturbations without sufficient restrictions, generating unpractical adversarial examples. In this paper, we propose ., a restricted作者: 排斥 時(shí)間: 2025-3-23 09:13
Holger Bock Axelsenrhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose .-TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of ele作者: NATAL 時(shí)間: 2025-3-23 13:20
Mikhail Barash,Alexander Okhotinrhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose .-TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of ele作者: 打包 時(shí)間: 2025-3-23 14:15
Philip Bille,Inge Li G?rtz,Jesper Kristensenrhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose .-TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of ele作者: forager 時(shí)間: 2025-3-23 18:57 作者: frozen-shoulder 時(shí)間: 2025-3-23 23:03 作者: 事情 時(shí)間: 2025-3-24 02:28
Laura Bozzellialled Sybils) with the goal of compromising the trust underpinnings of the OSN, in turn, leading to security and the privacy violations. Existing mechanisms to detect Sybils are based either on analyzing user attributes and activities, which are often incomplete or inaccurate or raise privacy concer作者: STYX 時(shí)間: 2025-3-24 07:51
Julien Cervellemake its security deviate from theoretical guarantee. This paper proposes a new lattice-based weak curve fault attack on ECDSA. Since the ECDLP is not required to be computationally practical on the whole group of . (. is the specified base point of ECDSA), our approach extends the existing attacks 作者: Heart-Attack 時(shí)間: 2025-3-24 11:04
Jean-Marc Champarnaud,Hadrien Jeanne,Ludovic Mignots and information will still leak through side-channels and other protocols used in a conversation between browser and server. This paper presents a novel eavesdropping approach called ESQABE, which combines these sources of information in order to determine what a subject is querying a search engin作者: 討好美人 時(shí)間: 2025-3-24 16:55 作者: Cervical-Spine 時(shí)間: 2025-3-24 22:52
Alberto Dennunzio,Enrico Formenti,Julien Provillardis a nontrivial problem to identify bogus institutions selling education credentials. While institutions are often accredited by qualified authorities on a regional level, there is no global authority fulfilling this task.Secondly, many different data schemas are used to encode education credentials作者: CUB 時(shí)間: 2025-3-25 00:19 作者: 線(xiàn) 時(shí)間: 2025-3-25 05:30
Measuring Information in Timed Languagespplications to computer-aided verification. However the theory of timed regular languages is far from being achieved. Seven years ago, in [2], I argued that developing such a theory constituted an important research challenge, and I sketched a research program in this direction. Unfortunately, when 作者: bile648 時(shí)間: 2025-3-25 11:25
The Computer Science of DNA Nanotechnologying at atomic and molecular scales. This field is now a rapidly growing interdisciplinary research adventure involving chemists, molecular biologists, computer scientists, materials scientists, electrical and computer engineers, and others. DNA tile assembly, DNA origami, and DNA strand displacement作者: reflection 時(shí)間: 2025-3-25 14:42 作者: 江湖郎中 時(shí)間: 2025-3-25 17:38 作者: BOLT 時(shí)間: 2025-3-25 22:54
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits .(..,..,…,..) and .(..,..,…,..) differ on at most an . fraction of all Boolean inputs {0,1}.. We give a randomized . algorithm that computes a .-approximate isomorphism between two isomorphic Boolean functions . and . that are given by depth . circuits of poly(.) size, where . is a constant indepen作者: Initial 時(shí)間: 2025-3-26 00:23
Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Spacemplexity classes, respectively. Recently, Morita introduced . multi-head finite automata (RMFAs), and posed the question of whether RMFAs characterize reversible logarithmic space as well. Here, we resolve the question affirmatively, by exhibiting a clean RMFA simulation of logarithmic space reversi作者: 軍械庫(kù) 時(shí)間: 2025-3-26 07:25 作者: 不能強(qiáng)迫我 時(shí)間: 2025-3-26 11:25
Longest Common Extensions via Fingerprinting ..(.,.), is the length of the longest common prefix of the pair of suffixes starting at index . and . in the string .. The LCE problem can be solved in linear space with constant query time and a preprocessing of sorting complexity. There are two known approaches achieving these bounds, which use n作者: 繁重 時(shí)間: 2025-3-26 13:50
Fast and Cache-Oblivious Dynamic Programming with Local Dependencieskey task (and often computational bottleneck) in large-scale textual information retrieval. For instance, algorithms for sequence alignment are widely used in bioinformatics to compare DNA and protein sequences. These problems can all be solved using essentially the same dynamic programming scheme o作者: 擁護(hù)者 時(shí)間: 2025-3-26 19:17
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchingsem and algorithms for maximal matchings have been used as submodules for problems like maximal node-disjoint paths or maximum flow. Since in some applications graphs become larger and larger, a research branch has emerged which is concerned with the design and analysis of implicit algorithms for cla作者: 太空 時(shí)間: 2025-3-27 00:24
Strong Termination for Gap-Order Constraint Abstractions of Counter Systemsich constraints (over ?) between the variables of the source state and the target state of a transition are . (.) [18]. . extend monotonicity constraint systems?[4], integral relation automata [9], and constraint automata in [12]. Since . are infinitely-branching, termination does not imply ., i.e. 作者: 輕信 時(shí)間: 2025-3-27 01:48
Approximate Regular Expressions and Their Derivatives given language. In this paper, we introduce a new family of regular operators based on a generalization of the notion of distance and we define a new family of expressions, the .. We compute Brzozowski derivatives and Antimirov derivatives of such operators, which allows us to provide two recognize作者: Emg827 時(shí)間: 2025-3-27 07:37 作者: Acclaim 時(shí)間: 2025-3-27 12:14
Conservative Groupoids Recognize Only Regular Languagesoperation ‘·’ which is not necessarily associative. It is well known that . can be recognized by a groupoid iff . is context-free. But it is also known that some subclasses of groupoids can only recognize regular languages. For example, . recognize exactly the regular open languages and Beaudry et a作者: Psychogenic 時(shí)間: 2025-3-27 15:44
0302-9743 national Conference on Language and Automata Theory and Applications, LATA 2012, held in A Coru?a, Spain in March 2012. The 41 revised full papers presented together with 3 invited talks and 2 invited tutorials were carefully reviewed and selected from 114 initial submissions. The volume features co作者: 你敢命令 時(shí)間: 2025-3-27 17:59 作者: Psa617 時(shí)間: 2025-3-27 23:12 作者: GEN 時(shí)間: 2025-3-28 04:06 作者: Gratuitous 時(shí)間: 2025-3-28 09:05 作者: arthrodesis 時(shí)間: 2025-3-28 13:35
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systemsget set of configurations, determine the minimal possible cost of any run from the initial to a target configuration. We solve the problem by reducing it to the reachability problem in standard pushdown systems.作者: nerve-sparing 時(shí)間: 2025-3-28 15:29 作者: AVOID 時(shí)間: 2025-3-28 19:02 作者: obligation 時(shí)間: 2025-3-28 23:57 作者: forbid 時(shí)間: 2025-3-29 03:27 作者: 遺棄 時(shí)間: 2025-3-29 10:50 作者: 六邊形 時(shí)間: 2025-3-29 12:38 作者: euphoria 時(shí)間: 2025-3-29 17:03 作者: originality 時(shí)間: 2025-3-29 20:14 作者: GOAT 時(shí)間: 2025-3-30 03:50 作者: cardiac-arrest 時(shí)間: 2025-3-30 05:29 作者: Isolate 時(shí)間: 2025-3-30 08:53 作者: 漂浮 時(shí)間: 2025-3-30 15:53
aintaining the original throughput and no measurable increase in CPU usage. Raising the MCD shows the opposite effect and increases memory usage. By drastically reducing the MCD, a significant number of extra circuits are created. From a performance point of view, the MCD should be reduced. Building作者: 審問(wèn) 時(shí)間: 2025-3-30 19:30
Rod Downeyne different ML-based IDSs. Experimental results show that the mean evasion increase rate (.) of . is 94.1% in multiple attacks, which is 9.2% higher than the best of related methods, .. Especially, adversarial examples generated by . have lower perturbations, and the mean distance of perturbations 作者: aspersion 時(shí)間: 2025-3-30 21:14
Jack H. Lutzaintaining the original throughput and no measurable increase in CPU usage. Raising the MCD shows the opposite effect and increases memory usage. By drastically reducing the MCD, a significant number of extra circuits are created. From a performance point of view, the MCD should be reduced. Building作者: Between 時(shí)間: 2025-3-31 04:20
Parosh Aziz Abdulla,Mohamed Faouzi Atig,Jari Stenmanections, and analyze the cleartext. Meanwhile, our patch was merged into Zeek upstream and will be part of Zeek v4.3.0. In our evaluation, we initially compare our approach to MitM proxies and can deduce that it significantly reduces the computational overhead. Furthermore, our experimental results 作者: Dysplasia 時(shí)間: 2025-3-31 05:26 作者: 彩色 時(shí)間: 2025-3-31 10:47
Vikraman Arvind,Yadu Vasudevne different ML-based IDSs. Experimental results show that the mean evasion increase rate (.) of . is 94.1% in multiple attacks, which is 9.2% higher than the best of related methods, .. Especially, adversarial examples generated by . have lower perturbations, and the mean distance of perturbations 作者: Arboreal 時(shí)間: 2025-3-31 15:58
Holger Bock Axelsenn-the-middle attack attempt. We compare our approach against the TESLA protocol in a 2-day simulation scenario, showing a reduction of 15.82?% and 47.29?% in computational cost, sender and receiver respectively, and a cumulative reduction in the communication overhead.作者: 真實(shí)的你 時(shí)間: 2025-3-31 19:26
Mikhail Barash,Alexander Okhotinn-the-middle attack attempt. We compare our approach against the TESLA protocol in a 2-day simulation scenario, showing a reduction of 15.82?% and 47.29?% in computational cost, sender and receiver respectively, and a cumulative reduction in the communication overhead.作者: asthma 時(shí)間: 2025-4-1 01:24 作者: ENDOW 時(shí)間: 2025-4-1 03:48
Philip Bille,Morten St?ckelpowers the behavior of Openflow compatible devices to make them behaving like stateful firewalls. Therefore, organizations do not need to spend money and resources on buying and maintaining conventional firewalls. Furthermore, we propose an orchestrator in order to spread and to reinforce security p作者: alcohol-abuse 時(shí)間: 2025-4-1 07:04 作者: hemoglobin 時(shí)間: 2025-4-1 11:13 作者: 支形吊燈 時(shí)間: 2025-4-1 15:25 作者: 合群 時(shí)間: 2025-4-1 20:36
