ppxscal/embedding_network huggingface dataset:
Parallel Kriging Interpolation for Modeling of Stratified Stratum
Venue: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops (2007)

Kriging is an advanced interpolation technique and often used to model the three-dimension stratified stratum, but too much time are needed for large area with a plenty of layers. In order to improve the speed of interpolation and visualization of stratified stratum, a novel parallel ordinary Kriging interpolation with medium granularity is presented. In the parallel computing environment established by PCs with Windows2000 OS, the parallel algorithm based on MPI is adopted to setup a 3D stratum model. The statistic data show that the parallel Kriging interpolation can save the computing time efficiently and has a good scalability. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Release and Control for IT Service Management, based on ITIL - A Practitioner Guide, 1st edition
Authors: Jan Van Bon
Venue:  (2007)

Practitioner Release and Control for IT Service Management, based on ITIL- A Practitioner Guide aims at helping the reader to prepare for using Best Practices in his or her role in the area of Change Management, Release Management and Configuration Management. The guidance provided in this book is based on ITIL, the Best Practice Library in IT Service Management. The chapters are structured round the main competency areas of the practitioner requirements: Manage, Organize, Optimize, so the reader can relate reading material and tasks easily.
Anywhere pixel router
Authors: Steve Dominick, Ruigang Yang
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

Large-format, high-resolution displays have experienced significant growth in demand across a broad range of markets, including command and control rooms, immersive simulation environments, entertainment events, and corporate conference rooms. The need has arisen for a rapidly deployable, cost effective solution for creating large, seamless displays of high resolution dynamic content from multiple independent sources. We propose the Pixel Router as an essential piece of technology toward meeting this need. This scalable, custom hardware solution allows the mapping of pixels from any input to any output while performing composition operations, all based on a simple look-up table. Coupled with existing camera-based projector calibration techniques to describe the specific pixel routing and blending for a given display, this system can provide a rapidly deployable solution for viewing high resolution content from many sources simultaneously.
Difference Forms
Authors: Elizabeth L. Mansfield, Peter E. Hydon
Venue: Foundations of Computational Mathematics (2008)

Currently, there is much interest in the development of geometric integrators, which retain analogues of geometric properties of an approximated system. This paper provides a means of ensuring that finite difference schemes accurately mirror global properties of approximated systems. To this end, we introduce a cohomology theory for lattice varieties, on which finite difference schemes and other difference equations are defined. We do not assume that there is any continuous space, or that a scheme or difference equation has a continuum limit. This distinguishes our approach from theories of &#x201c;discrete differential forms&#x201d; built on simplicial approximations and Whitney forms, and from cohomology theories built on cubical complexes. Indeed, whereas cochains on cubical complexes can be mapped injectively to our difference forms, a bijection may not exist. Thus our approach generalizes what can be achieved with cubical cohomology. The fundamental property that we use to prove our results is the natural ordering on the integers. We show that our cohomology can be calculated from a good cover, just as de Rham cohomology can. We postulate that the dimension of solution space of a globally defined linear recurrence relation equals the analogue of the Euler characteristic for the lattice variety. Most of our exposition deals with forward differences, but little modification is needed to treat other finite difference schemes, including Gauss-Legendre and Preissmann schemes.
Performance enhancement of flow control in 10GbE WANs
Authors: Rohan De Silva
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

This paper presents a new method of improving the flow control mechanism in 10 Gigabit Ethernet (10GbE) WANs. The ON/OFF control method prescribed by the standard leads to fluctuations of flow rates and the queue levels of the switches. Apart from the ON/OFF control, there are a few recent flow control mechanisms developed for the 10GbE networks in the literature. However, they do not comply with the present 10GbE standard as they require other quantities such as queue level to be included in the control frame. Our approach converts the fair share calculated by the switch to an equivalent pause time. As a result, our algorithm complies with the standard. Performance of this scheme has been studied via simulations and compared with the performance of the ON/OFF control method.
On the application of linear transformations for genetic algorithms optimization
Authors: Sancho Salcedo-Sanz, Carlos Bousoño-Calzón
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This paper discusses new results about the effect of linear transformations (LTs) over the representation, the spectrum and the performance of standard genetic algorithms (GAs). Unitary LTs are used to set the basic outcomes and, although they can be used for theoretic GA-hard problems, their applicability is shown to be quite limited. Nevertheless, the redundancy of problems can be exploited by means of non-unitary LTs. We also propose an heuristic for construction of non-unitary LTs. Several experiments are performed in order to discuss the theoretical results of the paper.
Distributed Overlay Formation in Heterogeneous Wireless Sensor Networks
Authors: Si-Yu Ou, Hung-Chang Hsiao, Chi-Kuo Chiang, Chung-Ta King
Venue: International Journal of Distributed Sensor Networks (2007)

