ppxscal/embedding_network huggingface dataset:
Integration of a QoS Aware End User Network within the TISPAN NGN Solutions
Authors: I. Vidal, J. Garcia, F. Valera, I. Soto, A. Azcorra
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

The development of specifications for Next Generation Networks has introduced a new network paradigm that has features and capabilities to ensure the provisioning of new value-added multimedia services over the broadband access technologies that are currently being deployed in the market. In this respect, the TISPAN group from ETSI is working in the specification of a Next Generation Network, mainly based on IMS as the service signalling architecture. Nevertheless, the first release of the TISPAN NGN does not consider the QoS provisioning mechanisms in the end user environment. QoS support will necessarily require to extend the QoS scope to the client premises, in order to provide a real end-to-end QoS. In this scenario, the figure of a Residential Gateway in the user network plays a crucial role. In this paper, an architecture is presented to allow the automatic configuration of the QoS parameters in a Residential Gateway directly connected to a TISPAN compliant Next Generation Network. This architecture should support the processing of the SIP signalling flows exchanged between the end user environment and the Core IMS in the NGN, deriving relevant information from the SDP payloads and accordingly configuring the QoS parameters in the user network environment.
Propagator method for an application to contour estimation
Authors: J. Marot, S. Bourennane
Venue: Pattern Recognition Letters (2007)

Hough transform and snakes methods retrieve straight lines and distorted contours but present limitations. In this paper, fast high resolution methods are adapted to multiple contour estimation. Distorted contours are retrieved with a novel optimization method.
CompulsiveFS: making NVRAM suitable for extremely reliable storage
Authors: Kevin M. Greenan, Ethan L. Miller
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Byte-addressable, non-volatile memory (NVRAM) technologies such as magnetoresistive random access memory and phase-change memory have recently emerged as viable competitors to Flash RAM. These new technologies have the ability to improve the performance, reliability and power consumption of current storage systems. NVRAM generally operates--in disk-based storage systems--as a low-latency write cache and improves data reliability during a power loss or a system crash. CompulsiveFS takes advantage of the performance benefits recognized when storing persistent metadata in NVRAM and creates a durable file system which improves the reliability of NVRAM-resident data in the face of software errors, hardware failures and system crashes.
Smart antenna receiver for GSM/DCS system based on single chip solution
Authors: U. Girola
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper presents a single chip implementation of a space-time algorithm for co-channel interference (CCI) and intersymbol interference (ISI) reduction in GSM/DCS systems. The temporal channel for the Viterbi receiver and the beamformer weights for the CCI rejection are estimated jointly by optimizing a suitable cost function for separable space-time channels. By taking into account of the current integration capabilities provided by the FPGA (field programmable gate array), the feasibility of a single chip JSTE solution based on a three-processor architecture for carrier beamforming, equalization and demodulation is demonstrated.
Lifting and recombination techniques for absolute factorization
Authors: Guillaume Chèze, Grégoire Lecerf
Venue: Journal of Complexity (2007)

In the vein of recent algorithmic advances in polynomial factorization based on lifting and recombination techniques, we present new faster algorithms for computing the absolute factorization of a bivariate polynomial. The running time of our probabilistic algorithm is less than quadratic in the dense size of the polynomial to be factored.
Evaluation of SAT-based Bounded Model Checking of ACTL Properties
Authors: Yanyan Xu, Wei Chen, Liang Xu, Wenhui Zhang
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDDbased symbolic model checking of LTL and ACTL properties in recent years. For general LTL and ACTL properties, BMC has traditionally aimed mainly at error detection, taking the advantage that error detection may only need to explore a small portion of the whole state space. Recently bounded model checking aiming at verification has also been proposed. The aim of this paper is to exploit the strength of BMC methods by combining different BMC approaches and compare it with the traditional BDD-based symbolic methods. We consider two bounded model checking methods, which are for error detection and verification of ACTL properties, respectively, and then combine them to a BMC algorithm. Based on this algorithm, we have implemented a tool named BMV (bounded model verifier), and carried out a number of experiments, and we have then compared BMV with Cadence SMV. The experimental results show that for certain types of problems, both for verification and error detection, BMV can perform much better than Cadence SMV in both time and memory consumption, and we believe that this is the first attempt to have an implementation of a method that combines practical error detection and verification of ACTL properties by SAT-based model checking.
Power-Efficient and Path-Stable Broadcasting Scheme for Wireless Ad Hoc Networks
Authors: Yeim-Kuan Chang, Yi-Wei Ting, Shang-Chun Wu
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

