ppxscal/embedding_network huggingface dataset:
Software radio implementation of multi-frequency global navigation satellite system receiver
Authors: Jay A. Farrell
Venue:  (2006)

With the modernization of the Global Positioning System (GPS), new L2 and L5 civilian signals will be available in the next decade. Combined with the present L1 signal, there will then be 3-frequency civilian GPS signals available. Europe's Galileo system is scheduled to provide alternative GNSS signals in the future. Exploiting all these GNSS signals for the design of future GNSS receivers is an interesting and promising research topic. A software radio approach for the multi-frequency GNSS receiver is proposed here. The new approach will have the capability to acquire and process multi-frequency signals from either GPS or Galileo with the same RF front end.In addition to the multi-frequency software radio design, this research makes the following contributions: (1) A prototype IF signal sampling system was developed and related signal processing software was designed and tested. All signal processing functional units were modularized using C++ classes to provide high flexibility for future signals. The result will provide references for both hardware and software design of future multi-frequency GNSS receivers. New high-performance acquisition and tracking loop algorithms can be easily developed and tested on this platform. (2) Motivated by the desire to work in weak-signal or high-noise environments, a new method which can increase the SNR of the GPS signal has been derived based on the accumulation of synchronized and phase-corrected signal blocks. (3) Based on the above accumulation approach, a fast and computationally efficient FFT-based signal search and acquisition approach has been developed. This new method has a computational load that is about 110 that of the traditional FFT-based search method. In addition, the new search and acquisition method can decrease the false alarm rate because it processes the phase-corrected and accumulated signal which has a higher SNR.
Adaptive Space-Time Finite Element Methods for Parabolic Optimization Problems
Authors: Dominik Meidner, Boris Vexler
Venue: SIAM Journal on Control and Optimization (2007)

In this paper we derive a posteriori error estimates for space-time finite element discretizations of parabolic optimization problems. The provided error estimates assess the discretization error with respect to a given quantity of interest and separate the influences of different parts of the discretization (time, space, and control discretization). This allows us to set up an efficient adaptive algorithm which successively improves the accuracy of the computed solution by construction of locally refined meshes for time and space discretizations.
Security in Mobile IPv6: A survey
Authors: Khaled Elgoarany, Mohamed Eltoweissy
Venue: Information Security Tech. Report (2007)

Secure mobile communication is essential for the pervasive accessibility of critical information infrastructure. Connecting control systems with the business enterprise, wireless telemetry and mobile user interaction with critical infrastructure systems are examples of services that motivate the need for secure mobile communication. Mobile IPv6 is being touted to provide communication support for such services. The security of Mobile IPv6 poses key challenges impeding its wide-scale adoption. Several security mechanisms have been proposed in the literature. This paper surveys security vulnerabilities of Mobile IPv6, provides a taxonomy for the main existing and proposed solutions, and then extends to outline some open issues.
A hybrid machine learning approach to network anomaly detection
Authors: Taeshik Shon, Jongsub Moon
Venue: Information Sciences: an International Journal (2007)

