ppxscal/embedding_network huggingface dataset:
Facilitating secure ad hoc service discovery in public environments
Authors: Feng Zhu, Matt Mutka, Lionel Ni
Venue: Journal of Systems and Software (2005)

Securely accessing unfamiliar services in public environments using ad hoc wireless networks is challenging. We present a proxy-based approach that uses alternative network channels to establish a secure trust relationship between communication parties to facilitate ad hoc wireless communications. Based on a service discovery protocol, our models achieve secure, trusted, anonymous, efficient, and economical communications between unfamiliar parties. Our protocol design is formally verified using BAN logic.
Multi-period design of survivable wireless access networks under capacity constraints
Authors: Indranil Bose, Enes Eryarsoy, Ling He
Venue: Decision Support Systems (2005)

Design of survivable wireless access networks plays a key role in the overall design of a wireless network. In this research, the multi-period design of a wireless access network under capacity and survivability constraints is considered. Given the location of the cells and hubs, the cost of interconnection, and the demands generated by the cells, the goal of the designer is to find the best interconnection between cells and hubs so that the overall connection cost is minimized and the capacity and the survivability constraints are met. Integer programming formulations for this problem are proposed and the problems are solved using heuristic methods. Using different combination of network sizes, demand patterns and various time periods, a number of numerical experiments are conducted and all of them are found to yield high quality solutions.
From UML to LQN by XML algebra-based model transformations
Authors: Gordon P. Gu, Dorina C. Petriu
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of non-functional characteristics of UML models. such as performance, reliability, scalability, security, etc. Many modeling formalisms, techniques and tools have been developed over the years for the analysis of different non-functional characteristics. The challenge is not to reinvent new analysis methods for UML models, but to bridge the gap between UML-based software development tools and different kinds of existing analysis tools. Traditionally, the analysis models were built "by hand". However, a new trend is starting to emerge, that involves the automatic transformation of UML models (annotated with extra information) into various kinds of analysis models. This paper proposes a transformation method of an annotated UML model into a performance model. The mapping between the input model and the output model is defined at a higher level of abstraction based on graph transformation concepts, whereas the implementation of the transformation rules and algorithm uses lower-level XML trees manipulations techniques, such as XML algebra. The target performance model used as an example in this paper is the Layered Queueing Network (LQN); however, the transformation approach can be easily tailored to other performance modelling formalisms.
Haptics of Buckling
Authors: Tim Poston, Ankur Dhanik, Etienne Burdet, Teo Chee Leong
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

System delay in a haptic virtual world creates inappropriate instability and oscillations. An intrinsically unstable environment can give appropriate instabilities such as snap buckling. Around a buckling point the low-order approximations useful in solution methods become degenerate, overlaying a non-delay oscillation on the jumps required by physical realism. We show how bifurcation theory can identify and limit the higher terms needed for a correct solution by algorithms with haptically viable speed. We illustrate this in a haptic simulation of stiff thread bending as the hand moves it, with realistic ýsnapý buckling, and in the first haptic simulation of the non-linear Zeeman machine, a canonical system for the study of energy-minimizing jumps amid continuity.
Residual kinetic imaging: a versatile interface for prosthetic control
Authors: Sam L. Phillips, William Craelius
Venue: Robotica (2005)

We studied the pressure patterns in the residual limbs of transradial amputees during their voluntary commands for finger taps. Topographic maps of pressures exerted against the hard prosthetic socket were registered with an array of 32 pressure sensors, to produce residual kinetic images (RKIs) of the limb. Results with 2 untrained subjects demonstrated that RKIs are reliable decoders of efferent commands. Coupled with a trained filter, RKIs can provide biomimetic control over multiple degrees of freedom.
Run-time evaluation of opportunities for object inlining in Java: Research Articles
Authors: Ondřej Lhoták, Laurie Hendren
Venue: Concurrency and Computation: Practice Experience (2005)

