ppxscal/embedding_network huggingface dataset:
Approximate String Matching Techniques for Effective CLIR Among Indian Languages
Authors: Ranbeer Makin, Nikita Pandey, Prasad Pingali, Vasudeva Varma
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

Commonly used vocabulary in Indian language documents found on the web contain a number of words that have Sanskrit, Persian or English origin. However, such words may be written in different scripts with slight variations in spelling and morphology. In this paper we explore approximate string matching techniques to exploit this situation of relatively large number of cognates among Indian languages, which are higher when compared to an Indian language and a non-Indian language. We present an approach to identify cognates and make use of them for improving dictionary based CLIR when the query and documents both belong to two different Indian languages. We conduct experiments using a Hindi document collection and a set of Telugu queries and report the improvement due to cognate recognition and translation.
Error resiliency transcoding and decoding solutions using distributed video coding techniques
Authors: Tamer Shanableh, Tony May, Faisal Ishtiaq
Venue: Image Communication (2008)

This paper proposes a number of video transcoding techniques for the purpose of adding error resiliency. The proposed solutions make use of distributed video coding technologies that were originally reported in the literature for distributing coding complexity between the encoder and the decoder. Three transcoding solutions are proposed: frequency-domain, time-domain and compressed-domain transcoding, and various decoding architectures are investigated. Error resiliency at the decoder is addressed as a post-process, an integrated process and a pre-process. It is shown that implementing error resiliency as a decoder pre-process and combining this with compressed-domain transcoding removes the need to interfere with the functionality of existing and compliant decoders whilst minimizing complexity. The proposed solutions serve as a framework for boosting the error resiliency of pre-encoded video and can be applied to MPEG-2, and H.264/AVC coded streams.
Weakness in a RSA-based password authenticated key exchange protocol
Authors: Taek-Young Youn, Young-Ho Park, Changhan Kim, Jongin Lim
Venue: Information Processing Letters (2008)

Recently, an efficient password-authenticated key exchange protocol based on RSA has been proposed by Park et al. with formal security proof. In this letter, we analyze their protocol, and show that, unfortunately, it is insecure against an adversary who performs a dictionary attack.
Extending Folksonomies for Image Tagging
Authors: Roman Kern, Michael Granitzer, Viktoria Pammer
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

Due to the unsatisfactory results of content based image retrieval methods, organisation and retrieval of multimedia data strongly relies on metadata and free text description. Folksonomies, collaboratively created sets of metadata, merged recently and help organising multimedia information on the web. Our contribution addresses the question how to extend a classical folksonomy with additional metadata. We also discuss the quality of the extended folksonomy and its application for tag recommendation. We show that some relations of the original folksonomies can be replaced while others are unique. In addition our analysis shows, that for 40% the correct tag is in the first 10% of the set of tag recommendations.
Searching for Metric Structure of Musical Files
Authors: Bozena Kostek, Jaroslaw Wojcik, Piotr Szczuko
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The aim of this paper is to compare the effectiveness of various computational intelligence approaches applied to the task of retrieving musical rhythm from musical symbolic files. The study presented in this paper describes how Artificial Neural Networks and Rough Sets can be used for searching the metric structure of musical files. The described approaches are based on examining physical attributes of sound that are most significant in determining the placement of a particular sound in the accented location of a musical piece. The results of the experiments show that the approach based solely on duration is sufficient enough to retrieve the metric structure of rhythm from musical files.
An improvement of EMD embedding method for large payloads by pixel segmentation strategy
Authors: Chin-Feng Lee, Chin-Chen Chang, Kuo-Hua Wang
Venue: Image and Vision Computing (2008)

