ppxscal/embedding_network huggingface dataset:
Online Tracking of Migrating and Proliferating Cells Imaged with Phase-Contrast Microscopy
Authors: Kang Li, Eric D. Miller, Lee E. Weiss, Phil G. Campbell, Takeo Kanade
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Automated visual-tracking of cell population in vitro using phase-contrast time-lapse microscopy is vital for the quantitative and systematic study of cell behaviors, including spatiotemporal quantification of migration, proliferation, and apoptosis. The low image quality, high and varying density of the cell culture, and the complexity of cell behaviors pose many challenges to existing tracking techniques. This paper presents a fully-automated multitarget tracking system that can simultaneously track hundreds of cells and efficiently cope with these challenges. The approach exploits a fast topology-constrained level-set method in conjunction with a stochastic motion filter, with a careful formulation that makes it suitable for real-time tracking during acquisition. Our methodology was applied to human tissue cell tracking in vitro under various imaging conditions and yielded a 88.4% tracking accuracy.
High order schemes based on upwind schemes with modified coefficients
Authors: Yuyue Yang, Mingjun Li, Shi Shu, Aiguo Xiao
Venue: Journal of Computational and Applied Mathematics (2006)

The upwind schemes play an important role in CFD. In this paper, some high order schemes are constructed without expanding the stencil and by modifying coefficients (MC) of the upwind schemes. According to our theoretical analysis, we show that MC approach preserves the desirable properties which the underlying schemes possess. We apply these new schemes to the linear scalar equation, Burgers equation and the hyperbolic system of conservation laws for simulating Rayleigh-Taylor instability, and show that MC approach increases the accurate order and improves efficiency in comparison with the underlying scheme.
Evolving Standard Process Reference Models for Product Line Development
Authors: Christoph Hoyer, Gerhard Chroust
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Component Based Development (CBD) significantly improves software engineering by enabling and enforcing reuse and as a consequence productivity and quality. Product Line development (PLD) concepts in addition promise increased uniformity with respect to external appearance of software products and internal structure of reusable artefacts ("assets") beyond a single product for a whole range of products. Key to successful software component reuse and to Software Product Line development is the management of product variations within specified architected limits by providing controlled variations of constituent software components within specified over-all product characteristics. This cannot be an afterthought it has to be modelled from the very beginning. Current process models and process standards often lack an adequate orientation to and consideration of cross-product uniformity and variation, resulting in problems during the enactment of a Product Line approach: the desirable variation within the software products cannot be described. To reap the benefits of the advantages of PLD variability all subprocesses of the development process have to be analyzed in order to identify necessary evolvement towards a PLD approach. In this paper we describe a possible high-level structuring of a Product Line methodology process, analyze the ISO/IEC 12207 process framework and identify processes where the consideration of controlled product variation may require special support and re-orientation of the process. We further characterize the support necessary for relevant subprocesses.
Edge Suppression by Gradient Field Transformation Using Cross-Projection Tensors
Authors: Amit Agrawal, Ramesh Raskar, Rama Chellappa
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We propose a new technique for edge-suppressing operations on images. We introduce cross projection tensors to achieve affine transformations of gradient fields. We use these tensors, for example, to remove edges in one image based on the edge-information in a second image. Traditionally, edge suppression is achieved by setting image gradients to zero based on thresholds. A common application is in the Retinex problem, where the illumination map is recovered by suppressing the reflectance edges, assuming it is slowly varying. We present a class of problems where edge-suppression can be a useful tool. These problems involve analyzing images of the same scene under variable illumination. Instead of resetting gradients, the key idea in our approach is to derive local tensors using one image and to transform the gradient field of another image using them. Reconstructed image from the modified gradient field shows suppressed edges or textures at the corresponding locations. All operations are local and our approach does not require any global analysis. We demonstrate the algorithm in the context of several applications such as (a) recovering the foreground layer under varying illumination, (b) estimating intrinsic images in non-Lambertian scenes, (c) removing shadows from color images and obtaining the illumination map, and (d) removing glass reflections.
Supporting scientific discovery processes in Discovery Net: Research Articles
Authors: Jameel Syed, Moustafa Ghanem, Yike Guo
Venue: Concurrency and Computation: Practice Experience (2007)

