ppxscal/embedding_network huggingface dataset:
A dynamic model of cyber-entrepreneurship and cluster formation: applications in the United States and in the low countries
Authors: Harry Bouwman, Wim Hulsink
Venue: Telematics and Informatics (2002)

Policy-makers and captains of industry in the Netherlands and Flanders have come up with plans, actions, and measures to stimulate innovation and entrepreneurship in the ICT-industries. Inspired by the vision and experiences with new business development and cluster formation in Silicon Valley, Route 128 and Silicon Alley, they seek to create indigenous technopoles in the Low Countries. Some of these new ideas and plans have recently been put forward: Amsterdam Multimedia Corridor, Louvain Technology Corridor, Flanders Language Valley, Twente and Dommel Valley. This paper seeks to address the following research questions: Is it possible to emulate the success of Silicon Valley in the polders of the Low Countries? And what are the preconditions for growing a Silicon Valley in the Netherlands and Flanders? In order to explain the path-dependent rise of ICT-technopoles in general, a dynamic model is presented and discussed. Furthermore, analyzing and comparing the aforementioned ICT-clusters in the Netherlands and Flanders validates the model.
SiSMA: a statistical simulator for mismatch analysis of MOS ICs
Authors: G. Biagetti, S. Orcioni, L. Signoracci, C. Turchetti, P. Crippa, M. Alessandrini
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This paper presents a simulator for the statistical analysis of MOS integrated circuits a ected by mismatch e ect. The tool is based on a rigorous formulation of circuit equations including random current sources to take into account technological tolerances. The simulator requires a simulation time of several orders of magnitude lower than that required by Montecarlo analysis, while ensuring a good accuracy.
Intelligent software support for business process change
Authors: Jussi Stader, Jonathan Moore, Ann Macintosh, Paul Chung, Ian McBriar, Mohan Ravindranathan
Venue: Systems engineering for business process change: new directions (2002)

In recent years, many organisations have found enterprise modelling, and particularly business process modelling, to be an effective tool for managing organisational change - both for developing an understanding of the organisation as it currently exists and for planning change in the organisation. The process models developed, however, tend to be used only for reference during business operations and the reengineering activity, rather than as a resource which can be actively used to support the day-to-day execution of the organisation's processes. While workflow systems do use process models in this way, current systems can only handle simple, predictable processes, not the dynamically changing, complex and unpredictable processes for which many organisations require support. The TBPM project extends the application scope of current workflow systems to more complex and flexible business processes by incorporating into the software system knowledge about the processes and their organisational context, in the form of enterprise models. Used in conjunction with a management approach which permits the specification, planing, and enactment of processes to be interleaved, the models provide the basis for TBPM's adaptive workflow support for complex business processes. The TBPM project is a collaborative project between AIAI, the University of Edinburgh and the Computer Science Department at Loughborough University. ICI and Unilever are industrial partners on the project, providing real business requirements and an application scenario from the chemical process industries. This scenario, taken from the area of new product development, illustrates the mechanisms and benefits of the approach adopted.
Online teaching: say goodby to chat
Authors: Frank G. Landram
Venue: Journal of Computing Sciences in Colleges (2002)

Online teaching must be structured where students are on a specific timeline and feel they are in a "classroom" learning environment. This philosophy has evolved into meaning that online teaching requires a high interaction with students using e-mail and chat. This paper describes an online study in introductory statistics which used computer tutorial supplements and computer graded quizzes (over 25 quizzes) with immediate feedback to monitor the progress of students. This type of learning environment is modeled after certification programs conducted by corporations such as Microsoft and Novell. These programs are not limited by a large number of participants nor are they labor intense. Benefits from this study will include how to teach large online classes in a more efficient yet less time consuming manner.
Nonnegative solutions for the degenerate logistic indefinite sublinear equation
Authors: M. Delgado, A. Suárez
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

The goal of this paper is to study the nonnegative steady-states solutions of the degenerate logistic indefinite sublinear problem. We combine bifurcation method and linking local subsuper-solution technique to show the existence and multiplicity of nonnegative solutions. We employ a change of variable already used in a different context and the spectral singular theory to prove uniqueness results.
Pattern extraction method for text classification
Authors: Hung Son Nguyen, Hui Wang
Venue: Technologies for constructing intelligent systems: Tasks (2002)

