ppxscal/embedding_network huggingface dataset:
Moment matrices, trace matrices and the radical of ideals
Authors: Itnuit Janovitz-Freireich, Agnes Szántó, Bernard Mourrain, Lajos Ronyai
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Let f1,..., fs be a system of polynomials in K[x1,..., xm] generating a zero-dimensional ideal I , where K is an arbitrary algebraically closed field. Assume that the factor algebra A = K[x1 , . . . , xm]/I is Gorenstein and that we have a bound delta > 0 such that a basis for A can be computed from multiples of f1,..., fs of degrees at most delta. We propose a method using Sylvester or Macaulay type resultant matrices of f1,..., fs and J , where J is a polynomial of degree delta generalizing the Jacobian, to compute moment matrices, and in particular matrices of traces for A. These matrices of traces in turn allow us to compute a system of multiplication matrices {Mxi|i = 1,..., m} of the radical of I, following the approach in the previous work by Janovitz-Freireich, Ronyai and Szanto. Additionally, we give bounds for delta for the case when I has finitely many projective roots.
A study about browsers in the Web and the Desktop
Authors: William J. Giraldo, Manuel Ortega, José A. Olivas
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The information retrieval is necessary for the execution of our daily activities. The people use the computers during hours to find information although they are not safe of its existence. The Internet offers an opportunity to provide an almost infinite source with information. The personal computers, on the other hand, also store a great amount of information. The challenges and the characteristics of the organization and information retrieval are treated in this paper in both stadiums, the Web and the Desktop. A study of the investigations is made therefore in the state of the question
MILKey: multi illuminated indicator for KEYpad
Authors: Hiroyuki Manabe, Masaaki Fukumoto
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

An indicator with switchable faces that suits the cellular phone keypad is proposed and implemented. The prototype, which can show 3 patterns, consists of notch filters (each of which yields a different pattern) and light sources. Each pattern, which emits in a different color, can be activated simply by switching the same color of the illuminating light. Since the patterns do not disturb each other, large characters can be covered on the whole keytop. This indicator is also suitable for handheld/portable devices, such as PDA or notebook PC.
An approach to QoS aware resource scheduling in data stream systems
Authors: Sumit Ganguly, Pushpraj Shukla
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

In a data stream management system (DSMS), there are a large number of simultaneously executing queries, each of which performs a specific monitoring function on some subset of the streaming data. In order to keep up with the rapid arrival rates, a DSMS may sample or drop tuples to match execution rate with the arrival rate. However, as the sampling rate reduces, so does the quality of answers of the queries. Since, there may be substantial overlap between the queries that are simultaneously active in the system, an optimal choice of the points and extent of load-shedding cannot be obtained without taking a "global view" of this problem. In this paper, we formulate the problem of optimizing the rates of sampling with the the overall objective of minimizing the sum of the loss of quality of answers of the queries, assumed to be associated with each query (e.g., as in the Aurora system). Specifically, we consider the problem of obtaining the optimal sampling probabilities for a given collection of sliding-window queries with known loss of quality plots, so that the objective function of the sum of loss of quality across the queries is minimized. The problem can be generally posed and solved as a convex optimization problem and can be solved in low order polynomial time.
DARC: dynamic analysis of root causes of latency distributions
Authors: Avishay Traeger, Ivan Deras, Erez Zadok
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has been used to uncover several interesting performance problems, the latency distributions that it provides must be analyzed manually. These latency distributions are presented as histograms and contain distinct groups of data, called peaks, that characterize the overall behavior of the running code. By automating the analysis process, we make it easier to take advantage of OSprof's unique features. We have developed the Dynamic Analysis of Root Causes system (DARC), which finds root cause paths in a running program's call-graph using runtime latency analysis. A root cause path is a call-path that starts at a given function and includes the largest latency contributors to a given peak. These paths are the main causes for the high-level behavior that is represented as a peak in an OSprof histogram. DARC performs PID and call-path filtering to reduce overheads and perturbations, and can handle recursive and indirect calls. DARC can analyze preemptive behavior and asynchronous call-paths, and can also resume its analysis from a previous state, which is useful when analyzing short-running programs or specific phases of a program's execution. We present DARC and show its usefulness by analyzing behaviors that were observed in several interesting scenarios. We also show that DARC has negligible elapsed time overheads for normal use cases.
Medical Image Categorization Based on Gaussian Mixture Model
Authors: Dong Yin, Jia Pan, Peng Chen, Rong Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper we present an approach for medical image categorization based on Gaussian mixture model. There are distinct differences on texture, shape and intensity characteristics among the images of different parts of body. Considering of the features of the Gaussian mixture model , first we extract the characteristic vectors of the training image set to learn the class model for each class, then categorize the test image using the Bayesian principle. The experimental results indicate that the method performs very well on CT image categorization. We achieved classification accuracy up to 97% in the experiment.
Fast point-feature label placement for dynamic visualizations
Authors: Kevin Mote
Venue: Information Visualization (2007)

