ppxscal/embedding_network huggingface dataset:
Development of a Motion Teaching System Using an Immersive Projection Display and a Haptic Interface
Authors: Mutsuki Matsumoto, Hiraoki Yano, Hiroo Iwata
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This paper describes the development cf a motion reaching system that uses VR technology. The sytem consists of haptic interface and an immersive projection display. The haptic interface is a force display that makes use of a gyrosropic force. The immersive projection display has 3 large screens that cover the front, bottom and right-hand sides of the user: The display can project a video avatar; which consists of video images of a person, The system can present the motion of a trainer to a trainee by using video avatar images and haptic feedback that am based on the motion of the trainer: The performance of this motion teaching system was evaluated by carrying out some experiments involving motion data that were derived from a traditional SHORINJI Irainer
An engineering design teaching guide for high school teachers
Authors: S. L. Titcomb
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

We describe a teacher's guide for those wishing to incorporate engineering concepts and practices into the high school science and math curriculum. The teacher's guide includes the following aspects of engineering design: problem analysis, brainstorming solutions, teamwork, documentation, prototyping, materials selection, testing, and cost-effectiveness. It is oriented toward encouraging participation in our annual engineering design contest.
A general methodology for engineering education using the Internet
Authors: W. Braga
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The general methodology described herein was designed to enhance engineering education through the use of the Internet and has been implemented with success. Although it uses resources and techniques normally implemented on distance-education courses, the methodology is centered on the fundamental role that teacher and instructors have in youth education, usually transmitted through eye-to-eye contact. It has therefore been developed to support presential classes. Intensive (but not exclusive) use is made of Web resources to deliver content. For instance, the e-groups collaborative message system is used to foster communication, between students themselves and the instructor, thus creating a collaborative environment. Group work is frequently encouraged but attention is also directed to individual learning through challenging questions and examinations proposed on a monthly basis. Java applets are used to develop self-evaluation tests and online tutorials, allowing student to analyze their learning progress individually. Spreadsheets, computer programs and the like are available, developed according to Bloom's learning objectives. 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
Surface reconstruction using oriented charges
Authors: J. Wang, M. M. Oliveira, H. Xie, A. E. Kaufman
Venue: Proceedings of the Computer Graphics International 2005 (2005)

We introduce the notion of oriented charges to compute distance fields from unorganized point clouds. Unlike traditional implicit function methods that usually require normal information, our approach only uses information about the position of the samples. Our approach is adaptive, using an octree to reorganize the input points, thus avoiding difficulties often associated with the use of local distance fields. The resulting representation is simple, efficient and general in the sense that it handles complex models of arbitrary topology, is robust in the presence of noise and fills holes automatically.
A Fair Fast Scalable Rea,der-Writer Lock
Authors: Orran Krieger, Michael Stumm, Ron Unrau, Jonathan Hanna
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

A reader-writer (RW) lock allows either multiple readers to inspect shared data or a single writer exclusive access for modifying that data. On shared memory multiprocessors,cost of acquiring and releasing these locks can have a large impact on the performance of parallel applications. A major problem with naive implementations of these locks, where processors spin on a global lock variable waiting for the lock to become available, is that the memory containing the lock and the interconnection network to that memory will also become contended when the lock is contended.
Discovering laws as anomalies in logical worlds
Authors: Lenhart K. Schubert
Venue:  (2006)

In this dissertation, we investigate the problem of "descriptive" learning---that is, learning rules that describe the underlying structure of a domain---in rich, qualitative worlds. Previous approaches to this problem have searched for laws in top-down, enumerative fashion: by enumeration of syntactic forms followed by verification against the data. Such methods are both slow and restricted in the types of rules they can find.We present a series of descriptive-learning algorithms that belong to an alternative, data-driven search paradigm, in which the search is guided not by relationships between the forms of the hypothesized rules but by correlations in the data they represent. Our systems work by exploiting anomalies in this data: They hypothesize that patterns that are very unlikely to have arisen by chance represent features of the domain.We describe separate data-driven methods for rule-discovery in propositional and in relational domains. We also present refinements to our relational rule-discovery system that make possible, first, the automatic identification and exploitation of variable-type information, and second, the use of dynamic, "just-in-time" object sampling to increase efficiency at little cost in accuracy.We apply our methods to the problem of finding planning invariants---formulae that are true in every reachable state of a planning world---which require richly-expressive languages to describe. Previous automatic invariant-discovery methods have worked by deduction from the operators. We show how our discovery methods provide a novel inductive approach to this problem, and can find invariants from nothing but a few reachable-state descriptions. We demonstrate that the number and types of laws we discover are comparable to those discovered by systems that require complete operator descriptions in addition to state descriptions.
Using web application construction frameworks to protect against code injection attacks
Authors: Benjamin Livshits, Úlfar Erlingsson
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

