ppxscal/embedding_network huggingface dataset:
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
Authors: Indranil Gupta
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Epidemic-style (gossip-based) techniques have recently emerged as a class of scalable and reliable protocols for peer-to-peer multicast dissemination in large process groups. However, popular implementations of epidemic-style dissemination suffer from two major drawbacks: 1) Network overhead: When deployed on a WAN-wide or VPN-wide scale, they generate a large number of packets that transit across the boundaries of multiple network domains (e.g., LANs, subnets, ASs), causing an overload on core network elements such as bridges, routers, and associated links. 2) Lack of adaptivity: They impose the same load on process group members and the network even under reduced failure rates (viz., packet losses, process failures). In this paper, we describe two protocols to address these problems: 1) a hierarchical gossiping protocol and 2) an adaptive dissemination framework (for multicasts) that allows use of any gossiping primitive within it. These protocols work within a virtual peer-to-peer hierarchy called the Leaf Box Hierarchy. Processes can be allocated in a topologically aware manner to the leaf boxes of this structure, so that protocols 1 and 2 produce low traffic across domain boundaries in the network and induce minimal overhead when there are no failures.
A novel use of t-packings to construct d-disjunct matrices
Authors: Hung-Lin Fu, F. K. Hwang
Venue: Discrete Applied Mathematics (2006)

