ppxscal/embedding_network huggingface dataset:
A visual and interactive automata theory course with JFLAP 4.0
Authors: Ryan Cavalcante, Thomas Finley, Susan H. Rodger
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters worth of material from JFLAP 3.1, now covering topics from eleven of thirteen chapters for a semester course. JFLAP 4.0 has easier interactive approaches to previous topics and covers many new topics including three parsing algorithms, multi-tape Turing machines, L-systems, and grammar transformations.
FRESHMIX: a study in user interaction with dynamic content
Authors: Maureen Lin
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

This project is an online blender providing refreshing interactive experience through the integration of multimedia design and creative programming to make a unique use of dynamic content.
Strong Markov Random Field Model
Authors: Rupert Paget
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--The strong Markov random field (strong-MRF) model is a submodel of the more general MRF-Gibbs model. The strong-MRF model defines a system whose field is Markovian with respect to a defined neighborhood, and all subneighborhoods are also Markovian. A checkerboard pattern is a perfect example of a strong Markovian system. Although the strong Markovian system requires a more stringent assumption about the field, it does have some very nice mathematical properties. One mathematical property is the ability to define the strong-MRF model with respect to its marginal distributions over the cliques. Also, a direct equivalence to the Analysis-of-Variance (ANOVA) log-linear construction can be proven. From this proof, the general ANOVA log-linear construction formula is acquired.
Cluster busting in anchored graph drawing
Authors: Kelly A. Lyons
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

Graphs are used to model many objects in computer science, such as VLSI circuits, networks, and large software designs. Using graphs to represent complex structures and relations often simplifies the presentation of these structures. It is not surprising that there has been a recent demand for algorithms that display a graph on a two-dimensional surface so that the resulting drawing is easy to read and understand.In this paper, we present a brief survey of the field of automatic graph layout. We identify the problem of visualizing distributed systems as an area in which graph layout algorithms are often required. We discuss layout problems specific to the application of drawing graphs of distributed networks and systems, and present four algorithms for solving these problems.
A trust-region-approach for solving a parameter estimation problem from the biotechnology area
Authors: Juan Ignacio Ardenghi, María Cristina Maciel, Adriana Beatriz Verdiell
Venue: Applied Numerical Mathematics (2003)

Growth kinetics of microorganisms processes involves a parameter estimation problem, which is usually solved by using simulation techniques. A different approach is presented. It is based on a trust-region algorithm for nonlinear least squares problems with bound constraints. The global convergence properties of the algorithm are analyzed in the theory proposed by Verdiell.An important aspect of the algorithm is that first and second order information of the objective function can be approximated what is advantageous for the class of pointwise known functions. This feature makes the algorithm suitable to solve real-world problems. Encouraging preliminary results are presented.
Concentration inequalities for the missing mass and for histogram rule error
Authors: David McAllester, Luis Ortiz
Venue: The Journal of Machine Learning Research (2003)

This paper gives distribution-free concentration inequalities for the missing mass and the error rate of histogram rules. Negative association methods can be used to reduce these concentration problems to concentration questions about independent sums. Although the sums are independent, they are highly heterogeneous. Such highly heterogeneous independent sums cannot be analyzed using standard concentration inequalities such as Hoeffding's inequality, the Angluin-Valiant bound, Bernstein's inequality, Bennett's inequality, or McDiarmid's theorem. The concentration inequality for histogram rule error is motivated by the desire to construct a new class of bounds on the generalization error of decision trees.
Optimal Pricing of Content Delivery Network (CDN) Services
Authors: Kartik Hosanagar, Ramayya Krishnan, Michael Smith, John Chuang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Content Delivery Networks (CDNs) intelligently cache content on behalf of content providers and deliver this content to end users. New services have been rolled out recently by CDNs that enable content providers to deliver entire web sites from the distributed CDN servers. Using analytical models, we address the optimal pricing of these services.Our results suggest that, consistent with industry practices, CDN pricing functions should provide volume discounts to content providers. They also show that the most likely subscribers to CDN services are those content providers with high volume of traffic and with content having low security requirements. Significantly, our model also shows that larger CDN networks can charge higher prices in equilibrium, which should strengthen any technology-based economies of scale and make it more difficult for entrants to compete against incumbent firms. We find that CDNs will have to lower prices in light of increasing security concerns associated with content delivery. Alternatively, they will need to invest indeveloping and deploying technology to alleviate the security concerns. Finally, we find that declining bandwidth costs will negatively impact CDN revenues and profits.
Taming a professional IDE for the classroom
Authors: Charles Reis, Robert Cartwright
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

