ppxscal/embedding_network huggingface dataset:
Evaluating a feedback channel based transform domain Wyner-Ziv video codec
Authors: Catarina Brites, João Ascenso, José Quintas Pedro, Fernando Pereira
Venue: Image Communication (2008)

Wyner-Ziv (WZ) video coding-a particular case of distributed video coding (DVC)-is a new video coding paradigm based on two major Information Theory results: the Slepian-Wolf and Wyner-Ziv theorems. In recent years, some practical WZ video coding solutions have been proposed with promising results. One of the most popular WZ video coding architectures in the literature uses turbo codes based Slepian-Wolf coding and a feedback channel to perform rate control at the decoder. This WZ video coding architecture has been first proposed by researchers at Stanford University and has been after adopted and improved by many research groups around the world. However, while there are many papers published with changes and improvements to this architecture, the precise and detailed evaluation of its performance, targeting its deep understanding for future advances, has not been made. Available performance results are mostly partial, under unclear and incompatible conditions, using vaguely defined and also sometimes architecturally unrealistic codec solutions. This paper targets the provision of a detailed, clear, and complete performance evaluation of an advanced transform domain WZ video codec derived from the Stanford turbo coding and feedback channel based architecture. Although the WZ video codec proposed for this evaluation is among the best available, the main purpose and novelty of this paper is the solid and comprehensive performance evaluation made which will provide a strong, and very much needed, performance reference for researchers in this WZ video coding field, as well as a solid way to steer future WZ video coding research.
Using iPodLinux in an introductory OS course
Authors: Barry Lawson, Lewis Barnett
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

This paper describes a proof of concept for introducing iPods and iPodLinux into a one-semester introductory undergraduate operating systems course. iPodLinux is a version of the Linux operating system modified to run on iPods. We added a project to our course in which the students modified the iPodLinux kernel, and we supplemented lectures by discussing specifics of the Linux implementation as they relate to general operating systems concepts. We feel the course was much improved by these additions, with no substantive omission of regular material. Student response was very enthusiastic, and we feel the new material enhanced their course experience by providing a component that was empowering and helped to further improve their knowledge and skills.
Design and implementation of a logo-based computer graphics course
Authors: Pavel Boytchev
Venue: Informatics in education (2007)

Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology. The pedagogical component of the challenge is to design a multidisciplinary course suitable for students with different skills and interests. From a development perspective the challenge is to build an entirely new one. And finally the course must be attractive regardless of the seriousness and complexity of the topics included in it. The paper discusses the structure of the course including the final weeks when topics emerging from students' course projects are taught. Each lesson from the course is based on sets of sample programs representing the general lifecycle of software development. This includes designing, coding and debugging. Samples are created on-the-fly, thus different instances of the course results in different final projects. Lessons are interactive and students may interfere with the direction of demonstrated software development.
Creative practice-based research in interaction design
Authors: Stephen Barrass
Venue: Computers in Entertainment (CIE) (2008)

This article describes interactive artworks exhibited at Experimenta Prototype 2002, House of Tomorrow 2003, and at Vanishing Point 2005. These works were developed through an incremental research process that explored perceptual, aesthetic, and technical aspects of interaction design. The exhibitions provided an opportunity to observe audience response and critically reflect on the hypotheses embodied in the artifacts. The first work, titled OpShop, began as an experiment on interaction with far-distant objects in a virtual environment called the CyberStage. The second, ZiZi the Affectionate Couch, animated an inanimate object by mixing digital media with a piece of furniture. The third, called the Cocktail Party Effect, is a psychological exploration of the mental image of an object communicated in the absence of visual perceptions, and an experiment in developing the narrative language of touch and sound. We describe the history and ongoing trajectories of these works, and provide insights into interaction design gained through this creative practice-based research process.
An overview of the femtocell concept
Authors: Holger Claussen, Lester T. W. Ho, Louis G. Samuel
Venue: Bell Labs Technical Journal (2008)

