ppxscal/embedding_network huggingface dataset:
Sprained Ankle Physiotherapy Based Mechanism Synthesis and Stiffness Analysis of a Robotic Rehabilitation Device
Authors: Jian S. Dai, Tieshi Zhao, Christopher Nester
Venue: Autonomous Robots (2004)

Rehabilitation robotics is a growing field where the study of human movement is one of the key topics. Mechanisms development in terms of analysis and synthesis in the field is relatively new, particularly in the case of parallel robotic mechanisms. This paper presents the background and details of current research into the use of parallel robotic mechanisms for rehabilitation of sprained ankles, and proposes a new device based on a parallel mechanism with a central strut.The paper investigates a new technique in motion analysis of ankle movement which is presented in an orientation image space and in that of a rehabilitation therapy, presents an approach of mechanism synthesis based on this analysis, and develops several parallel mechanisms with a central strut for ankle rehabilitation. This is then related to the analysis of the stiffness effect of the central strut in the platform-type mechanism and the stiffness matrix is decomposed with the part resulting from the central strut which supports ankle rehabilitation.In presenting this new research, the paper relates the study of mechanisms to that of rehabilitation robotics and presents a strong case in the new application of parallel robotic mechanisms.
Optimizing large star-schema queries with snowflakes via heuristic-based query rewriting
Authors: Yingying Tao, Qiang Zhu, Calisto Zuzarte, Wing Lau
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

User queries have been becoming increasingly complex (e.g., involving a large number of joins) as database technology is applied to some application domains such as data warehouses and life sciences. Query optimizers in existing database management systems often suffer from intolerably long optimization time and/or poor optimization results when optimizing large join queries. One possible solution to tackle these problems is to rewrite a user-specified complex query into another form that can better utilize the capability of the underlying query optimizer, based on some heuristic rules, before sending the query to the next query optimization stage. We focus on studying a special type of complex query possessing a star-schema structure with snowflakes, simply called the snow-schema query. The key idea is to split a given snow-schema query into several levels of small query blocks at the query rewriting stage. The query optimizer then optimizes the query blocks and integrates their results into the final query result. A set of heuristic rules on how to divide the query is introduced. A query rewriting framework adopting these heuristics is presented. Experimental results demonstrate that this heuristic-based query rewriting technique is quite promising in optimizing large snow-schema queries.
Isospectral-like flows and eigenvalue problem
Authors: Maria Przybylska
Venue: Future Generation Computer Systems (2003)

We show that the Lax equation ?? = [N, L] applied for calculating the eigenvalues of matrices is only one in a whole family of matrix differential equations related to eigenvalue problem. All these equations are built by means of various representations ρ of a Lie algebra g on Kn×n. A general connection between matrix differential equation L = ρN(L) and FG eigenvalue algorithm is shown. Remarks concerning practical applications of this connection to matrix eigenvalues calculations are also presented.
Verifiable Threshold Cryptosystems Based on Elliptic Curve
Authors: Yiliang Han, Xiaoyuan Yang, Jun Sun, Delong Li
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, verifiable (t, n) threshold ECSA signature algorithm and verifiable (t, n) threshold ECES encryption algorithm are presented according to a secret sharing scheme for Elliptic Curve, which using Lagrange Polynomial Interpolation as access structure. A group of n players share an ECC secret key. Every qualified subset of the group including t out of n players could recovery the secret key, so they can sign and decrypt as well as the whole group, while no subset of t-1 players can accomplish it. The algorithms are perfect and secureverifiable secret shared schemes. Complexity of them is less than the same schemes based on DLP.
A pseudospectral mapping theorem
Authors: S.-H. Lui
Venue: Mathematics of Computation (2003)

