ppxscal/embedding_network huggingface dataset:
Supportive role of the simulation in the process of ship engine crankcase production process of reengineering (case study)
Authors: Pawel Pawlewski, Paulina Golinska, Marek Fertsch, Jesus A. Trujillo, Zbigniew J. Pasek
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The following paper presents the results of a case study conducted in a company producing engines for ships. The scope of the research enhances the elaboration of the method of reengineering the production process with the support of simulation. Authors present the background of the research including the comparative analysis of five different reengineering methodologies. On analysis, the conclusion is defined that there is a gap in reengineering methodologies since they do not account for industry-based requirements for simulation. To fulfill this gap the Petri nets application for simulation was proposed. Authors discuss the most distinctive elements of a Petri net and define the methodology of manufacturing processes modeling. The obtained output was not sufficient to make a final decision about the real reengineering process. Therefore, an additional analysis with Rapid RE (Rapid Reengineering) methodology was performed. The proposal of the potential hybrid solution combining the advantages of both methods, i.e. Petri Net and Rapid Re, is presented.
A Parallel Implementation of the Trace Minimization Eigensolver
Authors: Eloy Romero, Jose E. Roman
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

In this paper we describe a parallel implementation of the trace minimization method for symmetric generalized eigenvalue problems proposed by Sameh and Wisniewski. The implementation includes several techniques proposed in a later article of Sameh, such as multishifting, preconditioning and adaptive inner solver termination, which accelerate the method and make it much more robust. A Davidson-type variant of the algorithm has been also considered. The different methods are analyzed in terms of sequential and parallel efficiency.
Cultural differences in software engineering
Authors: Lavanya R. Abraham
Venue: Proceedings of the 2nd India software engineering conference (2009)

The effect of cultural differences is often overlooked or neglected when analysing attractive, cost-effective options for software development. This papers aims to highlight people issues that arise out of cultural differences between interacting software development teams, particularly between Indians and non-Indians. The author's intent is to merely bring out the differences and not to provide solutions or recommendations or to identify root causes for the behavior. This is an experience paper, mostly based on observations and sharing of personal experiences from various colleagues and coworkers.
A sector-based routing model over structured peer-to-peer networks
Authors: Jiunn-Jye Lee, Hann-Huei Chiou, Yu-Sheng Yang, Yu-Cheng Su, Chin-Laung Lei
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In a structured peer-to-peer network, frequent join and leave of peer members cause huge maintenance overhead. To deal with this churn problem, we proposed a sector-based routing model (SBRM). The key space is divided into several sectors and each sector has a peer member acting as the relay proxy of the sector. Then the cost of join and leave can be greatly reduced. In this paper we choose Chord as the underlying structured network and perform a series of simulation. Analysis and simulation results show that SBRM achieve lower communication cost when a member joined or left the system, and message routing path length is also shortened.
Efficient data structures for range-aggregate queries on trees
Authors: Hao Yuan, Mikhail J. Atallah
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the MIN in a query subtree consisting of the nodes reachable from a node u along paths of length &le; k (u and k are query parameters). The same problem is well solved when the aggregation is SUM rather than MIN, but the solutions rely on additive inverses for the "+" operator, and they fail for the MIN aggregation which is the topic of this paper. For the directed (rooted tree) case, we give an O(n) space, constant query time solution. For the undirected case, the space complexity is O(n log n) and the query time is O(log n).
Quantum Walks for Computer Scientists
Authors: Salvador Elias Venegas-Andraca
Venue:  (2008)

