ppxscal/embedding_network huggingface dataset:
Towards the Architectural Definition of the Health Watcher System with AO-ADL
Authors: Monica Pinto, Nadia Gamez, Lidia Fuentes
Venue: Proceedings of the Early Aspects at ICSE: Workshops in Aspect-Oriented Requirements Engineering and Architecture Design (2007)

AO-ADL is an aspect-oriented architecture description language. The main contributions of AO-ADL are two. First contribution is the definition of a symmetric composition model, where functional and non-functional concerns are modeled by the same architectural block. Second contribution is the extension of the semantic of connectors with aspectual composition information. In this paper we describe the software architecture of the Health Watcher system using AO-ADL. We present a subset of the functional and extra-functional concerns identified for this system, as well as the compositions among the components modeling them. We specially focus on aspectual compositions to illustrate how the extensions that AO-ADL introduces into connectors provide appropriate support for representing separation of concerns at the architectural level.
16 kbit/s wideband speech coding based on unequal subbands
Authors: J. W. Paulus, J. Schnitzler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We propose a split-band encoding scheme for 16 kbit/s wideband speech coding (50-7000 Hz), using 2 unequal subbands from 0-6 kHz and from 6-7 kHz. This approach was motivated by an experimental evaluation of the signal bandwidth of speech frames. The higher subband is simply represented by white noise with adjustment of the short term energy. For the lower subband code-excited linear prediction (CELP) is used. The analysis filter bank, which performs the unequal band splitting combined with critical subsampling of the sub-bands, is described. A bit error concealment technique and the bit allocation is also presented. By informal listening tests the speech quality was rated higher than the speech quality of the CCITT G.722 wideband codec operating at 48 kbit/s.
Creating "digital literacy" for new learning models
Authors: S. Muchin
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

To keep up with the increasing computer competence of students and their experience of digital media, a substantial effort is required in order to develop "digital literacy" amongst teachers. It is important to reinforce the area of IT and pedagogical development with respect to content and creativity. This work in progress describes collaboration between Chalmers Medialab and the School of Electrical and Computer Engineering to develop the competence to handle interactive story telling, interactive system design and the transformation of ideas into digital media. Three projects are presented: electrical measurement laboratory, digiflex and "current picture".
Ifmail: FidoNet(tm) technology implementation on UNIX platform
Authors: Eugene G. Crosser
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Fidonet(tm) is an amateur wide area computer network, mostly basede on computers running MS/DOS and compatible systems. Ifmail program was designed, first, for running a Fidonet note on a UNIX machine, and second, for gatewaying Fidonet traffic to and from the Internet.
Analysis techniques for detecting coordinated attacks and probes
Authors: John Green, David Marchette, Stephen Northcutt, Bill Ralph
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

Coordinated attacks and probes have been observed against several networks that we protect. We describe some of these attacks and provide insight into how and why they are carried out. We also suggest hypotheses for some of the more puzzling probes. Methods for detecting these coordinated attacks are provided.
Conferences under scrutiny
Authors: Sabah Al-Fedaghi
Venue: Communications of the ACM (2007)

Considering some of the perceived vagaries of the conference peer-review process and proposing ways to improve evaluation procedures.
Distributed volume rendering over a dynamically loaded heterogeneous network of computers
Authors: Subodh Kumar
Venue:  (2007)

