ppxscal/embedding_network huggingface dataset:
Advanced learning made as easy as ABC: an example using design for fatigue of machine elements subjected to simple and combined loads
Authors: C. Egelhoff
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Failure of systems and components resulting from fatigue is one of the most challenging and costly designs accomplished by today's industrial companies. However, one of the more difficult concepts to teach in machine component design courses is fatigue analysis of "real world" components. These components come with multiple cyclic loads, each with different stress concentrations, which result in mean and alternating stress states. The student then must select a failure criterion to obtain an equivalent stress that can be used in one of several different fatigue failure theories to predict either a safety factor or an estimated life. Without a heuristic to guide the student, these types of analyses are very difficult. The authors have developed a heuristic which consists of a combination of a concept map and flow charts that give a student not only process but also directions for improvement of the analysis. The heuristic is a visual image that is simple and can be readily reproduced in a basic sketch. The visual quality (simple and striking) of these concept maps/flow charts produces ready access to the understanding which students ultimately develop. Several examples of the heuristic they have developed are presented along with applications to demonstrate their use.
Splice: a new analytical network analysis software
Authors: T. G. Engel
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Splice is an analytical electrical circuit analysis program that operates under the Windows operating system. Splice is the only commercially available software that will perform this type of analysis. A description of the features found in Splice 1.0 and examples to illustrate them is presented. Splice is easy to use and works with the netlist file of the MicroSim Corporation PSpice simulator. The user adds special "analysis symbols" to the circuit schematic which instruct Splice to perform a specific type of analysis. The analysis symbols are transparent to PSpice, giving the user the option to simulate the network at any time. Splice is powered by the Waterloo Maple algebraic engine and can analyze many types of linear electrical networks consisting of inductors, capacitors, resistors, transformers, transistors, operational amplifiers and all types of AC and DC current and voltage sources. Splice can perform branch current, nodal voltage, Thevenin reduction, transfer function and two-port reduction analysis, with options for component substitutions, pole and zero calculations, sinusoidal steady-state analysis and time-domain result calculations. Splice cannot solve networks with nonlinear components, but it can reduce the linear network surrounding a nonlinear element, allowing the user to attempt an analytical solution. From computer-assisted homework to in-depth circuit analysis, Splice provides for better, more insightful linear electrical network analysis.
Predicting Eclipse Bug Lifetimes
Authors: Lucas D. Panjer
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

In non-trivial software development projects planning and allocation of resources is an important and difficult task. Estimation of work time to fix a bug is commonly used to support this process. This research explores the viability of using data mining tools to predict the time to fix a bug given only the basic information known at the beginning of a bug's lifetime. To address this question, a historical portion of the Eclipse Bugzilla database is used for modeling and predicting bug lifetimes. A bug history transformation process is described and several data mining models are built and tested. Interesting behaviours derived from the models are documented. The models can correctly predict up to 34.9% of the bugs into a discretized log scaled lifetime class.
A Visuo-Haptic Device - Telemaque - Increases Kindergarten Children's Handwriting Acquisition
Authors: R. Palluel-Germain, F. Bara, A. Hillairet de Boisferon, B. Hennion, P. Gouagout, E. Gentaz
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The objective of the present research was to show that incorporating a visuo-haptic device "Telemaque' may increase the fluency of handwriting production of cursive letters in kindergarten children i.e., before formal handwriting learning begins. Forty two 5 yearold children were assigned an intervention involving either Telemaque (experimental training; VH group) or not (control training; C group). The fluency of handwriting was tested before and after both interventions. Fluency was analysed by kinematic parameters: Average velocity, number of velocity peaks, and number of breaks during the production of six cursive letters (a,b,f,i,l,s). The results showed that the fluency of handwriting production for all letters was higher after the VH training than after the C training: The movements were faster, exhibited less velocity peaks and children lifted the pen less often during the letter production. These results showed that the Telemaque device may help kindergarten children to increase the proactive strategy to control handwriting movements.
Good Manners for Pervasive Computing--An Approach Based on the Ambient Calculus
Authors: Gregor Schiele, Marcus Handte, Christian Becker
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