The simplest broadcasting scheme in the mobile ad hoc networks (MANETs) uses flooding which may result in the broadcast storm problem. The MultiPoint Relays (MPR) is another broadcasting scheme for solving the broadcast storm problem. In MPR, the mobile hosts (MHs) use a greedy algorithm to find a connected dominating set (CDS) by the exchange of 2-hop neighbor information. In order to reduce the size of CDS, the greedy algorithm used by MPR usually selects the farthest nodes from the source called the border nodes as the forwarding nodes. Since the border nodes have a higher probability of moving out the transmission range, the routing paths in MPR from the source to some destinations may be unstable. In this paper, we propose a broadcasting scheme called Dynamic Power-aware and Stability-aware MultiPoint Relays (DPS-MPR) which avoids selecting the border nodes as the forwarding nodes. As a result, the transmission range of MHs can be reduced for saving energy and the negative impact of unstable forwarding nodes can also be reduced. In addition, we use a range buffer to further enhance the stability of the forwarding nodes. We evaluate the performance of the proposed DPS-MPR by using NS2 and compared it with the existing schemes. The experimental result shows that DPS-MPR saves 20%~25% of energy and increases the lifetime of forwarding nodes by several seconds.
Adaptive Reed Solomon code allocation for wireless LAN
Authors: T. Ozeki, M. Nakagawa
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

OFDM is considered for high data rate transmission. Adaptive modulation is used to make an OFDM system more efficient. It is necessary to guarantee the constant high data rate of a video stream transmission in a wireless LAN. To guarantee the highly reliable communication, a better system performance is required. We propose an adaptive RS code allocation method. In the proposed system, accurate feedback information is required at the transmitter. Thus we propose an error detection method for feedback information error. We show that the system performance is improved, and the proposed system can detect the feedback information error.
PlanetSeer: internet path failure monitoring and characterization in wide-area services
Authors: Ming Zhang, Chi Zhang, Vivek Pai, Larry Peterson, Randy Wang
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

Detecting network path anomalies generally requires examining large volumes of traffic data to find misbehavior. We observe that wide-area services, such as peer-to-peer systems and content distribution networks, exhibit large traffic volumes, spread over large numbers of geographically-dispersed endpoints. This makes them ideal candidates for observing wide-area network behavior. Specifically, we can combine passive monitoring of wide-area traffic to detect anomalous network behavior, with active probes from multiple nodes to quantify and characterize the scope of these anomalies. This approach provides several advantages over other techniques: (1) we obtain more complete and finer-grained views of failures since the wide-area nodes already provide geographically diverse vantage points; (2) we incur limited additional measurement cost since most active probing is initiated when passive monitoring detects oddities; and (3) we detect failures at a much higher rate than other researchers have reported since the services provide large volumes of traffic to sample. This paper shows how to exploit this combination of wide-area traffic, passive monitoring, and active probing, to both understand path anomalies and to provide optimization opportunities for the host service.
A 2.4 GHz low power wireless transceiver analog front-end for endoscopy capsule system
Authors: Baoyong Chi, Jinke Yao, Shuguang Han, Xiang Xie, Guolin Li, Zhihua Wang
Venue: Analog Integrated Circuits and Signal Processing (2007)

This work presents the design and implementation of a 2.4 GHz low power wireless transceiver analog front-end for the endoscopy capsule system in 0.25 μm CMOS. The prototype integrates a low-IF receiver analog front-end (low noise amplifier, double-balanced down-converter, band-pass-filtered AGC loop, and ASK demodulator) and a direct-conversion transmitter analog front-end (20 MHz IF PLL with well-defined amplitude control circuit, ASK modulator, up-converter, and output buffer) on a single chip together with one integrated RF oscillator and two LO buffers. Trade-off has been made over the design boundaries of the different building blocks to optimize the overall system performance. All building blocks feature the circuit topologies that enable comfortable operation at low power consumption. As a result, the IC works at a 2.5 V power supply, while only consuming 15 mW in receiver (RX) mode and 14 mW in transmitter (TX) mode. To build a complete transceiver for the endoscopy capsule system, only an antenna, a duplexer, and a digital controller are needed besides the presented analog front-end chip.
Joint source-channel coding for scalable video using models of rate-distortion functions
Authors: L. P. Kondi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A joint source-channel coding scheme for scalable video is developed in this paper. An SNR scalable video coder is used and unequal error protection (UEP) is allowed for each scalable layer. Our problem is to allocate the available bit rate across scalable layers and, within each layer, between source and channel coding, while minimizing the end-to-end distortion of the received video sequence. The resulting optimization algorithm we propose utilizes universal rate-distortion characteristic plots. These plots show the contribution of each layer to the total distortion as a function of the source rate of the layer and the residual bit error rate (the error rate that remains after the use of channel coding). Models for these plots are proposed in order to reduce the computational complexity of the solution. Experimental results demonstrate the effectiveness of the proposed approach.
RVLabX, a Web-based interactive laboratory environment for education and research
Authors: H. Saliah-Hassane
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

