ppxscal/embedding_network huggingface dataset:
Functional genomics in chickens: development of integrated-systems microarrays for transcriptional profiling and discovery of regulatory pathways: Conference Reviews
Authors: L. A. Cogburn, X. Wang, W. Carre, L. Rejto, S. E. Aggrey, M. J. Duclos, J. Simon, T. E. Porter
Venue: Comparative and Functional Genomics (2004)

The genetic networks that govern the differentiation and growth of major tissues of economic importance in the chicken are largely unknown. Under a functional genomics project, our consortium has generated 30 609 expressed sequence tags (ESTs) and developed several chicken DNA microarrays, which represent the Chicken Metabolic&#x002F;Somatic (10 K) and Neuroendocrine&#x002F;Reproductive (8 K) Systems (). One of the major challenges facing functional genomics is the development of mathematical models to reconstruct functional gene networks and regulatory pathways from vast volumes of microarray data. In initial studies with liver-specific microarrays (3.1 K), we have examined gene expression profiles in liver during the peri-hatch transition and during a strong metabolic perturbation &mdash; fasting and re-feeding &mdash; in divergently selected broiler chickens (fast vs. slow-growth lines). The expression of many genes controlling metabolic pathways is dramatically altered by these perturbations. Our analysis has revealed a large number of clusters of functionally related genes (mainly metabolic enzymes and transcription factors) that control major metabolic pathways. Currently, we are conducting transcriptional profiling studies of multiple tissues during development of two sets of divergently selected broiler chickens (fast vs. slow growing and fat vs. lean lines). Transcriptional profiling across multiple tissues should permit construction of a detailed genetic blueprint that illustrates the developmental events and hierarchy of genes that govern growth and development of chickens. This review will briefly describe the recent acquisition of chicken genomic resources (ESTs and microarrays) and our consortium's efforts to help launch the new era of functional genomics in the chicken. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Turtles and defense
Authors: Patrick G. Sobalvarro, Leigh L. Klotz
Venue: Issue 82 (October 1982) (1982)

At Terrapin, we feel that our two main products, the Terrapin Turtle&reg;, and the Terrapin Logo Language1 for the Apple II, bring together the fields of robotics and AI to provide hours of entertainment for the whole family. We are sure that an enlightened application of our products can uniquely impact the electronic battlefield of the future.
Implicit Surfaces Make for Better Silhouettes
Authors: Slobodan Ilic, Mathieu Salzmann, Pascal Fua
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper advocates an implicit-surface representation of generic 3-D surfaces to take advantage of occluding edges in a very robust way. This lets us exploit silhouette constraints in uncontrolled environments that may involve occlusions and changing or cluttered backgrounds, which limit the applicability of most silhouette based methods. This desirable behavior is completely independent from the way the surface deformations are parametrized. To show this, we demonstrate our technique in three very different cases: Modeling the deformations of a piece of paper represented by an ordinary triangulated mesh; tracking a personýs shoulders whose deformations are expressed in terms of Dirichlet Free Form Deformations; reconstructing the shape of a human face parametrized in terms of a Principal Component Analysis model.
The 2003 Supply Chain Management Trading Agent Competition
Authors: Raghu Arunachalam, Norman Sadeh
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Supply Chain Management deals with the planning and coordination of bidding, production and procurement activities across the multiple organizations involved in the delivery of one or more products. With the emergence of electronic marketplaces, it is only natural to seek automated solutions that are capable of rapidly evaluating a large number of bidding and procurement options. In this paper, we present an integrated model that incorporates supply chain bidding, production and procurement. We discuss its computational complexity as well as the challenges that arise from the inherently stochastic and competitive nature of the resulting environment. A Web-based multi-agent simulation game based on this model was developed and validated in the context of the first Supply Chain Trading Agent Competition (TAC SCM 2003), where a total of 20 teams from around the world competed with one another. We review key agent strategies developed by competing teams and discuss the merits of competition-based research over more traditional research methodologies in this area.
Investigating the effectiveness of mental workload as a predictor of opportune moments for interruption
Authors: Shamsi T. Iqbal, Brian P. Bailey
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This work investigates the use of workload-aligned task models for predicting opportune moments for interruption. From models for several tasks, we selected boundaries with the lowest (Best) and highest (Worst) mental workload. We compared effects of interrupting primary tasks at these and Random moments on resumption lag, annoyance, and social attribution. Results show that interrupting at the Best moments consistently caused less resumption lag and annoyance, and fostered more social attribution. Results demonstrate that use of workload-aligned models offers a systematic method for predicting opportune moments.
Active Service for Mobile Middleware
Authors: Siu-Nam Chuang, Alvin T. Chan
Venue: World Wide Web (2005)