The quality of classification can be increased by using some feature extraction algorithm, i.e. the algorithm that finds new and more relevant features, before application of learning procedure. In this paper, we investigate a novel feature extraction method for textual data. Usually, texts (documents) are represented as collections of words or keywords. We present a method for finding new numerical attributes that improve the quality of classification. New features are based on a set of words (text pattern) and are defined as number of words occurring in both text pattern and the considered document. Our approach is based on Rough set methods and Lattice Machine theory. The experimental results show that the presented methods improve the classification quality on almost all textual data.
The "magic number 5": is it enough for web testing?
Authors: Nigel Bevan, Carol Barnum, Gilbert Cockton, Jakob Nielsen, Jared Spool, Dennis Wixon
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Common practice holds that 80% of usability findings are discovered after five participants. Recent findings from web testing indicate that a much larger number of participants is required to get results and that independent teams testing the same web-based product do not replicate results. How many users are enough for web testing?
XML-based toolkit for interoperability of web information systems
Authors: Christophe Nicolle, Kokou Yétongnon
Venue: Web-enabled systems integration: practices and challenges (2003)

This chapter presents a methodology and tools framework, called X-TIME, to support data integration via web sites. It is a data model translator toolkit based on a metamodel and XML technology that is aimed at facilitating the design of wrappers, semantic reconciliators or mediators. X-TIME is an adaptable semantics-oriented metamodel approach that takes into account important characteristics of interoperable information systems, including extensibility and composability. Extensibility requires a translation scheme that can easily integrate new data models while composability, which is the ability of an application to define dynamically the subset of data sources it needs, requires on-demand translation among a subset of data models. To meet these requirements, X-TIME is based on an extensible metamodel that defines a set of metatypes for representing meta-level semantic descriptors of data models that can be found in web sites. The metatypes are organized in a generalization hierarchy to capture semantic similarities between modeling concepts and correlate constituent data models of interoperable systems.
An Example of a Good But Partially Successful Or Engagement: Improving Outpatient Clinic Operations
Authors: Joanne C. Bennett, D. J. Worthington
Venue: Interfaces (1998)

We undertook a study to improve the running of hospital outpatient clinics that were regularly overbooked, overrun, and had excessive patient waiting times. The methodology adopted entailed a mixture of qualitative and quantitative approaches, but was problem-driven and so only emerged as the project developed. We generated a number of proposals for the improved running of the clinics during the project, some implemented and some not. For future studies we would recommend that a flexible and open-minded approach is adopted. This may well involve an initial, mainly qualitative, study followed by the application of a series of modest models-occasionally more sophisticated modeling may be appropriate. We would also recommend that the benefits of such studies are not judged solely in terms of one-off implementation leading to measurable improvements in performance. They should also be seen as part of an overall process of improving health care practices.
Global serverless videoconferencing over IP
Authors: Thomas C. Schmidt, Matthias Wählisch, Hans L. Cycon, Mark Palkow
Venue: Future Generation Computer Systems (2003)

In recent years the capabilities of the common Internet infrastructure have increased to an extent where data intensive communication services may mature to become popular, reliable applications. Videoconferencing over IP can be seen as such a highly prominent candidate. However, heavy infrastructure and complicated call handling hinder acceptance of standard solutions.This paper presents a more lightweight framework--both communication scheme and conferencing software--to overcome these deficiencies. A simple, ready-to-use global location scheme for conference users is proposed. First practical experiences are reported.
Time series modeling and interpretation
Authors: C. W. J. Granger, M. J. Morris
Venue: Essays in econometrics: Spectral analysis, seasonality, nonlinearity, methodology, and forecasting (2001)

By considering the model generating the sum of two or more series, it is shown that the mixed ARMA model is the one most likely to occur. As most economic series are both aggregates and are measured with error it follows that such mixed models will often be found in practice. If such a model is found, the possibility of resolving the series into simple components is considered both theoretically and for simulated data.
Paper or interactive?: a study of prototyping techniques for ubiquitous computing environments
Authors: Linchuan Liu, Peter Khooshabeh
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We studied the effects of varying the fidelity and automation levels of a Ubicomp application prototype. Our results show that the interactive prototype captured the same usability issues that the paper prototype studies did and more. We found that paper prototyping is insufficient for supporting unique Ubicomp requirements, such as scalability, but a prototype with higher fidelity and automation levels can enhance the quality of interaction data available for evaluation.
On operations of spatial ordering and location code
Authors: Xian Liu
Venue: Applied Mathematics and Computation (2003)

Spatial ordering is the numeral sequence of points in the n-dimensional integer space In. Many computational applications are based on spatial ordering. Analysis on spatial ordering can be conducted in three areas: algebraic structures, algebraic operations, and performance metrics. This paper mainly focuses on operations. Although the addition and multiplication may involve the finite group concept, the rotation and mirroring can be described by a Boolean algebraic approach called the Boolean formulation method. An alternative method, the polynomial mapping method, is also discussed.
Packing Random Rectangles of Given Volume
Authors: Wansoo T. Rhee
Venue: Mathematics of Operations Research (2002)

