ppxscal/embedding_network huggingface dataset:
An interdisciplinary major emphasizing multimedia
Authors: Carol Spradling, Jody Strauch, Craig Warner
Venue: ACM SIGCSE Bulletin (2008)

In this paper, we describe a new interdisciplinary Bachelor of Science degree in Interactive Digital Media at Northwest Missouri State University, developed and maintained by three departments, Art, Computer Science/Information Systems and Mass Communication. The majors share a common core of courses taught by the three departments with each having its own concentration of Visual Imaging, Computer Science Programming and New Media, respectively. This paper describes the process utilized to develop the major, the curriculum, some observations and the process to maintain the major.
An Illustrated Methodology for Analysis of Error Tolerance
Authors: Melvin A. Breuer, Haiyang (Henry) Zhu
Venue: IEEE Design Test (2008)

Error tolerance deals with the use of defective circuitry that occasionally produces errors, yet provides acceptable performance to users when executing certain applications. Although this concept may seem unappealing, it has been used for some time in several digital systems associated with multimedia signals, such as sound and images. The motivation for using such devices is the related increase in effective yield, and hence lower-cost parts. This article presents a methodology for the analysis of the applicability of error tolerance. The methodology is illustrated with respect to a digital telephone-answering device, but is applicable to a broad class of systems. Key components of this methodology include defining acceptable yet imperfect behavior, determining if a large class of realistic defects in a subsystem provide acceptable behavior at the system level, and determining how to recognize (test) whether a defective subsystem will provide acceptable system performance.
Data replication approaches for ad hoc wireless networks satisfying time constraints
Authors: Xiao Chen
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

Recent advances in technology have enabled the development of ad hoc wireless networks in which a collection of wireless mobile hosts (nodes) may move freely and self-organize into arbitrary and temporary network topologies in areas where communication infrastructures do not exist. In such networks, hosts frequently need data items to finish a certain task. The hosts chosen to store data items are called data servers. If the data items are stored too far away from the requiring host, multiple intermediate hosts are needed to relay the data. This creates a certain amount of delay which is not insignificant in time-critical applications. In this paper, we propose replica allocation schemes to let each host obtain data items in at most k(k ≥ 1) hops using minimal number of data servers in the network. Simulation results show that our schemes can generate a small number of data servers satisfying the k-hop time constraints.
The Spam Filtering Technology Based on SVM and D-S Theory
Authors: Miao Ye, Qiu-Xiang Jiang, Fan-Jin Mai
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The development of spam techniques and rapid increase of spam amount poses a severe challenge to anti-spam technologies. Given the limitation of classification based on mail body textual content, this paper focuses on designing the spam discrimination model based on SVM and D-S theory, which uses SVM with probability to classify e-mail, according to the features of mail headers and mail body respectively, and uses D-S Theory to judge the combination result. Experimental result indicates that the proposed model can improve the accuracy of spam identification.
Using the event calculus to reason about problem diagrams
Authors: Andreas Classen, Robin Laney, Thein Than Tun, Patrick Heymans, Arnaud Hubaux
Venue: Proceedings of the 3rd international workshop on Applications and advances of problem frames (2008)

Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the so-called 'frame concern', a proof obligation that has to hold between them if a problem diagram is to be correct: S, W |- R. The form this proof should take is not fixed a priori. It might, however, be desirable to automate it in order to allow for an efficient analysis of large diagrams. To make this possible, we follow some earlier suggestions to use the Event Calculus as a suitable formalism for these descriptions. The main contribution of the present paper is a set of consistency rules as well as guidelines for passing from a problem diagram to its formal description.
Bead-based single protein micro-array realized through electrostatic self-assembly of carboxylated beads
Authors: Venkataragavalu Sivagnanam, Abdeljalil Sayah, Martin A. M. Gijs
Venue: Microelectronic Engineering (2008)

We report here a simple method, based on electrostatic self-assembly, for realizing bead-based single protein micro-arrays. We generate positively charged surface micro-patterns on a glass substrate and use them as template for adsorbing negatively-charged carboxylated beads. The template for bead adsorption is generated by patterning an aminosilane layer using conventional lift-off technique. The -COOH moiety which is present on the patterned bead surface is activated using carbodiimide chemistry and then a protein of interest is covalently coupled to the bead surface. The patterned beads bind strongly to the aminosilane patterns and they are able to withstand agitated rinse in de-ionized water. We also show here that the same method can be extended for bead patterning within sealed microfluidic channels.
A decoupled approach to exemplar-based unsupervised learning
Authors: Sebastian Nowozin, Gökhan Bakir
Venue: Proceedings of the 25th international conference on Machine learning (2008)