The femtocell concept aims to combine fixed-line broadband access with cellular telephony using the deployment of ultra-low-cost, low-power third generation (3G) base stations in the subscribers' homes or premises. It enables operators to address new markets and introduce new high-speed services and disruptive pricing strategies to capture wireline voice minutes and to grow revenues. One of the main design challenges of the femtocell is that the hierarchical architecture and manual cell planning processes used in macrocell networks do not scale to support millions of femtocells. In this paper, a user-deployed femtocell solution based on the base station router (BSR) flat Internet Protocol (IP) cellular architecture is presented that addresses these problems, and several aspects of the proposed solution are discussed. The overall concept and key requirements are presented in detail. The auto-configuration and self-optimization process from purchase by the end user to the integration into an existing macrocellular network is described. Then the theoretical performance of a co-channel femtocell deployment is analyzed and its impact on the macrocell underlay is assessed. Finally, a financial analysis of a femtocellular home base station deployment in a macrocellular network is presented. It is shown that in urban areas, the deployment of publicly accessible home base stations with slightly increased coverage can significantly reduce the operator's annual network costs (up to 70 percent in the investigated scenario) compared to a pure macrocellular network. &copy; 2008 Alcatel-Lucent.
PEPD: a priority based packet discard scheme to provide service differentiation in internet
Authors: Hongjun Su, Mohammed Atiquzzaman
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

The Internet was initially designed for non real-time data communications, and hence does not provide any Quality of Service (QoS) guarantees. Differentiated Services (DiffServ) is being developed by IETF to provide QoS guarantees by carrying priority information in the packet headers. ATM is expected to coexist with DiffServ in the core of the next generation Internet. In this paper, we propose the Prioritized Early Packet Discard (PEPD) scheme which takes into account the priority of packets during discarding of cells in an ATM switch. We developed a Markov chain model of PEPD, and verified the accuracy of the model with simulation results. Results confirm that the proposed PEPD scheme provides QoS to end applications by providing differential treatment to packets of different priorities.
A dimensional decomposition approach to identifying efficient units in large-scale DEA models
Authors: Pekka J. Korhonen, Pyry-Antti Siitari
Venue: Computers and Operations Research (2009)