RVLabX stands for eXtended Remote Virtual Laboratory. It is a workplace software, that permits the creation and management of a Web-based generic, interactive laboratory with a particular emphasis on the creation of XML-based adaptable user interface for each team member involved in the process. The software can be installed on any desktop and connects to distributed virtual laboratory servers. The ultimate goal is to create and configure distributed laboratories, where users can interact with one another as if all are working both in cooperation and collaboratively on a single site. Thus, students, teachers, tutors, laboratory technicians or managers at geographically distinct locations can share their expertise and equipment.
The Complexity of Polynomials and Their Coefficient Functions
Authors: Guillaume Malod
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant's theory is a good setting for this, and we start by generalizing one of Valiant's observations, showing that the class VNP is stable for coefficient functions, and that this is true of the class VP iff VP = VNP, an eventuality which would be as surprising as the equality of the classes P and NP in Boolean complexity. We extend the definition of Valiant's classes to polynomials of unbounded degree, thus defining the classes VP_nb and VNP_nb. Over rings of positive characteristic the same kind of results hold in this case, and we also prove that VP = VNP iff VP_nb = VNP_nb. Finally, we use our extension of Valiant's results to show that iterated partial derivatives can be efficiently computed iff VP = VNP. This is also true for the case of polynomials of unbounded degree, if the characteristic of the ring is positive.
Modeling Interactions of Web Software
Authors: Tevfik Bultan
Venue: Proceedings of the 2nd Int'l. Workshop on Automated Specification and Verification of Web Systems (2006)

Modeling interactions among software components is becoming increasingly important for analyzing behavior of web software. This is especially true for the area of web services where distributed interactions across organizational boundaries are the norm. In this paper, I will discuss three visual formalisms for modeling interactions: 1) Collaboration Diagrams, 2) Message Sequence Charts, and 3) Conversation Protocols. I will discuss the differences and similarities among these representations and identify two problems: realizability and synchronizability.
A realtime software MPEG transcoder using a novel motion vector reuse and a SIMD optimization techniques
Authors: Y. Senda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A realtime software MPEG transcoder has been developed. Novel motion vector reuse and SIMD optimization techniques are introduced to accelerate the transcoder without any quality degradation. Mean absolute error approximation criteria are employed in the reuse technique to refine scaled motion vectors. The developed transcoder on a Pentium II 266 MHz machine runs 2.5 times as fast as realtime, when scaling an MPEG-1 bitstream to half size.
Efficient simulation of critical synchronous dataflow graphs
Authors: Chia-Jui Hsu, Ming-Yung Ko, Shuvra S. Bhattacharyya, Suren Ramasubbu, José Luis Pino
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

