ppxscal/embedding_network huggingface dataset:
Design and Analysis of a Self-Repairing SRAM with On-Chip Monitor and Compensation Circuitry
Authors: Niladri Narayan Mojumder, Saibal Mukhopadhyay, Jae-Joon Kim, Ching-Te Chuang, Kaushik Roy
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

In an SRAM array, the systematic inter-die and the random within-die variations in process parameters cause significant number of parametric failures, to degrade process yield in the nanometer technology regime. In this paper, we investigate the interaction between the inter-die and intra-die Vt variations on SRAM read and write failures. To improve robustness of SRAM cell, we propose a closed-loop compensation scheme using on-chip monitors that directly sense the global read stability and writability of the cell directly. Computer simulations based on 45nm PD/SOI technology demonstrate the viability and effectiveness of the scheme in SRAM yield enhancement.
A hybrid software architecture for a web based multimedia distance education system with URL synchronization function
Authors: Eung-Nam Ko
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

The system for a web based multimedia distance education includes several features such as audio, video, whiteboard, etc, running on internet environment which is able to share HTML format. This paper describes a hybrid software architecture that is running on a web based distance education system which has an object with a various information for each session and it also supports multicasting with this information. It manages several classes of lecture course with GSM(Global Session Manager) and LSM(Local Session Manager). LSM is a lecture class in cyberspace. GSM has the function of controlling whole session when a number of sessions are open simultaneously, and LSM manages only own session. There are two approaches to software architecture on which distributed, collaborative applications are based. Those include CACV(Centralized-Abstraction and Centralized-View) and RARV(Replicated-Abstraction and Replicated-View). We propose a hybrid software architecture which is adopting the advantage of CACV and RARV.
Incorrect focus cues in stereo displays: effects on visual performance and viewer fatigue
Authors: Martin S. Banks
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

Stereoscopic displays have become important for many applications including vision research, operation of remote devices, medical imaging, surgical training, scientific visualization, virtual prototyping, and more. In many of these applications, it is important for the graphic image to create a faithful impression of the 3d structure of the portrayed object or scene. Unfortunately, 3d displays often yield distortions in perceived 3d structure compared with the percepts of the real scenes the displays depict. A likely cause of such distortions is the fact that computer displays present images on one surface. Thus, focus cues---accommodation and blur in the retinal image---specify the depth of the display rather than the depths in the depicted scene. Additionally, such displays require the viewer to override the normal coupling of vergence and accommodation. I will discuss the development of displays that present focus cues that are correct or nearly correct for the depicted scene. Such displays can create retinal images that are a reasonable approximation to the images formed in natural viewing of depth-varying scenes. Research with these displays has shown that presenting correct or nearly correct focus cues allows a much larger percentage of viewers to fuse binocular images, reduces the time required to identify a stereoscopic stimulus, reduces distortions in perceived depth, and decreases viewer fatigue and discomfort. I will discuss the implications of this work for basic vision research and applications of stereoscopic presentation.
Conditional fault Hamiltonicity of the complete graph
Authors: Jung-Sheng Fu
Venue: Information Processing Letters (2008)

Let K"n denote a complete graph of n nodes. In this paper, assuming that each vertex is incident with at least two fault-free links, we show that K"n can tolerate up to 2n-8 edge faults, while retaining a fault-free Hamiltonian cycle, where n>=4 and n@?{7,9}. When n@?{7,9},K"n contains a fault-free Hamiltonian cycle if there are up to 2n-9 edge faults. The result is optimal with respect to the number of edge faults tolerated.
Fast unimodular reduction: planar integer lattices
Authors: C. K. Yap
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The author shows that a shortest basis for the 2-dimensional lattice Lambda (u, v) generated by an input pair u, v in Z/sup 2/ can be computed in O(M(n) log n) where n is the bit-size of the input numbers and M(n) is the complexity of multiplying two n-bit integers. This generalizes Schonhage's technique (1971) for fast integer GCD to a higher dimension.
Adopting IMS in WiFi technology
Authors: Mehdi Mani, Noel Crespi
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