The scale and functional complexity of future-generation wireless sensor networks will call for a non-homogeneous architecture, in which different sensors play different logical roles or functions, or have different physical capabilities in terms of energy, computing power, or network bandwidth. When sensors of the same group need to communicate with each other, their communications often have to pass through other sensors, thus forming an overlay on top of the wireless sensor network. The topology of the overlay is critical. It must have a low diameter to reduce the communication latency between those sensors. It also needs to avoid using other sensors for relaying the communications as much as possible, so as to preserve the energy of other sensors. In this paper, we propose a distributed overlay formation protocol taking account of the above factors. Through simulation, we compare our protocol with two overlay formation protocols, one that generates a fully connected topology and the other a minimum spanning tree. The results show that our protocol can achieve better performance both in message latency and energy consumption.
Convexity of degree sequences
Authors: R. P. Anstee, Yunsun Nam
Venue: Journal of Graph Theory (1999)

We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of Katerinis and Fraisse, Hell and Kirkpatrick concerning vertex deleted f-factors are generalized. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 147&ndash;156, 1999
Artificial Intelligence: A Systems Approach (w/CDROM)(Computer Science) (Engineering)(AI), 1 edition
Authors: M. Tim Jones
Venue:  (2007)

This book offers students and AI programmers a new perspective on the study of artificial intelligence concepts. The essential topics and theory of AI are presented, but it also includes practical information on data input & reduction as well as data output (i.e., algorithm usage). Because traditional AI concepts such as pattern recognition, numerical optimization and data mining are now simply types of algorithms, a different approach is needed. This sensor / algorithm / effecter approach grounds the algorithms with an environment, helps students and AI practitioners to better understand them, and subsequently, how to apply them. The book has numerous up to date applications in game programming, intelligent agents, neural networks, artificial immune systems, and more. A CD-ROM with simulations, code, and figures accompanies the book. *Features *Covers not only AI theory, but modern applications e.g., game programming, machine learning, swarming, artificial immune systems, genetic algorithms, pattern recognition, numerical optimization, data mining, and more *Discusses the various computer languages of AI from LISP to JAVA and Python *Includes a CD-ROM with 100MB of simulations, code, and fi gures *Table of Contents 1. Introduction. 2. Search. 3. Games. 4. Logic. 5. Planning. 6. Knowledge Representation. 7. Machine Learning. 8. Probabilistic Reasoning. 9. Stochastic Search. 10. Neural Networks. 11. Intelligent Agents. 12. Hybrid Models. 13. Languages of AI.
Performance Study of the Coexistence of Wireless Sensor Networks (WSN) and Wireless Local Area Networks (WLAN)
Authors: Muhammad Adib Haron, Sharifah Kamilah Syed Yusof, Norsheila Fisal, Sharifah Hafizah Syed Ariffin, Adel Abdallah
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents a special state machine of interference temperature multiple access (ITMA) that characterizes both interference and noise with single parameter in wireless sensor networks (WSN) application. By measuring current interference temperature before data transmission, cognitive node is able to determine transmit power and data rate that should be used to achieve desired capacity without violating interference temperature limit at other co-channel transceiver. Simulations of NS-2 are shown to simultaneously satisfy the three main objectives of extending battery life of cognitive node through optimum transmit power provision, maximizing the traffic carrying of networks capacity and limit interference to other coexist node. Hence, cognitive node is feasible to support QoS provisioning, and fairness among WSN and WLAN users.
On near optimal neural control of multiple-input nonlinear systems
Authors: Dingguo Chen, Jiaben Yang, Ronald R. Mohler
Venue: Neural Computing and Applications (2008)

