ppxscal/embedding_network huggingface dataset:
Supporting reflective practice in creativity education
Authors: Norio Ishii, Kazuhisa Miwa
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In this study, we design a learning environment to foster participants' creative attitude and evaluate its effectiveness in a university class. Our educational program consists of the following three phases: (1) introduction (studying the basics of Mindstorms used as a tool), (2) creative activities (producing playground equipment using Mindstorms), and (3) self-reflective activities on the creative processes (each group constructing a diagram describing their own creative processes and discussing the processes). We evaluate the effectiveness based on comparisons of pre- and post-tests and the contents of the participants' discussions. In particular, we confirm the following three learning activities: (1) the participants discussed their creative activities from various viewpoints, (2) they also discussed the viewpoints considered to be important for creative activities, and (3) they realized the importance of idea generation, idea embodiment, and collaboration in creative activities.
A Quantitative Comparison of 4 Algorithms for Recovering Dense Accurate Depth
Authors: Baozhong Tian, John L. Barron
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We report on 4 algorithms for recovering dense depth maps from losing image sequences, where the camera motion is known a priori.All methods use a Kalman filter to integrate intensity derivatives or optical flow over time to increase accuracy.
Stream Register Files with Indexed Access
Authors: Nuwan Jayasena, Mattan Erez, Jung Ho Ahn, William J. Dally
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Many current programmable architectures designed to exploit data parallelism require computation to be structured to operate on sequentially accessed vectors or streams of data. Applications with less regular data access patterns perform sub-optimally on such architectures. This paper presents a register file for streams (SRF) that allows arbitrary, indexed accesses. Compared to sequential SRF access, indexed access captures more temporal locality, reduces data replication in the SRF, and provides efficient support for certain types of complex access patterns. Our simulations show that indexed SRF access provides speedups of 1.03x to 4.1x and memory bandwidth reductions of up to 95% over sequential SRF access for a set of benchmarks representative of data-parallel applications with irregular accesses. Indexed SRF access also provides greater speedups than caches for a number of application classes despite significantly lower hardware costs. The area overhead of our indexed SRF implementation is 11%-22% over a sequentially accessed SRF, which corresponds to a modest 1.5%-3% increase in the total die area of a typical stream processor.
Exploration of textual document archives using a fuzzy hierarchical clustering algorithm in the GAMBAL system
Authors: Vicenç Torra, Sadaaki Miyamoto, Sergi Lanau
Venue: Information Processing and Management: an International Journal (2005)

The Internet together with the large amount of textual information available in document archives, has increased the relevance of information retrieval related tools. In this work we present an extension of the Gambal system for clustering and visualization of documents based on fuzzy clustering techniques. The tool allows to structure the set of documents in a hierarchical way (using a fuzzy hierarchical structure) and represent this structure in a graphical interface (a 3D sphere) over which the user can navigate.Gambal allows the analysis of the documents and the computation of their similarity not only on the basis of the syntactic similarity between words but also based on a dictionary (Wordnet 1.7) and latent semantics analysis.
Dynamic Primitive Caching for Haptic Rendering of Large-Scale Models
Authors: Mashhuda Glencross, Roger Hubbold, Ben Lyons
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we present a software approach to managing complexity for haptic rendering of large-scale geometric models, consisting of tens to hundreds of thousands of distinct geometric primitives. A secondary client-side caching mechanism, exploiting partitioning, is used to dynamically update geometry within the locality of a user. Results show that the caching mechanism performs well, and that graphical rendering performance becomes an issue before the caching mechanism fails. The performance penalty of the caching technique was found to be dependent on the type of partitioning method employed.
Scalable synchronization of intermittently connected database clients
Authors: Wai Gen Yee, Ophir Frieder
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Synchronization performance is a major problem with intermittently connected mobile databases. A server periodically generates update files for each client, which are downloaded and applied when convenient. Unfortunately, the time required to synchronize clients in this way increases drastically with client population. We show that this trend could be altered by appropriately modifying the way that update files are designed, resulting in significant performance improvements.
Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks
Authors: Wook Choi, Sajal K. Das, Jiannong Cao, Ajoy K. Datta
Venue: Journal of Parallel and Distributed Computing (2005)

