ppxscal/embedding_network huggingface dataset:
An Automated Gridding and Segmentation Method for cDNA Microarray Image Analysis
Authors: Wei-Bang Chen, Chengcui Zhang, Wen-Lin Liu
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Gridding and spot segmentation are two critical steps in microarray gene expression data analysis. However, the problems of noise contamination and donut-shaped spots often make signal extraction process a laborintensive task. In this paper, we propose a three-step method for automatic gridding and spot segmentation. The method starts with a background removal and noise eliminating step, and then proceeds in two steps. The first step applies a fully unsupervised method to extract blocks and grids from the cleaned data. The second step applies a simple, progressive spot segmentation method to deal with inner holes and noise in spots. We tested its performance on real microarray images against a widely used software GenePix. Our results show that the proposed method deals effectively with poor-conditioned microarray images in both gridding and spot segmentation.
Free binary decision diagrams for the computation of EARn
Authors: Jan Kára, Daniel Král
Venue: Computational Complexity (2006)

Free binary decision diagrams (FBDDs) are graph-based data structures representing Boolean functions with the constraint (additional to binary decision diagram) that each variable is tested at most once during the computation. The function EARn is the following Boolean function defined for n × n Boolean matrices: EARn(M) = 1 if the matrix M contains two equal adjacent rows. We prove that each FBDD computing EARn has size at least 20.63 log22n-O(log n log n log n) and we present a construction of such diagrams of size approximately 21.89 log22 n+O(log n).
Hermite polynomials as provably good functions to watermark white gaussian hosts
Authors: Teddy Furon
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the presence of this particular weak signal in content. The article looks at this problem from a classical detection theory point of view, but with side information enabled at the embedding side: the watermark signal is a function of the host content. Our study is twofold. The first issue is to design the best embedding function for a given detection function (a Neyman-Pearson detector structure is assumed). The second issue is to find the best detection function for a given embedding function. This yields two conditions, which are mixed into one 'fundamental' partial differential equation.Solutions of this fundamental equation are heavily dependent on the probability distribution function of the host signals. This conference paper is an extract of [7], where we only look at white gaussian hosts. This gives birth to polynomials solutions known as Hermite polynomial, whose extension is the JANIS watermarking scheme, invented heuristically some years ago.
An Integrated, Low-Power Processor for Image Signal Processing
Authors: Edwin van Dalen, Santiago Gonzalez Pestana, Antoine van Wel
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The imaging market is developing at a high pace. Everywhere, new IC designs are started frequently to keep up with market demands and advanced applications. The Moustique-IC processor presented here is a complete, programmable solution that can reduce the number of silicon iterations by offering increased flexibility while maintaining the cost-effectiveness of a hardwired product. The processor is fully C-programmable, and scalable to keep up with market demands.
Web Application Security Assessment Tools
Authors: Mark Curphey, Rudolph Araujo
Venue: IEEE Security and Privacy (2006)

Security testing a Web application or Web site requires careful thought and planning due to both tool and industry immaturity. Finding the right tools involves several steps, including analyzing the development environment and process, business needs, and the Web application's complexity.
Learning and Education: A Continuing Frontier for AI
Authors: Oliver G. Selfridge
Venue: IEEE Intelligent Systems (2006)

Learning is the most important part of artificial intelligence, and it has made vast strides. But we have far to go. A basic research effort ought to explore certain difficulties and problems in learning in AI. Learning is a large topic indeed, and we must always understand that how humans learn is not necessarily the best way for software to learn. The role of education is to enable and encourage learning, beyond what a human or software system can do by itself. We must explore how to build software that can learn and be educated. This article is part of a special issue on the Future of AI.
Binary codes for locally homogeneous sequences
Authors: Alistair Moffat, Vo Ngoc Anh
Venue: Information Processing Letters (2006)

Static codes for the non-negative integers have a range of applications, including in the storage of inverted indexes, and in dictionary-based compression systems. We present two simple codes based on binary representations that are suited for message sequences in which the values are locally homogeneous, but not globally consistent. Experimental results based on typical sequences are given to show the efficacy of the new methods.
On length adaptation for the least mean square adaptive filters
Authors: Radu Ciprian Bilcu, Pauli Kuosmanen, Karen Egiazarian
Venue: Signal Processing (2006)

