ppxscal/embedding_network huggingface dataset:
Rough Set Approach for Generation of Classification Rules of Breast Cancer Data
Authors: Aboul Ella Hassanien, Jafar M. H. Ali
Venue: Informatica (2004)

Extensive amounts of knowledge and data stored in medical databases require the development of specialized tools for storing, accessing, analysis, and effectiveness usage of stored knowledge and data. Intelligent methods such as neural networks, fuzzy sets, decision trees, and expert systems are, slowly but steadily, applied in the medical fields. Recently, rough set theory is a new intelligent technique was used for the discovery of data dependencies, data reduction, approximate set classification, and rule induction from databases. In this paper, we present a rough set method for generating classification rules from a set of observed 360 samples of the breast cancer data. The attributes are selected, normalized and then the rough set dependency rules are generated directly from the real value attribute vector. Then the rough set reduction technique is applied to find all reducts of the data which contains the minimal subset of attributes that are associated with a class label for classification. Experimental results from applying the rough set analysis to the set of data samples are given and evaluated. In addition, the generated rules are also compared to the well-known IDS classifier algorithm. The study showed that the theory of rough sets seems to be a useful tool for inductive learning and a valuable aid for building expert systems.
Fast Matching of Twig Patterns
Authors: Jiang Li, Junhu Wang
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Twig pattern matching plays a crucial role in ${\sc xml}$ data processing. Existing twig pattern matching algorithms can be classified into two-phase algorithms and one-phase algorithms. While the two-phase algorithms (e.g., ${\tt TwigStack}$) suffer from expensive merging cost, the one-phase algorithms (e.g., ${\tt TwigList}$, ${\tt Twig^{2}Stack}$, ${\tt HolisticTwigStack}$) either lack efficient filtering of useless elements, or use over-complicated data structures. In this paper, we present two novel one-phase holistic twig matching algorithms, TwigMix and ${\tt TwigFast}$, which combine the efficient selection of useful elements (introduced in ${\tt TwigStack}$) with the simple lists for storing final solutions (introduced in ${\tt TwigList}$). ${\tt TwigMix}$ simply introduces the element selection function of ${\tt TwigStack}$ into ${\tt TwigList}$ to avoid manipulation of useless elements in the stack and lists. ${\tt TwigFast}$ further improves this by introducing some pointers in the lists to completely avoid the use of stacks. Our experiments show ${\tt TwigMix}$ significantly and consistently outperforms ${\tt TwigList}$ and ${\tt HolisticTwigStack}$ (up to several times faster), and ${\tt TwigFast}$ is up to two times faster than ${\tt TwigMix}$.
Application of Data Mining Algorithms to TCP throughput Prediction in HTTP Transactions
Authors: Leszek Borzemski, Marta Kliber, Ziemowit Nowak
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This paper presents a study of the application of data mining algorithms to the prediction of TCP throughput in HTTP transactions. We are using data mining models built on the basis of historic measurements of network performance gathered using WING system. These measurements reflect Web performance as experienced by the end-users located in Wroclaw, Poland. Data mining models are created using the algorithms available in Microsoft SQL Server 2005 and IBM Intelligent Miner tools. Our results show that our data mining based TCP throughput prediction returns accurate results. The application of our method in building of so-called "best performance hit" operation mode of the search engines is proposed.
A Prototyping Environment for Wireless Multihop Networks
Authors: Fehmi Abdesslem, Luigi Iannone, Marcelo Dias De Amorim, Katia Obraczka, Ignacio Solis, Serge Fdida
Venue: Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet (2007)