Object-oriented languages, such as Java, encourage the use of many small objects linked together by field references, instead of a few monolithic structures. While this practice is beneficial from a program design perspective, it can slow down program execution by incurring many pointer indirections. One solution to this problem is object inlining: when the compiler can safely do so, it fuses small objects together, thus removing the reads&sol;writes to the removed field, saving the memory needed to store the field and object header, and reducing the number of object allocations. The objective of this paper is to measure the potential for object inlining by studying the run-time behaviour of a comprehensive set of Java programs. We study the traces of program executions in order to determine which fields behave like inlinable fields. Since we are using dynamic information instead of a static analysis, our results give an upper bound on what could be achieved via a static compiler-based approach. Our experimental results measure the potential improvements attainable with object inlining, including reductions in the numbers of field reads and writes, and reduced memory usage. Our study shows that some Java programs can benefit significantly from object inlining, with close to a 10&percnt; speedup. Somewhat to our surprise, our study found one case, the <mono>db</mono> benchmark, where the most important inlinable field was the result of unusual program design, and fixing this small flaw led to both better performance and clearer program design. However, the opportunities for object inlining are highly dependent on the individual program being considered, and are in many cases very limited. Furthermore, fields that are inlinable also have properties that make them potential candidates for other optimizations such as removing redundant memory accesses. The memory savings possible through object inlining are moderate. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Multi-view face identification and pose estimation using B-spline interpolation
Authors: Frank Y. Shih, Camel Y. Fu, Kai Zhang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

The available face views in the training set are mostly limited. In this paper, we present a view interpolation method using nonlinear B-spline on face manifolds. Two models, the inner-outer ellipse model and the moment of inertia model, are developed to estimate the pose orientation. We use the limited view-pose face images to form the pose eigen space. Then, based on these nonlinear manifolds we form a B-spline for each individual. Identification is to compute the shortest Euclidean distance from a given test view to the nearest point within one of these B-splines. Once the test view is classified as a familiar individual in the training set, not only can the individual be identified, but also the pose angle can be estimated. Experimental results show that B-spline interpolation can achieve a recognition rate of 95%.
A Lightweight Scheme for Auto-configuration in Mobile Ad Hoc Networks
Authors: M. J. Kim, M. Kumar, B. A. Shirazi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

An efficient addressing scheme is necessary for auto-configuration and seamless communication in pervasive computing environments. In this paper, we propose an efficient and simple scheme called CoReS (Configuration and Registration Scheme), for address auto-configuration integrated with service registration/location in dynamic mobile ad hoc networks (MANETs) common to pervasive computing environments. Compared to existing approaches, CoReS performs effectively and efficiently in such challenging situations as merger of multiple networks and abrupt node departures. Simulation results show that CoReS demonstrates superior performance in terms of configuration overhead and latency in MANETs. The novel features of CoReS include: i) unique address assignment; ii) smooth handling of topology change; iii) reduced configuration time and overhead; and iv) integrated address configuration and service registration/location.
Maran Illustrated Access 2003
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, over 500 full-color screen shots, illustrations, helpful introductions, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of the latest version of Access 2003, Microsoft's popular database program, including new features such as the ability to save backup copies of databases, find dependencies between database objects, and add smart tags to tables. Uses simple, easy-to-understand and concise text and covers over 140 essential topics, making it a great reference for all skill levels. Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available.
Pose Estimation in Conformal Geometric Algebra Part II: Real-Time Pose Estimation Using Extended Feature Concepts
Authors: Bodo Rosenhahn, Gerald Sommer
Venue: Journal of Mathematical Imaging and Vision (2005)

Part II uses the foundations of Part I [35] to define constraint equations for 2D-3D pose estimation of different corresponding entities. Most articles on pose estimation concentrate on specific types of correspondences, mostly between points, and only rarely use line correspondences. The first aim of this part is to extend pose estimation scenarios to correspondences of an extended set of geometric entities. In this context we are interested to relate the following (2D) image and (3D) model types: 2D point/3D point, 2D line/3D point, 2D line/3D line, 2D conic/3D circle, 2D conic/3D sphere. Furthermore, to handle articulated objects, we describe kinematic chains in this context in a similar manner. We ensure that all constraint equations end up in a distance measure in the Euclidean space, which is well posed in the context of noisy data. We also discuss the numerical estimation of the pose. We propose to use linearized twist transformations which result in well conditioned and fast solvable systems of equations. The key idea is not to search for the representation of the Lie group, describing the rigid body motion, but for the representation of their generating Lie algebra. This leads to real-time capable algorithms.
Calculating web page trustworthiness by exploring communities on the web
Authors: Mirena S. Chausheva
Venue: Journal of Computing Sciences in Colleges (2004)