It has been a common consensus that general techniques for stabilization of nonlinear systems are available only for some special classes of nonlinear systems. Control design for nonlinear systems with uncertain components is usually carried out on a per system basis, especially when physical control constraints, and certain control performance measures such as optimum time control are imposed. Elegant adaptive control techniques are difficult to apply to this type of problems. A new neural network based control design is proposed and presented in this paper to deal with a special class of uncertain nonlinear systems with multiple inputs. The desired system dynamics are analyzed and utilized in the process of the proposed intelligent control design. The theoretical results are provided to justify the design procedures. The simulation study is conducted on a second-order bilinear system with two inputs and uncertainties on its parameters. The simulation results indicate that the proposed design approach is effective.
Multiobjective differential evolution for workflow execution on grids
Authors: A. K. M. Khaled Ahsan Talukder, Michael Kirley, Rajkumar Buyya
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

Most algorithms developed for scheduling applications on global Grids focus on a single Quality of Service (QoS) parameter such as execution time, cost or total data transmission time. However, if we consider more than one QoS parameter (eg. execution cost and time may be in conflict) then the problem becomes more challenging. To handle such scenarios, it is convenient to use heuristics rather than a deterministic algorithm. In this paper we have proposed a workflow execution planning approach using Multiobjective Differential Evolution (MODE). Our goal was to generate a set of trade-off schedules according to two user specified QoS requirements (time and cost). The alternative tradeoff solutions offer more flexibility to users when estimating their QoS requirements of workflow executions. We have compared our results with two baseline multiobjective evolutionary algorithms. Simulation results show that our modified MODE is able to find a comparatively better spread of compromise solutions.
Improved Empty Vehicle Balancing in Automated Material Handling Systems
Authors: Roland Wertz, Christian Fischmann, Fabian Böttinger, Martin Kasperczyk
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The use of automated guided vehicles in high-tech industries such as the semiconductor industry results, due to the size of such factories, in highly complex rail-networks. In contrast to the routing of vehicles that are transporting a lot to its destination, the scheduling of empty vehicles is an inadequate examined problem. This poster is dealing with the issue of empty vehicle balancing and the related search of dynamic parking positions during the planning phase of simulation. The results presented help to improve the factory performance by reducing the overall delivery times in automated material handling systems.
Recursive *-tree parallel data-structure
Authors: O. Berkman, U. Vishkin
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The authors introduce a fundamentally novel parallel data structure, called recursive *-tree (star tree). For its definition, they use a generalization of this * functional and apply it to functions other than log. Using recursion in the spirit of the inverse-Akermann function, they derive recursive *-trees. The recursive *-tree data structure leads to a new design paradigm for parallel algorithms. The paradigm allows for unusually fast parallel computations that need only constant time, using an optimal number of processors under the assumption that a very small number of processors can write simultaneously, each into different bits of the same word.
Powerful People Are Powerful IT Professionals: Your Daily Guide To Becoming a Powerful Information Systems Person, 0 edition
Authors: Peter Biadasz
Venue:  (2007)

Powerful People Are Powerful IT Professionals is composed of daily assignments regarding the many aspects of becoming a powerful information systems professional. These lessons are laid-out in four sections. The first part of the daily drill is an inspiring quotation from a powerful person. The idea is to thoughtfully reflect upon the passage as it relates to the subject matter. Expanded capability is gained through a daily assignment via a straightforward yet simple set of exercises and drills. Each one is a small building block of knowledge. Next the work guide asks you, the information systems in power training, to do research on the quotation. This task can easily take you back in time and into the circumstances involving the words spoken by the author of the quote. Finally, the last part of the work is a six months review. This practice reinforces your book of knowledge on issues faced by IT professionals. When you properly apply this learning in your daily life, the information systems scenarios with your family, friends, and fellow workers, you will become more powerful, one day at a time. Visit www.bepowerful.net
Cooperative learning in operating systems laboratory
Authors: Jorge E. Pérez, Javier García Martín, Isabel Muñoz Fernández
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

