ppxscal/embedding_network huggingface dataset:
Combining Classification Improvements by Ensemble Processing
Authors: Naohiro lshii, Eisuke Tsuchiya, Yongguang Bao, Nobuhiko Yamaguchi
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The k-nearest neighbor (KNN) classification is a simple and effective classification approach. However, improving performance of the classifier is still attractive. Combining multiple classifiers is an effective technique for improving accuracy. There are many general combining algorithms, such as Bagging, Boosting, or Error Correcting Output Coding that significantly improve the classifier such as decision trees, rule learners, or neural networks. Unfortunately, these combining methods developed do not improve the nearest neighbor classifiers. In this paper, first, we present a new approach to combine multiple KNN classi- fiers based on different distance functions, in which we apply multiple distance functions to improve the performance of the k-nearest neighbor classifier. Second, we develop a combining method, in which the weights of the distance function, are learnt by genetic algorithm. Finally, combining classifiers in error correcting output coding, are discussed. The proposed algorithms seek to increase generalization accuracy when compared to the basic k-nearest neighbor algorithm. Experiments have been conducted on some benchmark datasets from the UCI Machine Learning Repository. The results show that the proposed algorithms improve the performance of the k-nearest neighbor classi- fication.
Dynamic Energy Efficient TDMA-based MAC Protocol forWireless Sensor Networks
Authors: Sungrae Cho, Kalyani Kanuri, Jin-Woong Cho, Jang-Yeon Lee, Sun-Do June
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The design of medium access control (MAC) in wireless sensor networks (WSNs) poses several key factors such as energy conservation, bandwidth utilization, throughput, etc. This paper proposes a new MAC protocol referred to as DEE-MAC which reduces energy consumption by making the idle nodes sleep to reduce idle listening using synchronization at cluster heads. Each cluster is dynamically formed as all nodes contend for the position of cluster-head and join and leave process is freely done. Simulation result shows that the proposed MAC protocol outperforms other existing MAC protocol.
An Experimental Investigation of Formality in UML-Based Development
Authors: Lionel C. Briand, Yvan Labiche, Massimiliano Di Penta
Venue: IEEE Transactions on Software Engineering (2005)

The Object Constraint Language (OCL) was introduced as part of the Unified Modeling Language (UML). Its main purpose is to make UML models more precise and unambiguous by providing a constraint language describing constraints that the UML diagrams alone do not convey, including class invariants, operation contracts, and statechart guard conditions. There is an ongoing debate regarding the usefulness of using OCL in UML-based development, questioning whether the additional effort and formality is worth the benefit. It is argued that natural language may be sufficient, and using OCL may not bring any tangible benefits. This debate is in fact similar to the discussion about the effectiveness of formal methods in software engineering, but in a much more specific context. This paper presents the results of two controlled experiments that investigate the impact of using OCL on three software engineering activities using UML analysis models: detection of model defects through inspections, comprehension of the system logic and functionality, and impact analysis of changes. The results show that, once past an initial learning curve, significant benefits can be obtained by using OCL in combination with UML analysis diagrams to form a precise UML analysis model. But, this result is however conditioned on providing substantial, thorough training to the experiment participants.
A measurement study of network efficiency for TWAREN IPv6 backbone
Authors: Tin-Yu Wu Han-Chieh Chao
Venue: International Journal of Network Management (2005)

The Advanced Research and Education Network (TWAREN) was established by the National Centre for High-Performance Computing. It provides advanced research and education in Taiwan. TWAREN supports the IPv4 and IPv6 protocols. This paper analyses network efficiency under the IPv6 structures. The TWAREN test will focus on the traffic issue for all fixed-size packets. The purpose of this test is to determine packet loss under the maximum packet transfer situation. We measure the network throughput under the maximum speed and the latency associated with each packet. Using that information, we in turn derive the needed data on IPv6 TCP/UDP bandwidth and packet loss under the TWAREN structure.
Multistage Quasi-Orthogonal Minimum Output Energy Multiuser Detector Analysis for Convolutionally Coded CDMA Systems in Frequency-Selective Fading
Authors: Mohamed Moustafa, Abd-El Aziz Moustafa
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The paper presents the performance analysis of the multistage quasi-orthogonal minimum output energy (QOMOE) detector for a convolutionally coded synchronous CDMA systems in frequency selective fading environment. The QOMOE detector minimizes the output variance with respect to the component equivalent to the quasi-orthogonal component to the desired user's signature waveform, then the solution is the Linear Minimum Mean Square Error (LMMSE) transformation. The QOMOE receiver employs maximal-ratio combiner (MRC) for detecting the desired user. A comparison is made among multistage detectors, namely; QOMOE-MRC, matched filter (MF-MRC), decorrelator-MRC, LMMSE-MRC and blind adaptive-MRC receivers, in a frequency selective fading channel. Analysis and simulation results show that the multistage QOMOE-MRC can obtain better performance than that of other considered detectors.
Review of "Slamming Spam: A Guide for System Adminstrators by Robert Haskins and Dale Nielsen", Addison-Wesley Professional, 2004, $44.99 ISBN: 0131467166
Authors: J. S. Edwards
Venue: Queue (2005)

