ppxscal/embedding_network huggingface dataset:
Numerical simulation of scavenging of an urban aerosol by filtration taking into account the presence of coagulation, condensation, and gravitational settling
Authors: P. J. Garcia-Nieto
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This work studies the scavenging efficiencies of an average urban aerosol by means of filtration after a given mechanism of removal (coagulation, heterogeneous nucleation, and gravitational settling) as a function of time. Filtration is a simple, versatile, and economical mean for collecting samples of aerosol particles. The capture of aerosol particles by filtration is the most common method of aerosol sampling and is a widely used method for air cleaning. At low dust concentrations, fibrous filters are the most economical means for achieving high-efficiency collection of submicrometer particles. Aerosol filtration is used in diverse applications, such as respiratory protection, air cleaning of smelter effluent, processing of nuclear and hazardous materials, and clean rooms. The process of filtration is complicated, and although the general principles are well known there is a gap between theory and experiment. In this paper, we review filtration in order to provide an understanding of the properties of fibrous and porous membrane filters, the mechanisms of collection, and how collection efficiency and resistance to airflow change with filter properties and particle size.
Explicit Solution to a Robust Queueing Control Problem
Authors: Paul Dupuis
Venue: SIAM Journal on Control and Optimization (2003)

We consider the robust optimal control of a law of large numbers approximation of a stochastic network. The robust control problem is formulated as a differential game, with one player choosing the policies that determine service and routing assignments and the other choosing quantities such as the arrival and service rates, subject to constraints. The cost to be minimized by the first player and maximized by the second is the time until the origin is reached. An explicit formula is given for the value function, and some of its basic properties are studied.
User interfaces and markup language programming: the effects of interaction mode on user performance and satisfaction
Authors: Jeffrey Hsu
Venue: Computing information technology: the human side (2003)

The role of the user interface (interaction mode) is of considerable importance, since the method of interaction can have an impact on both performance and satisfaction with regards to using a programming language. While markup languages are now widely used for Web page and site design and electronic publishing applications, they have not been studied adequately compared with other kinds of languages. The impact of interaction mode, in this case command-based coding, versus using a form-fill-in wizard, is examined, with respect to performance and satisfaction while performing a survey-oriented task. Skill level, which classified users as being either a novice or experienced, was another factor, which was taken into account in this study. The results showed the use of wizards brought about better performance than using the command language, and the difference between modes was far greater for novices rather than experienced users. In addition, using the wizard tended to equalize performance across skill levels. With regards to system satisfaction, there were significant differences between interaction modes, however no differences were reported between skill levels. These differences in performance and satisfaction should be noted and considered when designing interactive systems for programming-related applications.
Statistical Models for Monolingual and Bilingual Information Retrieval
Authors: Nicola Bertoldi, Marcello Federico
Venue: Information Retrieval (2004)

This work reviews information retrieval systems developed at ITC-irst which were evaluated through several tracks of CLEF, during the last three years. The presentation tries to follow the progress made over time in developing new statistical models first for monolingual information retrieval, then for cross-language information retrieval. Besides describing the underlying theory, performance of monolingual and bilingual information retrieval models are reported, respectively, on Italian monolingual tracks and Italian-English bilingual tracks of CLEF. Monolingual systems by ITC-irst performed consistently well in all the official evaluations, while the bilingual system ranked in CLEF 2002 just behind competitors using commercial machine translation engines. However, by experimentally comparing our statistical topic translation model against a state-of-the-art commercial system, no statistically significant difference in retrieval performance could be measured on a larger set of queries.
A system for floorplanning with hierarchical placement and wiring
Authors: Kevin McCullen, John Thorvaldson, David Demaris, Patrick Lampin
Venue: Proceedings of the conference on European design automation (1990)

Hierarchical physical design is essential for large VLSI chips. This paper describes a new efficient floorplanning system designed to work within a hierarchical design environment; it supports either "strict" or "pseudo"-hierarchy, and multiple design styles. We have demonstrated that our mix of interactive and automatic floorplanning tools allows users to significantly improve the control of timing and wirability on VLSI designs.
Predictive models for wireless fading channels
Authors: Prachee Sharma
Venue:  (2003)

