ppxscal/embedding_network huggingface dataset:
Iterative Solution Methods for Modeling Multiphase Flow in Porous Media Fully Implicitly
Authors: S. Lacroix, Yu. Vassilevski, J. Wheeler, M. Wheeler
Venue: SIAM Journal on Scientific Computing (2003)

We discuss several fully implicit techniques for solving the nonlinear algebraic system arising in an expanded mixed finite element or cell-centered finite difference discretization of two- and three-phase porous media flow. Every outer nonlinear Newton iteration requires solution of a nonsymmetric Jacobian linear system. Two major types of preconditioners, supercoarsening multigrid (SCMG) and two-stage, are developed for the GMRES iteration applied to the solution of the Jacobian system. The SCMG reduces the three-dimensional system to two dimensions using a vertical aggregation followed by a two-dimensional multigrid. The two-stage preconditioners are based on decoupling the system into a pressure and concentration equations. Several pressure preconditioners of different types are described. Extensive numerical results are presented using the integrated parallel reservoir simulator (IPARS) and indicate that these methods have low arithmetical complexity per iteration and good convergence rates.
The process of effective critiques
Authors: Jana Whittington
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Effective critiquing is a sound method for assessing, teaching and learning new technology. The processes and techniques that are critical to help students develop and evaluate their technical, aesthetic, written and verbal skills can be implemented at all levels of technical expertise and disciplines. Administering an effective critique does not begin at the completion of an assignment. It begins with the creation of the learning objectives and outcomes of a specific project.The author is drawing on industrial, art and technical educational experience to prepare projects and criteria for effective critiques. This paper will point out several different methods and approaches in preparing and conducting project critiques along with examples of how to use this approach to assess an assignment and overall course learning objectives.
On series-parallel extensions of uniform matroids
Authors: Brahim Chaourar, James Oxley
Venue: European Journal of Combinatorics (2003)

This paper gives an excluded-minor characterization of the class of matroids that are series-parallel extensions of uniform matroids.
TECNO-STREAMS: Tracking Evolving Clusters in Noisy Data Streams with a Scalable Immune System Learning Model
Authors: Olfa Nasraoui, Cesar Cardona Uribe, Carlos Rojas Coronel, Fabio Gonzalez
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Artificial Immune System (AIS) models hold many promises inthe field of unsupervised learning. However, existing models arenot scalable, which makes them of limited use in data mining. Wepropose a new AIS based clustering approach (TECNO-STREAMS)that addresses the weaknesses of current AIS models. Comparedto existing AIS based techniques, our approach exhibits superiorlearning abilities, while at the same time, requiring low memoryand computational costs. Like the natural immune system, thestrongest advantage of immune based learning compared to otherapproaches is expected to be its ease of adaptation to the dynamicenvironment that characterizes several applications, particularlyin mining data streams. We illustrate the ability of the proposedapproach in detecting clusters in noisy data sets, and in miningevolving user profiles from Web clickstream data in a single pass.TECNO-STREAMS adheres to all the requirements of clusteringdata streams: compactness of representation, fast incremental processingof new data points, and clear and fast identification of outliers.
Spatiotemporal interpolation methods in gis
Authors: Peter Revesz
Venue:  (2003)

