ppxscal/embedding_network huggingface dataset:
History and the Computer in Canadian Institutions
Authors: Pierre Corbeil
Venue: Social Science Computer Review (2005)

Canadian universities have embraced the Internet and the web as central tools for management, publicity, and transfer of information. Word processing has become a fully integrated and unobtrusive element of computer technology. Historians and history departments have adopted the Internet and its tools but not necessarily other uses of the computer. Simulations and games are the most notable missing elements. History courses are only marginally present among Internet and distance-education services. Prudence and respect for basic methods are the noteworthy aspects of Canadian historians' use of the computer; although, pioneers are at work both individually and institutionally.
Interaction between peripheral optical flow and foveal depth perception
Authors: Hiroshi Watanabe, Hiroyuki Umemura, Chisato Yoshida, Katsunori Matsuoka
Venue: Systems and Computers in Japan (2004)

Using an immersive VR system (the &ldquo;CAVE&rdquo;), we investigated the sensitivity and threshold of depth order judgment in the central visual field by subjects placed in a visual environment that simulated optical flow, producing vection in a wide-area visual field (front, floor, and both sides) associated with forward movement inside an endless toroidal tunnel. Experiments showed that when an optical flow is produced in the wide-area visual field, the sensitivity and threshold of depth judgment exhibit a systematic change that depends on the direction of rotation. Possible explanations of this result are the use of an implicit reference plane by the subject, and change of body sensation in response to the peripheral visual field information. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 107&ndash;116, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20021
A Hard Dial-a-Ride Problem that is Easy on Average
Authors: Amin Coja-Oghlan, Sven O. Krumke, Till Nierhoff
Venue: Journal of Scheduling (2005)

In the dial-a-ride-problem (Darp) objects have to be moved between given sources and destinations in a transportation network by means of a server. The goal is to find the shortest transportation for the server. We study the Darp when the underlying transportation network forms a caterpillar. This special case is strongly NP-hard in the worst case. We prove that in a probabilistic setting there exists a polynomial time algorithm that finds an optimal solution with high probability. Moreover, with high probability the optimality of the solution found can be certified efficiently. In addition, we examine the complexity of the Darp in a semirandom setting and in the unweighted case.
Fuzzy Matchmaking for Web Services
Authors: Kuo-Ming Chao, Muhammad Younas, Chi-Chun Lo, Tao-Hsin Tan
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

To fully realise the potential of web services it is necessary to develop viable dynamic discovery and composition techniques. Matchmaking is considered as one of the crucial factors to ensure dynamic discovery and composition of web services. Current matchmaking methods are inadequate given their inability to abstract and classify the underlying data of web services. Instead, they classify web services based on the capability of services, software signatures, and so on. This paper proposes a novel framework which exploits fuzzy logic in order to abstract and classify the underlying data of web services as fuzzy terms and rules. The aim is to increase the efficiency of the discovery of web services and to allow imprecise or vague terms in the search query.
Problems associated with the use of inverse dynamics in prosthetic applications: An example using a polycentric prosthetic knee
Authors: Laura A. Miller, Dudley S. Childress
Venue: Robotica (2005)

Inverse dynamic calculations are often performed in the analysis of human ambulation. However, assumptions are made in the construction of the models that may not be valid for some prosthetic componentry, specifically polycentric knees used by transfemoral amputees. Data were collected for one subject using a polycentric knee. Moments and forces were calculated when ignoring the extra linkages of the knee and when including the extra linkages of the knee. Significant differences were seen in the hip moment and power between the two cases and indicate that care must be taken when comparing componentry that violates the basic assumptions of the rigid link model.
Local Regularity of Optimal Trajectories for Control Problems with General Boundary Conditions
Authors: M. Sigalotti
Venue: Journal of Dynamical and Control Systems (2005)