In this paper, a novel data hiding method by using pixel segmentation strategy is proposed. The proposed paper keeps (16-p"m) MSBs of a pixel-pair unchanged and alters p"m LSBs to indicate the virtual modifications on an m-dimensional pseudo-random vectors for carrying the secret data, where m=2^p^"^m^-^1-1. The embedding rate of proposed method is R=(log"2(2m+1))/2, which is greater than that of the EMD embedding method proposed by Zhang and Wang [X. Zhang, S. Wang, Efficient steganographic embedding by exploiting modification direction, IEEE Communication Letters 10 (2006) (113), pp.781-783], because the embedding rate of EMD embedding method is R=(log"2(2n+1))/n, when m>2 and n@?2. The experimental results show that the proposed method increases the number of embedded secret bits more than 1.7 times compared with the EMD embedding method. Even with such high embedding capacity, the average PSNR of 44.3dB shows that the visual quality does not decline to an unacceptable degree.
From a Specific Tracking Framework to an Open and Standardized Attention Environment Based on Attention.XML
Authors: Julien Broisin, Philippe Vidal
Venue: Proceedings of the 2nd European conference on Technology Enhanced Learning: Creating New Learning Experiences on a Global Scale (2007)

This paper addresses the challenge of providing users with personalized learning resources by gathering and sharing attention information. Starting from our previous works related to the tracking of learning objects' exploitation within learning systems, we suggest here an extension of this framework based on the Attention.XML standard to offer the opportunity to share attention information between various and heterogeneous applications. An Attention.XML service based on web technologies has been elaborated and integrated within the existing architecture, thus offering standardization and availability to the global environment. This approach makes it easy to integrate existing learning environments and tools, and thus facilitates the generation of attention data specific to these applications.
Verified Protection Model of the seL4 Microkernel
Authors: Dhammika Elkaduwe, Gerwin Klein, Kevin Elphinstone
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

This paper presents a machine-checked high-level security analysis of seL4--an evolution of the L4 kernel series targeted to secure, embedded devices. We provide an abstract specification of the seL4 access control system together with a formal proof that shows how confined subsystems can be enforced. All proofs and specifications in this paper are developed in the interactive theorem prover Isabelle/HOL.
On the Adaptive Real-Time Detection of Fast-Propagating Network Worms
Authors: Jaeyeon Jung, Rodolfo A. Milito, Vern Paxson
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (rate-based sequential hypothesis testing), aims at the large class of worms that attempts to quickly propagate, thus exhibiting abnormal levels of the rate at which hosts initiate connections to new destinations. The foundation of RBS derives from the theory of sequential hypothesis testing, the use of which for detecting randomly scanning hosts was first introduced by our previous work developing TRW [6]. The sequential hypothesis testing methodology enables us to engineer detectors to meet specific targets for false-positive and false-negative rates, rather than triggering when fixed thresholds are crossed. In this sense, the detectors that we introduce are truly adaptive.We then introduce RBS+TRW, an algorithm that combines fan-out rate (RBS) and probability of failure (TRW) of connections to new destinations. RBS+TRW provides a unified framework that at one end acts as pure RBS and at the other end as pure TRW. Selecting an operating point that includes both mechanisms extends RBS's power in detecting worms that scan randomly selected IP addresses. Using four traces from three qualitatively different sites, we evaluate RBS and RBS+TRW in terms of false positives, false negatives, and detection speed, finding that RBS+TRW provides good detection of high-profile worms as well as internal Web crawlers that we use as proxies for targeting worms. In doing so, RBS+TRW generates fewer than 1 false alarm per hour for wide range of parameter choices.
Eulogy: Dov Chevion, 1917-1983
Authors: Isaac L. Auerbach
Venue: IEEE Annals of the History of Computing (1985)

Dov Chevion was a giant among his fellow men and women. He was respected for his strength of leadership, for his commitment toward worthy goals, and as the spokesman in the computer field for Israel for over two decades. He was particularly concerned with education, an area in which he made major contributions.
Querying and indexing XML documents
Authors: Gongzhu Hu, Rafat Hammad
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

In this paper, we describe XMLIndex, a system for indexing and querying XML documents. The overall architecture of this system contains many of the traditional database system components, but extends them to XML documents. We describe the implementation of the system and the mechanism we developed by which XMLIndex can retrieve the data from XML documents efficiently in a very user-friendly way using a graphical user interface. We also compare the execution time for some queries running on this system, and the impact of creating the indexes on the performance.
Usable and Accessible Plain Language (Easy-to-Read) Network Service
Authors: Sami Älli, Kimmo Kyyhkynen, Marianna Ohtonen
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Plain language is language with simplified content, vocabulary and structures. These rules of plain language function quite well also in the web, even though the publication environment differs from that of printed media for which the principles of plain language were originally created.Besides the rules concerning typography and content, publishing plain language material on Internet pages presents major requirements to the visual and organizational structures of the documents. The navigation structure and other structural elements have to facilitate the processes in which plain language users move around and find information in the network service.Existing research data on a suitable visual and structural design of documents which would be best suited for users of plain language have to be integrated with corresponding information on designing documents for cognitively disabled users. Additional information is also needed especially on designing navigation structures for these user groups.
Computer-Aided Generation of Item Banks Based on Ontology and Bloom's Taxonomy
Authors: Ming-Hsiung Ying, Heng-Li Yang
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Online learning and testing are important topics in information education. Students can take online tests to assess their achievement of learning goals. However, the test results should assign student scores and assess their achievement of knowledge and cognition levels. Teachers currently need to spend considerable time on producing and maintaining on-line testing items. This study applied ontology, Chinese semantic database, artificial intelligence and Bloom's taxonomy to propose a CAGIS E-learning system architecture to assist teachers in creating test items. As the result, the computer assisted teachers in producing a large number of test items quickly. These test items covered three types of knowledge and five dimensions of cognitive skills. The test items could meaningfully assess learning level meaningfully.
Probabilistic Choice in Refinement Algebra
Authors: Larissa Meinicke, Ian J. Hayes
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tests, that are suitable for reasoning about programs in a total-correctness framework. Abstract algebraic reasoning also works well when probabilistic programs are concerned, and a general refinement algebra that is suitable for such programs has been defined previously. That refinement algebra does not contain features that are specific to probabilistic programs. For instance, it does not include a probabilistic choice operator, or probabilistic assertions and guards (tests), which may be used to represent correctness properties for probabilistic programs. In this paper we investigate how these features may be included in a refinement algebra. That is, we propose a new refinement algebra in which probabilistic choice, and probabilistic guards and assertions may be expressed. Two operators for modelling probabilistic enabledness and termination are also introduced.
Using Developers' Experience in Cooperative Design Processes
Authors: M. Miatidis, M. Jarke, K. Weidenhaupt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The process industries are characterized by continuous or batch processes of material transformation with the aim of converting raw materials or chemicals into more useful and valuable forms. The design of such processes is a complex process itself that determines the competitiveness of these industries, as well as their environmental impact. Especially the early phases of such design processes, the so-called conceptual design and basic engineering, reveal an inherent creative character that is less visible in other engineering domains, such as in mechanical engineering. This special character constitutes a key problem largely impacting final product quality and cost.As a remedy to this problem, in cooperation with researchers and industrial partners from chemical and plastics engineering, we have developed an approach to capture and reuse experiences captured during the design process. Then, fine-grained method guidance based on these experiences can be offered to the developer through his process-integrated tools. In this section, we describe the application of our approach on the case study of the IMPROVE project. We first report on experiments made with a prototypical implementation of an integrated design support environment in the early project phases, and successively describe how it has been reengineered and extended based on additional requirements and lessons learned.
CSOM for Mixed Data Types
Authors: Fedja Hadzic, Tharam S. Dillon
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In our previous work we presented a variation of Self-Organizing Map (SOM), CSOM that applies a different learning mechanism useful for situations where the aim is to extract rules from a data set characterized by continuous input features. The main change is that the weights on the network links are replaced by ranges which allows for a direct extraction of the underlying rule. In this paper we extend our work by allowing the CSOM to handle mixed data types and continuous class attributes. These extensions called for an appropriate adjustment in the network pruning method that uses the Symmetrical Tau (¿) criterion for measuring the predictive capability of cluster attributes. Publicly available real world data sets were used for evaluating the proposed method and the results demonstrate the effectiveness of the method as a whole for extracting optimal rules from a trained SOM.
Language Identification Based on Phone Decoding for Basque and Spanish
Authors: Víctor G. Guijarrubia, M. Inés Torres
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper presents some experiments in language identification for Spanish and Basque, both official languages in the Basque Country in the North of Spain. We focus on four methods based on phone decoding, some of which make use of phonotactic knowledge. We run also a comparison between the use of a generic and a task-specific phonotactic model. Despite initial poor performances, significant accuracies are achieved when better phonotactic knowledge is used. The use of a task-specific phonotactic model performs slightly better, but it is only useful when using less expensive methods. Finally, we present a temporal evolution of the accuracies. Results show that 5-6 seconds are enough to achieve similar percentage of correctly classified utterances.
Kantian Philosophy of Mathematics and Young Robots
Authors: Aaron Sloman
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

A child, or young human-like robot of the future, needs to develop an information-processing architecture, forms of representation, and mechanisms to support perceiving, manipulating, and thinking about the world, especially perceiving and thinking about actual and possible structures and processes in a 3-D environment. The mechanisms for extending those representations and mechanisms, are also the core mechanisms required for developing mathematical competences, especially geometric and topological reasoning competences. Understanding both the natural processes and the requirements for future human-like robots requires AI designers to develop new forms of representation and mechanisms for geometric and topological reasoning to explain a child's (or robot's) development of understanding of affordances, and the proto-affordances that underlie them. A suitable multi-functional self-extending architecture will enable those competences to be developed. Within such a machine, human-like mathematical learning will be possible. It is argued that this can support Kant's philosophy of mathematics, as against Humean philosophies. It also exposes serious limitations in studies of mathematical development by psychologists.
Nimrod/K: towards massively parallel dynamic grid workflows
Authors: David Abramson, Colin Enticott, Ilkay Altinas
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