In this dissertation, spatiotemporal interpolation of geographic data is considered. Two methods are discussed which are the reduction and the extension methods. The reduction method treats time as an independent dimension, whereas the extension method treats time equivalent to a spatial dimension. Both 2-D and 3-D shape functions are adopted, usually used in finite element methods, for the spatiotemporal interpolation of 2-D spatial 1-D temporal and 3-D spatial 1-D temporal data sets. Domains are divided into a finite number of sub-domains (such as triangles and tetrahedra) in which local shape functions are assumed. New 4-D shape functions that can be applied for each 4-D Delaunay Tessellation element are developed using the extension method for 3-D spatial 1-D temporal problems. The visualization of shape function interpolation results is also explained and illustrated. Using an actual real estate data set with house prices, we compare these methods with other spatiotemporal interpolation methods based on inverse distance weighting and kriging. We compare these methods with respect to interpolation accuracy, error-proneness to time aggregation, invariance to scaling on the coordinate axes, and the type of constraints used in the representation of the interpolated data. Our experimental results show that the extension method based on shape functions is the most accurate and the overall best spatiotemporal interpolation method. Constraint databases provide a general approach to express and solve constraint problems. We show that spatiotemporal interpolation data can be represented in constraint databases efficiently and accurately. The advantage of constraint databases is that many queries that could not be done in traditional GIS systems can now be easily expressed and evaluated in constraint database systems. Finally, the constraint database system MLPQ (Management of Linear Programming Queries) is used to animate and query some spatiotemporal data examples. A translation algorithm between ArcGIS shape files and MLPQ input data files is also discussed.
A scalable wide-issue clustered VLIW with a reconfigurable interconnect
Authors: Osvaldo Colavin, Davide Rizzo
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Clustered VLIW architectures have been widely adopted in modern embedded multimedia applications for their ability to exploit high degrees of ILP with reasonable trade-off in complexity and silicon costs. Studies have however shown limited performance scaling for wide-issue machines. In this paper we describe the architecture of a clustered VLIW with a runtime reconfigurable inter-cluster bus suitable to address such scalability problem. The architecture is aimed at kernel loops acceleration through a coprocessor approach and allows a customization of the interconnect between neighboring register files before each loop execution. We have adopted an inter-cluster communication mechanism based on a constant-complexity interconnect. The complexity and latency independent of the number of clusters preserve the scalability on issue-width. To handle the limited connectivity, the interconnection resources in the inter-cluster bus are exposed to the compiler, and scheduled like other resources with an adapted version of modulo scheduling. Other relevant features include the capability to define shifting queues in the register files, for a more effective software pipelining support. The addition of a limited amount of reconfigurability to the well established VLIW programming model results in low-overhead inter-cluster communications and a scalable ILP architecture. Simulation results show that we can achieve near linear scalability for certain classes of kernel loops.
Effectiveness of systems analysis and design education: an exploratory study
Authors: Rajiv Kohli, Jatinder N. D. Gupta
Venue: Advanced topics in end user computing (2003)

This paper reports the results of an exploratory study of student perceptions of the education and experiences of the Systems Analysis and Design (SA&D) course taught in the IS programs at academic institutions. An ex-ante and post hoc empirical study of student perceptions in the SA&D courses was conducted. The results indicate that after taking the SA&D course and working with a real-life project, students' perceptions improved for the applicability of structured methodologies across industries, the importance of computer programming in systems analysis and design process, and the role of advanced technologies in SA&D. Respondents also perceived that when working as groups, SA&D team members did not do their fair share of the work. However, the importance of user involvement was recognized.
Properties of ZrO2 dielectric layers grown by metalorganic molecular beam epitaxy
Authors: Jang-Hyuk Hong, Woo-Jong Choi, Jae-Min Myoung
Venue: Microelectronic Engineering (2003)

ZrO2 dielectric layers were grown on the p-type Si (100) by metalorganic molecular beam epitaxy (MOMBE). Zirconium t-butoxide, Zr(O-t-C4H9)4 was used as a Zr precursor because of its moderate vapor pressure. The properties of the layers were evaluated by X-ray photoelectron spectroscopy (XPS), atomic force microscopy (AFM), high resolution transmission electron microscopy (HRTEM), and capacitance-voltage (C-V) and current density-voltage (J-V) analyses. Two steps in the growth, granule formation and film growth, were considered from the relation between the growth rate and the growth time. The compositional analysis confirmed the stoichiometry of the layer and typical zirconium and oxygen spectra were observed in the XPS result. RMS and average roughnesses increased due to the crystallization of the grains after the annealing treatment. HRTEM image showed that the grown layer was polycrystalline, which was closely related to the degradation of the electrical properties. From the C-V and J-V analyses, dielectric constant of ZrO2 layer was calculated to be 16-17 and the current density was -3.8×10-3 A/cm2 at a gate voltage of -1.5 V.
Case-based evolutionary design
Authors: Mike Rosenman
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The paper provides a solution to the current problem of adaptation in case-based design. The aim of this project is to develop a case-based model of design, using an evolutionary approach, for the adaptation of previously stored design solutions. It is argued that such a knowledge-lean methodology is more general in its applicability than conventional case-based design. A prototypical example in the context of 2-D spatial design of houses is used to test the efficacy and efficiency of this approach.
List Total Colourings of Graphs
Authors: M. Juvan, B. Mohar, R. Škrekovski
Venue: Combinatorics, Probability and Computing (1998)

We study the concept of list total colourings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We also show that the total choice number of a graph of maximum degree 2 is equal to its total chromatic number.
Molecular computers: part 2
Authors: Michael Conrad
Venue: ACM SIGBIO Newsletter (1984)

Programmability, evolvability, and efficiency are tied together by a tradeoff principle which may explain the radically different computational capabilities of biological systems and digital computers.
Changing use patterns of print journals in the digital age: impacts of electronic equivalents on print chemistry journal use
Authors: K. T. L. Vaughan
Venue: Journal of the American Society for Information Science and Technology (2003)

