ppxscal/embedding_network huggingface dataset:
Time-stamp service makes real-time gaming cheat-free
Authors: Shunsuke Mogaki, Masaru Kamada, Tatsuhiro Yonekura, Shusuke Okamoto, Yasuhiro Ohtaki, Mamun Bin Ibne Reaz
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Assuming time-stamp servers that we can trust exist everywhere in the Internet, we propose a cheat-proof protocol for real-time gaming that has the minimum latency. The assumptions are: 1) Time-stamp servers are available near each player that issue serially numbered time stamps. 2) There is no communication break down between the player and the nearest time-stamp server. By this protocol, each player sends its own action to the other player and also sends its hash to the nearest time-stamp server. The time-stamp server sends back to the player the signed hash with time and a serial number involved. The signature is an undeniable evidence of the action. The actions are checked if they are compatible with the hashes and the signed hashes are checked if they have the correct time and if the serial numbers are contiguous. This verification can be done as a batch after the game is finished. The latency in this protocol is only the packet traveling time from a player to another.
Throughputs in processor sharing models for integrated stream and elastic traffic
Authors: Remco Litjens, Hans van den Berg, Richard J. Boucherie
Venue: Performance Evaluation (2008)

We present an analytical study of throughput measures in processor sharing queuing systems with randomly varying service rates, modelling e.g. a communication link in an integrated services network carrying prioritised fixed rate stream traffic and rate-adaptive elastic traffic. A number of distinct throughput measures for the elastic traffic are defined, analysed and compared under various system conditions, both by analytical means and simulation. It is concluded that the call-average throughput, which is most relevant from the user point of view but typically hard to analyse, is very well approximated by the newly proposed so-called expected instantaneous throughput, which is readily obtained from the system's steady state distribution.
Combined entropy based method for detection of QRS complexes in 12-lead electrocardiogram using SVM
Authors: S. S. Mehta, N. S. Lingayat
Venue: Computers in Biology and Medicine (2008)