This thesis presents methods for improving the performance of wireless networks through the modeling and prediction of time-varying multipath channels. The Rayleigh fading channel is characterized using first and second-order autoregressive (AR) time-series models. The AR processes model the channel variations at the time-scale of the characteristic Doppler frequency. Small time-scale variations are captured using linear interpolation of the AR model predictions. For defined error performance metrics, the fading signal is characterized using a state-space model that partitions the continuous amplitude variations into error and error-free states. The model parameters and state thresholds are derived as a function of Doppler frequency, signal-to-noise ratio and specified error probability. The aforementioned model is applied for estimating the probability of error as a function of transmission block size. The second-order AR model captures the pseudo-periodic behavior of the Rayleigh channel and produces accurate estimates of block error probabilities relative to the first-order AR process. The fading channel model is applied for both flat and frequency-selective channels in the design of a channel estimator and predictor. A Kalman-filter is designed to forecast the expected channel conditions and the predictions are applied for error control. The performance of the proposed error control approach is compared to a decision feedback equalizer (DFE). The model-based prediction shows at least a 25% improvement over the DFE.
Hot Spot Implosion: The Decline and Fall of Flanders Language Valley
Authors: Alea M. Fairchild, Bruno de Vuyst
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Resource-based theory of competitive advantage suggests that knowledge creates increased performance opportunities for those firms able to identify, access, utilize and disseminate relevant knowledge effectively [1]. The Flanders Language Valley (FLV) initiative, which met the Pouders and St. John [2] definition of a "hot spot", was established to create a global center of competence in speech and language technologies. However, this clustering of innovation occurred in an isolated location within a small European country and was reliant, not on inherent strength of knowledge within that country or region but on tradable technological interdependencies, with codifiable knowledge sold through licensing. Given these issues, FLV fell into bankruptcy and disarray early, due to fraud within Lernout and Hauspie (L&H), the fraud being brought out -- much before Enron, Andersen, WorldCom and others -- because of spontaneous' investigative journalism subsequent to the decision to acquire Dictaphone. This decision overreached the underlying political andeconomical-financial capacity to protect and preserve a parochial-based pseudo hot spot against major national security interests of a superpower.This paper discusses the decline and fall of FLV, based on historical record, and provides some insights into what may curtail hot spot knowledge development.
Toward a Framework for Classifying and Guiding Mixed Method Research in Information Systems
Authors: Stacie C. Petter, Michael J. Gallivan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The field of information systems (IS) has explored research questions in a near-unilateral focus in that most IS research, particularly research published in North American journals, uses a quantitative, positivist approach. To achieve a better understanding of the effect of IS in organizations, researchers should invoke mixed method research in which both quantitative and qualitative methods are used. Rather than simply calling for more mixed method research, we adapt a framework from the education evaluation literature for use within IS. This framework not only classifies existing literature and provides insight into possible mixed method designs, but also contains recommendations for implementing different types of mixed method research. We also analyze this framework in the context of three IS mixed method studies. Challenges to mixed method research and future plans for research are also discussed.
Level set and total variation regularization for elliptic inverse problems with discontinuous coefficients
Authors: Tony F. Chan, Xue-Cheng Tai
Venue: Journal of Computational Physics (2004)

We propose a level set approach for elliptic inverse problems with piecewise constant coefficients. The geometry of the discontinuity of the coefficient is represented implicitly by level set functions. The inverse problem is solved using a variational augmented Lagrangian formulation with total variation regularization of the coefficient. The corresponding Euler-Lagrange equation gives the evolution equation for the level set functions and the constant values of the coefficients. We use a multiple level set representation which allows the coefficient to have multiple constant regions. Knowledge of the exact number of regions is not required, only an upper bound is needed. Numerical experiments show that the method can recover coefficients with rather complicated geometries of discontinuities under moderate amount of noise in the observation data. The method is also robust with respect to the initial guess for the geometry of the coefficient discontinuities.
Schminky: The design of a caf&eacute; based digital experience
Authors: Josephine Reid, Richard Hull, Tom Melamed, Duncan Speakman
Venue: Personal and Ubiquitous Computing (2003)

