ppxscal/embedding_network huggingface dataset:
Yet another optimal algorithm for 3-edge-connectivity
Authors: Yung H. Tsin
Venue: Journal of Discrete Algorithms (2009)

An optimal algorithm for 3-edge-connectivity is presented. The algorithm performs only one pass over the given graph to determine a set of cut-pairs whose removal leads to the 3-edge-connected components. An additional pass determines all the 3-edge-connected components of the given graph. The algorithm is simple, easy to implement and runs in linear time and space. Experimental results show that it outperforms all the previously known linear-time algorithms for 3-edge-connectivity in determining if a given graph is 3-edge-connected and in determining cut-pairs. Its performance is also among the best in determining the 3-edge-connected components.
On the Local Sensitivity of the Discrete-Time $\cal H_{\infty}$ Control Problem
Authors: A. S. Yonchev, P. Hr. Petkov, N. D. Christov, M. M. Konstantinov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper linear perturbation bounds are obtained for the linear matrix inequalities (LMI) arising in the discrete-time $\cal H_{\infty}$ control problem. The sensitivity analysis of the perturbed LMI is carried out in a similar way as for perturbed matrix equations, after introducing a suitable right hand side which is slightly perturbed.
Creating and sharing clinical decision support content with Web 2.0: Issues and examples
Authors: Adam Wright, David W. Bates, Blackford Middleton, Tonya Hongsermeier, Vipul Kashyap, Sean M. Thomas, Dean F. Sittig
Venue: Journal of Biomedical Informatics (2009)

Clinical decision support is a powerful tool for improving healthcare quality and patient safety. However, developing a comprehensive package of decision support interventions is costly and difficult. If used well, Web 2.0 methods may make it easier and less costly to develop decision support. Web 2.0 is characterized by online communities, open sharing, interactivity and collaboration. Although most previous attempts at sharing clinical decision support content have worked outside of the Web 2.0 framework, several initiatives are beginning to use Web 2.0 to share and collaborate on decision support content. We present case studies of three efforts: the Clinfowiki, a world-accessible wiki for developing decision support content; Partners Healthcare eRooms, web-based tools for developing decision support within a single organization; and Epic Systems Corporation's Community Library, a repository for sharing decision support content for customers of a single clinical system vendor. We evaluate the potential of Web 2.0 technologies to enable collaborative development and sharing of clinical decision support systems through the lens of three case studies; analyzing technical, legal and organizational issues for developers, consumers and organizers of clinical decision support content in Web 2.0. We believe the case for Web 2.0 as a tool for collaborating on clinical decision support content appears strong, particularly for collaborative content development within an organization.
Searching for similar trajectories in spatial networks
Authors: E. Tiakas, A. N. Papadopoulos, A. Nanopoulos, Y. Manolopoulos, Dragan Stojanovic, Slobodanka Djordjevic-Kajan
Venue: Journal of Systems and Software (2009)

In several applications, data objects move on pre-defined spatial networks such as road segments, railways, and invisible air routes. Many of these objects exhibit similarity with respect to their traversed paths, and therefore two objects can be correlated based on their motion similarity. Useful information can be retrieved from these correlations and this knowledge can be used to define similarity classes. In this paper, we study similarity search for moving object trajectories in spatial networks. The problem poses some important challenges, since it is quite different from the case where objects are allowed to move freely in any direction without motion restrictions. New similarity measures should be employed to express similarity between two trajectories that do not necessarily share any common sub-path. We define new similarity measures based on spatial and temporal characteristics of trajectories, such that the notion of similarity in space and time is well expressed, and moreover they satisfy the metric properties. In addition, we demonstrate that similarity range queries in trajectories are efficiently supported by utilizing metric-based access methods, such as M-trees.
Decoupling interaction hardware design using libraries of reusable electronics
Authors: Rajesh Sankaran, Brygg Ullmer, Jagannathan Ramanujam, Karun Kallakuri, Srikanth Jandhyala, Cornelius Toole, Christopher Laan
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper presents our research toward the design and development of a library of electronic hardware modules called Blades and Tiles. Interaction hardware design with blades and tiles provides researchers with considerable flexibility in iterating their designs, decoupling between the domains of electronics, software, firmware and mechanical design. Our approach has been driven by design objectives including hardware reusability, reliability, scalability, and flexibility. We have created a library of blades and tiles, and used them to develop several interaction devices. We present both conceptual and applied aspects and discuss future directions.
Flexible and Secure Logging of Grid Data Access
Authors: Weide Zhang, David Vecchio, Glenn Wasson, Marty Humphrey
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