Relative to the impressive number of proposals addressing the multitude of challenges raised by IEEE 802.11-based wireless networks, few have known real implementation. In wireless networks, due especially to the unpredictable nature of the wireless channel, bridging theory and practice is far from trivial. In this paper, we advocate including prototyping in the design process of wireless protocols. The goal is to speed up the design process and to help validating novel solutions under real conditions. To this end, we introduce Prawn, a tool that allows rapid prototyping of wireless network protocols. The basic idea behind Prawn is to provide a set of basic building blocks that implement common functionalities needed by a wide range of wireless protocols (e.g., neighbor discovery, link quality assessment, message transmission and reception). Besides these ready-to-use blocks, Prawn also provides a standard API that allows protocol designers easy access to the Prawn primitives. Through a number of examples, we showcase Prawn as a simple, yet powerful tool for fast prototyping of wireless network protocols.
Cryptographically Strong S-Boxes Based on Cellular Automata
Authors: Miroslaw Szaban, Franciszek Seredynski
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Substitution boxes (S-boxes) are the main elements of block ciphers, wide used in modern cryptography. In this paper we propose a new method to create S-boxes, which is based on application of Cellular Automata (CA). We present results of testing CA-based S-boxes, which confirm that CA are able to realize efficiently Boolean functions corresponding to classical S-boxes. Proposed CA-based S-boxes offer cryptographic properties comparable or better than classical S-box tables.
EASI Modelling Algorithms for Aerosol-Cloud Distribution Analysis
Authors: A. N. Alias, M. Z. MatJafri, H. S. Lim, K. Abdullah, N. Mohd. Saleh
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Algorithms to distinguish between clouds and aerosols are important in the environmental and remote sensing study. The colour-modulated image from Cloud Aerosol Lidar and Infrared Pathfinder Satellite Observation (CALIPSO) has been analysed in this study. CALIPSO is currently obtaining global aerosol and cloud measurements from space. We study the possibility to apply EASI modelling algorithms to differentiate aerosols and clouds in the CALIPSO image. This image processing method has shown good outcome for visualization analysis.
S3H: A Secure Seamless and Soft Handover between WiMax and 3G Networks
Authors: Ayesha Altaf, Faiza Iqbal, M. Younus Javed
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

With the increase of mobile and wireless communication in heterogeneous networks, the need for security has also increased. Mobile devices have to execute seamless and secure handover from one type of network to another. But before the actual execution, some security measures needs to be taken against denial of service and replay attacks. These measures require lengthy procedures for authentication and authorization, which causes long delays in handover execution. In this paper we have proposed an adaptive approach for Secure Seamless and Soft Handover (S3H) between WiMAX and 3G Networks. The idea is to use make-before-break approach to achieve pre-authentication with minimal security requirements before actual handover execution. This approach is intended to achieve security with less delay as compared to hard handover approach.
An Object-Oriented Framework for Common Abstraction and the Comet-Based Interaction of Physical u-Objects and Digital Services
Authors: Kei Nakanishi, Jianhua Ma, Bernady O. Apduhan, Runhe Huang
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

One essential feature of ubiquitous computing is to process the information of real objects in real environments surrounding the users to offer novel services to people in their daily lives. Such kind of information is often taken from small devices that are embedded into physical objects called u-objects, and distributed in surrounding places such as rooms and offices. A ubiquitous system generally involves many physical u-objects and their dynamic interactions with digital services, i.e., software entities residing in different machines. To overcome the great heterogeneity of u-objects and digital services as well as platforms and networks used, various frameworks have been proposed and tested. However, there still exist many problems to gracefully integrate these physical u-objects and digital services, and let them seamlessly interact with each other. Therefore, this study is focused on a ubiquitous framework that maps all physical u-objects and digital services commonly into their corresponding abstracted objects, and enables all the objects to interact based on message exchanges via the Comet Web server using the HTTP protocol which is platform independent and able to run on many kinds of physical networks.
Performance Evaluation of Adaptive Rate Control (ARC) over Ethernet Based PONs (EPONs)
Authors: Surasee Prahmkaew
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In this paper we presented the new policing control algorithm to improve the performance of Ethernet Passive Optical Networks (EPONs) to gain more traffic by adjusting the available time slots which are provided by Optical Line Terminal (OLT) to another Optical Network Unit (ONU). In particular, the cases in which Dynamic Bandwidth allocation (DBA), and Two-Layer Bandwidth Allocation (TLBA) schemes are compared in [11], only TLBA and the proposed algorithm which are applied in peak-rate will be discussed. The proposed algorithm improves the EPON performance by adjusting the growth and decline of time slot and window size which provided by OLT and ONUs, rather than fixed time slots and window size. The proposed algorithm will advertise by means of incoming traffic rate, No of packet drops, current time slots and packet delay time over EPONs. Several simulation of convention algorithms are performed to study how TLBA behave when congestion existed and compared to our proposed algorithm. We obtain the impressive results that support our algorithm.
Vineyard Computing: Sensor Networks in Agricultural Production
Authors: Jenna Burrell, Tim Brooke, Richard Beckwith
Venue: IEEE Pervasive Computing (2004)