With the growth of the Internet and the ease with which websites can be created, a lot of web pages of questionable quality and authority have appeared and it has become a significant problem to search the web for trustworthy information [3]. In addition, more and more Internet users rely on and trust information they receive from the Internet than from any other source [2]. Most people, when doing a web search, only look at the first page of results returned by the search engine. As a result, for a lot of commercial sites it is important to appear as one of the first search results, and pages containing advertisement, propaganda material, or "informercials" try to rank higher. Our goal is to prevent such pages, called spam, from qualifying high in the results returned by web search engines.
Growing adaptation of computer science in Bioinfomatics
Authors: Mayumi Kato, Chia-Tien Dan Lo
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Bioinfomatics is a bright new field, and is defined as a science of developing computer databases and algorithms for the purpose of speeding up and enhancing biological research. The mapping of the human genome was officially completed in June of 2000, and DNA sequence has been completed in April 2003. The key issue of next era in Bioinfomatics is to interpret data for our purpose. Biological research uses a huge volume of data, the DNA sequence, the nature of the process's pattern searching, complex calculations and sorted data subsets. The pattern searching has been studied in data mining community to extract characteristics from databases, which may be text strings and/or primary sequence information. The text strings consists of entry, organism, or gene names, and authors. Primary sequence information includes restriction enzyme cut sites, regulatory patterns ("signal") and known functional or structural pattern's (motifs). The pattern searching covers simple one-dimensional pattern text searches, regular pattern expressions, to neural nets and genetic algorithms. A visualization technique offers visual data interpretation to the Bioinfomatics. Cluster, grid computing and/or parallel computation are introduced to share database called data banks and to speed up the searching over databases. The large distributed databases need methods of inquiry and access over the networks. The VRML, cellML, AnatML, and FiledML have been designed to access cluster GRID computing. The web-based and GRID computing offers tools for easy data access and integration to facilitate biological researches in the next era. The Computer Science has provided background technologies to Bioinfomatics in a variety of fields. We study Bioinfomatics researches and products and show growing adaptation of Computer Science in Bioinfomatics.
Properties and benefits of calibrated classifiers
Authors: Ira Cohen, Moises Goldszmidt
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

A calibrated classifier provides reliable estimates of the true probability that each test sample is a member of the class of interest. This is crucial in decision making tasks. Procedures for calibration have already been studied in weather forecasting, game theory, and more recently in machine learning, with the latter showing empirically that calibration of classifiers helps not only in decision making, but also improves classification accuracy. In this paper we extend the theoretical foundation of these empirical observations. We prove that (1) a well calibrated classifier provides bounds on the Bayes error (2) calibrating a classifier is guaranteed not to decrease classification accuracy, and (3) the procedure of calibration provides the threshold or thresholds on the decision rule that minimize the classification error. We also draw the parallels and differences between methods that use receiver operating characteristic (ROC) curves and calibration based procedures that are aimed at findig a threshold of minimum error. In particular, calibration leads to improved performance when multiple thresholds exist.
Polymorphic predicate abstraction
Authors: Thomas Ball, Todd Millstein, Sriram K. Rajamani
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

Predicate abstraction is a technique for creating abstract models of software that are amenable to model checking algorithms. We show how polymorphism, a well-known concept in programming languages and program analysis, can be incorporated in a predicate abstraction algorithm for C programs. The use of polymorphism in predicates, via the introduction of symbolic names for values, allows us to model the effect of a procedure independent of its calling contexts. Therefore, we can safely and precisely abstract a procedure once and then reuse this abstraction across multiple calls and multiple applications containing the procedure. Polymorphism also enables us to handle programs that need to be analyzed in an open environment, for all possible callers. We have proved that our algorithm is sound and have implemented it in the C2BP tool as part of the SLAM software model checking toolkit.
International Perspectives: A HUMAN INTERFACE SOCIETY ABROAD
Authors: John Karat, Clare-Marie Karat
Venue: ACM SIGCHI Bulletin (1993)

This issue's column features a contribution from Masaaki Kurosu describing the Technical Committee for Human Interface of the Society of Instrument and Control Engineers in Japan. We found it interesting to hear about the organization and activities of this committee, and found the similarities and differences to SIGCHI informative. While the SIGCHI community has had extensive contact with some of the overseas professional societies with similar interests (such as the HCI Specialists group of the British Computer Society), there are many organizations that we know relatively little about. We thank Masaaki for providing this glimpse at an activity in Japan, and will try and include reports of other overseas societies in future columns.
Aggregate production planning for a continuous reconfigurable manufacturing process
Authors: Akhil Jain, Udatta S. Palekar
Venue: Computers and Operations Research (2005)

