ppxscal/embedding_network huggingface dataset:
Digital games: Developing the Issues of Socio-cognitive Learning Theory in an Attempt to Shift an Entertainment Gadget to an Educational Tool
Authors: Sofia Mysirlaki, Fotini Paraskeva
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

Over the years, digital games have become one of adolescents' main interests and a controversial issue among researchers all over the world. However, it is claimed that digital games can be a promising educational tool utilizing both the attributes that make them effective in the learning process and the students' predisposition to deal with them. The present study explores the background of digital game use in a group of Greek adolescents (N=125) (12 to 16 years old) and the potential of using digital games as an educational tool, on a socio-cognitive learning theory basis. Gender differences were revealed; concerning the time spent playing digital games, the game preferences, and the identification with the hero of the game. There was no correlation of frequent digital game use with low academic performance, though frequent game use was partially correlated with low Self-esteem and high Computer Self-efficacy.
Space-scale adaptive noise reduction in images based on thresholding neural network
Authors: Xiao-Ping Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Noise reduction has been a traditional problem in image processing. Previous wavelet thresholding based denoising methods proved promising, since they are capable of suppressing noise while maintaining the high frequency signal details. However, the local space-scale information of the image is not adaptively considered by standard wavelet thresholding methods. In this paper, a new type of thresholding neural networks (TNN) is presented with a new class of smooth nonlinear thresholding functions being the activation function. Unlike the standard soft-thresholding function, these new nonlinear thresholding functions are infinitely differentiable. Then a new nonlinear 2-D space-scale adaptive filtering method based on the wavelet TNN is presented for noise reduction in images. The numerical results indicate that the new method outperforms the Wiener filter and the standard wavelet thresholding denoising method in both peak-signal-to-noise-ratio (PSNR) and visual effect.
PSIM: Periodically Shifted Interleaved Memory System
Authors: Jae Young Lee, Hee Yong Youn
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Interleaved memory schemes have been used to increase the memory bandwidth. In this paper, we propose a new interleaved memory scheme called PSIM (Periodically Shifted Interleaved Memory), which allows high memory bandwidths at the sacrifice of very small memory space. It is a stride dependent scheme where the processor utilization is 100% for most strides using a power-of-two number of memory modules. We show, analytically and then by simulation, that the efficiency of PSIM is consistently higher than not only earlier stride dependent schemes but also stride independent schemes for both short and long vector accesses
A Study on the Importance of Biometric Technique Selection in the Protection of Company Resources
Authors: Anna Zajkowska, Wojciech Zimnoch, Khalid Saeed
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper some modern methods of physiological identification of people, the importance of biometrics in company management, and technical resources used in this field are presented. Authors describe the achievements of biometrics and its efficiency in ensuring the security of data and equipment resources from industrial management point of view. Also given the advantages of the solutions that are based on biometric methods, and evidence showing their increasing significance in company activity and its development.
Modeling Data Consistency in Wireless Sensor Networks
Authors: Kewei Sha, Weisong Shi
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

With the rapid growth of wireless sensor systems deployment, data quality has become a critical issue to the success of these applications. In this paper, we first raise the data quality problem in WSN. Then, we propose a novel metric, data consistency, to evaluate the data quality. Our consistency models consider three perspectives of consistency: temporal, numerical, and frequency, covering both individual data and data streams. Moreover, several system protocol design issues are identified to support data consistency. Finally, we propose a set of APIs to facilitate managing data consistency.
Demonstration platform for real-time beamforming
Authors: M. G. Morrow
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

DSP topics such as real-time beamforming are more easily taught to undergraduates if appropriate demonstrations and laboratory experiences are available. This paper describes a real-time DSP beamforming educational platform based around MATLAB and the Texas Instruments C6211 digital signal processing starter kit. Classroom uses of this platform are discussed.
Building Web 2.0
Authors: Kwei-Jay Lin
Venue: Computer (2007)

Web-based technologies should be simple, scalable, and sensible.
Effectively Complying with Sarbanes-Oxley in Dynamic Business Environments: A Knowledge Traceability Approach
Authors: Anthony Vance
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

