ppxscal/embedding_network huggingface dataset:
Imparting non-technical skills in digital media students
Authors: Pam Hogarth, Harry Mott, Michael Scroggins
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Many digital media careers are within collaborative, creative industries. Although a firm grasp of computer graphics techniques and packages is important, students need to possess communication, collaboration and creative skills that are not easily imparted in a classroom setting. Frequently these "non-technical" skills make or break an individual's ability to succeed in their chosen field.The educators participating in this session are all involved in industry outreach, program development and student interaction. They hope to be the catalysts and guides to a lively discussion of how cg programs can help their students learn these vital skills.This forum is open to anyone involved in educating artists and technicians for careers in high-end computer graphics.
Who Should Pay How Much?
Authors: Christopher Böhringer, Thomas F. Rutherford
Venue: Computational Economics (2004)

International climate policy has assigned the leading role in emissions abatement to the industrialized countries who have assumed historical responsibility for the greenhouse gas problem. Developing countries that remain uncommitted may nevertheless face adverse impacts on their economies caused by international spillovers from abatement in the developed world. In this context, the United Nations Framework Convention on Climate Change guarantees compensation from the industrialized countries to the developing world for induced economic costs under Articles 4.8 and 4.9. In this paper, we shed some light on the difficulties involved in establishing a measurement of bilateral spillover effects that is sufficiently robust to be used in the climate policy debate as a reference point for computing transfer payments. We argue that the decomposition procedure suggested by Harrison, Horridge and Pearson (2000) can reduce arbitrariness in the measurement of bilateral spillovers. Application of the procedure to decompose the economic implications of the Kyoto Protocol at the cross-country level, however, reveals fundamental problems to the issue of compensation. At the bilateral level, developing countries may benefit from abatement in one industrialized country, and be worse off from abatement in another industrialized country. This poses the question if developing countries which are compensated for adverse spillovers should in turn pay for positive spillovers.
Supporting interactive invocation of remote services within an integrated programming environment
Authors: Bruce Quig, John Rosenberg, Michael Kölling
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Building distributed systems is an inherently difficult and complex task. Modern middleware architectures assist developers by providing abstractions that hide transport layer functionality. This paper argues that the development of such systems can be aided by the availability of appropriate, integrated tools. We discuss ways in which the building of such systems can be supported by development tools, focusing particularly on interactive testing and debugging mechanisms.A prototype system based on the BlueJ programming environment has been developed to support the development of Java RMI applications as a basis for further investigation. The tools developed as part of this prototype are presented and discussed.
Hydrogen wishes
Authors: Winslow Burleson, Paul Nemirovsky, Dan Overholt
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Hydrogen Wishes, presented at MIT's Center for Advanced Visual Studies, explores the themes of wishes and peace. It dramatizes the intimacy and power of transforming one's breath and vocalized wishes into a floating sphere, a bubble charged with hydrogen. The floating bubble represents transitory anticipation as a wish is sent on its trajectory toward fulfillment. Light, heat sensors, microphones, projected imagery, hydrogen and ordinary soap bubbles come together in this exploration of human aspiration. As in our lives, many wishes escape, but many others are catalyzed by the heat of the candle and become ethereal. The fulfilled wishes then become living artifacts within projected photographs of Earth cities as seen from outer space.
Trajectory-based ball detection and tracking with applications to semantic analysis of broadcast soccer video
Authors: Xinguo Yu, Changsheng Xu, Hon Wai Leong, Qi Tian, Qing Tang, Kong Wah Wan
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper first presents an improved trajectory-based algorithm for automatically detecting and tracking the ball in broadcast soccer video. Unlike the object-based algorithms, our algorithm does not evaluate whether a sole object is a ball. Instead, it evaluates whether a candidate trajectory, which is generated from the candidate feature image by a candidate verification procedure based on Kalman filter,, which is generated from the candidate feature image by a candidate verification procedure based on Kalman filter, is a ball trajectory. Secondly, a new approach for automatically analyzing broadcast soccer video is proposed, which is based on the ball trajectory. The algorithms in this approach not only improve play-break analysis and high-level semantic event detection, but also detect the basic actions and analyze team ball possession, which may not be analyzed based only on the low-level feature. Moreover, experimental results show that our ball detection and tracking algorithm can achieve above 96% accuracy for the video segments with the soccer field. Compared with the existing methods, a higher accuracy is achieved on goal detection and play-break segmentation. To the best of our knowledge, we present the first solution in detecting the basic actions such as touching and passing, and analyzing the team ball possession in broadcast soccer video.
Distributed testing without encountering controllability and observability problems
Authors: Hasan Ural, David Whittier
Venue: Information Processing Letters (2003)