Using ethnographic research methods, the authors studied the structure of work activities and the needs and priorities of people working in a vineyard in order to understand the potential for sensor networks in agriculture. The emphasis on production in this setting distinguishes this user population from those of previous studies that focused on sensor network applications for biological and habitat research. They uncovered promising opportunities for proactive computing approaches and a need for localization functions to track the movement of objects, people, and equipment through the vineyard. They also discovered a need for the sensitive design of interfaces that provide human touchpoints mediating between various roles in the vineyard and the underlying sensor network infrastructure.
Propositional Dynamic Logic as a Logic of Belief Revision
Authors: Jan Eijck, Yanjing Wang
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

This paper shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of doxastic/epistemic PDL with a belief change modality. It is shown that the properties of knowledge and belief are preserved under any update, and that the logic is complete.
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
Authors: Samuli Heilala, Brigitte Pientka
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitionistic modal logic IS4. This calculus, suitable for the enumeration of normal proofs, is the starting point for the development of a sequent calculus-based bidirectional decision procedure for propositional IS4. In this system, relevant derived inference rules are constructed in a forward direction prior to proof search, while derivations constructed using these derived rules are searched over in a backward direction. We also present a variant which searches directly over normal natural deductions. Experimental results show that on most problems, the bidirectional prover is competitive with both conventional backward provers using loop-detection and inverse method provers, significantly outperforming them in a number of cases.
Using Language Models and Topic Models for XML Retrieval
Authors: Fang Huang
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper exposes the results of our participation in the INEX 2007 ad hoc track. We implemented two different models: a mixture language model and a topic model. For the language model, we focused on the question of how shallow features of text display information in an XML document can be used to enhance retrieval effectiveness. Our language model combined estimates based on element full-text and the compact representation of the element. We also used non-content priors, including the location the element appears in the original document, and the length of the element path, to boost retrieval effectiveness. For the topic model, we looked at a recent statistical model called Latent Dirichlet Allocation[1], and explored how it could be applied to XML retrieval.
Pattern-Driven Automatic Parallelization
Authors: Christoph W. Kessler
Venue: Scientific Programming (1996)

This article describes a knowledge-based system for automatic parallelization of a wide class of sequential numerical codes operating on vectors and dense matrices, and for execution on distributed memory message-passing multiprocessors. Its main feature is a fast and powerful pattern recognition tool that locally identifies frequently occurring computations and programming concepts in the source code. This tool also works for dusty deck codes that have been "encrypted" by former machine-specific code transformations. Successful pattern recognition guides sophisticated code transformations including local algorithm replacement such that the parallelized code need not emerge from the sequential program structure by just parallelizing the loops. It allows access to an expert's knowledge on useful parallel algorithms, available machine-specific library routines, and powerful program transformations. The partially restored program semantics also supports local array alignment, distribution, and redistribution, and allows for faster and more exact prediction of the performance of the parallelized target code than is usually possible.
Weight Assignment of Semantic Match Using User Values and a Fuzzy Approach
Authors: Simone A. Ludwig
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Automatic discovery of services is a crucial task for the e-Science and e-Business communities. Finding a suitable way to address this issue has become one of the key points to convert the Web into a distributed source of computation, as it enables the location of distributed services to perform a required functionality. To provide such an automatic location, the discovery process should be based on the semantic match between a declarative description of the service being sought and a description being offered. This problem requires not only an algorithm to match these descriptions, but also a language to declaratively express the capabilities of services. The proposed matchmaking approach is based on semantic descriptions for service attributes, descriptions and metadata. For the ranking of service matches a match score is calculated whereby the weight values are either given by the user or estimated using a fuzzy approach.
Semantics-Aware Resolution of Multi-part Persistent Indentifiers
Authors: Emanuele Bellini, Ernesto Damiani, Cristiano Fugazza, Maurizio Lunghi
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