One of the most pressing issues facing IT managers today is the creation and maintenance of rigorous internal controls as part of compliance with the Sarbanes-Oxley act [6]. The costs associated with complying with Sarbanes-Oxley are considerable. It is estimated that a total of 6 billion dollars were spent on Sarbanes-Oxley compliance in 2005 [6], with the average firm spending $7.8 million and 70,000 work hours to comply [9]. Three persisting problems contribute to these costs: (1) the ambiguity of the application of Sarbanes-Oxley requirements; (2) the large volume of documentation required; (3) and the difficulty of applying controls to changing business processes. This paper argues that the difficulties associated with complying with Sarbanes-Oxley are inherently knowledge management problems. Accordingly, this paper applies knowledge traceability concepts to create a framework that links the requirements of Sarbanes-Oxley to business processes.
Experience developing wireless networks for interactive multimedia instruction
Authors: J. Griffioen
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper presents our experiences developing the network and computer infrastructure needed to support the interactive multimedia wireless classrooms of the future. Despite their advantages, wireless networks have several drawbacks and potential pitfalls. The heavy loads placed on the network by interactive multimedia applications used in class such as collaborative whiteboards, collaborative editors, collaborative web surfing, application sharing, and even video/audio feeds to distance learning sites only aggravate the problems. In this paper, we highlight the problems that can arise in a wireless setting, and we describe the advantages and disadvantages of the various hardware technologies as well as the software and network protocols that are best suited for interactive multimedia wireless classrooms.
Memory Resource Management for Real-Time Systems
Authors: Audrey Marchand, Patricia Balbastre, Ismael Ripoll, Miguel Masmano, Alfons Crespo
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Dynamic memory storage has been widely used for years in computer science. However, its use in real-time systems has not been considered as an important issue, and memory management has not receive much consideration, whereas today's real-time applications are often characterized by highly fluctuating memory requirements. In this paper we present an approach to dynamic memory management for real-time systems. In response to application behavior and requests, the underlying memory management system adjusts resources to meet changing demands and user needs. The architectural framework that realizes this approach allows adaptive allocation of memory resources to applications involving both periodic or aperiodic tasks. Simulation results demonstrate the suitability of the proposed mechanism.
Visualisation of Domain-Specific Modelling Languages Using UML
Authors: Bas Graaf, Arie van Deursen
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Currently, general-purpose modelling tools are often only used to draw diagrams for the documentation. The introduction of model-driven software development approaches involves the definition of domain-specific modelling languages that allow code generation. Although graphical representations of the involved models are important for documentation, the development of required visualisations and editors is cumbersome. In this paper we propose to extend the typical model-driven approach with the automatic generation of diagrams for documentation. We illustrate the approach using the Model Driven Architecture in the domains of software architecture and control systems.
Design of a Process for Software Security
Authors: David Byers, Nahid Shahmehri
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Security is often an afterthought when developing software, and is often bolted on late in development or even during deployment or maintenance, through activities such as penetration testing, add-on security software and penetrate-and-patch maintenance. We believe that security needs to be built in to the software from the beginning, and that security activities need to take place throughout the software lifecycle. Accomplishing this effectively and efficiently requires structured approach combining a detailed understanding on what causes vulnerabilities, and how to prevent them. In this paper we present a process for software security that is based on vulnerability cause graphs, a formalism we have developed for modeling the causes of software vulnerabilities. The purpose of the software security process is to evolve the software development process so that vulnerabilities are prevented. The process we present differs from most current approaches to software security in its high degree of adaptability and in its ability to evolve in step with changing threats and risks. This paper focuses on how to apply the process and the criteria that have influenced the process design.
Resolution of Pronominals in Tamil
Authors: L. Sobha
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The paper presents a system, which resolves pronominals in Tamil. In resolving the pronominals we adopt a probabilistic method. The analysis depends on the salience weight of the candidate noun phrases (NP) for the antecedent-hood of the pronominal from the list of possible candidate NPs. The salience weight of an NP is obtained from the salience factors, which are determined by the probability of an NP to be the antecedent on the basis of the grammatical features. The input text is pre-processed and partially parsed before sending it to the salience analyzer. The partial parsing is done using morphological markings and no sophisticated notions of the modern formal linguistic theories are used. The system considers candidate nouns that occur four sentences above the sentence in which the pronoun occurs. The system gives 86.32% precision and 80.9% recall.
QCTL: A Logic for Reasoning about Inconsistent Concurrent Systems
Authors: Donghuo Chen, Guangquan Zhang, Jinzhao Wu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

