ppxscal/embedding_network huggingface dataset:
Competitive non-migratory scheduling for flow time and energy
Authors: Tak-Wah Lam, Lap-Kei Lee, Isaac K. K. To, Prudence W. H. Wong
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Energy usage has been an important concern in recent research on online scheduling. In this paper we extend the study of the tradeoff between flow time and energy from the single-processor setting [8, 6] to the multi-processor setting. Our main result is an analysis of a simple non-migratory online algorithm called CRR (classified round robin) on m ≥ 2 processors, showing that its flow time plus energy is within O(1) times of the optimal non-migratory offline algorithm, when the maximum allowable speed is slightly relaxed. This result still holds even if the comparison is made against the optimal migratory offline algorithm (the competitive ratio increases by a factor of 2.5). As a special case, our work also contributes to the traditional online flow-time scheduling. Specifically, for minimizing flow time only, CRR can yield a competitive ratio one or even arbitrarily smaller than one, when using sufficiently faster processors. Prior to our work, similar result is only known for online algorithms that needs migration [21, 23], while the best non-migratory result can achieve an O(1) competitive ratio [14]. The above result stems from an interesting observation that there always exists some optimal migratory schedule S that can be converted (in an offline sense) to a non-migratory schedule S' with a moderate increase in flow time plus energy. More importantly, this non-migratory schedule always dispatches jobs in the same way as CRR.
Utterance verification using fuzzy methods
Authors: Dat Tran, Dharmendra Sharma
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In utterance verification, a claim identity is a linguistic unit such as a word or a phrase. An utterance of this claimed identity is verified by computing a similarity score to compare the content of spoken utterance with the word or phrase midel whose identity is claimed. Most of the current normalisation methods compute the score as the ratio of the claimed utterance's and the impostors' likelihood functions. Based on analysing false acceptance and false rejection errors occured by the current methods, we propose normalisation methods based on Fuzzy C-Means, Fuzzy Entropy and Noise Clustering methods to find better scores which can reduce those errors. Experiments performed on the TI46 speech corpora show better results for the proposed methods.
Enhanced Chord-Based Routing Protocol Using Neighbors' Neighbors Links
Authors: Dai Bin, Wang Furong, Jianhua Ma, Liu Jian
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores desired data items. Chord protocol adopts finger tables to achieve (log Ο N) mean lookup path length for an N node system. To many time-sensitive applications, the requirement of optimal lookup path length is more critical. Our focus in this paper is to study how to shorten the lookup path length through optimizing routing protocol based on Chord. The contribution of this paper is a more efficient Chord-based routing protocol using neighbors’ neighbors links for lookup in a dynamic peer-to-peer system with frequent node arrivals and departures. Results from theoretical analysis and simulations show that both logical path length and physical end-to-end path latency of our protocol are shorter than Chord with the assist of neighbors’ neighbors links per node.
Ethics training and decision-making: do computer science programs need help?
Authors: Carol Spradling, Leen-Kiat Soh, Charles Ansorge
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

A national web-based survey using SurveyMonkey.com was administered to 700 undergraduate computer science programs in the United States as part of a stratified random sample of 797 undergraduate computer science programs. The 251 program responses (36% response rate) regarding social and professional issues (computer ethics) are presented. This article describes the demographics of the respondents, presents results concerning whether programs teach social and professional issues, who teaches, the role of training in these programs, the decision making process as it relates to computer ethics and why some programs are not teaching computer ethics. Additionally, we provide suggestions for computer science programs regarding ethics training and decision-making and we share reasons why schools are not teaching computer ethics.
The effect of scaffolding students' context-generating cognitive activity in technology-enhanced case-based learning
Authors: Stavros N. Demetriadis, Pantelis M. Papadopoulos, Ioannis G. Stamelos, Frank Fischer
Venue: Computers Education (2008)

This study investigates the hypothesis that students' learning and problem-solving performance in ill-structured domains can be improved, if elaborative question prompts are used to activate students' context-generating cognitive processes, during case study. Two groups of students used a web-based learning environment to criss-cross and study case-based material in the software project management domain. The experimental group was additionally prompted to consistently answer a set of questions based on a model of context-generating processes, meant to engage students in deeper processing of information presented in cases. Students were also classified as having either ''complex'' or ''simple'' EB profile (based on their epistemological beliefs record), thereby establishing a 2x2 factorial design. Results indicated that scaffolding treatment had a significant main effect on students' performance, with the experimental group performing better in both domain knowledge acquisition and knowledge transfer post-test items. There is also tentative indication that EB profile and scaffolding treatment interact, with complex-EB learners benefiting most from the scaffolded condition. Overall, the study provides evidence that it is possible to improve individual learning in a technology environment for case-based learning, by implementing appropriate questioning strategies that trigger students to activate their context-generating cognitive processes, while studying the contextually rich material of cases.
Orienting Oracle
Venue: Queue (2007)