In recent years, the security landscape has changed, with Web applications vulnerabilities becoming more prominent that vulnerabilities stemming from the lack of type safety, such as buffer overruns. Many reports point to code injection attacks such as cross-site scripting and RSS injection as being the most common attacks against Web applications to date. With Web 2.0 existing security problems are further exacerbated by the advent of Ajax technology that allows one to create and compose HTML content from different sources within the browser at runtime, as exemplified by customizable mashup pages like My Yahoo! or Live.com This paper proposes a simple to support, yet a powerful scheme for eliminating a wide range of script injection vulnerabilities in applications built on top of popular Ajax development frameworks such as the Dojo Toolkit, prototype.js, and AJAX.NET. Unlike other client-side runtime enforcement proposals, the approach we are advocating requires only minor browser modifications. This is because our proposal can be viewed as a natural finer-grained extension of the same-origin policy for JavaScript already supported by the majority of mainstream browsers, in which we treat individual user interface widgets as belonging to separate domains Fortunately, in many cases no changes to the development process need to take place: for applications that are built on top of frameworks described above, a slight framework modification will result in appropriate changes in the generated HTML, completely obviating the need for manual code annotation. In this paper we demonstrate how these changes can prevent cross-site scripting and RSS injection attacks using the Dojo Toolkit, a popular Ajax library, as an example.
Burst error compensation for a two-dimensional channel
Authors: J. Q. Trelewicz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In an optical channel for a digital holographic data storage system, burst errors, in the form of severe amplitude compression, are experienced in the vicinity of dust and other optical aberrations in the channel. The locations of these burst errors are approximately fixed over a range of perturbations in magnification and vertical-horizontal position. In a calibrated channel, lower error rates can be realized by allocating energy in the modulation code based on a measurement of the approximate location of these effects. This paper discusses theoretical bounds on the energy inside the distortion region, and the modulation code which is used to approach this bound.
On the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type mappings in Banach spaces
Authors: Y. X. Tian, S. S. Chang, J. L. Huang
Venue: Computers Mathematics with Applications (2007)

The purpose of this paper is to introduce the concept of non-self asymptotically quasi-nonexpansive-type mappings and to construct a iterative sequence to converge to a common fixed point for a finite family of non-self asymptotically quasi-nonexpansive-type mappings in Banach spaces. The results presented in this paper improve and extend the corresponding results in Alber, Chidume and Zegeye [Ya.I. Alber, C.E. Chidume, H. Zegeye, Approximating of total asymptotically nonexpansive mappings, Fixed Point Theory and Applications (2006) 1-20. Article ID10673], Ghosh and Debnath [M.K. Ghosh, L. Debnath, Convergence of Ishikawa iterates of quasi-nonexpansive mappings, Journal of Mathematical Analysis and Applications 207 (1997) 96-103], Liu [Q.H. Liu, Iterative sequences for asymptotically quasi-nonexpansive type mappings, Journal of Mathematical Analysis and Applications 259 (2001) 1-37; Q.H. Liu, Iterative sequences for asymptotically quasi-nonexpansive mappings with error member, Journal of Mathematical Analysis and Applications 259 (2001) 18-24; Q.H. Liu, Iteration sequences for asymptotically quasi-nonexpansive mapping with an error member of uniform convex Banach space, Journal of Mathematical Analysis and Applications 266 (2002) 468-471], Petryshyn [W.V. Petryshyn, T.E. Williamson Jr., Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings, Journal of Mathematical Analysis and Applications 43 (1973) 459-497], Quan and Chang [J. Quan, S.S. Chang, X.J. Long, Approximation common fixed point of asymptotically quasi-nonexpansive type mappings by the finite steps iterative sequences, Fixed Point Theory and Applications V (2006) 1-38. Article ID 70830], Shahzad and Udomene [N. Shahzad, A. Udomene, Approximating common fixed point of two asymptotically quasi-nonexpansive mappings in Banach spaces, Fixed Point Theory and Applications (2006) 1-10. Article ID 18909] Xu [B.L. Xu, M.A. Noor, Fixed-point iterations for asymptotically nonexpansive mappings in Banach spaces, Journal of Mathematical Analysis and Applications 267 (2002) 444-453], Zhang [S.S. Zhang, Iterative approximation problem of fixed points for asymptotically nonexpansive mappings in Banach spaces, Acta Mathematicae Applicatae Sinica 24 (2001) 236-241] and Zhou and Chang [Y.Y. Zhou, S.S. Chang, Convergence of implicit iteration process for a finite family of asymptotically nonexpansive mappings in Banach spaces, Numerical Functional Analysis and Optimization 23 (2002) 911-921].
Classification using Dirichlet priors when the training data are mislabeled
Authors: M. A. Ingram
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