Several approaches have been proposed for designing multihop routing protocols in mobile ad hoc networks (MANET). Many of them adopt a method, called flooding, to discover a routing path. Due to the time-varying nature of the route in MANET, the discovered route needs to be dynamically maintained for optimality in terms of traffic load, hop-distance, and resource usage. It is easy to see that flooding incurs significant overhead and hence is inappropriate for the dynamic route maintenance. In this paper we propose a randomized, dynamic route maintenance scheme for adaptive routing in MANET. The scheme makes use of a nomadic control packet (NCP) which travels through the network based on a random walk, and collects its stopovers as a traversal record. The NCP uses the traversal record to probabilistically provide the nodes with clue for routing path updates. From the clue, the nodes can find the routing path update information that is up-to-date and optimal (less-loaded and shorter), thereby adapting to the dynamic network topology and traffic load conditions. We present an analytical model for measuring the effectiveness of NCP in terms of its frequency of visits and probability of finding the clue from the NCP traversal record. The proposed randomized scheme serves as a routing protocol supporting layer and can be easily applied with minimum modifications to the existing on-demand routing protocols such as AODV and DSR. In our experimental study, we modified the AODV protocol to maintain routing paths using NCPs' traversal record. Simulation results show that NCPs help the routing protocol to notably reduce average end-to-end packet delay with increased route optimality and better control on traffic congestion.
Natural Language interfaces to "layered" domains: Duke University
Authors: Bruce W. Ballard
Venue: Issue 79 (January 1982) (1982)

The Natural Language Computer [3,4] provides users with a domain of one or more matrices, displayed on a CRT screen, and interactively operated on by typing a sequence of English commands. Performance studies with NLC have been favorable [5]. However, users are required to formulate all inputs in terms of only matrix operations. Thus, when subjects solving a Gradebook problem (illustrated below) wanted to refer to "Jack's quiz scores", they had to type (say) #entries in the row named Jack and in columns 1 and 2".
Studying interorganizational systems using multiple perspectives
Authors: Mohammed Ibrahim
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Interorganizational systems (IOS) are used to facilitate communications and coordination within interorganizational relationships. The different types of interorganizational relationships have different objectives and accordingly require different resources and capabilities. We construct a theoretical model that employs intuitions from multiple theories including political economics, transaction cost economics and the resource-based approach. The model argues that the relationship-specificity of the objectives of the interorganizational relationship (IOR) influences the interorganizational dependence and trust. The dependence and trust affect the investment of relationship-specific IOS related resources and subsequently, combinations of these resources produce relationship-specific IOS related capabilities. These capabilities support the relationship-specific IOR objectives.
Designing Secure Wireless Mobile Ad Hoc Networks
Authors: Venkatesan Balakrishnan, Vijay Varadharajan
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In recent years, security in MANET is anticipated as the pre-establishment of specific information among the participating nodes, so that the future communications can be secured through a newly designed protocol, which deploys cryptographic mechanisms over the pre-established information. In this paper we suggest three dimensions to secure the communications in wireless mobile ad hoc networks. Then we demonstrate the issues that might creep out in the security design, when a cryptographic technique alone is involved. Also we suggest how to counter those issues through the combination of trust management with cryptographic mechanisms. Moreover, we propose the need to introduce the notion of heterogeneity resource management in the security design to address the divergence among the nodes, which can be taken advantage to diminish the packet drop attacks.
Novell Linux Desktop 9 User's Handbook
Authors: James Pyles, Marie Perry
Venue:  (2005)

Novell Linux Desktop 9 User's Handbook is the official handbook to help you take control of you Novell Linux Desktop. Walk through the new Novell Linux interfaces as you learn how to use them, interact with the operating system, create files and more. Cover everything that you need to know to effectively and efficiently use the new desktop and quickly get up to speed on the latest technology from Novell with Novell Linux Desktop 9 User's Handbook.
Selected M-Related Dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 110 (October 1989) (1989)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Structural, electrical and mechanical properties of templated silsesquioxane porous films
Authors: Suzhu Yu, Terence K. S. Wong, Xiao Hu, Jun Wei, Ming Shyan Yong
Venue: Microelectronic Engineering (2005)