The objective of testing is to determine whether a system under test conforms to its specification. In distributed test architectures that utilize remote testers, this objective can be complicated by the fact that testers may encounter problems relating to controllability and observability during the application of a test sequence. Existing solutions to these problems involve first constructing a test sequence from the specification of an implementation under test, and then inserting coordination messages or appending selected test subsequences that prevent the occurrences of controllability and observability problems during the application of the resulting test sequence. This paper proposes a method that utilizes a set of transformation rules to construct an auxiliary directed graph from a given specification, and constructs a rural Chinese postman tour in his graph to yield a minimum-length test sequence where there is no potential controllability or observability problems, and where the use of coordination messages is minimized.
Different types of image texture features in ultrasound of patients with lymphocytic thyroiditis
Authors: Daniel Smutek, Radim Sara, Petr Sucharda, Ludvik Tesar
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Ultrasound is very important imaging modality in diagnosing and monitoring diseases of thyroid gland. We propose using quantifiable indices for texture characterization and classification. Spatial features, co-occurrence texture features, and non-heuristic texture features are compared in this study. The spatial texture features acted as the best descriptors of changed thyroid tissue for texture characterization with a classification success rate of 100%. The co-occurrence features achieved the classification success about 75% and required to be in a group of four or eight features. The results of non-heuristic texture features were on the border between spatial and co-occurrence features. The overall good classification results confirm that the information related to diagnosis can be adequately extracted from sonographic images of subsurface organs. Quantitative indicators enable reproducibility of the sonographic diagnosis, facilitate assessment of changes of the disease and make possible the comparison of different physicians' findings of a sonographic examination.
Bayesian estimation of smooth transition GARCH model using Gibbs sampling
Authors: Hajime Wago
Venue: Mathematics and Computers in Simulation (2004)

Research into time series models of changing variance and covariance, which is often called volatility model, has exploded in the last 10 years. Financial series are characterized by periods of large volatility followed by periods of relative quietness. This type of clustering led to the idea that volatility is predictable. The ARCH and GARCH models were quite successful in predicting volatility compared to more traditional methods. But better predictions are obtained when asymmetries and nonlinearities in the response of volatility to news arriving in the market are taken into account. In this paper we propose a new kind of asymmetric GARCH in which the conditional variance obeys two different regimes with a smooth transition function. In this model, the conditional variance reacts differently to negative and positive shocks and its magnitude on shocks have separate effects. As financial data have very often a high frequency of observation, smooth transition seems a priori better than an abrupt transition. The change of regime occurs when the residuals cross the threshold zero. This threshold GARCH models can be generalized using a smooth transition function FT(η, st) taking continuous values between zero and one. We treat the joint point t* and the speed of adjustment η to be two unknown parameters.
Computing the Minkowski sum of ruled surfaces
Authors: Heidrun Mühlthaler, Helmut Pottmann
Venue: Graphical Models (2003)

The boundary of the Minkowski sum of two geometric objects is part of the so-called convolution surface of the boundary surfaces of the two input objects. In most cases, convolution surfaces can be computed only by numerical algorithms. The present paper studies convolution surfaces of ruled surfaces. There, explicit parameterizations for the convolution surface can be derived. Moreover, we study the rational convolution surface of two rational ruled surfaces and the connection to rational parameterizations of offsets of rational ruled surfaces.
Do Better Customers Utilize Electronic Distribution Channels? The Case of PC Banking
Authors: Lorin M. Hitt, Frances X. Frei
Venue: Management Science (2002)

