ppxscal/embedding_network huggingface dataset:
Nonconservative oscillations of a tool for deep hole honing
Authors: A. M. Gouskov, S. A. Voronov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The dynamics of rotating tool commonly employed in deep hole honing is considered. Mathematical model of a process including the dynamic model of tool and model of workpiece surface and honing sticks interaction is analyzed. It is shown that interaction forces are nonconservative. Honing tool is modeled as a continuous slender beam with honing mandrel attached at intermediate cross section. Multi-stone tool rotates and has reciprocational motion in axial direction. Honing tones are expanded to the machined surface by special rigid mechanism that provides cutting of workpiece cylindrical surface. The tool vibrates in the transverse and axial directions. The transverse oscillations cause the variation of expansion pressure and change the interaction forces on the surface of the workpiece. Hence the vibrating tool shaft is under act of nonconservative forces depending on its position. The expansion pressure is a critical parameter in honing since its influence on process is different. The removal of stock increase linearly with pressure but the lowest expansion pressure and feed rate possible should be used to increase accuracy. The process productivity can be improved by increasing expansion pressure but may in a certain conditions cause a dynamic instability of tool shaft lateral oscillations. Another method of process productivity increasing is applying additional axial vibration of tool. In this case the tool passes more distance along the machined surface at the same time. But this method requires special machine tool with vibration actuator and additional research of system dynamic stability. Methods of vibratory process rational conditions evaluation are considered. The derived partial differential equations of rotating beam motion are reduced to a set of ordinary differential equations by the Galerkin approximation method. The derived differential equations with time periodic functions are numerically analyzed by Floquet method. The system response is studied for different technology and geometric parameters in non-dimensional form. That makes it possible to analyze a set of real processes applying the similarity conditions.
Route Reservation in Ad Hoc Wireless Networks
Authors: Sooksan Panichpapiboon, Gianluigi Ferrari, Nawaporn Wisitpongphan, Ozan K. Tonguz
Venue: IEEE Transactions on Mobile Computing (2007)

This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks. In addition to posing this fundamental question, the requirements (in terms of route discovery, medium access control (MAC) protocol, and pipelining, etc.) for making RB switching superior to NRB switching are also identified. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. It is shown that if the aforementioned requirements are met, then RB schemes can indeed yield better delay performance than NRB schemes. This advantage, however, comes at the expense of lower throughput and goodput compared to NRB schemes.
Coherence Ordering for Ring-based Chip Multiprocessors
Authors: Michael R. Marty, Mark D. Hill
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Ring interconnects may be an attractive solution for future chip multiprocessors because they can enable faster links than buses and simpler switches than arbitrary switched interconnects. Moreover, a ring naturally orders requests sufficiently to enable directory-less coherence, but not in the total order that buses provide for snooping coherence. Existing cache coherence protocols for rings either establish a (total) ordering point (ORDERING-POINT) or use a greedy order (GREEDY-ORDER) with unbounded retries. In this work, we propose a new class of ring protocols, RINGORDER, in which requests complete in ring position order to achieve two benefits. First, RING-ORDER improves performance relative to ORDERING-POINT by activating requests immediately instead of waiting for them to reach the ordering point. Second, it improves performance stability relative to GREEDY-ORDER by not using retries. Thus, the new RING-ORDER combines the best of ORDERING-POINT (good performance stability) with the best of GREEDY-ORDER (good average performance).
Highly Adaptive Learning for All - Vision and Plan
Authors: Alfred Bork
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

One of the major global problems is bringing learning to everyone on earth, at all ages. Current lockstep cookie-cuter approaches will not accomplish this, because students differ widely. We need learning that continuously adapts to the needs of each student and that allows each student to stay at an area until mastery is attained, possible now with appropriate computerbased learning units, adaptive tutorial learning. This paper introduces this approach to learning, and discusses how to reach everyone with such units. We suggest beginning with a three year experiment for young children, and if successful with further activities in this direction. Twenty years is estimated to be the time to attain the goal. A detailed schedule is available.
Two-Dimensional Software Reliability Models and Their Application
Authors: Tomotaka Ishii, Tadashi Dohi
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