This paper describes a dynamic service reconfiguration model where the proxy is composed of a chain of service objects called mobilets (pronounced as mo-be-lets), which can be actively deployed onto a network. This model offers flexibility because the chain of mobilets can be dynamically reconfigured to adapt to dynamic changes in the wireless environment, without interrupting service provision for other mobile nodes. We have realized the dynamic service reconfiguration model by crafting its design into a programmable infrastructure that forms the baseline architecture of the WebPADS (short for Web Proxy for Actively Deployable Services) system.
Broadcast Trees for Heterogeneous Platforms
Authors: O. Beaumont, L. Marchal, Y. Robert
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree is used to implement this operation, and the objective is to find the tree which maximizes the throughput, i.e. the average number of slices sent by the source processor every time-unit. We introduce several heuristics to solve this problem. The good news is that the best heuristics perform quite efficiently, reaching more than 70% of the absolute optimal throughput, thereby providing a simple yet efficient approach to achieve very good performance for broadcasting on heterogeneous platforms.
Motion capture and visualization of the hip joint with dynamic MRI and optical systems: Research Articles
Authors: Lydia Yahia-Cherif, Benjamin Gilles, Tom Molet, Nadia Magnenat-Thalmann
Venue: Computer Animation and Virtual Worlds (2004)

We present a methodology for motion tracking and visualization of the hip joint by combining MR images and optical motion capture systems. MRI is typically used to capture the subject's anatomy while optical systems are used to capture and analyse the relative movement between adjacent bones of the joint. Reflective markers are attached to the subject's skin and their trajectories are tracked and processed. However, the skin surface deforms while in motion due to muscle contraction leading to significant errors in the estimation of trajectories. In order to reduce these errors, we use MR images to capture both the anatomy and the trajectories of the bone. Prior to the scanning, we attach skin markers to the subject in order to analyse the markers displacements relative to the bone. We reconstruct the anatomical models of the subject and we compute the markers trajectories from the images. Using these calculated trajectories, we select the best markers configuration based on the criteria of markers displacements. The optimized configuration is used for recording external movements with the optical motion capture system. The resulting animation is mapped onto the virtual body of the subject including internal bones and the joint motion is visualized. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Fast, efficient, recovering, and irreversible
Authors: Visvesh Sathe, Juang-Ying Chueh, Joohee Kim, Conrad H. Ziesler, Suhwan Kim, Marios C. Papaefthymiou
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Recent advances in CMOS VLSI design have taken us to real working chips that rely on controlled charge recovery to operate at sub-stantially lower power dissipation levels than their conventional counterparts. In this paper, we present two such chips that were designed in our research group and highlight some of the promising charge-recovery techniques in practice. Although their origins can be traced back to the early adiabatic circuits, these techniques approach energy recycling from a more practical angle, shedding reversibility to achieve operating frequencies in excess of 1GHz with relatively low overheads
Classification in geographical information systems
Authors: Salvatore Rinzivillo, Franco Turini
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The paper deals with the problem of knowledge discovery in spatial databases. In particular, we explore the application of decision tree learning methods to the classification of spatial datasets. Spatial datasets, according to the Geographic Information System approach, are represented as stack of layers, where each layer is associated with an attribute. We propose an ID3-like algorithm based on an entropy measure, weighted on a specific spatial relation (i.e. overlap). We describe an application of the algorithm to the classification of geographical areas for agricultural purposes.
Multi-View Stereo Reconstruction of Dense Shape and Complex Appearance
Authors: Hailin Jin, Stefano Soatto, Anthony J. Yezzi
Venue: International Journal of Computer Vision (2005)

