ppxscal/embedding_network huggingface dataset:
A QoS extension for next step in signaling in mobile IPv6 environment
Authors: Zhang Lin, Liao Peizhen, Sahibzada Ahmed Noor
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In this paper, we introduce an end-to-end QoS provisioning mechanism based on NSIS (Next Step In Signaling) protocol suite in mobile IPv6 environment. Resource reservation on the new path must be done as quickly as possible after handover event for the Mobile Node (MN) which is especially important when real-time applications are used. We focus on end-to-end procedure for a fast QoS re-establishment, the basic idea of which is to reduce the time between the handover event and the NSIS state re-establishment on the new path. It is designed to send the NSIS signaling message together with Binding Update (BU)/Binding Acknowledgement (BA) after handover, in order to avoid wasting time to wait for mobility detecting. We propose to buffer at the CRossover Node (CRN) the packets directed to the Mobile Node during the handover. In this way the total QoS re-establishment time is reduced. Moreover, we list the issues it may meet during the handover process, the CRN discovery, IP-in-IP problem, double-reservation problem, etc., according to which we also propose relevant solutions.
Towards a simplification of the bug report form in eclipse
Authors: Israel Herraiz, Daniel M. German, Jesus M. Gonzalez-Barahona, Gregorio Robles
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

We believe that the bug report form of Eclipse contains too many fields, and that for some fields, there are too many options. In this MSR challenge report, we focus in the case of the severity field. That field contains seven different levels of severity. Some of them seem very similar, and it is hard to distinguish among them. Users assign severity, and developers give priority to the reports depending on their severity. However, if users can not distinguish well among the various severity options, they will probably assign different priorities to bugs that require the same priority. We study the mean time to close bugs reported in Eclipse, and how the severity assigned by users affects this time. The results shows that classifying by time to close, there are less clusters of bugs than levels of severity. We therefore conclude that there is a need to make a simpler bug report form.
.NET database programmability and extensibility in microsoft SQL server
Authors: José A. Blakeley, Vineet Rao, Isaac Kunen, Adam Prout, Mat Henaire, Christian Kleinerman
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The integration of the .NET Common Language Runtime (CLR) into the SQL Server DBMS enables rich business logic written in modern .NET languages to run close to the data. Database application developers can write business logic as functions, stored procedures, and triggers. They can also extend the native capabilities of the DBMS by adding new scalar data types, and aggregates. A previous paper [2] described the architecture and design principles of the integration of the CLR inside SQL Server. Here we present new aspects of this work. First, we describe the extensibility contracts for user-defined types and aggregates in detail. Second, we present the advances to the CLR integration in SQL Server 2008 which significantly enhances the breath of applications supported by SQL Server. In particular, we describe the support for large (greater than 8000 byte) user-defined types and aggregates, multiple-input user-defined aggregates, and order-aware table valued functions. Third, we show how we leveraged scalar type extensibility to provide a hierarchical identifier data type that enables encoding of keys describing hierarchies as well as built-in support for spatial applications. This support includes both flat- and round-earth spatial types, as well as a spatial index. Fourth, we present how we use Language Integrated Query (LINQ) enhancements in .NET languages to improve developer productivity when creating routines that require data access. Finally, we present preliminary performance results showing the efficiency of streaming TVFs and aggregates relative to equivalent native features.
All-plastic distributed pressure sensors: taylor-made performance by electroactive materials design
Authors: Estibalitz Ochoteco, Jose A. Pomposo, Tomasz Sikora, Fernando Vidal, Fernando Martinez, Gregorio Obieta, Hans Grande
Venue: Microsystem Technologies (2008)

A new technology of flexible all-plastic pressure sensors is developed using conducting polymers as electroactive materials on plastic substrates. The lithographically patterning of one of the conducting sheets being part of the device makes feasible the construction of a distributed pressure sensor giving not only the quantitative pressure information but also its spatial distribution. A response time as low as 2&#x00a0;ms, and a lifetime over 1 millions of actuations are obtained. The first demonstrators work in pressure ranges from 30 to 1,200&#x00a0;g/cm2. These working pressure ranges can be adjusted, on the one hand by the proper spatial design of conducting and non-conducting paths; on the other hand, by the adequate design of the electroactive material in terms of conductivity, film morphology and composition. The present paper describes the development of an innovative, low cost and flexible technology opening interesting potential opportunities for high-surface applications.
Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs
Authors: E. Dahlhaus
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

