ppxscal/embedding_network huggingface dataset:
The Development of a 3D Visualization Tool on the Topic of Cold Front
Authors: Ming-Chao Lin, Chun-Yen Chang
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper presents the development of a Virtual Environmental learning interface on the topic cold front. Due to limited class time and tight course schedule, teachers are usually bound to providing students with 'instant knowledge' that is constructed and disseminated by professional scientific research. Therefore, students often think inactively and learn passively, resulting in their less retention of knowledge in secondary schools in Taiwan. With the design of a visualization 3D tool proposed by the study, learners will better understand the temperature distribution by measuring and simulating temperature parameters in a 3D/VR environment on their own. They will also be provided with greater opportunities to realize that a cold front is defined as the transition zone where a cold air mass is replacing a warm air mass in a 3D sense. The rationale behind the development this type of system is to show that the learning process should emphasize a model that is created by students themselves instead of by teachers' displaying and students' memorizing.
Multiphase Image Segmentation and Modulation Recovery Based on Shape and Topological Sensitivity
Authors: M. Hintermüller, A. Laurain
Venue: Journal of Mathematical Imaging and Vision (2009)

Topological sensitivity analysis is performed for the piecewise constant Mumford-Shah functional. Topological and shape derivatives are combined in order to derive an algorithm for image segmentation with fully automatized initialization. Segmentation of 2D and 3D data is presented. Further, a generalized Mumford-Shah functional is proposed and numerically investigated for the segmentation of images modulated due to, e.g., coil sensitivities.
On the expressive power of process interruption and compensation
Authors: Mario Bravetti, Gianluigi Zavattaro
Venue: Mathematical Structures in Computer Science (2009)

The investigation into the foundational aspects of linguistic mechanisms for programming long-running transactions (such as the scope operator of WS-BPEL) has recently renewed the interest in process algebraic operators that, due to the occurrence of a failure, interrupt the execution of one process, replacing it with another one called the failure handler. We investigate the decidability of termination problems for two simple fragments of CCS (one with recursion and one with replication) extended with one of two such operators, the interrupt operator of CSP and the try-catch operator for exception handling. More precisely, we consider the existential termination problem (existence of one terminated computation) and the universal termination problem (all computations terminate). We prove that, as far as the decidability of the considered problems is concerned, under replication there is no difference between interrupt and try-catch (universal termination is decidable while existential termination is not), while under recursion this is not the case (existential termination is undecidable while universal termination is decidable only for interrupt). As a consequence of our undecidability results, we show the existence of an expressiveness gap between a fragment of CCS and its extension with either the interrupt or the try-catch operator.
Custom Design of JPEG Quantisation Tables for Compressing Iris Polar Images to Improve Recognition Accuracy
Authors: Mario Konrad, Herbert Stögner, Andreas Uhl
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Custom JPEG quantisation matrices are proposed to be used in the context of compressing iris polar images within iris recognition. These matrices are obtained by employing a Genetic algorithm for the corresponding optimisation. Superior matching results in iris recognition in terms of average Hamming distance and improved ROC are found as compared to the use of the default JPEG quantisation table.
Users' adjustments to unsuccessful queries in biomedical search
Authors: G. Craig Murray, Jimmy Lin, John Wilbur, Zhiyong Lu
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Biomedical researchers depend on on-line databases and digital libraries for up to date information. We introduce a pilot project aimed at characterizing adjustments made to biomedical queries that improve search results. Specifically we focus on queries submitted to PubMed®, a large sophisticated search engine that facilitates Web access to abstracts of articles in over 5,200 biomedical journals. On average 2 million users search PubMed each day. During their search, nearly 20% will experience a result page from one of their queries that has zero results. In some cases there really is no document or abstract that will satisfy a particular query. However, in analyzing one month of queries submitted to PubMed, we find that more often than not, queries that retrieved no results are queries that would retrieve something relevant if they were constructed differently. This paper describes a new effort to identify some of the characteristics of a query that produces zero results, and the changes that users most often apply in constructing new, "corrected" queries. Zero-result queries afford us an opportunity to examine changes made to queries that we know did not return relevant data, because they did not return any data. An investigation of the changes users make under these circumstances can yield insight into users' search processes.
A generalized Co-HITS algorithm and its application to bipartite graphs
Authors: Hongbo Deng, Michael R. Lyu, Irwin King
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and papers in scientific literature. However, one of the issues is that previous algorithms only consider the content and link information from one side of the bipartite graph. There is a lack of constraints to make sure the final relevance of the score propagation on the graph, as there are many noisy edges within the bipartite graph. In this paper, we propose a novel and general Co-HITS algorithm to incorporate the bipartite graph with the content information from both sides as well as the constraints of relevance. Moreover, we investigate the algorithm based on two frameworks, including the iterative and the regularization frameworks, and illustrate the generalized Co-HITS algorithm from different views. For the iterative framework, it contains HITS and personalized PageRank as special cases. In the regularization framework, we successfully build a connection with HITS, and develop a new cost function to consider the direct relationship between two entity sets, which leads to a significant improvement over the baseline method. To illustrate our methodology, we apply the Co-HITS algorithm, with many different settings, to the application of query suggestion by mining the AOL query log data. Experimental results demonstrate that CoRegu-0.5 (i.e., a model of the regularization framework) achieves the best performance with consistent and promising improvements.
Connected graph searching in chordal graphs
Authors: Nicolas Nisse
Venue: Discrete Applied Mathematics (2009)

