ppxscal/embedding_network huggingface dataset:
Fault estimations for linear systems with polytopic uncertainties
Authors: Heng Wang, Guang-Hong Yang
Venue: International Journal of Systems, Control and Communications (2008)

This paper studies the fault estimations problem for linear time-invariant systems with polytopic uncertainties. Both discrete-time and continuous-time cases are considered, and the recently developed Generalized Kalman-Yakubovich-Popov (GKYP) Lemma is exploited to formulate the fault estimation filter design problem in finite frequency domain. The filter is designed to make the error between residual and fault as small as possible despite of the disturbance effects and model uncertainties. Design methods are presented in terms of solutions to a set of Linear Matrix Inequalities (LMIs). Numerical examples are given to illustrate the effectiveness of the proposed methods.
Control Network Programming Illustrated: Solving Problems with Inherent Graph-Like Representation
Authors: Kostadin Kratchanov, Emilia Golemanova, Tzanko Golemanov
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Control Network Programming (CNP) is a style of high-level programming created to be especially convenient for solving problems with natural graph-like representation. Showing that this goal has been achieved is the purpose of the current report. CNP solutions to four problems representative of four important problem classes are presented. Most of the problem descriptions are nondeterministic and declarative, without specifying an algorithmic solution. These natural problem descriptions are easily converted into working Control Network programs.
Hardware Implementation Trade-Offs of Polynomial Approximations and Interpolations
Authors: Dong-U Lee, Ray Cheung, Wayne Luk, John Villasenor
Venue: IEEE Transactions on Computers (2008)

This paper examines the hardware implementation tradeoffs when evaluating functions via piecewise polynomial approximations and interpolations for precisions up to 24 bits. In polynomial approximations, polynomials are evaluated using stored coefficients. Polynomial interpolations, however, require the coefficients to be computed on-the-fly using stored function values. Although it is known that interpolations require less memory than approximations at the expense of additional computation, the tradeoffs in memory, area, delay, and power consumption between the two approaches have not been examined in detail. This work quantitatively analyzes these tradeoffs for optimized approximations and interpolations across different functions and target precisions. Hardware architectures for degree-1 and degree-2 approximations and interpolations are described. The results show that the extent of memory savings realized by using interpolation is significantly lower than what is commonly believed. Furthermore, experimental results on a field-programmable gate array (FPGA) show that for high output precision, degree-1 interpolations offer considerable area and power savings over degree-1 approximations, but similar savings are not realized when degree-2 interpolations and approximations are compared. The availability of both interpolation-based and approximation-based designs offers a richer set of design tradeoffs than is available using either interpolation or approximation alone.
High performance 2D and 3D FDTD solvers on GPUs
Authors: John R. Humphrey, Daniel K. Price, James P. Durbano, Eric J. Kelmelis, Richard D. Martin
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Our group has employed the use of modern graphics processor units (GPUs) for the acceleration of finite-difference based computational electromagnetics (CEM) codes. In particular, we accelerated the well-known Finite-Difference Time-Domain (FDTD) method, which is commonly used for the analysis of electromagnetic phenomena. This algorithm uses difference-based approximations for Maxwell's Equations to simulate the propagation of electromagnetic fields through space and materials. The method is very general and is applicable to a wide array of problems, but runtimes are long enough that acceleration is highly desired. In this paper we present GPU-based accelerated solvers for the FDTD method in both its 2D and 3D embodiments.
Using Built-In Interoperability with Self-Adaptive Components for RTS
Authors: Emilia de Menezes Colonese
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Component-based software engineering offers a way to solve complex systems by dividing it into well-defined modules. Adaptation mechanisms are crucial to enable run-time reconfiguration and to improve system’s performance. The practicality of achieving interoperability remains a challenge for rapidly process operational requirements allowing components to work together with others. It must maintain the behavior and data integrity, while improves the answer time. A common set of “building codes” is proposed in this paper as a framework adopted for data interoperability among Real-Time System (RTS) components to replace gateways. It implements generic behavioral models for monitoring and controlling system composed of dynamic service servers, service invokers, a common protocol class, a component class, a message class, and a use case class. The target system might be adjusted to the framework, allowing the software components to have high degrees of cost-effective reuse. The framework was validated by building a control station prototype system, which controls UAV missions at run-time, while self-adapting service servers according to external events. The stakeholder requirements are monitored such that the software behavior can be verified at run-time.
A Survey for Open Shortest Path First Weight Setting (OSPFWS) Problem
Authors: Ahmed Abo Ghazala, Ayman El-Sayed, Mervat Mousa
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Open shortest path first (OSPF) is the most commonly used intera-domain routing protocol. It used to select the paths along which traffic is routed within autonomous systems (AS), OSPF calculates routes as follow. Each link is assigned weights by operator. Each node in the autonomous system computes shortest paths and creates destination tables used to route data to next node on the path to its destination. Shortest paths are selected according to path cost. Path cost is determined by sum of its weight links. Then link weights determine the shortest paths, in which turn determine the routing of network traffic flow. OSPF weights setting problem is to find a set of OSPF weights that optimizes network performance. OSPF weights setting problem is an NP-hard problem. In the last couple of years, various algorithms for OSPF weights setting problem have been proposed. In this paper, we present a survey of OSPF weights setting algorithms and compare their performances.
Performance Evaluation of Load Control Techniques in SIP Signaling Servers
Authors: Sergio Montagna, Maurizio Pignolo
Venue: Proceedings of the Third International Conference on Systems (2008)

