ppxscal/embedding_network huggingface dataset:
Simulation of a cellular landslide model with CAMELOT on high performance computers
Authors: Giuseppe Dattilo, Giandomenico Spezzano
Venue: Parallel Computing (2003)

Landslides are natural disasters which can cause serious damages in terms of lives lost, homes destroyed, economies disrupted. By understanding how and where these natural events occur, we can respond effectively when disasters strike. The simulation of landslide hazards is particularly relevant for the prevention of natural disasters, since it enables to compute risk maps and helps to design protection works. This paper presents a parallel simulator developed by a problem-solving environment, called Cellular Automata environMent for systEms modeLing Open Technology (CAMELOT), that handles debris/mud-flows. It allows interactive simulation and steering of parallel cellular computations. CAMELOT is a simulation environment that uses the cellular automata formalism to model and simulate dynamic complex phenomena on parallel machines. It combines simulation, visualization, control and parallel processing into one tool which allows to interactively explore a simulation, visualize the state of the computation as it progresses and change parameters, resolution or representation on the fly. In the paper, we give an overview of the CAMELOT system and show that the dynamics of debris/mud-flows can be simulated using a cellular automaton landslide model. The quality of the reproduced shape of the landslide demonstrates substantial agreement with the real event. Moreover, an evaluation of the performances of the simulator on a Linux Beowulf cluster is presented.
How to manage your software product life cycle with MAUI
Authors: Luigi Suardi
Venue: Communications of the ACM (2004)

MAUI monitors multiple software engineering metrics and milestones to analyze a software product's development life cycle in real time.
An ILP Formulation for System Level Throughput and Power Optimization in Multiprocessor SoC Architectures
Authors: Krishnan Srinivasan, Karam S. Chatha
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

System-level low power scheduling techniques are requiredfor optimizing th performance and power of embeddedapplications that are mapped to multiprocessorSystem-on-Chip (SoC) architectures.In this paper, wepresent an integer linear programming (ILP) formulationthat combines loop transformations (pipelining andunrolling) and system-level low power optimization techniques(dynamic voltage scaling (DVS) and power management(DPM)) to minimize the power consumption,while satisfying the period and deadline constraints ofthe application.We also present three modifications thatrelax one or more constraints in the optimal formulationin order to obtain smaller run times.We presentexperimental analysis by applying the formulations onan MPEG decoder algorithm.All results are comparedagainst two existing techniques.Our formulations resultin large system-level power reductions (max: 48.2%,min: 15.92%, avg: 31.9%).The modified ILP formulationsresult in exponential decrease in runtimes, and acorresponding linear degradation in the result quality.
Ramsey Theory and Sequences of Random Variables
Authors: William T. Trotter, Peter Winkler
Venue: Combinatorics, Probability and Computing (1998)