As vice president of server technologies for Oracle, Amlan Debnath is one of the few people who can synthesize Oracle's software infrastructure plans. In an interview with ACM Queucast host Mike Vizard, Debnath provides some insights to how Oracle's strategy is evolving to simultaneously embrace service-oriented architectures alongside the demands of new and emerging events-driven architectures. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
COMPARISON OF TWO TYPES OF EVENT BAYESIAN NETWORKS: A CASE STUDY
Authors: S. F. Galán, G. Arroyo-Figueroa, F. J. Díez, L. E. Sucar
Venue: Applied Artificial Intelligence (2007)

Temporal Nodes Bayesian Networks (TNBNs) and Networks of Probabilistic Events in Discrete Time (NPEDTs) are two different types of Event Bayesian Networks (EBNs). Both are based on the representation of uncertain events, alternatively to Dynamic Bayesian Networks, which deal with real-world dynamic properties. In a previous work, Arroyo-Figueroa and Sucar applied TNBNs to the diagnosis and prediction of the temporal faults that may occur in the steam generator of a fossil power plant. We present an NPEDT for the same domain, along with a comparative evaluation of the two networks. We examine different methods suggested in the literature for the evaluation of Bayesian networks, analyze their limitations when applied to this temporal domain, and suggest a new evaluation method appropriate for EBNs. In general, the results show that, in this domain, NPEDTs perform better than TNBNs, possibly due to finer time granularity used in the NPEDT.
A lower bound for the crossing number of Cm&thinsp;&times;&thinsp;Cn
Authors: Gelasio Salazar
Venue: Journal of Graph Theory (2000)

We prove that the crossing number of Cm&thinsp;&times;&thinsp;Cn is at least (m&thinsp;-&thinsp;2)n-3, for all m, n such that n&thinsp;&ge;&thinsp;m. This is the best general lower bound known for the crossing number of Cm&thinsp;&times;&thinsp;Cn, whose exact value has been long conjectured to be (m&thinsp;-&thinsp;2)n, for 3&thinsp;&le;&thinsp;m&thinsp;&le;&thinsp;n. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 222&ndash;226, 2000
Study on Backoff Algorithm for IEEE 802.15.4 LR-WPAN
Authors: Bih-Hwang Lee, Huai-Kuei Wu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

IEEE 802.15.4 standard is to implement sensor networks with low power consumption and low cost. The transmission period of IEEE 802.15.4 consists of contention access period (CAP) and contention free period (CFP). CAP applies carrier sense multiple access with collision avoidance (CSMA/CA) for its contention mechanism. In such a network, channel utilization is significantly affected by backoff time and packet collision. This paper proposes a delayed backoff algorithm (DBA) to improve the effective goodput and power consumption, which are obtained by simulation experiments and compared with different schemes. The proposed algorithm performs better than the other schemes according to the obtained results.
Try Ruby!: tutorial presentation
Authors: James McGuffee, Jay Blanco, Franz Wambach
Venue: Journal of Computing Sciences in Colleges (2008)

Ruby is a popular object-oriented scripting programming language originally released in 1995 by Yukihiro "Matz" Matsumoto. This tutorial is a hands-on introduction to the Ruby programming language. The tutorial will include a brief discussion of when and where to use the Ruby programming language in the CS curriculum. Participants in this tutorial should already know how to program in an imperative programming language.
Evaluation of ANN Classifiers During Supervised Training with ROC Analysis and Cross Validation
Authors: Miguel Antonio Sovierzoski, Fernanda Isabel Marques Argoud, Fernando Mendes de Azevedo
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The evaluation of an Artificial Neural Network is not a part of the training phase and it is not a trivial process. It represents an exhaustive test process with a computational effort greater than the ANN training. Monitoring the error during the training phase can provide an indicator of the convergence of the algorithm. This study presents some analysis tools integrated to the supervised training of the ANN MLP Classifier. The objective is to provide a quantitative evaluation of the learning and generalization of the knowledge during the ANN supervised training. The Cross Validation and the ROC Analysis procedures were used together with the standard back-propagation ANN MLP training algorithm. The procedure is described and the results of the ANN classifier for epilepsy events in EEG data are presented.
A Preliminary Investigation of Skype Traffic Classification Using a Minimalist Feature Set
Authors: Duffy Angevine, Nur Zincir-Heywood
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this work, AdaBoost and C4.5, are employed for classifying Skype direct (UDP and TCP) communications from traffic log files. Pre-processing is applied to the traffic data to express it as flows, which is later converted into a descriptive feature set. The aforementioned algorithms are then evaluated on this feature set. Results show that a 98% detection rate with6% false positive rate for UDP based Skype and a 94% detection rate with 4% false positive rate for TCP based Skype is possible to achieve.
Characterization of negative-type photoresists containing polyhedral oligomeric silsesquioxane methacrylate
Authors: Ho-May Lin, Kuo-Hung Hseih, Feng-Chih Chang
Venue: Microelectronic Engineering (2008)