It has been widely recognized that inconsistencies of- ten appear and are inevitable when specifying large and complex concurrent systems. In this paper, a non-classical temporal logic QCTL (quasi-classical temporal logic) is in- troduced, which subsumes both QCL and CTL. It is para- consistent, i.e., it can be used to reason non-trivially about system specifications containing inconsistent information. A semantics for QCTL is proposed in terms of paraKripke structures (the extended Kripke strucutres). Furthermore, a sound and complete proof system for QCTL is presented. Although the models and proof theory of QCTL are differ- ent comparing with classical logics like CTL, most natural and intuitive properties are preserved. This work bridges the gap between the specification and verification of tempo- ral aspects and non-trivial reasoning under inconsistency.
Merging Healthcare Ontologies: Inconsistency Tolerance and Implementation Issues
Authors: Fahim T. Imam, Wendy MacCaull, Margaret Ann Kennedy
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

A major challenge for ontology integration is to deal with inconsistencies. Existing merging tools are based on classical logic and are forced to avoid inconsistencies (to prevent the logic from becoming explosive) which may cause valuable information loss. However, inconsistent information may serve as an integral component in healthcare systems to give a full clinical perspective: any information loss is undesirable. In this paper we discuss various implementation issues for the development of a prototype merging system which will provide an inconsistency-tolerant reasoning mechanism applicable to the healthcare domain.
Performance study of a generalized subspace-based method for scattered sources
Authors: T. Abdellatif
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Signal array processing appears today as a good means to improve the wireless network, as it could permit a better estimation of the propagation channel parameters. Now, this paper focuses on high resolution bearing estimation, when scatterers local to the emitter engender diffuse paths deteriorating the performances of conventional algorithms. S. Valaee and B. Champagne (see IEEE Trans. on Signal Processing, vol.43, no.9, p.2144-53, 1995) introduced a subspace-based algorithm for the characterization of so-called scattered sources. This article extends this previous work and studies the performance of the algorithm in the case of two extreme propagation conditions. The theoretical variances and the Cramer Rao bounds are derived and compared to the Monte Carlo simulations in the case of a Gaussian shape of the angular power density.
Bialgebraic Operational Semantics and Modal Logic
Authors: Bartek Klin
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

A novel, general approach is proposed to proving the compositionality of process equivalences on languages defined by Structural Operational Semantics (SOS). The approach, based on modal logic, is inspired by the simple observation that if the set of formulas satisfied by a process can be derived from the corresponding sets for its subprocesses, then the logical equivalence is a congruence. Striving for generality, SOS rules are modeled categorically as bialgebraic distributive laws for some notions of process syntax and behaviour, and modal logics are modeled via coalgebraic polyadic modal logic. Compositionality is proved by providing a suitable notion of behaviour for the logic together with a dual distributive law, reflecting the one modeling the SOS specification. Concretely, the dual laws may appear as SOS-like rules where logical formulas play the role of processes, and their behaviour models logical decomposition over process syntax. The approach can be used either to proving compositionality for specific languages or for defining SOS congruence formats.
New implementation techniques of a real-time MPEG-2 audio encoding system
Authors: Hyen-O Oh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this study, new implementation techniques of a real-time MPEG-2 audio encoding system are presented. The system is developed using general-purpose DSPs. It consists of one master unit and five slave units, and its structure is basically based on our early work [1]. Two fast algorithms are developed and applied to the most compute-intensive routines of the encoding process. These algorithms play a key role in improving the entire system performance. The implemented system is designed to encode audio signal into MPEG-2 layer II bitstream with full configurations up to 5.1 channels and 640 kbps, and intended to support state-of-the-art quality. The generated bitstream can be stored in a hard disk on a PC or sent to an integration system to be multiplexed with the corresponding video-bitstream.
\beta-shape Based Computation of Blending Surfaces on a Molecule
Authors: Joonghyun Ryu, Rhohun Park, Youngsong Cho, Jeongyeon Seo, Deok-Soo Kim
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