Graph searching was introduced by Parson [T. Parson, Pursuit-evasion in a graph, in: Theory and Applications of Graphs, in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp. 426-441]: given a ''contaminated'' graph G (e.g., a network containing a hostile intruder), the search numbers(G) of the graph G is the minimum number of searchers needed to ''clear'' the graph (or to capture the intruder). A search strategy is connected if, at every step of the strategy, the set of cleared edges induces a connected subgraph. The connected search number cs(G) of a graph G is the minimum k such that there exists a connected search strategy for the graph G using at most k searchers. This paper is concerned with the ratio between the connected search number and the search number. We prove that, for any chordal graph G of treewidth tw(G), cs(G)/s(G)=O(tw(G)). More precisely, we propose a polynomial-time algorithm that, given any chordal graph G, computes a connected search strategy for G using at most (tw(G)+2)(2s(G)-1) searchers. Our main tool is the notion of connected tree-decomposition. We show that, for any connected graph G of chordality k, there exists a connected search strategy using at most (tw(G)@?k/2@?+2)(2s(T)-1) searchers where T is an optimal tree-decomposition of G.
Delineation of malignant areas in histological images of head-neck cancer
Authors: Xiaowei Xu
Venue:  (2008)

Histopathology remains one of the most critical steps in diagnosis and treatment of any kind of cancer. Recently, the improvements in imaging techniques led to the discovery of virtual histological slides, which in fact are high resolution images with a resolution of 0.25 &mu;m/pixel. These images enabled researchers to investigate cancer cell morphologies at the finest level. Traditionally, assessment of tumor margins is done manually by a histopathologist. The procedure requires histological processing of the tumor and examining multiple tissue sections. The number of sections varies based on the size, location, and type of tumor. The recognition of cancer areas is time consuming and error prone because of the nature of the human inspecting. Obviously, the use of fast, reliable computerized systems can markedly increase the number of slides that can be examined for the existence of tumor regions. An automated analysis system can benefit the pathologist by automatically examining potentially hundreds of slides per case, which would be a daunting task to perform manually. In this study, in an effort to detect tumors by examining virtual histological slides we introduced a new classification framework. In general, our system learns from subimages that are labeled by a pathologist and attempts to identify areas that contain cancer cells. The main advantage of our framework is to help pathologists make decision on histopathological slides by exploiting high throughput of whole slide imaging systems. When compared with other histopathological image understanding approaches which only search for cell irregularities locally, whole-slide processing exploiting cluster-based features makes our framework unique in this domain.
Low power reconfigurable sub-band filter bank ASIC for MP3 decoder
Authors: B. P. Gangamamba, P. Muralidhar, N. S. Murthy
Venue: International Journal of Information and Communication Technology (2009)

There is an ever demanding need to develop low power audio devices using MP3 technology. From the profiled results of MP3 algorithm on ARM processors, it has been observed that the synthesis filter bank in the audio decoder consumes maximum power. Hence, to reduce the power consumption of the filter bank, we developed an IEEE 754 single precision floating-point runtime reconfigurable architecture. The proposed architecture consumes less power at run time as the last 12 bits of the mantissa part of the synthesis filter coefficients are zero most of the time and, hence, the corresponding multipliers will be switched off. Since the active multipliers during inverse polyphase quadrature mirror filter banks (IPQMF) are less, we are able to achieve low powered decoding process without significantly compromising on the accuracy and speed. We synthesised and simulated the architecture using 0.35 &mu;m process technology under synopsys environment. A uniform worst case power reduction of 23.7&#37; has been achieved in the frequency range from 1 MHz to 20 MHz when all the multipliers are in active state.
CP-summary: a concise representation for browsing frequent itemsets
Authors: Ardian Kristanto Poernomo, Vivekanand Gopalkrishnan
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