This paper describes the design process and lessons learned from creating Schminky, a caf&eacute;-based digital experience. Schminky was developed as an experimental field trial to explore the role of pervasive computing. The game will be played by the general public for one week in the Watershed caf&eacute; in Bristol. The Schminky system and the experience design process is described and three key findings, creative tension, context and content are discussed.
The Influence of Familiarity among Group Members and Extraversion on Verbal Interaction in Proximate GSS Sessions
Authors: Tsuneki Mukahi, Gail Corbitt
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Although Computer-Mediated Communication (CMC) is popular, past research shows that Face-to-Face (FTF) interaction is also important in CMC environments. The question is, what are the accelerators for FTF interaction in CMC scenarios? A literature review finds the accelerators of familiarity among group members and personality factors related to E/I (Extraversion/Introversion) important factors to consider in FTF interaction. The focus, therefore, of this study is on proximate Group Support System (GSS) environments that have both CMC and FTF interactions. The objective of the study is to reveal the impacts of familiarity among group members and E/I on verbal interaction in GSS sessions.A proposed causal model, in which verbal and GSS interactions are mediators between the combinations of "group member's familiarity & E/I factors," and "meeting satisfaction & group cohesion," is tested. To examine the model, eight proximate GSS sessions are observed and data are gathered using questionnaires from 59 participants. The data are then analyzed using path analysis.Results show that verbal and GSS interactions do not positively mediate between the combinations of "group member's familiarity & E/I factors," and "meeting satisfaction & group cohesion." This means that verbal interaction is independent from personal factors such as familiarity or E/I and, probably, meeting management factors are important to accelerate verbal interaction among participants. Implications of these findings are discussed within the context of virtual and/or asynchronous meetings.
Introduction to linear bicategories
Authors: J. R. B. Cockett, J. Koslowski, R. A. G. Seely
Venue: Mathematical Structures in Computer Science (2000)

Linear bicategories are a generalization of bicategories in which the one horizontal composition is replaced by two (linked) horizontal compositions. These compositions provide a semantic model for the tensor and par of linear logic: in particular, as composition is fundamentally non-commutative, they provide a suggestive source of models for non-commutative linear logic.In a linear bicategory, the logical notion of complementation becomes a natural linear notion of adjunction. Just as ordinary adjoints are related to (Kan) extensions, these linear adjoints are related to the appropriate notion of linear extension.There is also a stronger notion of complementation, which arises, for example, in cyclic linear logic. This sort of complementation is modelled by cyclic adjoints. This leads to the notion of a *ast;-linear bicategory and the coherence conditions that it must satisfy. Cyclic adjoints also give rise to linear monads: these are, essentially, the appropriate generalization (to the linear setting) of Frobenius algebras and the ambialgebras of Topological Quantum Field Theory.A number of examples of linear bicategories arising from different sources are described, and a number of constructions that result in linear bicategories are indicated.
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains
Authors: Francois Fouss, Marco Saerens, Jean-Michel Renders
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this work, we show that Kleinberg's hubs and authoritiesmodel is closely related to both correspondence analysis,a well-known multivariate statistical technique, and aparticular Markov chain model of navigation through theweb. The only difference between correspondence analysisand Kleinberg's method is the use of the average value ofthe hubs (authorities) scores for computing the authorities(hubs) scores, instead of the sum for Kleinberg's method.We also show that correspondence analysis and our Markovmodel are related to SALSA, a variant of Kleinberg's model.
The active lurker: influence of an in-house online community on its outside environment
Authors: Masamichi Takahashi, Masakazu Fujimoto, Nobuhiro Yamasaki
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In this study, we focus on participants called lurkers, who do not post any messages in an online community such as interactive mailing lists and bulletin board systems. We propose a method of classifying participants including lurkers based on two criteria: what types of actions they take outside the online community, and whether or not the online community affects their thoughts. In addition, based on the results of interviews, we propose hypotheses regarding factors that characterize the categories of lurkers. We conduct a questionnaire survey of all participants in two in-house online communities to verify our method and test the hypotheses. There are a considerable number of lurkers who have a strong and wide influence outside the online community. We conclude that such lurkers cannot be neglected in an evaluation of online communities within a company. We also discuss the possibility of online community management by focusing on not only posters but also lurkers who are indirect contributors to increasing the influence of an online community on its outside environment.
Design Patterns for Modulation in Digital Communication Systems
Authors: Eduardo B. Hernandez Pale, Liliana Díaz Olavarrieta
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The pattern concept has been a very useful toolboth for teaching and designing systems inarchitecture, software programming, management andin telecommunications. However, until now, no workhad been done in the field of digital communicationsystems design. This paper proposes a set of patternsfor digital modulation design and summarizes apioneering university degree thesis project on thistopic. First, we introduce the reader to the patternconcept. Then we give some motivation for the use ofpatterns, and finally the proposed patterns formodulation are briefly explained, and an applicationexample is given.
CodeX: An Approach for Debugging XSLT Transformations
Authors: Eric Bae, James Bailey
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