In this paper, we propose the use of a dimensional decomposition procedure together with lexicographic parametric programming to reduce computational burden when identifying the efficient decision making units in data envelopment analysis (DEA). The use of lexicographic parametric programming makes it possible to develop an efficient algorithm for the problems with few inputs and outputs. Based on this we propose the procedure which first partitions the original problem dimensionally into sub-problems and then identifies the efficient units of the sub-problems. Since those units are a subset of the weakly efficient solutions of the original problem, they are used as an initial approximation for the efficient units of the original problem. The efficiency of the approach is illustrated by numerical results.
A Thermal-Friendly Load-Balancing Technique for Multi-Core Processors
Authors: Enric Musoll
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In multi-core processors there are several ways to pair a thread to a particular core. These load-balancing techniques result in a quite different power, performance and thermal behavior of the processor, specially when low-power techniques like power gating are applied to the individual cores. In this work, a load-balancing technique that provides low overhead in performance and energy with respect to the highest performance case, yet featuring a smooth temperature distribution close to the optimal scenario is presented. An uneven temperature distribution leads to thermal hot spots which affect both the reliability of the processor (by stressing some parts of the die more than others), and the cost of the processor (since the package has to be designed to handle the worst hot spot).
Dynamic test input generation for web applications
Authors: Gary Wassermann, Dachuan Yu, Ajay Chander, Dinakar Dhurjati, Hiroshi Inamura, Zhendong Su
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Web applications routinely handle sensitive data, and many people rely on them to support various daily activities, so errors can have severe and broad-reaching consequences. Unlike most desktop applications, many web applications are written in scripting languages, such as PHP. The dynamic features commonly supported by these languages significantly inhibit static analysis and existing static analysis of these languages can fail to produce meaningful results on realworld web applications. Automated test input generation using the concolic testing framework has proven useful for finding bugs and improving test coverage on C and Java programs, which generally emphasize numeric values and pointer-based data structures. However, scripting languages, such as PHP, promote a style of programming for developing web applications that emphasizes string values, objects, and arrays. In this paper, we propose an automated input test generation algorithm that uses runtime values to analyze dynamic code, models the semantics of string operations, and handles operations whose argument and return values may not share a common type. As in the standard concolic testing framework, our algorithm gathers constraints during symbolic execution. Our algorithm resolves constraints over multiple types by considering each variable instance individually, so that it only needs to invert each operation. By recording constraints selectively, our implementation successfully finds bugs in real-world web applications which state-of-the-art static analysis tools fail to analyze.
Preventing Out-of-Sequence Packets on the Route Optimization Procedure in Proxy Mobile IPv6
Authors: Jong-Hyouk Lee, Hyung-Jin Lim, Tai-Myoung Chung
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Proxy Mobile IPv6 is one of network-based mobility support protocols which does not require a mobile host to be involved in mobility support signaling. Even though Proxy Mobile IPv6 has many advantages than client-based mobility support protocols such as Mobile IPv6, unfortunately, it may cause an out-of-sequence problem during its route optimization procedure. Thus, in this paper, we develop an estimation function for an out-of-sequence time period and reveal the out-of-sequence problem caused by the route optimization procedure. Then we propose a scheme which minimizes the arrival of out-of-sequence packets to the mobile host and analyze the impact of out-of-sequence packets. The performance evaluation results demonstrate that the traffic rate and out-of-sequence time period mainly have an effect on the out-of-sequence problem.
A Scalable Approach to Multi-style Architectural Modeling and Verification
Authors: Stephen Wong, Jing Sun, Ian Warren, Jun Sun
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Software Architecture represents the high level description of a system in terms of components, external properties and communication. Despite its importance in the software engineering process, the lack of formal description and verification support limits the value of developing architectural models. Automated formal engineering methods can provide an effective means to precisely describe and rigorously verify intended structures and behaviors of software systems. In this paper, we present an approach to support the design and verification of software architectural models using the Alloy analyzer. Based on our earlier work, we propose a fundamental library for specifying system structures in terms of different architectural styles. We illustrate use of the architecture style library in modeling and verifying a complex system that utilizes multi-style structures. To promote scalability, we use model decomposition to parallelize the verification process. Results show that our approach enhances the performance of verifying models significantly.
Enhanced leakage reduction techniques using intermediate strength power gating
Authors: Harmander Singh, Kanak Agarwal, Dennis Sylvester, Kevin J. Nowka
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The exponential increase in leakage power due to technology scaling has made power gating an attractive design choice for low-power applications. In this paper, we explore this design style in large combinational circuit blocks and latch-to-latch datapaths and introduce a novel power gating approach to yield an improved power-performance tradeoff. We first present a multiple sleep mode power gating technique where each mode represents a different point in the wake-up overhead versus leakage savings design space. We show that the high wake-up latency and wakeup power penalty of traditional power gating limits its application to large stretches of inactivity. The multiple-mode feature allows a processor to enter power saving modes more frequently, hence, resulting in enhanced leakage savings. We apply the multimode power gating technique to datapaths where the degree of applied power gating becomes progressively stronger (harder) along the datapath. This configuration allows us to further balance wakeup overhead with leakage savings by exploiting the fact that logic circuits deep in the datapath have higher wakeup margin and hence can be strongly gated. Simulations show that multiple sleep mode capability provides an extra 17% reduction in overall leakage compared to traditional single mode gating. The multiple modes can be designed to allow state-retentive modes. The results on benchmarks show that a single state-retentive mode can reduce leakage by 19% while preserving state of the circuit.
Clustering over DNA strings
Authors: Nuria Gomez Blas, Eugenio Santos, Miguel Angel Diaz
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper presents an unsupervised learning algorithm over strings that can be applied in aminoacid sequences. This way a set of aminoacids is obtained and they represent the minimal distance to the whole DNA pool. Biological laboratory protocols over this cluster could be easily studied instead over the whole pool and protocols could be used in the whole pool. This process can help to develop protocols applicable in the DNA computing paradigm. A brief review of DNA computing is also shown.
Detecting unknown coal fires: synergy of automated coal fire risk area delineation and improved thermal anomaly extraction
Authors: C. Kuenzer, J. Zhang, J. Li, S. Voigt, H. Mehl, W. Wagner
Venue: International Journal of Remote Sensing (2007)

