ppxscal/embedding_network huggingface dataset:
System identification and model order reduction for TLM analysis: Research Articles
Authors: D. Lukashevich, F. Coccetti, P. Russer
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

A system identification (SI) and Prony's model based algorithm for modelling and prediction of a time-domain transient response is introduced and applied to time-domain transmission line matrix (TLM) transient responses in order to extrapolate parameters of microwave circuits and accelerate the simulation process.Application of moment matching model order reduction (MOR) techniques to the TLM method is presented with emphasis placed on Krylov subspace methods based on the Lanczos process and its modifications. The Krylov subspace methods are attractive for MOR in the TLM framework because the construction of orthonormal and biorthogonal bases for correspondent Krylov subspaces can be carried out through a direct application of the implicit TLM solver. MOR applied to TLM allows one to generate a compact macromodel of a TLM-system and significantly reduce the computational time.The efficiency and advantages of the SI and MOR techniques are demonstrated through their applications to the full-wave analysis of different electromagnetic structures. In addition, a brief comparison of SI and MOR involved for modelling of a planar patch antenna is provided. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Hardness of the Covering Radius Problem on Lattices
Authors: Ishay Haviv, Oded Regev
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p\leqslant\infty there exists a constant cp gt 1 such that CRP in the \ell \rho norm is \Pi®_2-hard to approximate to within any constant less than c_p.
Scalable continuous query processing by tracking hotspots
Authors: Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

This paper considers the problem of scalably processing a large number of continuous queries. We propose a flexible framework with novel data structures and algorithms for group-processing and indexing continuous queries by exploiting potential overlaps in query predicates. Our approach partitions the collection of continuous queries into groups based on the clustering patterns of the query ranges, and then applies specialized processing strategies to those heavily-clustered groups (or hotspots). To maintain the partition dynamically, we present efficient algorithms that maintain a nearly optimal partition in nearly amortized logarithmic time. We show how to use the hotspots to scalably process large numbers of continuous select-join and band-join queries, which are much more challenging than simple range selection queries. Experiments demonstrate that this approach can improve the processing throughput by orders of magnitude. As another application of hotspots, we show how to use them to build a high-quality histogram for intervals in linear time.
Web Search Engines: Part 2
Authors: David Hawking
Venue: Computer (2006)

A data processing "miracle" provides responses to hundreds of millions of Web searches each day.
Three-Dimensional Volume Reconstruction Based on Trajectory Fusion from Confocal Laser Scanning Microscope Images
Authors: Sang-Chul Lee, Peter Bajcsy
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In this paper, we address the problem of 3D volume reconstruction from depth adjacent subvolumes (i.e., sets of image frames) acquired using a confocal laser scanning microscope (CLSM). Our goal is to align sub-volumes by estimating an optimal global image transformation which preserves morphological smoothness of medical structures (called features, e.g., blood vessels) inside of a reconstructed 3D volume. We approached the problem by learning morphological characteristics of structures inside of each sub-volume, i.e. centroid trajectories of features. Next, adjacent sub-volumes are aligned by fusing the morphological characteristics of structures using extrapolation or model fitting. Finally, a global sub-volume to subvolume transformation is computed based on the entire set of fused structures. The trajectory-based 3D volume reconstruction method described here is evaluated with a pair of consecutive physical sections using two evaluation metrics for morphological continu
Discrete time model of a multi-cell dc/dc converter: non linear approach
Authors: Bruno Robert, Abdelali El Aroudi
Venue: Mathematics and Computers in Simulation (2006)