It has been generally accepted that the structure of molecule is one of the most important factors which determine the functions of a molecule. Hence, studies have been conducted to analyze the structure of a molecule. Molecular surface is an important example of molecular structure. Given a molecular surface, the area and volume of the molecule can be computed to facilitate problems such as protein docking and folding. Therefore, it is important to compute a molecular surface precisely and efficiently. This paper presents an algorithm for correctly and efficiently computing the blending surfaces of a protein which is an important part of the molecular surface. Assuming that the Voronoi diagram of atoms of a protein is given, we first compute the \beta-shape of the protein corresponding to a solvent probe. Then, we use a search space reduction technique for the intersection tests while the link blending surface is computed. Once a â-shape is obtained, the blending surfaces corresponding to a given solvent probe can be computed in O(n) in the worst case, where n is the number of atoms. The correctness and efficiency of the algorithm stem from the powerful properties of \beta-shape, quasitriangulation, and the interworld data structure.
Blind equalization with a deterministic constant modulus cost-a set-membership filtering approach
Authors: S. Gollamudi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper presents the blind equalization problem in the novel deterministic framework of set-membership filtering (SMF). An adaptive algorithm based on a deterministic version of the constant modulus criterion is derived to seek the set-membership blind equalization solution. The proposed set-membership constant modulus (SM-CM) algorithm incorporates selection of data-dependent optimal step-size at every time and a selective update strategy. The performance and features of the proposed SM-CM algorithm are compared with those of the conventional CMA. Results indicate that the SM-CM algorithm outperforms the CMA in convergence speed, steady-state performance and average computational complexity. Furthermore, unlike the conventional CMA, the proposed algorithm does not require the step-size to be set heuristically.
UbiStore: Ubiquitous and Opportunistic Backup Architecture
Authors: Feiselia Tan, Sebastien Ardon, Max Ott
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

This paper presents UbiStore, a novel distributed and opportunistic backup architecture, where mobile devices backup their data over short-range, ad-hoc wireless links to other devices encountered as a result of user mobility. We base our design on the assumption that typical user mobility patterns will incur some repetitive encounters in the course of daily life (public transports, home/office) which can facilitate the recovery of data in case of a device failure. This paper presents the UbiStore design, an evaluation framework, and early results.
Maximally joining probabilistic data
Authors: Benny Kimelfeld, Yehoshua Sagiv
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Conceptually, the common approach to manipulating probabilistic data is to evaluate relational queries and then calculate the probability of each tuple in the result. This approach ignores the possibility that the probabilities of complete answers are too low and, hence, partial answers (with sufficiently high probabilities) become important. Therefore, we consider the semantics in which answers are maximal (i.e., have the smallest degree of incompleteness), subject tothe constraint that the probability is still above a given threshold. We investigate the complexity of joining relations under the above semantics. In contrast to the deterministic case, this approach gives rise to two different enumeration problems. The first is finding all maximal sets of tuples that are join consistent, connected and have a joint probability above the threshold. The second is computing all maximal tuples that are answers of partial joins and have a probability above the threshold. Both problems are tractable under data complexity. We also consider query-and-data complexity, which rules out as efficient the following naive algorithm: compute all partial answers and then choose the maximal ones among those with probabilities above the threshold. We give efficient algorithms for several, important special cases. We also show that, in general, the first problem is NP-hard whereas the secondis #P-hard.
Voice conversion algorithm based on Gaussian mixture model with dynamic frequency warping of STRAIGHT spectrum
Authors: T. Toda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In the voice conversion algorithm based on the Gaussian Mixture Model (GMM) applied to STRAIGHT, quality of converted speech is degraded because the converted spectrum is exceedingly smooth. We propose the GMM-based algorithm with dynamic frequency warping to avoid the over-smoothing. We also propose an addition of the weighted residual spectrum, which is the difference between the GMM-based converted spectrum and the frequency-warped spectrum, to avoid the deterioration of conversion-accuracy on speaker individuality. Results of the evaluation experiments clarify that the converted speech quality is better than that of the GMM-based algorithm, and the conversion-accuracy on speaker individuality is the same as that of the GMM-based algorithm in the proposed method with the properly-weighted residual spectrum.