Zero-day cyber attacks such as worms and spy-ware are becoming increasingly widespread and dangerous. The existing signature-based intrusion detection mechanisms are often not sufficient in detecting these types of attacks. As a result, anomaly intrusion detection methods have been developed to cope with such attacks. Among the variety of anomaly detection approaches, the Support Vector Machine (SVM) is known to be one of the best machine learning algorithms to classify abnormal behaviors. The soft-margin SVM is one of the well-known basic SVM methods using supervised learning. However, it is not appropriate to use the soft-margin SVM method for detecting novel attacks in Internet traffic since it requires pre-acquired learning information for supervised learning procedure. Such pre-acquired learning information is divided into normal and attack traffic with labels separately. Furthermore, we apply the one-class SVM approach using unsupervised learning for detecting anomalies. This means one-class SVM does not require the labeled information. However, there is downside to using one-class SVM: it is difficult to use the one-class SVM in the real world, due to its high false positive rate. In this paper, we propose a new SVM approach, named Enhanced SVM, which combines these two methods in order to provide unsupervised learning and low false alarm capability, similar to that of a supervised SVM approach. We use the following additional techniques to improve the performance of the proposed approach (referred to as Anomaly Detector using Enhanced SVM): First, we create a profile of normal packets using Self-Organized Feature Map (SOFM), for SVM learning without pre-existing knowledge. Second, we use a packet filtering scheme based on Passive TCP/IP Fingerprinting (PTF), in order to reject incomplete network traffic that either violates the TCP/IP standard or generation policy inside of well-known platforms. Third, a feature selection technique using a Genetic Algorithm (GA) is used for extracting optimized information from raw internet packets. Fourth, we use the flow of packets based on temporal relationships during data preprocessing, for considering the temporal relationships among the inputs used in SVM learning. Lastly, we demonstrate the effectiveness of the Enhanced SVM approach using the above-mentioned techniques, such as SOFM, PTF, and GA on MIT Lincoln Lab datasets, and a live dataset captured from a real network. The experimental results are verified by m-fold cross validation, and the proposed approach is compared with real world Network Intrusion Detection Systems (NIDS).
Using "beautiful homework solutions" to foster classroom interdependence
Authors: E. A. Eschenbach
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper describes the use of "beautiful homework" (BHW) solutions in the class ENGR 323: Probabilistic Analysis of Environmental Systems. Each week a different group of students is responsible to publish on the web an extensive set of solutions to the weekly homework assignment. These solutions must demonstrate multiple approaches and include explanations using words, mathematics and graphs. Instructors that are interested in increasing student interdependence or improving students' technical communication and computing skills in any course that requires homework may find this paper useful. In an informal survey, students identified the following courses that might use beautiful homework: statics, dynamics, thermodynamics, fluid mechanics, mathematics, chemistry and mechanics and science of materials.
Blind source separation of convolved sources by joint approximate diagonalization of cross-spectral density matrices
Authors: K. Rahbar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We present a new method for separating non-stationary sources from their convolutive mixtures based on approximate joint diagonalization of the observed signals' cross-spectral density matrices. Several blind source separation (BSS) algorithms have been proposed which use approximate joint diagonalization of a set of scalar matrices to estimate the instantaneous mixing matrix. We extend the concept of approximate joint diagonalization to estimate MIMO FIR channels. Based on this estimate we then design a separating network which will recover the original sources up to only a permutation and scaling ambiguity for minimum phase channels. We eliminate the commonly experienced problem of arbitrary scaling and permutation at each frequency bin, by optimizing the cost function directly with respect to the time-domain channel variables. We demonstrate the performance of the algorithm by computer simulations using real speech data.
Design of signal expansions for sparse representation
Authors: S. O. Aase
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Traditional signal decompositions generate signal expansions using the analysis-synthesis setting: the expansion coefficients are found by taking the inner product of the signal with the corresponding analysis vector. In this paper we try to free ourselves from the analysis-synthesis paradigm by concentrating on the synthesis or reconstruction part of the signal expansion. Ignoring the analysis issue completely, we construct sets of synthesis vectors, denoted waveform dictionaries, for sparse signal representation. The objective is to approximate a training signal using a small number of dictionary vectors. Our algorithm optimize the dictionary vectors with respect to the average non-linear approximation error. Using signals from a Gaussian, autoregressive process with correlation factor 0.95, it is demonstrated that for established signal expansions like the Karhunen-Loeve transform, the lapped orthogonal transform, and the biorthogonal 7/9 wavelet, it is possible to improve the approximation capabilities by up to 30% by optimizing the expansion vectors.
Design of a Digital Baseband Processor for UWB Transceiver on RFID Tag
Authors: Yuechao Niu, Majid Baghaei Nejad, Hannu Tenhunen, Li-Rong Zheng
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper we present a novel digital baseband processor designed for UWB transceiver on RFID tag. It is a low power and low voltage (1.8V) full digital ASIC which is implemented in 0.18 ì m CMOS technology. The processor receives serial signals (consist of data and commands) from the RF Receiver, and based on received command carries out various functions such as receive data and write to the memory, compare data, send data, set/reset tag, kill tag and etc. The processor mainly consists of eight sub modules: Receive Buffer, Transmit Buffer, Random Number Generator (RNG), Slot Counter, Memory Controller, Reset Counter, Comparator, Controller.
Quantitatively assessing an outcome on designing and conducting experiments and analyzing data for ABET 2000
Authors: P. T. McCreanor
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The Mercer University School of Engineering (MUSE), USA, identified eight outcomes to assess for the accreditation process. MUSE Outcome #4 stipulates that students should be able to design and conduct experiments and analyze data. The committee charged with assessment of Outcome #4 identified four separate skills associated with this outcome; conducting experiments, analyzing experimental data, interpreting experimental data and designing experiments. The committee determined that assessment of this outcome required documentation of the number of student experiences with each of the four skills and the overall student performance level on each of these skills. A skill assessment worksheet was developed for use in the grading of any activity related to Outcome #4. The worksheet quickly identifies which of the four skills the activity incorporates as well as the performance of the students on each of the individual skills. This worksheet was distributed to instructors teaching courses that contain a significant content related to this outcome. Data collected from courses in Industrial Engineering, Biomedical Engineering, and Electrical Engineering taught during the Fall of Semester of 2000 suggests that MUSE has been successful at meeting Outcome #4. The data also indicates that the skill assessment worksheet was an efficient and accurate method for collecting quantitative data and identifying weakness in the assessment process. Modifications made to the worksheet by professors to accommodate their personal grading scheme demonstrates that the tool has enough flexibility to be used across multiple disciplines and grading styles while still providing the data required,for assessment of Outcome #4. This paper presents the skill assessment worksheet, data collected using the worksheet, and instructor comments on use of the worksheet. 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
Counting lattice vectors
Authors: Denis Xavier Charles
Venue: Journal of Computer and System Sciences (2007)