By using a non linear discrete time model, this paper shows how to predict bifurcations in a two cells chopper and analyses the road to chaos. Equilibrium points and their stability are investigated in an analogical way to determine the nature of the bifurcations. The global behaviour is studied by using bifurcation diagrams showing collisions between fixed points and borderlines. The border collision bifurcations have their origin in the saturations of the PWM modulator.
On the Use of SIFT Features for Face Authentication
Authors: Manuele Bicego, Andrea Lagorio, Enrico Grosso, Massimo Tistarelli
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Several pattern recognition and classification techniques have been applied to the biometrics domain. Among them, an interesting technique is the Scale Invariant Feature Transform (SIFT), originally devised for object recognition. Even if SIFT features have emerged as a very powerful image descriptors, their employment in face analysis context has never been systematically investigated. This paper investigates the application of the SIFT approach in the context of face authentication. In order to determine the real potential and applicability of the method, different matching schemes are proposed and tested using the BANCA database and protocol, showing promising results.
Study of Fuzzy Generalized Predictive Control Algorithm On Nonlinear Systems
Authors: Qiang Li, Baocun Qu, Zhiqiang Ge, Xisheng Zhan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A novel control algorithm-fuzzy generalized predictive control (FGPC) algorithm for nonlinear systems is proposed. Fuzzy Gustafon-Kessel algorithm and weighted recursive least-square method are applied to identify the T-S model off-line. The identified model is then combined with generalized predictive control algorithm to control non-linear systems. And the detailed steps of the algorithm have been given. The simulation results prove that the proposed algorithm has a high degree of identification accuracy, good robustness, and has obtained a good control result, and therefore is applicable for a variety of non-linear systems.
A Leaf Sequencing Software for Intensity-Modulated Radiation Therapy
Authors: Shuang Luan, Chao Wang, Danny Z. Chen, Xiaobo S. Hu
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper presents a leaf sequencing software called SLS (static leaf sequencing) for intensity-modulated radiation therapy (IMRT). SLS seeks to produce improved clinical IMRT treatment plans by (1) shortening their treatment times and (2) minimizing their machine delivery errors. Our SLS software is implemented using the C programming language on Linux workstations and is designed as a separate module to complement the current commercial treatment planning systems. The input to SLS is discrete radiation intensity maps computed by current planning systems, and its output is (modified) optimized control sequences for the radiotherapy machines. Our SLS approach is very different from the commonly used planning methods in medical literature in that it is based on graph algorithms and computational geometry techniques. Comparisons of SLS with the CORVUS commercial planning system indicated that for the same set of discrete radiation intensity maps, treatment times can be shortened by over 30% by our SLS plans while maintaining the same treatment quality. We have used SLS in clinical applications at two cancer treatment centers. This paper discusses the various aspects of the implementation, installation, commissioning, and testing of our SLS software system.
An efficient subspace algorithm for 2-D harmonic retrieval
Authors: F. Vanpoucke, M. Moonen, Y. Berthoumieu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper addresses the problem of estimating the frequency content of a two-dimensional object, e.g. an image or a set of multi-sensor snapshots, stored in a matrix. The basic assumption is that the data matrix consists of a sum of 2-D complex sinusoids. Our algebraically coupled matrix pencils (ACMP) algorithm splits the 2-D problem into two related 1-D estimation problems. In each direction the frequencies are estimated using a computationally efficient ESPRIT-like subspace algorithm. A further increase in efficiency is due to the algebraic pairing of the horizontal and vertical estimates.
Tracking of Multiple, Partially Occluded Humans based on Static Body Part Detection
Authors: Bo Wu, Ram Nevatia
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Tracking of humans in videos is important for many applications. A major source of difficulty in performing this task is due to inter-human or scene occlusion. We present an approach based on representing humans as an assembly of four body parts and detection of the body parts in single frames which makes the method insensitive to camera motions. The responses of the body part detectors and a combined human detector provide the "observations" used for tracking. Trajectory initialization and termination are both fully automatic and rely on the confidences computed from the detection responses. An object is tracked by data association if its corresponding detection response can be found; otherwise it is tracked by a meanshift style tracker. Our method can track humans with both inter-object and scene occlusions. The system is evaluated on three sets of videos and compared with previous method.
Control of delayed measured systems and impulse length limitations in difference control
Authors: J. C. Claussen
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

When stabilization of unstable periodic orbits or fixed points by the method given by Ott, Grebogi and Yorke (OGY) has to be based on a measurement delayed by /spl tau/ orbit lengths, unmodified OGY method fails beyond a maximal Lyapunov number of /spl lambda//sub max/ = 1+1//spl tau/. Therefore the question arises as to how the control of delayed measured chaotic systems can be improved. Apart from rhythmic control, OGY and difference control can be improved for this case by the memory methods discussed here, linear predictive logging control (LPLC) and memory difference control (MDC). These allow to overcome the measurement delay completely within the linear approximation around the orbit. Furthermore a new stability analysis of the two elementary Poincare-based chaos control schemes, OGY and difference control, is given by means of Floquet theory. This approach allows to calculate exactly the stability restrictions occurring for small measurement delays and for an impulse length shorter than the length of the orbit. As an unexpected result, while for OGY control the influence of the impulse length is marginal, difference control is shown to fail when the impulse length is taken longer than one half of the orbit length.
Generating generic functions
Authors: Johan Jeuring, Alexey Rodriguez, Gideon Smeding
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming (2006)

