ppxscal/embedding_network huggingface dataset:
Performance Evaluation of IEEE 802.20 PHY Layer
Authors: Ashkan Jalili, S. Mehdi Fakhraie, Said Nader-Esfahani
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In today’s life, the importance of accessing data and information from internet and other networks for business, entertainment, and social activity applications is ever increasing. Network protocols such as Wi-Fi (802.11) and WiMAX (802.16) have been developed for such applications. However the need for a high-speed, highly reliable and high quality access to these information services under fully mobile conditions and in vehicular speeds has increased the demand for another network type. IEEE 802.20 standard, nicknamed as Mobile-Fi, has been developed for mobile applications in speeds of up to 250 km/h.In this paper, a complete 802.20 model is introduced that the basic performance of mobile and fixed subscribers is thoroughly evaluated, presenting end-to-end application throughput. The dependency of the application throughput on different modulation schemes for different speeds is analyzed.
Optimum PID controller tuning for AVR system using adaptive tabu search
Authors: Anant Oonsivilai, Padej Pao-La-Or
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper contend with the determination of offline, optimal proportional-integral-derivative (PID) controller parameters of an automatic voltage regulator (AVR) system using Adaptive Tabu Search (ATS) algorithm is presented. Parameter of this PID controller is obtained by minimizing the performance index such as integrated absolute error (IAE), the integral of squared error (ISE), and the integral time absolute error (ITAE) employed ATS method. For results, the classical tuning proposed by Ziegler and Nichols is using compared with the propose method. By choosing the appropriated performance index, the performance of the proposed tuning mechanism has been demonstrated and analyzed in efficient and robust in improving the step response of an AVR system with application to control of synchronous generator excitation system.
Java assembly language programming for the JVM
Authors: H. Paul Haiduk, Rajan Alex
Venue: Journal of Computing Sciences in Colleges (2009)

This workshop is based on the assumption that the participant is looking for an alternative or supplement to the Intel Pentium or the Power PC chip architectures for a computer organization and assembly language course in a CS curriculum. The workshop is designed to prepare the participant to develop an insight into assembly language programming for the Java Virtual Machine and to be able to understand how to use the jasmin assembler to teach such important concepts as stack architecture, postfix expression evaluation and parameter passing constrained by a pass-by-value constraint
Parallelization of XPath queries using multi-core processors: challenges and experiences
Authors: Rajesh Bordawekar, Lipyeow Lim, Oded Shmueli
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a scenario where an XPath processor uses multiple threads to concurrently navigate and execute individual XPath queries on a shared XML document. Given the constraints of the XML execution and data models, we propose three strategies for parallelizing individual XPath queries: Data partitioning, Query partitioning, and Hybrid (query and data) partitioning. We experimentally evaluated these strategies on an x86 Linux multi-core system using a set of XPath queries, invoked on a variety of XML documents using the Xalan XPath APIs. Experimental results demonstrate that the proposed parallelization strategies work very effectively in practice; for a majority of XPath queries under evaluation, the execution performance scaled linearly as the number of threads was increased. Results also revealed the pros and cons of the different parallelization strategies for different XPath query patterns.
Conflict-free memory allocation for associative data files
Authors: Svetlana P. Kartashev, Steven I. Kartashev
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

For associative processing and databases characterized by sequential memory search, it is convenient to store a sequence of data files in a circulating memory since it is inexpensive and suitable for implementing sequential memory search algorithms. In this paper we discuss various allocation algorithms that allow g circulating memories to serve T processors, where g and T are selectable by programmer. All allocation schemes introduced in this paper are described by a Diophantine equation whose solution, x, shows the distance between any two processors that are not in conflict when they access the same circulating memory. The paper presents a technique for finding a maximal set of noninterfering processors and conflict-free allocation techniques for various structures of data files. These techniques achieve very high performance characteristics, since 1. They allow the entire memory space of a circulating memory either to be completely filled with data files or to be filled with minimal memory overhead created to exclude interference between any pair of noninterfering processors. 2. All the memory allocations developed are conflict-free. 3. During one memory revolution, the entire content of each circulating memory can be completely fetched by a set of noninterfering processors.
Spending Moore's dividend
Authors: James Larus
Venue: Communications of the ACM (2009)

