ppxscal/embedding_network huggingface dataset:
Soft Computing for diagnostics in equipment service
Authors: Piero Bonissone, Kai Goebel
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

We present methods and tools from the Soft Computing (SC) domain, which is used within the diagnostics and prognostics framework to accommodate imprecision of real systems. SC is an association of computing methodologies that includes as its principal members fuzzy, neural, evolutionary, and probabilistic computing. These methodologies enable us to deal with imprecise, uncertain data and incomplete domain knowledge typically encountered in real-world applications. We outline the advantages and disadvantages of these methodologies and show how they can be combined to create synergistic hybrid SC systems. We conclude the paper with a description of successful SC case study applications to equipment diagnostics.
Comparison of preconditioners for collocation Chebyshev approximation of 2D and 3D generalized Stokes problem
Authors: Abdou Garba, Pierre Haldenwang
Venue: Journal of Computational Physics (2003)

The aim of the paper is concerned with the iterative resolution of the generalized Stokes problem in the framework of collocation Chebyshev approximation. More precisely, we analyze the performance of several preconditioners improving the classical Uzawa method. We first recall that the general Stokes problem (GSP) is an elementary substep of general interest for computing not only incompressible flows but also low Mach number flows. We then remark that performances of the classical Uzawa algorithm for solving the GSP are in fact closely related to the Reynolds number. In order to overcome this dependence, preconditioners are needed. The preconditioners we analyze here are recommended by Fourier analysis of the pressure operator. We additionally give interpretation of the preconditioners in terms of influence (or capacitance) techniques. We give a detailed analysis of the conditioning of the discrete collocation Chebyshev versions of the operators. Numerical comparison is conducted in 2D as well as in 3D rectangular geometry. Our comparative study shows that the fictitious wall permeability (FWP) method is the most efficient preconditioner. If complemented with a suitable pressure filtering, its efficiency still increases.
Acceleration Methods for Total Variation-Based Image Denoising
Authors: Qianshun Chang, I-Liang Chern
Venue: SIAM Journal on Scientific Computing (2003)

In this paper, we apply a fixed point method to solve the total variation-based image denoising problem. An algebraic multigrid method is used to solve the corresponding linear equations. Krylov subspace acceleration is adopted to improve convergence in the fixed point iteration. A good initial guess for this outer iteration at finest grid is obtained by combining fixed point iteration and geometric multigrid interpolation successively from the coarsest grid to the finest grid. Numerical experiments demonstrate that this method is efficient and robust even for images with large noise-to-signal ratios.
A generalization of a theorem of Bochner
Authors: Mourad E. H. Ismail
Venue: Journal of Computational and Applied Mathematics (2003)

We describe all polynomial solutions to the general second order operator equation in the Askey-Wilson operators, thus extending a theorem of Bochner from differential operators to Askey-Wilson divided difference operators.
Performance monitors for multi-programming systems
Authors: William A. Wulf
Venue: Proceedings of the second symposium on Operating systems principles (1969)

This paper proposes a scheme for improving the throughput of multi-programming systems. The basis of the proposal is the collection of a suitable set of measures of total system performance as well as corresponding per-process measures. Two types of control over system performances are suggested: (1) dynamic tuning of allocation policies to reflect the total system load, and (2) adjustment of the mix of processes competing for system resources in such a way as to keep the system within the range over which its allocation policies function properly.This work was supported in part by the Advanced Research Projects Agency at the Office of the Secretary of Defense (F 44620-67-C-0058) and is maintained by the Air Force Office of Scientific Research. Reproduction in whole or in part is permitted for any purpose of the United States Government.
High Security Smartcards
Authors: M. Renaudin, F. Bouesse, Ph. Proust, J. P. Tual, L. Sourgen, F. Germain
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

New consumer appliances such as PDA, Set Top Box, GSM/UMTS terminals enable an easy access to the internet and strongly contribute to the development of e-commerce and m-commerce services. Tens of billion payments are made using cards today, and this is expected to grow in a near future. Smartcard platforms will enable operators and service providers to design and deploy new e- and m-commerce services. This development can onlybe achieved if a high level of security is guaranteed for the transactions and the customer's information.In this context, smartcard design is very challenging in order to provide the flexibility and the powerfulness required by the applications and services, while at the same time guaranteeing the security of the transactions and the customer's privacy. The goal of the session is to introduce this context and highlights the main challenges the smartcard designers/manufacturers have to face.
Computational science and engineering: a new master's program at the Technische Universit&#x00E4;t M&#x00FC;nchen
Authors: Hans-Joachim Bungartz
Venue: Future Generation Computer Systems (2003)