This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much study for decades. Computerized maps have introduced interactive zooming and panning, which has intensified the problem. Providing dynamic labels for such maps typically requires a time-consuming pre-processing phase. In the realm of visual analytics, however, the labeling of interactive maps is further complicated by the use of massive datasets laid out in arbitrary configurations, thus rendering reliance on a pre-processing phase untenable. This paper offers a method for labeling point-features on dynamic maps in real time without pre-processing. The algorithm presented is efficient, scalable, and exceptionally fast; it can label interactive charts and diagrams at speeds of multiple frames per second on maps with tens of thousands of nodes. To accomplish this, the algorithm employs a novel geometric de-confliction approach, the 'trellis strategy,' along with a unique label candidate cost analysis to determine the 'least expensive' label configuration. The speed and scalability of this approach make it well-suited for visual analytic applications.
A cooperative stochastic differential game of transboundary industrial pollution
Authors: David W. K. Yeung, Leon A. Petrosyan
Venue: Automatica (Journal of IFAC) (2008)

Though cooperation in environmental control holds out the best promise of effective actions, limited success has been observed because existing multinational joint initiatives fail to satisfy the property of subgame consistency. A cooperative solution is subgame consistent if the solution optimality principle is maintained in any subgame which starts at a later time with any feasible state brought about by prior optimal behaviors. This paper presents a cooperative stochastic differential game of transboundary industrial pollution with two novel features. The first feature is that industrial production creates short-term local impacts and long-term global impacts on the environment. Secondly, a subgame consistent cooperative solution is derived in this stochastic differential game together with a payment distribution mechanism that supports the subgame consistent solution. This is the first time that pollution management is analyzed in a cooperative stochastic differential game framework under these novel features.
Resource Efficiency of Instruction Set Extensions for Elliptic Curve Cryptography
Authors: Christoph Puttmann, Jamshid Shokrollahi, Mario Porrmann
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper we focus on the hardware acceleration of cryptographic algorithms by using instruction set extensions. Therefore, a holistic methodology for automated evaluation of instruction set extensions is presented. We propose a two-stage framework for analyzing the resource efficiency of extending an instruction set. With emphasis to elliptic curve cryptography, several instruction set extensions are implemented for a 32-bit RISC microprocessor and synthesized in a state of the art 65 nm low power standard cell CMOS technology. The achieved performance improvement is analyzed in respect to the hardware costs in terms of chip area and power consumption.
Recent European Union developments on data protection ... in the name of Islam or 'Combating Terrorism'
Authors: Jeanne Pia Mifsud Bonnici
Venue: Information and Communications Technology Law (2007)

This article looks at two recent European Union (EU) developments in the field of data protection: the issue of Directive 2006/24/EC of 15 March 2006 on the retention of data generated or processed in connection with the provision of publicly available electronic communications services or of public communications networks (OJ 105/54); and the debates going on surrounding the proposal for a Council Framework Decision on the protection of personal data processed in the framework of police and judicial cooperation in criminal matters. The article reflects on why (and how) these two developments came about, and their potential effect on the future development of data protection and beyond. The rest of the articles published in this special issue of the journal reflect on the different aspects of Islamic legal traditions and the concepts of privacy and data protection. This article argues that, unthought-of perhaps, the counter process is taking place too: data protection principles at an EU level are being watered down in the name of a crusade against Islamic fundamentalism. It also argues that in spite of this apparent watering down of principles that is happening, some positive aspects are also emerging; the much awaited introduction of the application of data protection rules in the field of police, security and justice is finally happening-not as one would hope for perhaps, but making its way nonetheless.
Analysis and Component-based Realization of Security Requirements
Authors: Denis Hatebur, Maritta Heisel, Holger Schmidt
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We present a process to develop secure software with an extensive pattern-based security requirements engineering phase. It supports identifying and analyzing conflicts between different security requirements. In the design phase, we proceed by selecting security software components that achieve security requirements. The process enables software developers to systematically identify, analyze, and finally realize security requirements using security software components. We illustrate our approach by a lawyer agency software example.
Loop trees: a new theme in structured programming and discrete structures
Authors: Ward Douglas Maurer
Venue: Journal of Computing Sciences in Colleges (2008)