An important question that must be addressed in a coherent computing curriculum is which programming environments to use across the curriculum. For Java, currently the most widely used language in computing education, a wide variety of professional integrated development environments (IDEs) are available---including the increasingly popular, open-source Eclipse environment. Professional IDEs for Java work well in advanced courses, but they are poorly matched to introductory courses because they deluge beginning students with a complex array of features. In addition, professional IDEs fail to shield students from distracting complications like the Java command line interface and Java console I/O. For this reason, many educators favor using a "pedagogic" IDE such as BlueJ or DrJava to provide a gentle introduction to the mechanics of Java programming.To eliminate the gap between pedagogic and professional IDEs for Java, we have developed a plug-in for Eclipse that supports exactly the same programming interface as DrJava. It features an Interactions pane for evaluating program statements and expressions "on the fly" as in DrJava. With this plug-in, Eclipse is accessible to beginning programmers. In this configuration, Eclipse is a suitable vehicle for teaching introductory programming--enabling Eclipse to be used across the entire spectrum of the computing curriculum.
Dynamic solver selection for an Internet simulation backbone
Authors: B. Bettig, C. Sandu, Anup R. Joshi, K. Birru
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This current research is to develop automated solver selection capabilities necessary to achieve a "simulation backbone" in which domain experts can plug in simulation solvers they have developed and have these automatically available for use to designers and researchers whose simulation requirements take them into that discipline. The ultimate goal is a one-button press execution of a simulation performed using the correct simulation solvers on machines distributed over the Internet using software automatically taken from the Internet.In order to achieve this objective, we have started to develop a framework to identify and characterize a system of computer-interpretable rules that describe when a theoretical and computational model is applicable to a design simulation. For example, if a design model comprises some geometric volume and fluid flow conditions are specified, a rule can indicate that the problem is in the discipline of fluid dynamics. Depending on the specific shape and size of the volume and the velocity and viscosity of the fluid, rules can be used to further distinguish the problem as being in the sub-discipline of, for example, laminar, turbulent, or compressible flow. The existence of side effects, such as changes in heat transfer properties or aero-elastic effects, can also be inferred using rules that consider the results from a fluid dynamics simulation. The research scope has been limited to selected disciplines in mechanical engineering.
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
Authors: Colin Cooper, Alan Frieze, Bruce Reed, Oliver Riordan
Venue: Combinatorics, Probability and Computing (2002)

Let r = r(n) &rarr; &infin; with 3 &les; r &les; n1&minus;&eta; for an arbitrarily small constant &eta; > 0, and let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with vertex set &lcub;1, 2, &hellip;, n&rcub;. We prove that, with probability tending to 1 as n &rarr; &infin;, Gr has the following properties: the independence number of Gr is asymptotically 2n log r&#x002F;r and the chromatic number of Gr is asymptotically r/2nlogr.
Partition identities and congruences associated with the Fourier coefficients of the Euler products
Authors: Heng Huat Chan, Richard P. Lewis
Venue: Journal of Computational and Applied Mathematics (2003)

In this article, we discuss two applications of the operator U(m) (see (1.1)) defined on the product of two power series.
MULINO-DSS: a computer tool for sustainable use of water resources at the catchment scale
Authors: C. Giupponi, J. Mysiak, A. Fassio, V. Cogan
Venue: Mathematics and Computers in Simulation (2004)

MULINO, an ongoing project financed by the European Commission, has released the prototype of a Decision Support System software (mDSS) for the sustainable management of water resources at the catchment scale. The software integrates socio-economic and environmental modelling, with geo-spatial information and multicriteria analysis. The policy background refers to the EU Water Framework Directive. The challenging multi-disciplinary context was approached by developing an innovative and dynamic implementation of the DPSIR framework, originally proposed by the European Environmental Agency. In mDSS integrated assessment modelling provides the values of quantitative indicators to be used for transparent and participated decisions, through the application of value functions, weights and decision roles chosen by the end user. Simple routines for the sensitivity analysis and comparison of alternative weight vectors also provides effective decision support by exploring and finding compromises between conflicting interests/perspectives in a multi-stakeholder context.
Maintenance policy selection in heterogeneous data warehouse environments: a heuristics-based approach
Authors: H. Engströ, S. Chakravarthy, B. Lings
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