A challenge for Grid computing is the difficulty in developing software that is parallel, distributed and highly dynamic. Whilst there have been many general purpose mechanisms developed over the years, Grid programming still remains a low level, error prone task. Scientific workflow engines can double as programming environments, and allow a user to compose 'virtual' Grid applications from pre-existing components. Whilst existing workflow engines can specify arbitrary parallel programs, (where components use message passing) they are typically not effective with large and variable parallelism. Here we discuss dynamic dataflow, originally developed for parallel tagged dataflow architectures (TDAs), and show that these can be used for implementing Grid workflows. TDAs spawn parallel threads dynamically without additional programming. We have added TDAs to Kepler, and show that the system can orchestrate workflows that have large amounts of variable parallelism. We demonstrate the system using case studies in chemistry and in cardiac modelling.
Ant Focused Crawling Algorithm
Authors: Piotr Dziwiński, Danuta Rutkowska
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper presents a new algorithm for hypertext graph crawling. Using an ant as an agent in a hypertext graph significantly limits amount of irrelevant hypertext documents which must be downloaded in order to download a given number of relevant documents. Moreover, during all time of the crawling, artificial ants do not need a queue to central control crawling process. The proposed algorithm, called the Focused Ant Crawling Algorithm, for hypertext graph crawling, is better than the Shark-Search crawling algorithm and the algorithm with best-first search strategy utilizing a queue for the central control of the crawling process.
Discovering and understanding the multi-dimensional correlations among regulatory requirements with application to risk assessment
Authors: Seok-Won Lee
Venue:  (2008)