G.A. Dirac's classical theorem (1952) asserts that if every vertex of a graph G on n vertices has degree at least n/2, the G has a Hamiltonian cycle. A fast parallel algorithm on a concurrent-read-exclusive-write parallel random-access machine (CREW PRAM) is given to find a Hamiltonian cycle in such graphs. The algorithm uses a linear number of processors and is optimal up to a polylogarithmic factor. It works in O(log/sup 4/n) parallel time and uses linear number of processors on a CREW PRAM. It is also proved that a perfect matching in dense graphs can be found in NC/sup 2/. The cost of improved time is a quadratic number of processors. It is also proved that finding an NC algorithm for perfect matching in slightly less dense graphs is as hard as the same problem for all graphs, and the problem of finding a Hamiltonian cycle becomes NP-complete.
Simulate the State Changing of a Descriptor System in (Almost) Zero Time Using the Normal Probability Distribution
Authors: Grigoris I. Kalogeropoulos, Athanasios A. Karageorgos, Athanasios A. Pantelous
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In number of control applications, the ability of manipulate the state vector from the input is more than vital. Thus, in the present paper, we develop analytically a methodology for the state changing of a linear control descriptor differential system based also on a linear combination of Dirac δ-function and its derivatives. Using linear algebra techniques and the generalized inverse theory, the input’s coefficients are determined. In our practical numerical application, the Dirac distribution is approximated by the normal probability distribution.
A service-oriented virtual community overlay network for secure external service orchestration
Authors: Shudong Chen, Johan Lukkien
Venue: Proceedings of the 5th international workshop on Middleware for pervasive and ad-hoc computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

The Service Oriented Architecture (SOA) is used extensively in ubiquitous computing environments. Using external service orchestration, services can be composed into applications. Since cooperation takes place between services that are scattered over the Internet and belong to different parties, there is a growing need to protect the ownership of service providers and keep the security of communication messages in service composition. This paper shows the details of a service-oriented virtual community overlay network designed for secure external service orchestration. It can also provide contracted QoS guarantees that will definitely affect the overall performance of ubiquitous applications. Further, it highlights the working principle of access control policies as well as a service behavior monitoring mechanism using an example scenario.
Robust solution of monotone stochastic linear complementarity problems
Authors: Xiaojun Chen, Chao Zhang, Masao Fukushima
Venue: Mathematical Programming: Series A and B (2008)

We consider the stochastic linear complementarity problem (SLCP) involving a random matrix whose expectation matrix is positive semi-definite. We show that the expected residual minimization (ERM) formulation of this problem has a nonempty and bounded solution set if the expected value (EV) formulation, which reduces to the LCP with the positive semi-definite expectation matrix, has a nonempty and bounded solution set. We give a new error bound for the monotone LCP and use it to show that solutions of the ERM formulation are robust in the sense that they may have a minimum sensitivity with respect to random parameter variations in SLCP. Numerical examples including a stochastic traffic equilibrium problem are given to illustrate the characteristics of the solutions.
Recovering from errors during programming by demonstration
Authors: Jiun-Hung Chen, Daniel S. Weld
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Many end-users wish to customize their applications, automating common tasks and routines. Unfortunately, this automation is difficult today --- users must choose between brittle macros and complex scripting languages. Programming by demonstration (PBD) offers a middle ground, allowing users to demonstrate a procedure multiple times and generalizing the requisite behavior with machine learning. Unfortunately, many PBD systems are almost as brittle as macro recorders, offering few ways for a user to control the learning process or correct the demonstrations used as training examples. This paper presents CHINLE, a system which automatically constructs PBD systems for applications based on their interface specification. The resulting PBD systems have novel interaction and visualization methods, which allow the user to easily monitor and guide the learning process, facilitating error recovery during training. CHINLE-constructed PBD systems learn procedures with conditionals and perform partial learning if the procedure is too complex to learn completely.
Suffix Array for Large Alphabet
Authors: Radovan esták, Jan Lánský, Michal emlicka
Venue: Proceedings of the Data Compression Conference (2008)