This paper is aimed at studying and evaluating the performance of two algorithms suitable for load control enhancement in “Session Initiation Protocol” servers. A shrewd management of SIP call-control messages is key for the performance of telecom infrastructures, since SIP is rapidly gaining momentum to be the #1 protocol for session signaling in Next-Generation multimedia converged networks. The work will show simulation results related to the performance of a virtual server belonging to a real server SIP farm under both homogeneous and non-homogeneous traffic scenarios.
Schläfli numbers and reduction formula
Authors: Thomas Zehrt
Venue: European Journal of Combinatorics (2008)

We define so-called poset-polynomials of a graded poset and use it to give an explicit and general description of the combinatorial numbers in Schlafli's (combinatorial) reduction formula. For simplicial and simple polytopes these combinatorial numbers can be written as functions of the numbers of faces of the polytope and the tangent numbers. We use the constructed formulas to determine the volume of 4-dimensional Coxeter polytopes.
Fabrication of large area nano-rings for MRAM application
Authors: Yong Luo, Veena Misra
Venue: Microelectronic Engineering (2008)

We have developed lateral etch techniques to fabricate large area high density nano-scale magnetic ring arrays by deep ultraviolet lithography. Both centered and de-centered rings have been obtained. The width of the rings are controlled by the lateral etch time, and the inner ring diameter was scaled down below the lithography resolution limit. For de-centered rings, the shift between the center of inner and outer circles was easily adjustable. The characteristics of the ring arrays were characterized by SEM, AFM and SQUID.
On the multisymplecticity of partitioned Runge-Kutta and splitting methods
Authors: Brett N. Ryland, Robert I. Mclachlan, Jason Frank
Venue: International Journal of Computer Mathematics (2007)

Although Runge-Kutta and partitioned Runge-Kutta methods are known to formally satisfy discrete multisymplectic conservation laws when applied to multi-Hamiltonian PDEs, they do not always lead to well-defined numerical methods. We consider the case study of the nonlinear Schrödinger equation in detail, for which the previously known multisymplectic integrators are fully implicit and based on the (second order) box scheme, and construct well-defined, explicit integrators, of various orders, with local discrete multisymplectic conservation laws, based on partitioned Runge-Kutta methods. We also show that two popular explicit splitting methods are multisymplectic.
Poser 7 Essential Training
Authors: Larry Mitchell
Venue:  (2007)

Poser 7 is one of the most enjoyable applications for creating realistic animated 3-D characters. In Poser 7 Essential Training, instructor Larry Mitchell explains how to design, pose, and animate 3-D characters using the program s intuitive interface, tools, and workflow. The training covers everything from essential animation principles to working on the intricate details of individual body parts and complicated facial expressions. Larry also teaches the minute steps required to create characters that can lip-synch to recorded sound files. Advanced topics, such as incorporating HDRI lighting, animating to reference videos, and integrating Poser 7 and Vue 6, add to the full learning experience. Exercise files accompany the tutorials.
A mobile auction service based on mobile agents: design and analysis
Authors: Jie Zhang, Henry C. B. Chan
Venue: International Journal of Wireless and Mobile Computing (2008)

With the advent of wireless networking and mobile computing technologies, there has been considerable interest in developing various mobile commerce services such as mobile auctions. This paper presents a mobile auction service based on mobile agents. Using a proxy server, users can generate a mobile agent by providing bidding information through a mobile terminal. The agent then moves to the required server to bid according to the user requirements. We have developed a prototype to demonstrate and evaluate the basic functions in a wireless network. Furthermore, we have formulated a mathematical model to analyse the commonly used 'proxy bidding method' for the mobile auction system. Based on the distribution of the maximum bidding price, the model can be used to find the probability of stopping at a certain price and, hence, the average winning price. Simulation and analytical results are presented to demonstrate the behaviour of the system.
ICA and ISA using Schweizer-Wolff measure of dependence
Authors: Sergey Kirshner, Barnabás Póczos
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise dependence (Schweizer & Wolff, 1981), a non-parametric measure computed on pairwise ranks of the variables. Our algorithm frequently outperforms state of the art ICA methods in the normal setting, is significantly more robust to outliers in the mixed signals, and performs well even in the presence of noise. Our method can also be used to solve independent subspace analysis (ISA) problems by grouping signals recovered by ICA methods. We provide an extensive empirical evaluation using simulated, sound, and image data.
Hypertext 2007 conference review
Authors: Alvin Chin, James Goulding
Venue: ACM SIGWEB Newsletter (2008)