This paper tackles the problem of summarizing frequent itemsets. We observe that previous notions of summaries cannot be directly used for analyzing frequent itemsets. In order to be used for analysis, one requirement is that the analysts should be able to browse all frequent itemsets by only having the summary. For this purpose, we propose to build the summary based upon a novel formulation, conditional profile (or c-profile). Several features of our proposed summary are: (1) each profile in the summary can be analyzed independently, (2) it provides error guarantee (ε-adequate), and (3) it produces no false positives or false negatives. Having the formulation, the next challenge is to produce the most concise summary which satisfies the requirement. In this paper, we also designed an algorithm which is both effective and efficient for this task. The quality of our approach is justified by extensive experiments. The implementations for the algorithms are available from www.cais.ntu.edu.sg/~vivek/pubs/cprofile09.
On the Chromaticity of Multi-Bridge Hypergraphs
Authors: S. A. Bokhary, Ioan Tomescu, Akhlaq Ahmad Bhatti
Venue: Graphs and Combinatorics (2009)

A multi-bridge hypergraph is an h-uniform linear hypergraph consisting of some linear paths having common extremities. In this paper it is proved that the multisets of path lengths of two chromatically equivalent multi-bridge hypergraphs are equal provided the multiplicities of path lengths are bounded above by 2h-1&#x00a0;&#x2212;&#x00a0;2. Also, it is shown that h-uniform linear cycles of length m are not chromatically unique for every m, h&#x00a0;&#x2265;&#x00a0;3.
A Collaborative Filtering Approach to Personalized Interactive Entertainment using MPEG-21
Authors: Phivos Mylonas, Giorgos Andreou, Kostas Karpouzis
Venue: Proceeding of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies (2007)

In this chapter we present an integrated framework for personalized access to interactive entertainment content, using characteristics from the emerging MPEG-21 standard. Our research efforts focus on multimedia content presented within the framework set by today's movie content broadcasting over a variety of networks and terminals, i.e. analogue and digital television broadcasts, video on mobile devices, personal digital assistants and more. This work contributes to the bridging of the gap between the content and the user, providing end-users with a wide range of real-time interactive services, ranging from plain personalized statistics and optional enhanced in-play visual enhancements to a fully user-and content-adaptive platform. The proposed approach implements and extends in a novel way a well-known collaborative filtering approach; it applies a hierarchical clustering algorithm on the data towards the scope of group modelling implementation. It illustrates also the benefits from the MPEG-21 components utilization in the process and analyzes the importance of the Digital Item concept, containing both the (binary) multimedia content, as well as a structured representation of the different entities that handle the item, together with the set of possible actions on the item. Finally, a use case scenario is presented to illustrate the entire procedure. The core of this work is the novel group modelling approach, on top of the hybrid collaborative filtering algorithm, employing principles of taxonomic knowledge representation and hierarchical clustering theory. The outcome of this framework design is the fact that end-users are presented with personalized forms of multimedia content, thus enhancing their viewing experience and creating more revenue opportunities to content providers.
On the time synchronization of distributed log files in networks with local broadcast media
Authors: Björn Scheuermann, Wolfgang Kiess, Magnus Roos, Florian Jarre, Martin Mauve
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Real-world experiments in computer networks typically result in a set of log files, one for each system involved in the experiment. Each log file contains event timestamps based on the local clock of the respective system. These clocks are not perfectly accurate, and deviate from each other. For a thorough analysis, however, a common time basis is necessary. In this paper, we tackle the fundamental problem of creating such a common time base for experiments in networks with local broadcast media, where transmissions can be received by more than one node. We show how clock deviations and event times can be estimated with very high accuracy, without introducing any additional traffic in the network. The proposed method is applied after the experiment is completed, using just the set of local log files as its input. It leads to a large linear program with a very specific structure. We exploit the structure to solve the synchronization problem quickly and efficiently, and present an implementation of a specialized solver. Furthermore, we give analytical and numerical evaluation results and present real-world experiments, all underlining the performance and accuracy of the method.
Extending moodle to better support computing education
Authors: Guido Rößling, Andreas Kothe
Venue: ACM SIGCSE Bulletin (2009)

