ppxscal/embedding_network huggingface dataset:
Making money in the bazaar
Authors: Bernie Thompson
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Analysis and ideas for creating innovation and making a living in the Open Source market. Companion to 1999 Linux Journal articles.
The convergence of mobile data phones, consumer electronics, and wallets: Lessons from Japan
Authors: Arnd Weber
Venue: Telematics and Informatics (2007)

Japan is leading the world with the adoption of new mobile data services such as Internet services and with a resulting boost in data ARPU (average revenue per user). In the development of these services, many functions have been integrated into mobile handsets, which has resulted in a convergence of, so far, separate consumer electronic devices. This article addresses the following questions: What are the drivers of this process? What could European players, in particular the European policymakers do to catch up? According to our research, a major driver of the process in Japan is tough competition among operators, which in turn is driven by factors such as competition in mobile radio infrastructure. The author arrives at the following conclusions for European policies: (1) There should be more awareness of the Japanese lead, e.g., of the crucial role of Internet push e-mail. (2) Europe could benefit from more operators willing to bear the risk of introducing new technologies. (3) For a successful introduction of infrastructure competition, it could make sense to make spectrum bands available with European-wide licenses.
Semantic Mining Dynamics for Games Language Processing
Authors: David Al-Dabass, Manling Ren
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper attempts to determine conditions for "recogniseability' with application to games language processing. In its broadest sense, a biological reader of a string of characters has a "trial' internal model of the semantics of the lexical sequence being read. This internal model generates its own lexical string which is compared with the observed string. Errors between the two are fed back to the internal "semantic generator' to guide it to modify its lexical output closer to the observed string. The process continues dynamically until convergence, indicated by the observer "recognising' the meaning of the seen string. The theoretical foundations for this process are put forward and the conditions for successful "observation' using hybrid recurrent nets are reviewed. Semantic mining architectures are formulated and consist of a recurrent hybrid net hierarchy of multi-agents, extended such that the composite behavior of agents at any one level is determined by those of the level immediately above.
An active/collaborative approach in teaching requirements engineering
Authors: D. Rosca
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The requirements engineering (RE) course is a component of the curriculum for the Masters in Software Engineering (MSSE) program at Monmouth University. It has been the first software engineering program in New Jersey and one of the first in the nation. The RE course introduces students to the process, methods and tools specific to this area, and the corresponding software quality issues. The course is offered in a lecture and laboratory format. To reinforce the concepts learned, students actively participate in their learning as they play different roles for eliciting requirements, collaboratively improve the quality of their standard requirement documents or share their particular expertise with their teams when performing object-oriented analysis. This paper describes the current structure of the RE course and my experience related to the active/collaborative approaches in teaching it.
Using process-oriented, sequencing educational technologies: Some important pedagogical issues
Authors: Olivera Marjanovic
Venue: Computers in Human Behavior (2007)

In recent times, sequencing technologies are becoming increasingly used, both by the university and the industry sectors. In essence, these complex systems support sequencing of, and navigation through units of content. They come in two different types: SCORM-based and workflow-based systems. Current research efforts related to sequencing technologies concentrate mostly on technical issues, while the associated pedagogical issues remain unexplored. The main objective of this paper is to describe the most important pedagogical issues that need to be taken into account when implementing any type of sequencing educational technologies (either SCORM- or workflow-based). These issues were identified during an action-learning project related to the practical implementation of a workflow-based educational system. During the reflection phase of this project, these issues were then genarised, so they could be applied to any type of sequencing technology and in any application domain (teaching discipline). The paper describes how sequencing technology can be used to enable a more flexible learning experience (especially in terms of time and flexible learning pathways) and then proceeds with the detailed analysis of the associated pedagogical issues.
Novel Approach to Clock Fault Testing for High Performance Microprocessors
Authors: C. Metra, M. Omana, TM Mak, S. Tam
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

In this paper we present a novel approach for testing clock faults for high performance microprocessors. Although such faults have been shown to be likely and could compromise delay fault testing, conventional manufacturing test methodology is unable to guarantee their detection. In this paper, we propose a modification to the conventional clock buffers allowing standard manufacturing test to detect the faults. This is achieved at the cost of a small increase in area and power consumption of the clock buffers, but with no additional test cost or impact on the microprocessor performance and in-field operation. Our approach can be applied to the clock system of any high performance chip or microprocessor.
Graphs Having Small Number of Sizes on Induced k-Subgraphs
Authors: Maria Axenovich, Jo´zsef Balogh
Venue: SIAM Journal on Discrete Mathematics (2007)