From September 10 to 12, 2007, over 100 attendees convened in Manchester, England, travelling from all over Europe, as well as the far climes of North America, Asia and Australia. Unlike many visitors to Manchester they weren't here to witness the city's much heralded football team, but had gathered instead at the University of Manchester for the 18th International Conference on Hypertext and Hypermedia (Hypertext 2007). Here they would discuss recent innovations in hypertext, whose most famous form exists as the World Wide Web, and assess the challenges and opportunities in the latest groundbreaking research. Traditionally the success of the Hypertext conference series has been attributed to its immense diversity, and this year was no different, with papers being divided into 5 varied tracks: Hypertext and the Person; Hypertext and Society; Practical Hypertext; Hypertext Culture and Communication; and Hypertext Models and Theory. The conference was a vibrant affair that featured 16 full papers and 7 short papers (with a 29% overall acceptance rate), posters, demos, keynotes, panels, Birds-of-a-Feather (BOFs) and social events. However, what characterized this year's conference the most was an underlying sense of reintegration, a rejoining of disparate trends in hypertext to common goals. And as such a lot of unity and camaraderie too.
An efficient resource allocation scheme for multimedia applications in MANET
Authors: G. Varaprasad, R. S. D. Wahidabanu, P. Venkataram
Venue: Journal of Network and Computer Applications (2008)

A Mobile Adhoc Network (MANET) is collection of mobile nodes and communicates using wireless network without having any fixed infrastructure. This paper proposes an algorithm used to allocate the resources for multimedia applications using mobile agent technology in MANET. In addition to that, it allocates the resources for hand-off applications and new applications.
An integrated evaluation method for module-based undergraduate information retrieval education
Authors: Lei Zhu, Jane Wong, Bradley Sturz, Yong Shi, Chun Tang
Venue: Journal of Computing Sciences in Colleges (2008)

In the Information Age, career and life-long learning increasingly depend on information-retrieval (IR) skills to utilize digital and on-line information effectively. Consequently, IR has become a valuable integral element of many disciplines. To address primary problems in the current college-level IR education, we have proposed a module-based curricular model that facilitates the development of an array of IR course modules that enable flexible adoption and integration. In addition, these modules can be designed to meet the specific needs of various disciplines and programs. This paper presents a preliminary integrated evaluation method which combines subjective and objective evaluation in order to assess the effectiveness of the IR modules.
3D Organization of 2D Urban Imagery
Authors: Peter L. Cho
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Working with New York data as a representative and instructive example, we fuse aerial ladar imagery with satellite pictures and Geographic Information System (GIS) layers to form a comprehensive 3D urban map. Digital photographs are then mathematically inserted into this detailed world space. Reconstruction of the photos' view frusta yields their cameras' locations and pointing directions which may have been a priori unknown. It also enables knowledge to be projected from the urban map ontogeoregistered image planes. For instance, absolute geolocations can be assigned to individual pixels, and GIS annotations can be transferred from 3D to 2D. Moreover, such information propagates among all images whose view frusta intercept the same urban map location. We demonstrate how many data mining and visualization challenges (e.g. identify all photos containing some stationary ground target, observe some structure frommultiple perspectives, quantify match between two pictures, etc) become mathematically tractable once a 3D framework for analyzing 2D images is adopted. Finally, we close by briefly discussing future applications of this work to photo-based querying of urban knowledge databases.
Orion 2.0: native support for uncertain data
Authors: Sarvjeet Singh, Chris Mayfield, Sagar Mittal, Sunil Prabhakar, Susanne Hambrusch, Rahul Shah
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Orion is a state-of-the-art uncertain database management system with built-in support for probabilistic data as first class data types. In contrast to other uncertain databases, Orion supports both attribute and tuple uncertainty with arbitrary correlations. This enables the database engine to handle both discrete and continuous pdfs in a natural and accurate manner. The underlying model is closed under the basic relational operators and is consistent with Possible Worlds Semantics. We demonstrate how Orion simplifies the design and enhances the capabilities of two example applications: managing sensor data (continuous uncertainty) and inferring missing values (discrete uncertainty).
Comparison of performance of virtual coupling schemes for haptic collaboration using real and emulated internet connections
Authors: Ganesh Sankaranarayanan, Blake Hannaford
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Networked haptic virtual environments (NHVEs) are those in which multiple users collaborate and experience force feedback at the same time. The robustness of such systems needs to be tested under various network conditions that closely mirror the Internet. Previously, we had proposed three virtual coupling schemes to maintain position coherency in a NHVE, which were tested using constant and then time-varying delays using the actual Internet through UDP packet reflectors. In this paper we present the results of comparing performance of the virtual coupling schemes for a time varying delay emulated using the popular network emulator NIST Net, with delay conditions that existed during our real Internet experiment to Italy. UDP was used for haptic data communication because of the high transmission rate requirements for NHVEs. Experiments were conducted for three fixed packet transmission rates of 1000, 500 and 100 Hz, and their performance compared using an independent-samples t-test to the data obtained using the Internet. Locally, the haptic update rate was maintained at 1000 Hz during the experiments. Our results show that the NIST Net was a suitable emulator for testing with lower packet transmission rates. At the transmission rate of 1000 Hz the performance of the virtual coupling schemes were significantly different from that of the actual Internet experiment.
Fixed channel assignment algorithm for multi-radio multi-channel MESH networks
Authors: Hamed M. K. Alazemi, A. Das, R. Vijaykumar, S. Roy
Venue: Wireless Communications Mobile Computing (2008)

