ppxscal/embedding_network huggingface dataset:
On the Effect of Location Uncertainty in Spatial Querying
Authors: Elias Frentzos, Kostas Gratsias, Yannis Theodoridis
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

An emerging topic in the field of spatial data management is the handling of location uncertainty of spatial objects, mainly due to inaccurate measurements. The literature on location uncertainty so far has focused on modifying traditional spatial search algorithms in order to handle the impact of objects' location uncertainty in query results. In this paper, we present the first, to the best of our knowledge, theoretical analysis that estimates the average number of false hits introduced in the results of rectangular range queries in the case of data points uniformly distributed in 2D space. Then, we relax the original distribution assumptions showing how to deal with arbitrarily distributed data points and more realistic location uncertainty distributions. The accuracy of the results of our analytical approach is demonstrated through an extensive experimental study using various synthetic and real datasets. Our proposal can be directly employed in spatial database systems in order to provide users with the accuracy of spatial query results based only on known dataset and query parameters.
Two &#x201c;well-known&#x201d; properties of subgradient optimization
Authors: Kurt M. Anstreicher, Laurence A. Wolsey
Venue: Mathematical Programming: Series A and B (2009)

The subgradient method is both a heavily employed and widely studied algorithm for non-differentiable optimization. Nevertheless, there are some basic properties of subgradient optimization that, while &#x201c;well known&#x201d; to specialists, seem to be rather poorly known in the larger optimization community. This note concerns two such properties, both applicable to subgradient optimization using the divergent series steplength rule. The first involves convergence of the iterative process, and the second deals with the construction of primal estimates when subgradient optimization is applied to maximize the Lagrangian dual of a linear program. The two topics are related in that convergence of the iterates is required to prove correctness of the primal construction scheme.
Office Communicator 2007 Quick Reference Guide
Authors: Beezix Inc
Venue:  (2008)

Laminated quick reference card showing step-by-step instructions and shortcuts for how to use Microsoft Office Communicator 2007. Topics include: Signing In, Online Status, Manually Changing Your Status, Location Status. Adding a Contact, Deleting a Contact, Recent Contacts, Viewing a Contact Card, Receiving Online Status Alerts, Adding a Note to Your Status, Clearing a Status Note, Viewing Other Users' Notes, Creating and Using Groups. Starting a Conversation, Instant Messaging, Marking Conversation as High Importance, Changing Conversation Subject, Hiding the Instant Message Area, Taking Notes on a Conversation in OneNote, Inviting Additional Participants to Your Conversation, Beginning a Call, Beginning a Video Call, Sending a File, Receiving a File, Changing Where your Received Files are Saved, Saving a Conversation, E-Mailing Yourself a Conversation, Finding Previous Conversations. Changing a Contact's Level of Access, E-Mailing a Contact, Changing Contact List Views. Working with Public IM. Beginning a Live Meeting Session. Also includes a list of keyboard shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Superconvergence for Optimal Control Problems Governed by Semi-linear Elliptic Equations
Authors: Yanping Chen, Yongquan Dai
Venue: Journal of Scientific Computing (2009)

In this paper, we will investigate the superconvergence of the finite element approximation for quadratic optimal control problem governed by semi-linear elliptic equations. The state and co-state variables are approximated by the piecewise linear functions and the control variable is approximated by the piecewise constant functions. We derive the superconvergence properties for both the control variable and the state variables. Finally, some numerical examples are given to demonstrate the theoretical results.
Multi-layer global routing considering via and wire capacities
Authors: Chin-Hsiung Hsu, Huang-Yu Chen, Yao-Wen Chang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Global routing for modern large-scale circuit designs has attracted much attention in the recent literature. Most of the state-of-the-art academic global routers just work on a simplified routing congestion model that ignores the essential via capacity for routing through multiple metal layers. Such a simplified model would easily cause fatal routability problems in subsequent detailed routing. To remedy this deficiency, we present in this paper a more effective congestion metric that considers both the in-tile nets and the residual via capacity for global routing. With this congestion metric, we develop a new global router that features two novel routing algorithms for congestion optimization, namely least-flexibility-first routing and multi-source multi-sink escaping-point routing. The least-flexibility-first routing processes the nets with the least flexibility first, facilitating a quick prediction of congestion hot spots for the subsequent nets. Enjoying lower time complexity than traditional maze and A*-search routing, in particular, the linear-time escaping-point routing guarantees to find the optimal solution and achieves the theoretical lower-bound time complexity. Experimental results show that our global router can achieve very high-quality routing solutions with more reasonable via usage, which can benefit and correctly guide subsequent detailed routing.
A note on the Greedy algorithm for finding independent sets of Ck-free graphs
Authors: Ippei Koura, Takao Ono, Tomio Hirata
Venue: Information Processing Letters (2009)