A series of negative-type photoresists made by blending with various contents of polyhedral oligomeric silsesquioxane (POSS) methacrylate were prepared and characterized. These POSS macromers tend to crystallize or aggregate to form their own domains within the photoresist matrix. Sensitivity of the POSS modified photoresist is significantly improved with the increase of the POSS content. Results from photo-DSC analyses indicate that both induction time and peak maximum of heat flux are reduced by blending with POSS macromer. Addition of the proper amount (
Priority coding for video-telephony applications based on visual attention
Authors: Nicolas Tsapatsoulis, Konstantinos Rapantzikos, Yannis Avrithis
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

In this paper we investigate the utilization of visual saliency maps for ROI-based video coding of video-telephony applications. Visually salient areas indicated in the saliency map are considered as ROIs. These areas are automatically detected using an algorithm for visual attention (VA) which builds on the bottom-up approach proposed by Itti et al. A top-down channel emulating the visual search for human faces performed by humans has been added, while orientation, intensity and color conspicuity maps are computed within a unified multi-resolution framework based on wavelet subband analysis. Priority encoding, for experimentation purposes, is utilized in a simple manner: Frame areas outside the priority regions are blurred using a smoothing filter and then passed to the video encoder. This leads to better compression of both Intra-coded (I) frames (more DCT coefficients are zeroed in the DCT-quantization step) and Inter coded (P, B) frames (lower prediction error). In more sophisticated approaches, priority encoding could be incorporated by varying the quality factor of the DCT quantization table. Extended experiments concerning both static images as well as low-quality video show the compression efficiency of the proposed method. The comparisons are made against standard JPEG and MPEG-1 encoding respectively.
Techniques for location selection on a mobile device
Authors: Mika Luimula, Kirsti Sääskilahti, Timo Partala, Ossi Saukko
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this paper we present techniques for selecting one's current location in mobile location-based systems. We present Locawe (Location-aware System Platform) and four alternative location selection techniques, which are physical selection using RFID technology, automatic selection based on GPS coordinates, selection from a mobile map with a stylus, and a textual selection technique involving a virtual keyboard and a selection list. These techniques have been tested in real mobile applications.
Signature-Based Composition of Web Services
Authors: Aniss Alkamari, Hafedh Mili, Abdel Obaid
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

The web services family of standards promotes the interoperability of heterogeneous distributed systems by separating the definition of a service from, 1) its implementation language, 2) its internal data representation, and 3) the communication protocol used to access it. The UDDI standard addresses aspects related to the publication and querying of enterprise business services, but the kind of representation that is supported, and the corresponding queries have limited functionality. We are interested in the problem of querying a UDDI registry with a functional specification of a service, and getting in return a single service, or a composition of services that address the functional need. Existing approaches to web service composition rely on external semantic knowledge to identify candidate component services. Our approach relies on service signatures (message types). We describe the principles underlying our approach, a family of algorithms for web service composition, our implementation of these algorithms, and the preliminary experimental results.
Multiscaling in the distribution of the exchange rates
Authors: Sergio Bianchi, Augusto Pianese
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The paper analyzes the scaling laws of the FX markets by applying a recently introduced distribution-based class of estimators of the self-similarity parameter. Instead of evaluating specific moments, the scaling of the whole distribution is studied by pairwise comparisons of time horizons. The analysis shows that.
Hardware/Software Codesign Pedagogy for the Industry
Authors: Min He, Ming-Che Tsai, Xiaolong Wu, Fei Wang, Ramzi Nasr
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With the essentiality of hardware/software codesign in present and future designs, it has become more and more important to educate engineers in this area. In this paper, industry trends and expectations are investigated in the area of hardware/software codesign and system-level design, as well as its current status in education, to derive a better pedagogy for hardware/software codesign.
Towards a Generic Model for Forecasting Rain Duration Using GITIC Model
Authors: Malik Shahzad Kaleem Awan, Mian Muhammad Awais
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

