ppxscal/embedding_network huggingface dataset:
Approximation algorithms for network design with metric costs
Authors: Joseph Cheriyan, Adrian Vetta
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We study undirected networks with edge costs that satisfy the triangle inequality. Let n denote the number of nodes. We present an O(1)-approximation algorithm for a generalization of the metric-cost subset k-node-connectivity problem. Our approximation guarantee is proved via lower bounds that apply to the simple edge-connectivity version of the problem, where the requirements are for edge-disjoint paths rather than for openly node-disjoint paths. A corollary is that, for metric costs and for each k=1,2,…,n-1, there exists a k-node connected graph whose cost is within a factor of 24 of the cost of any simple k-edge connected graph. This resolves an open question in the area. Based on our O(1)-approximation algorithm, we present an O(log rmax)-approximation algorithm for the node-connectivity survivable network design problem where rmax denotes the maximum requirement over all pairs of nodes. Our results contrast with the case of edge costs of zero or one, where Kortsarz et al. [20]recently proved, assuming NP⊈, quasi-P, a hardness-of-approximation lower bound of 2log 1-εn for the subset k-node-connectivity problem, where ε denotes a small positive number.
Software Engineering Theory in Practice
Authors: Johann Rost
Venue: IEEE Software (2005)

Whether software engineering "best practices" really are the best depends on the type of project. Applying them could actually cause harm in some cases.
Semantic virtual environments
Authors: Karsten A. Otto
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Today's Virtual Environment (VE) systems share a number of issues with the HTML-based World Wide Web. Their content is usually designed for presentation to humans, and thus is not suitable for machine access. This is complicated by the large number of different data models and network protocols in use. Accordingly, it is difficult to develop VE software, such as agents, services, and tools.In this paper we adopt the Semantic Web idea to the field of virtual environments. Using the Resource Description Framework (RDF) we establish a machine-understandable abstraction of existing VE systems --- the Semantic Virtual Environments (SVE). On this basis it is possible to develop system-independent software, which could even operate across VE system boundaries.
Domain and language evaluation results
Authors: Mary Ellen Okurowski
Venue: Proceedings of the 5th conference on Message understanding (1993)

The Fifth Message Understanding Conference (MUC-5) focused on the task of data extraction for two distinctly different applications, one within the domain of joint ventures (JV) and the other within the domain of microelectronics (ME). For each application, the task could be performed in either English and/or Japanese, giving four combinations: English Joint Ventures, Japanese Joint Ventures, English Microelectronics, and Japanese Microelectronics.
iCheck Series: iCheck Express Microsoft Excel 2003, Student Edition, 1 edition
Venue:  (2005)

iCheck Express Excel 2003 was written specifically for high school students. It is age-level and interest-level appropriate. Projects incorporate real-world business situations and cross-curricular academics. Leveled activities and projects help beginning and advanced students practice and reinforce skills. An Annotated Teacher’s Edition provides point of use instruction and helpful teaching strategies for all student skill levels. This book covers Microsoft Office Exam objectives for Excel 2003 Specialist and Excel 2003 Expert.
An efficient sequential quadratic programming algorithm for nonlinear programming
Authors: Zhibin Zhu
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, a new feasible sequential quadratic programming (FSQP) algorithm is proposed to solve the nonlinear programming, where a feasible descent direction is obtained by solving only one QP subproblem. In order to avoid Maratos effect, a high-order revised direction is computed by solving a linear system with involving some "active" constraints. The Theoretical analysis shows that global and superlinear convergence can be deduced.
XML stream processing using tree-edit distance embeddings
Authors: Minos Garofalakis, Amit Kumar
Venue: ACM Transactions on Database Systems (TODS) (2005)

We propose the first known solution to the problem of correlating, in small space, continuous streams of XML data through approximate (structure and content) matching, as defined by a general tree-edit distance metric. The key element of our solution is a novel algorithm for obliviously embedding tree-edit distance metrics into an L1 vector space while guaranteeing a (worst-case) upper bound of O(log2n log&ast;n) on the distance distortion between any data trees with at most n nodes. We demonstrate how our embedding algorithm can be applied in conjunction with known random sketching techniques to (1) build a compact synopsis of a massive, streaming XML data tree that can be used as a concise surrogate for the full tree in approximate tree-edit distance computations; and (2) approximate the result of tree-edit-distance similarity joins over continuous XML document streams. Experimental results from an empirical study with both synthetic and real-life XML data trees validate our approach, demonstrating that the average-case behavior of our embedding techniques is much better than what would be predicted from our theoretical worst-case distortion bounds. To the best of our knowledge, these are the first algorithmic results on low-distortion embeddings for tree-edit distance metrics, and on correlating (e.g., through similarity joins) XML data in the streaming model.
Hexagonal polyomino weak (1,2)-achievement games
Authors: Nándor Sieben
Venue: Acta Cybernetica (2004)