In the winter semester of 2001/2002, the Technische Universität München (TUM) started its new master's program computational science and engineering (CSE) as a joint initiative of seven faculties. It is the objective of this contribution to outline the underlying ideas and concepts and their curricular implementation as well as to emphasize some features that are probably non-standard in other comparable programs.
Using Empirical Methods for Evaluating Expression and Content Similarity
Authors: Ozlem Uzuner, Randall Davis, Boris Katz
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Despite lack of any significant quantifiable similarities between documents, people canintuitively compare documents and evaluate their similarity. To understand how people evaluate text similarity, we queried subjects about the level of content similarity and expression similarity of pairs of documents. Using these judgments on similarity as ground truth, we automated evaluation of similarity.Our main application for automatic evaluation of text similarity is copyright infringement detection. United States copyright law protects expression but not any underlying facts and ideas being expressed. Therefore, we focus on recognizing similarity of expression. We envision a scenario where authors present the system with a document and the system replies with documents that share the same expressive characteristics.We hypothesize that, since content and expression are not independent of each other, accurate recognition of expression similarity will also help recognition of content similarity.The experiments presented in this paper evaluate two sets of features, unigrams and style features, with respect to their ability to recognize similarities in content and expression of documents using the ground truth obtained from user experiments. Our results show that, on our data set of short news articles, stylistic features predict similarity of expression more accurately than tf*idf weighted unigrams. While unigrams can identify high-level content similarities between documents about the same people, topic and events, they are less effective than style features in evaluating finer grained content similarities.
Task-level timing models for guaranteed performance in multiprocessor networks-on-chip
Authors: P. Poplavko, T. Basten, M. Bekooij, J. van Meerbergen, B. Mesman
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

We consider a dynamic application running on a multiprocessor network-on-chip as a set of independent jobs, each job possibly running on multiple processors. To provide guaranteed quality and performance, the scheduling of jobs, jobs themselves and the hardware must be amenable to timing analysis. For a certain class of applications and multiprocessor architectures, we propose exact timing models that effectively co-model both the computation and communication of a job. The models are based on interprocessor communication (IPC) graphs [4]. Our main contribution is a precise model of network-on-chip communication, including buffer models. We use a JPEG-decoder job as an example to demonstrate that our models can be used in practice to derive upper bounds on the job execution time and to reason about optimal buffer sizes.
Polynomial harmonic GMDH learning networks for time series modeling
Authors: Nikolay Y. Nikolaev, Hitoshi Iba
Venue: Neural Networks (2003)

This paper presents a constructive approach to neural network modeling of polynomial harmonic functions. This is an approach to growing higher-order networks like these build by the multilayer GMDH algorithm using activation polynomials. Two contributions for enhancement of the neural network learning are offered: (1) extending the expressive power of the network representation with another compositional scheme for combining polynomial terms and harmonics obtained analytically from the data; (2) space improving the higher-order network performance with a backpropagation algorithm for further gradient descent learning of the weights, initialized by least squares fitting during the growing phase. Empirical results show that the polynomial harmonic version phGMDH outperforms the GMDH, a Neurofuzzy GMDH and traditional MLP neural networks on time series modeling tasks. Applying next backpropagation training helps to achieve superior polynomial network performances.
Teaching programming to liberal arts students: a narrative media approach
Authors: Peter Bøgh Andersen, Jens Bennedsen, Steffen Brandorff, Michael E. Caspersen, Jesper Mosegaard
Venue: ACM SIGCSE Bulletin (2003)

In this paper we present a new learning environment to be used in an introductory programming course for students that are non-majors in computer science, more precisely for multimedia students with a liberal arts background.Media-oriented programming adds new requirements to the craft of programming (e.g. aesthetic and communicative).We argue that multimedia students with a liberal arts background need programming competences because programmability is the defining characteristic of the computer medium. We compare programming with the creation of traditional media products and identify two important differences which give rise to extra competences needed by multimedia designers as opposed to traditional media product designers. We analyze the development process of multimedia products in order to incorporate this in the learning process, and based on this we present our vision for a new learning environment for an introductory programming course for multimedia students.We have designed a learning environment called Lingoland with the new skills of media programming in mind that hopefully can help alleviate the problems we have experienced in teaching programming to liberal arts students.
Gross substitution, discrete convexity, and submodularity
Authors: V. I. Danilov, G. A. Koshevoy, C. Lang
Venue: Discrete Applied Mathematics (2003)