Let $\ell$ be any positive integer, let $n$ be a sufficiently large number, and let $G$ be a graph on $n$ vertices. Define, for any $k$, $\nu_k(G)= | \{ |E(H)| : H$ is an induced subgraph of $G$ on $k$ vertices$\} |$. We show that if there exists a $k$, $2\ell \leq k \leq n-2\ell$, such that $\nu_k(G) \le \ell$, then $G$ has a complete or an empty subgraph on at least $n-\ell+1$ vertices and a homogeneous set of size at least $n-2\ell+2$. These results are sharp.
Measuring Reliability of Applications Composed of Web Services
Authors: Hangjung Zo, Derek L. Nazareth, Hemant K. Jain
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Web services represent an alternative basis for the rapid development of application systems. Much of the research on composition and orchestration of web services centers around functional sufficiency and performance. Non-functional characteristics like reliability and security play an important role in the selection of web services by system architects. This paper provides a basis for measuring reliability of an application system that is assembled using web services. It outlines criteria for measuring reliability for individual tasks, specifies combining functions for differently configured tasks, and applies these techniques to a problem which contains various sizes of business processes to demonstrate the efficacy of the approach.
Parallel Model Checking and the FMICS-jETI Platform
Authors: Jiri Barnat, Lubos Brim, Martin Leucker
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the \mu- calculus which naturally subsumes the branching time logic CTL (computation tree logic). We also indicate how to provide parallel model checking applications as services for integrated modelling, analysis, and verification using the FMICS-jETI platform.
Considering Security and Quality of Service in SLS to Improve Policy-Based Management of Multimedia Services
Authors: Sandrine Duflos, Brigitte Kervella, Valerie C. Gay
Venue: Proceedings of the Sixth International Conference on Networking (2007)

This paper proposes to improve policy-based management by integrating security parameters into the Service Level Specification (SLS). Integrating those parameters in the QoS part of the Service Level Agreement (SLA) specification is of particular importance for multimedia services requiring security since QoS is negotiated when the multimedia service is deployed. Security mechanisms need to be negotiated at that time when sensible multimedia information is exchanged. In this paper we show that including security parameters in SLA specification improves the negotiation and deployment of security and QoS policies for multimedia services. The parameters this paper proposes to integrate have the advantage to be understandable by end-users and service providers.
Scheduling to Minimize theWorst-Case Loss Rate
Authors: Mahmoud Elhaddad, Hammad Iqbal, Taieb Znati, Rami Melhem
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

We study link scheduling in networks with small router buffers, with the goal of minimizing the guaranteed packet loss rate bound for each ingress-egress traffic aggregate (connection). Given a link scheduling algorithm (a service discipline and a packet drop policy), the guaranteed loss rate for a connection is the loss rate under worst-case routing and bandwidth allocations for competing traffic. Under simplifying assumptions, we show that a local min-max fairness property with respect to apportioning loss events among the connections sharing each link, and a condition on the correlation of scheduling decisions at different links are two necessary and (together) sufficient conditions for optimality in the minimization problem. Based on these conditions, we introduce a randomized link-scheduling algorithm called Rolling Priority where packet scheduling at each link relies exclusively on local information. We show that RP satisfies both conditions and is therefore optimal.
An Adaptive System-Level Diagnosis Approach for Mesh Connected Multiprocessors
Authors: C. Feng, L. N. Bhuyan, F. Lombardi
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

Traditional adaptive centralized system diagnosis assumes a fully connected network topology, hence it can not be used in a number of classes of multiprocessor systems, such as meshes. This paper proposes an adaptive system-level diagnosis algorithm for meshes with wraparound, such as Intel Paragon machine. It is proved that the diagnosis cost required by the proposed approach is lower than the known diagnosis algorithms which can be applied to mesh architectures. Also over-d fault problem can be efficiently solved by our method, where d is the diagnosability.
Towards attack-agnostic defenses
Authors: David Brumley, Dawn Song
Venue: Proceedings of the 1st USENIX Workshop on Hot Topics in Security (2006)