This paper presents two complementing algorithms for remote sensing based coal fire research and the results derived thereof. Both are applicable on Landsat, ASTER and MODIS data. The first algorithm automatically delineates coal fire risk areas from multispectral satellite data. The second automatically extracts local coal fire related thermal anomalies from thermal data. The presented methods aim at the automated, unbiased retrieval of coal fire related information. The delineation of coal fire risk areas is based on land cover extraction through a knowledge based spectral test sequence. This sequence has been proven to extract coal fire risk areas not only in time series of the investigated study areas in China, but also in transfer regions of India and Australia. The algorithm for the extraction of thermal anomalies is based on a moving window approach analysing sub-window histograms. It allows the extraction of thermally anomalous pixels with regard to their surrounding background and therefore supports the extraction of very subtle, local thermal anomalies of different temperature. It thus shows clear advantages to anomaly extraction via simple thresholding techniques. Since the thermal algorithm also does extract thermal anomalies, which are not related to coal fires, the derived risk areas can help to eliminate false alarms. Overall, 50% of anomalies derived from night-time data can be rejected, while even 80% of all anomalies extracted from daytime data are likely to be false alarms. However, detection rates are very good. Over 80% of existing coal fires in our first study area were extracted correctly and all fires (100%) in study area two were extracted from Landsat data. In MODIS data extraction depends on coal fire types and reaches 80% of all fires in our study area with hot coal fires of large spatial extent, while in another region with smaller and 'colder' coal fires only the hottest ones (below 20%) can be extracted correctly. The success of the synergetic application of the two methods has been proven through our detection of so far unknown coal fires in Landsat 7 ETM+ remote sensing data. This is the first time in coal fire research that unknown coal fires were detected in satellite remote sensing data exclusively and were validated later subsequently during in situ field checks.
Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration
Authors: Taolue Chen, Jian Lu
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of process algebra. To represent the infinite behavior, we consider the prefix iteration extension of a fragment of Milner's CCS. The prefix iteration operator is a variant on the binary version of the Kleene star operator obtained by restricting the first argument to be an atomic action and allows us to capture the notion of recursion in a pure algebraic way. We investigate four typical divergent-sensitive weak bisimulation equivalences, namely divergent, stable, completed and divergent stable weak bisimulation equivalences from an axiomatic perspective. A lattice of distinguishing axioms is developed and thus pure equational axiomatizations for these congruences are obtained. A large part of the current paper is devoted to a considerable complicated proof for completeness. This work, to some extent, sheds light on distinct semantics of divergence.
Assembly time minimization of a particular placement machine
Authors: Ali Fuat Alkaya, Ekrem Duman
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

A new algorithm for a component placement machine is proposed in this study. The new algorithm is compared with former approaches on synthetically generated benchmark instances. It outperforms the former approaches by 3.28% on printed circuit board with 100 components to be placed. We prove that this new approach works better in a typical PCB mounted in the industry, so can be applicable to the considered type of machine.
Index based approach for categorizing online news articles
Authors: Taeho Jo
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This research proposes an alternative approach to machine learning based ones for categorizing online news articles. For using machine learning based approaches for any task of text mining, documents should be encoded into numerical vectors; it causes two problems: huge dimensionality and sparse distribution. Although there are various tasks of text mining such as text categorization, text clustering, and text summarization, the scope of this research is restricted to text categorization. The idea of this research is to avoid the two problems by encoding a document or documents into a table, instead of numerical vectors. Therefore, the goal of this research is to develop a scheme which is free from the two problems for categorizing on-line news article automatically.
Scheduling with queue length guarantees for shared resource systems
Authors: Gagan R. Gupta, Ness B. Shroff
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

We develop a class of schemes called GMWM that guarantee optimal throughput for queuing systems with arbitrary constraints on the set of jobs that can be served simultaneously. We obtain an analytical upper bound on the expected queue length. To further tighten the upper bound, we formulate it as a convex optimization problem. We also show that whenever the arrival process is stabilizable, the scheme is guaranteed to achieve an expected queue length that is no larger than the expected queue length of any stationary randomized policy.
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Authors: Jos de Bruijn, Stijn Heymans
Venue: Fundamenta Informaticae (2008)

Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specifically, the SemanticWeb ontology language OWL DL is based on the Description Logic SHOIN. F-Logic is an ontology language which is also based on first-order logic, but classes and properties are modeled as terms rather than predicates. Our goal is to enable interoperation between predicate-based and F-Logic-based ontology languages. To this end, we define an intuitive translation from predicate-based ontologies to F-Logic ontologies and show that this translation preserves entailment for large classes of ontology languages, including most of OWL DL. Specifically, we define the class of equality-safe (E-safe) formulas, show that the Description Logic SHIQ is E-safe, and show that the translation preserves validity of E-safe formulas. We use these results to close the open problem of layering F-Logic programming on top of Description Logic Programs and we show that our results apply to HILOG, a syntactically higher-order, but semantically first-order language. Finally, we show that our results also apply to a meta-modeling extension for Description Logics (v-semantics).