The activity of e-Science involves making discoveries by analysing data to find new knowledge. Discoveries of value cannot be made by simply performing a pre-defined set of steps to produce a result. Rather, there is an original, creative aspect to the activity that by its nature cannot be automated. In addition to finding new knowledge, discovery therefore also concerns finding a process to find new knowledge. How discovery processes are modelled is therefore key to effectively practicing e-Science. We argue that since a discovery process instance serves a similar purpose to a mathematical proof it should have similar properties, namely it allows results to be deterministically reproduced when re-executed and that intermediate results can be viewed to aid examination and comprehension. We examine the issues involved for software environments used to make discoveries to preserve these properties, and show how they are tackled in the Discovery Net system. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Proceedings of the 2006 workshop on ML
Venue: International Conference on Functional Programming (2006)

It is our great pleasure to welcome you to the 2006 ACM SIGPLAN Workshop on ML. The ML family of programming languages, whose most popular variants are SML and OCaml, has inspired a tremendous amount of computer science research, both practical and theoretical, and ML continues to underpin a variety of applications, ranging from compilers and theorem provers to low-level system software.The call for papers attracted 17 submissions. Each paper was evaluated by at least three international referees. During a five-day electronic meeting, the program committee selected nine submissions for presentation at the workshop.We are also fortunate to have an invited talk from Stephen Weeks, lead developer of MLton, the whole-program optimizing compiler for Standard ML. An abstract of his talk is included in these proceedings.
Entropy model of the investment portfolio
Authors: A. Yu. Popkov
Venue: Automation and Remote Control (2006)

A stochastic model of the investment portfolio based on maximization of entropy was proposed. The model claims at simulating behavior of the investor at portfolio formation. Consideration was given to the computational methods adapted to the problems arising in these models.
Group formation in large social networks: membership, growth, and evolution
Authors: Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, Xiangyang Lan
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

The processes by which communities come together, attract new members, and develop over time is a central research issue in the social sciences - political movements, professional organizations, and religious denominations all provide fundamental examples of such communities. In the digital domain, on-line groups are becoming increasingly prominent due to the growth of community and social networking sites such as MySpace and LiveJournal. However, the challenge of collecting and analyzing large-scale time-resolved data on social groups and communities has left most basic questions about the evolution of such groups largely unresolved: what are the structural features that influence whether individuals will join communities, which communities will grow rapidly, and how do the overlaps among pairs of communities change over time.Here we address these questions using two large sources of data: friendship links and community membership on LiveJournal, and co-authorship and conference publications in DBLP. Both of these datasets provide explicit user-defined communities, where conferences serve as proxies for communities in DBLP. We study how the evolution of these communities relates to properties such as the structure of the underlying social networks. We find that the propensity of individuals to join communities, and of communities to grow rapidly, depends in subtle ways on the underlying network structure. For example, the tendency of an individual to join a community is influenced not just by the number of friends he or she has within the community, but also crucially by how those friends are connected to one another. We use decision-tree techniques to identify the most significant structural determinants of these properties. We also develop a novel methodology for measuring movement of individuals between communities, and show how such movements are closely aligned with changes in the topics of interest within the communities.
SAEPTUM: verification of ELAN hardware specifications using the proof assistant PVS
Authors: Mauricio Ayala-Rincón, Thomas M. Sant'Ana
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

Rewriting and Rewriting-Logic have been used in several applications, including specification, formal verification and construction of proof assistants. Previous works explored hardware specification and modeling using the rewriting-logic system ELA. Experiences proved this to be very effective, but certainly restricted as a tool for formal verification of the correctness of the given hardware specifications. Although simple, verification had to be done exhaustively and manually, which indicated the need of automating this process. We present SAEPTUM, a methodology and tool for the verification of rewrite specifications created in ELAN, via the translation to the proof assistant PVS and automatic generation of critical pair based correction criteria.
A pattern for almost compositional functions
Authors: Björn Bringert, Aarne Ranta
Venue: ACM SIGPLAN Notices (2006)

