ppxscal/embedding_network huggingface dataset:
Simulation and comparison of communication protocols in ad hoc network
Authors: Gaurav Sethi, Manoj Kumar
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

MOBILE ad hoc networks (MANETs) are collections of mobile nodes, dynamically forming a temporary network without pre-existing network infrastructure or centralized administration. In this work there is a comparison of three routing protocols using various metrics such as Delay, Jitter, Sequence number, throughput, mobility, scalability, number of packets dropped with 3-D comparison. Further metrics can be used to analysis number of packet dropped, average delays, jitters of packets, sequence number of sent packets. Furthermore recommendations are given as per results. It is concluded that DSR performs fairly well with small and medium sized network. TORA performs well with dynamic networks.
Subjective and Objective Watermark Detection Using a Novel Approach --- Barcode Watermarking
Authors: Vidyasagar Potdar, Song Han, Elizabeth Chang, Chen Wu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Many digital watermarking algorithms are proposed in the literature. Broadly these watermarking algorithms can be classified into two main categories. The first category of algorithms uses a pseudo random Gaussian sequence (PRGS) watermark whereas the second category of algorithms uses a binary logo as a watermark. The main advantage of PRGS based watermarking scheme is its ability to detect the presence of watermark without manual intervention. However the main drawback is calculating reliable threshold value. In the similar manner the main advantage of binary logo watermark is that there is no need to calculate threshold value but requires manual intervention to detect the presence of watermark. The advantage and disadvantage of either approach is quite clear hence it would be a good idea to design a watermarking scheme which inherits the advantages from both these approaches. In this paper we present one such approach which is termed as bar-code watermarking. The proposed scheme offers objective as well as subjective detection. A PRGS sequence watermark is represented as a bar-code on a binary logo and embedded in the host image. Watermark detection can be either done subjectively or objectively.
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Authors: Yang Xiang, Wanling Zhang
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Most existing algorithms for DCSPs are extensions of centralized backtracking or iterative improvement with breakout. Their worst case complexity is exponential. On the other hand, directional consistency based algorithms solve centralized CSPs efficiently if primal graph density is bounded. No known multiagent algorithms solve DCSPs with the same efficiency. We propose the first such algorithm and show that it is sound and complete.
Multimodal Interaction: Real Context Studies on Mobile Digital Artefacts
Authors: Tiago Reis, Marco Sá, Luís Carriço
Venue: Proceedings of the 3rd international workshop on Haptic and Audio Interaction Design (2008)

The way users interact with mobile applications varies according to the context where they are. We conducted a study where users had to manipulate a multimodal questionnaire in 4 different contexts (home, park, subway and driving), considering different variables (lighting, noise, position, movement, type of content, number of people surrounding the user and time constraints) that affect interaction. This study aimed at understanding the effect of the context variables in users' choices regarding the interaction modalities available (voice, gestures, etc). We describe the results of our study, eliciting situations where users adopted specific modalities and the reasons for that. Accordingly, we draw conclusions on users' preferences regarding interaction modalities on real life contexts.
Utilizing Dynamic Executable Models for User Interface Development
Authors: Grzegorz Lehmann, Marco Blumendorf, Sebastian Feuerstack, Sahin Albayrak
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

In this demonstration we present the Multi Access Service Platform (MASP), a model-based runtime architecture for user interface development based on the idea of dynamic executable models. Such models are self-contained and complete as they contain the static structure, the dynamic state information as well as the execution logic. Utilizing dynamic executable models allows us to implement a rapid prototyping approach and provide mechanisms for the extension of the UI modeling language of the MASP.
Effect of Using Tungsten-Anode X-Ray Tubes on Dose and Image Quality in Full-Field Digital Mammography
Authors: Jennifer M. Oduko, Kenneth C. Young, Ozcan Gundogdu, Abdulaziz Alsager
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Dose and image quality have been evaluated for two types of digital mammography system which have X-ray tubes with tungsten anodes, the Siemens Novation and the Hologic Selenia. For each system, contrast-to-noise ratio and threshold contrast measurements were made. The results were used to determine the optimum exposure settings for each system to meet the achievable image quality standard of the European Guidelines. For the Selenia systems, dose savings between 9% and 52% were achieved by using a tungs-ten-target tube, for PMMA thicknesses ranging from 20 to 70mm. For the Novation, for the same range of PMMA thicknesses simulating breasts, the dose saving was 10% to 50% when using a W/Rh rather than Mo/Mo target-filter combination. When comparing W/Rh with Mo/Rh for the Novation, a more modest dose reduction ranging from 4% to 18% was achieved.
Secure systems development using security-typed languages
Authors: Boniface Patrick Hicks
Venue:  (2007)

