It is generally agreed upon in the natural language processing (NLP) community that ethics should be integrated into any curriculum. Being aware of and understanding the relevant core concepts is a prerequisite for following and participating in the
discourse on ethical NLP. We here present ready-made teaching material in the form of slides and practical exercises on ethical issues in NLP, which is primarily intended to be integrated into introductory NLP or computational linguistics courses. By making this material freely available, we aim at lowering the threshold to adding ethics to the curriculum. We hope that increased awareness will enable students to identify potentially unethical behavior.
This contribution describes a two-course module that seeks to provide humanities majors with a basic understanding of language technology and its applications using Python. The learning materials consist of interactive Jupyter Notebooks and accompanying YouTube videos, which are openly available with a Creative Commons licence.
Machines with rotary joints only have a special importance in the field of precision devices to reach great applications. One of the two machines may be the total machine (cranes and excavators). Any work towards facilitating the movement of these two machines within a certain system is a step forward towards its optimal work
This research highlights on an important and fundamental issue of the 20th century's most
important philosophers, "Gaston Bachelard", which is the analytical approach to scientific
knowledge of this philosopher and the role played by "Gaston Bachel
ard" in this approach
in formulating a set of scientific concepts that enriched epistemology as the concept of the
epistemological obstacle ,The concept of estrangement and the concept of undo time, with
concentration on importance of the dialectical relationship between these concepts and
their role in the development of scientific knowledge.
في الآونة الأخيرة حدث تضخم للمعلومات على شكل أخبار ومقالات مختلفة وجزء كبير من هذه البيانات يكون بشكل غير منظم
This thesis presents new mechanisms and methods for encryption from algorithms and mathematical theories with their proofs. Methods for encryption (blinding) and decryption (decryption) within text messages have been presented.
The great interest in the field of knowledge discovery in relational databases has led to the development of mathematical algorithms that have proven effective in deriving knowledge of both descriptive and predictive types. However, the great develop
ment of information technology, and the wide spread of social networks and advanced web pages, increased the use of intent database systems.
في عام 1895 اكتشف الفيزيائي Roentgen الأشعة السينية (x-rays) وفي عام 1912قام الفيزيائيون Von Laue و Friedrich و Knipping بتسليط الأشعة السينية على التوتياء ودرسوا البنية البلورية للتوتياء
Application-Level Multicast Networks are easy to deployment, it does not require
any change in the network layer, where data is sent to the network via the built-up
coverage of the tree using a single-contact transmission of the final contract, who
are the
hosts are free can join / leave whenever they want it, or even to leave without telling any
node so. Causing the separation of the children of the leaved node from the tree, and the
request for rejoin, in other words, these nodes will be separated from the overlay tree and
cannot get the data even rejoin. This causes the distortion of the constructed tree, and the
loss of several packets which can significantly impact the user.
One of the key challenges in building a multi-efficiently and effectively overlay
multicast protocol is to provide a robust mechanism to overcome the sudden departure of a
node from the overlay tree without a significant impact on the performance of the
constructed tree. In this research, we propose a new protocol to solve problems presented
previously.
Application-Level Multicast (ALM) has been proposed as an alternative solution to
overcome the lack of deployment of the IP Multicast group communication model. It
builds an overlay tree consisting of end-to-end unicast connections between end-host
s
based on the collaboration of group members with each other. The efficiency of the
constructed overlay tree depends entirely on the honesty and on the cooperation of all
participating members. However such behaviour can not be guaranteed and some selfish
and non-cooperative nodes may take profit from the honesty of other members in the
overlay.
Recently, many researchers have been investigating the impact of selfishness of
nodes in the overlay multicast. Our contribution in this paper is to describe in detail the
basic algorithms used to construct the overlay tree, and evaluate the impact of cheating
nodes on the stability and on the performance of constructed overlay tree using these
algorithms.
