ppxscal/embedding_network huggingface dataset:
On the Use of Energy Activation Functions in Parallel Interference Cancellation for Asynchronous CDMA Systems
Authors: Xiaoyan Feng, Charalampos Tsimenidis, Bayan Sharif
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

This paper introduces a computationally efficient parallel interference cancellation (PIC) receiver to reduce the complexity of the multiuser detectors for asynchronous code-division multiple-access (CDMA) systems. The complexity is reduced by employing the proposed energy activation functions (EAF). All the results are measures of the bit error rate (BER). Performance of the proposed algorithm in both the AWGN and the multipath environment is presented. Comparisons are made between the proposed PIC algorithm, the conventional PIC and the conventional matched filter receiver.
Mathematical Morphology Based ECG Feature Extraction for the Purpose of Heartbeat Classification
Authors: Pawel Tadejko, Waldemar Rakowski
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The paper presents the classification performance of an automatic classifier of the electrocardiogram (ECG) for the detection abnormal beats with new concept of feature extraction stage. Feature sets were based on ECG morphology and RR-intervals. Configuration adopted a Kohonen self-organizing maps (SOM) for analysis of signal features and clustering. In this study, a classifier was developed with SOM and Learning Vector Quantization (LVQ) algorithms using the data from the records recommended by ANSI/AAMI EC57 standard. This paper compares two strategies for classification of annotated QRS complexes: based on orginal ECG morphology features and proposed new apporach - based on preprocessed ECG morphology features. The mathematical morphology filtering is used for the preprocessing of ECG signal. The problem of choosing an appropriate structuring element of mathematical morphology filtering for ECG signal processing was studied. The performance of the algorithm is evaluated on the MITBIH Arrhythmia Database following the AAMI recommendations. Using this method the results of recognition beats either as normal or arrhythmias was improved.
Thin slicing
Authors: Manu Sridharan, Stephen J. Fink, Rastislav Bodik
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Program slicing systematically identifies parts of a program relevant to a seed statement. Unfortunately, slices of modern programs often grow too large for human consumption. We argue that unwieldy slices arise primarily from an overly broad definition of relevance, rather than from analysis imprecision. While a traditional slice includes all statements that may affect a point of interest, not all such statements appear equally relevant to a human. As an improved method of finding relevant statements, we propose thin slicing. A thin slice consists only of producer statements for the seed, i.e., those statements that help compute and copy avalue to the seed. Statements that explain why producers affect the seed are excluded. For example, for a seed that reads a value from a container object, a thin slice includes statements that store the value into the container, but excludes statements that manipulate pointers to the container itself. Thin slices can also be hierarchically expanded to include statements explaining how producers affect the seed, yielding a traditional slice in the limit. We evaluated thin slicing for a set of debugging and program understanding tasks. The evaluation showed that thin slices usually included the desired statements for the tasks (e.g., the buggy statement for a debugging task). Furthermore, in simulated use of a slicing tool, thin slices revealed desired statements after inspecting 3.3 times fewer statements than traditional slicing for our debugging tasks and 9.4 times fewer statements for our program understanding tasks. Finally, our thin slicing algorithm scales well to relatively large Java benchmarks, suggesting that thin slicing represents an attractive option for practical tools.
A successful process for developing performance-based outcomes for engineering student writing assessment
Authors: C. Plumb
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Summary form only given. Faculty, student, and industry representatives met in a series of four workshops in autumn 1999 to develop performance based writing outcomes for the College of Engineering at the University of Washington. During the workshops, participants used the contents of portfolios of student writing collected over a two-year period to help them gain a better understanding of student writing experiences while in the college. Discussions brought to light a number of important issues related to engineering writing and the teaching of writing in an engineering context. The workshops culminated in a two-part set of writing outcomes for students graduating from the college. Faculty representatives are now working with other members of their respective departments to determine which courses and which writing within these courses will be used to assess student competency in these outcomes.
Cooperative secondary authorization recycling
Authors: Qiang Wei, Matei Ripeanu, Konstantin Beznosov
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