Many service firms are pursuing electronic distribution strategies to augment existing physical infrastructure for product and service delivery. But little systematic study has been made for whether and how characteristics or behaviors might differ between customers who use electronic delivery systems and those who use traditional channels. We explore these differences by comparing customers who utilize personal-computer-based home banking (PC banking) to other bank customers. Case studies and detailed customer data from four institutions suggest that PC banking customers are apparently more profitable, principally due to unobservable characteristics extant before the adoption of PC banking. Demographic characteristics and changes in customer behavior following adoption of PC banking account for only a small fraction of overall differences. It also appears that retention is marginally higher for customers of the online channel.
Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling
Authors: Hongyuan Shi, Harish Sethu
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Fair scheduling algorithms are an important componentof most QoS mechanisms designed to support the performanceguarantees required by real-time applications. Inthis paper, we present Greedy Fair Queueing (GrFQ), anovel scheduler based on a greedy strategy of reducing themaximum difference in normalized service received by anytwo flows at each trasmission boundary. We prove thatthe GrFQ scheduler achieves a better bound on the normalizedlag than other known schedulers. We further proposea simplified version of the scheduler, called GrFQ-lite,which avoids the emulation of a fluid flow system and hasa per-packet work complexity of O(1) in the computationof the timestamps. Borrowing from the field of economics,we use the Gini index as a measure of instantaneous fairness.Using real gateway traffic traces, we show that theGrFQ scheduler achieves better fairness than any otherknown scheduler at virtually all instants of time. We furthershow that the GrFQ-lite scheduler achieves equivalentor better fairness than other known schedulers includingthose that are significantly more computationally intensivein their emulation of the ideally fair fluid flow system.
Efficient data reduction with EASE
Authors: Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter Haas, Peter Scheuermann
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A variety of mining and analysis problems --- ranging from association-rule discovery to contingency table analysis to materialization of certain approximate datacubes --- involve the extraction of knowledge from a set of categorical count data. Such data can be viewed as a collection of "transactions," where a transaction is a fixed-length vector of counts. Classical algorithms for solving count-data problems require one or more computationally intensive passes over the entire database and can be prohibitively slow. One effective method for dealing with this ever-worsening scalability problem is to run the algorithms on a small sample of the data. We present a new data-reduction algorithm, called EASE, for producing such a sample. Like the FAST algorithm introduced by Chen et al., EASE is especially designed for count data applications. Both EASE and FAST take a relatively large initial random sample and then deterministically produce a subsample whose "distance" --- appropriately defined --- from the complete database is minimal. Unlike FAST, which obtains the final subsample by quasi-greedy descent, EASE uses epsilon-approximation methods to obtain the final subsample by a process of repeated halving. Experiments both in the context of association rule mining and classical &chi;2 contingency-table analysis show that EASE outperforms both FAST and simple random sampling, sometimes dramatically.
Communication Complexity of Simultaneous Messages
Authors: László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam
Venue: SIAM Journal on Computing (2004)

In the multiparty communication game (CFL game) of Chandra, Furst, and Lipton [Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, MA, 1983, pp. 94--99] k players collaboratively evaluate a function f(x0, . . . , xk-1) in which player i knows all inputs except xi. The players have unlimited computational power. The objective is to minimize communication.In this paper, we study the SIMULTANEOUS MESSAGES (SM) model of multiparty communication complexity. The SM model is a restricted version of the CFL game in which the players are not allowed to communicate with each other. Instead, each of the k players simultaneously sends a message to a referee, who sees none of the inputs. The referee then announces the function value.We prove lower and upper bounds on the SM complexity of several classes of explicit functions. Our lower bounds extend to randomized SM complexity via an entropy argument. A lemma establishing a tradeoff between average Hamming distance and range size for transformations of the Boolean cube might be of independent interest.Our lower bounds on SM complexity imply an exponential gap between the SM model and the CFL model for up to $(\log n)^{1-\epsilon}$ players for any $\epsilon > 0$. This separation is obtained by comparing the respective complexities of the Generalized Addressing Function, GAFG,k, where G is a group of order n. We also combine our lower bounds on SM complexity with the ideas of Håstad and Goldmann [Comput. Complexity, 1 (1991), pp. 113--129] to derive superpolynomial lower bounds for certain depth-2 circuits computing a function related to the GAF function.We prove some counterintuitive upper bounds on SM complexity. We show that {\sf GAF}$_{\mathbb{Z}_2^t,3}$ has SM complexity $O(n^{0.92})$. When the number of players is at least $c\log n$, for some constant c>0, our SM protocol for {\sf GAF}$_{\mathbb{Z}_2^t,k}$ has polylog(n) complexity. We also examine a class of functions defined by certain depth-2 circuits. This class includes the Generalized Inner Product function and Majority of Majorities. When the number of players is at least 2+log n, we obtain polylog(n) upper bounds for this class of functions.
Using neural networks to predict workability of concrete incorporating metakaolin and fly ash
Authors: J. Bai, S. Wild, J. A. Ware, B. B. Sabir
Venue: Advances in Engineering Software (2003)

This paper details the development of neural network models that provide effective predictive capability in respect of the workability of concrete incorporating metakaolin (MK) and fly ash (FA). The predictions produced reflect the effect of graduated variations in pozzolanic replacement in Portland cement (PC) of up to 15% MK and 40% FA. The results show that the models are reliable and accurate and illustrate how neural networks can be used to beneficially predict the workability parameters of slump, compacting factor and Vebe time across a wide range of PC-FA-MK compositions.
Multiple-Seed TPG Structures
Authors: Dimitri Kagaris
Venue: IEEE Transactions on Computers (2003)