This work addresses data warehouse maintenance, i.e. how changes to autonomous, heterogeneous, and distributed sources should be detected and propagated to a warehouse. The research community has mainly addressed issues relating to the internal operation of data warehouse servers. Work related to data warehouse maintenance has received less attention and only a limited set of maintenance alternatives are considered while ignoring the autonomy and heterogeneity of sources.In this paper, we extend work on single source view maintenance to views with multiple heterogeneous sources. We present a tool (PAM) which allows for comparison of a large number of relevant maintenance policies under different configurations. Based on such analysis and previous studies we propose a set of heuristics to guide in policy selection. The quality of these heuristics is evaluated empirically using a test-bed developed for this purpose. This is done for a number of different criteria and for different data sources and computer systems. The performance gained using the policy selected through the heuristics is compared with the performance of all identified policies. Based on these experiments we claim that heuristic-based selections are good.
Complementary Product Integration by High-Technology New Ventures: The Role of Initial Technology Strategy
Authors: Satish Nambisan
Venue: Management Science (2002)

In this paper, we investigate the relationship betweencomplementary product integration and theinitial technology strategy of a high-technology new venture. With customers placing considerable emphasis on cross-product integration, the success of a new venture is dependent as much on its ability to integrate its product with relevant complementary products as on the core product functionality itself. We identify three types of complementary product integration: value-added internal, add-on module, and data interface. We argue that the adoption of proactive initial technology strategy critically determines the ability of a high-technology new venture to rapidly and efficiently integrate its product with new and emerging complementary products. More specifically, we offer hypotheses that relate initial design and development strategies to the number and the type of complementary product integrations achieved by a new venture in the initial years. The hypotheses are tested using data from a set of U.S.-based software new ventures. The results support our arguments and imply the need for high-technology new ventures to adopt an explicit complementary product focus during initial product design.
An Interview with David Rejeski: Making policy in a Moore's Law world
Authors: Ubiquity staff
Venue: Ubiquity (2003)

The accelerated rate of scientific discovery and technological innovation makes it difficult to keep up with the pace of change. What do policymakers know of nanotechnology and genetic modification? David Rejeski helps government agencies anticipate emerging technological issues.
Architecting a knowledge discovery engine for military commanders utilizing massive runs of simulations
Authors: Philip Barry, Jianping Zhang, Mary McDonald
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The Marine Corps' Project Albert seeks to model complex phenomenon by observing the behavior of relatively simple simulations over thousands of runs. A rich data base is developed by running the simulations thousands of times, varying the agent and scenario input parameters as well as the random seeds. Exploring this result space may provide significant insight into nonlinear, surprising, and emergent behaviors. Capturing these results can provide a path for making the results usable for decision support to a military commander. This paper presents two data mining approaches, rule discovery and Bayesian networks, for analyzing the Albert simulation data. The first approach generates rules from the data and then uses them to create descriptive model. The second generates Bayesian Networks which provide a quantitative belief model for decision support. Both of these approaches as well as the Project Albert simulations are framed in the context of a system architecture for decision support.
The K-divisibility constant for couples of Banach lattices
Authors: Michael Cwikel
Venue: Journal of Approximation Theory (2003)

It is shown that the Brudnyi-Krugljak K-divisibility constant for an arbitrary couple of Banach lattices on the same underlying measure space is bounded above by 4.
Classifying and assessing tremor movements for applications in man-machine intelligent user interfaces
Authors: Dan Marius Dobrea, Horia Nicolai Teodorescu
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

We introduce a new intelligent user interface (IUI) and, also, a new methodology to identify the fatigue state for healthy subjects. The fatigue state is determined by means of a new type of input IUI, named Virtual Joystick. The main goal is to prove the ability of the new IUI system to identify the user's state. We describe the method used in data collecting, the method used to highlight the existence of different physiological and psychic fatigue states reflected by the tremor signal, the classifier system and, finally, the performances we obtained.
Designing Guideline-Based Workflow-Enabled Electronic Health Records
Authors: Sistine A. Barretto, Jim Warren, Andrew Goodchild
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