We address the problem of estimating the three-dimensional shape and complex appearance of a scene from a calibrated set of views under fixed illumination. Our approach relies on a rank condition that must be satisfied when the scene exhibits "specular + diffuse" reflectance characteristics. This constraint is used to define a cost functional for the discrepancy between the measured images and those generated by the estimate of the scene, rather than attempting to match image-to-image directly. Minimizing such a functional yields the optimal estimate of the shape of the scene, represented by a dense surface, as well as its radiance, represented by four functions defined on such a surface. These can be used to generate novel views that capture the non-Lambertian appearance of the scene.
Scheduling and optimal register placement for synchronous circuits derived using software pipelining techniques
Authors: Noureddine Chabini, El Mostapha Aboulhamid, Ismaïl Chabini, Yvon Savaria
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Data dependency constraints constitute a lower bound P on the minimal clock period of single-phase clocked sequential circuits. In contrast to methods based on basic retiming, clocked sequential circuits with clock period P can always be obtained using software pipelining techniques. Such circuits can be derived by any method that can be framed in the following four-step process: Step 1, determine P; Step 2, compute a valid periodic schedule of the computational elements; Step 3, place registers back to the circuit; Step 4, assign the clock signals to control registers.Methods with polynomial run-time to implement this process are proposed in the literature. They implement these steps sequentially, starting with Step 1. These methods do not know how to optimally place registers which leads to an unnecessary number of registers. In this article, we address the problem of how to simultaneously implement Steps 2 and 3 in order to minimize the total number of registers. We conjecture that the problem is NP-hard in its general form. We formulate the problem for the first time in the literature, and devise a Mixed Integer Linear Program (MILP) to solve it. From this MILP, we derive a linear program to determine approximate solutions to the problem for large general circuits. We show that the proposed approach can handle nonzero clock skew. Experimental results confirm the effectiveness of the approach and show that significant reductions of the number of registers can be obtained although register sharing is not used. When the schedule is given, the proposed approach provides solutions to the problem of how to place the minimal number of registers in Step 3.
Communication Models for Algorithm Design in Networked Sensor Systems
Authors: Yang Yu, Viktor K. Prasanna, Bo Hong
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

Towards building a systematic methodology of algorithm design of applications of networked sensor systems, we formally define two link-wise communication models, the Collision Free Model (CFM) and the Collision Aware Model (CAM).While CFM provides ease of programming and analysis for high level application functionality, CAM enables more accurate performance analysis and hence more efficient algorithms through cross-layer optimization, at the cost of increased programming and analysis complexity.We use the example of optimizing a probability based broadcasting scheme under CAM to illustrate algorithm optimization.Our analytical results indicate that the optimal broadcast probability for either maximizing the reachability within a given latency constraint or minimizing the latency for a given reachability constraint decreases rapidly with node density.
Testimony before the subcommittee on small business crime prevention act
Authors: Leslie D. Ball
Venue: ACM SIGSAC Review (1984)

My name is Leslie D. Ball. I am Professor of Information Systems at Babson College where I am responsible for teaching and developing computer graduate and undergraduate courses for students who are business majors. In addition, I have done extensive research in the area of computer crime and security and am active in various professional organization.
Philips Electronics Synchronizes Its Supply Chain to End the Bullwhip Effect
Authors: Ton de Kok, Fred Janssen, Jan van Doremalen, Erik van Wachem, Mathieu Clerkx, Winfried Peeters
Venue: Interfaces (2005)

Demand variability increases as one moves up a supply chain. The demand for finished products is less variable than for subassemblies, which is less variable than for individual components. This phenomenon is known as the bullwhip or Forrester effect. It increases inventory unnecessarily and makes managing the capacity of equipment and personnel difficult. In 1999, Philips Semiconductors confirmed substantial bullwhip effects in some of its supply chains and began developing a collaborative-planning process and tool to reduce them. It sought to reduce inventory and increase customer-service levels by integrating its supply chain planning and control with those of its customers. By applying stochastic multiechelon inventory theory, it developed an advanced planning and scheduling system that supports weekly collaborative planning of operations by Philips Semiconductors and one of its customers, Philips Optical Storage. The project has brought substantial savings. A conservative estimate shows minimum yearly savings of around US$5 million from $300 million yearly turnover. More important, Philips Optical Storage now has a more flexible and reliable supplier that can virtually guarantee quantities and delivery times. Philips Semiconductor is rolling out its new approach to other customers.
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
Authors: Abraham D. Flaxman, Alan M. Frieze, Juan C. Vera
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In combinatorial optimization, a popular approach toNP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guaranteed to produce a solution which is within a known multiplicative factor of optimal. Unfortunately, the known factor is often known to be large in pathological instances. Conventional wisdom holds that, in practice, approximation algorithms will produce solutions closer to optimal than their proven guarantees. In this paper, we use the rigorous-analysis-of-heuristics framework to investigate this conventional wisdom.We analyze the performance of 3 related approximation algorithms for the uncapacitated facility location problem (from [Jain, Mahdian, Markakis, Saberi, Vazirani, 2003] and [Mahdian, Ye, Zhang, 2002]) when each is applied to an instances created by placing n points uniformly at random in the unit square. We find that, with high probability, these 3 algorithms do not find asymptotically optimal solutions, and, also with high probability, a simple plane partitioning heuristic does find an asymptotically optimal solution.
A Kummer-type transformation for a 2F2 hypergeometric function
Authors: R. B. Paris
Venue: Journal of Computational and Applied Mathematics (2005)