Internet attackers control hundreds of thousands to perhaps millions of computers, which they can use for a variety of different attacks. Common attacks include spam delivery, phishing, and DDoS. The current research community focus is on defenses for each specific attack type compromised hosts may launch. However, attack-specific approaches almost always have two fundamental drawbacks: they do not address the root problem that attackers control an army of compromised hosts, and they do not provide the right incentives for users to properly secure their machines. As a result, attack-specific defenses may be defeated by new attacks, even those that may be only slightly different from old attacks. We argue researchers should also focus on attackagnostic defenses whose effectiveness does not depend on the particular attack type. We initiate this line of research by investigating the design space for attack-agnostic defenses, and then detailing two extreme points within the design space: an InternetWatch List and an Internet Reputation System.
The Tycho slate: complex drawing and editing in Tcl/Tk
Authors: H. John Reekie, Edward A. Lee
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

This paper introduces the Slate package, which has been developed as part of the Tycho project at UC Berkeley. The Slate is layered over the Tcl/Tk canvas, and contains features that we believe to be useful for implementing complex graphical editing and visualization widgets. The first key feature is the ability to define new item types in Tcl. The second is an implementation of the concept of interactor, which abstracts low-level mouse events into self-contained objects. The third is access to and modification of items based on their shape, rather than raw coordinates. Combined with a straight-forward implementation of the model-view-controller architecture, the Slate is capable of implementing quite sophisticated graphical editors.
Modular state space exploration for timed petri nets
Authors: C. Lakos, L. Petrucci
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2007)

This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.
Asynchrony in multi-band speech recognition
Authors: C. Cerisara
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper, an algorithm for continuous speech recognition systems based on the multi-band principle is proposed. This algorithm allows the bands to be asynchronous and has a practical complexity that is very close to the complexity of the classical Viterbi algorithm. The question of whether the bands should be constrained to be synchronous or not is discussed. We show that it is advantageous to let the bands be asynchronous, as the increase of complexity, compared to the Viterbi algorithm, is low with our algorithm. Moreover, the accuracy must be at least as good as when the bands are synchronous, and, more importantly, different models than phones, can be used in the bands.
Evaluation of an engineering education courseware across different campuses
Authors: P. K. Raju
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In order to meet some of the objectives of the ABET (Accreditation Board for Engineering and Technology) 2000 criteria and to bring real-world issues to engineering classrooms, many different engineering educational materials were developed by two of the authors. The materials consist of written case studies, videos and CD-ROMs. They were used in engineering classrooms at different universities. In this paper, we discuss the evaluation of the courseware entitled "Della Power Plant" in engineering classrooms. In this courseware, the engineering and management issues surrounding the heavy vibration of a turbine-generator unit in a power plant are discussed. The Della CD-ROM won the 1998 Premier Award for Excellence in Engineering Education Courseware. Subsequently, this courseware has been administered in engineering and business classrooms at Auburn University and at a minority engineering program at Alabama A&M University. Two of the authors evaluated the effectiveness of the courseware in these classrooms as a means of integrating engineering theory and practice. They found that the case study method of teaching received favorable responses from the students. The comments from the students were sprinkled with phrases such as "real life", "real situation" and "real world". We believe that widespread use of courseware similar to the one discussed in this paper could develop the skills and techniques necessary for engineering practice and bring theory and practice together. It could also help realize many of the ABET 2000 criteria.
Optical Splitting Trees for High-Precision Monocular Imaging
Authors: Morgan McGuire, Wojciech Matusik, Hanspeter Pfister, Billy Chen, John F. Hughes, Shree K. Nayar
Venue: IEEE Computer Graphics and Applications (2007)

This paper introduces a framework to design optical splitting tree to perform computational photography tasks that require many sensors with a common optical axis. As the number of sensors increases, designing a good optical system is often difficult because the components have nonideal characteristics.The authors describe an optimization tool takes this into account and finds "good" designs as specified by several weighted coefficients. Assisted by this optimizer, they demonstrate high-dynamic range, focusing, matting, high-speed, and hybrid imaging implemented on a single, reconfigurable camera containing eight sensors.
Engaging undergraduates in discussions about ethics in computing
Authors: Brian R. von Konsky, Jim Ivins, Susan J. Gribble
Venue: Proceedings of the ninth Australasian conference on Computing education - Volume 66 (2007)