The pseudospectrum has become an important quantity for analyzing stability of nonnormal systems. In this paper, we prove a mapping theorem for pseudospectra, extending an earlier result of Trefethen. Our result consists of two relations that are sharp and contains the spectral mapping theorem as a special case. Necessary and sufficient conditions for these relations to collapse to an equality are demonstrated. The theory is valid for bounded linear operators on Banach spaces. For normal matrices, a special version of the pseudospectral mapping theorem is also shown to be sharp. Some numerical examples illustrate the theory.
Trust, Trait Theory, and Collaboration in Telemedicine: An Empirical Test
Authors: Marshall Scott Poole, Liqiong Deng, Houghton G. Brown, Al Moorad, Pamela Forducey, Sharon Smeltzer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This study investigates the effect of individual personality traits on trust in virtual collaboration in telemedicine. In most research there has been an emphasis on the immediate precursors of trust, such as institutional factors (e.g., norms), prior reputation of the parties, and interactions among parties. This has extended to conceptions of individual characteristics or predispositions to trust, which have generally been defined in terms very similar to the construct they are intended to explain; so, for example, predisposition to trust is defined as tendency to be trusting in the situation. The result is an explanation of trust that are quite similar to the construct itself. In this study we advance a basic theory of personality,circumplex theory, as an explanation for trust in anticipated virtual collaborations among medical care professionals. Circumplex theory fits well with existing models of trust because it predicts interpersonal interaction styles, but it offers an explanation grounded in a broad theory of personality that promises to offer more insight than do existing trait explanations of trust. We develop a model based on circumplex theory to predict trust and willingness to participate in anticipated virtual collaborations in telemedicine. The model is tested with a survey administered to a physical rehabilitation professionals in a large telemedicine network. Implications for telemedicine and for research on virtual trust are discussed.
Performance Issues in Integrating a Capital Market Surveillance System Using Web Services
Authors: Feras T. Dabous, Fethi A. Rabhi, Hairong Yu
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Internet-based technologies have opened new opportunities for conducting business within and across enterprises that were never possible a few years ago. This paper presents our experience in using Web services for prototyping a service-oriented architecture for Capital Market Systems (CMSs). Our work exposes a world-class surveillance system's functionality into a number of Web services. Our work also includes benchmarking the performance of thislegacy system and investigating the associated overheads of using SOAP as a wire format for Web services. Even though other research studies have tried to explain SOAP's performance inef.ciency, there is lack of studies that evaluate SOAP in the context of a realistic business application. This initial investigation shows that system's integration opportunities introduced by Web services can outweigh the performance overheads. This occurs in some aspects ofreal-time CMSs that are not performance-demanding such as the dissemination of market alerts to the analysts.
Representing a robotic domain using temporal description logics
Authors: Alessandro Artale, Enrico Franconi
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

A temporal logic for representing and reasoning on a robotic domain is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal language is a member of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The logic is used to organize the domain actions and plans in a taxonomy. The classification and recognition tasks, together with the subsumption task form the basis for action management. An action/plan description can be automatically classified into a taxonomy; an action/plan instance can be recognized to take place at a certain moment from the observation of what is happening in the world during a time interval.
Adding haptic feedback to engineering simulation
Authors: J. Shi, I. A. Oraifige, F. R. Hall
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper describes the experimental work on engineering simulation using virtual reality techniques with haptic feedback. The role of haptic modality in a VR system and its potential have been investigated. In this paper, a low cost attempt to generate haptic feedback in a VR system is discussed.
Better filtering with gapped q-grams
Authors: Stefan Burkhardt, Juha Kärkkäinen
Venue: Fundamenta Informaticae (2002)

A popular and well-studied class of filters for approximate string matching compares substrings of length q, the q-grams, in the pattern and the text to identify text areas that contain potential matches. A generalization of the method that uses gapped q-grams instead of contiguous substrings is mentioned a few times in literature but has never been analyzed in any depth. In this paper, we report the first results of a study on gapped q-grams. We show that gapped q-grams can provide orders of magnitude faster and/or more efficient filtering than contiguous q-grams. To achieve these results the arrangement of the gaps in the q-gram and a filter parameter called threshold have to be optimized. Both of these tasks are nontrivial combinatorial optimization problems for which we present efficient solutions. We concentrate on the k mismatches problem, i.e, approximate string matching with the Hamming distance.
The syntax-discourse interface: effects of the main-subordinate distinction on attention structure
Authors: Eleni Miltsakaki
Venue:  (2003)

The central claim of this thesis is that, unlike main clauses, adjunct subordinate clauses do not form independent processing units in the computation of entity-based topic continuity (attention structure) in discourse. This claim has two primary consequences. First, discourse entities in adjunct subordinate clauses are assigned lower salience than main clauses entities, especially subjects. Second, the process that selects antecedents for pronouns in main clauses is qualitatively different from the process of anaphoric interpretation in subordinate clauses. The former is affected by the mechanism responsible for directing attention in discourse. The latter depends heavily on verbs semantics and the effect of connectives. The claims of this thesis are empirically tested for English and Greek. Primary evidence for the low salience of entities in adjunct subordinate clauses comes from corpus studies, which show that entities in adjunct subordinate clauses (a) make poor competitors in the selection of antecedents for subject pronouns in main clauses, and (b) are unlikely to be referred to in the subsequent discourse with a pronoun (unless they are already old). Primary evidence for the two level anaphora resolution mechanism comes from psycholinguistic experiments designed to test if there is a consistent difference in the way we interpret pronouns in main and adjunct subordinate clauses. These findings form the basis for the specification of two new NLP models, a system for the automated evaluation of coherence in student essays and a two level anaphora resolution algorithm. They also make two significant contributions to the Centering Model, (a) Centering's &ldquo;utterance&rdquo; is formally defined on the basis of empirical evidence, and (b) Centering's Rough-Shift transition is for the first time validated as a reliable estimator of poor coherence, empirically tested on an operable essay scoring system.
Contents production techniques using Web3D
Authors: Rina Takahashi, Naoki Wakabayashi, Kaori Aoki, Taichi Watanabe
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