XML is now a dominant standard for storing and exchanging information. One very important activity is the transformation of XML documents into other formats, via the transformation language XSLT. XSLT provides a powerful way to perform document conversion and exchange, avoiding reliance on application speci.c solutions. However, XSLT is a complex language and the current level of support for debugging tools is poor. Many tools that do existare mainly an extension of conventional techniques for imperative programs and not well-suited to the task. In this paper, we present CodeX, a debugger for XSLT and proposethree debugging techniques which are particularly suited to the language We aim to offer XSLT users a tool which is beneficial in finding errors, as well as facilitating a better understanding of the XML transformation process.
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
Authors: N. N. Pisaruk
Venue: Discrete Applied Mathematics (2003)

We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard. The first combinatorial 2-approximation algorithm for this scheduling problem was developed by the author in 1992 (in fact, this algorithm solves a more general problem). Here we give an efficient implementation of this algorithm and show that its running time is O(nMF(n,m)), where n is the number of jobs, m is the number of arcs in the precedence relation graph, and MF(n,m) denotes the complexity of the maximal flow computation in a network with n nodes and m arcs. Thus, our algorithm is competitive to the best 2-approximation algorithms for this scheduling problem developed starting since 1997.
Interactive reach planning for animated characters using hardware acceleration
Authors: Ying Liu
Venue:  (2003)

We present real-time articulated arm reach planning algorithms for virtual human figures. Given a start configuration and a goal location, we compute a collision-free path for a seven degrees of freedom arm from the start to the goal. We require automatic reaches with natural human movements at interactive rates. Different from the existing configuration space methods, we plan arm movements directly using constrained search in a discretized 3D workspace and efficient collision detection techniques using available graphics hardware. At each step of the process, the end effector is moved to an unoccupied and adjacent cell in the discretized workspace. The search is guided by, but not limited to, the distance gradient to the goal; this makes the process more powerful than potential field methods and not prone to get stuck in local minima. Three novel but successively more effective efforts to solve the reach problem are presented. The first, 3-step planning, searches end effector paths in the workspace and computes arm configurations using inverse kinematics. While the planning can be accomplished interactively, the incompleteness induced by an analytic (single solution) inverse kinematics procedure (IKAN) makes the algorithm fail too frequently. The second algorithm, sequential planning, seeks to find paths in the 3D workspace for wrist, elbow and hand, respectively. Intersecting spherical ranges for arm segments and exploring more candidate configurations improve completeness. In computer animation, it is vitally important that the computed motion for animated characters look natural and realistic. One aspect of naturalness is that internal strength dictates human postures. Therefore, the third algorithm extends sequential planning by incorporating a human strength model in a hybrid of kinematic and biomechanical techniques. The algorithms allow real-time planning in both static and dynamic environments. Algorithm performance is roughly proportional to the complexity of the workspace. No preprocessing for configuration spaces is required. Examples are shown illustrating the competence of the planners at generating motion plans for a typical human arm model.
Improving Scheduling of Tasks in a Heterogeneous Environment
Authors: Rashmi Bajaj, Dharma P. Agrawal
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--Optimal scheduling of parallel tasks with some precedence relationship, onto a parallel machine is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, where the processors in the network may not be identical and take different amounts of time to execute the same task. This paper introduces a Task duplication-based scheduling Algorithm for Network of Heterogeneous systems (TANH), with complexity $\rm O(V^2)$, which provides optimal results for applications represented by Directed Acyclic Graphs (DAGs), provided a simple set of conditions on task computation and network communication time could be satisfied. The performance of the algorithm is illustrated by comparing the scheduling time with an existing ¿Best Imaginary Level scheduling (BIL)¿ scheme for heterogeneous systems. The scalability for a higher or lower number of processors, as per their availability is also discussed. This work is shown to provide substantial improvement over existing work on the Task Duplication-Based Scheduling Algorithm (TDS).