IP Multimedia Subsystem which is standardized by 3GPP is an important step to improve the delivery of innovating IP-Telephony and Multimedia services to the customers in 3G and B3G networks. However, IMS is almost access independent and multiple access technologies such as UMTS, WiFi, WiMax, xDSL and Cable Technology can benefit from IMS services. In 3GPP Releases 6, an architecture for access to 3G services (including IMS services) from WLAN technologies has been standardised and the work is being completed in next releases. The goal of this architecture is to allow the 3G customers to be roamed in WLAN and access to their services in 3G domain. To this end, 3GPP has chosen a Master/Slave approach which does not bring forth IMS services directly for WLAN customers and limit the applicability to some limited scenarios such as when the WLAN and 3G domain are under control of a same operator. In this paper we propose different scenarios for adopting/adapting IMS in/for WiFi as the dominant WLAN technologies. These scenarios allow the independent WiFi operators to provide advance IP Telephony services based on IMS by themselves in addition to the broadband Internet access. These scenarios are proposed with considering the capability of various WiFi operators.
Efficient Topology Discovery for Multihop Wireless Sensor Networks
Authors: Alireza A. Nezhad, Ali Miri, Dimitris Makrakis
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

The overhead of periodic routing updates in proactive routing protocols has been always the main impediment in the way of using this kind of protocols in wireless ad hoc networks specially sensor networks. In this paper, we introduce a new topology discovery protocol based on the link state approach that uses node clustering and exploits bi-directional links in order to reduce this overhead. In this protocol, only clusterheads generate routing update packets as opposed to ordinary link state protocols where all nodes do so. In addition, clusterheads remove the redundancy associated with the double inclusion of bidirectional links in these messages. Simulations show over 50% reduction in the control overhead of topology discovery compared to a regular link state routing protocol.
Quantitative information flow as network flow capacity
Authors: Stephen McCamant, Michael D. Ernst
Venue: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation (2008)

We present a new technique for determining how much information about a program's secret inputs is revealed by its public outputs. In contrast to previous techniques based on reachability from secret inputs (tainting), it achieves a more precise quantitative result by computing a maximum flow of information between the inputs and outputs. The technique uses static control-flow regions to soundly account for implicit flows via branches and pointer operations, but operates dynamically by observing one or more program executions and giving numeric flow bounds specific to them (e.g., "17 bits"). The maximum flow in a network also gives a minimum cut (a set of edges that separate the secret input from the output), which can be used to efficiently check that the same policy is satisfied on future executions. We performed case studies on 5 real C, C++, and Objective C programs, 3 of which had more than 250K lines of code. The tool checked multiple security policies, including one that was violated by a previously unknown bug.
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part I: Binary Images
Authors: Nidhal Bouaynaya, Mohammed Charif-Chefchaouni, Dan Schonfeld
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

We develop a general theory of spatially-variant (SV) mathematical morphology for binary images in the Euclidean space. The basic SV morphological operators (i.e., SV erosion, SV dilation, SV opening and SV closing) are defined. We demonstrate the ubiquity of SV morphological operators by providing a SV kernel representation of increasing operators. The latter representation is a generalization of Matheron's representation theorem of increasing and translation-invariant operators. The SV kernel representation is redundant, in the sense that a smaller subset of the SV kernel is sufficient for the representation of increasing operators. We provide sufficient conditions for the existence of the minimal basis representation in terms of upper-semi-continuity in the hit-or-miss topology. The latter minimal basis representation is a generalization of Maragos' minimal basis representation for increasing and translation-invariant operators. Moreover, we investigate the upper-semi-continuity property of the basic SV morphological operators. Several examples are used to demonstrate that the theory of spatially-variant mathematical morphology provides a general framework for the unification of various morphological schemes based on spatiallyvariant geometrical structuring elements (e.g., circular, affine and motion morphology). Simulation results illustrate the theory of the proposed spatially-variant morphological framework and show its potential power in various image processing applications.
The BBC and its web 2.0 partners
Authors: Ben Sutherland
Venue: Computers in Entertainment (CIE) (2008)

The British Broadcasting Corporation's websites, in English and in the 33 languages broadcast on the BBC World Service, are among the most powerful online providers of content -- in particular news and current affairs information -- on the internet. But as the level of individual users' internet usage and sophistication grows, BBC.co.uk is looking to advance its methods of getting this content to people beyond the provision of one simple one-size-fits-all website. Tools such as RSS feeds and desktop news alerts began the process, which, driven by a Creative Futures programme and a set of 15 "web principles", has now expanded to include the establishment of presences in, and utilisation of, Second Life, YouTube and MySpace. Meanwhile new deals allowing for content to be distributed more widely are being announced virtually on a monthly basis. But what are the implications of such moves? Should a publicly-funded broadcaster be involved to such an extent with private interests? Is this extension of BBC News into these areas likely to attract further complaints from private media broadcasters who argue they are marginalised by the BBC"s subsidised clout? And will it leave those with limited or no ability or interest in the new interactive world underserved - or neglected altogether?
Data types à la carte
Authors: Wouter Swierstra
Venue: Journal of Functional Programming (2008)