When people interact, they follow distinct rules that coordinate the order of speech, who opens doors, whom and how to greet, and many things more. Such a social codex depends on the milieu -- or ambience -- people are acting in. People breaking the codex are either considered badly educated or foreigners to the ambience -- sometimes even both. In Pervasive Computing a multitude of applications is expected to populate our environment and to follow objects and users throughout their daily journey. Consequently, we will need a new codex -- or manners -- for Pervasive Computing applications that controls the interaction between applications. Such a codex will have to incorporate our existing codices as well as technical aspects. In this work in progress paper we present an approach to extend our prior work on Pervasive Computing system support by specifying interdependencies of applications based on the ambient calculus. This allows specifying and technically enforcing "manners" for Pervasive Computing applications.
Map-Enhanced UAV Image Sequence Registration
Authors: Yuping Lin, Qian Yu, Gerard Medioni
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Registering consecutive images from an airborne sensor into a mosaic is an essential tool for image analysts. Strictly local methods tend to accumulate errors, resulting in distortion. We propose here to use a reference image (such as a high resolution map image) to overcome this limitation. In our approach, we register a frame in an image sequence to the map using both frame-to-frame registration and frameto- map registration iteratively. In frame-to-frame registration, a frame is registered to its previous frame. With its previous frame been registered to the map in the previous iteration, we can derive an estimated transformation from the frame to the map. In frame-to-map registration, we warp the frame to the map by this transformation to compensate for scale and rotation difference and then perform an area based matching usingMutual Information to find correspondences between this warped frame and the map. From these correspondences, we derive a transformation that further registers the warped frame to the map. With this two-step registration, the errors between each consecutive frames are not accumulated. We present results on real image sequences from a hot air balloon.
Performance analysis of the hybrid search code acquisition technique for cellular CDMA systems
Authors: Hyung-Rae Park, Yeon-Sil Yang, Sang-Sik Yoon, Sang-Ho Lee, Jae-Sung Roh, Sung-Joon Cho
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The hybrid search algorithm, a combination of the maximum-likelihood search and serial search algorithms, is one of the most promising techniques that can be used for code acquisition in CDMA forward links. The hybrid search code acquisition system considered in this paper employs two operating modes, i.e., search and verification modes with M-parallel correlators used for maximum-likelihood detection in search mode. An analytical expression for the mean acquisition time is first obtained. The probabilities of detection, miss, and false alarm are also derived for both search and verification modes for frequency-selective Rayleigh fading environments with assumption that the fading envelope of the received signal is constant over the interval of post-detection integration (PDI). Numerical evaluation shall be performed to investigate the effects of sub-window size, number of post-detection integration in search and verification modes, and so on, in the forward link of cellular CDMA networks.
A multi-frame blocking artifact reduction method for transform-coded video
Authors: B. K. Gunturk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A major drawback of block-based still image or video compression methods at low rates are the visible block boundaries that are also known as blocking artifacts. Several methods have been proposed in the literature to reduce these artifacts for video sequences. However, most are simply adaptations of still image blocking artifact reduction methods, which do not exploit temporal information. We propose a novel multi-frame blocking artifact reduction method that incorporates temporal information effectively. This method uses the spatial correlations that exist between the successive frames to define constraint sets at multiple frames and provides a Projections Onto Convex Sets (POCS) solution. The proposed method operates solely on transform domain (DCT) data, and hence provides a solution that is compatible with the observed video. It does not need to make any spatial smoothness assumptions, which are typical with blocking artifact reduction algorithms for still images.
A computable approach to measure and integration theory
Authors: Abbas Edalat
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

We introduce a computable framework for Lebesgue's measure and integration theory in the spirit of domain theory. For an effectively given locally compact second countable Hausdorff space and an effectively given locally finite Borel measure on the space, we define the notion of a computable measurable set with respect to the given measure, which is stronger than Sanin's recursive measurable set. The set of computable measurable subsets is closed under complementation, finite unions and finite intersections. We then introduce interval-valued measurable functions and develop the notion of computable measurable functions using interval-valued simple functions. This leads us to the interval versions of the main results of the theory of Lebesgue integration which provide a computable framework for measure and integration theory. The Lebesgue integral of a computable integrable function with respect to an effectively given (\sigma-)finite Borel measure on an effectively given (locally) compact second countable Hausdorff space can be computed up to any required accuracy. We show that, with respect to the metric induced from the L^1 norm, the set of Scott continuous interval-valued functions is dense in the set of interval-valued integrable functions.
Engine fault diagnosis based on multi-sensor information fusion using Dempster-Shafer evidence theory
Authors: Otman Basir, Xiaohong Yuan
Venue: Information Fusion (2007)

