ppxscal/embedding_network huggingface dataset:
NURBS-based Galerkin method and application to skeletal muscle modeling
Authors: Xianlian Zhou, Jia Lu
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Non-Uniform Rational B-spline (NURBS) is often used to construct the free-form boundary representation of three-dimensional objects. In this paper, we propose a method for mechanical analysis for deformable bodies by combining NURBS geometric representation and the Galerkin method. The NURBS surface bounding a 3D body is extended to a trivariate NURBS solid by adding another parametric domain represented by additional control points. The displacement field of the body is constructed using the NURBS shape representation with the control point being the generalized coordinates. The interpolated displacement field is directly used to facilitate finite element formulation. In this manner, traditional FEM meshing is not required. In this work, the NURBS-FEM is applied to skeletal muscle modeling. Muscle is modeled as anisotropic, active hyperelastic solids. The directions of the contractile fibers can be uniform or along the tangent direction of NURBS curves. Typical contractive motions of isolated muscle are simulated.
High precision extraction of grammatical relations
Authors: John Carroll, Ted Briscoe
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

A parsing system returning analyses in the form of sets of grammatical relations can obtain high precision if it hypothesises a particular relation only when it is certain that the relation is correct. We operationalise this technique---in a statistical parser using a manually-developed wide-coverage grammar of English---by only returning relations that form part of all analyses licensed by the grammar. We observe an increase in precision from 75% to over 90% (at the cost of a reduction in recall) on a test corpus of naturally-occurring text.
CaTTS: calendar types and constraints for Web applications
Authors: François Bry, Frank-André Ries, Stephanie Spranger
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese, Hebrew, or Islamic calendars as well as data referring to professional calendars like fiscal years or teaching terms are omnipresent on the Web. Formalisms such as XML Schema have acknowledged this by offering a rather extensive set of Gregorian dates and times as basic data types. This article introduces into CaTTS, the <u>C</u>alendar <u>a</u>nd <u>T</u>ime <u>T</u>ype <u>S</u>ystem. CaTTS goes far beyond predefined date and time types after the Gregorian calendar as supported by XML Schema. CaTTS first gives rise to declaratively specify more or less complex cultural or professional calendars including specificities such as leap seconds, leap years, and time zones. CaTTS further offers a tool for the static type checking (of data typed after calendar(s) defined in CaTTS). CaTTS finally offers a language for declaratively expressing and a solver for efficiently solving temporal constraints (referring to calendar(s) expressed in CaTTS). CaTTS complements data modeling and reasoning methods designed for generic Semantic Web applications such as RDF or OWL with methods specific to the particular application domain of calendars and time.
A treatment of higher-order features in logic programming
Authors: Gopalan Nadathur
Venue: Theory and Practice of Logic Programming (2005)

The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form of unification for probing their structures. These additions have important meta-programming applications but they also pose non-trivial implementation problems. One issue concerns the machine representation of lambda terms suitable to their intended use: an adequate encoding must facilitate comparison operations over terms in addition to supporting the usual reduction computation. Another aspect relates to the treatment of a unification operation that has a branching character and that sometimes calls for the delaying of the solution of unification problems. A final issue concerns the execution of goals whose structures become apparent only in the course of computation. These various problems are exposed in this paper and solutions to them are described. A satisfactory representation for lambda terms is developed by exploiting the nameless notation of de Bruijn as well as explicit encodings of substitutions. Special mechanisms are molded into the structure of traditional Prolog implementations to support branching in unification and carrying of unification problems over other computation steps; a premium is placed in this context on exploiting determinism and on emulating usual first-order behaviour. An extended compilation model is presented that treats higher-order unification and also handles dynamically emergent goals. The ideas described here have been employed in the Teyjus implementation of the $\lambda$Prolog language, a fact that is used to obtain a preliminary assessment of their efficacy.
Enabling Flexible Queries with Guarantees in P2P Systems
Authors: Cristina Schmidt, Manish Parashar
Venue: IEEE Internet Computing (2004)

The Squid peer-to-peer information discovery system supports flexible queries using partial keywords, wildcards, and ranges. It is built on a structured overlay and uses data lookup protocols to guarantee that all existing data elements that match a query are found efficiently. Its main innovation is a dimension-reducing indexing scheme that effectively maps multidimensional information space to physical peers.
Glencoe Digital Communication Tools, Student Edition, 1 edition
Venue:  (2005)