A version of polyomino achievement games is studied, in which the first player marks one cell and the second player marks two cells at each move. All polyominos but one on an infinite 2-dimensional hexagonal board are characterized to be weak winners or losers.
Ensemble feature ranking
Authors: Kees Jong, Jérémie Mary, Antoine Cornuéjols, Elena Marchiori, Michèle Sebag
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Selection is known as Feature Ranking, ranking the features with respect to their relevance. This paper proposes an ensemble approach for Feature Ranking, aggregating feature rankings extracted along independent runs of an evolutionary learning algorithm named ROGER. The convergence of ensemble feature ranking is studied in a theoretical perspective, and a statistical model is devised for the empirical validation, inspired from the complexity framework proposed in the Constraint Satisfaction domain. Comparative experiments demonstrate the robustness of the approach for learning (a limited kind of) non-linear concepts, specifically when the features significantly outnumber the examples.
Learning and Identifying Haptic Icons under Workload
Authors: Andrew Chan, Karon MacLean, Joanna McGrenere
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This work addresses the use of vibrotactile haptic feedback to transmit background information with variable intrusiveness, when recipients are engrossed in a primary visual and/or auditory task. We describe two studies designed to (a) perceptually optimize a set of vibrotactile "icons" and (b) evaluate users' ability to identify them in the presence of varying degrees of workload. Seven icons learned in approximately 3 minutes were each typically identified within 2.5 s and at 95% accuracy in the absence of workload. An extended version of this paper can be found as a technical report at http://www.cs.ubc.ca/labs/spin/.
Achieving a Reuse Perspective within a Component Recovery Process: An Industrial Scale Case Study
Authors: Andrew Le Gear, Jim Buckley, Brendan Cleary, J. J. Collins, Kieran O'Dea
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Identifying elements of existing software that are reused within a system may provide maintainers with valuable insights during system evolution. This paper evaluates an extension of software reconnaissance that can be used to analyse reuse across features in a system, as part of a component recovery process proposed in [A process for transforming portions of existing software forreuse in modern development approaches]. We illustrate and evaluate retrieval of reuse information in this fashion using a large, commercial ERP and warehousing application. Results suggest that the approach scales well in terms of reuse information across features in existing software, providing maintainers with a valuable new perspective on the software system in question.
Throughput Driven, Highly Available Streaming Stored Playback Video Service over a Peer-to-Peer Network
Authors: K. Kalapriya, S. K. Nandy
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Streaming video is a key functionality in Internet based services such as distant education,VoD etc.,. The high bandwidth requirements associated with such applications coupled with limited I/O bandwidth of the server limits the throughput levels achieved by these systems. Such systems can largely benefit if the abundant resources such as storage and bandwidth available at the end systems (otherwise called as peers) are put to use. Availability of Streaming service is largely affected by the transient nature of the peers. Therefore, we identify two important issues in these systems, viz (i) Scalability,(in terms of support large number of clients) (ii) High Data availability (minimizing the loss of segments due to the transience of peers). In this paper we propose a throughput driven, highly available ýstreaming stored videoý service architecture over a peer-to-peer network. We use distributed caching scheme where the initial segments of data are temporarily cahced and served to subsequent requests, thereby reducing the number of requests to the server. We exploit the inherent redundancy of FEC based channel coding to provide high availability. Our aim is to show that despite this high transience of peers, the proposed distributed caching scheme helps reduce the number of server streams requested and provide high data availability, while serving large community of clients. We describe our three-tier architecture to realize the proposed model and measure the potential of our scheme in terms of increase in overall system capacity.
Single DDCC Biquads with High Input Impedance and Minimum Number of Passive Elements
Authors: Muhammed A. Ibrahim, Hakan Kuntman, Oguzhan Cicekoglu
Venue: Analog Integrated Circuits and Signal Processing (2005)

Two new configurations for the design of biquad filters with high input impedance are presented. The first configuration can synthesize low-pass and high-pass filter functions according to the passive components used. The second one can synthesize a band-pass filter function. The proposed configurations employ only one differential difference current conveyor (DDCC) as active elements and minimum number of passive elements, namely two resistors and two capacitors. Another filter topology based on DDCC is presented that allows modifying the quality factor without changing its natural frequency. All the filters enjoy low sensitivities. SPICE simulation results are given to confirm the validity of the analysis and to point out the high performance of the filters.
High Performance Communication between Parallel Programs
Authors: Jae-Yong Lee, Alan Sussman
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