Engine diagnostics is a typical multi-sensor fusion problem. It involves the use of multi-sensor information such as vibration, sound, pressure and temperature, to detect and identify engine faults. From the viewpoint of evidence theory, information obtained from each sensor can be considered as a piece of evidence, and as such, multi-sensor based engine diagnosis can be viewed as a problem of evidence fusion. In this paper we investigate the use of Dempster-Shafer evidence theory as a tool for modeling and fusing multi-sensory pieces of evidence pertinent to engine quality. We present a preliminary review of Evidence Theory and explain how the multi-sensor engine diagnosis problem can be framed in the context of this theory, in terms of faults frame of discernment, mass functions and the rule for combining pieces of evidence. We introduce two new methods for enhancing the effectiveness of mass functions in modeling and combining pieces of evidence. Furthermore, we propose a rule for making rational decisions with respect to engine quality, and present a criterion to evaluate the performance of the proposed information fusion system. Finally, we report a case study to demonstrate the efficacy of this system in dealing with imprecise information cues and conflicts that may arise among the sensors.
Sensory mapping, development and their applications to feature and attention selection
Authors: Juyang Weng
Venue:  (2006)

Rich literature has been generated on computer vision systems. However, an implementable computational model of immediate vision for general and unknown environments is still illusive. Motivated by the autonomous development process of humans, we are interested in building a robot vision system that automatically develops its visual cognitive skills through realtime interactions with the environment. Developmental vision is required by the demands of general-purpose vision systems for complex human environments. Based upon the above requirement, in this dissertation we propose a general architecture called Staggered Hierarchical Mapping (SHM) that performs feature derivation for a set of receptive fields and attention selection. The work reported here is motivated by the structure of the early visual pathway. We use several layers of staggered receptive fields to model the needed units of local analysis. From sequentially sensed video frames the proposed algorithm develops a hierarchy of filters, whose outputs are maximally uncorrelated within each layer, and contains an increasing scale of receptive fields that range from low to high layers. We also show how this general architecture can be applied to occluded face recognition, which demonstrates a case of attention selection. Besides this general neural network architecture, we develop several sensory mapping learning rules for deriving feature detectors, including a fast incremental independent component analysis (ICA) method called Lobe Component Analysis (LCA), which derives independent components for many natural cases. A mathematical analysis of the algorithm has been done and which shows the advantages of the LCA method. We push the research further by investigating the LCA method in a overcomplete setting, which means the number of basis functions is greater than dimension of the observation. A new incremental method is developed to solve the equivalent regression problem with sparse regulization term, i.e. the LASSO regression. We show that the LCA method is a special case when noise is not present. It makes LCA's principal applicable to a large variety of applications, e.g. classification, regression, and feature selection.
Curb your objects!: an orthodox form for C# classes
Authors: Roberto Jimeno, M. S. Jorge, L. Ortega-Arjona
Venue: ACM SIGCSE Bulletin (2007)

The Orthodox Form for C# Classes (OFC#C) is an idiom proposed for the C# programming language that intends to provide its classes with a basic structure that assures a predictable behavior for creation, copy, and destruction of instances. When classes in C# are written it is desirable to build them in such a way that their instances produce objects which behave in predictable ways. Programmers tend to make mistakes when their objects behave at run time in the same way the they expect them to behave at write/compile time.
Caustics Mapping: An Image-Space Technique for Real-Time Caustics
Authors: Musawir A. Shah Jaakko Konttinen Sumanta Pattanaik
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