Multicore computers shift the burden of software performance from chip designers and processor architects to software developers.
Examining gender differences in attitudes toward interactive classroom communications systems (ICCS)
Authors: Robin H. Kay
Venue: Computers Education (2009)

An interactive classroom communication system (ICCS) involves the use of remote devices that permit all students in a class to respond to multiple choice questions displayed on a LCD projector. After responses are clicked in, the results are instantly aggregated and displayed in chart form. The purpose of this study was to examine gender differences in attitudes toward ICCSs for 659 secondary school students. The initial results suggested that male students had significantly more positive attitudes than female students with respect to student involvement, assessment, and perceived learning. However, a number of these differences disappeared when computer comfort level and type of use were added as covariates. Male students still perceived that ICCSs improved the overall learning process more than female students regardless of computer comfort level or type of use.
Workload coverage through nonsmooth optimization
Authors: Nadezda Sukhorukova, Julien Ugon, John Yearwood
Venue: Optimization Methods Software (2009)

In this paper, workload coverage is the problem of identifying a pattern of days worked and days off, along with the number of hours worked on each work day. This pattern must satisfy certain work-related constraints and fit best to a predefined workload. In our study, we formulate the problem of workload coverage as an optimization problem. We propose a number of models which take into consideration various staffing constraints. For each of these models, our study aims to find a compromise between an accurate workload coverage and the ability to solve the corresponding optimization problems in a reasonable time. Numerical experiments on each model are carried out and the results are presented. Interestingly, the nonlinear programming approaches are found to be competitive with linear programming ones.
On Certain Rough Inclusion Functions
Authors: Anna Gomolińska
Venue: Transactions on Rough Sets IX (2008)

In this article we further explore the idea which led to the standard rough inclusion function. As a result, two more rough inclusion functions (RIFs in short) are obtained, different from the standard one and from each other. With every RIF we associate a mapping which is in some sense complementary to it. Next, these complementary mappings (co-RIFs) are used to define certain metrics. As it turns out, one of these distance functions is an instance of the Marczewski---Steinhaus metric. While the distance functions may directly be used to measure the degree of dissimilarity of sets of objects, their complementary mappings --- also discussed here --- are useful in measuring of the degree of mutual similarity of sets.
Embedded computers: software cost considerations
Authors: John H. Manley
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

There is a special subset of the total set of electronic data processors that is growing in importance, especially to the Air Force. This class of computers possesses several unique features that cause software development to be very expensive with relation to the number of lines of code required to make them run. This paper describes some of these unique features and illustrates how they tend to drive software costs upwrard. Potential solutions to the high cost of software problem in this area are offered which, as the reader will find, are tentative at best since we have only recently begun to investigate in depth the intricacies of what we call "embedded computers."
A New Type of Covering Approximation Operators
Authors: Mingfen Wu, Xianwei Wu, Ting Shen, Cungen Cao
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Rough set theory is a useful tool for data mining. It is based on equivalence relations of a universe. The covering rough sets is an improvement of Pawlak rough set to deal with complex practical problems which the latter one can not handle. However, many basic notions in this theory are not as widely agreeable as in the Pawlak rough set theory. This paper investigates four types of covering rough sets for dealing with the vagueness and granularity in information systems. First, we compare some basic properties of approximation operations generated by a covering with those of the Pawlak's rough sets. Then we mainly improve the definition of upper approximation for covering rough sets, and gain the fifth type of covering rough sets to make it more reasonable. Thus we set up a framework for the approximation operators of covering rough set, and getting more properties than the existing ones. Finally we study the inter dependency between the lower and upper approximation operations and relationships with five types of covering rough sets are discussed.
HCEP: a hybrid cluster-based energy-efficient protocol for wireless sensor networks
Authors: Liansheng Tan, Fei Ge, Jie Li, Jien Kato
Venue: International Journal of Sensor Networks (2009)