As distributed applications such as Grid and enterprise systems scale up and become increasingly complex, their authorization infrastructures-based predominantly on the request-response paradigm-are facing challenges in terms of fragility and poor scalability. We propose an approach where each application server caches previously received authorizations at its secondary decision point and shares them with other application servers to mask authorization server failures and network delays.This paper presents the design of our cooperative secondary authorization recycling system and its evaluation using simulation and prototype implementation. The results demonstrate that our approach improves the availability of authorization infrastructures while preserving their performance characteristics. Specifically, by sharing authorizations, the cache hit rate.an indirect metric of availability.can reach 70%, even when only 10% of authorizations are cached. Depending on the deployment scenario, the performance in terms of the average time for authorizing an application request can be reduced by up to 30%.
Analysis of the time-frequency representation using the Gamma filter
Authors: S. Celebi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We analyze the performance of the time-frequency representation method that utilizes the Gamma filter. Gamma filter which can be implemented as a cascade of identical first order lowpass filters generates at its taps the Poisson moments of the input signal. These moments carry spectral information about the recent history of the input signal. Due to the inherent time window embedded in the Gamma filter, the moments are local both in time and frequency. Hence, they can be used to construct a time-frequency representation as an alternative to the conventional methods of short term Fourier transform (STFT), cepstrum, etc. The appeal of the proposed method comes from the fact that in the analog domain the moments are readily available as a continuous time electrical signal and can be physically measured, rather than computed offline by a digital computer. Furthermore, for a faithful representation, it is sufficient to observe the moments at the information rate (nonstationarity rate) rather than the usually higher Nyquist rate. The observed moments can be fed into an artificial neural network (ANN) for tasks like prediction, classification and identification. This work studies the performance of the proposed representation scheme as a function of the system parameters, such as; time scale, number of moments and number of bands on the estimation quality.
Game AI is Dead. Long Live Game AI!
Authors: Alexander Nareyek
Venue: IEEE Intelligent Systems (2007)

With industry addressing most of the game AI problems on their own, and academia looking at them only half-heartedly, is there any light at the end of the tunnel for game AI and academic contributions?
Convergence enabled by BT's next generation of clients
Authors: R. Collingridge, I. Matthews, P. Clarke
Venue: BT Technology Journal (2007)

With the recent proliferation of on-line communications and collaboration services and the growing numbers and types of users, it is the whole customer experience and the quality of the user interfaces that is now being seen as the main differentiating factor by many product and service manufacturers. In this paper we provide an overview of some of our user interaction research, which is driving BT's commercial capability in this space. We aim to show how a user-centric approach can lead to better architectural and technology choices when delivering these services and how it leads to a more powerful, accessible and holistic set of services for BT's customers. This in turn will result in a more clearly defined and recognisable BT brand and a larger, global customer base.
SWISS-TANDEM: A Web-Based Workspace for MS/MS Protein Identification on PC Grids
Authors: Dominique Zosso, Konstantin Arnold, Torsten Schwede, Michael Podvinec
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Tandem mass spectrometry is a powerful technique for the identification of proteins contained in a biological sample. We present a grid-based application service for the analysis of tandem mass spectra, based on the open-source X!Tandem algorithm. The implemented parallelization strategy allows the distribution of analysis jobs to a grid of desktop PCs, utilizing their idle capacity. For this application service, a user-friendly project-oriented frontend was developed, implemented as a web-based workspace. After analysis, results are visualized and presented to the user along with a set of powerful and novel tools to allow further interpretation and evaluation of search results.
An Eyetracker Study of the Haptic Cuing of Visual Attention
Authors: Chanon M. Jones, J. Jay Young, Rob Gray, Charles Spence, Hong Z. Tan
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We investigated the haptic cuing of visual attention using spatially-predictive (75% valid) and spatiallynonpredictive (25%) haptic cues. The participants performed a visual change detection task immediately following a haptic spatial cue whose location corresponded to one of the four visual quadrants. The participants were explicitly instructed to use the spatially-predictive haptic cues but to try and ignore the spatially-nonpredictive cues. In addition to reaction time (RT) data, we recorded participants' eyeposition in order to provide a direct measure of overt visual attention. The results indicated that the spatially-predictive haptic cues reduced the amount of time taken to detect the visual changes, as expected. The spatially-nonpredictive cues increased visual search latencies, indicating that the cues could not be ignored completely. There was also evidence that haptic cuing served to alert the participants resulting in an overall reduction of response latencies.
Letters: Comments and further improvements on "New LMI conditions for delay-dependent asymptotic stability of delayed Hopfield neural networks"
Authors: Xuyang Lou, Baotong Cui
Venue: Neurocomputing (2007)