Third-year computing students enrolled in a software engineering subject were introduced to the Australian Computer Society (ACS) Code of Ethics in the context of a computing professional's obligation to manage quality, safety and reliability. Following an introductory lecture, case study scenarios were interactively discussed during class. Immediately afterwards, students were surveyed to assess their self-perceived and actual ability to apply the ACS Code to another similar scenario. Of the 68 students who gave their informed consent to participate in the study, 34% reported being fully comfortable with applying the ACS Code of Ethics, while 63% were somewhat comfortable. In justifying multiple-choice options for dealing with a new case study scenario, 37% provided a good justification for their choice, 48% provided a poor justification, and 15% provided no justification. A further qualitative analysis of the responses suggests the need for formal assessment of ethics in computing education, and highlights the importance of improving the perceived relevance of ethics to students and the need for in-depth treatment of ethical issues.
Shape invariant time-scale modification of speech using a harmonic model
Authors: D. O'Brien
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A new and simple approach to shape invariant time-scale modification of speech is presented. The method based upon a harmonic coding of each speech frame operates entirely within the original sinusoidal model and makes no use of "pitch-pulse onset times" used by conventional algorithms. Instead, phase coherence, and thus shape invariance, are ensured by exploiting the harmonic relation existing between the sine waves to cause them to be in phase at each adjusted frame boundary. Results suggest this approach to be an excellent candidate for use within a concatenative text-to-speech synthesiser where scaling factors typically lie within a range well handled by this algorithm.
Dimension-Exchange-Based Load Balancing on Injured Hypercubes
Authors: Jie Wu
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We study a global load balancing scheme on hypercubes with faulty links based on the dimension exchange scheme, where each node exchanges workloads with its neighbors along selected dimensions in such a way that their loads become equal. An algorithm that can tolerate n-1 faulty links is first presented and it can be extended to connected hypercubes with up to 2n - 3 faulty links. Comparisons between the proposed scheme with the conventional dimension-exchange-based scheme are also presented. Simulation results show that very little overhead is introduced in our scheme.
Performance of multiple description coders on a real channel
Authors: A. R. Reibman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We explore the ability of multiple description (MD) source coders to achieve good performance on channels other than ideal MD channels. We examine both the overall system design and compare the performance of a system with MD source coder to that of a more traditional system using a layered source coder. For the memoryless channels we consider, MD source coding cannot achieve acceptable performance for a memoryless Gaussian source without appropriate channel coding. Also, in memoryless channels, a system with MD source coding outperforms a layered source coding system only in very poor channels. The introduction of memory in the channel degrades the performance of both systems equally. Using interleaving to reduce the impact of memory in the channel has more influence on performance than the choice of source coder.
Certification criteria for emulation technology in the australian defence force military avionics context
Authors: Derek Reinhardt
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

Emulatin technology promises to provide a means of addressing obsolescence issues in legacy computer processors in the military avionics domains. It has also been suggested that such technology might apply to safety critical and safety related systems in these domains. Numerous companies either have developed or are developing software components that are capable of emulating different legacy computing platforms. The emulators permit the execution of legacy code on newer computing platforms, without change to existing binary executables or data. Subsequent modifications to the legacy code in question may be made using either the legacy development environment and/or with some emulation technologies using a newer development environment. The Defence Science and Technology Organisation (DSTO) is presently working with Northrop Grumman Space Technology (NGST) to develop a concept demonstrator utilising NGST's Reconfigurable Processor for Legacy Applications Code Execution (RePLACE) Emulation Technology for the Royal Australian Navy (RAN) Seahawk Display Generator Unit (DGU). To assess how the Australian Defence Force's (ADF's) Technical Airworthiness Authority (TAA) - the Directorate General Technical Airworthiness (DGTA) might accept emulation technology, DGTA has evaluated emulation architectures and specifically RePLACE in the context of the Seahawk DGU. The evaluation has considered the emulation architecture, including identification of risks largely unique to the technology; as well as application of ADF preferred avionics software assurance and software safety standards to this technology. Evaluation of emulation technology, through exploration of emulation architectures and RePLACE as a case study, has allowed DGTA to define certification and regulatory guidance for the development of emulation technology within the ADF context.