This paper addresses the challenge of load balance and network lifetime extension in Wireless Sensor Networks (WSNs). We propose a novel distributed clustering approach for WSNs, which is termed as Hybrid Cluster-based Energy-efficient Protocol (HCEP) by using clustering as a key communication control technique. To measure the load distribution among nodes in a WSN, we quantify load balance by giving a load parameter for every node in a WSN. We then introduce a novel clustering function that takes into account a number of factors such as node degree, node residual energy and node initial energy. Based on the clustering function, we develop the framework of HCEP for implementation in WSNs. We design HCEP to incorporate two sorts of procedures in it, mainly the clustering procedures. Using the procedure, HCEP takes the advantage of load balance and uses localised coordination to enable energy efficiency and robustness for dynamic WSN networks, and thus it can prolong the network lifetime significantly. Simulation results verify that HCEP extends lifetime when communication radius changes within certain range and that the introduced balance parameter can be set to extend lifetime significantly.
Shape Matching by Random Sampling
Authors: Helmut Alt, Ludmila Scharf
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

In order to determine the similarity between two planar shapes, which is an important problem in computer vision and pattern recognition, it is necessary to first match the two shapes as good as possible. As sets of allowed transformation to match shapes we consider translations, rigid motions, and similarities. We present a generic probabilistic algorithm based on random sampling for matching shapes which are modelled by sets of curves. The algorithm is applicable to the three considered classes of transformations. We analyze which similarity measure is optimized by the algorithm and give rigorous bounds on the number of samples necessary to get a prespecified approximation to the optimal match within a prespecified probability.
On static and dynamic partitioning behavior of large-scale P2P networks
Authors: Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-O(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, under both types of node failure. We finish the paper by demonstrating that our models match simulations very well and that dynamic P2P systems are extremely resilient under node churn as long as the neighbor replacement delay is much smaller than the average user lifetime.
Rough sets to help medical diagnosis - Evidence from a Taiwan's clinic
Authors: Hsu-Hao Yang, Chang-Lun Wu
Venue: Expert Systems with Applications: An International Journal (2009)

Medical data usually contain high degree of uncertainty that leads to problems such as diagnosis disparity. With the continually rising expenditures of health care, controlling the level of the expenditures by improving the diagnosis process is an emergent task and poses a greater challenge. Rough sets have been shown to be a useful technique to deal with data with uncertainty. This paper applies rough sets to identify the set of significant symptoms causing diseases and to induce decision rules using the data of a Taiwan's otolaryngology clinic. The data are limited to rhinology and throat logy and contain 657 records with each record including 12 condition attributes and one decision attribute. The clinic's physician agrees with the set of significant symptoms identified and favors the reduct containing one critical symptom. To generate decision rules, we use LEM2 and Explore algorithms and discuss these rules in terms of numbers of rules and implications of certain rules. Our results show that LEM2 generates fewer numbers of certain rules and LEM2's proportions of approximate rules are higher. We also observe that LEM2's certain rules form a more sensible pattern that Explore lacks. Discovery of the pattern is considered to be potentially helpful in improving the medical diagnosis.
On an idempotent transformation of aggregation functions and its application on absolutely continuous Archimedean copulas
Authors: B. De Baets, H. De Meyer, S. Díaz
Venue: Fuzzy Sets and Systems (2009)

In this paper, we isolate an interesting transformation of binary aggregation functions from a result on the propagation of transitivity in additive preference structures. This transformation is based on a projection technique and results in a smaller (or equal) binary aggregation function. The transformation is idempotent and acts internally on the classes of conjunctors, semi-copulas and quasi-copulas. Hence, also copulas are transformed into quasi-copulas, but in general not into copulas. Remarkably, the Frank copulas are mapped to new copulas.
Brief paper: Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
Authors: Mario Sznaier
Venue: Automatica (Journal of IFAC) (2009)

This paper analyzes the computational complexity of set membership identification of Hammerstein and Wiener systems. Its main results show that, even in cases where a portion of the plant is known, the problems are generically NP-hard both in the number of experimental data points and in the number of inputs (Wiener) or outputs (Hammerstein) of the nonlinearity. These results provide new insight into the reasons underlying the high computational complexity of several recently proposed algorithms and point out the need for developing computationally tractable relaxations.
Statistics over features of ECG signals
Authors: Elif Derya íbeyli
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presented the usage of statistics over the set of the features representing the electrocardiogram (ECG) signals. Since classification is more accurate when the pattern is simplified through representation by important features, feature extraction and selection play an important role in classifying systems such as neural networks. Multilayer perceptron neural network (MLPNN) architectures were formulated and used as basis for detection of variabilities of the ECG signals. Four types of ECG beats (normal beat, congestive heart failure beat, ventricular tachyarrhythmia beat, atrial fibrillation beat) obtained from the Physiobank database were classified. The selected Lyapunov exponents, wavelet coefficients and the power levels of power spectral density (PSD) values obtained by eigenvector methods of the ECG signals were used as inputs of the MLPNN trained with Levenberg-Marquardt algorithm. The classification results confirmed that the proposed MLPNN has potential in detecting the variabilities of the ECG signals.
How much parallelism is there in irregular applications?
Authors: Milind Kulkarni, Martin Burtscher, Rajeshkar Inkulu, Keshav Pingali, Calin Casçaval
Venue: ACM SIGPLAN Notices (2009)

Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular programs have a generalized form of data-parallelism called amorphous data-parallelism. However, in many programs, amorphous data-parallelism cannot be uncovered using static techniques, and its exploitation requires runtime strategies such as optimistic parallel execution. This raises a natural question: how much amorphous data-parallelism actually exists in irregular programs? In this paper, we describe the design and implementation of a tool called ParaMeter that produces parallelism profiles for irregular programs. Parallelism profiles are an abstract measure of the amount of amorphous data-parallelism at different points in the execution of an algorithm, independent of implementation-dependent details such as the number of cores, cache sizes, load-balancing, etc. ParaMeter can also generate constrained parallelism profiles for a fixed number of cores. We show parallelism profiles for seven irregular applications, and explain how these profiles provide insight into the behavior of these applications.
Set colorings of graphs
Authors: S. M. Hegde
Venue: European Journal of Combinatorics (2009)

A set coloring of the graph G is an assignment (function) of distinct subsets of a finite set X of colors to the vertices of the graph, where the colors of the edges are obtained as the symmetric differences of the sets assigned to their end vertices which are also distinct. A set coloring is called a strong set coloring if sets on the vertices and edges are distinct and together form the set of all nonempty subsets of X. A set coloring is called a proper set coloring if all the nonempty subsets of X are obtained on the edges. A graph is called strongly set colorable (properly set colorable) if it admits a strong set coloring (proper set coloring). In this paper we give some necessary conditions for a graph to admit a strong set coloring (a proper set coloring), characterize strongly set colorable complete bipartite graphs and strongly (properly) set colorable complete graphs, etc. Also, we give a construction of a planar strongly set colorable graph from a planar graph, a strongly set colorable tree from a tree and a properly set colorable tree from a tree, etc., thereby showing their embeddings.
Contextual Anatomic Mimesis Hybrid In-Situ Visualization Method for Improving Multi-Sensory Depth Perception in Medical Augmented Reality
Authors: Christoph Bichlmeier, Felix Wimmer, Sandro Michael Heining, Nassir Navab
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

The need to improve medical diagnosis and reduce invasive surgery is dependent upon seeing into a living human system. The use of diverse types of medical imaging and endoscopic instruments has provided significant breakthroughs, but not without limiting the surgeon's natural, intuitive and direct 3D perception into the human body. This paper presents a method for the use of Augmented Reality (AR) for the convergence of improved perception of 3D medical imaging data (mimesis) in context to the patient's own anatomy (in-situ) incorporating the physician's intuitive multi-sensory interaction and integrating direct manipulation with endoscopic instruments. Transparency of the video images recorded by the color cameras of a video see-through, stereoscopic Head-Mounted-Display (HMD) is adjusted according to the position and line of sight of the observer, the shape of the patient's skin and the location of the instrument. The modified video image of the real scene is then blended with the previously rendered virtual anatomy. The effectiveness has been demonstrated in a series of experiments at the Chirurgische Klinik in Munich, Germany with cadaver and in-vivo studies. The results can be applied for designing medical AR training and educational applications.
Murach's ASP.NET 3.5 Web Programming with C# 2008
Authors: Anne Boehm, Joel Murach
Venue:  (2008)

This book is for C# developers who want to learn how to develop professional web applications with Microsoft's ASP.NET 3.5. The first 4 chapters present a quick-start course that works both for beginners and for experienced web developers who are new to ASP.NET. Then, the next four sections present (1) the skills you need for any business application, (2) the skills you need for database applications, (3) the skills you need for e-commerce applications, and (4) the skills you need for developing code that can be reused in other web applications. Along the way, you'll learn about .NET 3.5 enhancements that streamline web development, like the ListView and DataPager controls, LINQ, and AJAX.