A packing of a collection of rectangles is a disjoint subcollection. In a recent paper, Coffman et al. (1999) prove that the cardinality of a maximum packing of a family ofn random rectangles in [0, 1] 2 is of order n 1/2. We obtain tight bounds on the same quantity when the random rectangles are of a specified volume.
Separability in Optimal Allocation
Authors: Bennet L. Fox
Venue: Operations Research (2000)

The optimal allocation for stratification, parameterized by the respective sampling strategy to use in each stratum, is derived directly from the notion of efficiency. Especially with simulation, there are often opportunities to maximize efficiency (myopically) within each stratum. To maximize efficiency globally, first maximize the efficiency of the sampling strategy for each stratum separately and then use the optimal allocation given these respective maximizers. Given any other allocation, maximizing the efficiency of the sampling strategy in each stratum separately does not give the highest efficiency attainable with that allocation except in degenerate cases. Given a classof deterministic rounding strategies, the rounding of the (continuous) optimal allocation over , which maximizes efficiency, cannot be improved by a strategy that randomizes over .
Problem dependent generalized prewavelets
Authors: C. Pflaum
Venue: Computing (2002)

In this paper, we present a new approach to construct robust multilevel algorithms for elliptic differential equations. The multilevel algorithms consist of multiplicative subspace corrections in spaces spanned by problem dependent generalized prewavelets. These generalized prewavelets are constructed by a local orthogonalization of hierarchical basis functions with respect to a so-called local coarse-grid space. Numerical results show that the local orthogonalization leads to a smaller constant in strengthened Cauchy-Schwarz inequality than the original hierarchical basis functions. This holds also for several equations with discontinuous coefficients. Thus, the corresponding multilevel algorithm is a fast and robust iterative solver.
On immersions of uncountable graphs
Authors: Thomas Andreae
Venue: Journal of Combinatorial Theory Series B (2003)

In his paper on well-quasi-ordering infinite trees (Proc. Cambridge Philos. Soc. 61 (1965) 697), Nash-Williams proposed the conjecture that the class of all graphs (finite or infinite) is well-quasi-ordered by the immersion relation (which is denoted here by ≤ 1). In addition, in a subsequent paper, Nash-Williams discussed a weaker version of his original conjecture to the effect that the class of graphs is well-quasi-ordered with respect to a relation ≤ 2 which. roughly speaking, is obtained by redefining H ≤1G so that distinct vertices of H can be mapped into the same vertex of G. It is the purpose of the present note to disprove Nash-Williams' two immersion conjectures.
Layout-driven resource sharing in high-level synthesis
Authors: Junhyung Um, Jae-hoon Kim, Taewhan Kim
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In deep submicron (DSM) technology, the interconnects are equally as or more important than the logic gates. In particular, to achieve timing closure in DSM technology, it is very necessary and critical to consider the interconnect delay at an early stage of the synthesis process. It has been known that resource sharing in high-level synthesis is one of the major synthesis tasks which greatly affect the final synthesis/layout results. In this paper, we propose a new layout-driven resource sharing approach to overcome some of the limitations of the previous works in which the effects of layout on the synthesis have never been taken into account or considered in local and limited ways, or whose computation time is excessively large. The proposed approach consists of two steps: (Step 1) We relax the integrated resource sharing and placement into an efficient linear programming (LP) formulation based on the concept of discretizing placement space; (Step 2) We derive a feasible solution from the solution obtained in Step 1. Then, we employ an iterative mechanism based on the two steps to tightly integrate resource sharing and placement tasks so that the slack time violation due to interconnect delay (determined by placement) as well as logic delay (determined by resource sharing) should be minimized. From experiments using a set of benchmark designs, it is shown that the approach is effective, and efficient, completely removing the slack time violation produced by conventional methods.
High frequency noise in fully overlapped lightly doped drain MOSFETs
Authors: Anil Kumar, Subhasis Haldar, Mridula Gupta, R. S. Gupta
Venue: Microelectronic Engineering (2003)