To protect sensitive, electronic data against corruption and leakage by computer applications, business, military, medical, and other organizations establish high-level security policies. For these to be effective, however, the policies must be implemented in computer systems. This introduces a semantic gap between high-level, security policy semantics and the low-level, operational semantics of computer systems. Bridging this semantic gap by proving that high-level policy semantics are actually implemented in a computer system is a daunting problem. Security-typed languages are a new tool for building applications that verifiably implement information ow policies. By joining these language tools with systems principles, we find that it is possible to bridge the semantic gap in security policy. In particular, we focus on the systems principles of modularity, separation of security policy from mechanism, policy expressiveness and portability. When applying these systems principles to existing security-typed languages, additional policy and runtime infrastructure necessary is needed. In this dissertation, we develop designs and implementations of the runtime and policy infrastructure that is lacking. We also provide systems architectures, formal analyses and software engineering tools, along with multiple applications that use this infrastructure to verifiably implement high-level security policies in systems of applications. We find that, by applying some systems principles with the infrastructure they require, we can use STLs for building secure systems that verifiably enforce high-level security policies.
Evaluation of Subspace Clustering Quality
Authors: Urszula Markowska-Kaczmar, Arletta Hurej
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Subspace clustering methods seek to find clusters in different subspaces within a data set instead of searching them in full feature space. In such a case there is a problem how to evaluate the quality of the clustering results. In this paper we present our method of the subspace clustering quality estimation which is based on adaptation of Davies-Bouldin Index to subspace clustering. The assumptions which were made to build the metrics are presented first. Then the proposed metrics is formally described. Next it is verified in an experimental way with the use of our clustering method IBUSCA. The experiments have shown that its value reflects a quality of subspace clustering thus it can be an alternative in the case where there is no expert's evaluation.
Borel Complexity of Topological Operations on Computable Metric Spaces
Authors: Vasco Brattka, Guido Gherardi
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We study the Borel complexity of topological operations on closed subsets of computable metric spaces. The investigated operations include set theoretic operations as union and intersection, but also typical topological operations such as the closure of the complement, the closure of the interior, the boundary and the derivative of a set. These operations are studied with respect to different computability structures on the hyperspace of closed subsets. These structures include positive or negative information on the represented closed subsets. Topologically, they correspond to the lower or upper Fell topology, respectively, and the induced computability concepts generalize the classical notions of r.e. or co-r.e. subsets, respectively. The operations are classified with respect to effective measurability in the Borel hierarchy and it turns out that most operations can be located in the first three levels of the hierarchy, or they are not even Borel measurable at all. In some cases the effective Borel measurability depends on further properties of the underlying metric spaces, such as effective local compactness and effective local connectedness.
A Chemical Memory Snapshot
Authors: Jörn-Marc Schmidt
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

Smart cards and embedded systems are part of everyday life. A lot of them contain sensitive data like keys used in secure applications. These keys have to be transferred from non-volatile to static memory to generate signatures or encrypt data. Hence, the possibility to read out the static memory of a device is a crucial security threat. This paper presents a new technique to read out secret data from the internal static memory of a cryptographic device. A chemical reaction of the top metal layer of a decapsulated chip is used to identify lines connected to the positive power supply. Using this information, we are able to obtain the content of memory cells like the secret key of a cryptographic system.
The IBM Rich Transcription 2007 Speech-to-Text Systems for Lecture Meetings
Authors: Jing Huang, Etienne Marcheret, Karthik Visweswariah, Vit Libal, Gerasimos Potamianos
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