In this paper, we point out that global Lipschitz condition on the activation functions should be revised and the boundedness assumption of the activation functions in the above paper can be removed based on a nonlinear measure approach. Moreover, we present some improved sufficient conditions which are less conservative than those in the above paper in terms of linear matrix inequality (LMI).
Selecting an optimal set of transmit antennas for a low rank matrix channel
Authors: D. A. Gore
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Previous work has shown that the use of multiple antennas in a fading environment results in a linear increase in capacity. This paper examines the capacity of a multiple antenna element array (MEA) in a quasi-static flat fading environment with a rank deficient channel. We assume that the channel is known at the receiver and the existence of a feedback path to the transmitter. For a particular channel realization, we show that the judicious use of fewer transmit antennas when the channel matrix is ill-conditioned can increase system capacity. We develop a criterion for selecting an optimum set of transmit antennas. This selection is optimal in the sense that the capacity of the resulting MEA system is greater than that for any other configuration with the same number of transmit antennas chosen from the original set. The resulting channel is full rank.
Executable requirements: opportunities and impediments
Authors: G. A. Shaw
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In a top-down, language-based design methodology, requirements can be specified in an executable format, reducing the ambiguity typically encountered with written requirements, and serving as the starting point for the evolution of more detailed requirements and design specifications. As part of the Rapid Prototyping of Application Specific Signal Processors (RASSP) program, a VHDL executable requirement was constructed to capture the interface timing and functional requirements for an embedded processor intended to form images in real-time for a synthetic aperture radar. This paper includes a brief description of the application, then describes the implementation strategy and issues associated with the development of the VHDL executable requirement, emphasizing the importance of the VHDL test bench concept. Anticipated benefits of widespread utilization of VHDL executable requirements are discussed along with potential impediments to adoption. Areas for additional research and development are identified.
Lindstrom theorems for fragments of first-order logic
Authors: Balder ten Cate, Johan van Benthem, Jouko Vaananen
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Lindstrom theorems characterize logics in terms of model-theoretic conditions such as Compactness and the Lowenheim-Skolem property. Most existing Lindstrom theorems concern extensions of first-order logic. On the other hand, many logics relevant to computer science are fragments or extensions of fragments of first-order logic, e.g., k-variable logics and various modal logics. Finding Lindstrom theorems for these languages can be challenging, as most known techniques rely on coding arguments that seem to require the full expressive power of first-order logic. In this paper, we provide Lindstrom characterizations for a number of fragments of first-order logic. These include the k-variable fragments for k \ge 2, Tarski's relation algebra, graded modal logic, and the binary guarded fragment. We use two different proof techniques. One is a modification of the original Lindstrom proof. The other involves the modal concepts of bisimulation, tree unraveling, and finite depth. Our results also imply semantic preservation theorems. Characterizing the 2-variable fragment or the full guarded fragment remain open problems.
An Enhanced Robust Entropy Coder for Video Codecs Based on Context-Adaptive Reversible VLC
Authors: Qiang Wang, Debin Zhao, Siwei Ma, Wen Gao
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Reversible variable length coding (RVLC) is an important robust entropy coding technique for error resilient video transmission. The popular DCT-based video codecs all can use it. RVLC supports both the forward and backward decoding, so that the error-free data in the backward direction can be recovered. But RVLC can not retrieve the intact data between separate errors. This will degrade its error resilience performance especially in high error rates. On the other hand, as context modeling is widely adopted in modern entropy coders, RVLC shows low coding efficiency. Therefore, our design aims to improve the traditional RVLC in both error resilience and coding efficiency.
Improvement of Accuracy of 3D Structure Reconstruction from Interlaced Video Sequence
Authors: Ichiro Yuyama, Yuta Takano, Masami Sobata, Yoko Seki, Hiroshi Hasegawa, Yu Watanabe
Venue: Proceedings of the First International Conference on the Digital Society (2007)

This Paper investigates a 3D reconstruction of the building by detecting the vanishing points from the interlaced video sequence. It is theoretically possible to reconstruct a 3D model of the building from a single picture. However, the accuracy of reconstruction is not enough with a single picture because of the deterioration of the picture, such as noise or dim etc. Increasing the number of pictures, accuracy of the reconstructed model will become higher. It is also possible to apply this method to video sequences. There are deteriorations caused by interlace scanning in addition to noise in each video image. Our preliminary results show that from information of the many pictures, this method can reconstruct precise 3D structure. The addition average values that are obtained from the 50 pictures or more have been settled within 2% of the actual value.
Live E! Project: Establishment of Infrastructure Sharing Environmental Information
Authors: Satoshi Matsuura, Hiroki Ishizuka, Hideya Ochiai, Shinichi Doi, Shinichi Ishida, Masaya Nakayama, Hiroshi Esaki, Hideki Sunahara
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