In this paper, we describe the use of cooperative learning (with jigsaw) in lab sessions in an operating systems course.
Design and Implementation of a FAT File System for Reduced Cluster Switching Overhead
Authors: Moonsoo Choi, Heemin Park, Jaewook Jeon
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this paper, we present design and implementation of a New FAT file system (NFAT) for mobile multimedia devices. Conventional file system which has been used for personal computers is the FAT and it is still adopted for most of current portable devices. The major problem of the FAT is overhead due to cluster switching which involves retrieving and updating of cluster connection information saved on the file allocation table. Because of this overhead, response time of file read and write operation cannot be guaranteed in the FAT. This paper proposes the NFAT which guarantees expected response time by reducing cluster switching overhead when it reads and writes data for portable multimedia devices. To verify our proposal, we have implemented a prototype NFAT file system on ARM9 development board and a Secure Digital Card. The experimental results show that the NFAT does not have irregular response time when performing read/write operations. Therefore, the NFAT is suitable file system for mobile devices which have real-time requirements in reading and writing multimedia data.
Recognition of action meeting videos using timed automata
Authors: Lucjan Pelc, Bogdan Kwolek
Venue: Machine Graphics Vision International Journal (2006)

This paper addresses the problem of action recognition in meeting videos. A declarative knowledge provided graphically by the user together with person positions extracted by a tracking algorithm are used to generate the data for recognition. The actions have been formally specified using timed automata. The specification was verified on the basis of simulation tests as well as an analysis. The tracking is accomplished using a particle filter built on cues such as color, gradient and shape.
Efficient order basis computation (abstract only)
Authors: Wei Zhou
Venue: ACM Communications in Computer Algebra (2008)

Order basis (also known as 3/4-basis, minimal approximant basis), originally developed by Beckermann and Labahn in 1994 for rational approximation and interpolation problems, has recently been applied to many other important problems in polynomial matrix computation. These include column reduction, matrix inverse, determinant, and null space basis computation. Storjohann, in 2006, provided an efficient way to compute a part of order basis that is within a given degree bound. We extend Storjohann's result by providing a way to compute a complete order basis with a similar computational cos.
A low-rate identification method for digital predistorters based on Volterra kernel interpolation
Authors: Peter Singerl, Heinz Koeppl
Venue: Analog Integrated Circuits and Signal Processing (2008)

A novel identification and digital predistortion scheme of weakly nonlinear passband systems such as RF power amplifiers (PA) is presented. It is well known that for the identification of weakly nonlinear systems, despite the spectral regrowth, it suffices to sample the input-output (I/O) data of the system at the Nyquist rate of the input signal. Many applications such as linearization (digital predistortion) and mixed signal simulations require system models at a higher sampling rate than Nyquist. Up to now the construction of such high-rate predistorters has been done by oversampling the corresponding I/O data. This leads to high computational complexity, ill-posedness of the estimation, and high demand on the analog-to-digital converter (ADC) sampling rate for the implementation. This paper discusses an efficient way to obtain high-rate predistorters from low-rate system models and shows the validity of the proposed scheme for a 5th-order complex baseband PA model, where adjacent channel power suppression of 20 dB is achieved.
A two-grid method based on Newton iteration for the Navier-Stokes equations
Authors: Xiaoxia Dai, Xiaoliang Cheng
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, we consider a two-grid method for resolving the nonlinearity in finite element approximations of the equilibrium Navier-Stokes equations. We prove the convergence rate of the approximation obtained by this method. The two-grid method involves solving one small, nonlinear coarse mesh system and two linear problems on the fine mesh which have the same stiffness matrix with only different right-hand side. The algorithm we study produces an approximate solution with the optimal asymptotic in h and accuracy for any Reynolds number. Numerical example is given to show the convergence of the method.
Dynamic Evolution Systems and Applications in Intrusion Detection Systems
Authors: Xian-Ming Xu, Justin Zhan
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In this paper, we present a dynamic evolution system and build up a model to trace the transition of the system state. This new model differs from the previous methods, such as Bayesian network, artificial neural network, in two aspects: it can adapt the changes of the environment automatically, and it does not need a special training phase to build up a model. Theoretical analysis shows that it is applicable and practical, and furthermore, experimental results show that it has good performance especially in dynamic environment.
Standards update from IP 07
Authors: Victor Berman
Venue: IEEE Design Test (2008)

Compared to other areas of electronics design, the IP industry has lagged in the development of comprehensive standards for description, integration, verification, and evaluation. This lag has stifled the development of automation tools, which have been so effective in growing other aspects of the electronics design industry. The current state of IP standards is a major roadblock to industry growth. But how can this problem be solved? The author of this column argues that the IEEE is the best place to centralize standards development but that this must be done in conjunction with active participation of other industry groups for market research, feedback, and funding.