Quantum computation, one of the latest joint ventures between physics and the theory of computation, is a scientific field whose main goals include the development of hardware and algorithms based on the quantum mechanical properties of those physical systems used to implement such algorithms.Solving difficult tasks (for example, the Satisfiability Problem and other NP-complete problems) requires the development of sophisticated algorithms, many ofwhich employ stochastic processes as their mathematical basis.Discrete random walks are a popular choice among those stochastic processes.Inspired on the success of discrete random walks in algorithm development, quantum walks, an emerging field of quantum computation, is a generalization of random walks into the quantum mechanical world.The purpose of this lecture is to provide a concise yet comprehensive introduction to quantum walks.Table of Contents: Introduction / Quantum Mechanics / Theory of Computation / Classical Random Walks / Quantum Walks / Computer Science and Quantum Walks / Conclusions
The analysis of cyclic circuits with Boolean satisfiability
Authors: John Backes, Brian Fett, Marc D. Riedel
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The accepted wisdom is that combinational circuits must have acyclic (i.e., loop-free or feed-forward) topologies. And yet simple examples suggest that this need not be so. In previous work, we advocated the design of cyclic combinational circuits (i.e., circuits with loops or feedback paths). We proposed a synthesis methodology and demonstrated that it produces significant improvements in area and in delay. The analysis method that we used to validate cyclic circuits was based on binary decision diagrams. In this paper, we propose a much more efficient technique for analysis based on Boolean satisfiability (SAT).
Spectrum auction framework for access allocation in cognitive radio networks
Authors: Gaurav S. Kasbekar, Saswati Sarkar
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different channels: primary networks and secondary networks. A primary network on a channel has prioritized access to the channel and secondary networks can use the channel when the primary network is not using it. The access allocation problem is to select the primary and secondary networks on each channel. We develop an auction-based framework that allows networks to bid for primary and secondary access based on their utilities and traffic demands, and uses the bids to solve the access allocation problem. We develop algorithms for the access allocation problem and show how they can be used either to maximize the auctioneer's revenue given the bids, or to maximize the social welfare of the bidding networks, while enforcing incentive compatibility. We first consider the case when the bids of a network depend on which other networks it will share channels with. When there can be only one secondary network on a channel, we design an optimal polynomial-time algorithm for the access allocation problem based on reduction to a maximum matching problem in weighted graphs. When there can be two or more secondary networks on a channel, we show that the optimal access allocation problem is NP-Complete. Next, we consider the case when the bids of a network are independent of which other networks it will share channels with. We design a polynomial-time dynamic programming algorithm to optimally solve the access allocation problem when the number of possible cardinalities of the set of secondary networks on a channel is upper-bounded. Finally, we design a polynomial-time algorithm which approximates the access allocation problem within a factor of 2 when the above upper bound does not exist.
Outer loop pipelining for application specific datapaths in FPGAs
Authors: Kieron Turkington, George A. Constantinides, Konstantinos Masselos, Peter Y. K. Cheung
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Most hardware compilers apply loop pipelining to increase the parallelism achieved, but pipelining is restricted to the only innermost level in a nested loop. In this work we extend and adapt an existing outer loop pipelining approach known as single dimension software pipelining to generate schedules for field-programmable gate-array (FPGA) hardware coprocessors. Each loop level in nine test loops is pipelined and the resulting schedules are implemented in VHDL and targeted to an Altera Stratix II FPGA. The results show that the fastest solution for all but one of the loops occurs when pipelining is applied one to three levels above the innermost loop. Across the nine test loops we achieve an acceleration over the innermost loop solution of up to seven times, with a mean speedup of 3.2 times. The results suggest that inclusion of outer loop pipelining in future hardware compilers may be worthwhile as it can allow significantly improved results to be achieved at the cost of a small increase in compile time.
The Application Research of Rough Set on Risk Management of Suppliers
Authors: Hong-jun Guan
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

As an important aspect of supply chain, supplier management impact deeply on the efficiency of the supply chain. This article first introduced the relational theory of rough set, then it described the application on the supplier risk management, gave the realization of computer program, and detailed an example to illustrate its practical application.
Introducing computer programming via gameboy advance homebrew
Authors: Gary Kacmarcik, Sylvie Giral Kacmarcik
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper describes our work motivating a group of students (grades 5-8) to learn real-world computer programming by introducing them to homebrew development for the Nintendo Gameboy Advance (GBA) and DS (NDS) systems using C. Students use a freely available professional toolchain (devkitPro) for development. A custom application was written that allowed the students to easily create their own tilesets (sprites and background maps) and quickly get started building their first ROMs. A series of tutorials was created to complement the program and help the students through the creation of their first game.
Recovery Rate of Clustering Algorithms
Authors: Fajie Li, Reinhard Klette
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the algorithm when calculating a family of new clusters.Under the assumption of dealing with simulated data (i.e., known old clusters), the recovery rate is calculated using one proposed exact (but slow) algorithm, or one proposed approximate algorithm (with feasible run time).
The design of the clinical and research information system for psychiatry
Authors: Ruven Brooks
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The Clinical and Research Information System for Psychiatry (CRISP) is a general mental health information system for clinical, research, and administrative functions. From a software perspective, CRISP is designed to solve three problems: First, by attaching procedures to databases, it is designed to permit dynamic addition of new database formats and organizations without the need to restructure existing information. Second, CRISP uses a message-passing architecture with security checks on each message so that each user can be given a different set of access rights on each individual patient. Finally, the process attachment combined with message architecture makes it easier to distribute CRISP across a network. The network can, in turn, be used to provide smooth storage migration across different secondary storage devices.
Developing a strategy profile for management support systems
Authors: Gary K. Gulden, Eevelyn S. Arkush
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