The purpose of this research is to investigate the necessary tools and their functions under the theme of information design and communication in 3-dimensional space created by existing web3D technology. We have developed and verified "Aqua Place," a web contents on virtual aquarium containing 3-dimensional simulation by VRML within a virtual fish tank.Through this development and verification, we focused on the functions for observation in 3-dimensional space and on the method for revealing information about creatures as a database. In conclusion, it demands an operating condition that makes it possible to observe each creature individually as well as an information design of 3-dimensional ecosystem simulation in a virtual fish tank.
Poly(acrylamide) gels with embedded magnetite nanoparticles
Authors: S. G. Starodoubtsev, E. V. Saenko, A. R. Khokhlov, V. V. Volkov, K. A. Dembo, V. V. Klechkovskaya, E. V. Shtykova, I. S. Zanaveskina
Venue: Microelectronic Engineering (2003)

Magnetic gels are a new class of soft polymer materials with their properties controlled by magnetic fields. A method was developed for the preparation of magnetite nanoparticles in a matrix of poly(acrylamide) gel. Synthesis of the magnetic spinel iron oxide Fe3O4 in a matrix of poly(acrylamide) gel was performed via coprecipitation of Fe(II) and Fe(III) in alkaline medium. The effects of the cross-link density, the concentration of polymer and salt in the swollen network during preparation on the composition, structure and properties of the magnetic gels were studied by electronography, TEM and small-angle X-ray scattering (SAXS). The crystalline lattice of the particles was determined as magnetite. The average size of the particles, d, calculated from the half-width of the diffraction peaks, is of the order of 10 nm. The obtained data demonstrate a marked difference in size distribution of magnetic particles in gels of different structure.
Evaluating System Performance in Gigabit Networks
Authors: K. Salah, K. El-Badawi
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

With the current wide deployment of Gigabit Ethernettechnology in the backbone and workgroup switches, thenetwork performance bottleneck has shifted for the firsttime in nearly a decade from the network to the end hostsand servers. This dramatic bandwidth increase calls foroptimizations and good design considerations in many keycomponents of the hosts and servers. These keycomponents include network adaptor, operating system,protocol stack, memory, and processing power. Moreimportantly the high bandwidth increase can negativelyimpact the OS performance due to the interrupt overheadcaused by the incoming gigabit traffic. This paperpresents models and analytical techniques for studyingsuch a negative impact. We first present an analyticalmodel for the ideal system when interrupt overhead isignored. We then present two models which describe theimpact of high interrupt rate on system throughput. Onemodel is for network adaptors not equipped with DMAengines, and the other model is for network adaptorsequipped with DMA engines. In addition we study thesystem performance when using different system deliveryoptions of packet data to user applications. Results fromboth simulations and reported experimental findings showthat our analytical models are valid and give a goodapproximation.
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
Authors: Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
Venue: ACM Transactions on Mathematical Software (TOMS) (2003)

We describe the design of version 1.0 of GALAHAD, a library of Fortran 90 packages for large-scale nonlinear optimization. The library particularly addresses quadratic programming problems, containing both interior point and active set algorithms, as well as tools for preprocessing problems prior to solution. It also contains an updated version of the venerable nonlinear programming package, LANCELOT.
DPBP: A Sort-First Parallel Rendering Algorithm for Distributed Rendering Environments
Authors: Huabing Zhu, Kai Yun Chan, Lizhe Wang, Wentong Cai, Simon See
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

