ppxscal/embedding_network huggingface dataset:
The self-paced Graz brain-computer interface: methods and applications
Authors: Reinhold Scherer, Alois Schloegl, Felix Lee, Horst Bischof, Janez Janša, Gert Pfurtscheller
Venue: Computational Intelligence and Neuroscience (2007)

We present the self-paced 3-class Graz brain-computer interface (BCI) which is based on the detection of sensorimotor electroencephalogram (EEG) rhythms induced by motor imagery. Self-paced operation means that the BCI is able to determine whether the ongoing brain activity is intended as control signal (intentional control) or not (non-control state). The presented system is able to automatically reduce electrooculogram (EOG) artifacts, to detect electromyographic (EMG) activity, and uses only three bipolar EEG channels. Two applications are presented: the freeSpace virtual environment (VE) and the Brainloop interface. The freeSpace is a computer-game-like application where subjects have to navigate through the environment and collect coins by autonomously selecting navigation commands. Three subjects participated in these feedback experiments and each learned to navigate through the VE and collect coins. Two out of the three succeeded in collecting all three coins. The Brainloop interface provides an interface between the Graz-BCI and Google Earth.
Human Face Recognition Based on Principal Component Analysis and Particle Swarm Optimization-BP Neural Network
Authors: Lei Du, Zhenhong Jia, Liang Xue
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper proposes an improved face recognition method based on the combination of Principal Component Analysis and Neural Networks. This method adopts Principal Component Analysis (PCA) to abstract principal eigenvectors of the image in order to get best feature description, hence to reduce the number of inputs of neural networks. After this, these image data of reduced dimensions are input into a feed forward neural network to be trained. The weights of neural networks are optimized using Particle Swarm Optimization (PSO) algorithm. Then this well-trained network is tested using samples from standard human face database. The results show that this method gains higher recognition rate in contrast with some other methods.
Network-Based Visualization of 3D Landscapes and City Models
Authors: Jérôme Royan, Patrick Gioia, Romain Cavagna, Christian Bouville
Venue: IEEE Computer Graphics and Applications (2007)

To improve the visualization of large 3D landscapes and city models in a network environment, the authors use two different types of hierarchical level-of-detail models for terrain and groups of buildings. They also leverage the models to implement progressive streaming in both client-server and peer-to-peer network architectures.
A Novel Immune Genetic Algorithm-Based PID Controller Design and Its Application to CIP-I Intelligent Leg
Authors: Guanzheng Tan, Bin Jiang, Liming Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A novel Immune Genetic Algorithm with Elitism (IGAE) is presented. The IGAE has two features. The first is that the similarity and expected reproduction probability of antibody can be adjusted dynamically in the process of population evolution to balance the population diversity and the convergence speed of the algorithm. The second is that with the elitism strategy this algorithm is able to find the globally optimal solution. Based on the IGAE, an optimal design method of PID controller is proposed. The PID controller designed by the IGAE, called the IGAEPID controller, was used to control the motion of the CIP-I leg, an intelligent leg prosthesis. The simulation experiments demonstrated that the controller has good control performance. Compared with the other three PID controllers designed respectively by the immune clonal selection algorithm, the canonical genetic algorithm with the elitism strategy, and the standard simulated annealing algorithm, the IGAE-PID controller exhibited better or equivalent control performance. Moreover, the simulation results also verified that the IGAE has better performance in convergence speed and computation efficiency.
Geometric programming with fuzzy parameters in engineering optimization
Authors: Shiang-Tai Liu
Venue: International Journal of Approximate Reasoning (2007)

Geometric programming provides a powerful tool for solving a variety of engineering optimization problems. Many applications of geometric programming are engineering design problems in which some of the problem parameters are estimates of actual values. When the parameters in the problem are imprecise, the calculated objective value should be imprecise as well. This paper develops a procedure to derive the fuzzy objective value of the fuzzy posynomial geometric programming problem when the exponents of decision variables in the objective function, the cost and the constraint coefficients, and the right-hand sides are fuzzy numbers. The idea is based on Zadeh's extension principle to transform the fuzzy geometric programming problem into a pair of two-level of mathematical programs. Based on duality algorithm and a simple algorithm, the pair of two-level mathematical programs is transformed into a pair of conventional geometric programs. The upper bound and lower bound of the objective value are obtained by solving the pair of geometric programs. From different values of @a, the membership function of the objective value is constructed. Two examples are used to illustrate that the whole idea proposed in this paper.
Extending a Secure System Development Methodology to SOA
Authors: Eduardo B. Fernandez, Preethi Cholmondeley, Olaf Zimmermann
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The design of secure service-oriented architectures presents a new set of challenges for the designer. While security standards do provide some solutions, a secure system is one in which security is built in right from the start, not after a design approach has been decided. We have presented a methodology to build secure systems using patterns. We extend it now to service-oriented analysis and design, adapting the use of a tree with architectural decisions to include also security decisions. This decision tree makes architectural knowledge explicit and reusable and has value on its own right, independent of SOA and our methodology.
The impact of wrong-path memory references in cache-coherent multiprocessor systems
Authors: Resit Sendag, Ayse Yilmazer, Joshua J. Yi, Augustus K. Uht
Venue: Journal of Parallel and Distributed Computing (2007)