A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possible prototypes to training exemplars. In particular, this has been done for clustering, vector quantization and mixture model density estimation. In this paper we propose a novel algorithm that is theoretically and practically superior to these convex formulations. This is possible by posing the unsupervised learning problem as a single convex "master problem" with non-convex subproblems. We show that for the above learning tasks the subproblems are extremely well-behaved and can be solved efficiently.
Modelling Dynamic Software Architectures using Typed Graph Grammars
Authors: Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi, Hernán Melgratti
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of the structure of a system. A large number of heterogeneous proposals for addressing dynamic architectures at many different levels of abstraction have been provided, such as programmable, ad-hoc, self-healing and self-repairing among others. It is then important to have a clear picture of the relations among these proposals by formulating them into a uniform framework and contrasting the different verification aspects that can be reasonably addressed by each proposal. Our work is a contribution in this line. In particular, we map several notions of dynamicity into the same formal framework in order to distill the similarities and differences among them. As a result we explain different styles of architectural dynamisms in term of graph grammars and get some better insights on the kinds of formal properties that can be naturally associated to such different specification styles. We take a simple automotive scenario as a running example to illustrate main ideas.
Computer Aided Detection of Suspicious Masses and Micro-Calcifications
Authors: M. Hanmandlu, D. Vineel, Vamsi Krishna Madasu, Shantaram Vasikarla
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Mammography is considered as the most effective means for breast cancer diagnosis. This paper introduces two separate techniques for mass and micro-calcification segmentation in digital mammograms. Segmentation of masses consists of three steps- background subtraction, fuzzy texture representation and entropic theresholding. Similarlymicro-calcifications are also segmented in three stages – background subtraction, Laplacian of Gaussian filtering and contrast estimation followed by thresholding. Both the techniques are verified with the markings given by the radiologist and are found to be quite effective tools in diagnosing breast cancer.
On the design and evaluation of web augmented mobile applications
Authors: Natasa Milic-Frayling, Martin Hicks, Rachel Jones, Jamie Costello
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

This paper reports on an exploratory study of a mobile communication prototype mGuide that enables continuous and data rich messaging across the mobile and desktop platform, augmented by complementary Web services. The study focuses on design aspects of the mobile interface and factors that influence the perceived value and usability of such integrated mobile applications. We show how the complexity of image and voice messaging within a location focused scenario can be successfully mediated by careful user interface design, without detracting from utility and experience. More importantly, our study confirms that the integration of personal communication and Web based information services increases the perceived value of mobile applications. Besides the optimized user interface on the device itself, it is the seamless integration with the user's environment that increases the utility of mobile devices and services. We thus propose design recommendations for Web augmented mobile applications and promote a design optimization approach that encompasses flexible integration with Web-based services.
BicOverlapper
Authors: Rodrigo Santamaría, Roberto Therón, Luis Quintales
Venue: Bioinformatics (2008)

Summary: BicOverlapper is a tool to visualize biclusters from gene-expression matrices in a way that helps to compare biclustering methods, to unravel trends and to highlight relevant genes and conditions. A visual approach can complement biological and statistical analysis and reduce the time spent by specialists interpreting the results of biclustering algorithms. The technique is based on a force-directed graph where biclusters are represented as flexible overlapped groups of genes and conditions. Availability: The BicOverlapper software and supplementary material are available at http://vis.usal.es/bicoverlapper Contact: rodri@usal.es
WMicaD: a new digital watermarking technique using independent component analysis
Authors: Thang Viet Nguyen, Jagdish Chandra Patra, Pramod Kumar Meher
Venue: EURASIP Journal on Advances in Signal Processing (2008)