Loop trees, which were very recently discovered, provide us with a new way of looking at structured programming. Using loop trees, there is a sense in which there is no such thing as spaghetti code; all code is structured. In order to understand this, however, students have to know about strongly connected components, which are not treated in every discrete structures book. We give here a sample presentation to students of strongly connected components, together with exercises and answers. We also show the basic idea of loop trees and cite a Web site where students can practice with them, if they have studied any one of five specific assembly languages.
Fast-converging tatonnement algorithms for one-time and ongoing market problems
Authors: Richard Cole, Lisa Fleischer
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Why might markets tend toward and remain near equilibrium prices? In an effort to shed light on this question from an algorithmic perspective, this paper formalizes the setting of Ongoing Markets, by contrast with the classic market scenario, which we term One-Time Markets. The Ongoing Market allows trade at non-equilibrium prices, and, as its name suggests, continues over time. As such, it appears to be a more plausible model of actual markets. For both market settings, this paper defines and analyzes variants of a simple tatonnement algorithm that differs from previous algorithms that have been subject to asymptotic analysis in three significant respects: the price update for a good depends only on the price, demand, and supply for that good, and on no other information; the price update for each good occurs distributively and asynchronously; the algorithms work (and the analyses hold) from an arbitrary starting point. Our algorithm introduces a new and natural update rule. We show that this update rule leads to fast convergence toward equilibrium prices in a broad class of markets that satisfy the weak gross substitutes property. These are the first analyses for computationally and informationally distributed algorithms that demonstrate polynomial convergence. Our analysis identifies three parameters characterizing the markets, which govern the rate of convergence of our protocols. These parameters are, broadly speaking: 1. A bound on the fractional rate of change of demand for each good with respect to fractional changes in its price. 2. A bound on the fractional rate of change of demand for each good with respect to fractional changes in wealth. 3. The closeness of the market to a Fisher market (a market with buyers starting with money alone). We give two types of protocols. The first type assumes global knowledge of only (an upper bound on) the first parameter. For this protocol, we also provide a matching lower bound in terms of these parameters for the One-Time Market. Our second protocol, which is analyzed for the One-Time Market alone, assumes no global knowledge whatsoever.
An integrated multi-agent systems framework to implement relationship management for SCM
Authors: Kun-Lin Hsieh
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

The customer relationship management (CRM) is a concept to been recognized well until now for enhancing the enterprise's competitive capability. Except for CRM, supplier relationship management (SRM) can be viewed as opposite thinking direction for the relationship management between suppliers and enterprises. In this study, we developed a life cycle model to implement SRM according to the thinking of CSLC model. Herein, we called it as supplier service life cycle (SSLC) model. Besides, we know that the technique of intelligent agents (IAs) had been applied well on the issue of electronic commerce (EC). Hence, we designed an integrated multi-agent system (MAS) framework to achieve the relationship management since achieving CRM and SRM simultaneously for supply chain management (SCM). In this study, the definition of MAS workflow models and types of coordination mechanism are also constructed in detailed.
Bayesian multiple comparisons of simply ordered means using priors with a point mass
Authors: Kane Nashimoto, F. T. Wright
Venue: Computational Statistics Data Analysis (2008)