A method based on signal entropy is proposed for the detection of QRS complexes in the 12-lead electrocardiogram (ECG) using support vector machine (SVM). Digital filtering techniques are used to remove power line interference and base line wander in the ECG signal. Combined Entropy criterion was used to enhance the QRS complexes. SVM is used as a classifier to delineate QRS and non-QRS regions. The performance of the proposed algorithm was tested using 12-lead real ECG recordings from the standard CSE ECG database. The numerical results indicated that the algorithm achieved 99.93% of detection rate. The percentage of false positive and false negative is 0.54% and 0.06%, respectively. The proposed algorithm performs better as compared with published results of other QRS detectors tested on the same database.
Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL
Authors: Olgierd Unold, Lukasz Ciel
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper juxtaposes performance of the grammarbased classifier system (GCS) with tabular representation algorithm (TBL) on the task of inducing context-free grammars from partially structured examples. In both cases structured examples rapidly improve the efficiency of learning algorithms, although there are substantial differences in the way they work. GCS requires more attention while setting initial system parameters and structured examples provide a bit more information than in TBL but on the other hand it is more efficient when tested against the same examples' sets.
Dynamic pharming attacks and locked same-origin policies for web browsers
Authors: Chris Karlof, Umesh Shankar, J. D. Tygar, David Wagner
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We describe a new attack against web authentication, which we call dynamic pharming. Dynamic pharming works by hijacking DNS and sending the victim's browser malicious Javascript, which then exploits DNS rebinding vulnerabilities and the name-based same-origin policy to hijack a legitimate session after authentication has taken place. As a result, the attack works regardless of the authentication scheme used. Dynamic pharming enables the adversary to eavesdrop on sensitive content, forge transactions, sniff secondary passwords, etc. To counter dynamic pharming attacks, we propose two locked same-origin policies for web browsers. In contrast to the legacy same-origin policy, which regulates cross-object access control in browsers using domain names, the locked same-origin policies enforce access using servers' X.509 certificates and public keys. We show how our policies help two existing web authentication mechanisms, client-side SSL and SSL-only cookies, resist both pharming and stronger active attacks. Also, we present a deployability analysis of our policies based on a study of 14651 SSL domains. Our results suggest one of our policies can be deployed today and interoperate seamlessly with the vast majority of legacy web servers. For our other policy, we present a simple incrementally deployable opt-in mechanism for legacy servers using policy files, and show how web sites can use policy files to support self-signed and untrusted certificates, shared subdomain objects, and key updates.
Simple computation for the defuzzifications of center of sum and center of gravity
Authors: Wen-June Wang, Leh Luoh
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In most inference engines, the output of a fuzzy rule base before defuzzifying is the union of some trapezoidal or/and triangular fuzzy sets and it is always of irregular shape. The defuzzification by using the "center of sum" (COS) method or the "center of gravity" (COG) method for the irregular fuzzy set is then a troublesome computation because of some integrations. This paper proposes two formulas to compute the center of gravity of triangular and trapezoidal fuzzy sets respectively. Based on the proposed two formulas, the computation of COS defuzzification for an irregular fuzzy set can be simplified to a weighted average of the gravities of the trapezoidal or/and triangular fuzzy sets. An example is illustrated to show that the computation time of the pre-defuzzification method with the proposed formula is much less than that of the commonly used COS and COG defuzzification method.
A Semantic-Features-Calculation Based Model Mapping Approach for Web Information Systems
Authors: Guodong Huang, Li Chen, Jinkui Hou
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The transformation from platform independent models to platform specific models is a key technology in OMG's MDA. The mapping relations between different models are the foundation and basis for the transformation. By abstractly analyzing the characteristic of syntax and semantics of modeling languages, a semantic-features-calculation based model mapping approach for the development of web information systems was proposed. To using this approach, abstract target semantic model should be constructed firstly. Then, based on the idea of elements in source semantic domain being reconstructed in the target semantic domain, mapping relations from source model to target model are made via abstract target semantic model. This approach may not only to be a theoretical guidance for model transformation, but also can be a measurement for validating the mapping rules between models at different abstract levels. JavaServer Faces assisted with Enterprise JavaBeans was used as a target platform to help interpreting the process of using this approach.
Low Power Reduced Pin Count Test Methodology
Authors: Krishna Chakravadhanula, Nitin Parimi, Brian Foutz, Bing Li, Vivek Chickermane
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper explores the savings in power achieved using an I/O gating and Reduced Pin Count Test (RPCT) technique during manufacturing test. Since I/O pads consume significant power, preventing them from toggling during test will bring about a corresponding savings in power. The paper describes a fully automated RPCT methodology for low power that includes insertion of the RPCT and I/O gating logic and test generation. Based on simulation of the ATPG patterns, we show that the power consumed during scan test can be reduced significantly.
Forecasting Stock Price Index Using Fuzzy Time-Series Based on Rough Set
Authors: Ching-Hsue Cheng, Hia Jong Teoh, Tai-Liang Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Fuzzy time-series have been utilized to make predictions in various areas such as stock price forecasting, academic enrollments and weather. In the forecasting processes, Fuzzy Logical Relation (FLR) is the one of critical factors to influence forecasting accuracy. Therefore, in this paper, we propose a new fuzzy time-series method, which employs rough set theory to mine FLR in time-series and the adaptive expectations model to tune forecasting results. In the empirical analysis, we use a ten-year period of TAIEX (Taiwan Stock Exchange Capitalization Weighted Stock Index) closing prices as experimental datasets and two fuzzy time-series methods, Chen's (1996) and Yu's (2004) methods, as comparisons models. The experimental results shows that propose method outperforms the listing methods.
Abnormalities and fraud electric meter detection using hybrid support vector machine & genetic algorithm
Authors: Keem Siah Yap, Izham Z. Abidin, Abdul Rahim Ahmad, Zahrul Faizi Hussien, Hooi Loong Pok, Fariq Izwan Ismail, Abdul Malik Mohamad
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper presents an intelligent system to reduce Non Technical Loss (NTL) using hybrid Support Vector Machine (SVM) and Genetic Algorithm (GA). The main motivation for this research is to assist Sabah Electricity Sdn. Bhd. (SESB) to reduce their distribution loss, estimated around 15% at present in Sabah State, Malaysia. The hybrid algorithm is able to preselect customers to be inspected on-site for abnormalities or potential fraud according to their consumption patterns. SVM is a classification technique developed by Vapnik [1] but a practical difficulty of using SVM is the selection of parameters such as C and kernel parameter, σ in Gaussian RBF kernel. The purpose of choosing parameters is to get the best generalization performance. Genetic Algorithm (GA) is used to search for the best parameter of SVM classification by using combination of random and pre-populated genomes from Pre-Populated Database (PPD). It provides an increased convergence and globally optimized solutions. The algorithm has been tested using actual customer consumption data from SESB. 10 fold cross validation method is used to confirm the consistency of the detection accuracy. The paper also highlights comparison results between typical SVM and SVM-GA. The highest fraud detection accuracy for SVMGA is 94%.
Program Behavior
Authors: D. Ferrari
Venue: Computer (1976)