We consider a class of functions satisfying the gross-substitutes property (GS-functions). We show that GS-functions are concave functions, whose parquets are constituted by quasi-polymatroids. The class of conjugate functions to GS-functions turns out to be the class of polyhedral supermodular functions. The class of polyhedral GS-functions is a proper subclass of the class of polyhedral submodular functions. PM-functions, concave functions whose parquets are constituted by g-polymatroids, form a proper subclass of the class of GS-functions. We provide an additional characterization of PM-functions.
On the application of UML to designing on-line business model
Authors: Yongtae Park, Seonwoo Kim
Venue: UML and the unified process (2003)

The applicability of UML is not restricted to software development, but can be extended to other process modeling tasks. This chapter introduces a framework for designing an inter-firm, on-line business model using UML. The framework comprises such principal elements as value, business players, and relationship among players, with each specified in terms of representative attributes and related notations. The business model is then visualized by value diagram and structure diagram. An illustrative case is employed to show how the proposed framework is applied. By nature, the current research is exploratory; therefore, for the purpose of illustration, it deals with a rather simple business form. As a result, extension and elaboration of the framework may be required to accommodate the complexity and diversity of a real world business.
Road lane segmentation using dynamic programming for active safety vehicles
Authors: Dong-Joong Kang, Mun-Ho Jung
Venue: Pattern Recognition Letters (2003)

Vision-based systems for finding road lanes have to operate robustly under a wide variety of environmental conditions including large amount of scene clutters. This paper presents a method to find the lane boundaries by combining a local line extraction method and dynamic programming. The line extractor obtains an initial position of road lane boundaries from the noisy edge fragments. Then, dynamic programming improves the initial approximation to an accurate configuration of lane boundaries. Input image frame is divided into sub-regions along the vertical direction. The local line extractor extracts candidate lines of road lanes in the sub-region. Most prominent lines are found among candidate lines by dynamic programming that minimizes the functional which measures the deviation from a virtual straight line. The search framework based on DP method reduces computational cost. Experimental results using images of real road scenes demonstrate the feasibility of the proposed algorithm.
An improvement on binary-swap compositing for sort-last parallel rendering
Authors: Akira Takeuchi, Fumihiko Ino, Kenichi Hagihara
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Sort-last parallel rendering is a good rendering scheme on distributed memory multiprocessors. This paper presents an improvement on the binary-swap (BS) method, which is an efficient image compositing algorithm for sort-last parallel rendering. Our compositing method uses three acceleration techniques, compared to the original BS method. Through the use of the three techniques, our method balances the compositing load among processors, exploits more sparsity of the image, and reduces the cost of communication. We also show some experimental results on a PC cluster. The results show that our method completes the image compositing faster than the original BS method, and its speedup to the original increases with the number of processors.
Bulk data transfer forecasts and the implications to grid scheduling
Authors: Tobin Maginnis
Venue:  (2003)

Increasingly, scientific discovery is driven by computationally intensive analyses of massive data-collections stored in a distributed fashion. Technology trends indicate that the rates at which networks and storage elements double in capacity or halve in price are approximately 8 and 12 months, respectively. This promising recent trend is propelling several scientific research groups to undertake projects never before foreseen&mdash;notable examples being high-energy physics experiments (CMS), studies of gravitational waves (LIGO), digital sky surveys (SDSS), SETI@Home, Folding@Home, and Evolution@Home, etc. The common denominator in all of these projects is the propensity to use distributed data stores, which has thrust to the forefront the need to efficiently manage data access in massively distributed communities. Data Grids provide an efficient environment to handle massively distributed data by building federations of high-end storage systems, providing secure access to remote resources, enabling resource discovery, data movement, and the like. This work addresses issues involved in the efficient selection and access of replicated data in Grid environments in the context of the Globus Toolkit&trade;, building middleware that (1) selects datasets in highly replicated environments, enabling efficient scheduling of data transfer requests; (2) predicts transfer times of bulk wide-area data transfers using extensive statistical analysis; and (3) co-allocates bulk data transfer requests, enabling parallel downloads from mirrored sites. These efforts have demonstrated a decentralized data scheduling architecture, a set of forecasting tools that predict bandwidth availability within 15 percent error and co-allocation architecture, and heuristics that expedites data downloads by 100 percent.
We can see you: a study of communities' invisible people through reachout
Authors: Vladimir Soroka, Michal Jacovi, Sigalit Ur
Venue: Communities and Technologies (2003)