Comparison of k treatment means under the simple-order assumption (@m"1@?@m"2@?...@?@m"k) is considered. Under an order restriction, isotonic estimates and global tests of homogeneity have been known for several decades. Recently, some multiple-comparison techniques have been proposed, but none has become the standard. In this article, we develop multiple-comparison and clustering techniques for simply ordered means using a Bayesian hierarchical model. We parameterize each individual mean in terms of the difference between the preceding mean and itself. Estimates for such difference parameters are obtained using the MCMC method. Pairwise comparisons and determination of the most probable ordered clustering are based on the posterior probabilities of the difference parameters being zero. Numerical examples are given.
Design and development of a technology enhanced hybrid instruction based on MOLTA model: Its effectiveness in comparison to traditional instruction
Authors: Omer Delialioglu, Zahide Yildirim
Venue: Computers Education (2008)

Using the model for learning and teaching activities (MOLTA), a new technology enhanced hybrid instruction was designed, developed and implemented. The effectiveness of the hybrid instruction in regard to students' achievement, knowledge retention, attitudes towards the subject, and course satisfaction was evaluated in comparison to traditional classroom instruction. Experimental study with pre-test, post-test control group design was carried out. The sample of the study consisted of 50 university students enrolled in ''Computer Networks and Communication'' course. The control and experimental groups composed of 24 and 26 students respectively, and the experiment lasted 14 weeks. The findings of the study indicated no significant difference between the hybrid course and the traditional course in students' achievement, knowledge retention, satisfaction, and attitude.
High-Resolution Functional Quantization
Authors: Vinith Misra, Vivek K. Goyal, Lav R. Varshney
Venue: Proceedings of the Data Compression Conference (2008)

Suppose a function of N real source variables X_1^N = (X_1, X_2, ..., X_N)is desired at a destination constrained to receive a limited number of bits.If the result of evaluating the function, Y = G(X_1^N), can be itselfencoded, this is the optimal strategy--the origin of Y becomes irrelevantto the communication problem. We consider two alternative scenarios:distributed quantization, in which each X_i must be separately encoded;and linear transform coding of X_1^N. Optimal fixed- and variable-ratescalar quantizers are derived under the conventional assumptions ofhigh-resolution quantization theory, and we find optimal transforms fortransform coding. For certain classes of functions, examples demonstratelarge improvements over using quantizers designed to minimize distortionof the X_i's.
Investigating the Intrinsic Differences in Flank Regions of Exon-Intron Junction Sites
Authors: Sing-Wu Liou, Yin-Fu Huang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The flank regions of exon-intron junction sites (EIJSs) are closely related to gene structure; and their sequence context is the determinants for the spliceosome to recognize the authentic EIJSs. Although some efforts had been devoted to mining sequence information in the flank regions of EIJSs, significant breakthroughs are still awaiting. In this paper, a hypothesis on EIJSs' flank regions was proposed, it stated that the sequence context of intron flank is more flexible than the conjoined exon flank for a specific EIJS; it means that the exon flanks are more conservative than the intron flanks. For investigating the proposed hypothesis, a frameshift strategy was used to explore the sequence context; and a codon-based measurement, frameshift oscillation (FO), was devised to estimate the sensitivity of being disturbed by frameshifting; according to the hypothesis, the exon flanks will be more sensitive to frameshift than their conjoined intron flanks. After investigating all EIJSs in complete human genome with various lengths of flank regions by FO, the results reveal there do exist intrinsic differences in the flank regions of EIJSs. Therefore, the proposed hypothesis has great implications in predicting gene structure; furthermore, it is believed that the devised estimator FO really catches a key feature of authentic EIJSs and it is of great potential in identifying authentic EIJSs.
The method of images for regularized Stokeslets
Authors: Josephine Ainley, Sandra Durkin, Rafael Embid, Priya Boindala, Ricardo Cortez
Venue: Journal of Computational Physics (2008)

The image system for the method of regularized Stokeslets is developed and implemented. The method uses smooth localized functions to approximate a delta distribution in the derivation of the fluid flow due to a concentrated force. In order to satisfy zero-flow boundary conditions at a plane wall, the method of images derived for a standard (singular) Stokeslet is extended to give exact cancellation of the regularized flow at the wall. As the regularization parameter vanishes, the expressions reduce to the known images for singular Stokeslets. The advantage of the regularized method is that it gives bounded velocity fields even for isolated forces or for distributions of forces along curves. These are useful in the simulation of ciliary beats, flagellar motion, and particle suspensions. The expression relating force and velocity can be inverted to find the forces that generate a given velocity boundary condition. The latter is exemplified by modeling a cilium as a filament moving in a three-dimensional flow. The cilium velocity at various times is constructed from known data and used to determine the force field along the filament. Those forces can then reproduce the flow everywhere. The validity of the method is evaluated by computing the drag on a sphere moving near a wall. Comparisons with known expressions for the drag show that the method gives accurate results for spheres even within a distance from the wall equal to the surface discretization size.
3D Hair sketching for real-time dynamic & key frame animations
Authors: R&#x0131;fat Aras, Bark&#x0131;n Ba&#x015f;arankut, Tolga &#x00c7;ap&#x0131;n, B&#x00fc;lent &#x00d6;zg&#x00fc;&#x00e7;
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Physically based simulation of human hair is a well studied and well known problem. But the &#x201c;pure&#x201d; physically based representation of hair (and other animation elements) is not the only concern of the animators, who want to &#x201c;control&#x201d; the creation and animation phases of the content. This paper describes a sketch-based tool, with which a user can both create hair models with different styling parameters and produce animations of these created hair models using physically and key frame-based techniques. The model creation and animation production tasks are all performed with direct manipulation techniques in real-time.