Among the performance characteristics of programs, the patterns of memory references they generate have the unique property of being totally irrelevant in a non-virtual memory context and perhaps the most important aspect of program behavior in a virtual memory system. It is because of their importance in the latter case that the referencing behavior is so often referred to as the "behavior" par excellence.
Using a Microprocessor in an Intelligent Graphics Terminal
Authors: J. Raymond
Venue: Computer (1976)

Graphic terminals allow on-line interaction between the user and his program, thereby enabling him to alter the displayed picutre according to his requirements. However, a major problem with the use of a graphic terminal is the cost associated with it. There is no doubt that low-cost graphic terminals are available, but their utility is very limited since they have no processing capability (or intelligence) and must depend on a host processor attention, while at the same time putting additional strain, on the resources of the host machine. This naturally degrades the response time, depending on the processor load at that time, On the other hand, graphic terminals which have local processing capability are very expensive. With the availability of microprocessors, it is now possible to resolve this delemma: a reasonable amount of intelligence can be added to the terminal at a very reasonable cost. Such a terminal has been developed at the University of Ottawa.
WLAN-Based Real-Time Asset Tracking System in Healthcare Environments
Authors: Jong-Hoon Youn, Hesham Ali, Hamid Sharif, Jitender Deogun, Jason Uher, Steven H. Hinrichs
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

care, accurate location information of mobile medical devices and personnel (e.g. patients or physicians) is often a major challenge. In this paper, we present a real-time asset tracking system deployed within a hospital clinic setting, which tracked a set of mobile assets using small Wi- Fi tags. The deployed system utilized radio signals received from wireless access points to estimate location of tagged assets. The system performed with resolution of within 1.5 meters, which is an acceptable range in such an environment. We developed a web-based graphical interface and a data management system which was capable of tracking and reporting status of an asset and providing an alert signal when it moved out of a designated area. Additionally, detailed logs of asset tracking information were available for archival purposes. This deployment demonstrates the feasibility of a Wi-Fi based positioning system in dynamic medical environments.
General Digit-Serial Normal Basis Multiplier with Distributed Overlap
Authors: Martin Novotny, Jan Schmidt
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

We present the architecture of digit-serial normal basis multiplier over GF(2m). The multiplier was derived from the multiplier of Agnew et al. Proposed multiplier is scalable by the digit width of general value in difference of the multiplier of Agnew et al. that may be scaled only by digit width that divides the degree m. This helps designers to trade area for speed e.g. in public-key cryptographic systems based on elliptic-curves, where m should be a prime number. Functionality of multiplier has been tested by simulation and implemented in Xilinx Virtex 4 FPGA.
Topology Control for Wireless Sensor Networks
Authors: Zhao Tao, Cai Wandong, Liu Gang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Topology control in wireless networks is important to maintain reliable communication links between base stations and nodes, and to maximize the battery life. This paper analyzes how the power control technology affects the MAC layer, network topology, routing, and energy efficiency. Then an energy aware degree-based transmission power control protocol is presented in this paper. We augment our distributed protocol with a heuristic that considers neighbor load information when making power control decisions. It limits the accretion of transmission power, particularly in loose network. Compared to traditional protocol, our protocol can improve energy efficiency and prolong network lifetime significantly, while networks connectivity is still maintained in extreme scenarios. Simulation results demonstrate our conclusion.
A Component Model for Adaptive Middleware Services and Applications
Authors: Daniel Pakkala, Juho Perala, Eila Niemela
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

This paper contributes a novel component model (called MidGate) that enables behavioral adaptation of pervasive middleware services and applications as part of a reflective middleware platform. The component model applies the concept of middleware reflection to dynamically varying computing resources. The research problem addressed in the paper is how to support a pervasive computing environment's dynamic adaptation requirements for middleware services and applications in a software component architecture. A component model, referred to as the MidGate component model, is presented as a solution to the research problem. The component model has been validated by a prototype system, given as an example in this paper.
The Semantic Web Vision: Where Are We?
Authors: Jorge Cardoso
Venue: IEEE Intelligent Systems (2007)

The full vision of the Semantic Web and its mainstream adoption is still five to 10 years away. To get a current snapshot of key trends and developments, University of Madeira researchers surveyed 627 Semantic Web researchers and practitioners to learn how they're using and interrelating semantic technologies.
Learning reinforcement strategies for a changing workforce
Authors: B. J. Garner, Elspeth McKay
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