The independent set problem is known to be NP-hard. A fundamental theorem of Turan [P. Turan, On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941) 436-452] states that any graph with n vertices and average degree d@? contains an independent set of size at least n/(d@?+1), which is known as Turan bound. The greedy algorithm with minimum-degree pivoting rule is well-known method for attaining Turan bound. Based on this result, Hochbaum [D.S. Hochbaum, Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1997, pp. 94-143] showed that the greedy algorithm combined with LP attains performance ratio (d@?+1)/2. This paper shows that if the input graph is assumed to be C"k-free then the greedy algorithm obtains an independent set of size at least 2n/(d@?+1+k). It also proves that the LP-based algorithm has the performance ratio (d@?+1+k)/4.
Enforcing code security in database web applications using libraries and object models
Authors: Nicolas Juillerat
Venue: Proceedings of the 2007 Symposium on Library-Centric Software Design (2007)

Libraries are commonly though as toolboxes offering reusable components and algorithms. In this paper, we show that a properly designed library can also be used to enforce security, and hence to help in the creation of robust and secure applications. As an illustration, we choose database web applications, because they are the kind of applications that suffers from the highest amount of vulnerabilities. SQL injection or Cross Site Scripting are common examples. We present how a library can be designed in such a way to completely mitigate these vulnerabilities. We also show how a properly designed library does not only allow a programmer to write secure code, but can also make vulnerable code impossible to write. We validate our theories through the presentation of a concrete Java library named "Stones" that follows and applies our ideas. Finally, our approach is compared with related work and various practical results are stated.
Optimization of multiple input single output fuzzy membership functions using clonal selection algorithm
Authors: Ayse Merve Acilar, Ahmet Arslan
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

A clonal selection algorithm (CLONALG) inspires from Clonal Selection Principle used to explain the basic features of an adaptive immune response to an antigenic stimulus. In this study, a new method is proposed for optimization of the Multiple Input Single Output (MISO) fuzzy membership functions using CLONALG. The most appropriate placement of membership functions with respect to fuzzy variables can be determined using our method for a fuzzy system whose rules table and shape of membership functions were given previously. Also, how the membership functions compute as a parameter optimization problem using CLONALG is descried for MISO fuzzy system on an illustrative example.
Performance investigation of CDMA/PRMA with power control in TDD multimedia cellular networks
Authors: Xue Jun Li, Peter Han Joo Chong
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Packet reservation multiple access (PRMA) is a famous packet switching based medium access control (MAC) for its high multiplexing gain, which is further enhanced by jointly using code-division multiple access (CDMA). In most studies on CDMA/PRMA for uplink time-division duplexing (TDD) cellular networks, perfect power control is assumed and each time slot is divided into fixed number of code slots. It is always assumed that this capacity of a time slot can be fully utilized. However, in practice the mobile stations (MSs) have limited transmit power levels, which will limit the system capacity. In this Paper, we investigate the impact of limited transmit power levels on the performance of CDMA/PRMA and propose a practical power control algorithm. Multimedia traffic is considered, which consists of conventional voice traffic and worldwide web (WWW) browsing traffic. Simulation results reveal that the performance of CDMA/PRMA in cellular networks degrades as the cell radius increases and for small cell radius (e.g. &le; 750m), it provides good system capacity even when multimedia traffic is present.
SCOPES: Smart Cameras Object Position Estimation System
Authors: Ankur Kamthe, Lun Jiang, Matthew Dudys, Alberto Cerpa
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Wireless camera sensor networks have to balance the conflicting challenges imposed by the detection performance, latency and lifetime requirements in surveillance applications. While previous studies for camera sensor networks have addressed these issues separately, they have not quantified the trade-offs between these requirements. In this paper, we discuss the design and implementation of SCOPES, a distributed Smart Camera Object Position Estimation System that balances the trade-offs associated with camera sensor networks. The main contribution of the paper is the extensive evaluation of parameters affecting the performance of the system through analysis, simulation and experimentation in real-life conditions. Our results demonstrates the effectiveness of SCOPES, which achieves detection probabilities ranging from 84% to 98% and detection latencies from 10 seconds to 18 seconds. Moreover, by using coordination schemes, the detection performance of SCOPES was improved with increased system lifetime. SCOPES highlights that intelligent system design can compensate for resource-constrained hardware and computationally simple data processing algorithms.
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems
Authors: Yunhong Zhou, Deeparnab Chakrabarty, Rajan Lukose
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both deterministic and randomized algorithms for the online (multiple-choice) knapsack problems achieving a provably optimal competitive ratio. This translates back to fully automatic bidding strategies maximizing either profit or revenue for the budget-constrained advertiser. Our bidding strategy for revenue maximization is oblivious (i.e., without knowledge) of other bidders' prices and/or clickthrough-rates for those positions. We evaluate our bidding algorithms using both synthetic data and real bidding data gathered manually, and also discuss a sniping heuristic that strictly improves bidding performance. With sniping and parameter tuning enabled, our bidding algorithms can achieve a performance ratio above 90% against the optimum by the omniscient bidder.
Feature Dependency Modeling for Software Product Line
Authors: Daizhong Luo, Shanhui Diao
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Feature dependency Modeling describes model of mutual constraints among features. It is essential activities for development of software product line. This paper introduces local dependency and global dependency of feature. With analyzing relationship of feature dependency, we propose an approach of feature dependency modeling. It not only provides specification of local dependency such as decomposition and generalization, but also provides global dependency modeling such as configuration dependency, operational dependency and impact dependency. Finally a case study of feature dependency modeling in air-condition controlling software product line is presented to demonstrate our method.
Cross-layer bandwidth and power allocation for a two-hop link in wireless mesh network
Authors: Peng Cheng, Zhaoyang Zhang, Guanding Yu, Hsiao-Hwa Chen, Peiliang Qiu
Venue: Wireless Communications Mobile Computing (2009)