Burrows-Wheeler Transform (BWT) is used as the main part in block compression which has a good balance of speed and compression ratio. Suffix arrays are used in the coding phase of BWT and we focus on creating them for an alphabet larger than 256 symbols. The motivation for this work has been software project XBW-- an application for compression of large XML files using word- and syllable-based BWT. The role of BWT is to reorder input before applying other algorithms. We describe and implement three families of algorithms for encoding. The first is inspired by the work of Sadakane and further improved by Larsson. The second family includes algorithm by Seward and algorithm by Itoh further improved by Kao. Finally we present algorithm by Karkkainen and Sanders for constructing suffix arrays in linear time.
Change detection technique based on the radiometric rotation controlled by no-change axis, applied on a semi-arid landscape
Authors: F. D. Maldonado, J. R. Santos, P. M. L. Graça
Venue: International Journal of Remote Sensing (2007)

We demonstrate a new digital technique for change detection that integrates field survey data in a methodology. The field survey was specifically designed to control the operation of this new technique for change detection. The Radiometric Rotation Controlled by No-change Axis (RCNA) technique was applied with spectral bands in the visible spectral range without atmospheric correction. The 190.37 km2 study area is located in the centre of the semi-arid region of northeast Brazil. This region is occupied by a natural shrub vegetation and low arboreal type steppe. This is known locally as 'caatinga', and in this area the predominant use is grazing by cattle and goat. Two TM/Landsat images in digital format of the dry seasons of 1984 and 1996 were used together with two ETM+ /Landsat images for the dry seasons of 1999 and 2001. Three change maps were generated, all with accuracy index values of around 0.70, which is acceptable for areas with complex patterns like semi-arid lands. In conclusion, there is no need to apply atmospheric correction methods to a pair of multi-temporal images to obtain an acceptable accuracy of change detection in semi-arid regions. Although this technique can combine images from different sensors, this requires that both have similar spectral ranges.
Scaling the fractional advective-dispersive equation for numerical evaluation of microbial dynamics in confined geometries with sticky boundaries
Authors: R. Parashar, J. H. Cushman
Venue: Journal of Computational Physics (2008)

Microbial motility is often characterized by 'run and tumble' behavior which consists of bacteria making sequences of runs followed by tumbles (random changes in direction). As a superset of Brownian motion, Levy motion seems to describe such a motility pattern. The Eulerian (Fokker-Planck) equation describing these motions is similar to the classical advection-diffusion equation except that the order of highest derivative is fractional, @a@?(0,2]. The Lagrangian equation, driven by a Levy measure with drift, is stochastic and employed to numerically explore the dynamics of microbes in a flow cell with sticky boundaries. The Eulerian equation is used to non-dimensionalize parameters. The amount of sorbed time on the boundaries is modeled as a random variable that can vary over a wide range of values. Salient features of first passage time are studied with respect to scaled parameters.
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
Authors: D. Halperin
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We consider the problem of planning the motion of an arbitrary k-sided polygonal robot B, free to translate and rotate in a polygonal environment V bounded by n edges. We show that the combinatorial complexity of a single connected component of the free configuration space of B is k/sup 3/n/sup 2/2/sup O(log(2/3)/ n). This is a significant improvement of the naive bound O((kn)/sup 3/); when k is constant, which is often the case in practice, this yields a near-quadratic bound on the complexity of such a component, which almost settles (in this special case) a long-standing conjecture regarding the complexity of a single cell in a three-dimensional arrangement of surfaces. We also present an algorithm that constructs a single component of the free configuration space of B in time O(n/sup 2+/spl epsi//), for any /spl epsi/>0, assuming B has a constant number of sides. This algorithm, combined with some standard techniques in motion planning, yields a solution to the underlying motion planning problem, within the same asymptotic running time.
Domain reconstruction using photothermal techniques
Authors: Ana Carpio, María-Luisa Rapún
Venue: Journal of Computational Physics (2008)

A numerical method to detect objects buried in a medium by surface thermal measurements is presented. We propose a new approach combining the use of topological derivatives and Laplace transforms. The original optimization problem with time-dependent constraints is replaced by an equivalent problem with stationary constraints by means of Laplace transforms. The first step in the reconstruction scheme consists in discretizing the inversion formula to produce an approximate optimization problem with a finite set of constraints. Then, an explicit expression for the topological derivative of the approximate shape functional is given. This formula is evaluated at low cost using explicit expressions of the forward and adjoint fields involved. We apply this technique to a simple shape reconstruction problem set in a half space. Good approximations of the number, location and size of the obstacles are obtained. The description of their shapes can be improved by more expensive hybrid methods combining time averaging with topological derivative based iterative schemes.
PLURAL: checking protocol compliance under aliasing
Authors: Kevin Bierhoff, Jonathan Aldrich
Venue: Companion of the 30th international conference on Software engineering (2008)

Enforcing compliance to API usage protocols is notoriously hard due to possible aliasing of objects through multiple references. In previous work we proposed a sound, modular approach to checking protocol compliance based on typestates that offers a great deal of flexibility in aliasing. In our approach, API protocols are defined based on typestates. Every reference is associated with a permission, and reasoning about permissions is appropriately conservative for the "degree" of possible aliasing admitted by a permission. This paper describes Plural, a tool to automatically enforce typestate-based protocols using permissions in Java. API developers can specify protocols with simple annotations on methods and method parameters. A static flow analysis tracks permissions in code that uses specified APIs and issues warnings for possible protocol violations.
Clarification of Assumptions in the Relationship between the Bayes Decision Rule and the Whitened Cosine Similarity Measure
Authors: Chengjun Liu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

This paper first clarifies Assumption 3 (which misses a constant) and Assumption 4 (where the whitened pattern vectors refer to the whitened means) in paper "The Bayes Decision Rule Induced Similarity Measures" (IEEE Transactions on Pattern Analysis and Machine Intelligence), vol. 29, no. 6, pp. 1086-1090, 2007), and then provides examples to show that the assumptions after the clarification are consistent.
Degenerate problem of stabilization of a specified trajectory
Authors: M. Yu. Ukhin
Venue: Automation and Remote Control (2008)