Robert Haskins, Dale Nielsen Addison-Wesley Professional, 2004, $44.99 ISBN: 0131467166 First of all, before reading this book, you must realize there is no magic bullet to counteract spam. As the authors point out, “The problem is largely based upon your perspective.” One person’s spam is another’s legitimate mass mailing. Until society—and its laws, regulations, and technology—decides to address the issue, spam will be a fact of life. In this book, the authors set out to advise system administrators on how to combat this adversary. The authors have set up a Web site (http://www.slammingspam.com) with updates, including URLs, errata, and other information. This is to be commended, as the fight will be played out on a moving battlefield.
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
Authors: Jan Denef, Frederik Vercauteren
Venue: Journal of Cryptology (2006)

We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for odd characteristic. Given a genus g hyperelliptic curve defined over Fqn, the average-case time complexity is O(g4 + &#x03b5; n3 + &#x03b5;) and the average-case space complexity is O(g3 n3), whereas the worst-case time and space complexities are O(g5 + &#x03b5; n3 + &#x03b5;) and O(g4 n3), respectively.
An ontology-based context management and reasoning process for UbiComp applications
Authors: Eleni Christopoulou, Christos Goumopoulos, Achilles Kameas
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

UbiComp applications operate within an extremely dynamic and heterogeneous environment and have to dynamically adapt to changes in their environment as a result of users' or other actors' activities. So context definition, representation, management and use become important factors that affect their operation. To ease the development of such applications it is necessary to decouple application composition from context acquisition and representation, and at the same time provide universal models and mechanisms to manage context. In this paper is presented an approach for building a context-aware UbiComp system organised in hierarchical levels. The focus of the paper is on an ontology-based context modelling, management and reasoning process developed for composing context-aware UbiComp applications from AmI artefacts.
The Multi-version and Single-display Strategy in Undo Scheme
Authors: Jiangming Yang, Qiwei Zhang, Ning Gu, Genxing Yang, Zhenyu Liu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Consistency maintenance is one of the most significant challenges in groupware systems. In groupware systems, the effect of incorrect execution will be more extensive for it is done in distributed group editors, so the user will have more dependence on Undo. While intention violation puzzle has never been addressed in any published work, it will destroy the consistency and lead to a crash. We propose a Mark and Retracing based method to reach the goal of consistency maintenance and achieve Multi-version and Singledisplay strategy in undo scheme. It is different from operation transformation method and provides a new perspective into group editors.
Directed Exploration Using a Modified Distance Transform
Authors: Trevor Taylor, Shlomo Geva, Wageeh W. Boles
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Mobile robots operating in unknown environments need to build maps. To do so they must have an exploration algorithm to plan a path. This algorithm should guarantee that the whole of the environment, or at least some designated area, will be mapped. The path should also be optimal in some sense and not simply a "random walk" which is clearly inefficient. When multiple robots are involved, the algorithm also needs to take advantage of the fact that the robots can share the task. In this paper we discuss a modification to the well-known distance transform that satisfies these requirements.
A virtual class calculus
Authors: Erik Ernst, Klaus Ostermann, William R. Cook
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They resemble inner classes, which are also defined within a class, but virtual classes are accessed through object instances, not as static components of a class. When used as types, virtual classes depend upon object identity -- each object instance introduces a new family of virtual class types. Virtual classes support large-scale program composition techniques, including higher-order hierarchies and family polymorphism. The original definition of virtual classes in BETA left open the question of static type safety, since some type errors were not caught until runtime. Later the languages Caesar and gbeta have used a more strict static analysis in order to ensure static type safety. However, the existence of a sound, statically typed model for virtual classes has been a long-standing open question. This paper presents a virtual class calculus, VC, that captures the essence of virtual classes in these full-fledged programming languages. The key contributions of the paper are a formalization of the dynamic and static semantics of VC and a proof of the soundness of VC.
Supporting Activity Awareness for Teams-Games-Tournaments with GSM Network
Authors: Chen-Chung Liu, Shu-Yuan Tao, Jinu-Ning Nee, Baw-Juiune Liu, Gwo-Dong Chen, Ching-Chi Hsu, Jorng-Tzong Horng
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

The Internet can be used to promote collaborative learning among students. However, since the web-based collaborative learning environment relies entirely on the availability of computers and the Internet, students do not always have access to the system, leading to doubt in the interaction among the students, and reducing the effectiveness of collaborative learning. For this reason, this study employed the activity monitoring and ubiquitous activity awareness through SMS messages in a GSM network to enhance the learning activity awareness. In the experimental stage, a web-based TGT collaborative learning activity was conducted at an undergraduate university. The analytical results demonstrate that awareness of the collaborative learning context significantly increased student participation in learning activity and improving student performance.
A Verification Methodology for Reconfigurable Systems
Authors: M. Borgatti, A. Fedeli, U. Rossi, J.-L. Lambert, I. Moussa, F. Fummi, C. Marconcini, G. Pravadelli
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

In the frame of the Symbad project, an industrial design flow for reconfigurable SoC's is analyzed by a pool of experts in high-level formal proof tools. The goal of Symbad is to introduce formal verification along this flow. As a consequence, formal verification is applied to specific problems related to reconfigurability. The focus of the paper is on the SymbC tool, which is applied during the HW virtualization phase, when it is mandatory to assure that a task mapped on FPGA is available at the time of its call.
Supporting Adaptable Consistency Control in Structured Collaborative Workspaces
Authors: Yi Yang, Du Li
Venue: Computer Supported Cooperative Work (2005)

Consistency control is a critical issue in collaborative systems. Supporting flexible consistency control in particular matches the dynamic and situated needs of cooperative work. However, previous approaches generally provide only limited flexibility due to their static binding between shared data objects and consistency control protocols. We propose a component-based framework that allows for the runtime plug-n-play of consistency protocols in collaborative systems. We model data and protocols in a way such that they are cleanly separated and can be dynamically bound at run time to achieve flexible control. Data-protocol bindings can happen at the property, object, and workspace levels. The framework provides reusable services for implementing adaptable consistency control in a range of collaborative workspace applications.
Logic Circuit Design Based on MOS-NDR Devices and Circuits Fabricated by CMOS Process
Authors: Kwang-Jow Gan, Dong-Shong Liang, Chung-Chih Hsiao, Shih-Yu Wang, Feng-Chang Chiang, Cher-Shiung Tsai, Yaw-Hwang Chen, Shun-Huo Kuo, Chi-Pin Chen
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

We propose a new MOS-NDR device that is composed of the metal-oxide-semiconductor field-effect-transistor(MOS) devices. This device could exhibit the negative differential resistance (NDR) characteristics in the current-voltage characteristics by suitably modulating the MOS parameters. We design a logic circuit which can operate the inverter, NOR, and NAND gates. The devices and circuits are fabricated by the standard 0.35µm CMOS process.
Quantifying the Gap between Embedded Control Models and Time-Triggered Implementations
Authors: Hakan Yazarel, Antoine Girard, George J. Pappas, Rajeev Alur
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Mapping a set of feedback control components to executable code introduces errors due to a variety of factors such as discretization, computational delays, and scheduling policies. We argue that the gap between the model and the implementation can be rigorously quantified leading to predictability if the implementation is viewed as a sequence of control blocks executed in statically allocated time slots on a time-triggered platform. For linear systems controlled by linear controllers, we show how to calculate the exact error between the model-level semantics and the execution semantics of an implementation, allowing us to compare different implementations. The calculated error of different implementations is demonstrated using simulations on illustrative examples.
A flexible data mining architecture for monitoring data streams
Authors: Ahmet Bulut
Venue:  (2005)

Data streams are ubiquitous: performance measurements in business process management, faults and alarms in network traffic management, transactions in retail chains, ATM operations in banks, log records generated by web servers, and sensor network data are some specific examples. In almost all of these applications, the data volume is massive, up to several terabytes. Data volume increases even further with the rapid arrival of new tuples. Traditional DBMS's are ill-equipped for processing of data streams in real time, and do not provide adequate support for handling continuous queries posed over these streams. This dissertation outlines models and issues towards designing an efficient Data Stream Management System (DSMS) called Stardust. The system can handle a diverse set of continuous queries that fit naturally into the mold of data stream applications. We developed wavelet-based approximation schemes that maintain multiple levels of information over streams of data in order to answer queries efficiently. In centralized DSMS models, a stream is summarized at a central site, and all user queries are processed at this site. In data and query intensive environments, the central site can become a bottleneck. As a remedy to this problem, we developed adaptive replication algorithms for dissemination of stream summaries computed at a central site to interested clients. We tested the distributed version of the system on a number of testbeds. In the first scenario, Stardust exploits the scalability and load balancing of communication provided by content-based routing schemes for efficient distributed stream processing. In the second scenario, we integrated Stardust into a real-time decision support system for nondestructive health monitoring using a wireless network of sensors. The system trades off accuracy for efficient processing of sensor data in order to save the communication overhead and power-consumption. Finally, we built an event detection framework for monitoring a set of distributed network elements. The goal is to detect potentially interesting incidents specified by users in terms of a multitude of race conditions across a set of routers while maintaining a low monitoring overhead.
Prediction of the Stock Exchange of Thailand Using Adaptive Evolution Strategies
Authors: Sunisa Rimcharoen, Daricha Sutivong, Prabhas Chongstitvatana
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper we present a prediction process of the Stock Exchange of Thailand index using adaptive evolution strategies. The prediction process does not require the knowledge of the functional form a priori. In each recursion step, genetic algorithm is used to evolve the structure of the prediction function, whereas the coefficient is evolved by evolution strategies. The proposed method has been shown to successfully predict the Stock Exchange of Thailand and returns an error less than 3%. This methodology is also a tool for knowledge discovery in a specific application. We have found that the SET index can be reasonably forecasted with only two factors: the Hang Seng index and Minimum Loan Rate. The proposed method also achieves a lower prediction error when compared with multiple regression method.
The implementation of ada 2005 synchronized interfaces in the GNAT compiler
Authors: Javier Miranda, Edmond Schonberg, Hristian Kirtchev
Venue: ACM SIGAda Ada Letters (2005)

One of the most important object-oriented features of the new revision of the Ada Programming Language is the introduction of Abstract Interfaces to provide a form of multiple inheritance. Ada 2005 Abstract Interface Types are akin to Java interfaces, and as such support inheritance of specification rather than inheritance of implementation. Ada 2005 interfaces apply as well to tasks and protected types, and provide a classification mechanism for concurrent programming that goes considerably beyond the capabilities of Java.This paper summarizes the implementation in the GNAT compiler of the various kinds of interfaces that relate to concurrent programming in Ada 2005 [1]. The implementation is efficient, and involves mostly modifications to the compiler front-end, with virtually minimal impact on run-time structures, beyond those that are in place to support regular interfaces. However, the implementation of interface operations as triggers in selective waits and asynchronous transfers of control proved to be surprisingly delicate and requires additional predefined primitive operations.
Equation-based TCP-friendly congestion control under lossy environment
Authors: S. W. Ng, Edward Chan
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

A major problem in supporting multimedia streaming in the Internet is that the streaming protocol used tends to take bandwidth away from competing TCP traffic streams. Thus it is important to devise rate based protocols that are TCP-friendly. In the paper we examine the effectiveness of two important models in devising TCP-friendly rate based protocols in lossy environment such as wireless networks. Using simulation for a variety of network scenarios, it is shown that the rate based protocols based on one model underestimates while the other overestimates TCP bandwidth in the presence of errors. A modification is made to the models which allows us to construct a rate based protocol that can track TCP bandwidth better in the presence of random error and hence exhibit behavior that is more TCP-friendly.
An Ant Algorithm for Single-Hop Wavelength Assignment in WDM Mesh Network
Authors: Tan Saw Chin
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

A RWA linear programming formulation was formulated and ILP solver was used along with good approximation techniques (heuristic) to solve the static RWA problem The objective was to maximize the one hop traffic, given a set of lightpath requests/traffic demand. However, the proposed heuristic has the limitation of stagnation. Thus we applied Ant Colony Optimization (ACO) combined with heuristic algorithm to solve the assignment problem to obtain best assignment with highest objective value. The ACO based algorithm can outperform the comparison scheme and provide a better performance and more reliable than the proposed heuristic and ILP solver. The claim made in the paper for the proposed new heuristic and ACO are supported by experimental results.