標(biāo)題: Titlebook: Web and Big Data; 7th International Jo Xiangyu Song,Ruyi Feng,Geyong Min Conference proceedings 2024 The Editor(s) (if applicable) and The [打印本頁(yè)] 作者: 導(dǎo)彈 時(shí)間: 2025-3-21 17:03
書(shū)目名稱Web and Big Data影響因子(影響力)
書(shū)目名稱Web and Big Data影響因子(影響力)學(xué)科排名
書(shū)目名稱Web and Big Data網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Web and Big Data網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Web and Big Data被引頻次
書(shū)目名稱Web and Big Data被引頻次學(xué)科排名
書(shū)目名稱Web and Big Data年度引用
書(shū)目名稱Web and Big Data年度引用學(xué)科排名
書(shū)目名稱Web and Big Data讀者反饋
書(shū)目名稱Web and Big Data讀者反饋學(xué)科排名
作者: macabre 時(shí)間: 2025-3-21 23:45 作者: Charitable 時(shí)間: 2025-3-22 03:34
Xiu Fang,Chenling Shen,Guohao Sun,Hao Chen,Yating Tangscidae, Streblidae, Nycteribiidae, Cordyluridae und Oestridae mit einbezieht. Alle Arten dieser Familien zeigen am 2. Antennenglied einen auffallenden, etwa dorsal gelegenen L?ngsspalt, der sich fast über die ganze L?nge des Segments erstreckt. Der Thorax weist dorsal fast immer eine deutliche, bein作者: Accolade 時(shí)間: 2025-3-22 05:18 作者: Choreography 時(shí)間: 2025-3-22 11:50 作者: FORGO 時(shí)間: 2025-3-22 14:56
Jiawei Zheng,Junying Chen,Yi Caile peasants, intellectuals, heroes of the republic, folk heroes, legendary figures, political hopefuls and NPA fighters. Historically, as shown in Chapter 2, men like Rizal, del Pilar, Bonifacio and Aguinaldo pointed a new direction for the Philippines at the turn of the century. Others carried forw作者: Terminal 時(shí)間: 2025-3-22 19:03 作者: 不合 時(shí)間: 2025-3-22 21:12 作者: 確定的事 時(shí)間: 2025-3-23 05:04 作者: justify 時(shí)間: 2025-3-23 06:25
Jiawei Zheng,Junying Chen,Yi Caie functions as lambda terms. This illustrates very well the point that “word problems” are good problems in the sense that a solution either way - decidable or undecidable - can give useful information. In particular, this undecidability proof shows us how to program arbitrary partial recursive func作者: infringe 時(shí)間: 2025-3-23 09:51 作者: monochromatic 時(shí)間: 2025-3-23 14:39 作者: 大雨 時(shí)間: 2025-3-23 19:33
Nengyu Xia,Yixin Zhang,Wei Ren,Xianyi Chenory of first order predicate calculus with equality. Consequently, we have showed that the term rewriting method can be as powerful as paramodulation and resolution combined. Possible improvements of efficiency are also discussed..(2) In [KaN84], Kapur & Narendran proposed a method similar to [HsD83作者: 瘙癢 時(shí)間: 2025-3-24 00:29
Tianbao Zhang,Yuan Cui,Zhenfei Yang,Shi Feng,Daling Wang is considered the result of the computation. The unique normalization (UN) property for a TRS . states that any starting term can reach at most one normal form when . is used, i.e. that the computation with . is unique..We study the decidability of this property for classes of TRS defined by syntac作者: headway 時(shí)間: 2025-3-24 04:15 作者: Dawdle 時(shí)間: 2025-3-24 08:48 作者: CHASM 時(shí)間: 2025-3-24 12:20 作者: 微枝末節(jié) 時(shí)間: 2025-3-24 14:58 作者: 模范 時(shí)間: 2025-3-24 21:59 作者: 騙子 時(shí)間: 2025-3-25 00:15
,Truth Discovery of?Source Dependency Perception in?Dynamic Scenarios,in dynamic scenarios, and propose an incremental model based on source dependency detection, namely SDPTD, which can dynamically update object truth values and source weights and detect source dependencies when new data arrive. Experiments on two real-world datasets and synthetic datasets demonstrat作者: MEET 時(shí)間: 2025-3-25 03:21
,Truth Discovery Against Disguised Attack Mechanism in?Crowdsourcing,moid function. In the task allocation phase, the Weighted Arithmetic Mean (WAM) is used to estimate the allocation probability of golden tasks to avoid the shortage of golden tasks. Extensive experiments on real-world datasets and synthetic datasets demonstrate that our method is effective against d作者: arrogant 時(shí)間: 2025-3-25 10:28
Distributed Knowledge Graph Query Acceleration Algorithm, phase, which does not achieve good parallelism. To address these issues, we propose a distributed framework for offline index construction and online SPARQL query processing framework to achieve parallel accelerated processing. Our approach can more efficiently filter candidate solutions that do no作者: Liability 時(shí)間: 2025-3-25 15:17
,Truth Discovery of?Source Dependency Perception in?Dynamic Scenarios,in dynamic scenarios, and propose an incremental model based on source dependency detection, namely SDPTD, which can dynamically update object truth values and source weights and detect source dependencies when new data arrive. Experiments on two real-world datasets and synthetic datasets demonstrat作者: 推遲 時(shí)間: 2025-3-25 18:35 作者: 放氣 時(shí)間: 2025-3-25 22:47
,Approximate Continuous Skyline Queries over?Memory Limitation-Based Streaming Data,-adaptive .rror-based .pproximate .kyline). It can self-adaptively adjust . based on the distribution of streaming data, and achieve the goal of supporting .-. over memory limitation-based streaming data. Theoretical analysis indicates that even in the worst case, both the running cost and space cos作者: 妨礙 時(shí)間: 2025-3-26 01:52 作者: Aerophagia 時(shí)間: 2025-3-26 04:30
,Identifying Backdoor Attacks in?Federated Learning via?Anomaly Detection,nts. Concretely, we first segment the model gradients into fragment vectors that represent small portions of model parameters. We then employ anomaly detection to locate the distributionally skewed fragments and prune the participants with the most outliers. We embody the findings in a novel defense作者: Melodrama 時(shí)間: 2025-3-26 10:43 作者: reflection 時(shí)間: 2025-3-26 16:12
,Approximate Continuous Skyline Queries over?Memory Limitation-Based Streaming Data,-adaptive .rror-based .pproximate .kyline). It can self-adaptively adjust . based on the distribution of streaming data, and achieve the goal of supporting .-. over memory limitation-based streaming data. Theoretical analysis indicates that even in the worst case, both the running cost and space cos作者: Gullible 時(shí)間: 2025-3-26 19:46 作者: Proponent 時(shí)間: 2025-3-26 23:35 作者: CONE 時(shí)間: 2025-3-27 03:03
,DADR: A Denoising Approach for?Dense Retrieval Model Training,ch reduces the effects of noise on model performance by assigning diverse weights to the different samples during the training process. We incorporate the proposed DADR approach with three representative kinds of sampling methods and different loss functions. Experimental results on two publicly ava作者: 籠子 時(shí)間: 2025-3-27 07:18
,Multi-pair Contrastive Learning Based on?Same-Timestamp Data Augmentation for?Sequential Recommendaractions. During the training and testing process, we design three types of samples so as to imitate human learning. Extensive experiments on two benchmark datasets show that our model outperforms state-of-the-art sequential models.作者: 古董 時(shí)間: 2025-3-27 11:21
,PaTraS: A Path-Preserving Trajectory Simplification Method for?Low-Loss Map Matching,asures the importance of a trajectory point with respect to how it contributes to the map-matching results. Extensive experiments show that, compared with state-of-the-art methods, our proposed solution can better preserve the path generated by trajectory map-matching at the cost of a slightly incre作者: 救護(hù)車 時(shí)間: 2025-3-27 15:37
,Enhancing Collaborative Features with?Knowledge Graph for?Recommendation,ant semantic information in KG, we design an attribute aggregation scheme and an inference mechanism for GNN which directly propagates further attributes and inference information to the central node. Extensive experiments conducted on three public datasets demonstrate the superior performance of CK作者: 必死 時(shí)間: 2025-3-27 19:36
,DADR: A Denoising Approach for?Dense Retrieval Model Training,ch reduces the effects of noise on model performance by assigning diverse weights to the different samples during the training process. We incorporate the proposed DADR approach with three representative kinds of sampling methods and different loss functions. Experimental results on two publicly ava作者: seroma 時(shí)間: 2025-3-27 23:10
,PageCNNs: Convolutional Neural Networks for?Multi-label Chinese Webpage Classification with?Multi-i Chinese webpages. The proposed PageCNN models are compared with two modified traditional machine learning models, the modified TextCNN model, and three state-of-the-art deep learning based multi-label text classification models. The experimental results demonstrate that the PageCNN models perform b作者: 蚊帳 時(shí)間: 2025-3-28 06:08 作者: 來(lái)這真柔軟 時(shí)間: 2025-3-28 09:05 作者: 易彎曲 時(shí)間: 2025-3-28 14:23
,Enhancing Collaborative Features with?Knowledge Graph for?Recommendation,ant semantic information in KG, we design an attribute aggregation scheme and an inference mechanism for GNN which directly propagates further attributes and inference information to the central node. Extensive experiments conducted on three public datasets demonstrate the superior performance of CK作者: anaerobic 時(shí)間: 2025-3-28 16:18 作者: innovation 時(shí)間: 2025-3-28 20:22 作者: Junction 時(shí)間: 2025-3-29 01:22
,MFF-Trans: Multi-level Feature Fusion Transformer for?Fine-Grained Visual Classification,ens, we further introduce the semantic connection enhancing module (SCEM) which use the graph convolutional network to mine the structural information between them in deep layers of vision transformer. Extensive experimental results on three benchmark datasets indicate that MFF-Trans achieves satisf作者: Fraudulent 時(shí)間: 2025-3-29 07:02
,CFGCon: A Scheme for?Accurately Generating Control Flow Graphs of?Smart Contracts,nt counter. Experimental results show that our proposed CFGCon reached a much higher success rate than other state-of-art CFG generators on the dataset containing 579 open source contracts and 10,000 non-open source contracts from Ethereum. At the same time, the analysis speed of CFGCon is similar t作者: acrobat 時(shí)間: 2025-3-29 07:42 作者: 植物群 時(shí)間: 2025-3-29 11:52
HSA: Hyperbolic Self-attention for Sequential Recommendation,y model the latent hierarchical structures, which are indicated by the power-law distributions of user behavior sequences. Specifically, we propose a novel hyperbolic self-attention model, which learns item embeddings in hyperbolic space and adopts self-attention to model user sequence representatio作者: 集合 時(shí)間: 2025-3-29 17:21 作者: vibrant 時(shí)間: 2025-3-29 21:23
Hypergraph-Enhanced Self-supervised Heterogeneous Graph Representation Learning, semantic positive sampling strategy, which chooses proper positive samples according to structure and attribute semantics. Extensive experiments conducted on various real-world datasets demonstrate the state-of-the-art performance of HHGR.作者: 戰(zhàn)勝 時(shí)間: 2025-3-30 02:07 作者: Atheroma 時(shí)間: 2025-3-30 07:01
Yewen Li,Mingyuan Ge,Yucheng Ji,Mingyong Lireview of mammalian non-myelinated nerve fibres, that the teleological advantage of the finefibre afferent system, especially in the case of a visceral input where speed of impulse transmission was not of primary importance, was that it allows fibres of a variety of sensory modalities to be accommod作者: 親密 時(shí)間: 2025-3-30 11:14 作者: Medicare 時(shí)間: 2025-3-30 13:05
Yunzhe An,Zhu Zhen,Rui Zhu,Tao Qiu,Xiufeng Xian nur einseitig zugunsten des Repr?sentationsgedankens (vgl. Doehring 1984, 109; Weber-Fas 1983, 52; Kriele 1975, 261)., wobei die plebiszit?re Komponente ihren Widerhall nur in der vom Grundgesetz geregelten territorialen Neugliederung des Bundesgebietes nach Art. 29 GG erf?hrt (vgl. Hesse 1991, 62作者: 神秘 時(shí)間: 2025-3-30 18:39 作者: Longitude 時(shí)間: 2025-3-30 21:06 作者: 蒸發(fā) 時(shí)間: 2025-3-31 03:50 作者: 散步 時(shí)間: 2025-3-31 08:21 作者: Genome 時(shí)間: 2025-3-31 12:21 作者: 誘拐 時(shí)間: 2025-3-31 16:51 作者: 滑稽 時(shí)間: 2025-3-31 19:21 作者: 切碎 時(shí)間: 2025-4-1 00:10 作者: Inscrutable 時(shí)間: 2025-4-1 02:35
Nengyu Xia,Yixin Zhang,Wei Ren,Xianyi Chenhat our way of dealing with first order theories with full equality can be extended to the splitting and the Kapur-Narendran methods as well..Due to the lack of space, we only give a sketch of the proofs of the completeness of the two theorem proving methods. They will be provided in detail in a lon作者: 性行為放縱者 時(shí)間: 2025-4-1 08:08 作者: scrape 時(shí)間: 2025-4-1 11:07
Yuanhao Zhang,Chengxin He,Longhai Li,Bingzhe Zhang,Lei Duan,Jie Zuomorphism between equivalence classes of Fitch deductions and simply typed .-terms. Then we define the notion of cut-elimination on Fitch deductions, which is only possible for deductions that are completely unshared (normal forms of the unsharing reduction). For conciseness, we restrict in this pape作者: Ruptured-Disk 時(shí)間: 2025-4-1 16:32 作者: 現(xiàn)存 時(shí)間: 2025-4-1 20:21 作者: 淡紫色花 時(shí)間: 2025-4-2 02:44 作者: 慷慨不好 時(shí)間: 2025-4-2 05:55
Xiu Fang,Yating Tang,Guohao Sun,Chenling Shen,Hao Chen作者: Resistance 時(shí)間: 2025-4-2 07:58
Rui Zhu,Chunhong Li,Anzhen Zhang,Chuanyu Zong,Xiufeng Xia作者: 支架 時(shí)間: 2025-4-2 11:25 作者: 獨(dú)輪車 時(shí)間: 2025-4-2 16:57
Rui Zhu,Chunhong Li,Anzhen Zhang,Chuanyu Zong,Xiufeng Xia作者: SOB 時(shí)間: 2025-4-2 19:27 作者: 可行 時(shí)間: 2025-4-3 02:53 作者: 召集 時(shí)間: 2025-4-3 04:07 作者: Entrancing 時(shí)間: 2025-4-3 11:16
Mengxue Du,Shasha Li,Jie Yu,Jun Ma,Huijun Liu,Miaomiao Li,Bin Ji作者: 改正 時(shí)間: 2025-4-3 15:42
,Answering Property Path Queries over?Federated RDF Systems,e matching process, the possible circular matching problem is eliminated by adopting the alternating buffer marking mechanism. Experimental results on datasets of different sizes show that the proposed scheme is effective and scalable.