This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for a number of the constructors in the type(s), the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern are given. The relationship to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory are also investigated.
The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
Authors: Kurt Bryan, Tanya Leise
Venue: SIAM Review (2006)

Google&apos;s success derives in large part from its PageRank algorithm, which ranks the importance of web pages according to an eigenvector of a weighted link matrix. Analysis of the PageRank formula provides a wonderful applied topic for a linear algebra course. Instructors may assign this article as a project to more advanced students or spend one or two lectures presenting the material with assigned homework from the exercises. This material also complements the discussion of Markov chains in matrix algebra. Maple and Mathematica files supporting this material can be found at www.rose-hulman.edu/~bryan.
StatCache: a probabilistic approach to efficient and accurate data locality analysis
Authors: E. Berg, E. Hagersten
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

The widening memory gap reduces performance of applications with poor data locality. Therefore, there is a need for methods to analyze data locality and help application optimization. In this paper we present StatCache, a novel sampling-based method for performing data-locality analysis on realistic workloads. StatCache is based on a probabilistic model of the cache, rather than a functional cache simulator. It uses statistics from a single run to accurately estimate miss ratios of fully-associative caches of arbitrary sizes and generate working-set graphs. We evaluate StatCache using the SPEC CPU2000 benchmarks and show that StatCache gives accurate results with a sampling rate as low as 10/sup -4/. We also provide a proof-of-concept implementation, and discuss potentially very fast implementation alternatives.
On L_1-Norm Multi-class Support Vector Machines
Authors: Lifeng Wang, Xiaotong Shen, Yuan F. Zheng
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Binary Support Vector Machines (SVM) have proven effec- tive in classiffication. However, problems remain with respect to feature selection in multi-class classification. This article proposes a novel multi-class SVM, which performs classifica- tion and feature selection simultaneously via L_1-norm penal- ized sparse representations. The proposed methodology, to- gether with our developed regularization solution path, per- mits feature selection within the framework of classiffication. The operational characteristics of the proposed methodol- ogy is examined via both simulated and benchmark exam- ples, and is compared to some competitors in terms of the accuracy of prediction and feature selection. The numeri- cal results suggest that the proposed methodology is highly competitive.
Teaching Grid Computing in North Carolina: Part II
Authors: Barry Wilkinson, Clayton Ferner
Venue: IEEE Distributed Systems Online (2006)

North Carolina students studied grid computing in a course taught across multiple universities in fall 2004 and fall 2005. This department describes the student assignments and the instructors' general experiences in offering the course.The first part of this article appears in IEEE Distributed Systems Online's June 2006 Education department.
A fast algorithm to find the region-of-interest in the compressed MPEG domain
Authors: G. Agarwal, A. Anbu, A. Sinha
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We propose a fast, yet simple algorithm to find the region of interest (ROI) from a compressed MPEG video bitstream, with partial decoding. We have used the properties of the human visual system (HVS), applied in the DCT domain, to extract the ROIs. Though a lot of work has been done to obtain ROIs in images based on the HVS, all these systems work in the pixel domain. However, finding the ROIs in the compressed domain has wide applications such as emphasizing perceptually important regions while transrating, defining descriptors for encoded video (MPEG-7), changing image size to adapt to heterogeneous client displays, etc.
Mesh based 3D shape deformation for image based rendering from uncalibrated multiple views
Authors: Satoshi Yaguchi, Hideo Saito
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In this paper, we present a method to improve the quality of synthesized new view images for Image Based Rendering approach from uncalibrated multiple views targeting the detailed texture objects. To deform 3D model using the information such as image texture and object silhouette, the difference between the real object and the reconstructed model is evaluated as a function of optimization problem. The refined model provides a quite accurate dense corresponding relation between the images, so that high quality image can be synthesized at arbitrary viewpoint. We also demonstrate the proposed method by showing new view images rendered by the proposed method.
IEEE Design & Test of Computers 2006 Annual Index, Volume 23
Venue: IEEE Design Test (2006)