This paper describes a technique for assembling both data types and functions from isolated individual components. We also explore how the same technology can be used to combine free monads and, as a result, structure Haskell's monolithic IO monad.
XFA: Faster Signature Matching with Extended Automata
Authors: Randy Smith, Cristian Estan, Somesh Jha
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additional information. For example, extended finite-state automata (EFSA) augment finite-state automata (FSA) with variables to track dependencies between arguments of system calls. In this paper, we introduce extended finite automata (XFAs) which augment FSAs with finite scratch memory and instructions to manipulate this memory. Our primary motivation for introducing XFAs is signature matching inNetwork Intrusion Detection Systems (NIDS). Representing NIDS signatures as deterministic finite-state automata (DFAs) results in very fast signature matching but for several classes of signatures DFAs can blowup in space. Using nondeterministic finite-state automata (NFA) to represent NIDS signatures results in a succinct representation but at the expense of higher time complexity for signature matching. In other words, DFAs are time-efficient but space-inefficient, and NFAs are space-efficient but time-inefficient. In our experiments we have noticed that for a large class of NIDS signatures XFAs have time complexity similar to DFAs and space complexity similar to NFAs. For our test set, XFAs use 10 timesless memory than a DFA-based solution, yet achieve 20 times higher matching speeds.
Enriching topic-based publish-subscribe systems with related content
Authors: Rubi Boim, Tova Milo
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

This demonstration presents RMFinder (Related Messages Finder), a system that retains the simplicity and efficiency of topic-based P2P pub-sub, while providing a richer service where users can automatically receive all messages related to those in the topics to which they are subscribed. RMFinder is based on a novel, dynamic, distributed clustering algorithm, that takes advantage of similarities between topic messages to group topics together, into topic-clusters. The clusters adjust automatically to shifts in the focus of the messages published by the topics, as well as to changes in the users interest, and allow for an effective delivery of related messages with minimal overhead.
Fault current limiting and voltage sag mitigation by means of a resonant type FCL
Authors: M. S. Mohebbi Nazar, M. Abapour
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

In this paper a resonant type of fault current limiter and its application are presented. During normal operation of circuit, the thyristors is off and the resonant branches are short circuit. Therefore there is not any voltage drop on FCL. In this way, in normal system operation case, the FCL will not have almost any effect on load operation. After a short time of fault occurring, the control circuit will trigger the thyristors T1 and T2 in positive and negative alternance respectively. Therefore the resistance of FCL conducts fault current and limits it. So, in this case FCL have equivalent impedance that it can limit the fault current. The magnitude of equivalent impedance and also the magnitude of fault current depend on the resistance magnitude. By using the Electro-Magnetic Transients in DC systems which are the simulator of electric networks (EMTDC) software we carried out analysis of the voltage and current waveforms for fault conditions. Waveforms are considered in calculating the voltage drop at substation during the fault. The analysis used in selecting an appropriate inductance value for designing.
Analysing collaborative practices in design to support project managers
Authors: G. Pol, C. Merlo, J. Legardeur, G. Jared
Venue: International Journal of Computer Integrated Manufacturing (2007)

The subject of the current paper is the collaborative practices used in the product development process in SMEs (small and medium enterprises). The starting point is an empirical study, part of industry-based fieldwork on the introduction of a product lifecycle management (PLM) system. Our results highlight the need for new approaches to take into account the socio-technical complexity of the collaborative processes. A new tool named CoCa is proposed to analyse collaborative practices in situ. This tool is designed to be used by researchers, consultants or, eventually, project managers in order to track all the collaborative events and the project context. The background and industrial case study, the theoretical basis and design of the tool are described and, finally, some indication is given of its potential use in gaining understanding of complex collaborative processes and in improving design coordination.
The Design of an Ubiquitous Learning System with Research Problem-Based Learning (RPBL) Model for Qualitative Studies
Authors: Ju-Ling Shih
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