We address the problem of length adaptation for adaptive FIR filters implementing the LMS algorithm. In a previous paper, the authors have proposed an algorithm to adjust the length of the adaptive filter toward the optimum for uncorrelated inputs. Here, we extend the previous work to the case of correlated input sequences with emphasis in echo cancellation framework. Analytical expressions of the mean squared error and optimum filter coefficients are presented from which a new method of length adaptation is derived. Simulations, comparing our proposed algorithm with other related approach, in echo cancellation framework, are presented.
Application of multi-objective simulation-optimization techniques to inventory management problems
Authors: Loo Hay Lee, Suyan Teng, Ek Peng Chew, I. A. Karimi, Kong Wei Lye, Peter Lendermann, Yankai Chen, Choon Hwee Koh
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper, we present how a solution framework developed for (a special case of) the multi-objective simulation-optimization problems can be applied to evaluate and optimally select the non-dominated set of inventory policies for two case study problems. Based on the concept of Pareto optimality, the solution framework mainly includes how to evaluate the quality of the selected Pareto set by two types of errors, and how to allocate the simulation replications according to some asymptotic allocation rules. Given a fixed set of inventory policies for both case study problems, the proposed solution method is applied to allocate the simulation replications. Results show that the solution framework is efficient and robust in terms of the total number of simulation replications needed to find the non-dominated Pareto set of inventory policies.
Processor Scheduler for Multi-Service Routers
Authors: Ravi Kokku, Upendra Shevade, Nishit Shah, Ajay Mahimkar, Taewon Cho, Harrick Vin
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

In this paper, we describe the design and evaluation of a scheduler (referred to as Everest) for allocating processors to services in high performance, multi-service routers. A scheduler for such routers is required to maximize the number of packets processed within a given delay tolerance, while isolating the performance of services from each other. The design of such a scheduler is novel and challenging because of three domain-specific characteristics: (1) difficultto- predict and high packet arrival rates, (2) small delay tolerances of packets, and (3) significant overheads for switching allocation of processors from one service to another. These characteristics require that the scheduler be agile and wary simultaneously. Whereas agility enables the scheduler to react quickly to fluctuations in packet arrival rates, wariness prevents the scheduler from wasting computational resources in unnecessary context switches. We demonstrate that by balancing agility and wariness, Everest, as compared to conventional schedulers, reduces by more than an order of magnitude the average delay and the percentage of packets that experience delays greater than their tolerance. We describe a prototype implementation of Everest on Intel's IXP2400 network processor.
On the Generation of Object Databases using Booster
Authors: Jim Davies, James Welch, Alessandra Cavarra, Edward Crichton
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

This paper shows how ideas from a combination of formal techniques can be used to enable the automatic generation of databases from precise object models. It explores how the specification of an object database design can be formalised in terms of method preconditions, method postconditions, and invariant properties-many of which will correspond to integrity constraints for the data representation.
Test Generation for Weak Resistive Bridges
Authors: Shahdad Irajpour, Sandeep K. Gupta, Melvin A. Breuer
Venue: Proceedings of the 15th Asian Test Symposium (2006)

An approach for testing weak resistive bridge targets is developed. The approach is based on defining and generating tests for a set of surrogates associated with each target. Either no or limited timing information is used during test generation. Experimental results show much higher coverage of targets and much lower complexity compared to those for crosstalk targets.
Kalipy: A Tool for Online Performance Analysis of Grid Workflows through Event Correlation
Authors: Francesco Nerieri, Radu Prodan, Thomas Fahringer
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Static scheduling and execution of Grid workflows is prone to severe performance losses due to inaccurate predictions or the dynamic nature of the Grid environment. In this paper we present an online tool for analysing the performance overheads that appear during the real-time execution of workflow applications in Grid environments. We employ event correlation techniques and a distributed superpeer architecture in which each peer correlates local lowlevel activity and middleware events to infer performance overheads related to larger workflow regions at a higher level of abstraction. The rule-based correlation technique provides full extensibility to our approach that requires no source code modification. We demonstrate the functionality of our tool through online performance analysis of a real-world workflow application executed in a Grid environment. We present automatically generated online graphs of correlated events that promptly signal to the end-users the real reasons of run-time performance overheads in their executions.
From the chair
Authors: Janice C. Sipior, Diane Lending
Venue: ACM SIGMIS Database (2006)