Little data are available that can help librarians solve issues surrounding print versus online journals management, including ascertaining when print journals are no longer needed. This study examines the short-term effects of online availability on the use of print chemistry journals. The Duke University Chemistry Library gained access to Elsevier titles via ScienceDirect in February 2000. By comparing reshelving data for the print journals from 1999, 2000, and 2001, this study identifies the short-term changes in journals use that can be attributed to the introduction of ScienceDirect. In the first two years after ScienceDirect was introduced, use of print journals nearly halved. The diminished use of the print collection has important implications for collection management in sci-tech libraries.
Structural influences on global e-commerce activity
Authors: M. Lynne Markus, Christina Soh
Venue: Advanced topics in global information management (2003)

An important line of research on global information management examines the effects of national culture on information technology (IT) development, operations, management, and use. This chapter argues that global information management researchers should not lose sight of structural conditions related to business-to-business and business-to-consumer e-commerce activity. Structural conditions are physical, social, and economic arrangements that shape e-commerce business models and influence individual and organizational use of the Internet. Examples include geography (which affects the physical distribution of goods purchased online), space (which influences the choice of access technology for e-commerce), and financial infrastructure (which is related to credit card use). Structural conditions differ from country to country -- and even from location to location within country, but they are not necessarily related to dimensions of natural culture. Therefore, valid explanations of global differences in e-commerce activity require a careful assessment of relevant structural factors.
Convergence of the weak dual greedy algorithm in Lp-spaces
Authors: M. Ganichev, N. J. Kalton
Venue: Journal of Approximation Theory (2003)

We prove that the weak dual greedy algorithm converges in any subspace of a quotient of Lp when 1 < p < ∞.
Controlling the data space of tree structured computations
Authors: I. Gottlieb, B. Obrenić
Venue: Information and Computation (2003)

We study the problem of scheduling a parallel computation so as to minimize the maximum number of data items extant at any point in the execution. Computations are expressed as directed graphs, where nodes represent primitive operations and arcs represent data dependences. The result of an operation is extant after the operation executes and until all immediate successors have begun execution. Our goal is to schedule computations so as to minimize both the maximum space required for extant data and the overall completion time.The classical problem of multiprocessor scheduling with precedence constraints is a special case of our problem, obtained by disregarding the data-space constraint. This special case is NP-complete for general graphs; a time-optimal multiprocessor scheduling algorithm is known only for the class of arbitrary trees. For this same class of arbitrary trees we present a multiprocesssor scheduling algorithm where the completion time is optimal within a constant factor, while the data-space size exceeds the optimal by a factor not greater than the number of processors.For an arbitrary n-node precedence tree T of in-degree Δ, we present: (1) an algorithm for evaluating the lower bound on the size of data space required for executing T, regardless of the completion time or number of processors; (2) a proof that the lower bound of Part 1 may be as large as (Δ - 1) lg n but not larger; (3) a single-processor schedule that executes T in time that equals the optimal, while creating the data space of size equal to the lower bound of Part 1; (4) an ω-processor schedule that executes T in time not exceeding three times the optimal, while creating the data space of size that exceeds the lower bound of Part 1 by a factor not greater than ω. (5) a proof that for every number of processors ω and for every 0 > ε ≤ 1, there exist infinitely many trees such that every ω-processor schedule that executes any of these trees in time not exceeding (2 - ε) times the optimal requires a token space as large as that created by the schedule of Part 4, while the schedule of Part 4 executes every such tree in optimal time.The family of complete binary trees provides an example where our schedule achieves an exponential improvement in the size of the data space, compared to that of the classical time-optimal schedule.
A new modified Smith predictor design
Authors: Pauline Sourdille, Aidan O'Dwyer
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

A new modified Smith predictor structure is presented with its associated tuning rules.
Explaining binomial heaps
Authors: Ralf Hinze
Venue: Journal of Functional Programming (1999)

Functional programming languages are an excellent tool for teaching algorithms and data structures. This paper explains binomial heaps, a beautiful data structure for priority queues, using the functional programming language Haskell (Peterson and Hammond, 1997). We largely follow a deductive approach: using the metaphor of a tennis tournament we show that binomial heaps arise naturally through a number of logical steps. Haskell supports the deductive style of presentation very well: new types are introduced at ease, algorithms can be expressed clearly and succinctly, and Haskell's type classes allow to capture common algorithmic patterns. The paper aims at the level of an undergraduate student who has experience in reading and writing Haskell programs, and who is familiar with the concept of a priority queue.
Structure based methods for parallel pattern fault simulation in combinational circuits
Authors: Bernd Becker, Ralf Hahn, Rolf Krieger, Uwe Sparmann
Venue: Proceedings of the conference on European design automation (1991)