In Grid collaborations, scientists use middleware to execute computational experiments, visualize results, and securely share data on resources ranging from desktop machines to supercomputers. While there has been significant effort in authentication and authorization for these distributed infrastructures, it is still difficult to determine, post-facto, exactly what information might have been accessed, what operations might have occurred, and for what reasons. To address this problem, we have designed and implemented a secure logging infrastructure for Grid data access. We uniquely leverage and extend XACML with new capabilities so that data owners can specify logging policies and these policies can be used to engage logging mechanisms to record events of interest to the data owners. A case study based on GridFTP.NET is presented and analyzed, utilizing both local storage of log records and remote storage via SAWS, an independently developed secure audit Web service. We show that with relatively little performance overhead, data owners are provided with new flexibility for determining the post-facto conditions under which their Grid data was accessed.
A Network-Based Asymmetric Nash Bargaining Solution
Authors: Edoardo Gallo
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

This paper presents an evolutionary bargaining model between two groups of buyers and sellers. One buyer and one seller are randomly matched to play the Nash demand game: they choose a best reply based on information about past bargains coming from other members of their group. Information arrival is modeled as a Poisson process, and the rates of these processes form a weighted communication network. Over the long run, the stochastically stable division is the asymmetric Nash bargaining solution (ANB) with weights determined by the structure of the communication network in each group. The optimal networks for a group are (quasi)-regular networks without weak links.
Nineteen Urgent Research Topics in Biometrics and Identity Management
Authors: Ben Schouten, Massimo Tistarelli, Carmen Garcia-Mateo, Farzin Deravi, Martin Meints
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

Biometric technologies are being increasingly deployed in practical applications but are currently mainly driven by governmental initiatives, ranging from border control applications to national ID programmes, with increasing social and legal impact on everyday's life. However, biometrics offer wider opportunities and their application as enabling technology for modern identity management systems, having a more user-centred approach, will be more important in the near future. In this paper we give an overview of the most important research topics for Biometrics and Identity Management for the near future.
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
Authors: Simone Bova, Franco Montagna
Venue: Theoretical Computer Science (2009)

Commutative, integral and bounded GBL-algebras form a subvariety of residuated lattices which provides the algebraic semantics of an interesting common fragment of intuitionistic logic and of several fuzzy logics. It is known that both the equational theory and the quasiequational theory of commutative GBL-algebras are decidable (in contrast to the noncommutative case), but their complexity has not been studied yet. In this paper, we prove that both theories are in PSPACE, and that the quasiequational theory is PSPACE-hard.
Recursion in XQuery: put your distributivity safety belt on
Authors: Loredana Afanasiev, Torsten Grust, Maarten Marx, Jan Rittinger, Jens Teubner
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familiar from the context of relational databases. This operator imposes restrictions on the expressible types of recursion, but it is sufficiently versatile to capture a wide range of interesting use cases, including Regular XPath and its core transitive closure operator. While the optimization of general user-defined recursive functions in XQuery appears elusive, we describe how inflationary fixed points can be efficiently evaluated, provided that the recursive XQuery expressions are distributive. We test distributivity syntactically and algebraically, and provide experimental evidence that XQuery processors can benefit substantially from this mode of evaluation.
Multi Modal Verification for Teleservices and Security Applications (MZVTS)
Authors: G. Richard, Y. Menguy, 1. Guis, N. Suaudeau, J. Boudy, P. Lockwood, C. Fernandez, F. Fernandez, C. Kotropoulos, A. Tefas, Pitas, R. Heimgartner, P. Ryser, C. Beumier, P. Verlinde, S. Pigeon, G. Matas, J. Kittler, J. Bigun, Y. Abdeljaoued, E. Meurville, L. Besacier, M. Ansorge, G. Maitre, J. Luettin, S. Ben-Yacoub, B. Ruiz, K. Aldama, J. Cortes
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents the European ACTS project ( MZVTS ), which stands for Multi Modal Verification for Teleservices and Security Applications. The primar) goal of this project is to address the issue of secured access to local and centralised services in a multimedia environment. The main objective is to extend the scope of application of network-based services by adding novel and intelligent functionalities, enabled by automatic verification systems combining multimodal strategies (secured access based on speech, image or other information). The objectives of the project are also to show that limitations of individual technologies (speaker verification, frontal face authentication, profile identification,...) can be overcome b) relying on multi-modal decisions (combination or fLtsion of these technologies).
Incomplete Gröbner basis as a preconditioner for polynomial systems
Authors: Yang Sun, Yu-Hui Tao, Feng-Shan Bai
Venue: Journal of Computational and Applied Mathematics (2009)