The paper describes the IBM systems submitted to the NIST Rich Transcription 2007 (RT07) evaluation campaign for the speech-to-text (STT) and speaker-attributed speech-to-text (SASTT) tasks on the lecture meeting domain. Three testing conditions are considered, namely the multiple distant microphone (MDM), single distant microphone (SDM), and individual headset microphone (IHM) ones --- the latter for the STT task only. The IBM system building process is similar to that employed last year for the STT Rich Transcription Spring 2006 evaluation (RT06s). However, a few technical advances have been introduced for RT07: (a) better speaker segmentation; (b) system combination via the ROVER approach applied over an ensemble of systems, some of which are built by randomized decision tree state-tying; and (c) development of a very large language model consisting of 152M n-grams, incorporating, among other sources, 525M words of web data, and used in conjunction with a dynamic decoder. These advances reduce STT word error rate (WER) in the MDM condition by 16% relative (8% absolute) over the IBM RT06s system, as measured on 17 lecture meeting segments of the RT06s evaluation test set, selected in this work as development data. In the RT07 evaluation campaign, both MDM and SDM systems perform competitively for the STT and SASTT tasks. For example, at the MDM condition, a 44.3% STT WER is achieved on the RT07 evaluation test set, excluding scoring of overlapped speech. When the STT transcripts are combined with speaker labels from speaker diarization, SASTT WER becomes 52.0%. For the STT IHM condition, the newly developed large language model is employed, but in conjunction with the RT06s IHM acoustic models. The latter are reused, due to lack of time to train new models to utilize additional close-talking microphone data available in RT07. Therefore, the resulting system achieves modest WERs of 31.7% and 33.4%, when using manual or automatic segmentation, respectively.
Designing Graphical Elements for Cognitively Demanding Activities: An Account on Fine-Tuning for Colors
Authors: Gilles Tabart, Stéphane Conversy, Jean-Luc Vinot, Sylvie Athènes
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

Interactive systems evolve: during their lifetime, new functions are added, and hardware or software parts are changed, which can impact graphical rendering. Tools and methods to design, justify, and validate user interfaces at the level of graphical rendering are still lacking. This not only hinders the design process, but can also lead to misinterpretation from users. This article is an account of our work as designers of colors for graphical elements. Though a number of tools support such design activities, we found that they were not suited for designing the subtle but important details of an interface used in cognitively demanding activities. We report the problems we encountered and solved during three design tasks. We then infer implications for designing tools and methods suitable to such graphical design activities.
Periodicity properties on partial words
Authors: F. Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg
Venue: Information and Computation (2008)

The concept of periodicity has played over the years a central role in the development of combinatorics on words and has been a highly valuable tool for the design and analysis of algorithms. Fine and Wilf's famous periodicity result, which is one of the most used and known results on words, has extensions to partial words, or sequences that may have a number of ''do not know'' symbols. These extensions fall into two categories: the ones that relate to strong periodicity and the ones that relate to weak periodicity. In this paper, we obtain consequences by generalizing, in particular, the combinatorial property that ''for any word u over {a, b}, ua or ub is primitive,'' which proves in some sense that there exist very many primitive partial words.
Readable and Accurate Rulesets with ORGA
Authors: Md Nor Daud, David Corne
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