We obtain a Kummer-type transformation for the 2F2(x) hypergeometric function with general parameters in the form of a sum of 2F2(-x) functions. This result is specialised to the case where one pair of parameters differs by unity to generalize a recent result of Miller (J. Comput. Appl. Math. 157 (2003) 507).
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
Authors: Alexander Greß, Reinhard Klein
Venue: Graphical Models (2004)

In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in terms of adaptation to the object surface. In consequence, we obtain considerably more compact implicit representations especially in case of thin object structures. We describe a new isosurface extraction algorithm for this kind of implicit representation. In contrast to related algorithms for octrees, it generates 2-manifold meshes even for kd-trees with cells containing multiple surface components. The algorithm retains all the good properties of the Dual Contouring approach by Ju et al. [ACM Trans. Graphics 21 (2002) 339-346] like feature preservation, computational efficiency, etc. In addition, we present a simplification framework for the surfaces represented by the kd-tree based on quadric error metrics. We adapt this framework to quantify the influence of topological changes, thereby allowing controlled topological simplification of the object. The advantages of the new algorithm are demonstrated by several examples.
A flexible simulation framework for graphics architectures
Authors: J. W. Sheaffer, D. Luebke, K. Skadron
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2004)

In this paper we describe a multipurpose tool for analysis of the performance characteristics of computer graphics hardware and software. We are developing Qsilver, a highly configurable micro-architectural simulator of the GPU that uses the Chromium system's ability to intercept and redirect an OpenGL stream. The simulator produces an annotated trace of graphics commands using Chromium, then runs the trace through a cycle-timer model to evaluate time-dependent behaviors of the varios functional units. We demonstrate the use of Qsilver on a simple hypothetical architecture to analyze performance bottlenecks, to explore new GPU microarchitectures, and to model power and leakage properties. One innovation we explore is the use of dynamic voltage scaling across multiple clock domains to achieve significant energy savings at almost negligible performance cost. Finally, we discuss how other architectural features and experiments might be incorporated into the Qsilver framework.
Self-organizing maps of web spaces based on formal characteristics
Authors: Cristina Faba-Pérez, Vicente P. Guerrero-Bote, Félix de Moya-Anegón
Venue: Information Processing and Management: an International Journal (2005)

The unceasing growth of electronic information available on the Web has made it indispensable to develop tools to analyse and evaluate its quality. Given the subjectivity underlying most of the qualitative analytical indicators at the present time, we here propose the use of characteristics or indicators of a formal character. We apply Kohonen's neural networks and study their topological organization in order to analyse how Web spaces behave with respect to these networks' formal characteristics. The interpretation of the results brings out the underlying structures and relationships in a closed Web environment.
Exhibition: computational schemes for biomimetic sculpture
Authors: Brower Hatcher, Karl Aspelund, Andrew Willis, Jasper Speicher, David B. Cooper
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The Mid-Ocean Studio, Brown University's SHAPE lab, and Goldsmiths College are collaborating on a prototype system for the automatic evolution of biomimetic sculpture using structural automata. This collaboration is resulting in effective, computerized means to autogenerate large, increasingly complex works of art, and allowing for a long-anticipated development of the desire to create works that reflect and respond to the environment they are in. We propose to create an installation that allows visitors to a site at Goldsmiths College to experience and interact with the development of our structures.
Embedded Multiple Subbands Scaling Image Coding Based on Integer Wavelet Transforms
Authors: Li-bao Zhang, Ke Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The Integer Wavelet Transform (IWT) allows both lossy and lossless compression using a single bitstream. However, its rate-distortion performance is inferior to the Discrete Wavelet Transform (DWT). In this paper, a new coding algorithm called multiple subbands scaling hybrid coding (MSHC) is presented based on the analysis of IWT signal characterization. The new algorithm scales each subband with the scaling factor, which can optimize the transform coefficient distribution of the subband. A segmentation threshold based on the integer powers of two is selected. All coefficients above this threshold are encoding using simple fast quadtree partitioning scheme. The residual coefficients below the threshold are encoding using block arithmetic coding. Experimental results show that the MSHC is able to raise the IWT lossy compression performance up to the DWT level and provides PSNR up to 0.4~0.8 dB better than JPEG2000 method using IWT.