Filled with cross-curricular activities and real-world connections, Digital Communication Tools helps students understand how digital tools such as PDAs, Tablet PCs, and laptops are revolutionizing the way we perform everyday tasks. In addition to providing information on relevant topics such as wireless networks, firewalls and packets, voice mail, and disaster recovery plans, Digital Communication Tools also includes activities to correlate lessons with language arts, social studies, science, and math.
Order reduction and how to avoid it when explicit Runge-Kutta-Nyström methods are used to solve linear partial differential equations
Authors: I. Alonso-Mallo, B. Cano, M. J. Moreta
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we study the order reduction which turns up when explicit Runge-Kutta-Nyström methods are used to discretize linear second order hyperbolic equations by means of the method of lines. The order observed in practice, including its fractional part, is obtained, it is also proved that the order reduction can be completely avoided taking the boundary values of the intermediate stages of the time semidiscretization. The numerical experiments confirm that the optimal order can be reached.
Optimal grid representations
Venue: Networks (2004)

A graph G is a grid intersection graph if G is the intersection graph of &Hscr; &cup; &Iscr;, where &Hscr; and &Iscr; are, respectively, finite families of horizontal and vertical linear segments in the plane such that no two parallel segments intersect. &lpar;This definition implies that every grid intersection graph is bipartite.&rpar; The family &Hscr; &cup; &Iscr; is a representation of G. As a consequence of a characterization of grid intersection graphs by Kratochv&iacute;l, we observe that when a bipartite graph G &equals; &lpar;U &cup; W, E&rpar; with minimum degree at least two is a grid intersection graph, then there exists a normalized representation of G on the &lpar;r &times; s&rpar;-grid for r &equals; &verbar;U&verbar; and s &equals; &verbar;W&verbar;, that is, a representation in which all end points of segments have integer-valued coordinates belonging to &lcub;&lpar;x, y&rpar; &isin; N &times; N &verbar; 1 &le; y &le; r, 1 &le; x &le; s&rcub; and the representative segment of each vertex lies on a distinct horizontal or vertical line. A natural problem, with potential applications to circuit layout, is the following: among all the possible normalized representations of G, find a representation &Rscr; such that the sum of the lengths of the segments in &Rscr; is minimum. In this work we introduce this problem and present a mixed integer programming formulation to solve it. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;3&rpar;, 187&ndash;193 2004
Emerging customer trends towards mobile music services
Authors: Pavlos Vlachos, Adam Vrechopoulos
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Elaborating on the rapid evolution of mobile entertainment services, this paper investigates customers' preferences and attitudes towards mobile music services in Europe through an exploratory research approach. The study ran in Finland, United Kingdom and Greece, targeting both music consumers and music professionals. Significant differences were observed between the three countries in terms of the importance music consumers attach to specific mobile music buying criteria and functionalities. Music consumers and music professionals evaluated the sound/image quality and the music content variety as the most important mobile music selection criteria. Ubiquity is the most attractive mobile music service for both music consumers and professionals, while content personalization is the most desired feature for music consumers and the least desired one for music professionals. However, there were no considerable differences observed between music consumers' and music professionals' attitudes towards mobile music services. The findings imply that mobile music service providers should design tailored marketing mix programs towards sufficiently meeting the needs and attitudes of local customers in the emerging mobile music industry. Finally it seems that B2B and B2C segments do not significantly differ in their preferences regarding the features and functionalities of a mobile music service.
On Downlink Beamforming Methods: Capacity and Error Probability Performance
Authors: Jinho Choi, Seung Won Choi
Venue: Wireless Personal Communications: An International Journal (2004)

In space-division multiple access (SDMA), different beamforming or space-domain precoding techniques can be applied. We investigate two different space-domain precoding methods, the maximum capacity (MC) and the minimum mean square error (MMSE) precoders, for the downlink channel. It is shown that the MMSE precoding, which is practically implementable, can provide a reasonable performance in terms of the capacity and error probability, while the MC precoding is not practical (although it is optimum in terms of the capacity). Space-domain precoding methods are also applied to code-division multiple access (CDMA) systems.
Business types, e-strategies, and performance
Authors: Vincent S. Lai, Bo K. Wong
Venue: Communications of the ACM (2005)