Many scientific problems require either computationally expensive analysis, visualization, or both. Modern computer workstations connected by high-speed local area networks are used at low fractions of their potential while users read or edit documents on them, or are overloaded while users run complex analyses or visualizations on them. I have developed an algorithm for the solution of this general problem, supporting the distribution of heterogeneous computationally complex tasks over a network of heterogeneous computers. This algorithm uses the available computational resources with high efficiency. Additionally, the algorithm dynamically adapts to distributed user load, minimizing the performance impact on the distributed users. The particular problem for which the algorithm has been implemented is that of volume rendering, (Drebin, Carpenter et al. 1988), an important visualization technique for medical researchers. The rendering problem is a member of the class of general problems that the algorithm solves. The algorithm and its implementation, for this rendering problem, provide fast and consistent rendering performance on all available computers with little impact on other users.
On learning and computational complexity of FIR radial basis function networks. Part I. Learning of FIR RBFN's
Authors: K. Najarian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Recently, the complexity control of dynamic neural models has gained significant attention from signal processing community. The performance of such a process depends highly on the applied definition of "model complexity", i.e. complexity models that give simpler networks with better model accuracy and reliability are preferred. The learning theory creates a framework to assess the learning properties of models. These properties include the required size of the training samples as well as the statistical confidence over the model. In this paper, we apply the learning properties of two families of FIR radial basis function networks (RBFN's) to introduce new complexity measures that reflect the learning properties of such neural models. Then, based on these complexity terms, we define cost functions, which provide a balance between the training and testing performances of the model, and give desirable levels of accuracy and confidence.
Specifying Use Case Sequencing Constraints Using Description Elements
Authors: Stephane S. Some
Venue: Proceedings of the Sixth International Workshop on Scenarios and State Machines (2007)

The ability to express sequencing constraints is critical to use case based software development. These constraints are needed to effectively compose use case behavior and support verification and validation activities such as simulation and testing. In this paper, we consider the addition of use case description elements to explicitly express sequencing constraints between use cases. We introduce two complementary constructs. One allows to specify which use cases need to precede a use case and how these preceding use cases are synchronized. The second construct allows to specify which use cases are enabled from a use case and how these use cases execute concurrently. We relate the introduced elements to UML activity diagrams and implicit sequencing based on preconditions and postconditions.
Mapping Techniques for an Ontology Network
Authors: Jose Cremades, Maria J. Rodriguez, Carmen Costilla, Antonio Pena
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

We are researching a Web Integrated Reference Architecture based on the mediator-wrapper approach. From a conceptual modeling point of view, this mediator is an architectural component defined by a Semantic Unification Model composed of two layers. The lower layer, the Specific Ontological Network (SON), is tailored to a concise application domain. It networks as many Specific Ontologies (SOs) (URIs of local semantic resources to collect) as necessary through horizontal mappings. The upper layer, the Global Ontological Kernel (GOK), unifies SON's semantics through some Global Ontologies (GOs) that attach concepts according to a concise unification criterion through vertical mappings. In this context, this paper proposes mapping techniques to integrate these kinds of ontologies and its main contributions are: (1) a homogeneous mapping definition framework, (2) a technique for networking SOs by translating heterogeneous mapping definitions (resulting from current alignment tools) into C-OWL and (3) a unified semantics by means of GOs.
Prefix forwarding for publish/subscribe
Authors: Zbigniew Jerzak, Christof Fetzer
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

We present a prefix forwarding algorithm for content-based publish/subscribe systems. Our algorithm performs only one content-based match per message regardless of the number of routers (hops) traversed from the source to the destination. Moreover, prefix forwarding preserves the decoupling properties of publish/subscribe system. Prefix forwarding does not put any restriction on the content of the messages. The presented algorithm does not introduce any false negatives and allows to tune the false positive rate to balance the bandwidth and processing overheads. We provide experimental results confirming the properties of the proposed approach.
An Approach to Outsourcing Data Mining Tasks while Protecting Business Intelligence and Customer Privacy
Authors: Ling QIU, Yingjiu LI, Xintao WU
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Data mining is playing an important role in decision making. It is beneficial to outsource data mining tasks if an organization does not have required expertise in-house. However, the organization may lose business intelligence and customer privacy during this outsourcing process. In this paper, we present a Bloom filter based solution to enable organizations to outsource their tasks of mining association rules while protecting their business intelligence and customer privacy. Our approach can achieve high precision in data mining by trading-off storage requirements.
Enhanced wireless mesh networking for ns-2 simulator
Authors: Vivek Mhatre
Venue: ACM SIGCOMM Computer Communication Review (2007)

The ns-2 simulator has limited support for simulating 802.11 based wireless mesh networks. We have added the following new features at the MAC and PHY layer of ns-2: (i) cumulative interference in SINR (Signal to Interference and Noise Ratio) computation, (ii) an accurate and combined shadow-fading module, (iii) multi-SINR and multi-rate link support, (iv) auto rate fallback (ARF) for rate adaptation, and (v) a framework for link probing and link quality estimation as required by most mesh routing protocols. We have made these modules publicly available. In this paper, we present an overview of these new features.
kNN-based high-dimensional Kullback-Leibler distance for tracking
Authors: Sylvain Boltz, Eric Debreuve, Michel Barlaud
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This paper deals with region-of-interest (ROI) tracking in video sequences. The goal is to determine in successive frames the region which best matches, in terms of a similarity measure, a ROI defined in a reference frame. Two aspects of such a measure between the reference region and a candidate region can be distinguished: radiometry which indicates if the regions have similar colors and geometry which correlates where these colors are present in the regions. If not using geometry, the number of potential matches increases. A soft geometric constraint can be added in the form of a joint radiometric-geometric PDF. High-dimensional PDF estimation being a difficult problem, measures based on these PDF distances may lead to an incorrect match. Instead, we propose to compute the Kullback-Leibler distance between high-dimensional PDFs without explicit estimation of the PDFs, i.e., directly from the samples using the kth-nearest neighbor (kNN) framework. Results showed accurate tracking.
An Efficient Mechanism for 3D Model Retrieval
Authors: Liang Ji, Gangshan Wu, Wenjun Dai
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Shape matching is one of the crucial problems in 3D model retrieval system. A usual approach is to exhaustively search through the database comparing each database model with the query model. This approach is inefficient especially for a large database. In this paper, an efficient mechanism for 3D model retrieval is proposed. In the preprocessing stage, a set of reference models are selected from the database using cluster analysis, and distances between database models and reference models are computed and stored. Then in the query stage, for a certain query model, searching is accelerated by reducing the large amount of model comparisons using triangle inequality based on the reference distances computed before. The proposed retrieval mechanism is implemented and experiment result shows that retrieval efficiency is greatly improved than the usual approach without any precision loss.
Dynamic LOD on GPU
Authors: Junfeng Ji, Enhua Wu, Sheng Li, Xuehui Liu
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper presents a novel approach to implementing dynamic LOD on GPU. For our purpose, a quadtree structure is created based on seamless geometry image atlas, which is a 3D surface representation in parameter space by combining the features of geometry images and poly-cube maps. All the nodes in the quadtree are packed into the atlas textures. There are two rendering passes in our approach. In the first pass, the LOD selection is performed in the fragment shaders. The resultant buffer is taken as the input texture to the second rendering pass by vertex texturing, and thus the node culling and triangulation can be performed in the vertex shaders. Our LOD algorithm can generate adaptive meshes dynamically, and can be fully implemented on GPU. It improves the efficiency of LOD selection, and alleviates the computing load on CPU.
Compiler-Managed Software-based Redundant Multi-Threading for Transient Fault Detection
Authors: Cheng Wang, Ho-seop Kim, Youfeng Wu, Victor Ying
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

As transistors become increasingly smaller and faster with tighter noise margins, modern processors are becoming increasingly more susceptible to transient hardware faults. Existing Hardware-based Redundant Multi-Threading (HRMT) approaches rely mostly on special-purpose hardware to replicate the program into redundant execution threads and compare their computation results. In this paper, we present a Software-based Redundant Multi-Threading (SRMT) approach for transient fault detection. Our SRMT technique uses compiler to automatically generate redundant threads so they can run on general-purpose chip multi-processors (CMPs). We exploit high-level program information available at compile time to optimize data communication between redundant threads. Furthermore, our software-based technique provides flexible program execution environment where the legacy binary codes and the reliability-enhanced codes can co-exist in a mix-and-match fashion, depending on the desired level of reliability and software compatibility. Our experimental results show that compiler analysis and optimization techniques can reduce data communication requirement by up to 88% of HRMT. With general-purpose intra-chip communication mechanisms in CMP machine, SRMT overhead can be as low as 19%. Moreover, SRMT technique achieves error coverage rates of 99.98% and 99.6% for SPEC CPU2000 integer and floating-point benchmarks, respectively. These results demonstrate the competitiveness of SRMT to HRMT approaches.
Semantic Analysis of 'to'
Authors: Ashish Francis Almeida, Rajat Kumar Mohanty, Pushpak Bhattacharyya
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

"To' is one of the most common lexemes in English (as found in 34% of the sentences in the Penn Tree Bank corpus). This paper describes the analysis of the sentences involving "to'. "To' poses problems at lexical, syntactic and semantic level, as we need to resolve whether the phrase which is fronted by "to' is a prepositional phrase (PP) or an infinitival clause which is a kind of Inflectional Phrase (IP). In case of PP, we need to locate the attachment site for it and assign the semantic relation. In case of IP, we need to resolve the empty pronominal in addition to the attachment resolution - a task essential to make the semantic analysis complete. We achieve an accuracy of about 80% in the above tasks.
Operating system scheduling for chip multithreaded processors
Authors: Margo I. Seltzer
Venue:  (2006)

This dissertation addresses operating system thread scheduling for chip multithreaded processors. Chip multithreaded processors are becoming mainstream thanks to their superior performance and power characteristics. Threads running concurrently on a chip multithreaded processor share the processor's resources. Resource contention, and accordingly performance, depends on characteristics of the co-scheduled threads. The operating system controls thread co-scheduling, and thus affects performance of a chip multithreaded system. This dissertation describes the design and implementation of three new scheduling algorithms for chip multithreaded processors: the non-work-conserving algorithm, the target-miss-rate algorithm, and the cache-fair algorithm. These algorithms target contention for the second-level cache, a recognized performance-critical resource, and pursue several objectives: performance optimization, fairness, and performance predictability. These algorithms use novel analytical performance models and online performance monitoring, and do not require input from applications or changes to existing hardware structures. This dissertation describes the implementation of these algorithms in a commercial operating system and evaluates their effectiveness.
Toward a general theory of quantum games
Authors: Gus Gutoski, John Watrous
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus on a representation of quantum strategies that generalizes the Choi-Jamiolkowski representation of quantum , with respect to which each strategy is described by a single operations. This new representation associates with each strategy a positive semidefinite operator acting only on the tensor product of its input and output spaces. Various facts about such representations are established, and two applications are discussed: the first is a new and conceptually simple proof of Kitaev's lower bound for strong coin-flipping, and the second is a proof of the exact characterization QRG = EXP of the class of problems having quantum refereed games.
A multi-parameter hybrid Barankin-type bound
Authors: I. Reuven
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We use the term hybrid parameter vector to refer to a vector which consists of both random and non-random parameters. We present a novel Barankin-type lower bound which bounds the estimation error of a hybrid parameter vector. The bound is expressed in a simple matrix form which consists of a non-Bayesian bound on the non-random parameters, a Bayesian bound on the random parameters, and the cross terms. We show that the non-Bayesian Barankin (1949) bound for deterministic parameters estimation and the Bobrovsky-Zakai (1976) Bayesian bound for random parameters estimation are special cases of the new bound. Also, the multi-parameter Cramer-Rao bound, in its Bayesian or non-Bayesian versions, are shown to be special cases of the new bound.
NetExam: a Web-based assessment tool for ABET2000
Authors: F. DePiero
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

NetExam is a Web-based testing engine. In addition to automated testing and grading capabilities, NetExam computes statistics that are tied directly to program outcomes, for ABET2000 assessment purposes. NetExam provides advantages over scantron-style testing as it also presents statistics on program outcomes on the web. This facilitates review and black board-style comments by program constituents. Also, all of the exam generation, grading, statistics and program assessment features are integrated into the web-based system. First usage is planned for the 2001-2002 academic year.
On the equivalence between the super-exponential algorithm and a gradient search method
Authors: M. Mboup
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This paper reviews the super-exponential algorithm proposed by Shalvi and Weinstein (1993) for blind channel equalization. We show that the algorithm coincides with a gradient search of a maximum of a cost function, which belongs to a family of functions very relevant in blind channel equalization. This family traces back to Donoho's (1981) work on minimum entropy deconvolution, and also underlies the Godard (1980) (or constant modulus) and the Shalvi-Weinstein algorithms. Using this gradient search interpretation, we give a simple proof of convergence for the super-exponential algorithm. Finally, we show that the gradient step-size choice giving rise to the super-exponential algorithm is optimal.
Utilizing beamforming antennas for wireless multihop networks
Authors: Nitin H. Vaidya
Venue:  (2006)

Wireless multihop networks are gaining popularity in applications such as mesh networks, wireless backbones, and sensor networks. Typically, communication protocols designed for such networks have explicitly or implicitly assumed an omnidirectional antenna at the radio layer. With recent progress in signal processing and antenna technologies, smart beamforming antennas have become feasible at cheaper prices, making them an attractive replacement to omnidirectional antennas. With beamforming antennas, the ability to guide RF energy in desired directions can lead to higher spatial reuse of the channel. Also, the higher communication range of beamforming antennas can be exploited to achieve stronger network connectivity, and to obtain fewer hop routes. However, existing protocols considered suitable for omnidirectional antennas are incapable of achieving these benefits. We have identified several weaknesses in these protocols, that together degrade overall network performance. We have addressed these weaknesses, and developed a better understanding of the improvements achievable with beamforming antennas. Based on the insights, we have designed medium access control (MAC) and routing protocols to suitably exploit the benefits of beamforming. We have demonstrated part of our solutions on a small prototype testbed, equipped with electronically steerable antennas.