In some visualization systems, the data and computationalresources are distributed globally and users need tointeract with these resources easily and efficiently. Real-timerendering for massive datasets is a computation intensivetask. one solution is to distributes the renderingtasks over a set of computation units to achieve high renderingperformance. This paper presents a recursive sort-firstpartitioning algorithm named Dynamic Pixel Bucket Partition(DPBP) for parallel rendering alone with their implementationand performance in a distributed rendering environment.This algorithm distributes rendering work loadsevenly to individual rendering units to achieve fast, highquality rendering of massive data. Test results in a multi-clusterenvironment demonstrate the practicality of this renderingalgorithm.
On-the-fly Wrapping of Web Services to Support Dynamic Integration
Authors: Gerald C. Gannod, Huimin Zhu, Sudhakiran V. Mudiam
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Service-oriented development has gained much attentionin recent years with the advent of technologiessuch as Web Services, .NET, and Jini. Standards forspecifying, publishing, and delivering services has enabledapproaches for specifying applications that canintegrate and bind at run-time with services that meetapplication requirements. Jini is a service-based frameworkthat was originally developed to support integrationof devices as services. Web services are services thatare delivered over the World Wide Web using WSDL as adescriptor and SOAP as the delivery mechanism. In thispaper, we describe a wrapping technique that facilitatesthe integration of web services into Jini service applicationson-the-fly. As a result, an application can take advantageof run-time service lookup facilities provided byJini without needing á priori knowledge of the web servicesit eventually uses.
Embodied Tour Guide in an Interactive Virtual Art Gallery
Authors: Xiang Yuan, Yam San Chee
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The technology of embodied conversational agents invirtual worlds provides an attractive way to achievenatural and realistic human-computer interaction if theinteraction designs is handled sensitively.In view of this,we aim at building an embodied tour guide that is able toengage conversationally with system users about galleryexhibits, and capable of behaving according to socialnorms in terms of gesture and facial expression.Theresearch has focused on the attributeds of agent autonomyand believability, not truthfulness.To achieve agentautonomy, we present a three-layered architecturaldesign to ensure appropriate coupling between agent'sperception and action, and to hide the internalmechanism from users.We then work towards agentbelievability: we utilize the notion of schema to supportstructured and coherent verbal behaviors; carefulattention has also been paid to the design of non-verbalagent interactions that help to establish social facts withinthe virtual world.Our discussion focuses on how reasoning, planning and generation of the verbal andnon-verbal behaviors are performed using the schema-basedframework.Finally the agent-user interactions areillustrated with a case study.
Adaptive disk scheduling in a multimedia DBMS
Authors: Ketil Lund, Vera Goebel
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we present APEX, a disk scheduling framework with QoS support, designed for environments with highly varying disk bandwidth usage. In particular, we focus on a Learning-on-Demand scenario supported by a multimedia database management system, where students can search for, and play back multimedia-based learning material. APEX is based on a two-level scheduling architecture, where the upper level realizes different service classes using a set of queues, while the lower level distributes available disk bandwidth among these queues.In this paper, we focus on the low-level scheduling in APEX, which is based on an extended token bucket algorithm. The disk requests scheduled for service are assembled into batches, which render possible good efficiency for the disk. Combined with a very efficient work-conservation scheme, this enables APEX to apply bandwidth where it is needed, without efficiency loss. We demonstrate, through simulations, that APEX provides both higher throughput and lower response times than other mixed-media disk schedulers, while still avoiding deadline violations for real-time requests. We also show its robustness with respect to misaligned bandwidth allocation.
Ravenscar design patterns?: reflections on use of the Ravenscar profile
Authors: Tullio Vardanega
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

Industrial developers have started to use the Ravenscar Profile in challenging application domains. The thorough feedback that begins to emerge from these experiences is of great interest to the community (i.e. the IRTAW group) that rst conceived and promoted the Pro le. This paper undertkes a rst analysis of a specific experience report to which the author had early and privileged access.
Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs
Authors: M. Cemil Azizouglu, Ömer Eugeciouglu
Venue: SIAM Journal on Discrete Mathematics (2004)

We prove that the set of first k vertices of a Hamming graph in reverse-lexicographic order constitutes an extremal set minimizing the dimension-normalized edge-boundary over all k-vertex subsets of the graph. This generalizes a result of Lindsey and can be used to prove a tight lower bound for the isoperimetric number and the bisection width of arrays.
How People Select Their Payment Methods in Online Auctions? An Exploration of eBay Transactions
Authors: Haizheng Li, Han Zhang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Online payments are a critical issue in electronic markets. This research investigates online payment choices using probit model based on the survey data we collected from eBay users. We discuss payment choices between the trader partners based on risk, convenience and cost dimensions. Then, we analyze how product attributes, traders' characteristics and payment attributes affect the payment choice. Our findings suggest that product attributes, especially uncertainties associated with the product quality, appear to have stronger effect in affecting payment choices than traders' characteristics. We also find that a seller's reputation rating does not have a significant effect on actual payment choices, but affects the payment options offered by a seller.