Recently, multi-radio mesh technology in wireless networks has been under extensive research. This is because of its potential of overcoming the inherent wireless multi-hop throughput, scalability and latency problems caused by the half-duplex nature of the IEEE 802.11. The concept of deploying multiple radios in wireless network access points (APs) has shown a promising way to enhance the channel selection and the route formation while the MESH topology allows more fine-grained interference management and topology control. Within this realm, given a set of end-to-end objectives, there are multiple issues that need to be identified when we consider the optimization problem for fixed multi-channel multi-hop wireless networks with multiple radios. This paper addresses the static channel assignment problem for multichannel multi-radio static wireless mesh networks. We first discuss its similarities and differences with the channel assignment problem in cellular networks (WMN). Next, we present four metrics based on which mesh channel assignments can be obtained. Three of these metrics attempt to maximize simultaneous transmissions in a mesh network, either directly or indirectly. The fourth metric quantifies the &lsquo;diversity&rsquo; of a particular assignment and can be used as a secondary criterion to the other three metrics. Related optimization models have also been developed. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Certifying low-level programs with hardware interrupts and preemptive threads
Authors: Xinyu Feng, Zhong Shao, Yuan Dong, Yu Guo
Venue: ACM SIGPLAN Notices (2008)

Hardware interrupts are widely used in the world's critical software systems to support preemptive threads, device drivers, operating system kernels, and hypervisors. Handling interrupts properly is an essential component of low-level system programming. Unfortunately, interrupts are also extremely hard to reason about: they dramatically alter the program control flow and complicate the invariants in low-level concurrent code (e.g., implementation of synchronization primitives). Existing formal verification techniques---including Hoare logic, typed assembly language, concurrent separation logic, and the assume-guarantee method---have consistently ignored the issues of interrupts; this severely limits the applicability and power of today's program verification systems. In this paper we present a novel Hoare-logic-like framework for certifying low-level system programs involving both hardware interrupts and preemptive threads. We show that enabling and disabling interrupts can be formalized precisely using simple ownership-transfer semantics, and the same technique also extends to the concurrent setting. By carefully reasoning about the interaction among interrupt handlers, context switching, and synchronization libraries, we are able to---for the first time---successfully certify a preemptive thread implementation and a large number of common synchronization primitives. Our work provides a foundation for reasoning about interrupt-based kernel programs and makes an important advance toward building fully certified operating system kernels and hypervisors.
Fractal-based hierarchical mip-pyramid texture compression
Authors: J. Stachera, P. Rokita
Venue: Machine Graphics Vision International Journal (2006)

As the level of realism of computer-generated images increases with the number and resolution of textures, we faced the problem of limited hardware resources. Additionally, filtering methods require multiple access and extra memory space for texture representation, thus severely reducing the memory space and bandwidth, the most common example being mip-mapping technique. We propose a hierarchical texture compression algorithm for real-time decompression on the GPU. Our algorithm is characterised by low computational complexity, random access and a hierarchical structure, which allows access to the first three levels of an encoded mip-map pyramid. The hierarchical texture compression algorithm HiTC is based on a block-wise approach, where each block is subject to local fractal transform and further effectively coded by one level of the Laplacian Pyramid.