This paper describes the design and development of an ubiquitous learning system for students who are initiating educational qualitative studies. The learning system aims to enhance the mobility of field research that it allows students to access teaching and learning assets when they are in the field, and traces learners’ research progress on the web. Therefore, the paper proposes a research problem-based learning (RPBL) model as the system structure in order to lead students through a systematic pedagogical process, but at the same time makes adaptive learning possibilities available through the customizable task list. The preliminary formative evaluation suggests minor modification of the system and provides positive feedbacks to its instructional use and development.
Fault localization using value replacement
Authors: Dennis Jeffrey, Neelam Gupta, Rajiv Gupta
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We present a value profile based approach for ranking program statements according to their likelihood of being faulty. The key idea is to see which program statements exercised during a failing run use values that can be altered so that the execution instead produces correct output. Our approach is effective in locating statements that are either faulty or directly linked to a faulty statement. We present experimental results showing the effectiveness and efficiency of our approach. Our approach outperforms Tarantula which, to our knowledge, is the most effective prior approach for statement ranking based fault localization using the benchmark programs we studied.
Stochastic physical synthesis considering prerouting interconnect uncertainty and process variation for FPGAs
Authors: Yan Lin, Lei He, Mike Hutton
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Process variation and prerouting interconnect delay uncertainty affect timing and power for modern VLSI designs in nanometer technologies. This paper presents the first in-depth study on stochastic physical synthesis algorithms leveraging statistical static timing analysis (SSTA) with process variation and prerouting interconnect delay uncertainty for field-programmable gate arrays (FPGAs). Evaluated by SSTA using the placed and routed circuits, the stochastic clustering, placement, and routing reduce the mean delay by 5.0%, 4.0%, and 1.4%, respectively, and reduce the standard deviation of delay by 6.4%, 6.1%, and 1.4%, respectively for MCNC designs. The majority of improvements come from modeling interconnect delay uncertainty for clustering and from considering process variation for placement, while routing has less improvement on delay. In addition, we study the interaction between each individual design stage. When applying all stochastic algorithms concurrently, the mean delay and standard deviation are reduced by 6.2% and 7.5%, respectively. On the other hand, stochastic clustering with deterministic placement and routing is a good flow with little change to the entire flow, but the mean delay is reduced by 5.0%, the standard deviation is reduced by 6.4%, and the runtime is slightly reduced compared to the deterministic flow. Finally, while its improvement over timing is small, stochastic routing is able to reduce the total wire length by 4.5% and to reduce the overall runtime by 4.2% compared to deterministic routing.
A model for CIO-led innovation
Authors: D. L. Newbold, M. C. Azua
Venue: IBM Systems Journal (2007)

The CIO (chief information officer) organization at IBM has adopted the idea of a participatory Web and is engaged in leveraging employee talent to address the persistent information technology challenges facing global enterprises. A series of unique open conversations among employees resulted in a new approach to collaborative innovation. This new model of innovation has become an important component of the IBM product and service strategy, as it has generated new solutions that have met quick market success. In this paper we describe this model of innovation and illustrate our experience in four case studies.
Synthesis of sinusoidal oscillators with explicit-current-output using current feedback op-amps
Authors: S. S. Gupta, R. K. Sharma, D. R. Bhaskar, R. Senani
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Although there have been numerous studies on synthesizing sinusoidal oscillators using current feedback op-amps (CFOAs), most of them have dealt with circuits providing a voltage-mode signal (from a low-output-impedance node). However, the problem of realizing Oscillators with explicit current output (from a high-output-impedance node) using commercially available CFOAs has rarely been explored in the technical literature. This paper addresses itself to this task, applies a systematic state-variable method for synthesizing such oscillators and reports three new circuits of this kind whose workability has been confirmed by experimental results using AD844 type CFOAs.
UTAPS: An Underlying Topology-Aware Peer Selection Algorithm in BitTorrent
Authors: Wei Li, Shanzhi Chen, Tao Yu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

BitTorrent is one of the most well known peer-to-peer file sharing applications, accounting for a significant proportion of Internet traffic. Current BitTorrent system builds its overlay network by randomly selecting peers, a fact that has the potential to seriously handicap both individual performance and generate a significant amount of cross-ISP traffic. In this paper, we propose a novel peer selection algorithm called UTAPS which could selects peers within small hop counts and low round trip time (RTT) range by utilizing the knowledge of underlying topology. Consequently, the proximities among peers in the P2P overlay network are enhanced. Simulation results show that the UTAPS algorithm can achieve better individual performance in sense of low download time and reduce the traffics which are injected into ISP backbones.
Probabilistic packet marking for large-scale IP traceback
Authors: Michael T. Goodrich
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper presents an approach to IP traceback based on the probabilistic packet marking paradigm. Our approach, which we call randomize-and-link, uses large checksum cords to "link" message fragments in a way that is highly scalable, for the checksums serve both as associative addresses and data integrity verifiers. The main advantage of these checksum cords is that they spread the addresses of possible router messages across a spectrum that is too large for the attacker to easily create messages that collide with legitimate messages.