Consideration is given to the problem of stabilization of a specified (supporting) mode as a degenerate problem of minimization of the root-mean-square deviation from it where there are no deviations of control actions. This formulation makes it possible to completely use available limited control resources for stabilization. We propose a method of approximate optimal synthesis in the neighborhood of a turnpike manifold that is obtained as a solution in the form of optimal synthesis of linearly quadratic problem with unbounded linear control. The investigation is performed for a linearized discrete model of the controlled system; however, the obtained stabilizing control can be applied in the initial nonlinear system directly or after the correction by regular iterations.
Home station, novel architecture of home gateway and its implementations
Authors: Kwang-Soon Choi, Seung-Ok Lim, Young-Choong Park, Kwang-Mo Jung
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Although a number of home networking solutions such as wired and wireless technologies, middleware technologies, and home gateway technologies have been emerging, none of them dominates the home networking market with satisfying users' demand on higher quality services. Especially in the home networking environments where diverse technologies coexist, the digital convergence is the important functionality that a home gateway should support. In this paper, Home Station, a novel architecture of home gateway, that can solve this problem and serve various functions including process of multimedia data, control and monitor of devices, discovery of devices, and management of home network, is proposed.
Robust Kalman filter of continuous-time Markov jump linear systems based on state estimation performance
Authors: Xiaobo Xiao, Hongsheng Xi, Jin Zhu, Haibo Ji
Venue: International Journal of Systems Science (2008)

Robust Kalman filtering problem for a class of continuous-time Markov jump linear systems with uncertain second-order statistical properties is investigated. Uncertainty is modeled by allowing process and observation noises spectral density matrices to vary arbitrarily within given classes. The upper bounds of the perturbation to the noise covariance matrices are given based on the estimation error performance, and a steady-state estimator is therefore adopted under the worst situation. Not only can this method minimize the worst performance function of the uncertainty, but the error performance can be guaranteed to be within a given bound. Finally the developed theory is illustrated by a numerical example.
Interactive techniques for reducing color breakup
Authors: Wei-Chung Cheng
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

Despite its 3X optical efficiency, 3X pixel resolution, and 20% cost reduction, the field-sequential liquid crystal display (LCD) suffers from the color breakup phenomenon (CBU), which occurs when the red, green, and blue components of the same object project onto different retinal areas upon eye movement. To measure the human vision sensitivity to CBU, we conducted psychophysical experiments based on a linear dual-color saccadic display. To suppress CBU, we designed an electrooculogram (EOG) circuit to detect the saccadic eye movement. When saccades are detected, the contingent display reduces the image chroma on-the-fly by modulating the red/green/blue LED backlights such that the CBU artifacts are unperceivable. Otherwise, the contingent display stays in the normal mode to offer the best image quality. It is a pioneering work using brain-machine interface to solve the long pending challenge to the field-sequential LCD.