Precondition plays a critical role in the numerical methods for large and sparse linear systems. It is also true for nonlinear algebraic systems. In this paper incomplete Grobner basis (IGB) is proposed as a preconditioner of homotopy methods for polynomial systems of equations, which transforms a deficient system into a system with the same finite solutions, but smaller degree. The reduced system can thus be solved faster. Numerical results show the efficiency of the preconditioner.
Performance evaluation of admission control and adaptive modulation in OFDMA WiMax systems
Authors: Salah-Eddine Elayoubi, Benoît Fourestié
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In this paper, we study the performance of multi-cell OFDMA WiMAX systems, in both downlink and uplink. We calculate analytically the number of collisions when the number of users in each cell is known. We then calculate the QoS indicators (e.g., blocking rates, download time and bit error rates) taking into account the physical layer conditions (modulation, propagation and MIMO), the MAC layer techniques (HARQ and radio resource management algorithms) and the traffic characteristics, in a cross-layer approach. We finally evaluate the impact of using adaptive modulation and coding on the overall performance of the system. This analysis allows us to calculate the Erlang capacity of a WiMAX system. Our numerical applications then show how to choose the best admission control and modulation schemes that extend the Erlang capacity region.
Study on Modeling of Container Terminal Logistics System Using Agent-Based Computing and Knowledge Discovery
Authors: Li Bin, Li Wen-Feng, Zhang Yu
Venue: International Journal of Distributed Sensor Networks (2009)

Container terminal is the transfer hinge of land-sea intermodal transportation. Container terminal logistics system (CTLS) is the central handling platform of container logistics in logistics network as the computer system is the core processing node to information flow in internet. Quay side is its “central processing unit (CPU)” of handling platform and storage yard is its “main memory.” CTLS is a highly complex system which includes parallel, negotiation, and competition relations etc. in operation so that this paper introduces agent based computing (ABC) and knowledge discovery in database (KDD) to model CTLS. Logistics, information flow, and decision flow are the kernel of transaction and operation of container terminals which are developing into professional third party logistics (TPL) and seized of enormous business data which are accumulated by the inner information infrastructure and the public electronic commerce (EC) platform. Through the analysis to the handling operation and container logistics of CTLS, we refer to the design thinking of computer organization and architecture and introduce the resource scheduling thinking of the operation system, and draw an analogy between CTLS and parallel computer architecture based on Harvard architecture, map and carve up the production, and scheduling system of CTLS into fourteen kinds of agents: berth allocation agent, quay crane allocation agent, storage yard management agent, yard crane allocation agent, container truck dispatch agent, tugboat dispatch agent, gate house management agent, berth agent, quay crane agent, yard agent, yard crane agent, container truck agent, tugboat agent, and gate house agent according to the entities and their mutual relations. We bring forward the modeling framework of CTLS based on multi-agent and KDD which provides the engine to drive the model accordingly. This modeling thinking and framework, which serves the turn to the queuing theory inherently and possesses the top-ranking flexibility and robustness to the computational intelligence (CI), can help to set down the production scheduling plan and support the important decision-making of the port. A simulation to the quay side is implemented by the AnyLogic 6.2 and SQL Server 2005 and berth allocation based on practical data is given emphasis to discuss. The simulation result precedes the quondam research and actual data to 5.14% and 26.82% through the dynamic priority scheduling. In addition, a series of similar simulations are executed to support the decision on the proportion between berth and quay crane. All verify the feasibility and creditability of the above idea and the effective scheduling strategy in the framework will be further discussed and studied when the container terminal is provided with the multifarious characteristics in the future.
A consensus sampling technique for fast and robust model fitting
Authors: Chia-Ming Cheng, Shang-Hong Lai
Venue: Pattern Recognition (2009)

In this paper, a new algorithm is proposed to improve the efficiency and robustness of random sampling consensus (RANSAC) without prior information about the error scale. Three techniques are developed in an iterative hypothesis-and-evaluation framework. Firstly, we propose a consensus sampling technique to increase the probability of sampling inliers by exploiting the feedback information obtained from the evaluation procedure. Secondly, the preemptive multiple K-th order approximation (PMKA) is developed for efficient model evaluation with unknown error scale. Furthermore, we propose a coarse-to-fine strategy for the robust standard deviation estimation to determine the unknown error scale. Experimental results of the fundamental matrix computation on both simulated and real data are shown to demonstrate the superiority of the proposed algorithm over the previous methods.
A novel sensor localization scheme by mobile actors
Authors: Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplot
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