In general, the software-testing time may be measured by two kinds of time scales: calendar time and test-execution time. In this paper, we develop two-dimensional software reliability models with two-time measures and incorporate both of them to assess the software reliability with higher accuracy. Since the resulting software reliability models are based on the familiar non-homogeneous Poisson processes with two-time scales, which are the natural extensions of one-dimensional models, it is possible to treat both the time data simultaneously and effectively. We investigate the dependence of test-execution time as a testing effort on the software reliability assessment, and validate quantitatively the software reliability models with two-time scales. We also consider an optimization problem when to stop the software testing in terms of two-time measurements.
Modeling hairy plants
Authors: Martin Fuhrer, Henrik Wann Jensen, Przemyslaw Prusinkiewicz
Venue: Graphical Models (2006)

The appearance of computer generated plants has improved significantly due to recent advances in both modeling and rendering. In this paper, we describe a system that further improves the appearance of CG plants by including the tiny hairs that cover many plant organs. A plant skeleton is generated using an L-system and graphically interpreted using generalized cylinders. The individual hairs are then mapped onto the surfaces and boundary edges of the mesh. Hair properties are specified and adjusted according to positional information. Sample images included in the paper illustrate the impact of hairs on the appearance of rendered plants.
Enhanced A/D Converter Signal-to-Noise-Ratio Testing in the Presence of Sampling Clock Jitter
Authors: Shalabh Goya, Abhijit Chatterjee, Yanan Shieh
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Random jitter, present in the clock that is used for sampling the test input signal, is a major impediment to the signal-to-noise-ratio (SNR) measurement accuracy using the conventional dynamic testing methodology. However, most low cost testers do not provide the lowjitter clock required for SNR measurement of highresolution and high-speed A/D converters. This paper presents a test methodology to estimate the SNR of highperformance A/D converters accurately in the presence of sampling clock jitter. The proposed approach uses the "locked-histogram" technique to gather the statistical data on the aperture uncertainty of the device-under-test. It further correlates the data obtained from the locked-histogram technique to the true SNR of the device-under-test. The proposed approach was simulated using Matlab models and validated by performing the hardware experiments. The results show an accuracy of 0.1dB in SNR estimation using the proposed test methodology.
Assessing security threats of looping constructs
Authors: Pasquale Malacaria
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

There is a clear intuitive connection between the notion of leakage of information in a program and concepts from information theory. This intuition has not been satisfactorily pinned down, until now. In particular, previous information-theoretic models of programs are imprecise, due to their overly conservative treatment of looping constructs. In this paper we provide the first precise information-theoretic semantics of looping constructs. Our semantics describes both the amount and rate of leakage; if either is small enough, then a program might be deemed "secure". Using the semantics we provide an investigation and classification of bounded and unbounded covert channels.
2005 Special issue: Firing rate modulation: A simple statistical view of memory trace reactivation
Authors: Francesco P. Battaglia, Gary R. Sutherland, Stephen L. Cowen, Bruce L. Mc Naughton, Kenneth D. Harris
Venue: Neural Networks (2005)

Memory trace reactivation in hippocampal ensembles during sleep has been suggested as a coordinating mechanism for consolidation of new memories. Here we propose a simple statistical scheme allowing analysis of the reactivation of firing rate modulations, with a well-defined null hypothesis. This method allowed reliable detection of ensemble reactivation across three experimental settings. Reactivation of firing rate modulations mirrors several properties of commonly studied reactivation measures: it is stronger during hippocampal sharp waves, and decays over a period of 10-20min. Moreover, in some conditions, firing rate reactivation covaries with reactivation of cell pair cross-correlations, suggesting the two phenomena reflect similar processes. We propose an attractor network model, with pre-wired attractors, in which experience selects and primes some attractors. Priming occurs by either experience dependent synaptic plasticity or changes in neuronal excitability. Primed attractors are more likely to activate in the following sleep, inducing reactivation of both rates and cross-correlations.
Modular information hiding and type-safe linking for C
Authors: Saurabh Srivastava, Michael Hicks, Jeffrey S. Foster
Venue: Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation (2007)