In most business organizations today, a new era in the application of information-systems technology has been entered: The era of management support systems (MSS). In fact, there is much evidence to support the claim that management support systems (as distinct from conventional transaction processing or MIS systems) is the fastest growing segment of the information systems portfolio. This paper explores the urgent need for MSS planning and presents a practical methodology to approaching this very different planning problem.
Dimensionality reduction and polynomial chaos acceleration of Bayesian inference in inverse problems
Authors: Youssef M. Marzouk, Habib N. Najm
Venue: Journal of Computational Physics (2009)

We consider a Bayesian approach to nonlinear inverse problems in which the unknown quantity is a spatial or temporal field, endowed with a hierarchical Gaussian process prior. Computational challenges in this construction arise from the need for repeated evaluations of the forward model (e.g., in the context of Markov chain Monte Carlo) and are compounded by high dimensionality of the posterior. We address these challenges by introducing truncated Karhunen-Loeve expansions, based on the prior distribution, to efficiently parameterize the unknown field and to specify a stochastic forward problem whose solution captures that of the deterministic forward model over the support of the prior. We seek a solution of this problem using Galerkin projection on a polynomial chaos basis, and use the solution to construct a reduced-dimensionality surrogate posterior density that is inexpensive to evaluate. We demonstrate the formulation on a transient diffusion equation with prescribed source terms, inferring the spatially-varying diffusivity of the medium from limited and noisy data.
Access 2007 VBA Made Accessible, 2nd edition
Authors: Dr. Gerard Verschuuren
Venue:  (2008)

Designed as a training tool, this reference allows Access users to advance to the next level by using Visual Basic for Applications (VBA), a powerful object-oriented programming language packaged with every copy of Access sold). Containing more than 1,110 step-by-step slides, this user-friendly guide ensures total absorption of the material by encouraging a self-paced training program. From learning total control of coding to employing various variables and spotting errors, this resource provides a solid foundation for those who want to develop Access databases.
IS outsourcing as dynamic phenomena: case studies of quasi-outsourcing in Japan
Authors: Seigo Matsuno, Yasuo Uchida, Shin-Ya Tagawa, Takao Ito
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

A characteristic feature of the outsourcing of information systems (IS) in Japan is the use of quasi-outsourcing primarily by large-scale firms. In most such cases, an IS subsidiary is established by spinning off the firm's own information systems department. However, in recent years, there have been many firms which strengthen capital alliances between their IS subsidiary and external vendors, or completely sell it. On the other hand, there is growing diversification in the management of IS subsidiaries, such as firms forcing their IS subsidiaries to withdraw from external sales business, or going further and integrating the IS subsidiary back into the company again (i.e., backsourcing). This research employs case method in order to investigate the factors which have an effect on these IS subsidiary arrangements. To achieve that, we first review relevant early studies. Then we present case studies of two chemical manufacturing companies in Japan. And finally, we propose some theses based on the implications derived from the case studies.
Extending stochastic ordering to belief functions on the real line
Authors: Thierry Denux
Venue: Information Sciences: an International Journal (2009)

In this paper, the concept of stochastic ordering is extended to belief functions on the real line defined by random closed intervals. In this context, the usual stochastic ordering is shown to break down into four distinct ordering relations, called credal orderings, which correspond to the four basic ordering structures between intervals. These orderings are characterized in terms of lower and upper expectations. We then derive the expressions of the least committed (least informative) belief function credally less (respectively, greater) than or equal to a given belief function. In each case, the solution is a consonant belief function that can be described by a possibility distribution. A simple application to reliability analysis is used as an example throughout the paper.
Bounds for the 2-domination number of toroidal grid graphs
Authors: Ramy S. Shaheen
Venue: International Journal of Computer Mathematics (2009)

