ppxscal/embedding_network huggingface dataset:
On Public and Private Rights in Digital Copyrights - A Legislative Perspective
Authors: Qing Yang, Xianqiang Zheng
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

This paper employs a legislative perspective to analyze the status quo of public and private rights related to digital copyrights in EC. The extension of public rights has been placed more importance than private rights reservation. It shows that public rights are essential, but private rights are more urgent to rescue. It is thus concluded that the desired legislation of copyrights is like this: private rights lead public rights, with assistance of IT and non-legal institutional innovations.
Higher-order subtyping and its decidability
Authors: Adriana Compagnoni
Venue: Information and Computation (2004)

We define the typed lambda calculus F^ω (F-omega-meet), a natural generalization of Girard's system Fω (F-omega) with intersection types and bounded polymorphism. A novel aspect of our presentation is the use of term rewriting techniques to present intersection types, which clearly splits the computational semantics (reduction rules) from the syntax (inference rules) of the system. We establish properties such as Church-Rosser for the reduction relation on types and terms, and strong normalization for the reduction on types. We prove that types are preserved by computation (subject reduction), and that the system satisfies the minimal types property. We define algorithms for type checking and subtype checking. The development culminates with the proof of decidability of typing in F^ω, containing the first proof of decidability of subtyping of a higher-order lambda calculus with subtyping.
Global and local synchrony of coupled neurons in small-world networks
Authors: Naoki Masuda, Kazuyuki Aihara
Venue: Biological Cybernetics (2004)

Synchronous firing of neurons is thought to play important functional roles such as feature binding and switching of cognitive states. Although synchronization has mainly been investigated so far using model neurons with simple connection topology, real neural networks have more complex structures. Here we examine the behavior of pulse-coupled leaky integrate-and-fire neurons with various network structures. We first show that the dispersion of the number of connections for neurons influences dynamical behavior even if other major topological statistics are kept fixed. The rewiring probability parameter representing the randomness of networks bridges two spatially opposite frameworks: precise local synchrony and rough global synchrony. Finally, cooperation of the global connections and the local clustering property, which is prominent in small-world networks, inforces synchrony of distant neuronal groups receiving coherent inputs.
Implementation and performance evaluation of CONFLEX-G: grid-enabled molecular conformational space search program with OmniRPC
Authors: Yoshihiro Nakajima, Mitsuhisa Sato, Hitoshi Goto, Taisuke Boku, Daisuke Takahashi
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

CONFLEX-G is the grid-enabled version of a molecular conformational space search program called CONFLEX. We have implemented CONFLEX-G using a grid RPC system called OmniRPC. In this paper, we report the performance of CONFLEX-G in a grid testbed of several geographically distributed PC clusters. In order to explore many conformation of large bio-molecules, CONFLEX-G generates trial structures of the molecules and allocates jobs to optimize a trial structure with a reliable molecular mechanics method in the grid. OmniRPC provides a restricted persistence model to support the parametric search applications. In this model, when the initialization procedure is defined in the RPC module, the module is automatically initialized at the time of invocation by calling the initialization procedure. This can eliminate unnecessary communication and initialization at each call in CONFLEX-G. CONFLEX-G can achieve performance comparable to CONFLEX MPI and can exploit more computing resources by allowing the use of a cluster of multiple clusters in the grid. The experimental result shows that CONFLEX-G achieved a speedup of 56.5 times in the case of the 1BL1 molecule, where the molecule consists of a large number of atoms, and each trial structure optimization requires significant time. The load imbalance of the optimization time of the trial structure may also cause performance degradation.
Dawn
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

We tried to create an attractive, realistic-looking real time character to show off the power of programmable shading and vertex processing on the GeForceFX. Dawn walks around, flirts with the camera, and makes faces at the audience. Copyright held by creator. 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
Overview of the COE Program
Authors: Yahiko Kambayashi
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