The average probability of error is used to demonstrate the performance of a Bayesian classification test (referred to as the combined Bayes test (CBT)) given the training data of each class are mislabeled. The CBT combines the information in discrete training and test data to intersymbol probabilities, where a uniform Dirichlet prior (i.e., a noninformative prior of complete ignorance) is assumed for all classes. Using this prior it is shown how the classification performance degrades when mislabeling exists in the training data, and this occurs with a severity that depends on the value of the mislabeling probabilities. However, an increase in the mislabeling probabilities are also shown to cause an increase in M/sup */ (i.e., the best quantization fineness). Further, even when the actual mislabeling probabilities are known by the CBT, it is not possible to achieve the classification performance obtainable without mislabeling.
STAR: an efficient coding scheme for correcting triple storage node failures
Authors: Cheng Huang, Lihao Xu
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding complexity for correcting (or recovering) storage node failures is essential for practical systems. In this paper, we describe a new coding scheme, which we call the STAR code, for correcting triple storage node failures (erasures). The STAR code is an extension of the double-erasure-correcting EVENODD code, and a modification of the generalized triple-erasure-correcting EVENODD code. The STAR code is an MDS code, and thus is optimal in terms of node failure recovery capability for a given data redundancy. We provide detailed STAR code's decoding algorithms for correcting various triple node failures. We show that the decoding complexity of the STAR code is much lower than those of the existing comparable codes, thus the STAR code is practically very meaningful for storage systems that need higher reliability
A Pareto-based multi-objective evolutionary approach to the identification of Mamdani fuzzy systems
Authors: Marco Cococcioni, Pietro Ducange, Beatrice Lazzerini, Francesco Marcelloni
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

In the last years, the numerous successful applications of fuzzy rule-based systems (FRBSs) to several different domains have produced a considerable interest in methods to generate FRBSs from data. Most of the methods proposed in the literature, however, focus on performance maximization and omit to consider FRBS comprehensibility. Only recently, the problem of finding the right trade-off between performance and comprehensibility, in spite of the original nature of fuzzy logic, has arisen a growing interest in methods which take both the aspects into account. In this paper, we propose a Pareto-based multi-objective evolutionary approach to generate a set of Mamdani fuzzy systems from numerical data. We adopt a variant of the well-known (2+2) Pareto Archived Evolutionary Strategy ((2+2)PAES), which adopts the one-point crossover and two appropriately defined mutation operators. (2+2)PAES determines an approximation of the optimal Pareto front by concurrently minimizing the root mean squared error and the complexity. Complexity is measured as sum of the conditions which compose the antecedents of the rules included in the FRBS. Thus, low values of complexity correspond to Mamdani fuzzy systems characterized by a low number of rules and a low number of input variables really used in each rule. This ensures a high comprehensibility of the systems. We tested our version of (2+2)PAES on three well-known regression benchmarks, namely the Box and Jenkins Gas Furnace, the Mackey-Glass chaotic time series and Lorenz attractor time series datasets. To show the good characteristics of our approach, we compare the Pareto fronts produced by the (2+2)PAES with the ones obtained by applying a heuristic approach based on SVD-QR decomposition and four different multi-objective evolutionary algorithms.
Image Encryption Algorithm Based on Chaotic Sequence
Authors: Yong-Hong Zhang, Bao-Sheng Kang, Xue-Feng Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In order to extend the security of image encryption algorithm, an extended digital image encryption algorithm based on chaotic sequence and iteration is presented in this paper. An extended real chaotic magic square matrix is also presented in this paper, the matrix is used to permute and substitute the image's pixels. The simulation results show that the effect of encrypted image and decrypted is good, the security of the extended algorithm is also ameliorated.
Stone detection in MRCP images using controlled region growing
Authors: Rajasvaran Logeswaran, Chikkannan Eswaran
Venue: Computers in Biology and Medicine (2007)