We present an approach to the generation of generic functions from user-provided specifications. The specifications consist of the type of a generic function, examples of instances that it should "match" when specialized, and properties that the generic function should satisfy. We use the type-based function generator Djinn to generate terms for specializations of the generic function types on the type indices of generic functions. Then we use QuickCheck to prune the generated terms by testing against properties, and by testing specialized candidate functions against the provided examples. Using this approach we have been able to generate generic equality, map, and zip functions, for example.
Planar graphs, negative weight edges, shortest paths, and near linear time
Authors: Jittat Fakcharoenphol, Satish Rao
Venue: Journal of Computer and System Sciences (2006)

In this paper, we present an O(n log3 n) time algorithm for finding shortest paths in an n-node planar graph with real weights. This can be compared to the best previous strongly polynomial time algorithm developed by Lipton, Rose, and Tarjan in 1978 which runs in O(n3/2) time, and the best polynomial time algorithm developed by Henzinger, Klein, Subramanian, and Rao in 1994 which runs in Õ(n 4/3) time. We also present significantly improved data structures for reporting distances between pairs of nodes and algorithms for updating the data structures when edge weights change.
Applying a Component-Based Architectural Model in the Development of e-Learning Systems
Authors: Clever R. G. de Farias, Marta C. Rosatelli, Carlos E. Goncalves
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

One of the biggest challenges in system development is the definition of its architecture. A proper architectural definition facilitates not only the system design as a whole but also the development and reuse of components. Component technologies provides a number of advantages for the development of e-learning systems, including modularization, reduced development time, and increased degree of interoperability, portability and maintainability. This paper aims at investigating the application of an architectural model in the development of componentbased e-learning systems. We illustrate the use of this architectural model in the development of a collaborative electronic voting system.
Region-based Image Annotation using Asymmetrical Support Vector Machine-based Multiple-Instance Learning
Authors: Changbo Yang, Ming Dong, Jing Hua
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In region-based image annotation, keywords are usually associated with images instead of individual regions in the training data set. This poses a major challenge for any learning strategy. In this paper, we formulate image annotation as a supervised learning problem under Multiple-Instance Learning (MIL) framework. We present a novel Asymmetrical Support Vector Machine-based MIL algorithm (ASVM-MIL), which extends the conventional Support Vector Machine (SVM) to the MIL setting by introducing asymmetrical loss functions for false positives and false negatives. The proposed ASVM-MIL algorithm is evaluated on both image annotation data sets and the benchmark MUSK data sets.
GOI-Based Information Service Architecture in Grid
Authors: Xiangang Zhao, Bai Wang, Liutong Xu, Nan Du
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Grid Information Service (GIS) provides the function of discovering and monitoring resources, which is the foundation of the grid infrastructure. It is important to ensure its reliability and efficiency. This paper proposes a novel information service architecture based on Group of Interest (GOI) mechanism, which is completely distributed and has high scalability and reliability. In a GOI, all GIS nodes have the uniform view of information by exchanging their information periodically for efficient service discovery and fault-tolerance. A super GIS node is selected in each GOI to take full responsibility for the queries submitted to this GOI. This mechanism can reduce the query distance and enhance the query efficiency. Experimental results show that the mechanism satisfies the expectations.
E-campus: design and implementation of college and faculty digital office system
Authors: Li Hongxin, Ma Gang, Jiang Ming, Cui Lili
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In recent years, a series of circulars about educational informatization issued subsequently by the Ministry of Education have encouraged colleges to build their own E-Campus by means of information technology, which promotes building of the higher education's informatization. Amongst them, college and faculty digital office system is an important part of the E-Campus. This article introduces the college and faculty digital office system developed independently by the E-Commerce College of Dongbei University of Finance & Economics, including the design proposal, system structure and main functions of the system, and several key problems in development and implementation of the system, Meanwhile, it also takes some functions of the system as examples to brief its detailed implementation process.
Protecting the Exchange of Document Images in Cross-Enterprise Process Integration with Web Services
Authors: Dickson K. W. Chiu, Patrick C. K. Hung, Vivying S. Y. Cheng, Eleanna Kafeza
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