Of the multitude of dot-coms in existence in the 1990s, only a fraction survived the crash of the e-commerce (EC) market in the summer of 2000. These companies must now rediscover the principles that governed businesses prior to the EC era. Dot-coms must be rebuilt and transformed to face the new economy: not only must they devise innovative e-strategies [1], but they must also restructure around new business models. After such reengineering efforts, some dot-coms have steadily recuperated from the debacle, but many more are still struggling.Little research has compared the performance of companies with different business types, including B2B, B2C, and non-EC, and explored their endeavors to continue after the EC crash. In this article we report the results of our investigation of EC companies in the aftermath of the crash, with particular emphasis on their performance as compared to their counterpart non-EC companies, and in light of their EC operations experience. We also identify e-strategies introduced by different companies and evaluated their effectiveness by correlating them with company performance, and examine whether this strategy-performance relationship is contingent upon business type.Our study adopted a three-stage data collection method. The first stage involved an analysis of the annual reports of 103 companies listed in the Growth Enterprise Market (GEM), which was established by the Stock Exchange of Hong Kong in November 1999. In addition, 16 EC companies with similar histories, reputations, and backgrounds were included. Although GEM imposes no restrictions on the nature of an applicant's business, many of its listed companies come from IT or EC-related fields. Classification of EC and non-EC companies was based on the Dow Jones Internet Index, which classifies firms as EC companies if they derive more than 50% of revenue from EC activities. The latest reports of these 119 companies were thoroughly analyzed to derive financial indices of performance.
Upper Body Pose Estimation from Stereo and Hand-Face Tracking
Authors: Jane Mulligan
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In applications such as immersive telepresence we want to extract high quality 3D models of collaborators in real time from multiview image sequences. One way to improve the qualityof stereo or visual hull based models is to estimate the kinematic pose of the user first and then constrain 3D reconstruction accordingly. To serve as a preprocessing step such pose extraction must be very fast, precluding the usual generate and test techniques. We examine a method based on psychophysical evidence that known relative hand position can be used to directly compute the pose of the arm. First we explore a number of possible models for this relationship using motion capture data. We then examine how reconstruction of face and hand position as well as a patch on the torso, allow us to exploit these simple direct calculations to estimate the pose of a user in a desktop collaboration environment.
Knowledge management in China
Authors: Glen R. Burrows, Damon L. Drummond, Maris G. Martinsons
Venue: Communications of the ACM (2005)

China's high-priority effort to become a more knowledge-based economy and society means that knowledge management (KM) is increasingly important. For example, the timely transfer and use of business knowledge can provide a competitive advantage in practically any given industry. Despite its enormous promise in business and science, effective KM also faces formidable obstacles. Here, we explore the most notable ones in the China context.We have used surveys, interviews, focus groups, longitudinal case studies, and anecdotal information for more than a decade to develop an understanding of how knowledge is managed in China and its role in the country's drive for global competitiveness. KM in China is distinctive, constrained somewhat by technological limitations, but influenced more significantly by psychological factors (such as cultural values) among groups and social levels. Here, we describe the distinctive aspects of knowledge generation, documentation, transfer, and use that prevail in China today, highlighting the key factors influencing Chinese KM.
Perfect Simulations for Random Trip Mobility Models
Authors: Santashil PalChaudhuri, Jean-Yves Le Boudec, Milan Vojnovic
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

The random trip model was recently proposed as a generic mobility model that contains many particular mobility models, including the widely-known random waypoint and random walks, and accommodates more realistic scenarios. The probability distribution of the movement of a mobile in all these models typically varies with time and converges to a "steady state" distribution (viz. stationary distribution), whenever the last exists. Protocol performance during this transient phase and in steady-state may differ significantly. This justifies the interest in perfect sampling of the initial node mobility state, so that the simulation of the node mobility is perfect, i.e. it is in steady state throughout a simulation. In this work, we describe implementation of the perfect sampling for some random trip models. Our tool produces a perfect sample of the node mobility state, which is then used as input to the widely-used ns-2 network simulator. We further show some simulation results for a particular random trip mobility model, based on a real-world road map. The performance metrics that we consider include various node communication properties and their evolution with time. The results demonstrate difference between transient and steady-state phases and that the transient phase can be long lasting (in the order of a typical simulation duration), if the initial state is drawn from a non steady-state distribution. The results give strong arguments in favor to running perfect simulations. Our perfect sampling tool is available to public at: http://www.cs.rice.edu/¡«santa/research/mobility.
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access
Authors: Xin Wang, Koushik Kar
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