Let f and g be two smooth vector fields on a manifold M. Given a submanifold S of M, we study the local structure of time-optimal trajectories for the single-input control-affine system ¿q = f(q) + ug(q) with the initial condition q(0) ¿ S. When the codimension s of S in M is small (s ¿ 4) and the system has a small codimension singularity at a point q0 ¿ S, we prove that all time-optimal trajectories contained in a sufficiently small neighborhood of q0 are finite concatenations of bang and singular arcs. The proof is based on an extension of the index theory to the case of general boundary conditions.
Sketch-based rapid prototyping platform for hardware-software integrated interactive products
Authors: Tek-Jin Nam
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper presents a platform in which interaction designers can effectively and rapidly develop tangible interactive prototypes by sketching. The study aims to build a platform that plays the role of sketching in the hardware-software integrated interactive product design process. The platform consists of three components: a sketch based interactive concept exploration software application called STCtools, a set of physical user interface(PUI) widgets with a key converter and a video projection based Augmented Reality desk (ARdesk). For prototyping, a designer creates hardware and software sketches with pen based computers using STCtools. Sketches of hardware and software are drawn in a client device and composed in an electronic whiteboard, which is the server device. PUI widgets can be physically attached on a foam mockup or on a screen of the client device. The hardware-software integrated simulations are conducted on ARdesk. The sketch simulation is captured and projected onto a paper marker created with invisible infra-red ink.
Gap Metrics, Representations, and Nonlinear Robust Stability
Authors: M. R. James, M. C. Smith, G. Vinnicombe
Venue: SIAM Journal on Control and Optimization (2005)

Various alternative definitions for the nonlinear H2-, L2-, and $\nu$-gap metrics are studied. The concept of $\beta$-conjugacy and multiplicative homogeneity are introduced to relate the metrics to each other and to compare the stability margins of nonlinear feedback loops expressed in terms of the norms of complementary parallel projections. Left and right representations for the graph of a nonlinear system are studied. A new definition of "normalized" is introduced for left representations. Formulas for the gap metrics as the norm of the product of left and right representations are derived. The problem of controller synthesis for input-affine nonlinear systems to achieve norm bounds on the parallel projection operators is studied for input-affine nonlinear systems. The duality between the optimization of the two parallel projections is highlighted. State-space realizations for the normalized left and right representations are derived using nonlinear $H_\infty$ synthesis methods.
A Signature Analysis Technique for the Identification of Failing Vectors with Application to Scan-BIST*
Authors: Michael Goessel, Krishnendu Chakrabarty, Vitalij Ocheretnij, Andreas Leininger
Venue: Journal of Electronic Testing: Theory and Applications (2004)

We present a new technique for uniquely identifying a single failing vector in an interval of test vectors. This technique is applicable to combinational circuits and for scan-BIST in sequential circuits with multiple scan chains. The proposed method relies on the linearity properties of the MISR and on the use of two test sequences, which are both applied to the circuit under test. The second test sequence is derived from the first in a straightforward manner and the same test pattern source is used for both test sequences. If an interval contains only a single failing vector, the algebraic analysis is guaranteed to identify it. We also show analytically that if an interval contains two failing vectors, the probability that this case is interpreted as one failing vector is very low. We present experimental results for the ISCAS benchmark circuits to demonstrate the use of the proposed method for identifying failing test vectors.
Joint pricing-network design and stochastic traffic engineering to manage demand uncertainty
Authors: Debasis Mitra
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