Most of the research on aggregate production planning has been focused on discrete parts manufacturing models. In environments where intermediate inventory cannot be stored, and multiple products are produced simultaneously using complex configurations of production machines, these models may produce erroneous results. In this paper, we present a configuration-based formulation for one such manufacturing environment, where production may involve dissimilar machines performing similar operations at different rates and equipment can be connected together to form different production lines. The production process is continuous and no in-process inventory can be kept. We present and compare several heuristics to generate input data to solve the aggregate production-planning problems using the configuration-based formulation. Computational experiments show that large-scale real-world problems we encountered can be solved in reasonable time using our heuristics and commercial optimization software like CPLEX.
On tool selection for illustrating the use of UML in system development
Authors: Harold H. Smith
Venue: Journal of Computing Sciences in Colleges (2004)

With the pervasiveness of the Unified Modeling Language (UML) used as the de facto notation for communicating the specification, design and behavior of a system, numerous software tools are available that provide various levels of support for and use of UML. The inclusion of both UML and UML-based software tools into undergraduate curriculum is common. Selecting the appropriate tools for the curriculum is difficult. This paper identifies three categories of UML-based tools, UML Drawing Tools, UML Code-Centric Tools and UML Framework Tools, and the respective advantages and disadvantages of incorporating tool instances of each category. Based on the discussion, a recommendation is made to adopt a combination of these tools, potentially one of each type.
On the minimum number of wavelengths in multicast trees in WDM networks
Authors: Yingyu Wan, Weifa Liang
Venue: Networks (2005)

We consider the problem of minimizing the number of wavelengths needed to connect a given multicast set in a multihop WDM optical network. This problem was introduced and studied by Li et al. &lpar;Networks, 35&lpar;4&rpar;, 260&ndash;265, 2000&rpar; who showed that it is NP-complete. They also presented an approximation algorithm for which they claimed an approximation ratio of c&lpar;1 &plus; 2 log &Delta;&rpar;, where c is the maximum number of connected components in the subgraph induced by any wavelength and &Delta; is the maximum number of nodes in any connected component induced by any wavelength. In this article we present an example demonstrating that their claim cannot be correct&mdash;the approximation ratio is &Omega;&lpar;n&rpar;, even though the subgraph induced by every wavelength is connected, where n is the number of nodes in the network. In fact, we show that the problem cannot be approximated within O&lpar;2log1&sol;2-&epsiv;m&rpar; unless NP &sube; DTIME&lpar;npoly&thinsp;log&thinsp;n&rpar; for any constant &epsiv; > 0, where m is the number of edges in the network. We complement this hardness result by presenting a polynomial&ndash;time algorithm with an approximation ratio of &lpar;1 &plus; ln&thinsp;3 &plus; 2 log &Delta;&rpar; when the subgraph induced by every wavelength is connected, and an approximation ratio of $O(\sqrt{(n \, {\rm log} \, \Delta)/{\rm opt})}$ in the general case, where opt is the number of wavelengths used in an optimal solution and 1 &le; opt &le; n - 1. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;1&rpar;, 42&ndash;48 2005
An Optimal A Priori Error Estimate for Nonlinear Multibody Contact Problems
Authors: S. Hüeber, B. I. Wohlmuth
Venue: SIAM Journal on Numerical Analysis (2005)

Nonconforming domain decomposition methods provide a powerful tool for the numerical approximation of partial differential equations. For the discretization of a nonlinear multibody contact problem, we use linear mortar finite elements based on dual Lagrange multipliers. Under some regularity assumptions on the solution, an optimal convergence order of $h^{0.5+\nu}$, $0
Data privacy
Authors: Rakesh Agrawal
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

There is increasing need to build information systems that protect the privacy and ownership of data without impeding the flow of information. We will present some of our current work to demonstrate the technical feasibility of building such systems.
A Machine-Oriented Vulnerability Database for Automated Vulnerability Detection and Processing
Authors: Sufatrio,  Temasek Laboratories, Roland H. C. Yap, Liming Zhong
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

The number of security vulnerabilities discovered in computer systems has increased explosively. Currently, in order to keep track of security alerts, system administrators rely on vulnerability databases such as: CERT Coordination Centre, Securityfocus BugTraq and Sans Vulnerabilities Notes Database. Such databases are designed primarily to be read and understood by humans. Given the speed at which an exploit becomes available once a vulnerability is known, and the frequency of occurrence of such vulnerabilities, manual human intervention is too slow, time-consuming and may not be effective. We propose the design of a new vulnerability database which is oriented to be machine readable and processable rather than human oriented. This allows automated response to a vulnerability alert rather than relying on manual intervention of system administrators. With this approach, many kinds of automatic processing of alerts become feasible. We show the value of such a database by constructing a prototype sample scanner for Unix systems tailored for Linux RedHat and FreeBSD. We envisage that our work can help spur a development of far more effective vulnerability databases to benefit a wide-ranging user community.