In this paper, we address the rate control problem in a multi-hop random access wireless network, with the objective of achieving proportional fairness amongst the end-to-end sessions. The problem is considered in the framework of nonlinear optimization. Compared to its counterpart in a wired network where link capacities are assumed to be fixed, rate control in a multi-hop random access network is much more complex and requires joint optimization at both the transport layer and the link layer. This is due to the fact that the attainable throughput on each link in the network is `elastic' and is typically a non-convex and non-separable function of the transmission attempt rates. Two cross-layer algorithms, a dual based algorithm and a primal based algorithm, are proposed in this paper to solve the rate control problem in a multi-hop random access network. Both algorithms can be implemented in a distributed manner, and work at the link layer to adjust link attempt probabilities and at the transport layer to adjust session rates. We prove rigorously that the two proposed algorithms converge to the globally optimal solutions. Simulation results are provided to support our conclusions.
The internet enlightens and empowers Chinese society
Authors: Maris G. Martinsons
Venue: Communications of the ACM (2005)

Charles Zhang is founder, chairman, and chief executive of Sohu.com, a company incorporated in the U.S. state of Delaware with headquarters in Beijing. In 2004, Sohu took in more than $100 million (U.S.) in revenue by providing online information and services. Zhang established the company in 1996 as Internet Technologies China and two years later launched the first Chinese-language search engine Sohu, or "search fox." Sohu.com was listed on the NASDAQ stock exchange in July 2000; its market capitalization topped $1.4 billion in 2003 before declining in 2004.Zhang pioneered the Silicon Valley model of entrepreneurship in mainland China and is often referred to as China's Bill Gates. In 1998, Time Digital named him one of the world's Top 50 Digital Elite, and the World Economic Forum identified him as a Global Leader of Tomorrow. In 2003, he was featured in Time magazine as one of its 15 Global Tech Gurus, and in BusinessWeek as one of 25 global e-business CEOs. In 2004, he was selected the Distinguished Executive of the Year by the (U.S.) Academy of Management. He spoke with me during and after the 64th Annual Meetings of the (U.S.) Academy of Management in New Orleans, August 2004.
Review of "Subjective Understanding, Computer Models of Belief Systems by Jaime G. Carbonell"; UMI Research Press, Ann Arbor Michigan Copyright 1981
Authors: Gary Carlson
Venue: Issue 80 (April 1982) (1982)

This is a very interesting and very important book. It is based on Carbonell's 1979 Yale Ph.D. thesis working under Schank and Abelson and others. The book is only 285 pages long but it has a lot of outstanding material in it. It has a very useful discussion of the whole question of subjective understanding. It appears that there are operating programs running on the DEC 10 or DEC 20 though no program listing are given. It would have been helpful if there had been a little more technical information on the program languages used and the amount of memory and machine capacity used.
The human factors and ergonomics society perspective
Authors: Arnold M. Lund, Lynn Strother, Wendy A. Rogers
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We first describe the Human Factors and Ergonomics Society (HFES), then our challenges with respect to meeting the needs of multidisciplinary professionals. We discuss how HFES has tried, as a professional organization, to meet the needs of its diverse members.
TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast
Authors: Baihua Zheng, Xia Wu, Xing Jin, Dik Lun Lee
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Wireless broadcast is very suitable for delivering information to a large user population. In this paper, we concentrate on data allocation methods for multiple broadcast channels. To the best of our knowledge, this is the first allocation model that takes into the consideration of items' access frequencies, items' lengths. and bandwidth of different channels. We first derive the optimal average expected delay for multiple channels for the general case where data access frequencies, data sizes, and channel bandwidths can all be non-uniform. Second, we develop TOSA, a multi-channel allocation method that does not assume a uniform broadcast schedule for data items on the same channel. TOSA is based on the idea of two-level data allocation, i.e., a high-level optimization step for allocating data to the channels, followed by a low-level optimization step to schedule data within a channel. We show that TOSA achieves near-optimal performance in terms of average waiting time and significantly outperforms the existing algorithms.
The first year
Authors: Matthias Felleisen
Venue: Journal of Computing Sciences in Colleges (2005)

My team and I have spent the last ten years developing an alternative approach to teaching computing and programming in first-year courses. Unlike conventional approaches, ours focuses on program design in a systematic manner. The syntax of the underlying programming language (both Java and Scheme) is only discussed as needed.Field tests with over 200 high schools and almost a dozen colleges have shown time and again that the approach produces students with a better understanding of computing and object-oriented programming than conventional approaches. In several controlled studies, we could also show that students find our curriculum more appealing than the AP curriculum.In my talk, I will provide an overview of the project, especially its intellectual premises and principles, but. I will also present some of the software that we have developed in support of the first-year courses. I will then briefly review our outreach effort and our experiences with field tests. My goal is to encourage all of you to think about the first year in a different way. The old ones have failed, and if we want our beautiful discipline to survive, we must find a good way of teaching it.