I will describe two networking models, together with their optimization techniques, that span several time scales. In the longest time scale, where the goal is capacity planning, I will describe the work of Bienstock, Raskina, Saniee and Wang that considers joint pricing and network design of optical transport networks. Technological innovations are yielding sharply decreasing unit costs. There is also empirical evidence that suggests that the elasticity of bandwidth demand to price is high. Integrating these features in a unified profit-maximizing model leads to a large- scale nonlinear optimization problem. In this work, efficient solution techniques are developed to maximize the carrier's net present value with respect to pricing strategies and investment decisions for technology acquisitions. In the work of Mitra and Wang the time scale is shorter, the network infrastructure is fixed, and a model for stochastic traffic engineering is given in which the optimization is with respect to bandwidth provisioning and route selection. Traffic demands are uncertain, and the objective is to maximize a risk-adjusted measure of network revenue that is generated by serving demands. Considerable attention is given to the appropriate measure of risk in the network model. Risk-mitigation strategies are also advanced. The optimization model, which is based on mean-risk analysis, enables a service provider to maximize a combined measure of mean revenue and revenue risk. The conditions under which the optimization problem is an instance of convex programming are obtained. The solution is shown to satisfy the stochastic efficiency criterion asymptotically. The efficient frontier, which is the set of Pareto optimal pairs of mean revenue and revenue risk, is obtained.
Eggs in PG(4n - 1,q), q even, containing a pseudo-pointed conic
Authors: Matthew R. Brown, Michel Lavrauw
Venue: European Journal of Combinatorics (2005)

An ovoid of PG(3, q) can be defined as a set of q2 + 1 points with the property that every three points span a plane and at every point there is a unique tangent plane. In 2000 M.R. Brown (J. Geom. 67 (2000) 61) proved that if an ovoid of PG(3, q), q even, contains a pointed conic, then either q = 4 and the ovoid is an elliptic quadric, or q = 8 and the ovoid is a Tits ovoid. Generalising the definition of an ovoid to a set of (n - 1)-spaces of PG(4n - 1, q), J.A. Thas (Rend. Mat. (6) 4 (1971) 459) introduced the notion of pseudo-ovoids or eggs: a set of q2n + 1(n - 1)-spaces in PG(4n - 1, q), with the property that any three egg elements span a (3n - 1)-space and at every egg element there is a unique tangent (3n - 1)-space. We prove that an egg in PG(4n - 1, q), q even, contains a pseudopointed conic, that is, a pseudo-oval arising from a pointed conic of PG(2, qn), q even, if and only if the egg is elementary and the ovoid is either an elliptic quadric in PG(3, 4) or a Tits ovoid in PG(3, 8).
Numerical Analysis for a Macroscopic Model in Micromagnetics
Authors: Carsten Carstensen, Dirk Praetorius
Venue: SIAM Journal on Numerical Analysis (2004)

The macroscopic behavior of stationary micromagnetic phenomena can be modeled by a relaxed version of the Landau--Lifshitz minimization problem. In the limit of large and soft magnets $\Omega$, it is reasonable to exclude the exchange energy and convexify the remaining energy densities. The numerical analysis of the resulting minimization problem, \begin{align*} \min E_0^{**}({\bf m})\text{ amongst }{\bf m}:\Omega\to\mathbb{R}^d\text{ with } |{\bf m}(x)|\le1\text{ for almost every }x\in\Omega, \end{align*} for $d=2,3$, faces difficulties caused by the pointwise side-constraint $|{\bf m}|\le1$ and an integral over the whole space $\mathbb{R}^d$ for the stray field energy. This paper involves a penalty method to model the side-constraint and reformulates the exterior Maxwell equation via a nonlocal integral operator $\mathcal{P}$ acting on functions exclusively defined on $\Omega$. The discretization with piecewise constant discrete magnetizations leads to edge-oriented boundary integrals, the implementation of which and related numerical quadrature are discussed, as are adaptive algorithms for automatic mesh-refinement. A priori and a posteriori error estimates provide a thorough rigorous error control of certain quantities. Three classes of numerical experiments study the penalization, empirical convergence rates, and performance of the uniform and adaptive mesh-refining algorithms.
Acceleration Technique of Snake-Shaped Regions Retrieval Method for Telematics Navigation Service System
Authors: Masaaki Tanizaki, Kishiko Maruyama, Shigeru Shimada
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Telematics services, which provide traffic information such as route guidance, congestion warnings, etc. via a wireless communication network, have spread recently. The demand is growing for graphical guide information to be provided in addition to the conventional service that provides text only guidance. To improve graphical service, we propose a new retrieval method. This method enables fast extraction of map objects within a Snake-Shaped Region (SSR) along a driving route from a geo-spatial database that stores map data without rectangular mesh boundaries. For this retrieval method, we have considered three techniques. The first is based on simplification of the Snake-Shaped route Region through point elimination, and the second is based on reduction of the processing load of the geometrical intersection detection processes. This second technique is accomplished by dividing the Snake-Shaped Region into multiple cells, and the third is multiple distributions of the SSR retrieval result to terminals for quick start of navigation processing. We have developed a prototype to evaluate the performance of the proposed methods. The prototype provides route guidance information for an actual terminal, and uses information taken from United States road maps. Even in an urban area, we managed to provide an approximately 200-mile route of guide information within 10 seconds. We are convinced that the proposed method can be applied to actual Telematics services.
Localized Congestion Control in Advanced Switching Interconnects
Authors: Venkata Krishnan, David Mayhew
Venue: IEEE Micro (2005)