The core of current-generation high-performance multiprocessor systems is out-of-order execution processors with aggressive branch prediction. Despite their relatively high branch prediction accuracy, these processors still execute many memory instructions down mispredicted paths. Previous work that focused on uniprocessors showed that these wrong-path (WP) memory references may pollute the caches and increase the amount of cache and memory traffic. On the positive side, however, they may prefetch data into the caches for memory references on the correct-path. While computer architects have thoroughly studied the impact of WP effects in uniprocessor systems, there is no comparable work for multiprocessor systems. In this paper, we explore the effects of WP memory references on the memory system behavior of shared-memory multiprocessor (SMP) systems for both broadcast and directory-based cache coherence. Our results show that these WP memory references can increase the amount of cache-to-cache transfers by 32%, invalidations by 8% and 20% for broadcast and directory-based SMPs, respectively, and the number of writebacks by up to 67% for both systems. In addition to the extra coherence traffic, WP memory references also increase the number of cache line state transitions by 21% and 32% for broadcast and directory-based SMPs, respectively. In order to reduce the performance impact of these WP memory references, we introduce two simple mechanisms-filtering WP blocks that are not likely-to-be-used and WP aware cache replacement-that yield speedups of up to 37%.
The Theory and Application of Rough Integration in Rough Function Model
Authors: Yun Wang, Jinmei Wang, Yanyong Guan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The definition of the rough integral Pawlak proposed is improved. New notions are proposed, which are respectively the rough integral on a constant interval and the roughly integral upper limit function, and so on. By comparing with the definite integral of real functions, the properties of rough integrals are analyzed. Giving the concept of mean value of discrete functions, the mean value method for rough integration is derived. At the same time, the intermediate value theorem of rough integration is proposed and its geometric significance is analyzed, which provides a dependable theoretical tool for rough integral operation, etc.. Conclusions including the existence theorem of rough primitives and the fundamental formula of rough calculus are proposed. By the representative of discrete functions, the method of computing a primitive is given, by which basic formulas for rough integration in common use are derived, and the method of rough direct integration is obtained. There is also the method of rough integration by parts for rough integrals which is like that of definite integrals. Thus the recurrence formula for rough integration is deduced, in which the integrand of the rough integral is in the shape of the product of a rough power function and a rough exponential function. It is pointed out that integration by substitution is not applicable for rough integral operation.
New Applications & Recent Research
Authors: D. A. Michalopoulos
Venue: Computer (1980)

The UCLA Tissue Typing Laboratory is using Data General Corporation's Transaction Processing Management System in its kidney donor and recipient program. Functions performed by the laboratory include serum testing on potential transplant recipients, tissue typing, and creating correlation matrices and scattergrams.
An Efficient Algorithm for Preserving Events' Temporal Relationships in Wireless Sensor Actor Networks
Authors: Azzedine Boukerche, Anahit Martirosyan
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper proposes an event ordering algorithm for Wireless Sensor Actor Networks (WSANs) that could be applied for monitoring critical conditions (such as fires, explosions, toxic gas leaks etc.) in order to ensure the correct interpretation of events. We propose modifications to the Ordering by Confirmation event ordering protocol forWSANs by introducing clustering into the network's topology. The objectives of the proposed modifications are a reduced number of messages, energy efficiency, scalability and reduced latency. At the same time, we propose a hybrid synchronization scheme for the clustered topology, in which local time scales are used at the level of clusterheads. The clusterheads are synchronized with each other by the Actor node using the Reference Broadcast Synchronization technique, while the nodes inside clusters are synchronized with the Round Trip Synchronization technique. The synchronization scheme aims at preserving energy and reducing network delay and it is better suited for the resource sparseness of Wireless Sensor Networks as opposed to methods that use global time scales. Moreover, our proposed algorithm uses the message exchange necessary for event ordering and routing protocols for time synchronization purposes by piggybacking synchronization pulses and replies on these messages, thus reducing the additional traffic needed for time synchronization. In this paper, we present our protocol, discuss its implementation and provide its proof of correctness.
Microprogramming: The bridge between Hardware and Software
Authors: J. M. Galey
Venue: Computer (1975)