The big change expected in the 21st century includes therevolution of industrial structure and it is thought that peopleengaging in knowledge industries will increase in thefuture. The aim of this COE program is development of informationtechnologies for the basis of coming knowledgesociety as well as development of human resources to supportsuch a society. The establishment of studies for boundaryareas to other fields is especially pursued, while collaborationswith local communities and overseas base centersare featured.In this program, the school of informatics specialties,such as algorithms, basic theory, multimedia understanding,artificial intelligence, database and web are combinedsystematically and specialties such as intellectual informationmedia, database and web technology which are playinga main role in information distribution evolution will be furtherdeveloped. In addition, establishment of research fieldsfor boundary areas to other fields (agriculture, medicine,economy, law, education and psychology) is focused. Forthese purposes, development of human resources for the informationtechnology field is performed by local collaborationas field works, cooperative research at overseas basecenters.
A Framework for Constrained Functional Verification
Authors: Jun Yuan, Carl Pixley, Adnan Aziz, Ken Albin
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We describe a framework for constrained simulation-vector generationin an industry setting. The framework consists of two keycomponents: the constraint compiler and the vector generator. Theconstraint compiler employs various techniques, including prioritization,partitioning, extraction, and decomposition, to minimize theinternal representation of the constraints, and thus the complexityof constraint solving. The vector generator then uses the compileddata together with input biasing to generate random simulation vectors.Constraints and input biases are treated in a unified manner inthe vector generator. Although there are many alternative ways ofgenerating vectors from constraints, the framework uniquely suits apractical constrained verification environment because of its abilityto handle complicated constraints and its seamless treatment of constraintsand biases. We illustrate the effectiveness of the frameworkwith real examples from commercial designs.
A Collaborative Virtual Environment for Public Consultation in the Urban Planning Process
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

This paper extends research in Collaborative Virtual Environments(CVEs) by exploring their use in a purposefulinteractive public application. Though often discussed, fewsuch studies have been undertaken, since the widespreadavailability of 3D platforms is a recent phenomenon. Theapplication selected is that of Urban Design and review.The experiments use a virtual cityscape in which planningchanges are presented to the public at large. Respondentsinhabit the shared environment and can engage in dialoguewith other participants, modify and comment upon proposeddesigns.We want to prove that the ready accessibility of the 3Dpresentation, together with the communication stimulus ofthe shared environment, will facilitate useful communicationand engagement by the public in the planning processes.The research involves investigating the mechanismsof interaction, cooperation and design commentary withinthis process.
Coming soon
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2004)

RoBallet: Creativity Can Be Hard Fun Contextual Information Access and Storytelling in Mixed Reality Using Hypermedia Affective Usability Evaluation for an Interactive Music Television Channel High Performance Data Recording Architecture and High Definition Video Java Game Server Technology Jabber for Multiplayer Online Games Mobile Digital Rights Management for Multimedia Why We Play Games: Gaming Beyond Games Creating Emotion in Games and more... 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
Parallelization strategies for density matrix renormalization group algorithms on shared-memory systems
Authors: G. Hager, E. Jeckelmann, H. Fehske, G. Wellein
Venue: Journal of Computational Physics (2004)

