ppxscal/embedding_network huggingface dataset:
Augmented Symmetry Transforms
Authors: Raif M. Rustamov
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

"Perfect symmetries are all alike; every imperfect symmetry is imperfect in its own way." - adapted from Leo Tolstoy's "Anna Karenina". Symmetry has been playing an increasing role in 3D shape processing. Recently introduced Planar Reflective Symmetry Transform(PRST) has been found useful for canonical coordinate frame determination, shape matching, retrieval, and segmentation. Guided by the intuition that every imperfect symmetry is imperfect in its own way, we investigate the possibility of incorporating more information into symmetry transforms like PRST. As a step in this direction, the concept of Augmented Symmetry Transform is introduced; we obtain a family of symmetry transforms indexed by a parameter. While the original PRST measures how much the symmetry is broken, the Augmented PRST also gives some information about how it is broken. Several approaches to calculating the augmented transform are described. We demonstrate that the augmented transform is useful for shape retrieval.
A new time-scale adaptive denoising method based on wavelet shrinkage
Authors: Xiao-Ping Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The wavelet shrinkage denoising approach is able to maintain local regularity of a signal while suppressing noise. However, the conventional wavelet shrinkage based methods are not time-scale adaptive to track the local time-scale variation. In this paper, a new time-scale adaptive denoising method for deterministic signal estimation is presented, based on the wavelet shrinkage. A class of smooth shrinkage functions and the local SURE (Stein's unbiased risk estimate) risk are employed to achieve time-scale adaptive denoising. The system structure and the learning algorithm are developed. The numerical results of our system are presented and compared with the conventional wavelet shrinkage techniques as well as their optimal solutions. Results indicate that the new time-scale adaptive method is superior to the conventional methods. It is also shown that the new method sometimes even achieves better performance than the optimal solution of the conventional wavelet shrinkage techniques.
Individual Tariffs for Mobile Services: Analysis of Operator Business and Risk Consequences
Authors: H. Chen, L-F Pau
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

A design approach is offered for individual tariffs for mass customized mobile service products, whereby operators can determine their contract acceptance rules to guarantee with a set probability their minimum profit and risk levels. It uses realistic improvements to earlier reported negotiation algorithms [1], and a full operator operational model including infrastructure and content acquisition. Value at risk and profit are analyzed when a random user has consistent characteristics to a survey group, so that risk and profits are pooled. This analysis is necessary to give the supplier business guarantees to enter individual tariff agreements. A full numerical case is given for a class of mobile service.
Testing software components for integration: a survey of issues and techniques: Research Articles
Authors: Muhammad Jaffar-ur Rehman, Fakhra Jabeen, Antonia Bertolino, Andrea Polini
Venue: Software Testing, Verification Reliability (2007)

Component-based development has emerged as a system engineering approach that promises rapid software development with fewer resources. Yet, improved reuse and reduced cost benefits from software components can only be achieved in practice if the components provide reliable services, thereby rendering component analysis and testing a key activity. This paper discusses various issues that can arise in component testing by the component user at the stage of its integration within the target system. The crucial problem is the lack of information for analysis and testing of externally developed components. Several testing techniques for component integration have recently been proposed. These techniques are surveyed here and classified according to a proposed set of relevant attributes. The paper thus provides a comprehensive overview which can be useful as introductory reading for newcomers in this research field, as well as to stimulate further investigation. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Scalable multi-path routing for robust communication
Authors: Katia Obraczka
Venue:  (2006)

Game-Theoretic Stochastic Routing (GTSR) is a multipath routing technique developed based on game theory. In this technique, the paths and the probability of taking a particular path are selected in such a way that maximizes security to link or node attacks and maximizes robustness to link or node failures. Despite the theoretical rigor, the application of GTSR in the real world requires some issues to be resolved. This thesis explores in particular three issues. First, GTSR requires extensive computation. Furthermore, the next-hop probabilities depend on both the source and the destination, hence the stochastic routing table grows quadratically with the size of the network. In order to reduce the computational complexity, a hierarchical approach is developed. It is shown that in many of today's networks, this hierarchical approach provides nearly as much robustness as does the more computationally complex flat routing approach.Second, TCP has been one of the significant deterrents to the deployment of multipath routing protocols including GTSR. Most standard implementations of TCP perform poorly when packets are reordered and packet reordering severely occurs in multipath routing. We propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, tuners are maintained to keep track of how long ago a packet was transmitted. Through extensive simulations, we show that TCP-PR performs consistently better than existing mechanisms that try to make TCP more robust to packet reordering. In the case that packets are not reordered, we verify that TCP-PR competes with typical implementations of TCP fairly.Lastly, through implementation on PlanetLab, we show that GTSR for overlay networks is efficient in overcoming path failures in the Internet in the sense that GTSR significantly reduces bursty packet losses. Furthermore, the evaluation based on distribution of failure duration verifies that a high degree of multipath is more helpful than a low degree of multipath in overcoming path failures.
Cross - Border Public Services: Analysis and Modeling
Authors: Vassilios Peristeras, Konstantinos Tarabanis, Nikos Loutas
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper describes our work in the field of semantic interoperability in Pan-European Public Services. After introducing a layered interoperability model, a typology of Pan-European Public Services is provided. This typology expresses our view on crossborder services and analyzes the heavily-used "crossborder services term. Furthermore, we identify some recurring patterns of semantic interoperability conflicts in Public Service provision as they occur in a cross-border setting.
Partial likelihood for real-time signal processing
Authors: T. Adali
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We introduce a unified statistical framework for real-time signal processing with neural networks by using a recent extension of maximum likelihood (ML) estimation, partial likelihood (PL) estimation theory, which allows for (i) dependent observations, and (ii) processing of data using only the information that is available at the time of processing. For a general neural network conditional distribution model, we establish a fundamental information-theoretic relationship for PL estimation, and obtain large sample properties of PL for the general case of dependent observations. We consider applications of PL to prediction and channel equalization.
Open Source Software: A Source of Possibilities for Software Engineering Education and Empirical Software Engineering
Authors: Letizia Jaccheri, Thomas Osterlie
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Open source projects are an interesting source for software engineering education and research. By participating in open source projects students can improve their programming and design capabilities. By reflecting on own participation by means of an established research method and plan, master's students can in addition contribute to increase knowledge concerning research questions. In this work we report on a concrete study in the context of the Netbeans open source project. The research method used is a modification of action research.
Symmetry Reduced Model Checking for B
Authors: Edd Turner, Michael Leuschel, Corinna Spermann, Michael Butler
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (orbit) of symmetric states. This paper presents a framework for symmetry reduced model checking of B machines, which verifies a unique representative from each orbit. Symmetries are induced by the deferred set; a key component of the B language. This contrasts with strategies that require the introduction of a special data type into a language, to indicate symmetry. An extended version of the graph isomorphism program, nauty, is used to detect symmetries, and the symmetry reduction package has been integrated into the PROB model checker. Relevant algorithms are presented, and experimental results illustrate the effectiveness of the method, where exponential speedups are sometimes possible.
Evaluating an asynchronous graduate degree program
Authors: G. W. Hislop
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Over the past three years, Drexel University's College of Information Science and Technology, USA, has developed asynchronous (any time/any place) learning environments for undergraduate and graduate students. Beginning in fall 1996, Drexel launched an entirely asynchronous Master of Science in Information Systems degree. The hallmarks of the fully asynchronous degree are: (1) students never gather for traditional face-to-face classes; (2) students and faculty engage in an active learning experience by network; (3) the degree content and requirements are the same in both traditional and asynchronous offerings; and (4) students learn to work using tools and techniques of distributed work environments. In this paper, the authors provide an overview of the Drexel project and their experience during the first years of this effort. Next, they discuss techniques and instruments they are using to evaluate the project both within the ALN environment and in comparison to traditional degree program delivery. Finally, they present some results from the first years of the effort.
Selectivity and Stability via Dendritic Nonlinearity
Authors: Kenji Morita, Masato Okada, Kazuyuki Aihara
Venue: Neural Computation (2007)

Inspired by recent studies regarding dendritic computation, we constructed a recurrent neural network model incorporating dendritic lateral inhibition. Our model consists of an input layer and a neuron layer that includes excitatory cells and an inhibitory cell; this inhibitory cell is activated by the pooled activities of all the excitatory cells, and it in turn inhibits each dendritic branch of the excitatory cells that receive excitations from the input layer. Dendritic nonlinear operation consisting of branch-specifically rectified inhibition and saturation is described by imposing nonlinear transfer functions before summation over the branches. In this model with sufficiently strong recurrent excitation, on transiently presenting a stimulus that has a high correlation with feed- forward connections of one of the excitatory cells, the corresponding cell becomes highly active, and the activity is sustained after the stimulus is turned off, whereas all the other excitatory cells continue to have low activities. But on transiently presenting a stimulus that does not have high correlations with feedforward connections of any of the excitatory cells, all the excitatory cells continue to have low activities. Interestingly, such stimulus-selective sustained response is preserved for a wide range of stimulus intensity. We derive an analytical formulation of the model in the limit where individual excitatory cells have an infinite number of dendritic branches and prove the existence of an equilibrium point corresponding to such a balanced low-level activity state as observed in the simulations, whose stability depends solely on the signal-to-noise ratio of the stimulus. We propose this model as a model of stimulus selectivity equipped with self-sustainability and intensity-invariance simultaneously, which was difficult in the conventional competitive neural networks with a similar degree of complexity in their network architecture. We discuss the biological relevance of the model in a general framework of computational neuroscience.
SAGU: unified open management system for educational institutions
Authors: Cesar Brod
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

SAGU is a portuguese acronym for "Sistema Aberto de Gestão Unificada", which translates in English to "Unified Open Management System". SAGU was originally designed to automate all of the relationship that happens between a student and his/her Educational Institution. This relationship happens in the academic, financial and administrative levels, and SAGU has subsystems - modules - dedicated to all of these levels. Being a modular, open system, SAGU can be tailored to fit the needs of any Educational Institution. It uses PHP and PostgreSQL and it's server runs on a GNU/Linux operating system. The client is any graphical browser, such as Netscape, Konqueror or even Internet Explorer, running on any operating system. This way, the system administrator or IT manager is free to decide upon any available client platform. SAGU is licensed under the GNU/GPL.
Comb Architectures for Finite Field Multiplication in F(2^m)
Authors: Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmadi
Venue: IEEE Transactions on Computers (2007)

Two high-speed bit-serial word-parallel or comb-style finite field multipliers are proposed in this paper. The first proposal utilizes a redundant representation for any binary field and the other uses a reordered normal basis for the binary field where a type-II optimal normal basis exists. The proposed redundant representation architecture has a smaller critical path delay compared to the previous methods while the complexities remain about the same. The proposed reordered normal basis multiplier has a significantly smaller critical path delay compared to the previous methods using the same basis or normal basis. Field-programmable gate array (FPGA) implementation results of the proposed multipliers are compared to those of the previous methods using the same basis, which confirms that the proposed multipliers allow a much higher clock rate.
Fundamental frequency estimation by higher order spectrum
Authors: Xudong Jiang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper proposes a new approach to estimate the fundamental frequency of periodic non-sinusoidal signals by higher order spectrum (HOS). The power of a periodic non-sinusoidal signal is distributed to its fundamental frequency and harmonics. Properly defined higher order spectrum can enhance the fundamental frequency component of spectrum by using the harmonics and therefore has the signal more easily detected from the noise. A specific form of higher order spectrum other than the traditional bispectrum or trispectrum is proposed to improve the reliability of the fundamental frequency estimation for unknown, periodic non-sinusoidal signals. The results of applying the proposed method to weak, high noise signals are surprisingly good. The performances of the various techniques are visually, quantitatively and statistically compared for some signals with different signal-to-noise ratios.
A field investigation of manual forces associated with trigger and push to start electric screwdrivers: Research Articles
Authors: Brian D. Lowe, Yong-Ku Kong, Edward Krieg, Steven Wurzelbacher, Soo-Jin Lee
Venue: Human Factors in Ergonomics Manufacturing (2007)

This study investigated manual forces associated with trigger start (TS) and push to start (PTS) activation in-line electric screwdriver designs. The vertically directed axial screwdriver force transmitted with the driver to the fastener and the grip&#x002F;finger forces on the driver handle were measured from 13 employees in an electronics assembly manufacturing facility. The PTS driver was associated with significantly ( p < .01) higher axial force than the TS driver at two of the four workstations, where the difference was as high as a 184&percnt; increase (36.5 vs. 103.8 N). Total finger force on the screwdriver handle was also higher for the PTS screwdriver ( p < .01). The PTS screwdriver may reduce instances of fastener head damage (&ldquo;cam out&rdquo;) by requiring a minimum level of axial force to ensure better contact between the screwdriver bit and the fastener. However, this appears to come at the expense of greater manual forces exerted by the operator. &copy; 2007 Wiley Periodicals, Inc. Hum Factors Man 17: 367&ndash;382, 2007.
Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories
Authors: D. Izzo, V. M. Becerra, D. R. Myatt, S. J. Nasuto, J. M. Bishop
Venue: Journal of Global Optimization (2007)

We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their trajectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search space pruning algorithm is then developed and its polynomial time and space complexity derived. The algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.
Transparent contribution of memory
Authors: James Cipar, Mark D. Corner, Emery D. Berger
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

A multitude of research and commercial projects have proposed contributory systems that utilize wasted CPU cycles, idle memory and free disk space found on end-user machines. These applications include distributed computation such as signal processing and protein folding, peer-to-peer backup, and large-scale distributed storage. While users are generally willing to give up unused CPU cycles, the use of memory by contributory applications deters participation in such systems. Contributory applications pollute the machine's memory, forcing user pages to be evicted to disk. This paging can disrupt user activity for seconds or even minutes. In this paper, we describe the design and implementation of an operating system mechanism to support transparent contribution of memory. A transparent memory manager (TMM) controls memory usage by contributory applications, ensuring that users will not notice an increase in the miss rate of their applications. TMM is able to protect user pages such that page miss overhead is limited to 1.7%, while donating hundreds of megabytes of memory.
A grain preservation translation algorithm: From ER diagram to multidimensional model
Authors: Yen-Ting Chen, Ping-Yu Hsu
Venue: Information Sciences: an International Journal (2007)

Many IT practitioners and researchers advocate that data models of data warehouses should incorporate the sources of their data in order to achieve maximum efficiency. As the source data are probably derived from system designed with ER diagrams, a great deal of research has been devoted to the design of methodologies for building multidimensional models based on source ER diagrams. However, to the best of our knowledge, no algorithm has been proposed that can systematically translate an entire ER diagram into a multidimensional model with hierarchical snowflake structures. In this paper, we propose an algorithm that achieves the above goal because it incorporates two features, namely, grain preservation and the minimal distance from each dimension table to the fact table. The grain preservation feature guarantees that the translated multidimensional model will maintain cohesive granularity among the entities. Meanwhile, the minimal distance feature guarantees that if an entity can be connected to the fact table in the multidimensional model by more than one path, the path with the smallest number of hops will always be chosen. The first feature is derived by translating ambiguous relationships between entities into weighting factors stored in bridge tables and enhancing fact tables with unique primary keys. The second feature results from including a revised shortest path algorithm in the translating algorithm, with the distance being calculated as the number of relationships required between entities. A prototype system based on the methodology is also developed, and snapshots of the screens used for the system's execution are presented.
Impulses and stochastic arithmetic for signal processing
Authors: J. F. Keane
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Explores the use of Poisson point processes and stochastic arithmetic to perform signal processing, functions. Our work is inspired by the asynchrony and fault tolerance of biological neural systems. The essence of our approach is to code the input signal as the rate parameter of a Poisson point process, perform stochastic computing operations on the signal in the arrival or "pulse" domain, and decode the output signal by estimating the rate of the resulting process. An analysis of the Poisson pulse frequency modulation encoding error is performed. Asynchronous, stochastic computing operations are applied to the impulse stream and analyzed. A special finite impulse response (FIR) filtering scheme is proposed that preserves the Poisson properties and allows filters to be cascaded without compromising the ideal signal statistics.