In the past decade, microprogramming has changed from a machine implementation process for large computing devices to a widespread design practice covering the full spectrum of machines as measured by their size, performance, and cost.
Automatic generation of fuzzy rules using hyper-elliptic-cone membership functions by genetic algorithms
Authors: Hiroyuki Inoue, Katsuari Kamei, Kazuo Inoue
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

We had presented an automatic generation technique for fuzzy rules using hyper-cone membership functions by genetic algorithms (GA). However, there remain some problems. The shape of fuzzy subsets is limited to a hyper-sphere. Since there was not a regulation which determines the order of rules, two rules having different antecedent part structure are crossed in Crossover, and high-performance rules may not be inherited in the next generation. In this paper, we expand the shape of fuzzy subsets to be elliptic and present an automatic generation technique for fuzzy rules using hyper-elliptic-cone membership functions by GA. We also present a rules sorting technique which efficiently reduces the number of rules and obtains high-performance fuzzy rule sets. We applied presented methods to a line pursuit control problem and a trailer-truck back-up control problem. The method using hyper-elliptic-cone membership functions can obtain very accurate fuzzy system with as high performance as the method using hyper-cone membership functions. The technique of a sort of rules can not only reduce the number of rules, but also can get a high-performance rule set.
Specail Feature Computer-Aided Seismic Analysis and Discrimination
Authors: W. Myers
Venue: Computer (1977)

The tremendous amount of data generated in the three branches of seismic activity-nuclear test discrimination, earthquake research, and geophysical exploration-places extraordinary demands on digital processing for extracting significant information. Faced with this heavy workload, the seismic community has from the start led in the development of analytical methods such as compositing (extracting a signal from noise) and digital filtering. More recently, seismic analysts have been using automatic-pattern-recognition techniques to discriminate between underground nuclear explosions and earthquakes. 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
An Algebraic Approach to Boolean Equations
Authors: S. Rudeanu
Venue: IEEE Transactions on Computers (1974)

A generalization of the Löwenheim formula for the solutions of a Boolean equation was recently obtained by Ju. A. Serikov. In this correspondence the Serikov theorem is written in a somewhat simpler form and it is shown that it can also be viewed as a particular case of the classical Löwenheim formula.
Supervised Dimensionality Reduction on Streaming Data
Authors: Mao Ye, Xue Li, Maria E. Orlowska
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

We propose a sliding-window approach for the dimen- sionality reduction for linear discriminant analysis(LDA) on streaming data. Streaming data are time variant and can be in high dimensions. When a sliding window is mov- ing along data stream, the data that have passed out of the window will be forgotten (i.e., deleted).We propose a LDA dimensionality reduction algorithm based on different slid- ing windows. The experiments on UCI data sets have been conducted and results are compared with the batch IDR/QR LDA method. It is shown that our algorithm present an effi- cient solution to the problem of dimensionality reduction on streaming data yet still have a good performance on com- putational cost and the classification accuracy.
Testing conformance on Stochastic Stream X-Machines
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Stream X-machines have been used to specify real systems requiring to represent complex data structures. One of the advantages of using stream X-machines to specify a system is that it is possible to produce a test set that, under certain conditions, detects all the faults of an implementation. In this paper we present a formal framework to test temporal behaviors in systems where temporal aspects are critical. Temporal requirements are expressed by means of random variables and affect the duration of actions. Implementation relations are presented as well as a method to determine the conformance of an implementation with respect to a specification by applying a test set.
Surfing the net for software engineering notes
Authors: Mark Doernhoefer
Venue: ACM SIGSOFT Software Engineering Notes (2007)