This paper presents CMod, a novel tool that provides a sound module system for C. CMod works by enforcing a set of four rules that are based on principles of modular reasoning and on current programming practice. CMod's rules flesh out the convention that .h header files are module interfaces and .c source files are module implementations. Although this convention is well-known, developing CMod's rules revealed there are many subtleties in applying the basic pattern correctly. We have proven formally that CMod's rules enforce both information hiding and type-safe linking. We evaluated CMod on a number of benchmarks, and found that most programs obey CMod's rules, or can be made to with minimal effort, while rule violations reveal brittle coding practices including numerous information hiding violations and occasional type errors.
Resource management in large-scale data stream recording architectures
Authors: Roger Zimmermann
Venue:  (2005)

Presently, digital continuous media (CM) are well established as an integral part of many applications. In recent years, a considerable amount of research has focused on the efficient retrieval of such media. Scant attention has been paid to servers that can record such streams in real time. However, more and more devices produce direct digital output streams. Hence, the need arises to capture and store these streams with a unified data stream recording architecture that can handle both recording and playback of many streams simultaneously and provide a central repository for all data. This dissertation describes a taxonomy of techniques to effectively utilize the memory and disk bandwidth resources in a large scale data stream recording architecture, HYDRA. The first technique we proposed is a novel statistical admission control algorithm called TRAC based on a comprehensive three random variable (3RV) model to support both reading and writing of multiple variable bit rate media streams on current generation disk drives. Our results demonstrate that TRAC accurately predicts the I/O bandwidth utilization of actual disk device. Second, Packet-to-Block aggregation is another important component in HYDRA. We propose two different approaches, sequential aggregation (BLR) and random aggregation (PLR). Our results shows that both PLR and BLR can provide very good long term load balancing in terms of the average disk I/O workload for each disk. However, for short term load balancing, PLR outperforms BLR in terms of the global standard deviation of the disk I/O workloads for all the disks by utilizing more memory. Finally, in order to effectively utilize the available memory resources, we propose a resource management framework that has two parts: (1) a dynamic memory allocation strategy and (2) a deadline setting policy. Furthermore, to find the optimal memory configuration, we constructed a probability model based on the classic M/G/1 queuing model and the recently developed Real Time Queuing Theory (RTQT). The model is applicable to admission control and capacity planning in a recording system.
Baseband Filter Banks for Neural Prediction
Authors: M. Panella, A. Rizzi
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

We propose in this paper a new prediction paradigm, which is based on filter banks for subband decomposition of the sequences to be predicted. Filter banks allow the implementation of a parallel computing system, taking the advantage of a faster and more accurate implementation. In particular, we introduce a novel subband decomposition method yielding baseband sequences that are easier to be predicted. The core of the prediction system is based on a neural model, which is trained for each subband using specific embedding techniques. The latter are used in order to optimize the prediction performances when dealing with real-world data sequences, which often possess a chaotic behavior.
Seeds of a computer culture: an archival analysis of programming artifacts from a community technology center
Authors: Yasmin B. Kafai, Kylie A. Peppler, Mabel Alavez, Omar Ruvalcaba
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

We examined the genre and complexity of computer programs created by members of a community technology center. We collected 240 projects during a six-month period. The program genres reflected animations, games, and graphics in about equal numbers. While the number of computer programs decreased over time, the number of advanced programs remained constant suggesting that members either abandoned programs or paired up with more experienced programmers and continued to develop more complex programs.
A Feature Selection and Evaluation Scheme for Computer Virus Detection
Authors: Olivier Henchiri, Nathalie Japkowicz
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Anti-virus systems traditionally use signatures to detect malicious executables, but signatures are over-fitted features that are of little use in machine learning. Other more heuristic methods seek to utilize more general features, with some degree of success. In this paper, we present a data mining approach that conducts an exhaustive feature search on a set of computer viruses and strives to obviate over-fitting. We also evaluate the predictive power of a classifier by taking into account dependence relationships that exist between viruses, and we show that our classifier yields high detection rates and can be expected to perform as well in real-world conditions.
COFALE: An Authoring System for Supporting Cognitive Flexibility
Authors: Vu Minh Chieu
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Constructivism is a learning theory that states that people learn best when they actively construct their own knowledge. A significant number of ICT-based constructivist learning systems have been proposed in recent years. A critical problem related to the design and use of this kind of systems has been the lack of a practical means to facilitate the instructional design process. Our research aims to help designing truly constructivist learning environments. Our approach is based on a set of operational criteria for certain aspects of constructivism: We use these criteria as a useful pedagogical framework to provide tools and guidelines facilitating the instructional design process. One facet often mentioned as being strongly relevant to constructivism is cognitive flexibility. This paper presents COFALE, a new domain-independent e- Learning platform that could be used to build learning environments supporting cognitive flexibility, and an example of its use: the design of a course on recursion.
Designing Reliable Architecture for Stateful Fault Tolerance
Authors: Indranil Saha, Debapriyay Mukhopadhyay, Satyajit Banerjee
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Performance and fault tolerance are two major issues that need to be addressed while designing highly available and reliable systems. The network topology or the notion of connectedness among the network nodes defines the system communication architecture and is an important design consideration for fault tolerant systems. A number of fault tolerant designs for specific multi-processor architecture exists in the literature, but none of them discriminates between stateless and stateful failover. In this paper, we propose a reliable network topology and a high availability framework which is tolerant upto a maximum of k node faults in a network and is designed specifically to meet the needs of stateful failover. Assuming the nodes in the network are capable of handling multiple processes, through our design we have been able to prove that in the event of k node failures the load can be uniformly distributed across the network - ensuring load balance. We also provide an useful characterization for the network, which under the proposed framework ensures one hop communication between the required nodes.
"Back-Seat Driver": Spatial Sound for Vehicular Way-Finding and Situation Awareness
Authors: Michael Cohen, Owen Noel Newton Fernando, Tatsuya Nagai, Kensuke Shimizu
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