The PCI Express Advanced Switching Interconnect architecture includes status-based flow control (SBFC), a localized congestion-control mechanism that aims to alleviate the effects of transient congestion. The SBFC scheme suffices for handling persistent congestion in single-stage switch fabrics and complements traditional congestion management schemes in larger switch fabrics. There is little doubt that PCI Express is poised to succeed PCI as the next-generation chip interconnect (http://www.pcisig.com/specifications/pciexpress). Of PCI Express's many advantages, perhaps the greatest is that it addresses PCI's major inadequacies, yet enforces strict compatibility with PCI legacy systems. Consequently, the reams of software designed for PCI will operate seamlessly in a PCI Express world. To provide that degree of PCI compatibility, however, a PCI Express fabric must span a single global address space. With no notion of a system boundary, a PCI Express fabric is, by definition, a single system, within which multiple hosts cannot share a fabric. Having all communication under a single host's control makes PCI Express ill suited for multiprocessing and peer-to-peer communication.
Genescene: An ontology-enhanced integration of linguistic and co-occurrence based relations in biomedical texts: Research Articles
Authors: Gondy Leroy, Hsinchun Chen
Venue: Journal of the American Society for Information Science and Technology (2005)

The increasing amount of publicly available literature and experimental data in biomedicine makes it hard for biomedical researchers to stay up-to-date. Genescene is a toolkit that will help alleviate this problem by providing an overview of published literature content. We combined a linguistic parser with Concept Space, a co-occurrence based semantic net. Both techniques extract complementary biomedical relations between noun phrases from MEDLINE abstracts. The parser extracts precise and semantically rich relations from individual abstracts. Concept Space extracts relations that hold true for the collection of abstracts. The Gene Ontology, the Human Genome Nomenclature, and the Unified Medical Language System, are also integrated in Genescene. Currently, they are used to facilitate the integration of the two relation types, and to select the more interesting and high-quality relations for presentation. A user study focusing on p53 literature is discussed. All MEDLINE abstracts discussing p53 were processed in Genescene. Two researchers evaluated the terms and relations from several abstracts of interest to them. The results show that the terms were precise (precision 93&percnt;) and relevant, as were the parser relations (precision 95&percnt;). The Concept Space relations were more precise when selected with ontological knowledge (precision 78&percnt;) than without (60&percnt;). &copy; 2005 Wiley Periodicals, Inc.
The politics of "free": open source software in government
Authors: Brian Donorfio
Venue: Journal of Computing Sciences in Colleges (2004)

"Linux has become a Wall Street buzzword, much like 'e-commerce' and 'dot-com' before it" according to Sam Williams in <u>Free as in Freedom</u>. Even after the dot-com bust, however, the adoption of open source alternatives, such as the GNU/Linux operating system, is still a hot topic in both the public and private sectors. With large companies such as Sun Microsystems and IBM now giving their full support to open source initiatives and the growing consumer backlash against the Microsoft Windows operating system, the so-called open source movement is beginning to gain popular exposure, both in the private sector, as well as in government applications. Governmental use of free software --- not just free in the commercial sense, but "free as in speech" --- can have a democratizing effect on the government. 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
Comparison of character-level and part of speech features for name recognition in biomedical texts
Authors: Nigel Collier, Koichi Takeuchi
Venue: Journal of Biomedical Informatics (2004)

The immense volume of data which is now available from experiments in molecular biology has led to an explosion in reported results most of which are available only in unstructured text format. For this reason there has been great interest in the task of text mining to aid in fact extraction, document screening, citation analysis, and linkage with large gene and gene-product databases. In particular there has been an intensive investigation into the named entity (NE) task as a core technology in all of these tasks which has been driven by the availability of high volume training sets such as the GENIA v3.02 corpus. Despite such large training sets accuracy for biology NE has proven to be consistently far below the high levels of performance in the news domain where F scores above 90 are commonly reported which can be considered near to human performance. We argue that it is crucial that more rigorous analysis of the factors that contribute to the model's performance be applied to discover where the underlying limitations are and what our future research direction should be. Our investigation in this paper reports on variations of two widely used feature types, part of speech (POS) tags and character-level orthographic features, and makes a comparison of how these variations influence performance. We base our experiments on a proven state-of-the-art model, support vector machines using a high quality subset of 100 annotated MEDLINE abstracts. Experiments reveal that the best performing features are orthographic features with F score of 72.6. Although the Brill tagger trained in-domain on the GENIA v3.02p POS corpus gives the best overall performance of any POS tagger, at an F score of 68.6, this is still significantly below the orthographic features. In combination these two features types appear to interfere with each other and degrade performance slightly to an F score of 72.3.
A global routing method for 2-layer ball grid array packages
Authors: Yukiko Kubo, Atsushi Takahashi
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In current VLSI circuits, there can be hundreds of required I/O pins. BGA(Ball Grid Array) packaging is commonly used to realize the huge number of connections between VLSI and PCB. In this paper, we propose a global routing method for two-layer BGA packages. In our routing model, the global routing for each net is uniquely determined by a via assignment. Our global routing method begins with an initial feasible via assignment and incrementally improves the via assignment to minimize the total wire length and wire congestion. In each iteration, a via assignment is improved by exchanging adjacent two vias, rotating three vias, or by moving vias to their adjacent grids one by one. Our method is a greedy-based heuristic. The algorithm efficiently generates better global routes than initial routes with respect to wire congestion and total wire length.
Applying the reflective middleware approach in Grid computing: Research Articles
Authors: Geoff Coulson, Gordon Blair, Nikos Parlavantzas, Wai Kit Yeung, Wei Cai
Venue: Concurrency and Computation: Practice Experience (2004)

Significant progress has been made in the design and development of object-based distributed systems and, more recently, in component-based reflective middleware platforms&mdash;i.e. middleware platforms that, through reflection, can be flexibly configured, and runtime adapted&#x002F;reconfigured&mdash;especially in terms of non-functional properties like quality of service (QoS). In this paper we consider how ideas and principles from such platforms can usefully be applied in a Grid context, specifically, an Open Grid Services Architecture (OGSA) context. To this end, we identify weaknesses in OGSA in the areas of generic service provision, scalability&#x002F;performance engineering, and, especially, lack of support for QoS specification and realization, and suggest how these can be alleviated. We believe that such areas will become increasingly important as sophisticated e-Science applications start to exploit the potential of OGSA's service-based architecture. We also report on our current research on developing a binding-type framework, a resource management framework, and a set of performance optimizations for an ongoing OGSA implementation we are working on. Copyright &copy; 2004 John Wiley & Sons, Ltd.