This paper proposes a new two-mark watermarking scheme that is based on the independent component analysis (ICA) technique. The first watermark is used for ownership verification while the second one is used as the copy ID of the image. Using a small-sized support image, the extraction is carried out on size-reduced level, bringing computational advantage to our method. The new method, undergoing a variety of experiments, has shown its robustness against attacks and its capability of detecting tampered area in the image.
2D Decomposition Sequential Equivalence Checking of System Level and RTL Descriptions
Authors: Dan Zhu, Tun Li, Yang Guo, Si-kun Li
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Symbolic simulation-based approach is viable for the sequential equivalence checking (SEC) of SLM-vs.-RTL. However, it can’t avoid the storage explosion introduced by the explosion of the BDD sizes for large designs. For scalability, we introduce two kinds of decomposition techniques: One is the equivalence checking oriented program slicing; the other is the hierarchical insertion of logic cutpoints. And a 2D decomposition SEC method of SLM-vs.-RTL is presented. ”2D decomposition” means decomposition in the space dimension and the time dimension. The verification model is only built for the program slices of a single output variable for each time, which limits the usage of memory. During checking the equivalence of the program slices, the logic cutpoints are inserted to split the verification model of the program slices in the time dimension, which controls the storage explosion further. The promising experimental results demonstrate the benefits brought by our 2D decomposition method.
Modeling collaborations with dynamic structural adaptation in mechatronic UML
Authors: Martin Hirsch, Stefan Henkler, Holger Giese
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

The next generation of advanced mechatronic systems is expected to behave more intelligently than today's systems. These systems are expected to enhance their functionality and improve their performance by building communities of autonomous agents which exploit local and global networking. Such mechatronic systems will therefore include complex coordination protocols which require execution in real-time and reconfiguration of the locally employed control algorithms at runtime to adjust their behavior to the changing system goals leading to self-adaptation. In this paper we will present an extension of the MECHATRONIC UML approach which will enable us to model collaborations between components which include structural adaptation and multi-ports. Besides the modeling of complex collaborations and the rules to join and leave these collaborations via ports and multi-ports, we propose to employ hierarchical state machines with a dynamic number of submachines to model the behavior of the multi-ports. For the collaborations this involves the related protocols, while for the components we have to refine this behavior to ensure a proper synchronization with other parts of the component behavior.
Frequency assignment, multiple interference and binary constraints
Authors: J. S. Graham, R. Montemanni, J. N. J. Moon, D. H. Smith
Venue: Wireless Networks (2008)

The most accurate approaches to frequency assignment problems minimize a cost function based on signal-to-interference ratios at points where reception is required. The merits of this approach are counterbalanced by much greater requirements for computational resources than for the traditional approach using binary frequency separation constraints. This can make run times unrealistic for the largest problems. In this paper the merits of the signal-to-interference based cost function are confirmed, but it is shown that algorithms are faster and give better quality results if this cost function is combined with the binary constraint approach. Two types of algorithm are used to illustrate the combined approach, simulated annealing and a new ant colony system algorithm. The combined approach studied is applicable to all the main classes of frequency assignment problem.
Unsprung wheel-beam interactions using modal and finite element models
Authors: C. J. Bowe, T. P. Mullarkey
Venue: Advances in Engineering Software (2008)

The aim of this study is to simulate the dynamic vertical response of an unsprung mass, i.e. wheel, traversing a beam, i.e. bridge or rail. This is achieved by using the authors' modal or finite element method to model the dynamic interaction that exists between the unsprung mass and the beam. In this paper, the authors compare the final form of the modal method with the final form of the finite element method, and they clearly demonstrate that if the mode shapes of the modal method are replaced by the finite element weighting and shape functions, the finite element method is derived, apart from the stiffness matrix. The results for the moving load compare very well with Akin and Mofid's [Akin JE, Mofid M. Numerical solution for response of beams with moving mass. J Struct Eng 1989;115(1):120-31] solution; however, the results for the moving mass are very different. Other authors who are getting agreement with Akin and Mofid's (1989) moving mass are ignoring the issue of convective acceleration.
Identification of malicious nodes in an AODV pure ad hoc network through guard nodes
Authors: Imran Raza, S. A. Hussain
Venue: Computer Communications (2008)

This paper presents a guard node based scheme to identify malicious nodes in Ad hoc On-Demand Distance Vector (AODV) protocol. In this scheme each node calculates trust level of its neighboring nodes for route selection. Trust calculation process involves opinions of other nodes about the node whose trust level is to be determined. If a neighboring node has a trust level lower than a predefined threshold value, it is identified as malicious and it is not considered for route selection. The proposed model does not use any key distribution process and no changes are made in control packets of AODV. Simulation results show that the proposed scheme improves performance of AODV by identifying and removing malicious nodes. Performance of the scheme has been evaluated for three different types of malicious attacks (impersonation attack, colluding nodes attack and black hole attack).
How people find videos
Authors: Sally Jo Cunningham, David M. Nichols
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