We present algorithms for high performance communication between message-passing parallel programs, and evaluate the algorithms as implemented in InterComm. InterComm is a framework to couple parallel programs in the presence of complex data distributions within a coupled application. Multiple parallel libraries and languages may be used in the different programs of a single coupled application. The ability to couple such programs is required in many emerging application areas, such as complex simulations that model physical phenomena at multiple scales and resolutions, and image data analysis applications. We describe the new algorithms we have developed for computing inter-program communication patterns. We present experimental results showing the performance of various algorithmic tradeoffs, and also compare performance against an earlier system.
An empirical comparison of direct and indirect measures of person-organization (P-O) fit
Authors: Thomas W. Ferratt, Harvey G. Enns, Jayesh Prasad
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Person-organization (P-O) fit is an important concept for understanding the attitudes and behavior of individuals in organizations, in general, and information technology (IT) professionals, in particular. The objective of this paper is to examine a controversial issue related to the measurement of P-O fit. We explain the controversy and empirically investigate it using a sample of IT professionals.
Web Service Grids: an evolutionary approach: Research Articles
Authors: Malcolm Atkinson, David DeRoure, Alistair Dunlop, Geoffrey Fox, Peter Henderson, Tony Hey, Norman Paton, Steven Newhouse, Savas Parastatidis, Anne Trefethen, Paul Watson, Jim Webber
Venue: Concurrency and Computation: Practice Experience (2005)

The U.K. e-Science Programme is a &pound;250 million, five-year initiative which has funded over 100 projects. These application-led projects are underpinned by an emerging set of core middleware services that allow the coordinated, collaborative use of distributed resources. This set of middleware services runs on top of the research network and beneath the applications we call the &lsquo;Grid&rsquo;. Grid middleware is currently in transition from pre-Web Service versions to a new version based on Web Services. Unfortunately, only a very basic set of Web Services embodied in the Web Services Interoperability proposal, WS-I, are agreed by most IT companies. IBM and others have submitted proposals for Web Services for Grids&mdash;the Web Services ResourceFramework and Web Services Notification specifications&mdash;to the OASIS organization for standardization. This process could take up to 12 months from March 2004 and the specifications are subject to debate and potentially significant changes. Since several significant U.K. e-Science projects come to an end before the end of this process, the U.K. needs to develop a strategy that will protect the U.K.'s investment in Grid middleware by informing the Open Middleware Infrastructure Institute's (OMII) roadmap and U.K. middleware repository in Southampton. This paper sets out an evolutionary roadmap that will allow us to capture generic middleware components from projects in a form that will facilitate migration or interoperability with the emerging Grid Web Services standards and with ongoing OGSA developments. In this paper we therefore define a set of Web Services specifications, which we call &lsquo;WS-I+&rsquo; to reflect the fact that this is a larger set than currently accepted by WS-I, that we believe will enable us to achieve the twin goals of capturing these components and facilitating migration to future standards. We believe that the extra Web Services specifications we have included in WS-I+ are both helpful in building e-Science Grids and likely to be widely accepted. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Bounding the probability of the union of events by aggregation and disaggregation in linear programs
Authors: András Prékopa, Linchun Gao
Venue: Discrete Applied Mathematics (2005)

Given a sequence of n arbitrary events in a probability space, we assume that the individual probabilities as well some or all joint probabilities of up to m events are know, where m<n. Using this information we give lower and upper bounds for the probability of the union. The bounds are obtained as optimum values of linear programming problems or objective function values corresponding to feasible solutions of the dual problems. If all joint probabilities of the k-tuples of events are known, for k not exceeding m, then the LP is the large-scale Boolean probability bounding problem. Another type of LP is the binomial moment problem, where we assume the knowledge of some of the binomial moments of the number of events which occur. The two LPs can be obtained from each other by aggregation/disaggregation procedure In this paper, we define LPs which are obtained by partial aggregation/disaggregation from these two LPs. This way we can keep the size of the problem low but can produce very good bounds in many cases. The obtained lower bounds generalize the bounds of de Caen (Discrete Math. 169 (1997) 217) and Kuai, Alajaji and Takahara (Discrete Appl. Math. 215 (2000) 147). Practical applications are mentioned and numerical examples are presented.
CCMPerf: A Benchmarking Tool for CORBA Component Model Implementations
Authors: Arvind S. Krishna, Balachandran Natarajan, Aniruddha Gokhale, Douglas C. Schmidt, Nanbor Wang, Gautam Thaker
Venue: Real-Time Systems (2005)