We consider probability spaces which contain a family {EA&ratio;A&sube;{1, 2, &hellip;, n}, &#x2223;A&#x2223;=k} of events indexed by the k-element subsets of {1, 2, &hellip;, n}. A pair (A, B) of k-element subsets of {1, 2, &hellip;, n} is called a shift pair if the largest k&minus;1 elements of A coincide with the smallest k&minus;1 elements of B. For a shift pair (A, B), Pr[AB&macr;] is the probability that event EA is true and EB is false. We investigate how large the minimum value of Pr[AB&macr;], taken over all shift pairs, can be. As n&rarr;&infin;, this value converges to a number &lambda;k, with &frac12;&minus;1&#x002F;2k+2&le;&lambda;k&le; &frac12;&minus;1&#x002F;4k+2. We show that &lambda;k is a strictly increasing function of k, with &lambda;1=&frac14; and &lambda;2=1&#x002F;3.For k=1, our results have the following natural interpretation. If a fair coin is tossed repeatedly, and event Ei is true when the ith toss is heads, then for all i and j with i<j, Pr[Ei &Emacr;j]=&frac14;. Furthermore, as we show in this paper, for any ε>0, there is an n such that for any sequence E1, E2, &hellip;, En of events in an arbitrary probability space, there are indices i<j with Pr[Ei &Emacr;j]<&frac14;+ε. The results and techniques we develop in this research, together with further applications of Ramsey theory, are then used to show that the supremum of fractional dimensions of interval orders is exactly 4, answering a question of Brightwell and Scheinerman.Generalizing the &frac14;+ε result to random variables X1, X2, &hellip;, Xn with values in an m-element set, we obtain a finite version of de Finetti's theorem without the exchangeability hypothesis: for any fixed m, k and ε, every sufficiently long sequence of such random variables has a length-k subsequence at variation distance less than ε from an i.i.d. mix.
Group unified histories an instrument for productive unconstrained co-browsing
Authors: Maria Aneiros, Vladimir Estivill-Castro, Chengzheng Sun
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

The most common task being performed on the World Wide Web, namely exploring its contents remains an individual rather than a cooperative, shared or partnered activity. We propose that the existing model of collaborative browsing, namely master/slave, is too restrictive. Instead, we introduce group unified histories to provide unconstrained cooperative browsing. Our approach is founded on a persistent shared history object which is replicated for each user and totally configurable. In order for cooperation to succeed users are updated of changes taking place and shown the history of documents within the context of the group. Replication means that consistency needs to be maintained. We show that unconstrained cooperative browsing is a subset of collaborative editing, and using the consistency model of real-time collaborative editors achieves consistency and provides awareness in group unified histories.
Confidence-based dynamic ensemble for image annotation and semantics discovery
Authors: Beitao Li, Kingshy Goh
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Providing accurate and scalable solutions to map low-level perceptual features to high-level semantics is critical for multimedia information organization and retrieval. In this paper, we propose a confidence-based dynamic ensemble (CDE) to overcome the shortcomings of the traditional static classifiers. In contrast to the traditional models, CDE can make dynamic adjustments to accommodate new semantics, to assist the discovery of useful low-level features, and to improve class-prediction accuracy. We depict two key components of CDE: a multi-level function that asserts class-prediction confidence, and the dynamic ensemble method based upon the confidence function. Through theoretical analysis and empirical study, we demonstrate that CDE is effective in annotating large-scale, real-world image datasets.
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
Authors: Tarek F. Abdelzaher, Vivek Sharma, Chenyang Lu
Venue: IEEE Transactions on Computers (2004)

Abstract--Real-time scheduling theory offers constant-time schedulability tests for periodic and sporadic tasks based on utilization bounds. Unfortunately, the periodicity or the minimal interarrival-time assumptions underlying these bounds make them inapplicable to a vast range of aperiodic workloads such as those seen by network routers, Web servers, and event-driven systems. This paper makes several important contributions toward real-time scheduling theory and schedulability analysis. We derive the first known bound for schedulability of aperiodic tasks. The bound is based on a utilization-like metric we call synthetic utilization, which allows implementing constant-time schedulability tests at admission control time. We prove that the synthetic utilization bound for deadline-monotonic scheduling of aperiodic tasks is {\frac 1 {1 + \sqrt {1/2}}}. We also show that no other time-independent scheduling policy can have a higher schedulability bound. Similarly, we show that EDF has a bound of 1 and that no dynamic-priority policy has a higher bound. We assess the performance of the derived bound and conclude that it is very efficient in hit-ratio maximization.
High-Level System Modeling and Architecture Exploration with SystemC on a Network SoC: S3C2510 Case Study
Authors: Hye-On Jang, Minsoo Kang, Myeong-jin Lee, Kwanyeob Chae, Kookpyo Lee, Kyuhyun Shim
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a high-level design methodology applied on a Network SoC using SystemC. The topic will emphasize on high-level design approach for intensive architecture exploration and verifying cycle accurate SystemC models comparative to real Verilog RTL models.Unlike many high-level designs, we started the project with working Verilog RTL models in hands, which we later compared our SystemC models to. Moreover, we were able to use the on-chip test board performance simulation data to verify our SystemC-based platform.This paper illustrates that in high-level design, we could have the same accuracy as RTL models but achieve over one hundred times faster simulation speed than that of RTL's. The main topic of the paper will be on architecture exploration in search of performance degradation in source.
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
Authors: Dimitris Bertsimas, Ramazan Demir
Venue: Management Science (2002)

We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b)using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a)the new heuristic produces high quality solutions fast and robustly, (b)state of the art commercial packages like CPLEX require significantly larger computational time to achieve the same quality of solutions, (c) the ADP approach using the new heuristic competes successfully with alternative heuristic methods such as genetic algorithms, (d)the ADP approach based on parametric and nonparametric approximations, while producing reasonable solutions, is not competitive. Overall, this research illustrates that the base-heuristic approach is a promising computational approach for MKPs worthy of further investigation.
Constructing Composite Field Representations for Efficient Conversion
Authors: Berk Sunar, Erkay Savas, Çetin K. Koç
Venue: IEEE Transactions on Computers (2003)