We propose a localized sensor localization scheme making full use of controlled mobility of a location-aware actor and the connectivity of the sensor network. It contains two new algorithms: a unscented particle filter (UPF) based localization algorithm and an actor mobility scheduling algorithm. The former is an application of UPF. It enables sensor self-localization using received signal strength indicator and actor position. The latter models actor mobility scheduling as traveling salesman problem and aims at fully localized network and minimized time delay. Navigated by sensors, the actor depth-first traverses a local minimum spanning tree of a connected 3-dominating set of the network.
Kinetic sketchup: motion prototyping in the tangible design process
Authors: Amanda Parkes, Hiroshi Ishii
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Physical malleability is emerging as an important element of interaction design as advances in material science and computational control give rise to new possibilities in actuated products and transformable environments. However, this transition also produces a new range of design problems-how do we visualize, imagine, and design the physical processes of transformation? We must create tools for intuitive motion investigation to train and develop our motions sensibilities in 3D space, moving towards interfaces that makes sketching with motion as easy as drawing with paper and pencil? This paper presents Kinetic Sketchup, an approach to a design language for motion prototyping featuring a series of actuated physically programmable modules which investigate the rich interplay of mechanical, behavioral and material design parameters which motion enables.
Multivariate partial fraction expansion
Authors: David R. Stoutemyer
Venue: ACM Communications in Computer Algebra (2009)

The Derive computer-algebra program has Expand as one of the menu choices: The user is prompted for successively less main expansion variables, which can be all of the variables or any proper subset. It is clear how to proceed when the expression is a polynomial: Fully distribute with respect to all expansion variables, but collect as coefficient polynomials all terms that share the same exponents for the expansion variables. Derive uses a partially factored form, so the collected coefficient polynomials can be fortuitously partially factored. For rational expressions the expand function does partial fraction expansion because it is the most useful kind of rational expansion. However, most other computer algebra systems and examples in the literature focus on partial fraction expansion with respect to only one variable, where any other variables are considered mere parameters. For consistency with multivariate polynomial expansion, we wanted a useful and well-defined meaning for multivariate partial fraction expansion. This paper provides such a definition and a corresponding algorithm.
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Authors: Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang
Venue: Information Processing Letters (2009)

The maximum planarization problem is to find a spanning planar subgraph having the largest number of edges for a given graph. In this paper, we propose a self-stabilizing algorithm to solve this problem for complete bipartite networks. The proposed algorithm finds the maximum planar subgraph of 2n-4 edges in O(n) rounds, where n is the number of nodes.
A land mobile satellite communications propagation simulator
Authors: Seong-Youp Suh, Warren L. Stutzman
Venue: Space Communications (1998)

The performance of a mobile satellite communications link depends critically on the propagation path between the satellite and mobile users. Near L-band frequencies the most important factors are multipath propagation and vegetative shadowing. System designers should have reliable information about the statistics of fades and fade duration in order to determine fade margin or to compensate for the fades using coding. This paper describes a simulator, called PROSIM (PROpagation SIMulator), developed at Virginia Tech. for simulating propagation conditions on land mobile links to geostationary earth orbit (GEO) satellites. However, PROSIM can also be used to low earth orbit (LEO) satellites. The simulator uses data from a random number generator to compute statistics of the propagation channel. Performance of the simulator was evaluated by comparing statistics from an analytical model and UHF-band experimental data provided by W. Vogel of University of Texas at Austin and J. Goldhirsh of Johns Hopkins University. New expressions for phasor plot and its mathematical expression for lognormal channel were derived and simulated. Finally, the advantages of the simulator using random number generation in simulating the propagation model are described.
A Free-Form Database Query Language for Mobile Phones
Authors: Rohiza Ahmad, Sameem Abdul-Kareem
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Due to the display area and resource restrictions of small mobile devices, currently, most reported database query systems developed for them are only offering a small set of pre-determined queries that can be posed by users. This not only limits the usage of such systems in their own domain of application, it also prevents them from being used to query other databases. Thus, the abilities to support different query types as well as unplanned queries are essential for these systems in order to make them generic. Hence, this paper presents a new free-form database query language that is suitable for these devices. The language which is used as the query formulation method in a database query system prototype for WAP-enabled mobile phones has been found to be effective based on results from usability tests.