There is now an increasing demand for sharing document images and image data for process integration among enterprises. Web services technology has recently been widely proposed and gradually adopted as a platform for supporting integrations. There are so far no holistic solutions to tackle the various protection issues in this area, especially regarding the security and privacy protection requirements in cross-enterprise progress integration. We propose the exchange of document images through a Document Image Exchange Platform (DIEP), replacing ad-hoc and manual exchange practices. We show how contemporary technologies of Web services and watermarking can help archive images with layered implementation architecture. Through dedicated Web services technologies with watermarking mechanism, not only can the development, deployment, and maintenance of software be streamlined, the privacy protection in document image exchanges as required by disparate processes can also be much facilitated.
Solving the Fundamental Problem of Digital Design - A Systematic Review of Design Methods
Authors: Martin Delvai, Andreas Steininger
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

During the last decade various asynchronous circuit structures and design methods have been proposed that seem to be quite different. In essence, however, all these methods contribute to solving the same fundamental design problem in one way or another. In this paper we use a simple communication model to figure out what this fundamental design problem actually is and to highlight its roots. We show how each of the related sub-problems can be conceptually solved in the time domain and in the information domain. Having this model in mind we finally develop a common framework to classify the most popular asynchronous design methods and figure out which sub-problem they actually solve and in which respect they differ from each other.
Compliance Deconstructed
Authors: J. C. Cannon, Marilee Byers
Venue: Queue (2006)

The topic of compliance becomes increasingly complex each year. Dozens of regulatory requirements can affect a company&rsquo;s business processes. Moreover, these requirements are often vague and confusing. When those in charge of compliance are asked if their business processes are in compliance, it is understandably difficult for them to respond succinctly and with confidence. This article looks at how companies can deconstruct compliance, dealing with it in a systematic fashion and applying technology to automate compliance-related business processes. It also looks specifically at how Microsoft approaches compliance to SOX (Sarbanes-Oxley Act of 2002).
Dissecting Contributions of Prefrontal Cortex and Fusiform Face Area to Face Working Memory
Authors: T. Jason Druzgal, Mark D'esposito
Venue: Journal of Cognitive Neuroscience (2003)

Interactions between prefrontal cortex (PFC) and stimulus-specific visual cortical association areas are hypothesized to mediate visual working memory in behaving monkeys. To clarify the roles for homologous regions in humans, event-related fMRI was used to assess neural activity in PFC and fusiform face area (FFA) of subjects performing a delay-recognition task for faces. In both PFC and FFA, activity increased parametrically with memory load during encoding and maintenance of face stimuli, despite quantitative differences in the magnitude of activation. Moreover, timing differences in PFC and FFA activation during memory encoding and retrieval implied a context dependence in the flow of neural information. These results support existing neurophysiological models of visual working memory developed in the nonhuman primate.
SADLBoIB: Self-Adaptive Dynamic Load Balance over InfiniBand
Authors: Yonghao Zhou, Jizhong Han, Jin He, Hongwei Zhang, Zifeng Xiao
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

InfiniBand, as a new industry standard of advanced interconnection architecture for high-performance computing and data-center applications, provides superior performance, QoS, and management features compared with other classic high-speed interconnections, e.g., Myrinet, GigE and etc. However, how to design and implement a load balancing strategy in an InfiniBand connected system which can make full use of the features of InfiniBand has not been deeply explored yet. This paper presents the Self-Adaptive Dynamic Load Balance over InfiniBand (SADLBoIB), a load balancing system which efficiently utilizes RDMA-operation and one-side communication capabilities provided by InfiniBand to dramatically reduce load-balance messages overhead and improve the system reliabilities with a new self-management mechanism. Besides, the multi-level design model of SADLBoIB provides more configurability and customization than normal load-balance systems. Performance evaluation shows that compared with traditional load balancing implementation, SADLBoIB can shorten the communication times at least by half through the one-side communication provided by RDMA operation.
u-Annotate: An Application for User-Driven Freeform Digital Ink Annotation of E-Learning Content
Authors: Mohamed Amine Chatti, Tim Sodhi, Marcus Specht, Ralf Klamma, Roland Klemke
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

User-driven annotation of learning content allows the user to interact with it in a flexible and an intuitive manner and hence personalize the content. This interaction, in most cases, follows the "paper and pen" note-taking paradigm. Though not without its advantages, this paradigm does not scale when the courses are delivered online as web pages. These paper notes are not synchronous with the content, hence may seem out of context, they may be misplaced, and don't make allowances for collaborative learning. In this paper we describe u-Annotate, a user-driven freeform digital ink annotation application for web e- Learning content which aims at facilitating the learner to annotate the online content with the aid of pen computing devices such as graphic tablets, etc. Learners can freely mark up the content, save the annotations for recall at a later date, as well as share these with other learners.