Virtual communities are a great tool, both at home and in the workplace. They help in finding new friends and solving complicated problems by creating a virtual family or a giant group-mind. However, building a virtual community is not a trivial task. Many problems need to be addressed for a new community to be successful. While many of these problems are features of the medium, participants themselves are still the major part of the equation. Understanding the behavioral patterns of virtual community members is crucial for attracting participants and facilitating active participation. In this paper, we describe our findings from analyzing more than a year of activities of a workplace community. Our community used ReachOut, a tool developed in our group to support semi-persistent collaboration and community building. Throughout the year, all users' activities were logged, providing us with very detailed information. Not only do we know of people's postings to the community, but we can also track lurking behavior that is usually hidden. This allows us to check several hypotheses about non-active participants' behavior and propose some directions to increase active participation in virtual communities.
Proactive-WTCP: an End-to-End Mechanism to Improve TCP Performance over Wireless Links
Authors: Yizhou Li, Lillykutty Jacob
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Standard TCP suffers in the wireless environment dueto channel errors and frequent temporary disconnectionsof the wireless link. To solve both problems, we proposean end-to-end scheme, Proactive-WTCP, in this paper. Itonly modifies the mobile end. Link layer retransmissionscheme is used to deal with the wireless packet corruption.Mobile host withholds the duplicate acknowledgementsfor a dynamically calculated period in order to allow linklayer recovery. Mobile host deals with the temporarydisconnections by forcing the TCP sender into the persistmode before disconnection. Acknowledgements sent uponreconnection makes TCP sender exit the persist mode andresume the transmission.We evaluate Proactive-WTCP in wireless LAN andGPRS network scenarios using throughput and transferdelay as the performance metrics for comparison. Thesimulation results show the significant improvements overTCP New Reno and Snoop with multicasting techniques.
The automatic video editor
Authors: Sam Yip, Eugenia Leu, Hunter Howe
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

More and more home videos are being produced with the increasing popularity of digital video camcorders. Yet the resulting home videos tend to be very long and boring to watch. The precious memories within those videos are ultimately lost. The problem is that the average home videographer does not have the time, or the editing skills to edit their home videos. It is a shame to let all those precious moments go to waste.There are editing software in the market that allow the user to edit their own home videos. For example, Apple's iMovie [1], Microsoft's MovieMaker [2], and the Hitchcock editing system [3]. But they still demand time, skill and effort from the user.With the above issue in mind, we developed the Automatic Video Editor, an application that analyzes a home video and edit it automatically into a condensed and interesting mini-movie.In our video, we will first show a clip of an unedited home video. Afterwards, we will show the output video created by our Automatic Video Editor.
Relational subscription middleware for Internet-scale publish-subscribe
Authors: Yuhui Jin, Rob Strom
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

We present a design of a distributed publish-subscribe system that extends the functionality of messaging middleware with "relational subscriptions", to support timely updates to state derived from published messages while preserving high throughput, scalability, and reliability.Critical to our design is our service guarantee of "eventual correctness". Eventual correctness is a weaker guarantee than the ACID properties of conventional databases, yet is useful enough to deliver state that is "just consistent enough".A key component of our design is a monotonic type system. All states delivered to clients represent facts that are permanently true, that may be refined by future updates, but will never become false. The monotonic type system is used both to formalize eventual correctness, and as a basis for our implementation, which generalizes the "Guaranteed Delivery" protocol previously implemented in the Gryphon system.We discuss: (1) our monotonic type system and relational subscription language; (2) eventual correctness; (3) the architecture of our implementation; (4) potential optimizations that form a basis for future studies.
Classification of ad-hoc multi-lateral collaborations based on local workflow models
Authors: Andreas Wombacher, Bendick Mahleko, Thomas Risse
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Establishing multi-lateral collaborations based on local workflows without having a global workflow is complicated, because the set of requirements used for the searching and matchmaking of trading partners is underspecified. The issue is to consider inter-dependencies of trading partners within a local workflow on the one hand side and between services on the other hand side. Within this paper, we suggest to develop an abstract model for establishing multi-lateral collaborations and propose a classification schema based on this model. The classification later on can be used to focus on particular aspects of the problem space and to develop solutions for different clusters within the problem domain.