Shared-memory (SMP) parallelization strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the standard DMRG algorithm can be accomplished in an efficient way. The methods are illustrated with DMRG calculations of the two-dimensional Hubbard model and the one-dimensional Holstein-Hubbard model on contemporary SMP architectures. The parallelized code shows good scalability up to at least eight processors and allows us to solve problems which exceed the capability of sequential DMRG calculations.
Fast Cycle-accurate Behavioral Simulation for Pipelined Processors Using Early Pipeline Evaluation
Authors: In-Cheol Park, Sehyeon Kang, Yongseok Yi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Modeling and simulating pipelined processors in procedurallanguages such as C/C++ requires lots of cost in handlingconcurrent events, which hinders fast simulation. A number ofresearches on simulation have devised speed-up techniques toreduce the number of events. This paper presents a newsimulation approach developed to enhance the simulation ofpipelined processors. The proposed approach is based on earlypipeline evaluation that all the intermediate values of aninstruction are computed in advance, creating a future state for thenext instructions. The future state allows the next instructions tobe computed without considering data dependencies betweennearby instructions. We apply this concept to building a cycle-accurate simulator for a pipelined RISC processor and achieve almost the same speed as the instruction-level simulator.
Efficient query reformulation in peer data management systems
Authors: Igor Tatarinov, Alon Halevy
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's domain of interest, and semantic relationships between peers are provided locally between pairs (or small sets) of peers. By traversing semantic paths of mappings, a query over one peer can obtain relevant data from any reachable peer in the network. Semantic paths are traversed by reformulating queries at a peer into queries on its neighbors.Naively following semantic paths is highly inefficient in practice. We describe several techniques for optimizing the reformulation process in a PDMS and validate their effectiveness using real-life data sets. In particular, we develop techniques for pruning paths in the reformulation process and for minimizing the reformulated queries as they are created. In addition, we consider the effect of the strategy we use to search through the space of reformulations. Finally, we show that pre-computing semantic paths in a PDMS can greatly improve the efficiency of the reformulation process. Together, all of these techniques form a basis for scalable query reformulation in PDMS.To enable our optimizations, we developed practical algorithms, of independent interest, for checking containment and minimization of XML queries, and for composing XML mappings.
Constructing convex 3-polytopes from two triangulations of a polygon
Authors: Benjamin Marlin, Godfried Toussaint
Venue: Computational Geometry: Theory and Applications (2004)

Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of it, T1 and T2 that share no diagonals, it is always possible to assign height values to the vertices of P such that P ∪ T1 ∪ T2 becomes a convex 3-polytope. Dekster found a counter example but left open the questions of deciding if a given configuration corresponds to a convex 3-polytope, and constructing such realizations when they exist. This paper presents a characterization of realizable configurations for Guibas' conjecture based on work from the area of polytope convexity testing. Our approach to the decision and construction problems is a reduction to a linearinequality feasibility problem. The approach is also related to methods used for deciding if an arbitrary triangulation of a point set is a regular triangulation. We show two reductions, one based directly on a global convexity condition resulting in number of inequalities that is quadratic in the number of vertices of P, and one based on an equivalent local convexity condition resulting in a linear number of inequalities.
A Systolic Parallel Multiplier over GF(3m) Using Neuron-MOS DLC
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper we present several different proposals forimplementing a multiple-valued (MV) semi-floating-gate(SFG) D-latch. This paper aims to illustrate the advantagesand disadvantages of each approach. Measurements froma fabricated chip at a 0.6µm CUP process is included forverifying the detailed arguments.
Mapping pedagogy and tools for effective learning design
Authors: G. Conole, M. Dyke, M. Oliver, J. Seale
Venue: Computers Education (2004)

A number of pedagogies and approaches are often quoted in the e-learning literature-constructivism, communities of practice, collaboration-but we suggest that much of what is described could more easily be explained in terms of didactic and behaviourist approaches to learning. In this paper we propose a model that supports the development of pedagogically driven approaches to e-learning. The paper begins by explaining how models can be used to represent theoretical approaches and to support practitioners' engagement with these. After outlining the method through which this can be achieved, a model of pedagogies is developed. This process begins with a review of learning theories, from which key components of learning are distilled. This abstraction is used as an analytical tool, allowing components of learning scenarios to be described and related to appropriate theoretical approaches through the use of specific tools and resources. Our assertion is that a better articulation and mapping of different pedagogical processes, tools and techniques will provide a pedagogic approach that is more reflexive and consistent with practitioners' theoretical perspective on learning and teaching.
Initial trust and the adoption of B2C e-commerce: The case of internet banking
Authors: Kyung Kyu Kim, Bipin Prabhakar
Venue: ACM SIGMIS Database (2004)