With the rising prevalence of chronic illness, there is a growing pressure to develop systems that engender evidence-based care. The potential for workflow support to coordinate services and improve communication in the context of chronic disease management is intuitively appealing, but is still a challenging (and hence rarely seen) accomplishment in practice. Weexamine the problem of achieving a close relationship of Electronic Health Record (EHR) content to other components of a clinical information system (guidelines, decision support and workflow), with particular emphasis on integrating the EHR with workflow. We use the openEHR architecture, which allows extension of a core Reference Model via Archetypes, to refine the detailed information recording options for specific points in the workflow and to represent the chain of instructions that is the workflow itself. We illustrate the use of openEHR for tracking the relationship of a series of clinical services or events to a guideline-based workflow via a case study of an Early Supported Discharge (ESD) program for Post-Stroke Rehabilitation. This case study shows the contribution guideline content and its derived workflow can have on problem-specific EHR structure and demonstrates the potential for a constructive interaction of workflow support and the EHR. We conclude with a discussion of the practical boundary of applicability of workflow approaches versus decision support system approaches in supporting guideline-based care.
A Mean-Variance Analysis of Self-Financing Portfolios
Authors: Bob Korkie, Harry J. Turtle
Venue: Management Science (2002)

This paper develops the analytics and geometry of the investment opportunity set (IOS) and the test statistics for self-financing portfolios. A self-financing portfolio is a set of long and short investments such that the sum of their investment weights, or net investment, is zero. This contrasts with a standard portfolio that has investment weights summing to one. Examples of self-financing portfolios are hedges, overlays, arbitrage portfolios, swaps, and long/short portfolios. A standard portfolio plus the IOS of self-financing portfolios form a restricted IOS hyperbola with restricted efficient set constants that differ from the usual constants. The restrictions affect statistical tests of portfolio efficiency, which are developed for the self-financing restrictions. As an application, we consider the self-financing portfolios formed by Fama and French (1992, 1993, 1995), based on market capitalization and value. In contrast to Fama and French (1992, 1993, 1995), we find that their restricted IOS is significantly different from the unrestricted IOS with the implication that the Fama-French tests are misspecified.
Generating programming language-based pattern matchers
Authors: Santanu Paul, Atul Prakash
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper is based on a logical extension of our past work in pattern matching tools [22, 24, 25 ] for reverse engineering. We explore two new directions: first, we investigate the need for new and more powerful source code and pattern representations to support a richer set of queries; and second, we develop the concept of automatic generation of pattern matchers for different programming languages starting from a high-level specification of the programming language. A generator will eliminate the need for manually-coded pattern matchers for different programming languages. Preliminary ideas are discussed and a roadmap of research issues is presented.
Multi-camera spatio-temporal fusion and biased sequence-data learning for security surveillance
Authors: Gang Wu, Yi Wu, Long Jiao, Yuan-Fang Wang, Edward Y. Chang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present a framework for multi-camera video surveillance. The framework consists of three phases: detection, representation, and recognition. The detection phase handles multi-source spatio-temporal data fusion for efficiently and reliably extracting motion trajectories from video. The representation phase summarizes raw trajectory data to construct hierarchical, invariant, and content-rich descriptions of the motion events. Finally, the recognition phase deals with event classification and identification on the data descriptors. Because of space limits, we describe only briefly how we detect and represent events, but we provide in-depth treatment on the third phase: event recognition. For effective recognition, we devise a sequence-alignment kernel function to perform sequence data learning for identifying suspicious events. We show that when the positive training instances (i.e., suspicious events) are significantly outnumbered by the negative training instances (benign events), then SVMs (or any other learning methods) can suffer a high incidence of errors. To remedy this problem, we propose the kernel boundary alignment (KBA) algorithm to work with the sequence-alignment kernel. Through empirical study in a parking-lot surveillance setting, we show that our spatio-temporal fusion scheme and biased sequence-data learning method are highly effective in identifying suspicious events.
Strategic issues in implementing electronic-ID services: prescriptions for managers
Authors: Bishwajit Choudhary
Venue: Managing e-commerce and mobile computing technologies (2003)

During the past few years, e-security solutions (e.g., digital certificates, e-signatures, e-IDs) gained tremendous attention as they promised to plug security loopholes and create trusted electronic markets. Implementation of such critical, complex and costly security solutions demands thorough assessment at technical, as well as business levels. Based on the author's experience at one of Scandinavia's leading vendors of banking solutions and infrastructure, the paper develops basic concepts, discusses strategic (product, market and technical) concerns and, finally, summarizes the contemporary challenges facing the implementation of e-ID schemes.