In this paper, we present a simple and practical technique for real-time rendering of caustics from reflective and refractive objects. Our algorithm, conceptually similar to shadow mapping, consists of two main parts: creation of a caustic map texture, and utilization of the map to render caustics onto nonshiny surfaces. Our approach avoids performing any expensive geometric tests, such as ray-object intersection, and involves no precomputation; both of which are common features in previous work. The algorithm is well suited for the standard rasterization pipeline and runs entirely on the graphics hardware.
Developing Java Card Applications with B
Authors: Bruno Emerson Gurgel Gomes, Anamaria Martins Moreira, David Déharbe
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This work proposes a methodology for the rigorous development of Java Card smart card applications, using the B Method. Its main feature is to abstract the particularities of Java Card and smart card aware applications from the specifier as much as possible. In the proposed approach, the specification of the aplication logic needs not be preoccupied with the specific aspects of the Java Card platform (in particular, communication between the card acceptance device and the smart card itself). Platform-specific code can then be automatically generated during the refinement and code generation process. An interesting side-effect of this approach is that the specification may be reused with any other platform of implementation.
Addressing IT Security for Critical Control Systems
Authors: Martin Naedele
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Control systems for critical infrastructures like national power grids make increasingly use of open technologies and protocols, and the Internet. In this environment, the risk of electronic attacks on these control systems has to be evaluated and mitigated. This paper addresses the key challenges commonly mentioned in the context of control system security (also referred to as "SCADA security") and discusses feasible solutions for most of them. The paper argues that the main obstacle to control system security is not technical, but financial. A couple of exemplary research projects from one automation vendor that aim to reduce the plant owners' cost of security are presented to demonstrate what kind of research will bring control system security forward.
Fast algorithms for computation of inverse filters, complex cepstra, and minimum phase spectral factors
Authors: A. E. Yagle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Computation of the inverse filter s(n) to a signal r(n) (so the convolution of r(n) and s(n) is an impulse) can require a surprisingly large amount of computation. The obvious approach of taking the reciprocal of the discrete Fourier transform (DFT) of r(n) may result in aliasing unless a large order DFT is used. O(Nlog(N)) operations are required, where s(N) is negligible. We develop a new algorithm which requires O(M/sup 2/log(N)) operations, where M is the length of r(n), and so is faster if N>M/sup 2/, as is often the case. The algorithm uses successive polynomial division to identify vectors orthogonal to the stable part of 1/R(z); it requires the solution of a resultant-like Toeplitz-plus-Hankel linear system of equations, which requires O(M/sup 2/) operations. The inverse filter can then be used to compute the complex cepstrum and minimum phase spectral factor in O(M/sup 2/) operations.
LADS: large-scale automated DDOS detection system
Authors: Vyas Sekar, Nick Duffield, Oliver Spatscheck, Jacobus van der Merwe, Hui Zhang
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Many Denial of Service attacks use brute-force bandwidth flooding of intended victims. Such volume-based attacks aggregate at a target's access router, suggesting that (i) detection and mitigation are best done by providers in their networks; and (ii) attacks are most readily detectable at access routers, where their impact is strongest. In-network detection presents a tension between scalability and accuracy. Specifically, accuracy of detection dictates fine grained traffic monitoring, but performing such monitoring for the tens or hundreds of thousands of access interfaces in a large provider network presents serious scalability issues. We investigate the design space for in-network DDoS detection and propose a triggered, multi-stage approach that addresses both scalability and accuracy. Our contribution is the design and implementation of LADS (Large-scale Automated DDoS detection System). The attractiveness of this system lies in the fact that it makes use of data that is readily available to an ISP, namely, SNMP and Netflow feeds from routers, without dependence on proprietary hardware solutions. We report our experiences using LADS to detect DDoS attacks in a tier-1 ISP.
Design principles for tamper-resistant smartcard processors
Authors: Oliver Kömmerling, Markus G. Kuhn
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

We describe techniques for extracting protected software and data from smartcard processors. This includes manual microprobing, laser cutting, focused ion-beam manipulation, glitch attacks, and power analysis. Many of these methods have already been used to compromise widely-fielded conditional-access systems, and current smartcards offer little protection against them. We give examples of low-cost protection concepts that make such attacks considerably more difficult.
Open-Source Tools for Immersive Environmental Visualization
Authors: William R. Sherman, Simon Su, Philip A. McDonald, Yi Mu, Frederick Harris Jr.
Venue: IEEE Computer Graphics and Applications (2007)

Scientists of the Desert Research Institute's atmospheric, hydrological, and earth and ecosystem science divisions sift through vast amounts of data gathered from sophisticated instrumentation and computational models. To help address the data analysis needs that stem from the growing volume of data, DRI established the Center for Advanced Visualization, Computation, and Modeling (CAVCaM) to foster DRI's move into interactive, large-scale, 3D visualization of these and other environmental research issues. The authors' mission is two-pronged. First, they seek to partner with their researcher collaborators at DRI and the larger scientific communities through the development and use of better visualization tools. Second, they work with research sponsors to create visualization applications for training and simulation. To best achieve these goals, their underlying philosophy is to use established standards and generic tools (ideally open source) and contribute back to the opensource community.