We consider the problem of counting the number of lattice vectors of a given length. We show that problem is @?P-complete resolving an open problem. Furthermore, we show that the problem is at least as hard as integer factorization even for lattices of bounded rank or lattices generated by vectors of bounded norm. Next, we discuss a deterministic algorithm for counting the number of lattice vectors of length d in time 2^O^(^r^s^+^l^o^g^d^), where r is the rank of the lattice, s is the number of bits that encode the basis of the lattice. The algorithm is based on the theory of modular forms.
PSP-EAT-enhancing a personal software process course
Authors: D. Rosca
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The main objective of teaching the personal software process (PSP) is to develop in students a professional attitude towards producing software. PSP improves performance in size and effort estimation accuracy, software reusability, product quality while maintaining or increasing overall productivity. This work presents the experience of the first author in teaching PSP at graduate level for three years, and a tool, PSP-EAT, the authors have built to reduce both student and instructor clerical work in learning and teaching PSP. The tool helps also in increasing the students' data collection accuracy and their receptability to the PSP principles.
Inverse monoids: Decidability and complexity of algebraic questions
Authors: Markus Lohrey, Nicole Ondrusch
Venue: Information and Computation (2007)

This paper investigates the word problem for inverse monoids generated by a set @C subject to relations of the form e=f, where e and f are both idempotents in the free inverse monoid generated by @C. It is shown that for every fixed monoid of this form the word problem can be solved both in linear time on a RAM as well as in deterministic logarithmic space, which solves an open problem of Margolis and Meakin. For the uniform word problem, where the presentation is part of the input, EXPTIME-completeness is shown. For the Cayley-graphs of these monoids, it is shown that the first-order theory with regular path predicates is decidable. Regular path predicates allow to state that there is a path from a node x to a node y that is labeled with a word from some regular language. As a corollary, the decidability of the generalized word problem is deduced.
Monitoring, accounting and automated decision support for the alice experiment based on the MonALISA framework
Authors: Catalin C. Cirstoiu, Costin C. Grigoras, Latchezar L. Betev, Alexandru A. Costan, Iosif Charles Legrand
Venue: Proceedings of the 2007 workshop on Grid monitoring (2007)

The successful administration of a global Data Grid system requires collecting and storing relevant monitoring information, using it to show the status and the trends of the entire system. The collected information is further used in developing the higher-level services and components of the distributed system to provide a degree of automated operational decisions, in order to maintain and optimize the work-flow through the entire system. In this paper we present the architecture of the monitoring system, developed within the MonALISA framework, for the ALICE Grid. The system uses flexible mechanisms for collecting, aggregating, storing and presenting monitoring information both in near real-time or history charts, in global or specific views, being able to generate alerts or take automated decisions based on it.
Model Checking-based Verification of Web Application
Authors: Huaikou Miao, Hongwei Zeng
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