Abstract--Linear Feedback Shift Registers (LFSRs) are popular mechanisms for built-in test pattern generation (TPG). They are normally used with a primitive characteristic polynomial because, in that case, only one initialization state (seed) is required. In this paper, we show that if the characteristic polynomial is nonprimitive irreducible, the required seeds can still be efficiently generated. We establish a formula that shows how the seeds of any nonprimitive irreducible polynomial relate to each other. This leads to an efficient hardware implementation with small hardware overhead, irrespective of the number of seeds, and enhances the choices available for the design of appropriate TPG structures in the case of pseudoexhaustive TPG that were previously limited to primitive characteristic polynomials only.
Net and Pin Distribution for 3D Package Global Routing
Authors: Jacob R. Minz, Mohit Pathak, Sung Kyu Lim
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

In this paper, we study the net and pin distribution problem for global routing targeting three dimensional packaging layout via System-on-Package (SOP). The routing environment for the new emerging mixed-signal SOP technology is more advanced than that of the conventional PCB or MCM technology -- pins are located at all layers of SOP packaging substrate rather than the top-most layer only. This is the first work to formulate and solve the multi-layer net and pin distribution for layer, wirelength, and crosstalk minimization.
Early SEU Fault Injection in Digital, Analog and Mixed Signal Circuits: A Global Flow
Authors: R. Leveugle, A. Ammari
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Fault injection techniques have been proposed for years to early analyze the dependability characteristics of digital circuits. Very few attempts have however been reported to perform the same task in analog parts. Furthermore, these attempts are all based on parametric variations. With the increasing number of mixed signal circuits, a unified approach becomes mandatory to globally validate the digital and analog parts, while taking into account real faults occurring in the field, e.g. SEUs. In this paper, a global analysis flow is proposed, based on a high-level model of the circuit. The possibility to inject transient faults in the different parts is discussed. The results obtained on a case study are reported to show the feasibility of the injection in analog blocks.
Combining the web content and usage mining to understand the visitor behavior in a web site
Authors: Juan Velásquez, Hiroshi Yasuda, Terumasa Aoki
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

A web site is a semi structured collection of differentkinds of data, whose motivation is show relevant informationto visitor and by this way capture her/his attention.Understand the specifics preferences that define the visitorbehavior in a web site, is a complex task. An approximationis suppose that it depend the content, navigationsequence and time spent in each page visited. These variablescan be extracted from the web log files and the website itself, using web usage and content mining respectively.Combining the describe variables, a similarity measureamong visitor sessions is introduced and used in a clusteringalgorithm, which identifies groups of similar sessions,allowing the analysis of visitors behavior.In order to prove the methodology's effectiveness, it wasapplied in a certain web site, showing the benefits of thedescribed approach.
VDM over PSP: A Pilot Course for VDM Beginners to Confirm its Suitability for Their Development
Authors: Hisayuki Suzumori, Haruhiko Kaiya, Kenji Kaijiri
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Although formal methods seem to be useful, these is noclear way for beginners to know whether the methods aresuit for them and for their problem domain, before usingthe methods in practice. We propose a method to confirmthe suitability of a formal method. The method is realized asa pilot course based on the PSP. A course mentioned in thispaper is designed for a typical formal method, VDM. Ourcourse also helps beginners of VDM to learn VDM graduallyand naturally. During the course, they can confirmits suitability as follows; First, they practice several exercisesfor software development, while techniques of VDMare introduced gradually. Second, process data and productdata of software development are recorded in each exercise.Third, by evaluating these data by several metrics, they canconfirm the suitability of VDM for their work.
Ontology frames for IT courseware representation
Authors: Witold Abramowicz, Marek Kowalkiewicz, Piotr Zawadzki
Venue: Knowledge management: current issues and challenges (2003)

This chapter introduces topic maps and skill maps technologies as a framework for storing courseware and relevant user profiles. It is a result of research being conducted on creating a knowledge exchange platform for the corporate environment. It briefly describes topic maps and skill maps -- a new concept developed by the authors. It then proposes applying ontology frames to latter technologies. The proposition is followed by specification of a proposed solution. This solution is used in the Knowledge e-Marketplace for a Courseware Distribution project that is being developed at The Poznan University of Economics, Poland. The project's target is to integrate traditional e-Marketplace with topic map technology and to introduce a new technology -- skill maps -- for representing an individual employee's knowledge. There is a need to create common ontology frames for topic maps and skill maps in order to coherently represent knowledge and knowledge profiles.