We present several methods which accelerate fault simulation for combinational circuits using parallel pattern evaluation. The methods are based on an extensive structure analysis of the considered circuit. On the one hand the developed methods aim at a reduction of fanout stems for which the fault simulation has to be performed and on the other hand at a reduction of gate evaluations during the fault simulation.Of course, all methods support the use of parallel pattern evaluation.
Using cursor prediction to smooth telepointer jitter
Authors: Carl Gutwin, Jeff Dyck, Jennifer Burkitt
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Telepointers are an important type of embodiment in real-time distributed groupware. Telepointers can increase the presence of remote participants and can provide considerable awareness information about people's locations and activities. However, the motion of a telepointer is often disrupted by network jitter. Although some strategies exist for dealing with jitter, none of these techniques are able to restore the immediacy and smoothness of a real cursor. In this paper we investigate the use of prediction - commonly used in networked simulations and games - to reduce the effects of jitter on telepointer motion. To determine whether prediction can be effective for improving telepointers, we carried out two experiments that tested the effects of different prediction schemes (some real and some artificial) on people's ability to interpret telepointer gestures. These studies show that although cursor prediction is still a difficult problem, there are both potential performance improvements, and definite preference advantages. Our studies suggest that telepointer prediction should be routinely used to increase the immediacy and naturalness of remote interaction, and suggest that prediction can also improve interpretation in certain situations.
A functions localized neural network with branch gates
Authors: Qingyu Xiong, Kotaro Hirasawa, Jinglu Hu, Junichi Murata
Venue: Neural Networks (2003)

In this paper, a functions localized network with branch gates (FLN-bg) is studied, which consists of a basic network and a branch gate network. The branch gate network is used to determine which intermediate nodes of the basic network should be connected to the output node with a gate coefficient ranging from 0 to 1. This determination will adjust the outputs of the intermediate nodes of the basic network depending on the values of the inputs of the network in order to realize a functions localized network. FLN-bg is applied to function approximation problems and a two-spiral problem. The simulation results show that FLN-bg exhibits better performance than conventional neural networks with comparable complexity.
Regressive Testing for System-on-Chip with Unknown-Good-Yield
Authors: N.-J. Park, B. Jin, K. M. George, N. Park, M. Choi
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents a testing method for electronic devices with no a-priori yield information.This problem is referred to as Unknown-Good-Yield (UKGY) problem. The UKGY problem ofSystems-on-Chip (SoC) is discussed in this paper as SoCs are in general built with embedded Intellectual Property (IP) Cores, each of which procured from IP providers with no information on Known-Good-Yield (KGY). In general, partial testing is a practical choice for assuring the yield of the product under the stringent time-to-market requirement in today's high density/complexity electronic devices such as SoC built with deep submicron or nano technology. Therefore, efficient and effective sampling technique is a key to the success of high confidence testing. An Experimental Characterization-based Testing (referred to as ET) method for SoC has been proposed prior to this work, in which a stratified sampling method was employed based on environmental-based characterization and experimental design technique to enhance the con.dence level of the estimation of yield. The proposed testing method, referred to as Regressive Testing (RegT), in this paper exploits another way around by using parameters (referred to as Assistant Variables (AV) free from UKGY that determines the criteria to sample and test SoCs, and employs the regression analysis method to evaluate the yield with regard to confidence interval. A numerical simulation is conducted to demonstrate the efficiency and effectiveness of the proposed RegT in comparison with generic random testing method.
Network management platform based on mobile agents
Authors: Rayan Stephan Pradeep Ray
Venue: International Journal of Network Management (2004)

Many of the modern network management solutions are based on commercially available management platforms. These platforms offer common management services, such as support for multiple-management protocols, alarm management, and event correlation. Most of these platforms are based on the traditional manager--agent model adopted in standard protocols, such as Internet SNMP. However, these platforms suffer from limitations imposed by the centralized, static, polling-based management model of SNMP, and the need for maintaining a central intelligence at the platform level. In view of the dynamic nature of evolving networks, future network management solutions need to be flexible, adaptable, and intelligent without increasing the burden on network resources. We have addressed this requirement with a new management platform architecture based on ontology-driven mobile agents. This paper presents the new management platform architecture, its prototype implementation, and the results of its evaluation.
MOF to EMF: there and back again
Authors: Anna Gerber, Kerry Raymond
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

The OMG's Meta-Object Facility (MOF) and the open source Eclipse Modelling Framework (EMF) are two popular meta-modelling frameworks, created to meet similar (but not identical) requirements. A means of translating MOF to EMF and vice versa is required to enable the two communities to leverage one another's specifications. This paper explains the relationship between the MOF and EMF meta-models and describes the XSLT-based translation tool, E-MORF, to convert between MOF and EMF.