A t-packing is an ordered pair (V, P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-subset of V occurs in exactly one block of P, then (V, P) is known as a Steiner (t, k, v)-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices.
n-Keyword based Automatic Query Generation
Authors: Hoyeon Ryu, Gunhee Kim, Kyeongjong Yoo, Sungdo Ha
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In the information retrieval process, the selection of keywords and the generation of queries are very critical for the efficient retrieval. However, users experience the difficulties of selecting major keywords without being aware of the domain context. This paper proposes an automatic query generation method using n-Keyword expansion model, which consists of keyword extraction, keyword expansion and query generation. This method uses context model, semantic thesaurus and ontology. The keyword extraction is for finding document annotation data and document instances that are inferred from ontology and making the list of document keyword. n- Keyword, keywords expanded from the user input keyword, is constructed by selecting candidate keywords and assigning weight value to each candidate keyword from semantic thesaurus and document keyword list after consideration of context models. The query generation expands and generates the query using weighted keywords and query patterns. In retrieval for documents, n-Keyword using semantic thesaurus makes more useful query than users' keyword.
Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment
Authors: Kelvin Sim, Jinyan Li, Vivekanand Gopalkrishnan, Guimei Liu
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

We introduce an unsupervised process to co-cluster groups of stocks and financial ratios, so that investors can gain more insight on how they are correlated. Our idea for the co-clustering is based on a graph concept called maximal quasi-bicliques, which can tolerate erroneous or/and missing information that are common in the stock and financial ratio data. Compared to previous works, our maximal quasi-bicliques require the errors to be evenly distributed, which enable us to capture more meaningful co-clusters. We develop a new algorithm that can efficiently enumerate maximal quasi-bicliques from an undirected graph. The concept of maximal quasi-bicliques is domain-independent; it can be extended to perform co-clustering on any set of data that are modeled by graphs.
Distorted Conversations: On and Offline Explorations of Genomic Art
Authors: Holly Longstaff
Venue: Proceedings of the conference on Information Visualization (2006)

This paper explores the metaphors of preimplantation genetic diagnosis (PGD), or the genetic engineering of human embryos, through genomic art. Conversations about technologies like PGD typically center on issues of genetic determinism and autonomy. "Distorted conversations" exposes these issues by pushing the metaphor of ethical determinism as expressed through anonymous "conversations" distorted through online isolation and offline visualization technology. Participants are invited to contribute their hopes and concerns about this technology on a blog site. Portions of these conversations are converted into minuscule text and adhered to petri dishes that would typically be used during PGD procedures. Observers are then invited to join in this distorted conversation through the aid of a microscope. In this way, the conversation mimics the actual procedures of PGD and every aspect of the online and offline portions of the piece are controlled by and manipulated through PGD-type technology.
Learning inventory management strategies for commodity supply chains with customer satisfaction
Authors: Jeroen van Luin, Han La Poutré, J. Will. M. Bertrand
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In this paper, we look at a supply chain of commodity goods where customer demand is uncertain and partly based on reputation, and where raw material replenishment is uncertain in both the amount that is available, as well as the price to pay. Successful participation in such supply chains requires a good inventory management strategy. Actors must find a balance between inventory costs and client satisfaction: structurally high inventory costs reduces the profit, but customers that are faced with a depleted supplier will lose confidence and next time purchase from a competitor. This paper presents a model and a simulation environment to learn successful strategies for participation in this type of supply chains. We combine evolutionary algorithms with logistic theories, and use them in a case in a petrochemical setting. We show that software agents are capable of learning basic and more complex strategies, and that complex learned strategies perform better than basic learned strategies.
A distributed computing architecture for simulation and optimization
Authors: Yijia Xu, Suvrajeet Sen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We design a generic framework to integrate distributed simulation and optimization models. Many problems require the integration of these two types of models. For example, stochastic programming can use simulation models as a scenario generator for optimization models; in some other cases, simulation models need optimization models to help determine system parameters. The framework is shown to be able to provide various services to help the integration of simulation and optimization models. We illustrate our implementation with a product-mix example. The example integrates a discrete event simulation of a product-mix problem with a linear programming (optimization) model of such a system. The simulation updates the parameters in the optimization model, which as a result will generate a new production plan.
A wideband multichannel array sensor with a frequency domain adaptive filter structure
Authors: J. S. Goldstein
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A linearly constrained wideband adaptive array sensor is described whose adaptive processor is realized with a multichannel orthogonal filter structure. It was experimentally demonstrated that the transform domain processor utilizing the computationally simple least mean square (LMS) algorithm was capable of convergence speeds which rival the more expensive least squares methods. Furthermore, there is no additional cost in terms of the adaptive coefficient requirements (and only a modest increase in non-adaptive computational requirements) when compared with the standard tapped-delay-line structure array utilizing the LMS algorithm.
The potential coupling interface: metadata for model coupling
Authors: Tom Bulatewicz, Janice Cuny, Maureen Warman
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Model coupling is a nontrivial task that is not adequately supported in existing frameworks. Our long term goal is to support the fast-prototyping of model couplings, enabling scientists to quickly experiment with a variety of linkings without having to make an upfront investment in reprogramming. This paper introduces the centerpiece of our framework, the Potential Coupling Interface (PCI), a visual representation of a model code based on simplified control flow graphs. The PCI serves three roles: it is a new form of metadata describing the coupling potential of a model; it is the vehicle for the specification of couplings; and it is the basis for automatic code generation. It is easy to specify and once specified, it is available for all future coupling activities. The PCI allows scientists to focus on the important domain and model issues of coupling without having to revisit legacy code for each new effort.
Effects of document generation and source presentation on historical understanding and thinking
Authors: Cecil Robinson, Gina Raineri
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Students in an Introduction to Lifespan Development course (N = 108) participated in an experiment with a 2x2 randomized factorial design that explored the effects of document generation (control, document generation; DGT) and presentation format (single text, multiple documents) on historical understanding and thinking. As predicted, there were no improvements in students' historical understanding in the DGT or presentation format conditions. However, there were main effects for DGT and presentation format on students' depth of processing as measured by the number of added, borrowed and transformed sentences in an argument writing task. There was also a main effect for DGT on students' recall of document source information, an indication of the use of a sourcing heuristic and component of expert historical thinking. Results provide cautionary evidence for educational policy and classroom practice about document-based assessment practices, and the continued advocacy of multiple primary source document use.
Applications of the Sum-Product Theorem in Finite Fields
Authors: Avi Wigderson
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

About two years ago Bourgain, Katz and Tao [1] proved the following theorem, essentially stating that in every finite field, a set which does not grow much when we add all pairs of elements, and when we multiply all pairs of elements, must be very close to a subfield. This theorem revealed its fundamental nature quickly. Shortly afterwards it has found many diverse applications, including in Number Theory, Group Theory, Combinatorial Geometry, and the explicit construction of Extractors and Ramsey graphs, mostly described in the references below. In my talk I plan to explain some of the applications, as well as to sketch the main ideas of the proof of the sumproduct theorem.
Evolutionary clustering
Authors: Deepayan Chakrabarti, Ravi Kumar, Andrew Tomkins
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We consider the problem of clustering data over time. An evolutionary clustering should simultaneously optimize two potentially conflicting criteria: first, the clustering at any point in time should remain faithful to the current data as much as possible; and second, the clustering should not shift dramatically from one timestep to the next. We present a generic framework for this problem, and discuss evolutionary versions of two widely-used clustering algorithms within this framework: k-means and agglomerative hierarchical clustering. We extensively evaluate these algorithms on real data sets and show that our algorithms can simultaneously attain both high accuracy in capturing today's data, and high fidelity in reflecting yesterday's clustering.
Constant-Quality Rate Control Algorithm for Multiple Encoders with Single Video Source
Authors: Ping-Hao Wu, Homer H. Chen
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this paper, we develop a constant-quality rate control algorithm for a surveillance system that consists of one "base encoder" for encoding a down-sampled full-view version of the input video sequence and one "region of interest (ROI) encoder" for encoding the region of interest of the input video at the original resolution. Exploiting the inter-relationship between these two independent encoders, the bits for the ROI encoder are allocated according to the distortion obtained from the base encoder. Simulation results show that the proposed algorithm significantly reduces the image quality variation. The overall quality is improved and the bit-rate is saved as compared to the rate control algorithm in JM 8.4.
Propagation of graphs in two-dimensional inhomogeneous media
Authors: Klaus Deckelnick, Charles M. Elliott
Venue: Applied Numerical Mathematics (2006)

We consider the propagation of a front in a two-dimensional striated medium. In the case of a front that can be written as a graph over the real line we are led to an Eikonal equation for the height function which contains a possibly discontinuous coefficient. We prove existence and uniqueness of a viscosity solution in the sense of Ishii. Furthermore, we obtain an O(√h)-error bound for a monotone and consistent finite difference scheme. We conclude with some numerical tests.
Adaptive osculatory rational interpolation for image processing
Authors: Min Hu, Jieqing Tan
Venue: Journal of Computational and Applied Mathematics (2006)

Image interpolation is a common problem in image applications. Although many interpolation algorithms have been proposed in the literature, these methods suffer from the effects of imperfect reconstruction to some degree, most often, these effects manifest themselves as jagged contours or blurred edges in the image. This paper presents a method for preserving the contours or edges based on adaptive osculatory rational interpolation kernel function, which is built up by approximating the ideal interpolating kernel function by continued fractions. It is a more accurate approximation for the ideal interpolation in space domain or frequency domain than by other linear polynomial interpolation kernel functions. Simulation results are also presented to demonstrate the superior performance of image magnification.
Interface-Based Rate Analysis of Embedded Systems
Authors: Samarjit Chakraborty, Yanhong Liu, Nikolay Stoimenov, Lothar Thiele, Ernesto Wandeler
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Interface-based design is now considered to be one of the keys to tackling the increasing complexity of modern embedded systems. The central idea is that different components comprising such systems can be developed independently and a system designer can connect them together only if their interfaces match, without knowing the details of their internals. We use the concept of rate interfaces for compositional (correct-by-construction) design of embedded systems whose components communicate through data streams. Using the associated rate interface algebra, two components can be connected together if the output rate of one component is "compatible" with the input rate of the other component. We formalize this notion of compatibility and show that such an algebra is non-trivial because it has to accurately model the burstiness in the arrival rates of such data streams and the variability in their processing requirements. We discuss how rate interfaces simplify compositional design and at the same time help in functional and performance verification which would be difficult to address otherwise. Finally, we illustrate these advantages through a realistic case study involving a component-based design of a multiprocessor architecture running a picture-in-picture application.
The Cerebral Response during Subjective Choice with and without Self-reference
Authors: Sterling C. Johnson, Taylor W. Schmitz, Tisha N. Kawahara-baccus, Howard A. Rowley, Andrew L. Alexander, Jonghoon Lee, Richard J. Davidson
Venue: Journal of Cognitive Neuroscience (2005)

The anterior medial prefrontal (AMPFC) and retrosplenial (RSC) cortices are active during self-referential decision-making tasks such as when participants appraise traits and abilities, or current affect. Other appraisal tasks requiring an evaluative decision or mental representation, such as theory of mind and perspective-taking tasks, also involve these regions. In many instances, these types of decisions involve a subjective opinion or preference, but also a degree of ambiguity in the decision, rather than a strictly veridical response. However, this ambiguity is generally not controlled for in studies that examine self-referential decision-making. In this functional magnetic resonance imaging experiment with 17 healthy adults, we examined neural processes associated with subjective decision-making with and without an overt self-referential component. The task required subjective decisions about colors&mdash;regarding self-preference (internal subjective decision) or color similarity (external subjective decision) under conditions where there was no objectively correct response. Results indicated greater activation in the AMPFC, RSC, and caudate nucleus during internal subjective decision-making. The findings suggest that self-referential processing, rather than subjective judgments among ambiguous response alternatives, accounted for the AMPFC and RSC response.
Simultaneity and non-linear variability in financial markets: simulation and forecasting: Research Articles
Authors: Gordon E. Reikard
Venue: Applied Stochastic Models in Business and Industry (2006)

Non-linear variability in financial markets can emerge from several mechanisms, including simultaneity and time-varying coefficients. In simultaneous equation systems, the reduced-form coefficients that determine the behaviour of jointly dependent variables are products and ratios of the original structural coefficients. If the coefficients are stochastic, the resulting multiplicative interactions will result in high degrees of non-linearity. Processes generated in this way will scale as fractals: they will exhibit intermittent outliers and scaling symmetries, i.e. proportionality relationships between fluctuations at different separation distances. A model is specified in which both the exchange rate itself and the exchange rate residual exhibit simultaneity. The exchange rate depends on other exchange rates, while the residual depends on the other residuals. The model is then simulated using embedding noise from a t-distribution. The simulations replicate the observed properties of exchange rates, heavy-tailed distributions and long memory in the variance. A forecasting algorithm is specified in two stages. The first stage is a model for the actual process. In the second stage the residuals are modelled as a function of the predicted rate of change. The first and second stage models are then combined. This algorithm exploits the scaling symmetry: the residual is proportional to the predicted rate of change at separation distances corresponding to the forecast horizon. The procedure is tested empirically on three exchange rates. At a daily frequency and a 1-day forecast horizon, two-stage models reduce the forecast error by one fourth. At a 5-day horizon, the improvement is 10&ndash;15 percent. At a weekly frequency, the improvement at the 1-week horizon is on the order of 30&ndash;40 percent. Copyright &copy; 2006 John Wiley & Sons, Ltd.
The PDD Framework for Detecting Categories of Peculiar Data
Authors: Mahesh Shrestha, Howard J. Hamilton, Yiyu Yao, Ken Konkel, Liqiang Geng
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Peculiar data are objects that are relatively few in number and significantly different from the other objects in a data set. In this paper, we propose the PDD framework for detecting multiple categories of peculiar data. This framework provides an extensible set of perspectives for viewing data, currently including viewing data as a set of records, attributes, frequencies, intervals, sequences, or sequences of changes. By using these six views of the data, multiple categories of peculiar data can be detected to reveal different aspects of the data. For each view, the framework provides an extensible set of peculiarity measures to detect outliers and other kinds of peculiar data. The PDD framework has been implemented for Oracle and Access. Experiments are reported for data sets concerning Regina weather and NHL hockey.
Wearables and Robots: A Shared View
Authors: Charles C. Kemp
Venue: IEEE Pervasive Computing (2006)

As robots get increasingly sophisticated, we'll ask them to help us with our daily lives in increasingly complicated ways. We'll expect them to work closely with us and the objects in our environments. To do so, they'll need to perceive our world and understand us well enough to perform the tasks we desire. Achieving this level of sophistication presents challenging research problems for roboticists.Wearables provide a way for computers to share our experiences. Instead of using a robotic body to explore our world, a computer can ride along with us. Through wearables, computers can observe the world and our activities from a privileged, first-person perspective that's analogous to the perspective they would have from a robotic body. So, roboticists can use wearables as a development platform for the sophisticated robots of the future.
Analysis and Visualization of Co-authorship Networks for Understanding Academic Collaboration and Knowledge Domain of Individual Researchers
Authors: Tze-Haw Huang, Mao Lin Huang
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper proposed a new approach for collecting, analyzing and visualizing co-authoring data of individuals. This approach can be used for understanding the academic collaboration and knowledge domain of individual researchers in a past period through repetitive co-published works. Particularly we extracted the co-authoring data from the DBLP which is one of the largest on-line Computer Science bibliographic databases available on the Internet. To help users to understand the academic collaboration and knowledge domain of individuals, we developed an InterRing visualizer which shows not only the weight of co-authorship of an individual with other researchers in particular academic year, but also the knowledge domain of the individual that was covered by his/her publications published in a past period.