The existing weather forecasting models have limitations incorporating complexity and dynamism associated with weather forecasts. In order to overcome such limitations, this paper presents the application of nature-inspired GITIC Model for weather forecasts. The GITIC model, inspired from the Human Gastro-intestinal tract (GIT) defense system, has been employed to formulate a generic, dynamic, and comprehensive model for forecasting rain duration by following an evolutionary computational approach.
An efficient FMT algorithm
Authors: Roman M. Vitenberg, Andrea Tonello
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The Filtered Multitone (FMT) Modulation is a new communication technology that uses for data transmission the orthogonal wavelets. This paper describes a new efficient FMT algorithm, which may be used for practical realization of high performance Wireless Systems.
Improving Thai Academic Web Page Classification Using Inverse Class Frequency and Web Link Information
Authors: Verayuth Lertnattee, Thanaruk Theeramunkong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Automatic text classification for Web collection is a non-trivial task. Since Thai academic Web pages usually present technical articles. They may have many technical terms both in Thai and English. This paper presents two approaches towards the problem of a large number of unique terms in a Web page: 1) term weighting schemes and 2) schemes using Web link information. We propose an approach using inverse class frequency instead of inverse document frequency in centroid-based text categorization. Web link information provides information for users to follow to another part or page. It adds useful unique terms for classification. The experimental results show that inverse class frequency is useful on a set of Thai academic Web documents, which is categorized by sources (sites) of information. It should be applied on both prototype and query vectors. Moreover, Web link information expresses its usefulness when inverse class frequency is also applied.
Xen-Based HPC: A Parallel I/O Perspective
Authors: Weikuan Yu, Jeffrey S. Vetter
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Virtualization using Xen-based virtual machine environment has yet to permeate the field of high performance computing (HPC). One major requirement for HPC is the availability of scalable and high performance I/O. Conventional wisdom suggests that virtualization of system services must lead to degraded performance. In this presentation, we take on a parallel I/O perspective to study the viability of Xen-based HPC for data-intensive programs. We have analyzed the overheads and migration costs for parallel I/O programs in a Xen-based virtual machine cluster. Our analysis covers PVFS-based parallel I/O over two different networking protocols: TCP-based Gigabit Ethernet and VMM-bypass InfiniBand. Our experimental results suggest that network processing in Xen-based virtualization can significantly impact the performance of Parallel I/O. By carefully tuning the networking layers, we have demonstrated the following for Xen-based HPC I/O: (1) TCP offloading can help achieve low overhead parallel I/O; (2) parallel reads and writes require different network tuning to achieve good I/O bandwidth; and (3) Xen-based HPC environment can support high performance parallel I/O with both negligible overhead and little migration cost.
A report on a survey and study of static analysis users
Authors: Nathaniel Ayewah, William Pugh
Venue: Proceedings of the 2008 workshop on Defects in large software systems (2008)

As static analysis tools mature and attract more users, vendors and researchers have an increased interest in understanding how users interact with them, and how they impact the software development process. The FindBugs project has conducted a number of studies including online surveys, interviews and a preliminary controlled user study to better understand the practices, experiences and needs of its users. Through these studies we have learned that many users are interested in even low priority warnings, and some organizations are building custom solutions to more seamlessly and automatically integrate FindBugs into their software processes. We've also observed that developers can make decisions about the accuracy and severity of warnings fairly quickly and independent reviewers will generally reach the same conclusions about warnings.
On a repairable system with an unreliable service station-Bayesian approach
Authors: Jau-Chuan Ke, Ssu-Lang Lee, Ying-Lin Hsu, Yu-Tzu Chen
Venue: Computers Mathematics with Applications (2008)

System characteristics of a two-unit repairable system are studied from a Bayesian viewpoint with different types of priors assumed for unknown parameters, in which the service station is unreliable. Times to failure and times to repair of the operating units are assumed to follow exponential distributions. In addition, failure times and repair times of the service station also follow exponential distributions. When times to failure and times to repair of operating units, failure times and repair times of the service station are with uncertain parameters, a Bayesian approach is adopted to evaluate system characteristics. Monte Carlo simulation is used to derive the posterior distribution for the mean time to system failure and the steady-state availability. Some numerical experiments are performed to illustrate the results derived in this paper.