At present very little is known about how people locate and view videos 'in the wild'. This study draws a rich picture of everyday video seeking strategies and video information needs, based on an ethnographic study of New Zealand university students. These insights into the participants' activities and motivations suggest potentially useful facilities for a video digital library.
Will IEEE 802.1X Finally Take Off in 2008?
Authors: Neal Leavitt
Venue: Computer (2008)

It remains to be seen whether proponents can continue improving 802.1X and whether organizations will more widely adopt this technology, which was introduced eight years ago as an authentication tool for local area networks.
Hamiltonicity and reversing arcs in digraphs
Authors: William F. Klostermeyer, L&breve;ubomír S&breve;oltés
Venue: Journal of Graph Theory (1998)

In this paper we introduce a new hamiltonian-like property of graphs. A graph G is said to be cyclable if for each orientation D of G there is a set S of vertices such that reversing all the arcs of D with one end in S results in a hamiltonian digraph. We characterize cyclable complete multipartite graphs and prove that the fourth power of any connected graph G with at least five vertices is cyclable. If, moreover, G is two-connected then its cube is cyclable. These results are shown to be best possible in a sense. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 28: 13&ndash;30, 1998
The Essential Guide to Flex 3 (Essential Guide)
Authors: Charles E Brown
Venue:  (2008)

Flex 3 is the next generation of a technology that revolutionized web applications. It is the next evolutionary step of Flash, which has grown from a web animation medium to a powerful enterprise web design and development platform. With nearly 98% of all web browsers, and a growing number of mobile devices, running Flash Player, a knowledge of Flex is indispensible for any serious web developer. This book will show you how to create powerful Rich Internet Applications using Flex 3. After learning how to install and becoming familiar with the basics of the Flex Builder 3 software, you will explore in depth how the Flash scripting language, ActionScript 3.0, interacts with Flex's powerful XML-like design language: MXML. You'll learn how to construct your applications using layout and navigation containers, and how to move between various states using transitions. There is coverage of how best to plan your applications and use the Model-View-Controller pattern to keep various aspects of development separated and ease creation of potentially complicated projects. Rich Internet Applications rely on data, and this book shows how to bring data from various sources into your Flex application and check its integrity, and how best to display and interact with it. Going farther, applications built for the Flash platform can now exist and function beyond the traditional confines of the web browser. Adobe AIR allows you to take your applications to the desktop, and this book shows how to reapply your Flex skills to take advantage of this new environment. The Essential Guide to Flex 3 takes you through all the powerful features of Flex using a series of stand-alone, practical exercises. The skills acquired throughout the book are then brought together in the form of a full-featured case study application showcasing essential techniques that can easily be applied to your own Flex applications. In this book you'll Learn how to create powerful applications using Adobe Flex 3 Use Flex Builder to design layouts using Flex MXML containers, and see how to combine MXML and ActionScript 3.0 Work your way through a full-featured case study, building a complete Flex application Connect Flex to the ColdFusion application server, creating Flex applications powered by dynamic server-side code Take your web applications to the desktop using Adobe AIR Summary of Contents Chapter 1: Flex Basics Chapter 2: Flex and Flex Builder 3 Chapter 3: ActionScript Chapter 4: Containers Chapter 5: Events and Components Chapter 6: Flex and XML Chapter 7: Formatting and Cascading Style Sheets Chapter 8: The Repeater Component Chapter 9: Drag and Drop Chapter 10: Case Study: Part 1 Chapter 11: Case Study: Part 2 Chapter 12: Flex and Data Chapter 13: Printing Chapter 14: Charting Chapter 15: Adobe Integrated Runtime (AIR)
Modelling landscape dynamics with Python
Authors: D. Karssenberg, K. de Jong, J. van der Kwast
Venue: International Journal of Geographical Information Science (2007)

A new tool for construction of models is presented that allows earth scientists without specialist knowledge in programming to convert theories to numerical computer models simulating landscape change through time. This tool, referred to as the PCRaster Python library, consists of: (1) the standard Python programming language, which is a generic, interpreted scripting language, supporting object oriented programming; (2) a large set of spatial and temporal functions on raster maps that are embedded in the Python language as an extension; (3) a framework provided as a Python class to construct and run iterative temporal models and to calculate error propagation with Monte Carlo simulation; and (4) visualization routines to display spatio-temporal data read and written by this framework. Python is a high-level programming language, and users of the tool do not have to be specialist computer programmers. Users of the PCRaster Python library can take advantage of several other Python libraries, such as extensions for matrix algebra and for modelling in three spatial dimensions.