In this paper, a cross-layer analytical framework is proposed to analyze the throughput and packet delay of a two-hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady-state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non-Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi-hop links. Furthermore, based on the above proposed cross-layer framework, we consider the problem of optimal power and bandwidth allocation for QoS-guaranteed services in a two-hop wireless link, where the total power and bandwidth resources are both sum-constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright &copy; 2008 John Wiley & Sons, Ltd. This paper was presented in part at IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Helsinki, Finland, September 11&mdash;14, 2006.
Nonnegative matrix factorization with the itakura-saito divergence: With application to music analysis
Authors: Cédric Févotte, Nancy Bertin, Jean-Louis Durrieu
Venue: Neural Computation (2009)

This letter presents theoretical, algorithmic, and experimental results about nonnegative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. We describe how IS-NMF is underlaid by a well-defined statistical model of superimposed gaussian components and is equivalent to maximum likelihood estimation of variance parameters. This setting can accommodate regularization constraints on the factors through Bayesian priors. In particular, inverse-gamma and gamma Markov chain priors are considered in this work. Estimation can be carried out using a space-alternating generalized expectation-maximization (SAGE) algorithm; this leads to a novel type of NMF algorithm, whose convergence to a stationary point of the IS cost function is guaranteed. We also discuss the links between the IS divergence and other cost functions used in NMF, in particular, the Euclidean distance and the generalized Kullback-Leibler (KL) divergence. As such, we describe how IS-NMF can also be performed using a gradient multiplicative algorithm (a standard algorithm structure in NMF) whose convergence is observed in practice, though not proven. Finally, we report a furnished experimental comparative study of Euclidean-NMF, KL-NMF, and IS-NMF algorithms applied to the power spectrogram of a short piano sequence recorded in real conditions, with various initializations and model orders. Then we show how IS-NMF can successfully be employed for denoising and upmix (mono to stereo conversion) of an original piece of early jazz music. These experiments indicate that IS-NMF correctly captures the semantics of audio and is better suited to the representation of music signals than NMF with the usual Euclidean and KL costs.
Cognitive architecture for perception-reaction intelligent computer agents (CAPRICA)
Authors: Dustin B. Chertoff, Sandy Vanderbleek, Stephen M. Fiore, Shaun Gallagher
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