Porous dielectric films were successfully synthesized by incorporating poly(amidoamine) (PAMAM) template to silsesquioxane host polymer. The structural, electrical and mechanical properties of the films could be tuned with PAMAM concentration. The porosity of the films increased while the dielectric constant of the films decreased with PAMAM fraction. Films with ultra-low dielectric constant about 2.06 could be obtained with leakage current density on the order of 10^-^7 A/cm^2 at 1 MV/cm. The conduction mechanism was analyzed and showed that the carries in the films followed Schottky mechanism. The mechanical properties of the films were determined with nanoindentation. Both elastic modulus and hardness decreased with PAMAM concentration, suggesting that the incorporation of the porosity to the films compromised their mechanical properties.
Back to the St. Petersburg Paradox?
Authors: Pavlo R. Blavatskyy
Venue: Management Science (2005)

The conventional parameterizations of cumulative prospect theory do not explain the St. Petersburg paradox. To do so, the power coefficient of an individual's utility function must be lower than the power coefficient of an individual's probability weighting function.
Human motion reconstruction from monocular images using genetic algorithms: Research Articles
Authors: Jianhui Zhao, Ling Li
Venue: Computer Animation and Virtual Worlds (2004)

This paper proposed an optimization approach for human motion recovery from the un-calibrated monocular images containing unlimited human movements. A 3D skeleton human model based on anatomy knowledge is employed with encoded biomechanical constraints for the joints. Energy Function is defined to represent the deviations between projection features and extracted image features. Reconstruction procedure is developed to adjust joints and segments of the human body into their proper positions. Genetic Algorithms are adopted to find the optimal solution effectively in the high dimensional parameter space by simultaneously considering all the parameters of the human model. The experimental results are analysed by Deviation Penalty. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Minimal-Time k-Line Broadcasting
Authors: I. Gaber
Venue: SIAM Journal on Discrete Mathematics (2005)

Broadcasting refers to the process of sending a message from a source to an entire communication network. Line broadcasting (defined by Farley [Networks, 10 (1980), pp. 59--70]) assumes that members may "switch-through" any number of calls during a time unit. Namely, two members of the network may communicate with each other through a path as long as no link is involved in more than one call at the same time unit. Two paths may intersect, during a given time unit, only in vertices. A generalization of that model is the k-line-broadcasting model, which has the same properties as the line-broadcasting model with the additional constraint that the distance between two communicating members is at most k. The parameters to the problem are the network, the originator, and k.In this paper we generalize Farley's algorithm into the k-line-broadcasting model. An algorithm is presented which produces a k-line-broadcasting scheme for any given tree and source vertex which consumes $O({D\over k}+\log_2 n)$ time units, where n is the number of vertices and D is the distance of the furthest vertex from the originator. This asymptotically achieves the lower bound provided.
CMC: a pragmatic approach to model checking real code
Authors: Madanlal Musuvathi, David Y. W. Park, Andy Chou, Dawson R. Engler, David L. Dill
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of execution. Model checking [4] is an effective way to find such subtle errors. It takes a simplified description of the code and exhaustively tests it on all inputs, using techniques to explore vast state spaces efficiently. Unfortunately, while model checking systems code would be wonderful, it is almost never done in practice: building models is just too hard. It can take significantly more time to write a model than it did to write the code. Furthermore, by checking an abstraction of the code rather than the code itself, it is easy to miss errors.The paper's first contribution is a new model checker, CMC, which checks C and C++ implementations directly, eliminating the need for a separate abstract description of the system behavior. This has two major advantages: it reduces the effort to use model checking, and it reduces missed errors as well as time-wasting false error reports resulting from inconsistencies between the abstract description and the actual implementation. In addition, changes in the implementation can be checked immediately without updating a high-level description.The paper's second contribution is demonstrating that CMC works well on real code by applying it to three implementations of the Ad-hoc On-demand Distance Vector (AODV) networking protocol [7]. We found 34 distinct errors (roughly one bug per 328 lines of code), including a bug in the AODV specification itself. Given our experience building systems, it appears that the approach will work well in other contexts, and especially well for other networking protocols.
Novell Open Enterprise Server Administrator's Handbook, NetWare Edition
Authors: Jeffrey Harris
Venue:  (2005)