Stones in the biliary tract are routinely identified using MRCP (magnetic resonance cholangiopancreatography). The noisy nature of the images, as well as varying intensity, size and location of the stones, defeat most automatic detection algorithms, making computer-aided diagnosis difficult. This paper proposes a multi-stage segment-based scheme for semi-automated detection of choledocholithiasis and cholelithiasis in the MRCP images, producing good performance in tests, differentiating them from ''normal'' MRCP images. With the high success rate of over 90%, refinement of the scheme could be applicable in the clinical environment as a tool in aiding diagnosis, with possible applications in telemedicine.
Anisotropic Plasmon Resonance of Surface Metallic Nanostructures Prepared by Ion Beam Mixing
Authors: V. Ovchinnikov, A. Priimagi
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

Nanodimensional island films prepared by ion beam mixing (IBM) of silver layer on oxide substrates are studied by means of optical absorption spectroscopy and scanning electron microscopy. During bombardment by 400 keV Ar+ ions the Ag film is transformed into surface islands having size in the range of 30 -120 nm and volume nanoclusters with diameter less than 10 nm. The silver islands, in general, have shape close to oblate spheroid and exhibit splitting of the dipolar surface plasmon resonance observed in extinction spectra. High fluence irradiation induces viscous oxide flow and push-in of the surface islands into the oxide substrate. The dimensions of the surface structures depend on the IBM conditions and substrate material. The changes in the island geometry and push-in depth produce changes in the extinction spectra.
Structural Learning of Activities from Sparse Datasets
Authors: Fahd Albinali, Nigel Davies, Adrian Friday
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

A major challenge in pervasive computing is to develop systems that can reliably recognize human activity patterns, such as bathing from sensor data. Typical sensor deployments generate sparse datasets with thousands of sensor readings and few instances of activities. The imbalance between the number of features (i.e. sensors firing) and the classification targets (i.e. activities) complicates the learning process. In this paper, we propose a novel framework for discovering relationships between sensor signals and observed human activities from sparse datasets. The framework builds on the use of Bayesian networks for modeling activities by representing statistical dependencies between sensors. This allows us to solve two key problems: firstly, how to automatically determine an effective structure for a Bayesian network that recognizes a particular activity without human intervention; and, secondly, we address the pragmatic problem of sparse training data, where the data available to train the activity recognizers is limited. In our approach, we "learn' the structure of the Bayesian networks automatically from the sensor data. We optimize this process in 3 ways: firstly, we perform multicollinearity analysis to focus on orthogonal sensor data with minimal redundancy. Secondly, we propose Efron's bootstrapping to generate large training sets that capture important features of an activity. Finally, we find the best Bayesian network that explains our data using a heuristic search that is unbiased to the ordering between consecutive variables. We evaluate our approach using a data set gathered from MIT's Place- Lab. The inferred networks correctly identify activities for 85% of the time.
Speculative data and the creative imaginary: shared innovative visions between art and technology
Authors: Pamela Jennings
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

The exhibition Speculative Data and the Creative Imaginary: shared innovative visions between art and technology will bring together examples of best practices in creative digital media art and design that foster strong ties to current research trends in computer science and engineering. Exhibited works align with the 2007 ACM Creativity and Cognition conference themes: cultivating creative minds, sustaining creative communities and promoting creative engagement as they demonstrate innovative, novel, sometimes provocative and other times promising models for research in the design of interactive human centered applications, technology innovation, aesthetic expression, and social critique. [1] This is a timeless opportunity to connect the larger ACM Creativity and Cognition conference community of researchers and university faculty with a community of creative thinkers who share research interests across human centered computing, technology development, and scientific discoveries. The exhibition is hosted by the National Academy of Sciences Exhibitions and Cultural Programs and will be held at the National Academy of Sciences Rotunda Gallery, 2100 C Street NW, Washington D.C. from June 4th to August 24th, 2007.