In this paper, we introduce a cognitive agent architecture that can be used in the study of Human-Robot Interaction. The Cognitive Architecture for Perception-Reaction Intelligent Computer Agents (CAPRICA) is an extensible agent library built around the ideas of theory of mind, episodic memory, and embodied cognition. Existing agent research in each of these areas was used to formulate design requirements. We provide an overview of the library's design and discuss future work in progress.
A rough set based QFD approach to the management of imprecise design information in product development
Authors: Lian-Yin Zhai, Li-Pheng Khoo, Zhao-Wei Zhong
Venue: Advanced Engineering Informatics (2009)

Intense competition and sophisticated customer needs have resulted in the development of more complex products with a shorter lead time to market. One of the key factors in product development concerns the understanding and management of complex relationships between customers' needs and technical requirements. Usually these complex relationships are expressed using imprecise descriptions in the form of natural linguistic terms. Frequently, quality function deployment (QFD) is employed to manage design information and assist decision-making in human centered product development. This work proposes a rough set based QFD approach to manage the aforementioned imprecise design information in product development. A novel concept known as rough number^*, which is derived from the basic notions of rough sets, is proposed to manage the imprecise design information in QFD analysis. A case study on a bicycle design is used to illustrate the approach proposed. The result shows that the new approach proposed can effectively manage the imprecise design information and facilitate decision-making in product development.
CrossBeam, Principles and Application
Authors: Antonio Casares, Peter Gnauck
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

The use of the focused ion beam (FIB) systems has increased to a high level in recent years [1]. The imaging, milling, and deposition capabilities of the FIB make it the ideal instrument for e. g. site-specific failure analysis, specimen preparation and nano-machining. Ion channelling contrast allows for selective imaging of polycrystalline and poly-phase microstructures. In addition, the FIB and CrossBeam® instruments are unique stand-alone analytical tools. Their vast capabilities have enabled numerous applications into the semiconductor and materials sciences applications. These integrated CrossBeam® Tools enable the observation and direct control of the FIB operation in real time. In addition to the improved accuracy and resolution the electron beam adds analytical capabilities as STEM, EDS and EBSP to the instruments.
Diagnosing integrator leakage of single-bit first-order &Delta;&Sigma; modulator using DC input
Authors: Xuan-Lun Huang, Chen-Yuan Yang, Jiun-Lang Huang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Integrator leakage is a dominant factor in the SNR (signal-to-noise ratio) loss of &Delta;&Sigma; modulators. In this paper, we propose a Design-for-Test (DfT) technique to diagnose the integrator leakage of the single-bit first-order &Delta;&Sigma; modulator. The proposed technique is a low-cost solution; it only adds two multiplexers to the modulator, utilizes a single DC voltage as the test stimulus, and estimates the integrator leakage by analyzing the digitized bit stream. Furthermore, the technique can be easily extended to higher order &Delta;&Sigma; modulators. Simulation results show that accurate estimations of the integrator leakage can be achieved even at the presence of noise.
On the use of pseudo-spectral method in model reduction and simulation of active dendrites
Authors: Donggyun Shin, Dae Ryook Yang, Jinhoon Choi
Venue: Computers in Biology and Medicine (2009)

Most of dendrites in the central nervous system are now known to have active channels. These active dendrites play important roles not only in signal summation but also in computation. For the simulation of these important active dendrites, the compartment model based on the finite volume or finite difference discretization was mainly adopted. In this paper, we employ the Chebychev pseudo-spectral method well developed in computational physics, and demonstrate that it can achieve a higher precision with the same number of equations than the compartment model. Moreover, it is also shown that the Chebychev pseudo-spectral method converges faster to attain a given precision. Hence, for the simulations of active dendrites, the Chebychev pseudo-spectral method can be an attractive alternative to the compartment model since it leads to a low order model with higher precision or converges faster for a given precision.
Model Checking Strategic Equilibria
Authors: Nicolas Troquard, Wiebe Hoek, Michael Wooldridge
Venue: Model Checking and Artificial Intelligence: 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers (2009)

Solutions concepts are a fundamental tool for the analysis of game-like systems, and as a consequence, much effort has been devoted to the problem of characterising solution concepts using logic. However, one problem is that, to characterise solution concepts such as Nash equilibrium, it seems necessary to refer to strategies in the object language, which tends to complicate the object language. We propose a logic in which we can formulate important properties of games (and in particular pure-strategy solution concepts) without recourse to naming strategies in the object language. The idea is that instead of using predicates which state that a particular collection of strategies forms a solution, we define formulae of the logic that are true at a state if and only if this state constitutes a particular equilibrium outcome. We demonstrate the logic by model checking equilibria of strategic games.