Novell® Open Enterprise Server Administrator's Handbook, NetWare®ï¾ Edition ï¾ covers the major components and features of Open Enterprise Server (OES) on the NetWare platform. This book helps you understand how to integrate the benefits of OES in an existing environment.ï¾ After a brief introduction to the concepts necessary to introduce features, the book focuses on the implementation of OES on the NetWare platform. While this book is not a reference for network theory, protocols or architectures,ï¾ the administrator will learnï¾ about adding open source options, features and technologies that extend the applicability and value of NetWare and how to use the major components and features of OES on NetWare.
The Design and Implementation of Ubiquitous Haptic Device
Authors: Yuichiro Sekiguchi, Koichi Hirota, Michitaka Hirose
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, we propose a new type of haptic device named "ubiquitous haptic device". In this idea, several devices in ubiquitous environment have a capability of displaying haptic sensation. And user can interact these devices via sensation of touch and force. This is same as handling the ordinary tools with the feedback of haptic sensation. And we construct simple prototype of ubiquitous haptic device, which has the capability of displaying the sensation of something inside the device. And we present the way to construct the ubiquitous haptic device.
Numerical decomposition of geometric constraints
Authors: Sebti Foufou, Dominique Michelucci, Jean-Paul Jurzak
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of incidence constraints, such as collinearities and coplanarities. Jurzak's prover is used to find a similar configuration.
Memory resource management in VMware ESX server
Authors: Carl A. Waldspurger
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

VMware ESX Server is a thin software layer designed to multiplex hardware resources efficiently among virtual machines running unmodified commodity operating systems. This paper introduces several novel ESX Server mechanisms and policies for managing memory. A ballooning technique reclaims the pages considered least valuable by the operating system running in a virtual machine. An idle memory tax achieves efficient memory utilization while maintaining performance isolation guarantees. Content-based page sharing and hot I/O page remapping exploit transparent page remapping to eliminate redundancy and reduce copying overheads. These techniques are combined to efficiently support virtual machine workloads that overcommit memory.
Diffusion, use, and effect of the internet in China
Authors: Jonathan J. H. Zhu, Enhai Wang
Venue: Communications of the ACM (2005)

China has embraced the Internet. As of December 2004, 94 million people had gone online, making China the second largest Internet-user market in the world, behind only the U.S., according to the China Internet Network Information Center (CNNIC), which has carried out 15 semiannual surveys of Internet users in China since 1997.1The growth trajectory of the country's Internet use appears to follow the common S-curve of technology adoption seen around the world (see Figure 1). The collapse of the worldwide Internet bubble in 2000 and 2001 slowed diffusion only momentarily. The rate of growth accelerated again in 2002 and 2003, driven by a few leading applications, including online chat, online games, and the Web-based short message service (SMS).
Microprocessor technology for powered upper extremity prosthetic control systems
Authors: Staff
Venue: Robotica (2005)

Winfried Heim C.P.(c), Bloorview MacMillan Children's Centre, Prosthetic and Myoelectric Services, 350 Rumsey Road, Toronto, Ontario (Canada) M4G 1R8. 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
A configuration design based method for platform commonization for product families
Authors: Brian Corbett, David W. Rosen
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

Product families help companies reach customers in several different markets, lessen the time needed to develop new products, and reduce costs by sharing common components among many products. The product platform can be considered as a set of technologies, components, or functions, and their arrangements, that are utilized for more than one product. Configuration design focuses on the components in a product and their connections and relationships. Discrete, combinatorial design spaces are used to model design requirements regarding physical connections, module partitions, and assembly sequences for the product family. To ensure that products satisfy all design requirements, it is necessary to combine these design spaces into a common configuration space into which all requirements can be mapped. This paper presents computational methods for modeling and combining design spaces so those configurations can be identified that satisfy all constraints. A new representation of assembly sequences facilitates the development of an assembly design space, elements of which can be enumerated readily. Because the size of the combinatorial design spaces can become quite large, computational efficiency is an important consideration. A new designer guided method, called the partitioning method, is presented for decomposing configuration design problems in a hierarchical manner that enables significant reductions in design space sizes. An example of a family of automotive underbodies illustrates the application of the discrete design space approach to develop a common platform.