A possible reason for the delayed acceptance of the Internet as a retail distribution channel may be the lack of trust consumers have in the electronic channel and in the Web merchants. Few prior studies on the adoption of business-to-consumer e-commerce have considered trust in information technology as an important determinant of adoption behavior. This research explicitly encompasses the electronic channel and the merchant as objects to be trusted in a specific e-commerce application, i.e. Internet banking.Our conceptual model posits that initial trust in the electronic channel as a banking medium and trust in bank are the major determinants of adoption behavior. Based on social network theory and trust theory, determinants of trust in the electronic channel such as propensity-to-trust, word-of-mouth (WOM) referrals, structural assurances, are included in the research model.The analyses of independent variables indicated that propensity-to-trust, structural assurances, and relational content of WOM were significant predictors of initial trust in the electronic channel. Our findings also indicated that a significant relationship exists between initial trust in the electronic channel and the adoption of Internet banking. However, further analysis revealed that trust could be a necessary but not a sufficient condition for the adoption of Internet banking.
An Enhanced Multilevel Algorithm for Circuit Placement
Authors: Tony F. Chan, Jason Cong, Tim Kong, Joseph R. Shinnerl, Kenton Sze
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper presents several important enhancements to therecently published multilevel placement package mPL.The improvements include (i) unconstrained quadratic relaxation on small, noncontiguous subproblems at every level of the hierarchy; (ii) improved interpolation (declustering)based on techniques from algebraic multigrid (AMG), and(iii) iterated V-cycles with additional geometric informationfor aggregation in subsequent V-cycles. The enhanced version of mPL, named mPL2, improves the total wirelength result by about 12% compared to the original version. The attractive scalability properties of the mPL run time have beenlargely retained, and the overall run time remains very competitive. Compared to gordian-l-domino on uniform-cell-size IBM/ISPD98 benchmarks, a speed-up of well over8x on large circuits (¿ 100,000 cells or nets) is obtainedalong with an average improvement in total wirelength ofabout 2%. Compared to Dragon [32] on the same benchmarks, a speed-up of about 5x is obtained at the cost ofabout 4% increased wirelength. On the recently publishedPEKO synthetic benchmarks, mPL2 generates surprisinglyhigh-quality placements - roughly 60% closer to the optimal than those produced by Capo 8.5 and Dragon - inrun time about twice as long as Capo's and about 1/10th of Dragon's.
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
Authors: Stergios I. Roumeliotis, Ioannis M. Rekleitis
Venue: Autonomous Robots (2004)

This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The focus of this paper is to examine the effect on localization accuracy of the number N of participating robots and the accuracy of the sensors employed. More specifically, we investigate the improvement in localization accuracy per additional robot as the size of the team increases. Furthermore, we provide an analytical expression for the upper bound on the positioning uncertainty increase rate for a team of N robots as a function of N, the odometric and orientation uncertainty for the robots, and the accuracy of a robot tracker measuring relative positions between pairs of robots. The analytical results derived in this paper are validated both in simulation and experimentally for different test cases.
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system
Authors: Amitava Datta, Subbiah Soundaralakshmi
Venue: Journal of Parallel and Distributed Computing (2004)

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. We present two algorithms for computing the EDT on the linear array with a reconfigurable pipelined bus system (LARPBS), a recently proposed architecture based on optical buses. Our first algorithm runs in O(log log N) time for a binary N × N image on an LARPBS with N2+ε processors, for any fixed ε, 0<ε<1. Our second algorithm is highly scalable and runs in O(N2/p2log log p) time if the LARPBS has only p2+ε processors for p< N. The previous best deterministic algorithm for computing the EDT on the LARPBS is by Pan et al. Proceedings of IPDPS 2000 Workshop on Parallel and Distributed Computing in Image Processing, Video Processing and Multimedia (PDIVM 2000), Lecture Notes in Computer Science, Vol. 1800, Springer, Berlin, 178). Their algorithm runs either in O(log N log log N) time on an LARPBS with N2 processors or in O(log log N) time on an LARPBS with O(N3) processors.
Case Study on Retail Customer Communication Applying Ubiquitous Computing
Authors: Jens Struker, Stefan Sackmann, Gunter Muller
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

The use of mobile information systems and communication technology furthers the informatization and automation of operating processes. In the retail industry, mobile communication technology affords new forms of customer communication by establishing electronic and individually designable channels of communication. In conjunction with powerful information systems, these options enable both improved services for customers and an increase in turnover and profit through more flexible and individualized pricing and communication policy. This contribution exemplifies the forms of pricing policy considering the "Extra Future Store" of METRO Group^1 as case study and identifies two determinants of success for these new types of electronic customer communications: the power of disposal over the end device and the range of communication.
Robust Principal Component Analysis with Adaptive Selection for Tuning Parameters
Authors: Isao Higuchi, Shinto Eguchi
Venue: The Journal of Machine Learning Research (2004)

The present paper discusses robustness against outliers in a principal component analysis (PCA). We propose a class of procedures for PCA based on the minimum psi principle, which unifies various approaches, including the classical procedure and recently proposed procedures. The reweighted matrix algorithm for off-line data and the gradient algorithm for on-line data are both investigated with respect to robustness. The reweighted matrix algorithm is shown to satisfy a desirable property with local convergence, and the on-line gradient algorithm is shown to satisfy an asymptotical stability of convergence. Some procedures in the class involve tuning parameters, which control sensitivity to outliers. We propose a shape-adaptive selection rule for tuning parameters using K-fold cross validation.