The high frequency noise of fully overlapped lightly doped drain (FOLD) MOSFETs incorporating the field dependent mobility and the bias dependent series resistance is predicted. This includes the thermal noise and the induced gate noise. The results so obtained for effective current noise gain are compared with the simulated data of short channel LDD MOSFETs and are in good agreement. At frequencies much below the cut-off frequency, the induced gate noise is just 1% or even less of the drain noise. The effective current noise gain in FOLD and LDD MOSFETs is compared and shows that thermal noise increases while gate induced noise decreases with the decrease in channel length.
Track assignment: a desirable intermediate step between global routing and detailed routing
Authors: Shabbir Batterywala, Narendra Shenoy, William Nicholls, Hai Zhou
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Routing is one of the most complex stages in the back-end design process. Simple routing algorithms based on two stages of global routing and detailed routing do not offer appropriate opportunities to address problems arising from signal delay, cross-talk and process constraints. An intermediate stage of track assignment between global and detailed routing proves to be an ideal place to address these problems. With this stage it is possible to use global routing information to efficiently address these problems and to aid the detailed router in achieving the wiring completions. In this paper we formulate routing as a three stage process; global routing, track assignment and detailed routing. We describe the intermediate track assignment problem and suggest an efficient heuristic for its solution. We introduce cost metrics to model basic effects arising from connectivity. We discuss extensions to include signal integrity and process constraints. We propose a heuristic based on weighted bipartite matching as a core routine. To improve its performance additional heuristics based on lookahead and segment splitting are also suggested. Experimental results are given to highlight the efficacy of track assignment stage in routing process.
Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management
Authors: Warren B. Powell, Tassio A. Carvalho
Venue: Transportation Science (1998)

Dynamic fleet management problems are normally formulated as networks over dynamic networks. Additional realism usually implies the inclusion of complicating constraints, typically producing exceptionally large integer programs. In this paper, we present for the first time the formulation of dynamic fleet management problems in an optimal control setting, using a novel formulation called a Logistics Queueing Network (LQN). This formulation replaces a single, large optimization problem with a series of very small problems that involve little more than solving a single sort at each point in space and time. We show that this approach can produce solutions that are within a few percent of a global optimum but provide for considerably more flexibility than standard linear programs.
Constructive hypervolume modeling
Authors: Alexander Pasko, Valery Adzhiev, Benjamin Schmitt, Christophe Schlick
Venue: Graphical Models (2001)

This paper deals with modeling point sets with attributes. A point set in a geometric space of an arbitrary dimension is a geometric model of a real/abstract object or process under consideration. An attribute is a mathematical model of an object property of arbitrary nature (material, photometric, physical, statistical, etc.) defined at any point of the point set. We provide a brief survey of different modeling techniques related to point sets with attributes. It spans such different areas as solid modeling, heterogeneous objects modeling, scalar fields or "implicit surface" modeling and volume graphics. Then, on the basis of this survey we formulate requirements to a general model of hypervolumes (multidimensional point sets with multiple attributes). A general hypervolume model and its components such as objects, operations, and relations are introduced and discussed. A function representation (FRep) is used as the basic model for the point set geometry and attributes represented independently using real-valued scalar functions of several variables. Each function defining the geometry or an attribute is evaluated at the given point by a procedure traversing a constructive tree structure with primitives in the leaves and operations in the nodes of the tree. This reflects the constructive nature of the symmetric approach to modeling geometry and associated attributes in multidimensional space. To demonstrate a particular application of the proposed general model, we consider in detail the problem of texturing, introduce a model of constructive hypervolume texture, and then discuss its implementation, as well as the special modeling language we used for modeling hypervolume objects.
Towards a classification framework for mobile location services
Authors: George M. Giaglis, Panos Kourouthanassis, Argirios Tsamakos
Venue: Mobile commerce: technology, theory, and applications (2003)

The emerging world of mobile commerce is characterized by a multiplicity of exciting new technologies, applications, and services. Among the most promising ones will be the ability to identify the exact geographical location of a mobile user at any time. This ability opens the door to a new world of innovative services, which are commonly referred to as Mobile Location Services (MLS). This chapter aims at exploring the fascinating world of MLS, identifying the most pertinent issues that will determine its future potential, and laying down the foundation of a new field of research and practice. The contribution of our analysis is encapsulated into a novel classification of mobile location services that can serve both as an analytical toolkit and an actionable framework that systemizes our understanding of MLS applications, underlying technologies, business models, and pricing schemes.
Networks and history
Authors: Peter Bearman, James Moody, Robert Faris
Venue: Complexity (2002)

Events and event structures compose the constituent elements of history. In order to construct historical accounts of event sequences, historians have to make cases. This article proposes a method for casing historical events. We illustrate the analytic strategy by considering a complex population of interrelated events that make up a narrative of revolution, counter revolution, and revolution in a small village in China. Implications for the methodology of historical social science are discussed.