This paper describes a method of construction of a composite field representation from a given binary field representation. We derive the conversion (change of basis) matrix. The special case of when the degree of the ground field is relatively prime to the extension degree, where the irreducible polynomial generating the composite field has its coefficients from the binary prime field rather than the ground field, is also treated. Furthermore, certain generalizations of the proposed construction method, e.g., the use of nonprimitive elements and the construction of composite fields with special irreducible polynomials, are also discussed. Finally, we give storage-efficient conversion algorithms between the binary and composite fields when the degree of the ground field is relatively prime to the extension degree.
An incremental functional simulator implemented on a network of transputers
Authors: Keith Dimond, Samir Hassan
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the organisation of a concurrent functional simulator employing transputers which gives considerably improved performance over conventional simulators. The parallel organisation allows a novel feature, incremental simulation, to be provided which allows the simulator to respond very quickly to design changes thereby allowing the design to proceed with the minimum of delay. The paper describes how the incremental facility is capable of being used to provide a very powerful analysis tool for system operation.
T-Trees, Vertical Partitioning and Distributed Association Rule Mining
Authors: Frans Coenen, Paul Leng, Shakil Ahmed
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper we consider a technique (DATA-VP) fordistributed (and parallel) Association Rule Mining thatmakes use of a vertical partitioning technique to distributethe input data amongst processors. The proposed verticalpartitioning is facilitated by a novel compressed set enumerationtree data structure (the T-tree), and an associatedmining algorithm (Apriori-T), that allows for computationallyeffective distributed/parallel ARM when compared withexisting approaches.
Twice-layered neural network self-organization for interpolation problems of artificial intelligence solution in the case of complete absence of information about small part of input variables
Authors: A. G. Ivakhnenko, G. A. Ivakhnenko, E. A. Savchenko
Venue: Systems Analysis Modelling Simulation (2003)

Method of diabetic home monitoring data for forecast is developed. Sloppy records with many breaks and even with the absent essential variables can be transformed into single-moment data sample that is used for twice-multilayered neural network self-organization. Filtration ability of neural network compensates inaccuracy of input data sample, and in the result rather accurate forecast of diabetic illness can be received at any moment of monitoring.
Author cocitation analysis and Pearson's r
Authors: Howard D. White
Venue: Journal of the American Society for Information Science and Technology (2003)

In their article "Requirements for a cocitation similarity measure, with special reference to Pearson's correlation coefficient," Ahlgren, Jarneving, and Rousseau fault traditional author cocitation analysis (ACA) for using Pearson's r as a measure of similarity between authors because it fails two tests of stability of measurement. The instabilities arise when rs are recalculated after a first coherent group of authors has been augmented by a second coherent group with whom the first has little or no cocitation. However, AJ&R neither cluster nor map, their data to demonstrate how fluctuations in rs will mislead the analyst, and the problem they pose is remote from both theory and practice in traditional ACA. By entering their own rs into multidimensional scaling and clustering routines, I show that, despite r's fluctuations, clusters based on it are much the same for the combined groups as for the separate groups. The combined groups when mapped appear as polarized clumps of points in two-dimensional space, confirming that differences between the groups have become much more important than differences within the groups--an accurate portrayal of what has happened to the data. Moreover, r produces clusters and maps very like those based on other coefficients that AJ&R mention as possible replacements, such as a cosine similarity measure or a chi square dissimilarity measure. Thus, r performs well enough for the purposes of ACA. Accordingly, I argue that qualitative information revealing why authors are cocited is more important than the cautions proposed in the AJ&R critique. I include notes on topics such as handling the diagonal in author cocitation matrices, lognormalizing data, and testing r for significance.
Why to incorporate a data definition language into a CAD frameworks extension language
Authors: Klaus Gröning, Walter Heijenga
Venue: Proceedings of the conference on European design automation (1991)

This paper takes part in the discussion on extension languages for CAD frameworks. We show that the incorporation of a Data Definition Language (DDL) not only makes sense but is a must for a serious extension language, if it intends to meet all requirements that occur in CAD frameworks. To illustrate this approach we introduce TIDL (Tool Integration Description Language), a representative for an extension language with an incorparted DDL.
Three-Dimensional Feedforward Neural Networks and Their Realization by Nano-Devices
Authors: Vlad P. Shmerko, Svetlana N. Yanushkevich
Venue: Artificial Intelligence Review (2003)

The three-dimensional (3D) model of a feedforward neural network (NN) based on so called N-hypercube topology is proposed. The N-hypercube is different from the classical hypercube used in communication theory, and in Boolean algebra. This new structure has been created based on a novel algorithm for embedding a binary decision tree and binary decision diagram into a N-hypercube. It is shown that N-hypercube topology is a reasonable solution to implement NN of threshold gates, in particular, on the single-electron devices. The 3D design methodology of feedforward NN is oriented to technology mapping to nanodevices. Results of extensive experimental study of feedforward networks consisting of over 3500 N-hypercubes are presented.
Best ellipsoidal relaxation to solve a nonconvex problem
Authors: Souad El Bernoussi
Venue: Journal of Computational and Applied Mathematics (2004)