I am happy to report that the ACM-SIGMIS CPR (Computer Personnel Research) 2006 Conference was a great success! This year's conference was held at the Shilo Inns Hilltop Hotel in Pomona, California, USA from April 13-15, 2006, http://www.sigmis.org/conferences.html. The SIGMIS CPR 2006 Conference Proceedings can be found in the ACM Digital Library at: http://portal.acm.org/dl.cfm.I would like to thank the members of the 2006 Conference Committee for all their hard work in making this conference a success: Conference Chair:: Conrad Shayo, California State University, San Bernardino Program Co-Chairs: Kate M. Kaiser, Marquette Univ. & Terry Ryan, Claremont Graduate University Local Arrangements: Seta Whitby, University of La Verne Treasurer: Laurie Schatzberg, University of New Mexico Publicity: Tony Coulson, California State University, San Bernardino Doctoral Consortium Co-Chairs: Andrea Tapia, Penn State University & Lynette Kvasny, Penn State UniversityThe third annual "Magid Igbaria Outstanding Conference Paper of the Year Award" was awarded to Margaret F. Reid, Myria W. Allen, Cynthia K. Riemenschneider, and Deborah J. Armstrong, all from the University of Arkansas, for their paper, "Affective Commitment in the Public Sector: The Case of IT Employees." Congratulations to all of you!At the close of the conference, Diane Lending, CPR Committee Chair, held the fourth annual SIGMIS Business Meeting. Conrad Shayo, California State University, San Bernardino, CPR 2006 Conference Chair, presented a Preliminary Outcome Report for the conference. Fred Niederman, St. Louis University, and Mary Sumner, Southern Illinois University Edwardsville, who are the CPR 2007 Conference Co-Chairs, provided a Progress Report for the CPR 2007 Conference. Next year's CPR 2007 Conference will be held April 19-21, 2007 in Saint Louis, Missouri, USA. Please visit www.sigmis.org/2007_CPR_Call_for_Papers.pdf or contact any member of the 2007 Conference Committee for more information: Conference Chairs: Fred Niederman, St. Louis University, niederfa@slu.edu Mary Sumner, Southern Illinois University Edwardsville, msumner@siue.edu Program Co-Chairs: Diane Lending, James Madison University, lendindc@jmu.edu Chelley Vician, Michigan Tech University, cvician@mtu.edu Local Arrangements: Jo Ellen Moore, Southern Illinois University Edwardsville, joemoor@siue.edu Susan Yager, Southern Illinois University Edwardsville, syager@siue.edu Treasurer: Donald Amoroso, Appalachian State University, amoroso@appstate.edu Publicity: Anne Powell, Southern Illinois University Edwardsville, apowell@siue.edu Sandra Newton, University of South Florida, snewton@coba.usf.eduI would like to encourage you to submit your research to the CPR 2007. Everyone is welcome! Please continue to consider the ACM-SIGMIS CPR Conference and Data Base as outlets for your research and sources of information. Your continued support of SIGMIS is appreciated. If you have any suggestions or ideas to improve SIGMIS, please feel free to contact any one of us with. Have a wonderful summer!
Collaborative distributed environments for learning design tasks by means of modelling and simulation
Authors: Crescencio Bravo, Miguel Á. Redondo, Manuel Ortega, M. Felisa Verdejo
Venue: Journal of Network and Computer Applications (2006)

The Simulation discipline has to face new challenges such as the incorporation of Collaborative Technologies for professional use as well as for teaching purposes. This integration permits the creation of new kinds of support for collaborative learning processes. In this paper, we explore the potential of this synergy with DomoSim-TPC, a synchronous distributed collaborative environment for the teaching and learning of Domotics. The system supports an active, simulation-based and problem-based approach for learning house automation design. Using this learning environment, teachers propose and organize problem solving activities and the students carry out, in a collaborative way, the construction of artefacts (designs) using modelling and simulation tools.
Does a shared screen make a shared solution?
Authors: Pierre Dillenbourg, David Traum
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

What is the role of a shared whiteboard in building a shared understanding of the task and its solution? Our hypothesis was that a graphical communication tool would facilitate grounding processes, i.e. the mutual understanding of one or a few utterances and thereby the construction of a shared solution. We conducted an empirical study with 20 pairs solving an enigma in a MUD environment enriched with a whiteboard. The results show that the whiteboard was used less used to disambiguate difficult concepts in conversation than as a tool for distributed regulation of the task. The graphical features of the whiteboard were less exploited thatn the fact that information displayed on the whiteboard was persistent. Subjects selected the communication medium by matching the persistency of display (how long information is displayed) with persistency of information (how long it remains valid). Their grounding behaviour also takes into account the probability that some piece of information probabilty that some piece of infornmation is misundersis misunderstood or disagreed upon.
Spatio-Temporal Context for Robust Multitarget Tracking
Authors: Hieu T. Nguyen, Qiang Ji, Arnold W. M. Smeulders
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In multitarget tracking, the main challenge is to maintain the correct identity of targets even under occlusions or when differences between the targets are small. The paper proposes a new approach to this problem by incorporating the context information. The context of a target in an image sequence has two components: the spatial context including the local background and nearby targets and the temporal context including all appearances of the targets that have been seen previously. The paper considers both aspects. We propose a new model for multitarget tracking based on the classification of each target against its spatial context. The tracker searches a region similar to the target while avoiding nearby targets. The temporal context is included by integrating the entire history of target appearance based on probabilistic principal component analysis (PPCA). We have developed a newincremental scheme that can learn the full set of PPCA parameters accurately online. The experiments show robust tracking performance under the condition of severe clutter, occlusions, and pose changes.
An open framework for foundational proof-carrying code
Authors: Xinyu Feng, Zhaozhong Ni, Zhong Shao, Yu Guo
Venue: Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation (2007)