Commercial off-the-shelf (COTS) middleware is now widely used to develop distributed real-time and embedded (DRE) systems. DRE systems are themselves increasingly combined to form "systems of systems" that have diverse quality of service (QoS) requirements. Earlier generations of COTS middleware, such as Object Request Brokers (ORBs) based on the CORBA 2.x standard, did not facilitate the separation of QoS policies from application functionality, which made it hard to configure and validate complex DRE applications. The new generation of component middleware, such as the CORBA Component Model (CCM) based on the CORBA 3.0 standard, addresses the limitations of earlier generation middleware by establishing standards for implementing, packaging, assembling, and deploying component implementations.There has been little systematic empirical study of the performance characteristics of component middleware implementations in the context of DRE systems. This paper therefore provides four contributions to the study of CCM for DRE systems. First, we describe the challenges involved in benchmarking different CCM implementations. Second, we describe key criteria for comparing different CCM implementations using key black-box and white-box metrics. Third, we describe the design of our CCMPerf benchmarking suite to illustrate test categories that evaluate aspects of CCM implementation to determine their suitability for the DRE domain. Fourth, we use CCMPerf to benchmark CIAO implementation of CCM and analyze the results. These results show that the CIAO implementation based on the more sophisticated CORBA 3.0 standard has comparable DRE performance to that of the TAO implementation based on the earlier CORBA 2.x standard.
Minimum k-geodetically connected digraphs
Authors: Ján Plesník
Venue: Networks (2004)

A strong digraph is k-geodetically connected &lpar;k-GC&rpar; if the removal of at least k vertices is required to increase the distance between at least one pair of vertices or reduce it to a single vertex. Such digraphs can serve as models of distance invulnerable networks &lpar;immune to k &ndash; 1 or fewer vertex failures&rpar; for a system with one-way communications. For every integer n, we determine the minimum size 2-GC digraphs of order n. Further, we find the minimum size of a k-GC digraph of order n if n &equiv; 0 &lpar;mod k&rpar; and give good bounds for all n. Also, several operations on and constructions of k-GC digraphs are presented. We show that the problem of finding a minimum size k-GC spanning subdigraph of a given digraph is NP-hard. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;4&rpar;, 243&ndash;253 2004
A software simulation of an AES-equipped 802.11X wireless network
Authors: Matthew Grayson
Venue: Journal of Computing Sciences in Colleges (2004)

Current wireless Ethernet networks have many well-known security flaws. The system in use, Wired Equivalent Privacy, has been deemed insufficient for providing security and is in the midst of being replaced. The 802.11i standard, which is currently being developed by IEEE to address current weaknesses, will use a security system based on the Advanced Encryption Standard (AES). The primary goal of this project is to evaluate the feasibility of using AES to encrypt frames (i.e., packets) in a wireless environment. A secondary goal is to explore the efficiency of implementing AES in software. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A new family of hybrid 4-DOF parallel mechanisms with two platforms and its application to a footpad device
Authors: Jungwon Yoon, Jeha Ryu
Venue: Journal of Robotic Systems (2005)

This paper proposes a new family of 4-degrees-of-freedom (DOF) parallel mechanisms with two platforms and its application to a footpad device that can simulate the spatial motions of the human foot. The new mechanism consists of front and rear platforms, and three limbs. Two limbs with 6-DOF serial joints ( <und>P</und>-S-P-P) are attached to each platform and are perpendicular to the base plate, while the middle limb is attached to the revolute joint that connects the front and rear platforms. The middle limb is driven by the 2-DOF driving mechanism that is equivalent to active serial prismatic and revolute joints ( <und>Pe</und>- <und>Re</und>), or prismatic and prismatic joints ( <und>Pe</und>- <und>Pe</und>) with two base-fixed prismatic actuators. Since the middle limb perpendicular to the base plate has 3-DOF serial joints ( <und>Pe</und>- <und>Re</und>-R or <und>Pe</und>- <und>Pe</und>-R), two new 4-DOF parallel mechanisms with two platforms can generate pitch motion of each platform, and roll and heave motions (1T-3R) or pitch motion of each platform and two translational motions (2T-2R) at both platforms, according to the type of the 2-DOF driving mechanism. Kinematic analyses of the 1T-3R mechanism were performed, including inverse and forward kinematics and velocity analysis. Based on the 1T-3R mechanism, a footpad device was designed to generate foot trajectories for natural walking. &copy; 2005 Wiley Periodicals, Inc.