The web has a lot of sites devoted to testing and test tools. If you are in charge of designing a test program for your development, a few hours surfing the sites listed here could get you off to a pretty good start. We'll visit some of the sites that offer test tools, but for the most part, I'm going to focus on sites that talk about testing, test methods, and test plans. There will be plenty of sites that have links to the tools, so you can take off from there. But remember, a test tool is not a test plan.
Voltage island-driven floorplanning
Authors: Qiang Ma, Evangeline F. Y. Young
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Energy efficiency has become one of the most important issues to be addressed in today's System-on-a-Chip (SoC) designs. One way to lower the power consumption is to reduce the supply voltage. Multi-supply voltage (MSV) is thus introduced to provide higher flexibility in controlling the power and performance trade-off. In region-based MSV, circuits are partitioned into "voltage islands" where each island occupies a contiguous physical space and operates at one supply voltage. These tasks of island partitioning and voltage level assignments should be done simultaneously in the floorplanning process in order to take those important physical information into consideration. In this paper, we consider this core-based voltage island driven floorplanning problem including islands with power down mode, and propose a method to solve it. Given a candidate floorplan solution represented by a normalized Polish expression, we are able to obtain optimal voltage assignment and island partitioning (including islands with power down mode) simultaneously to minimize the total power consumption. Simulated annealing is used as the basic searching engine. By using this approach, we can achieve significant power savings (up to 50%) for all data sets, without any significant increase in area and wire length. Our floorplanner can also be extended to minimize the number of level shifters between different voltage islands and to simplify the power routing step by placing the islands in proximity to the corresponding power pins.
XRPC: interoperable and efficient distributed XQuery
Authors: Ying Zhang, Peter Boncz
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We propose XRPC, a minimal XQuery extension that enables distributed yet efficient querying of heterogeneous XQuery data sources. XRPC enhances the existing concept of XQuery functions with the Remote Procedure Call (RPC) paradigm. By calling out of an XQuery for-loop to multiple destinations, and by calling functions that themselves perform XRPC calls, complex P2P communication patterns can be achieved. The XRPC extension is orthogonal to all XQuery features, including the XQuery Update Facility (XQUF). We provide formal semantics for XRPC that encompasses execution of both read-only and update queries. XRPC is also a network SOAP sub-protocol, that integrates seamlessly with web services and Service Oriented Architectures (SOA), and AJAX-based GUIs. A crucial feature of the protocol is bulk RPC, that allows remote execution of many different calls to the same procedure, using possibly a single network round-trip. The efficiency potential of XRPC is demonstrated via an open-source implementation in MonetDB/XQuery. We show, however, that XRPC is not system-specific: every XQuery data source can service XRPC calls using a wrapper. Since XQuery is a pure functional language, we can leverage techniques developed for functional query decomposition to rewrite data shipping queries into XRPC-based function shipping queries. Powerful distributed database techniques (such as semi-join optimizations) directly map on bulk RPC, opening up interesting future work opportunities.
Comparing time series using wavelet-based semblance analysis
Authors: G. R. J. Cooper, D. R. Cowan
Venue: Computers Geosciences (2008)

Similarity measures are becoming increasingly commonly used in comparison of multiple datasets from various sources. Semblance filtering compares two datasets on the basis of their phase, as a function of frequency. Semblance analysis based on the Fourier transform suffers from problems associated with that transform, in particular its assumption that the frequency content of the data must not change with time (for time-series data) or location (for data measured as a function of position). To overcome these problems, semblance is calculated here using the continuous wavelet transform. When calculated in this way, semblance analysis allows the local phase relationships between the two datasets to be studied as a function of both scale (or wavelength) and time. Semblance analysis is demonstrated on synthetic datasets and on gravity and aeromagnetic data from the Vredefort Dome, South Africa. Matlab source code is available from the IAMG server at www.iamg.org.
Approximation by smoothing variational vector splines for noisy data
Authors: A. Kouibia, M. Pasadas
Venue: Journal of Computational and Applied Mathematics (2008)

This paper addresses the problem of constructing some free-form curves and surfaces from given to different types of data: exact and noisy data. We extend the theory of D^m-splines over a bounded domain for noisy data to the smoothing variational vector splines. Both results of convergence for respectively the exact and noisy data are established, as soon as some estimations of errors are given.
Personal Brokerage of Web Service Access
Authors: Apostol T. Vassilev, Bertrand du Castel, Asad M. Ali
Venue: IEEE Security and Privacy (2007)

Network smart-card technology can potentially meet the growing need for secure, flexible Web services. This technology allows building personal identity brokerage solutions that bridge independent Web services into new simple sign-on systems. The network smart card can help bring about a new generation of personal authentication services.
Free-Form Solid Modeling with Trimmed Surface Patches
Authors: Malcolm Casale
Venue: IEEE Computer Graphics and Applications (1987)

Solid modelers store a more complete representation than wireframe or surtace modelers. This completeness permits the automation of such tasks as interference analysis, mass property calculation, and finite element mesh generation. But the denser information content and complex algorithms needed to perform these tasks complicate the support of free-form geometry, especially Boolean operations. Consequently, the high degree of geometric coverage traditionally found in surface modeling systems has not, for the most part, been equaled in modern solid modelers. This article explores some of the difficulties encountered in Boolean combinations of free-from solids and presents a geometric representation designed to circumvent them.