There is increasing evidence of skill shortages in Australian commerce and industry, as global competition, changes in technology and in Government regulation place greater demands on company employees. There is, consequently, strong corporate interest in new educational paradigms, such as e-Learning, particularly web-based education, to maintain staff competences in a changing workplace environment. Simultaneously, workplace reform driven by the productivity imperative, and by unfavourable demographic changes in the Western world are increasing employee turnover and individual stress. Training managers, while addressing the corporate demands vigorously, are seriously challenged by the scope and difficulty of re-skilling a mobile and diverse workforce. Considerable difficulty, for example, has been experienced in introducing electronic content into new, or even existing, business training scenarios! While Learning Reinforcement (LR) provides a generic Framework for greater cost-effectiveness, new LR strategies are now in prospect based on our enumeration and generalisation of open learning models in professional practice, from studies of workplace training models and from results using blended LR.
Understanding and Specifying Information Security Needs to Support the Delivery of High Quality Security Services
Authors: Xiaomeng Su, Damiano Bolzoni, Pascal van Eck
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

In this paper we present an approach for specifying and prioritizing information security requirements in organizations. It is important to prioritize security requirements since hundred per cent security is not achievable and the limited resources available should be directed to satisfy the most important ones. We propose to explicitly link security requirements with the organization's business vision, i.e. to provide business rationale for security requirements. The rationale is then used as a basis for comparing the importance of different security requirements. Furthermore we discuss how to integrate the aforementioned solution concepts into a service level management process for security services, which is an important step in IT Governance. We validate our approach by way of a focus group session.
Universal instructional design for learning how to apply in a virtual world
Authors: Rebecca H. Rutherfoord, James K. Rutherfoord
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

As we examine on-line and hybrid (half on-line, half in-class) courses, many instructors are trying to find ways to "teach" their material and "engage" students in their classes. Newer research is suggesting using Universal Instructional Design techniques. Universal Instructional Design (UID) uses an approach to our teaching that consists of proactive design and use of inclusive instructional strategies that benefit the broadest range of learners. UID was developed from Universal Design that was originated in the field of architecture to meet the needs of a diverse population. We know that our diversity in our classrooms is expanding. In addition, our on-line and hybrid courses have additional demands to engage our students. We can actually use technology as a critical tool for creating these inclusive courses. We can have much greater flexibility in instructional format and be able to expand on our resources and options. This paper will look at ways in which we can address UID in our on-line and hybrid environments. Examples of techniques and environments will be discussed. As we move to more and more virtual "classrooms", faculty need to be cognizant of various methods that will reach the most student.
Empirical characterization of random forest variable importance measures
Authors: Kellie J. Archer, Ryan V. Kimes
Venue: Computational Statistics Data Analysis (2008)

Microarray studies yield data sets consisting of a large number of candidate predictors (genes) on a small number of observations (samples). When interest lies in predicting phenotypic class using gene expression data, often the goals are both to produce an accurate classifier and to uncover the predictive structure of the problem. Most machine learning methods, such as k-nearest neighbors, support vector machines, and neural networks, are useful for classification. However, these methods provide no insight regarding the covariates that best contribute to the predictive structure. Other methods, such as linear discriminant analysis, require the predictor space be substantially reduced prior to deriving the classifier. A recently developed method, random forests (RF), does not require reduction of the predictor space prior to classification. Additionally, RF yield variable importance measures for each candidate predictor. This study examined the effectiveness of RF variable importance measures in identifying the true predictor among a large number of candidate predictors. An extensive simulation study was conducted using 20 levels of correlation among the predictor variables and 7 levels of association between the true predictor and the dichotomous response. We conclude that the RF methodology is attractive for use in classification problems when the goals of the study are to produce an accurate classifier and to provide insight regarding the discriminative ability of individual predictor variables. Such goals are common among microarray studies, and therefore application of the RF methodology for the purpose of obtaining variable importance measures is demonstrated on a microarray data set.
ClusterDraw web server
Authors: Dmitri Papatsenko
Venue: Bioinformatics (2007)

ClusterDraw is a program aimed to identification of binding sites and binding-site clusters. Major difference of the ClusterDraw from existing tools is its ability to scan a wide range of parameter values and weigh statistical significance of all possible clusters, smaller than a selected size. The program produces graphs along with decorated FASTA files. ClusterDraw web server is available at the following URL: http://flydev.berkeley.edu/cgi-bin/cld/submit.cgi Contact: dxp@berkeley.edu Supplementary information: Supplementary data are available at Bioinformatics online.