The Live E! project is an open research consortium among industry and academia to explore the platform to share the digital information related with the earth and our living environment. We have getting a lot of low cost sensor nodes with Internet connectivity. The deployment of broadband and ubiquitous networks will enable autonomous and global digital information sharing over the globe. In this paper, we describe the technical and operational overview of Live E! project, while discussing the objective, such as education, disaster protection/reduction/recovery or business cases, and goal of this project activity.
A crash course on database queries
Authors: Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Complex database queries, like programs in general, can "crash", i.e., can raise runtime errors. We want to avoid crashes without losing expressive power, or we want to correctly predict the absence of crashes. We show how concepts and techniques from programming language theory, notably type systems and reflection, can be adaptedto this end. Of course, the specific nature of database queries (asopposed to general programs), also requires some new methods, andraises new questions.
Supporting the Formal Analysis of Software Designs
Authors: Ann E. K. Sobel, Sherrie Campbell
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Software Engineering is the science of designing complex software systems using engineering and design techniques to produce good quality systems. Though formal methods are among the techniques that facilitate the creation of high quality systems, they are frequently not taught to students; mainly due to the complexity of the topic and the lack of textbooks and supporting materials/tools that are appropriate for a student to learn and use them throughout the development of their software. This paper outlines a classroom experience using a tool, Advanced Design Employing Pattern Templates (ADEPT), that aids in establishing that a system design satisfies its specification. Usage of ADEPT supports the formal analysis of designs in conjunction with the use of design patterns.
The iteration method of data censoring in the regression estimation problem
Authors: E. S. Kirik
Venue: Automation and Remote Control (2007)

A robust analog of the Nadaraya-Watson regression estimate is considered. A solution is obtained in the class of censor algorithms. A criterion and iteration procedure for determining a censored sample are proposed. The criterion is based on the analysis of residuals (errors) of estimation.
Phishing Phishers - Observing and Tracing Organized Cybercrime
Authors: Dominik Birk, Sebastian Gajek, Felix Grobert, Ahmad-Reza Sadeghi
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

We investigate the paradigm shift from the realworld organized crime to the organized cyber crime, in particular with regard to identity theft through phishing and the methods deployed for the purpose of money laundering. Our work is based on our collaboration with banks and lawyers within the working group identity protection on the Internet (a-i31) as well as phishing victims in Germany. We report on case studies and analyze strategies used by phishers. We propose a forensic framework concept for identifying and tracing financial agents involved in the associated criminal network. Finally, we shortly discuss some open problems.
Applications = Components + GLoo
Authors: Markus Lumpe
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We are advocating a component-oriented software development approach that provides support for a clear separation between the computational and the compositional entities of an application. This principle is best captured by the application building paradigm ''Applications = Components + Scripts.'' However, the biggest obstacle for a successful use of this maxim originates from the choice of the scripting mechanisms being used to define applications as compositions of reusable software components. In this paper, we analyze GLoo, a novel component-oriented programming framework, which derives its expressive power from an extensible and open-ended scripting language. The design of GLoo aims at a higher-level, scalable, and problem-oriented software development approach, which enables simultaneously both small-scale and large-scale software development through the definition of specially-designed domain sublanguages.
Characterization of flexible RF microcoils dedicated to local MRI
Authors: M. Woytasik, J.-C. Ginefri, J.-S. Raynaud, M. Poirier-Quinot, E. Dufour-Gergam, J.-P. Grandchamp, O. Girard, P. Robert, J.-P. Gilles, E. Martincic, L. Darrasse
Venue: Microsystem Technologies (2007)

In magnetic resonance imaging (MRI), the electrical performance of the RF coil is critical to achieve sufficient signal to noise ratio (SNR), especially when microscopic structures [about (100&#x00a0;&#x03bc;m)3] have to be observed. In this field of application, we have developed a device (microcoil) based on the original concept of monolithic resonator, dedicated to superficial region imaging (human skin) or small animal imaging. This paper presents the developed process based on micromoulding. Flexible thin films of polymer have been used as dielectric substrate so that the microcoil could be form-fitted to non-plane surfaces. First, electrical characterizations of the RF coils have been performed. The results were compared to the expected values. A flexible RF coil of 15&#x00a0;mm diameter was then used to perform proton MRI of a saline phantom. When the coil was form-fitted to the phantom surface, a maximum SNR gain of 2 was achieved with respect to identical but plane RF coil. Finally, the flexible coil was used to perform MRI in vivo with high spatial resolution on a mouse using a small animal dedicated scanner operating at 2.35&#x00a0;T.