Security regulations are now considered as a primary driver of efforts for software systems' security lifecycle in an organization. However, with increasing complexity of software systems, understanding the necessity and sufficiency of regulatory security requirements in supporting an environment with "acceptable level of risk" is not a mere checklist exercise. Security breaches most often occur due to a cascading effect of failure among security constraints that work collectively in a socio-technical context. Therefore, while assessing residual risk, certifiers must systematically take into account the nexus of causal chains that exist among security constraints imposed by regulatory requirements. Numerous natural language regulatory requirements specified in documents or listed in spreadsheets/databases do not facilitate such analysis. Furthermore, complex interactions between the software system and its environment are now far beyond the capacity of manual approaches to understand and analyze without additional cognitive aids. This dissertation work outlines a step-wise methodology to discover and understand the multi-dimensional correlations among regulatory security requirements for the purpose of risk assessment. Our lattice algebraic computational model helps estimate the collective adequacy of diverse security constraints imposed by regulatory requirements and their interdependencies with each other to address risks in a bounded scenario of investigation. Abstractions and visual metaphors combine human intuition with metrics available from the methodology to improve the understanding of risks. In addition, a problem domain ontology that classifies and categorizes regulatory requirements from multiple dimensions of a socio-technical environment promotes a common understanding among stakeholders during risk assessment. Our theoretical propositions are empirically validated through a case study designed research in the domain of The United States Department of Defense Information Technology Security Certification and Accreditation Process (DITSCAP). Through this work, we contribute to a new theory of regulatory requirements-driven risk assessment during certification and accreditation activities.
Prism2Promela
Authors: Christopher Power, Alice Miller
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

The Prism model checker facilitates the formal modelling and analysis of systems that exhibit random or probabilistic behaviour. Prism lacks the provision of methods for specification debugging. To help alleviate this problem, we present a tool Prism2Promela for translating Prism into Promela. Once in this form, the SPIN model checker can be used to identify errors in the Promela specification, which can be traced back to corresponding errors in the original Prism specification.