Today's software systems often use many different computation features and span different abstraction levels (e.g., user code and runtime-system code). To build foundational certified systems, it is hard to have a single verification system supporting all computation features. In this paper we present an open framework for foundational proof-carrying code (FPCC). It allows program modules to be specified and certified separately using different type systems or program logics. Certified modules (i.e., code and proof) can be linked together to build fully certified systems. The framework supports modular verification and proof reuse. It is also expressive enough so that invariants established in specific verification systems are preserved even when they are embedded into our framework. Our work presents the first FPCC framework that systematically supports interoperation between different verification systems. It is fully mechanized in the Coq proof assistant with machine-checkable soundness proof.
Application of hidden Markov models to blind channel characterization and data detection
Authors: J. A. R. Fonollosa, J. Vidal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The paper applies the theory of hidden Markov models (HMM) in digital communications to obtain a complete characterization of the channel, convolutional code, and transmitted constellation in a blind environment, i.e., without the help of a training sequence. The HMM formulation leads to a joint maximum likelihood estimation of both the channel and the transmitted sequence. The Baum-Welch (BW) identification algorithm is able to estimate all the parameters of the model, including the constellation and the probability of each symbol. Minor modifications to the algorithm allow one to consider restrictions or known parameters to improve the estimation of the rest of parameters with methods of lower complexity. An LMS-type adaptive version of the BW algorithm is also developed and tested. The simulation results show the fast convergence of the proposed optimal approaches. They also demonstrate that the performance of the decoder is comparable to that obtained in a known environment.
A Service-oriented Information System for Collaborative Research and Doctoral Education
Authors: Stefan Klink, Andreas Oberweis, Daniel Ried, Ralf Trunko
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Currently supportive information systems for higher education and research are responding to specific information needs within institutes, departments and administration. These separated systems are mainly based on information and service portals or e-learning environments and have typically independently grown over the years. Information systems in the field of higher education mostly support undergraduate students as well as graduate students during their studies. Apart from this there is no real support for special needs doctoral students demand for during their research work. An information system in the field of doctoral research should allow for collaborative work and should support different kinds of processes doctoral students participate in. Our approach is to develop an integrated information system for collaborative research and doctoral education based on a Service Oriented Architecture (SOA).
Motor and Visual Imagery as Two Complementary but Neurally Dissociable Mental Processes
Authors: A. Sirigu, J. R. Duhamel
Venue: Journal of Cognitive Neuroscience (2001)

Recent studies indicate that covert mental activities, such as simulating a motor action and imagining the shape of an object, involve shared neural representations with actual motor performance and with visual perception, respectively. Here we investigate the performance, by normal individual and subjects with a selective impairment in either motor or visual imagery, of an imagery task involving a mental rotation. The task involved imagining a hand in a particular orientation in space and making a subsequent laterality judgement. A simple change in the phrasing of the imagery instructions (first-person or third-person imagery) and in actual hand posture (holding the hands on the lap or in the back) had a strong impact on response time (RT) in normal subjects, and on response accuracy in brain-damaged subjects. The pattern of results indicates that the activation of covert motor and visual processes during mental imagery depends on both top-down and bottom-up factors, and highlights the distinct but complementary contribution of covert motor and visual processes during mental rotation.
New Products
Authors: Eyal de Lara, Keith Farkas
Venue: IEEE Pervasive Computing (2006)

In this issue, editors Eyal de Lara and Keith Farkas review three services: one that lets subscribers use their cell phones to practice for tests, another that lets prospective home buyers use their cell phones to access information about real estate properties, and one that lets users share photos without requiring the photos' recipients to have a computer or broadband Internet connection. They also discuss AirCell's plans to offer high-speed broadband Internet access aboard commercial airplanes and review the Nike+iPod Sport Kit wireless system, a keyboard for Indic phonetic languages, microprocessor-based encryption for mobile devices, and a wall-socket thin-client PC.