This index includes all items appearing in IEEE Design & Test during 2006 that are considered to have archival value.
An Approach to Knowledge-Based Verification of Actions in Planning of Cognitive Agents' Behavior
Authors: Agnieszka Pieczynska, Grzegorz Popek
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The problem of planning actions carried out by cognitive agent is discussed. Plan is a sequence of actions that are executed to achieve agent's intentions. The module of plans' verification and choice is presented. The method of the measure of success rate of plans' execution is proposed.
Dr. LEGOHead, Ph.D.: a real-world story construction environment
Authors: Richard Borovoy
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

This demonstration will introduce a new kind of real-world construction environment designed to support children's creation of stories. Prior real-world constructionist environments for children were designed to support the creation of machines and creatures. Through the construction of these devices, children discovered many powerful ideas from disciplines such as mathematics and engineering. However, the low-level "brick and motor" approach to building required children to focus more on mechanical and electrical engineering, and less on the kind of "narrative engineering" toward which they are naturally inclined. Research is currently being conducted into the value of construction environments that emphasize narrative, as well as other forms, of construction.
Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number
Authors: Yonatan Bilu
Venue: Journal of Combinatorial Theory Series B (2006)

Hoffman's bound on the chromatic number of a graph states that χ ≥ 1 -λ1/λn. Here we show that the same bound, or slight modifications of it, hold for several graph parameters related to the chromatic number: the vector coloring number, the ψ-covering number and the λ-clustering number.
Introducing Strong Forms of Bilingual Education in the Mainstream Classroom: A Case for Technology
Authors: Marie-Luce Bourguet
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Bilingual education programs whose aim is to support the development of balanced bilingualism belong to "strong" forms of bilingual education. Other desired outcomes of strong forms of bilingual education are cognitive advantages and better school achievement. The goal of our research is to explore how technology can help introducing strong forms of bilingual education for minority language children in mainstream classrooms. We present a first prototype (the OCOL model) that successfully recreates a bilingual learning environment. A study into the prototype shows that appropriate technology can help children achieve balanced bilingualism and biliteracy. We then discuss the aims, requirements and enabling technologies for the deployment of bilingual educational systems for children in mainstream education. Key areas for further research are identified and discussed: supporting bilingual language development, supporting curriculum acquisition in two languages, providing fair assessment tools, and improving communication and collaboration in multilingual environments.
Interactive Tabletop Exhibits in Museums and Galleries
Authors: Tom Geller
Venue: IEEE Computer Graphics and Applications (2006)

Just as online shopping is a bellwether of advanced online technologies, so are museum and gallery showcases for the best in computer display and interface technology. In the first case, commerce demands that speed and reliability get priority, in the latter, technological invisibility is foremost. The museum experience is an unusually tactile, sensual one, and the standard keyboard-mouse-and-screen setup might seem out of place. This trend toward sensual involvement is particularly noticeable in tabletop displays, as they appeal to two aspects of familiar daily life: the horizontal surface as a workspace, and hand gestures (or common objects) as tools for manipulating information.
A Geometric Theory of Symmetric Registration
Authors: Hemant D. Tagare, David Groisser, Oskar Skrinjar
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper shows that asymmetry (inverse inconsistency) in L2 and information theoretic (IT) registration objective functions is the result of using standard volume differential forms. A new space with non-standard volume differential forms is identified, and a unique symmetrizing volume differential form is found in it. This form simultaneously symmetrizes the L2 and the IT registration functions. Experimental results supporting the mathematical theory are provided.
On Power Lines Communications Channels' Characteristics of Markov
Authors: Mingyue Zhai
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Impulse noise is one of the important facts impairing the performance of the power line communications systems (PLC). The partitioned Markov chain was proposed to evaluate the impairments caused by the impulse noise and to model the power communications channels. The Baulm- Welch algorithm was employed to calculate the basic transition matrix to avoid the less robust computation with the nonlinear fitting method. In order to easy and quick computation, the partitioned Markov chain was proposed to evaluate the Baulm-Welch algorithm has been adapted to the partitioned Markov chain. To verify the proposed method, four modulation schemes have been implemented in both home and office environments. Based on the measurements, the corresponding basic transition matrixes were calculated. The detailed analysis of the basic transition matrixes shows the good agreement with other research results, which mean the correctness of the proposed partitioned Markov chain to model PLC channels