Learning Management Systems such as Moodle are popular teaching tools with a broad spectrum of features. However, several aspects relevant for computing education are typically missing. This includes the annotation of materials, such as scripts or exercises, the inclusion of slides, and the integration of algorithm visualizations. We present Moodle activities that add these features to Moodle.
Microsoft Office Powerpoint 12
Authors: R. Pasewark
Venue:  (2007)

Microsoft PowerPoint 2007 Introductory is designed for beginning users of Microsoft Office 2007. This self-paces, step-by-step book with corresponding screenshots makes learning easy and enjoyable. Students will learn the new features of the software through a variety of activities, simulations, and case studies. End-of-lesson exercises reinforce the skills covered in each lesson. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Why Rely on Blind AIMDs?
Authors: Ioannis Psaras, Mehrdad Dianati, Rahim Tafazolli
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

We are motivated by the fact that fixed Increase rates and Decrease ratios for AIMD cannot adjust TCP's performance to the Internet's diverse networking conditions. Indeed, we find that fixed values for the increase/decrease factors of AIMD restrain flexibility, which is a fundamental property of transport protocols in order to guarantee utilization and fairness in Modern and Future internetworks. We propose a new paradigm for hybrid AIMD designs that has the potential to adjust TCP's behavior according to network conditions.The proposed Multi-Rate AIMD (MR-AIMD) increases additively the Additive Increase factor of AIMD in case of positive feedback and decreases multiplicatively (the AI factor) in case of negative feedback and Explicit Congestion Notifications. In other words, MR-AIMD takes into account ECN signals in order to quantify the level of network contention and adjusts its response accordingly.We show that MR-AIMD reduces retransmission effort significantly, when contention is high, becomes aggressive when contention decreases and tolerates against random, transient errors due to fading channels.
A framework for monitoring agent-based normative systems
Authors: Sanjay Modgil, Noura Faci, Felipe Meneguzzi, Nir Oren, Simon Miles, Michael Luck
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

The behaviours of autonomous agents may deviate from those deemed to be for the good of the societal systems of which they are a part. Norms have therefore been proposed as a means to regulate agent behaviours in open and dynamic systems, where these norms specify the obliged, permitted and prohibited behaviours of agents. Regulation can effectively be achieved through use of enforcement mechanisms that result in a net loss of utility for an agent in cases where the agent's behaviour fails to comply with the norms. Recognition of compliance is thus crucial for achieving regulation. In this paper we propose a generic architecture for observation of agent behaviours, and recognition of these behaviours as constituting, or counting as, compliance or violation. The architecture deploys monitors that receive inputs from observers, and processes these inputs together with transition network representations of individual norms. In this way, monitors determine the fulfillment or violation status of norms. The paper also describes a proof of concept implementation and deployment of monitors in electronic contracting environments.
Zeno Revisited: Representation of Persuasive Argument
Authors: Katie Atkinson, Trevor Bench-Capon
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

In this paper we explore and contrast different forms of dispute representation from the present and past literature. In particular, we examine the Zeno Framework, which represents disputes as dialectical trees, and compare this to other abstract systems for argument representation. We discuss the merits of each method and show how the example argument first represented in Zeno can be transformed into a more concise representation whilst retaining its desirable features.
Voxel Based Adaptive Meshless Method for Cardiac Electrophysiology Simulation
Authors: Phani Chinchapatnam, Kawal Rhode, Matthew Ginks, Prasanth Nair, Reza Razavi, Simon Arridge, Maxime Sermesant
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

In this paper, an adaptive meshless method is described for solving the modified FitzHugh Nagumo equations on a set of nodes directly imported from the voxels of the medical images. The non-trivial task of constructing suitable meshes for complex geometries to solve the reaction-diffusion equations is circumvented by a meshfree implementation. The spatial derivatives arising in the reaction diffusion system are estimated using the Lagrangian form of scattered node radial basis function interpolant. Normal cardiac activation phenomena is fast, with a very steep upstroke and localised as compared to the size of the computational domain. To accurately capture this phenomena, a space adaptive method is presented where extra nodes are placed near the region of the activation front. The performance of the adaptive method is investigated first for synthetic geometry and then applied to a real-life geometry obtained from magnetic resonance imaging. Numerical results suggest that the presented method is capable of predicting realistic electrophysiology simulation effectively.