This paper focuses on automated verification to check whether the behavior of a Web application conforms to its design. The Object Relation Diagram as design model and the Kripke structure as implementation model are employed to describe the object structure and the external observable behavior of a Web application respectively. We propose an approach to automatically generating from the design model a collection of temporal logic properties with respect to the specified consistency criteria. Then model checking can be performed on the implementation model to verify these generated properties. A simple Web application example is used to illustrate our approach through this paper. Our prototype can automatically analyze design models to build the properties in CTL and delegates the task of property verification to the existing model checker SMV where the implementation model is typed in manually.
Predictable real-time software synthesis
Authors: Jinfeng Huang, Jeroen Voeten, Henk Corporaal
Venue: Real-Time Systems (2007)

Formal theories for real-time systems (such as timed process algebra, timed automata and timed petri nets) have gained great success in the modeling of concurrent timing behavior and in the analysis of real-time properties. However, due to the ineliminable timing differences between a model and its realization, synthesizing a software realization from a model in a predictable way is still a challenging research topic. In this article, we tackle this problem by solving a set of sub-problems. The solution is based on the theoretical results for property prediction proposed in Huang et al. (2003, Real-time property preservation in approximations of timed systems. In: Proceedings of 1st ACM and IEEE international conference on formal methods and models for codesign. IEEE Computer Society, Los Alamitos, pp 163---171) and Huang (2005, Predictability in real-time system design. PhD thesis, Eindhoven University of Technology, The Netherlands), where quantitative property relations are established between two absolute/relative "close" real-time systems. This theory basically implies that if two systems are "close", they enjoy "similar" properties. These results cannot be directly applied in practice though, because a model and its realization typically have infinitely large absolute and relative timing differences. We show that this infinite time gap can be bridged through a sequence of carefully constructed intermediate time domains. Then the property-prediction results can be applied to any pair of adjacent time domains in the sequence. Consequently, real-time properties of the implementation can be predicted from the model. We propose two parameterized hypotheses to characterize the timing differences in the sequence and to guide a correctness-preserving design process. It is shown that these hypotheses can be incorporated in a concrete tool set. We demonstrate the feasibility of the predictable synthesis approach through the design of a railroad crossing system.
MTEX: a bridge for migrating CAD design environment from UNIX to NT
Authors: Ty Tang, Vipul Lal, Shesha Krishnapura
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

This paper shares an innovative technology that we developed while migrating Intel CAD design environment from UNIX to Microsoft Windows NT operating system. The UNIX to Windows NT migration is a complex and challenging task because the chip design environment involves CAD applications, CAD infrastructure scripts, design flows made up of UNIX-centric scripts and design data. Due to the wide differences between UNIX and NT scripting architectures, straight porting to native NT scripting environment is not feasible without a complete redesign and redevelopment of the CAD infrastructure and design flow scripts. Our approach to this problem was to develop a transition production-capable mixed NT-UNIX CAD environment technology, MTEX, with the eventual goal of complete migration to a Windows NT CAD environment. This technology solves the script migration problem and supports a seamless mix of UNIX and NT centric CAD tools. In this paper we will present MTEX functionality, its internal design and architecture.
An eigenstructure technique for soft synchronization of DSSS signals
Authors: N. R. Mangalvedhe
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Soft synchronization of direct sequence spread spectrum (DSSS) signals introduces the capability of despreading the signals with improving estimates of the spreading code. The technique presented here exploits the eigenstructure of a frequency-channelized DSSS signal to estimate the code. The estimate improves steadily with time, resulting in an improving estimate of the message signal. This allows commencement of despreading at an early stage when the code-estimate is still imperfect. This paper presents the development of the algorithm for a single user environment under infinite time-average assumptions. The performance of the technique under finite time-average conditions is demonstrated through computer simulations for single user as well as multi-user environments.
Developing assessment tools for ABET EC2000
Authors: D. J. Ahlgen
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Trinity College has offered engineering instruction for over one hundred years. In preparation for a fall 1999 ABET EC2000 general review, the Trinity College Department of Engineering developed a comprehensive, sustainable set of assessment tools to measure achievement of our stated objectives and outcomes. Applied during the 1998/99 academic year, these tools yielded data that drove 'feedback loops" and enabled program improvements. The evaluation process led to the improvement of the assessment tools themselves. These survey instruments include the Student Course Evaluation (SCE), the Faculty Course Evaluation (FCE), the Alumni Survey (ALUM), the Senior Exit Survey (SES), which is administered in conjunction with exit interviews carried out by the department chair, and the Student "Where Did You Learn" Survey (SWL). The paper cites examples of program improvements that were implemented as a result of EC2000 survey data.