In this paper, we outline the achievements of the NBN project w.r.t. persistent identification in the context of federated repositories and outline the capabilities of the current prototype. We describe the generalities on the approach adopted for PI assignment and resolution in the twofold modality of hierarchical and peer-to-peer request forwarding. The final implementation will enable each PI domain to communicate with other domains by using the same resolution interface.We also describe the advanced capabilities under development for the retrieval of complex objects by automated agents, combining the PMH interaction protocol with ORE data structures extended as to suit the purpose of digital preservation. We also sketch how to enable metadata interoperability by allowing clients to specify the native metadata format when interrogating a repository and translating proprietary descriptions accordingly.
Saudi english as a foreign language learners' attitudes toward computer-assisted language learning
Authors: Patricia Obenauf
Venue:  (2007)

This study investigated Saudi English as a Foreign Language (EFL) Learners' attitudes toward Computer-Assisted Language Learning (CALL) at the Institute of Public Administration (IPA) in Saudi Arabia. Five research questions were developed: (1) What are the Saudi EFL learners' general attitudes toward CALL at the IPA? (2) What are Saudi EFL learners' attitudes toward the CALL software used at the IPA? (3) What are the differences between IPA Saudi EFL learners' attitudes toward CALL based on their years of English learning? (4) What are the differences between IPA Saudi EFL learners' attitudes toward CALL based on their current computer knowledge? (5) What are the differences between IPA Saudi EFL learners' attitudes toward CALL based on their gender? The research questionnaire was administered to a total of 578 participants, including students from several levels of English language proficiency, major areas of study, and three distinct locations. Statistical methods including standard deviation, mean, regression analysis, and t-test were used to analyze data. The findings indicated that the Saudi EFL learners' attitudes toward CALL and the software were positive. The results of the regression analysis showed that computer knowledge and gender served as the best predictors of learners' attitudes toward CALL. The t-test findings showed that Saudi female EFL learners had more positive attitudes toward CALL than their male counterparts. The findings of this study will help to improve the use of CALL at the IPA and other college-level institutions in Saudi Arabia.
Locomotion Control of a Hydraulically Actuated Hexapod Robot by Robust Adaptive Fuzzy Control with Self-Tuned Adaptation Gain and Dead Zone Fuzzy Pre-compensation
Authors: Ranjit Kumar Barai, Kenzo Nonami
Venue: Journal of Intelligent and Robotic Systems (2008)

Hydraulically actuated robotic mechanisms are becoming popular for field robotic applications for their compact design and large output power. However, they exhibit nonlinearity, parameter variation and flattery delay in the response. This flattery delay, which often causes poor trajectory tracking performance of the robot, is possibly caused by the dead zone of the proportional electromagnetic control valves and the delay associated with oil flow. In this investigation, we have proposed a trajectory tracking control system for hydraulically actuated robotic mechanism that diminishes the flattery delay in the output response. The proposed controller consists of a robust adaptive fuzzy controller with self-tuned adaptation gain in the feedback loop to cope with the parameter variation and disturbances and a one-step-ahead fuzzy controller in the feed-forward loop for hydraulic dead zone pre-compensation. The adaptation law of the feedback controller has been designed by Lyapunov synthesis method and its adaptation rate is varied by fuzzy self-tuning. The variable adaptation rate helps to improve the tracking performance without sacrificing the stability. The proposed control technique has been applied for locomotion control of a hydraulically actuated hexapod robot under independent joint control framework. For tracking performance of the proposed controller has also been compared with classical PID controller, LQG state feedback controller and static fuzzy controller. The experimental results exhibit a very accurate foot trajectory tracking with very small tracking error with the proposed controller.
Panoramic Localization in the 4-Legged League
Authors: Jürgen Sturm, Paul Rossum, Arnoud Visser
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

The abilities of mobile robots depend greatly on the performance of basic skills such as vision and localization. Although great progress has been made in the 4-Legged league in the past years, the performance of many of those approaches completely depends on the artificial environment conditions established on a 4-Legged soccer field. In this article, an algorithm is introduced that can provide localization information based on the natural appearance of the surroundings of the field. The algorithm starts making a scan of the surroundings by turning head and body of the robot on a certain spot. The robot learns the appearance of the surroundings at that spot by storing color transitions at different angles in a panoramic index. The stored panoramic appearance can be used to determine the rotation (including a confidence value) relative to the learned spot for other points on the field. The applicability of this kind of localization for more natural environments is demonstrated in two environments other than the official 4-Legged league field.