We present a new ellipsoidal relaxation of 0-1 quadratic optimization problems. The relaxation and the dual problem are derived. Both these problems are strictly feasible; so strong duality holds, and they can be solved numerically using primal-dual interior-point methods.Numerical results are presented which indicate that the described relaxation is efficient.
Generalized Column Generation for Linear Programming
Authors: Osman Oguz
Venue: Management Science (2002)

Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows that, even if the number of variables is low enough for explicit inclusion in the model with the available technology, it may still be more efficient to resort to column generation for some class of problems.
Customer Knowledge Management -- Improving Performance of Customer Relationship Management with Knowledge Management
Authors: Adrian Bueren, Ragnar Schierholz, Lutz Kolbe, Walter Brenner
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

In this paper, we will illustrate the use of modern information technology to provide knowledge support to CRM processes. This knowledge support allows for performance enhancement in customer oriented business processes. We will base our reasoning on an integrated Customer Knowledge Management process model, which identifies six CRM sub-processes and four aspects of Knowledge Management. This integrated model aims at achieving knowledge transparency, knowledge dissemination, knowledge development and knowledge efficiency. The application of the four aspects content, competence, community and composition in specific CRM sub-processes will be demonstrated in several action research cases. These cases were implemented in European companies in the financial services sector and concern the support of customer-facing processes across all channels. They validate the proposed architecture while indicating critical success factors for a successful implementation of Customer Knowledge Management.
Constructive characterizations for packing and covering with trees
Authors: András Frank, László Szegö
Venue: Discrete Applied Mathematics (2003)

We give a constructive characterization of undirected graphs which contain k spanning trees after adding any new edge. This is a generalization of a theorem of Henneberg and Laman who gave the characterization for k = 2. We also give a constructive characterization of graphs which have k edge-disjoint spanning trees after deleting any edge of them.
A distributed engineering database management system for IC design
Authors: Wanlin Cao, Y. Edmund Lien, Yuane Qiu, Li Shao
Venue: Proceedings of the conference on European design automation (1991)

We describe a distributed engineering database subsystem (DDB) which is an integral part of the framework in the PANDA IC-CAD system. DDB provides a simple but efficient method for organizing the IC design data in a distributed environment. With version management and concurrency control services, DDB supports the iterative, tentative and collaborative nature of the design process. A database schema based on the concept of object and how it is used as the foundation for tool integration are also discussed.
Adaptive hybrid learning for neural networks
Authors: Rob Smithies, Said Salhi, Nat Queen
Venue: Neural Computation (2004)

A robust locally adaptive learning algorithm is developed via two enhancements of the Resilient Propagation (RPROP) method. Remaining drawbacks of the gradient-based approach are addressed by hybridization with gradient-independent Local Search. Finally, a global optimization method based on recursion of the hybrid is constructed, making use of tabu neighborhoods to accelerate the search for minima through diversification. Enhanced RPROP is shown to be faster and more accurate than the standard RPROP in solving classification tasks based on natural data sets taken from the UCI repository of machine learning databases. Furthermore, the use of Local Search is shown to improve Enhanced RPROP by solving the same classification tasks as part of the global optimization method.
TDL: a hardware description language for retargetable postpass optimizations and analyses
Authors: Daniel Kästner
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

The hardware description language TDL has been designed with the goal to generate machine-dependent postpass optimizers and analyzers from a concise specification of the target processor. TDL is assembly-oriented and provides a generic modeling of irregular hard-ware constraints that are typical for many embedded processors. The generic modeling supports graph-based and search-based optimization algorithms. An important design goal of TDL was to achieve extendibility, so that TDL can be easily integrated in different target applications. TDL is at the base of the PROPAN system that has been developed as a retargetable framework for high-quality code optimizations at assembly level. For two contemporary microprocessors, the Analog Devices SHARC 2106x, and the Philips TriMedia TM1000, significant improvements of the code produced by production-quality compilers could be achieved with short retargeting time. TDL has also been used for implementing postpass optimizations for the Infineon C16x/ST10 processor that are part of a commercial postpass optimizer. TDL specifications are concise and can be produced in short time.
Survey research, focus groups, and information technology in research and practice
Authors: Michael L. Vasu, Ellen Storey Vasu
Venue: Public information technology: policy and management issues (2003)

The integration of computing into survey research and focus groups in research and practice in public administration and related fields is the focus of this chapter. Coverage applies to other social science disciplines as well. This chapter reviews uses of computers in computer-assisted information collection (CASIC), computer-assisted telephone interviewing (CATI), computer-assisted personal interviewing (CAPI), and transferring survey research methods onto the Web. A second portion of the chapter gives special attention to continuous audience response technology (CART). An example of a citizen survey focused on growth issues combined with a focus group dealing with the same topic in Cary, North Carolina, is also discussed.