System-level modeling, simulation, and synthesis using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems, and the synchronous dataflow (SDF) model of computation is widely used in EDA tools for these purposes. Behavioral representations of modern wireless communication systems typically result in critical SDF graphs: These consist of hundreds of components (or more) and involve complex intercomponent connections with highly multirate relationships (i.e., with large variations in average rates of data transfer or component execution across different subsystems). Simulating such systems using conventional SDF scheduling techniques generally leads to unacceptable simulation time and memory requirements on modern workstations and high-end PCs. In this article, we present a novel simulation-oriented scheduler (SOS) that strategically integrates several techniques for graph decomposition and SDF scheduling to provide effective, joint minimization of time and memory requirements for simulating critical SDF graphs. We have implemented SOS in the advanced design system (ADS) from Agilent Technologies. Our results from this implementation demonstrate large improvements in simulating real-world, large-scale, and highly multirate wireless communication systems (e.g., 3GPP, Bluetooth, 802.16e, CDMA 2000, XM radio, EDGE, and Digital TV).
New Lower Bounds for the Number of (&#x2264; k)-Edges and the Rectilinear Crossing Number of Kn
Authors: Oswin Aichholzer, Jesus Garcia, David Orden, Pedro Ramos
Venue: Discrete Computational Geometry (2007)

We provide a new lower bound on the number of (&#x2264; k)-edges of a set of n points in the plane in general position. We show that for $0 \leq k \leq \lfloor({n-2})/{2}\rfloor$ the number of (&#x2264; k)-edges is at least $E_k(S) \geq 3\binom{k+2}{2} + \sum_{j=\lfloor{n}/{3}\rfloor}^k(3j-n+3),$ which, for $\lfloor {n}/{3}\rfloor\leq k\leq 0.4864n$, improves the previous best lower bound in [12]. As a main consequence, we obtain a new lower bound on the rectilinear crossing number of the complete graph or, in other words, on the minimum number of convex quadrilaterals determined by n points in the plane in general position. We show that the crossing number is at least $\left(\frac{41}{108}+\varepsilon \right) \binom{n}{4} + O(n^3) \geq 0.379688 \binom{n}{4} + O(n^3),$ which improves the previous bound of $0.37533 \binom{n}{4} + O(n^3)$ in [12] and approaches the best known upper bound $0.380559 \binom{n}{4} + \Theta(n^3)$ in [4]. The proof is based on a result about the structure of sets attaining the rectilinear crossing number, for which we show that the convex hull is always a triangle. Further implications include improved results for small values of n. We extend the range of known values for the rectilinear crossing number, namely by $\mathop{\overline{\rm cr}}\nolimits(K_{19})=1318$ and $\mathop{\overline{\rm cr}}\nolimits(K_{21})=2055$. Moreover, we provide improved upper bounds on the maximum number of halving edges a point set can have.
On the geometry of regular hyperbolic fibrations
Authors: Matthew R. Brown, Gary L. Ebert, Deirdre Luyckx
Venue: European Journal of Combinatorics (2007)

Hyperbolic fibrations of PG(3,q) were introduced by Baker, Dover, Ebert and Wantz in [R.D. Baker, J.M. Dover, G.L. Ebert, K.L. Wantz, Hyperbolic fibrations of PG(3,q), European J. Combin. 20 (1999) 1-16]. Since then, many examples were found, all of which are regular and agree on a line. It is known, via algebraic methods, that a regular hyperbolic fibration of PG(3,q) that agrees on a line gives rise to a flock of a quadratic cone in PG(3,q), and conversely. In this paper this correspondence will be explained geometrically in a unified way for all q. Moreover, it is shown that all hyperbolic fibrations are regular if q is even, and (for all q) every hyperbolic fibration of PG(3,q) which agrees on a line is regular.
Secure mobile code execution service
Authors: Lap-chung Lam, Yang Yu, Tzi-cker Chiueh
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

Mobile code refers to programs that come into a host computer over the network and start to execute with or without a user's knowledge or consent. Because these programs run in the execution context of the user that downloads them, they can issue any system calls that the user is allowed to make, and thus pose a serious security threat when they are malicious. Although many solutions have been proposed to solve the malicious mobile code problem, none of them are truly effective at striking a good balance between defeating zero-day attacks and minimizing disruption to the execution of legitimate applications. This paper describes a commercial system called SEES that secures the execution of mobile code that comes into a host computer as an email attachment or as a web document downloaded through an anchor link by running them on a separate guinea pig machine rather than on the user machine. Effectively, it takes an isolation approach to the secure mobile code execution problem. As a result, SEES guarantees that no malicious email attachments or web documents that act on behalf of the user that downloads them, can damage the resources of the user machine, or can leak any confidential information. In particular, even zero-day virus cannot cause any harms. We present the design, implementation and evaluation of SEES on the Windows platform, and contrast it with other existing approaches to the same problem.
Second order blind equalization in multiple input multiple output FIR systems: a weighted least squares approach
Authors: A. Gorokhov
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Multipath propagation appears to be a typical limitation in mobile digital communications where it leads to severe intersymbol interference. The classical techniques to overcome this problem use either periodically sent training sequences or blind approaches. This paper addresses the blind identification of FIR multiple input multiple output (MIMO) transfer functions in the case where the number of inputs is strictly less than the number of outputs. We consider a second order identification providing signals extraction up to a regular instantaneous mixture matrix. A novel method of second order channel estimation is presented. Basically exploiting the simultaneous MA and AR nature of the observations, it displays however a considerable improvement as compared to the original linear prediction approach. Performance study and comparison with the existing approach is provided by computer simulations.
Using learning styles preferences data to inform classroom teaching and assessment activities
Authors: E. Allen
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

This paper describes the results to date, and our ongoing efforts, to develop, adapt, disseminate and assess teaching techniques, methods and exercises which address specific learning styles of students. Our research shows that students in the engineering college showing strong preferences for the active, sensing visual and sequential learning styles outweigh students with strong preferences for the reflective, intuitive, verbal and global learning styles by significant factors. As part of our faculty instructional development program, we have been using techniques such as cooperative and active learning as well as entrepreneurial environments in the laboratory to help move the instructional experience of students away from the traditional lecture mode and into a more student-centered mode.