A k-dominating set for a graph G(V, E) is a set of vertices D⊆ V such that every vertex v∈V\ D is adjacent to at least k vertices in D. The k-domination number of G, denoted by γk(G), is the cardinality of a smallest k-dominating set of G. Here we establish lower and upper bounds of γk(Cm×Cn) for k=2. In some cases, these bounds agree so that the exact 2-domination number is obtained.
Simple Compression Algorithm for Memoryless Laplacian Source Based on the Optimal Companding Technique
Authors: Zoran H. Perić, Marko D. Petković, Milan R. Dinčić
Venue: Informatica (2009)

This paper has two achievements. The first aim of this paper is optimization of the lossy compression coder realized as companding quantizer with optimal compression law. This optimization is achieved by optimizing maximal amplitude for that optimal companding quantizer for Laplacian source. Approximate expression in closed form for optimal maximal amplitude is found. Although this expression is very simple and suitable for practical implementation, it satisfy optimality criterion for Lloyd-Max quantizer (for R >= 6 bits/sample). In the second part of this paper novel simple lossless compression method is presented. This method is much simpler than Huffman method, but it gives better results. Finally, at the end of the paper, we join optimal companding quantizer and lossless coding method together in one generalized compression method. This method is applied on the concrete still image and good results are obtained. Besides still images, this method also could be used for compression speech and bio-medical signals.
Getting there: six meta-principles and interaction design
Authors: Gilbert Cockton
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Principled knowledge is a mark of any established disciplinary practice. Its derivation and validation of varies across disciplines, but HCI has tended towards posthoc ('a posteriori') syntheses. We present an alternative a priori approach that is relatively compact and open to inspection. We use John Heskett's position on the origins of design outcomes to derive six metaprinciples for all design processes: receptiveness, expressivity, committedness, credibility, inclusiveness and improvability. Although very abstract, these meta-principles generate critical insights into existing HCI approaches, identifying gaps in suitability and coverage. Practical value is increased by progressive instantiation of meta-principles to create first craft-specific, and ultimately project-specific, Interaction Design principles. A worth-centred approach is adopted to illustrate progressive instantiation towards a framework of adapted and novel HCI approaches. The internal coherence of the six metaprinciples is shown to provide direct effective support for synergistic progressive instantiation.
Fourier depth of field
Authors: Cyril Soler, Kartic Subr, Frédo Durand, Nicolas Holzschuch, François Sillion
Venue: ACM Transactions on Graphics (TOG) (2009)

Optical systems used in photography and cinema produce depth-of-field effects, that is, variations of focus with depth. These effects are simulated in image synthesis by integrating incoming radiance at each pixel over the lense aperture. Unfortunately, aperture integration is extremely costly for defocused areas where the incoming radiance has high variance, since many samples are then required for a noise-free Monte Carlo integration. On the other hand, using many aperture samples is wasteful in focused areas where the integrand varies little. Similarly, image sampling in defocused areas should be adapted to the very smooth appearance variations due to blurring. This article introduces an analysis of focusing and depth-of-field in the frequency domain, allowing a practical characterization of a light field's frequency content both for image and aperture sampling. Based on this analysis we propose an adaptive depth-of-field rendering algorithm which optimizes sampling in two important ways. First, image sampling is based on conservative bandwidth prediction and a splatting reconstruction technique ensures correct image reconstruction. Second, at each pixel the variance in the radiance over the aperture is estimated and used to govern sampling. This technique is easily integrated in any sampling-based renderer, and vastly improves performance.
Two views on data integration
Authors: Jiri Kohout, Katerina Kucerova
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

With an increasing number of different data sources there is a growing need for their interconnection and cooperation. This problem solves data integration which provides a way how to present data from different sources as from a one single source. In this paper there are presented two different approaches to data integration - in the area of companies' data sources and World Wide Web data sources. In both of these areas there is described an actual technique of solving data diversity. The first two parts contain a description of basic terms in identity management, brief review of access management and finally advantages, disadvantages and obstacles of identity management systems implementation and the process of implementation itself. The following two parts deal with the idea of semantic web integration where the attention is mainly focused on ontologies and benefits of their usage. The last part concludes this paper by describing data integration approach based on ontologies.