1,721,597 research outputs found
HE ELCa English Language Carnival boosts graduates’ skills and employability
Full text linkGAMBANG, 9 November 2024 – The Higher Education English Language Carnival (HE ELCa), organised by the Ministry of Higher Education (KPT) and hosted by Universiti Malaysia Pahang Al-Sultan Abdullah (UMPSA), served as a significant platform to improve English language proficiency among students of Higher Education Institutions (IPTs) in Malaysia
Karnival Bahasa Inggeris HE ELCa tingkat kemahiran dan kebolehpasaran graduan
Full text linkGAMBANG, 9 November 2024 - Penganjuran Higher Education English Language Carnival (HE ELCa) oleh Kementerian Pendidikan Tinggi (KPT) yang menyaksikan Universiti Malaysia Pahang Al-Sultan Abdullah (UMPSA) sebagai tuan rumah penganjuran menjadi platform penting bagi meningkatkan penguasaan bahasa Inggeris dalam kalangan pelajar Institut Pengajian Tinggi (IPT) di Malaysia
Transnational networks and migration from Faryab to Iran : [an Afghanistan Research and Evaluation Unit report]
No full textElca StigterParallel als Buch-Ausg. erschiene
The Kandahar bus stand in Kabul : an assessment of travel and labour migration to Iran and Pakistan
Full text linkElca Stigte
Transnational networks and migration from Herat to Iran
No full textElca StigterParallel als Buch-Ausg. erschiene
Breaking Language Barriers: Centre For Modern Languages Universiti Malaysia Pahang Al Sultan Abdullah Excels At HE ELCA 2023
Full text link7 December 2023, Tanjung Malim - The Centre for Modern Languages (CML) at Universiti Malaysia Pahang Al-Sultan Abdullah (UMPSA) has distinguished itself by organising the participation of thirty-two students in various online competitions at the Higher Education English Language Carnival (HE ELCA) 2023
ELCA evaluation for keyword search on probabilistic XML data
No full textAs probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm and compare it with its SLCA counterpart in aspects of result probability, time and space efficiency, and scalability
ELCA Evaluation for Keyword Search on Probabilistic XML Data
No full textABSTRACT As probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm and compare it with its SLCA counterpart in aspects of result effectiveness, time and space efficiency, and scalability
ELCA evaluation for keyword search on probabilistic XML data
No full textAs probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm and compare it with its SLCA counterpart in aspects of result probability, time and space efficiency, and scalability
- …