A key task for data mining is to produce accurate and descriptive models. `Human readable' models are often necessary to enable understanding, potentially leading to further insight, and also inducing trust in the user. Rules, or decision trees (if not too numerous or large) are readable, unlike, for example SVM models. However, descriptiveness and accuracy normally conflict; a challenge is to find algorithms that have both high accuracy and high readability. We introduce ORGA (Optimized Ripper using Genetic Algorithm) which hybridizes evolutionary search with the RIPPER ruleset algorithm. RIPPER is effective at producing accurate and readable rulesets, and we show that ORGA provides significant further improvement. ORGA outperforms overall a suitable set of comparative algorithms including implementations of RIPPER, C4.5 and PART. On a majority of the datasets, ORGA's outperformance of the other algorithms is spectacular, and it is rarely dominated in terms of both accuracy and readability.
Visualizing Domain Interaction Networks and the Impact of Alternative Splicing Events
Authors: Dorothea Emig, Karsten Klein, Anne Kunert, Petra Mutzel, Mario Albrecht
Venue: Proceedings of the 2008 Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (2008)

In recent years, comprehensive studies of protein and domain networks have produced large amounts of interaction data. Further work has revealed that alternative splicing is a major cause of the observed protein and interaction diversity. Special microarrays now allow for measuring gene expression at the exon level, which enables the identification of alternative splicing events. We developed the Cytoscape plugin DomainGraph that facilitates the construction and visualization of protein and domain interaction networks. This plugin additionally supports the integration of exon expression data to highlight the effects of alternative splicing on the networks. We also designed and implemented a radial layout algorithm that specifically takes the integrated biological information for the networks into account and improves the visual presentation of the protein domain graphs considerably.
The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports
Authors: Eng-Wee Chionh
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

It has been established that the bivariate Dixon matrix persists to be the exact resultant when there are at most two exposed points at each corner of a corner-cut support; but it becomes singular when there are four or more exposed points at any of the corners. For the remaining case of three or fewer exposed points at each of the corners, it is observed that the Dixon matrix is maximal but its determinant is a multiple of the resultant with a priori known bracket powers as the extraneous factors. The maximality of the Dixon matrix for the three-or-fewer exposed points case has been established mechanically for the special situation in which the excess degree is unity when there are three exposed points at a corner. This paper presents a greatly simplified mechanical proof so that its validity can be easily verified.
A Noun-Predicate Bigram-Based Similarity Measure for Lexical Relations
Authors: Hyopil Shin, Insik Cho
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

The method outlined in this paper demonstrates that the information-theoretic similarity measure and noun-predicate bigrams are effective methods for creating lists of semantically-related words for lexical database work. Our experiments revealed that instead of serious syntactic analysis, bigrams and morpho-syntactic information sufficed for the feature-based similarity measure. We contend that our method would be even more appreciated if it applied to a raw newswire corpus in which unlisted words in existing dictionaries, such as recently-created words, proper nouns, and syllabic abbreviations, are prevailing.
Creating a Fuzzy Believer to Model Human Newspaper Readers
Authors: Ralf Krestel, René Witte, Sabine Bergler
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

We present a system capable of modeling human newspaper readers. It is based on the extraction of reported speech, which is subsequently converted into a fuzzy theory-based representation of single statements. A domain analysis then assigns statements to topics. A number of fuzzy set operators, including fuzzy belief revision, are applied to model different belief strategies. At the end, our system holds certain beliefs while rejecting others.
An investigation of pointer machines
Authors: Desh Ranjan
Venue:  (2007)

Pointer machines are computational Models which originated in the earliest days of information theory. First attempts at generalizing Turing machines led to the initial creation of pointer machines. Despite their long history however, pointer machines have only been lightly studied in the past. A principle reason for this scarcity of results has been the lack of a clear niche for their use. For example, in complexity studies the Turing machine is principally used, while in algorithm analysis the random access machine (RAM) is the preeminent model. This dissertation makes two contributions to the study of pointer machines. The first contribution is to suggest a natural role for pointer machines in the investigation of lower bounds. This includes investigating which problems and algorithms have equivalent bounds between RAMs and various pointer machines. This dissertation gives sortie simple conditions for establishing when the run time of an algorithm is asymptotically identical between a RAM and a pointer machine. A second contribution is a series of fundamental results towards understanding the differences between the many different models which have been grouped together under the term 'pointer machine'. This includes several separation results between these various models and some additional results about their differing computational power.
Prospects and problems of wireless communication for underwater sensor networks
Authors: Liu Lanbo, Zhou Shengli, Cui Jun-Hong
Venue: Wireless Communications Mobile Computing (2008)

This paper reviews the physical fundamentals and engineering implementations for efficient information exchange via wireless communication using physical waves as the carrier among nodes in an underwater sensor network (UWSN). The physical waves under discussion include sound, radio, and light. We first present the fundamental physics of different waves; then we discuss and compare the pros and cons for adopting different communication carriers (acoustic, radio, and optical) based on the fundamental first principles of physics and engineering practice. The discussions are mainly targeted at underwater sensor networks (UWSNs) with densely deployed nodes. Based on the comparison study, we make recommendations for the selection of communication carriers for UWSNs with engineering countermeasures that can possibly enhance the communication efficiency in specified underwater environments. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Reasoning About Operations on Sets
Authors: Bernhard Heinemann
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

The present paper is about a framework of formal topological reasoning originating from the fundamental work of Moss and Parikh relating to this. We add a set of unary operators involving sets to that system. This new means of expression gives us considerably more expressive power with regard to spatial operations, but the accompanying logic remains sound and semantically complete with respect to the class of all subset spaces that are enriched accordingly. Moreover, the new logic turns out to be decidable. We prove these results by relying heavily on a particular extension of the common modal formalism, viz hybrid logic.