We are exploring IDSS (intelligent driver support systems), especially including way-finding presented via spatial audio. ("Way-finding" refers to giving a driver directions, as via car navigation ['car-nabi"] GPS/GIS systems.) We have developed a networked driving simulator as a virtual-reality based interface (control/display system) featuring integration with the Sc haire rotary motion platform for azimuth-display, stereographic display for 3D graphics, and spatial audio (sound spatialization) way-finding cues. A design for a guidance system coupled with a GPS system is described, using dynamically selected HRTFs (headrelated transfer functions) to directionalize arbitrary audio signals. The system is intended to provide a capability for way-finding as an audio compass or homing beacon. "Back-seat driver" is a slang expression for a passenger (often stereotypically a mother-in-law) who offers driving advice while en route. Besides this colloquialism, we also interpret the phrase literally: we have developed a doubledriver (long ladder) fire-truck simulation with a "tiller" (rear steering), which can be driven via an integrated pair of our driving simulator stations. We have incorporated navigation cues into the emergency vehicle simulator, and are are working to deploy such a system in a real vehicle. Keywords: augmented audio reality, GIS (geographic information systems), GPS (global positioning satellite) applications, stereotelephony, way-finding.
Ubiquitous Object Categorization and Identity
Authors: U. P. Kulkarni, J. V. Vadavi, S. M. Joshi, A. R. Yardi
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The advances in computing technologies have resulted in an explosive growth in computing systems called Ubiquitous Computing Systems [Ubicomp] and also the applications that impact all aspects of our life. Everyday objects communicate with each other and also with the Internet objects available today. People have an increasing desire for such ubiquitous access to information, anywhere, anyplace, and anytime. As ubicomp occurs everywhere, there may be a very large number of objects interacting with each other simultaneously in future. This necessitates the question of how to uniquely provide identity to infinitely growing objects and standard towards the uniformity of the data being exchanged by the various objects. In this paper, author proposes the way of providing uniqueness in scalable object identity, object categorization and standard format for the data being exchanged by various ubicomp compliant objects..
Query processing in the aqualogic data services platform
Authors: Vinayak Borkar, Michael Carey, Dmitry Lychagin, Till Westmann, Daniel Engovatov, Nicola Onose
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

BEA recently introduced a new middleware product called the Aqua-Logic Data Services Platform (ALDSP). The purpose of ALDSP is to make it easy to design, develop, deploy, and maintain a data services layer in the world of service-oriented architecture (SOA). ALDSP provides a declarative foundation for building SOA applications and services that need to access and compose information from a range of enterprise data sources; this foundation is based on XML, XML Schema, and XQuery. This paper focuses on query processing in ALDSP, describing its overall query processing architecture, its query compiler and runtime system, its distributed query processing techniques, the translation of XQuery plan fragments into SQL when relational data sources are involved, and the production of lineage information to support updates. Several XQuery extensions that were added in support of requirements related to data services are also covered.