ppxscal/embedding_network huggingface dataset:
An analysis of a communication network structure on BBS in an e-learning course
Authors: Koichi Yasutake, Takahiro Tagawa, Osamu Yamakawa, Hitoshi Inoue
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

At the last Annual Conference of Japan Society of Educational Technology (JSET) in 2005 and the Third WebCT Workshop in Japan, we have proposed a new mathematical analysis method of learning process via e-Learning which applied Complex Networks Theory. There, we have indicated that it is possible to identify some characteristics of communication network structure from log data of Bulletin Board System (BBS). The purpose of this paper is to develop the former studies and to clarify the following matters that is: 1) Uneven distribution in terms of network centrality and clustering coefficient is found in the learners' network structure which is formed on a virtual learning environment such as BBS: 2) The centrality and the coefficient are correlated; 3) Some interesting characteristics are observed among Knowledge Transforming Process, Knowledge Telling Process, and the learners' communication network structure.
Minicomputers: Trends and Applications
Venue: Computer (1972)

"Minicomputers - Trends and Applications" was the title of a symposium held at the National Bureau of Standards on March 1, 1972. Attended by a capacity audience of over 640, the symposium was sponsored by the IEEE Computer Society's Eastern Area Committee and Washington, D. C. Chapter. Chairman of the symposium was James A. Cunningham of the National Weather Service who was assisted by Program Co-chairmen Thomas N. Pyke, Jr., of NBS nd Paul L. Hazan of the Singer Company as well as other active Washington area Computer Society members. Welcoming remarks were given by Dr. Ruth M. Davis, Director of the NBS Center for Computer Sciences and Technology. The keynote address, "Minicomputers - A Challenge in the 70's", was presented by Kenneth Olsen, President of the Digital Equipment Corporation. Speakers and panel members were chosen to represent a broad perspective of the field. Included in the program were two panel discussions intended to furnish practical advice to users on the proper selection and use of minicomputers. 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
Towards automatic model synchronization from model transformations
Authors: Yingfei Xiong, Dongxi Liu, Zhenjiang Hu, Haiyan Zhao, Masato Takeichi, Hong Mei
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The metamodel techniques and model transformation techniques provide a standard way to represent and transform data, especially the software artifacts in software development. However, after a transformation is applied, the source model and the target model usually co-exist and evolve independently. How to propagate modifications across models in different formats still remains as an open problem. In this paper we propose an automatic approach to synchronizing models that are related by model transformations. Given a unidirectional transformation between metamodels, we can automatically synchronize models in the metamodels by propagating modifications across the models. We have implemented a model synchronization system supporting the Atlas Transformation Language (ATL) and have successfully tested our implementation on several ATL transformation examples in the ATL web site.
Raster databases
Authors: Peter Baumann
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Since the launch of Google Earth at the latest it is clear that online services for multi-Terabyte satellite imagery are becoming integral part of our Internet experience. Actually, 2-D imagery is but the tip of the iceberg - the general concept of multi-dimensional spatio-temporal raster data covers 1-D sensor time series, 2-D imagery, 3-D image time series (x/y/t) and exploration data (x/y/z), 4-D climate models (x/y/z/t), and many more.
Design and characterization of high-voltage NMOS and PMOS devices in standard 0.25µm CMOS technology
Authors: Xiaoliang Han, Chihao Xu
Venue: Microelectronics Journal (2007)

This paper presents the design of high-voltage NMOS and PMOS devices with shallow trench isolation (STI) in standard 0.25@mm/5V CMOS technology. Breakdown voltages of 20V for n-channel device with a specific on resistance of 1.06m@Wcm^2 and -20V for p-channel device with a specific on resistance of 2.83m@Wcm^2 have been achieved without any modification of existing standard CMOS process.
Automated Rule-Based Diagnosis through a Distributed Monitor System
Authors: Gunjan Khanna, Mike Yu Cheng, Padma Varadharajan, Saurabh Bagchi, Miguel P. Correia, Paulo J. Veríssimo
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

In today's world where distributed systems form many of our critical infrastructures, dependability outagesare becoming increasingly common. In many situations, it is necessary to not just detect a failure, but alsoto diagnose the failure, i.e., to identify the source of the failure. Diagnosis is challenging since highthroughput applications with frequent interactions between the different components allow fast errorpropagation. It is desirable to consider applications as black-boxes for the diagnostic process. In thispaper, we propose a Monitor architecture for diagnosing failures in large-scale network protocols. TheMonitor only observes the message exchanges between the protocol entities (PEs) remotely and doesnot access internal protocol state. At runtime, it builds a causal graph between the PEs based on theircommunication and uses this together with a rule base of allowed state transition paths to diagnose thefailure. The tests used for the diagnosis are based on the rule base and are assumed to have imperfectcoverage. The hierarchical Monitor framework allows distributed diagnosis handling failures at individualMonitors. The framework is implemented and applied to a reliable multicast protocol executing on ourcampus-wide network. Fault injection experiments are carried out to evaluate the accuracy and latency ofthe diagnosis.
Orientable embedding genus distribution for certain types of graphs
Authors: Liangxia Wan, Yanpei Liu
Venue: Journal of Combinatorial Theory Series B (2008)

In this paper, on the bases of joint trees for a graph introduced by Liu, a surface generating method is developed to determine embedding genus distribution of a graph.
A Dynamic System for Personal Communications: The Opportunistic Chat
Authors: Salvatore Sorce, Francesco Cinquegrani, Salvatore Anzalone, Dario Caccia, Antonio Gentile, Alessandro Genco
Venue: Proceedings of the The 2007 International Conference on Intelligent Pervasive Computing (2007)

such systems need to be connected to some centralized entity which goal is to supply them with information needed to make the communication possible, such as the list of connected users, their status, and the address of their devices. Our proposed system for an "Opportunistic Chat" allows people to exchange written messages over Bluetooth and (if necessary) TCP/IP connections, with no need of any kind of centralized entity, by using ad-hoc procedures, automatically selected and operated. Such system can be accessed almost from any kind of device, either mobile or not, ranging from personal mobile devices (such as cellular phones and PDAs) to laptops and PCs.
Context-Awareness of Content Delivery Service Based on Location Estimate with an Active RFID system
Authors: Tomohisa Yamashita, Daisuke Takaoka, Noriaki Izumi, Akio Sashima, Koichi Kurumatani, Koiti Hasida
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper, to tackle with uncertainty in the real world, the light-weight ontology drive approach is proposed for the realization of context dependent services. We concentrate on position information and an operation history, as a user's context, and develop our location-aware content delivery system. The evaluation experiment of our location estimate engine is performed in Akihabara Software Showcase at Information Technology Research Institute. Furthermore, through the proofing experiment in Expo 2005 Aichi, our proposed architecture is confirmed to enables us to realize the real world application of context dependency. Finally, we compare our location-aware content delivery system and related researches, and discus the advantage of our system.
On SPARC LEON-2 ISA extensions experiments for MPEG encoding acceleration
Authors: P. Guironnet de Massas, P. Amblard, F. Pétrot
Venue: VLSI Design (2007)

This paper presents the necessary steps to modify the implementation of the SPARCV8 architecture to enhance it with multimedia-oriented instructions. The purpose is improving video compression performance without designing dedicated coprocessors. We investigate the complexity of modifying a standard processor instruction set and show that, although not trivial, this is feasible in a few weeks. We implemented 12 new instructions and use some of them to optimize the computation of a demanding step of the MPEG encoding. The result is a performance increase of 67% in the execution of a part of this algorithm, allowing us to expect a 30% speedup in the execution of an MPEG video compression. The area increase of the integer unit is about 18% and the clock frequency is not significantly modified in an LEON-2 implementing 6 among 12 of the new instructions.
Characterizing the generalized lambda distribution by L-moments
Authors: Juha Karvanen, Arto Nuutinen
Venue: Computational Statistics Data Analysis (2008)

The generalized lambda distribution (GLD) is a flexible four parameter distribution with many practical applications. L-moments of the GLD can be expressed in closed form and are good alternatives for the central moments. The L-moments of the GLD up to an arbitrary order are presented, and a study of L-skewness and L-kurtosis that can be achieved by the GLD is provided. The boundaries of L-skewness and L-kurtosis are derived analytically for the symmetric GLD and calculated numerically for the GLD in general. Additionally, the contours of L-skewness and L-kurtosis are presented as functions of the GLD parameters. It is found that with an exception of the smallest values of L-kurtosis, the GLD covers all possible pairs of L-skewness and L-kurtosis and often there are two or more distributions that share the same L-skewness and the same L-kurtosis. Examples that demonstrate situations where there are four GLD members with the same L-skewness and the same L-kurtosis are presented. The estimation of the GLD parameters is studied in a simulation example where method of L-moments compares favorably to more complicated estimation methods. The results increase the knowledge on the distributions that belong to the GLD family and can be utilized in model selection and estimation.
Use of a Confusion Network to Detect and Correct Errors in an On-Line Handwritten Sentence Recognition System
Authors: Solen Quiniou, Eric Anquetil
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we investigate the integration of a confusion network into an on-line handwritten sentence recognition system. The word posterior probabilities from the confusion network are used as confidence scored to detect potential errors in the output sentence from the Maximum A Posteriori decoding on a word graph. Dedicated classifiers (here, SVMs) are then trained to correct these errors and combine the word posterior probabilities with other sources of knowledge. A rejection phase is also introduced in the detection process. Experiments on handwritten sentences show a 28.5 % relative reduction of the word error rate.
Comment on "Serial Binary-to-Decimal and Decimal-to-Binary Conversion"
Authors: D. Horelick
Venue: IEEE Transactions on Computers (1971)

In the above article1Rhyne describes a technique for serial binary to BCD (and BCD to binary) conversion using a single clock pulse per bit, as opposed to the two clock per bit method described earlier by Couleur [1]. Although Rhyne may be correct that his method has not been published in the official "scientific engineering" literature, it turns out that this same method has been publi 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
Branch Misprediction Prediction: Complementary Branch Predictors
Authors: Resit Sendag, Joshua Yi, Peng-fei Chuang
Venue: IEEE Computer Architecture Letters (2007)

Although high branch prediction accuracy is necessary for good performance, the cost of achieving such accuracy requires using a branch predictor that could either be too complex and/or large, which, due to higher latencies and misprediction penalty, could actually result in lower performance. Since these mechanisms are ultimately self-defeating, fundamentally different branch predictors are needed. In this paper, we propose a new class of branch predictors, complementary branch predictors, which can be easily added to any branch predictor to improve the overall prediction accuracy. This mechanism differs from conventional branch predictors in that it focuses only on mispredicted branches. As a result, this mechanism has the advantages of scalability and flexibility (can be implemented with any branch predictor), but is not on the critical path. More specifically, this mechanism improves the branch prediction accuracy by predicting which future branch will be mispredicted next and when that will occur, and then it changes the predicted direction at the predicted time. Our results show that a branch predictor with the branch misprediction predictor achieves the same prediction accuracy as a conventional branch predictor that is 4 to 16 times larger, but without significantly increasing the overall complexity or lengthening the critical path.
Towards Stateless Single-Packet IP Traceback
Authors: Rafael P. Laufer, Pedro B. Velloso, Daniel de O. Cunha, Igor M. Moraes, Marco D. D. Bicudo, Marcelo D. D. Moreira, Otto Carlos M. B. Duarte
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The current Internet architecture allows malicious nodes to disguise their origin during denial-of-service attacks with IP spoofing. A well-known solution to identify these nodes is IP traceback. In this paper, we introduce and analyze a lightweight single-packet IP traceback system that does not store any data in the network core. The proposed system relies on a novel data structure called Generalized Bloom Filter, which is tamper resistant. In addition, an efficient improved path reconstruction procedure is introduced and evaluated. Analytical and simulation results are presented to show the effectiveness of the proposed scheme. The simulations are performed in an Internet-based scenario and the results show that the proposed system locates the real attack path with high accuracy.
Technological and Cultural aspects of the use of Mobile Marketing Evidence from Cyprus
Authors: Despo Ktoridou, Epaminondas Epaminonda, Demetris Vrontis
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Mobile Marketing (M-Marketing) has recently started to emerge as a potential marketing communication tool. Handheld or mobile devices - one of the most promising related technologies - are increasingly used as powerful promotional techniques. It can be argued that enhanced communication and information delivery, enabled by mobile technologies, have facilitated the work of marketers and businessmen. Even though these new technologies offer new opportunities in some markets they may not easily be deployed due to cultural, technological and implementation problems.
The "Spree" Expert Finding System
Authors: Florian Metze, Christian Bauckhage, Tansu Alpcan
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper proposes a system to facilitate exchange of information by automatically finding experts, competent in answering a given question. Our objective is to provide an online tool, which enables individuals within a potentially large organization to search for experts in a certain area, which may not be represented in company organization or reporting lines. The advantage of the proposed system over standard forums or group-ware systems is that full-formatted questions can be compared to stored qualification profiles, which were automatically derived from documents, without Human search effort, and possibly refined manually. This allows us to find competent colleagues (or helpful literature such as How-Tos) for a given problem in a single step, and without intermediate iterations. The system is symmetric in that it does not distinguish between "questioners" (asking questions) and "experts" (answering them), therefore forming a "community" of users, which are distributed over an ontology covering the total knowledge. This ontology can either be given (i.e. in the form of an organizational chart), or it can be derived from the experts' knowledge.
A Modular Architecture for Providing Carrier-Grade SIP Telephony Services
Authors: Hechmi Khlifi, Jean-Charles Gregoire
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

We discuss the development of carrier-grade telephony services in SIP environments. We review available ap- proaches to build SIP applications, introduce a new ar- chitecture to provide SIP telephony services and discuss available technologies to implement this architecture. The architecture addresses the modularity, flexibility and scal- ability requirements for mass-market deployment of tele- phony services. It is based on the concept of separation between application logic and network functionalities and, at the network level, between signaling and media process- ing. Parlay, a set of standard object-oriented and signaling protocol-neutral APIs, is used to allow applications to ac- cess network functionalities and SIP is used to invoke media capabilities. We have built a soft-switch prototype based on the architecture. We describe the implementation and the lessons we have learned from this experience.
ISP: A Notation to Describe A Computer's Instruction Sets
Authors: M. Barbacci, C. G. Bell, D. Siewiorek
Venue: Computer (1973)

The ISP (for Instruction Set Processor) notation was developed for a text [Bell& Newell, 1971] to precisely describe the programming level of a computer in terms of its Memory, Instruction Format, Data Types, Data Operations, Interpreting a Specific Instruction Set.
A New Differential Evolution for Discontinuous Optimization Problems
Authors: Jihui Zhang, Junqin Xu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper presents a stochastic method based on the differential evolution (DE) to address a wide range of discontinuous optimization problems such as scheduling and multi-item inventory control. DE is a novel evolutionary approach capable of handling non-differentiable, nonlinear and multi-modal objective functions. Previous studies have shown that DE is an efficient, effective and robust evolutionary algorithm, but it is not used to solve discontinuous problems. A novel solution encoding mechanism is used to handle discrete variables. In order to improve its search effciency, a local search procedure is designed. Its performance is tested by some well known benchmark problems. Finally, it is used to solve a multi-item inventory problem which is a complicated mixed integer nonlinear optimization with complex constraints. Numerical results shown the useful of our method.
Performance Degradation of IEEE 802.15.4 Slotted CSMA/CA due to Hidden Nodes
Authors: Manjukumar Harthikote-Matha, Tarun Banka, Anura P. Jayasumana
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

As sensor nodes are subject to strict power limitations and often deployed in harsh environments, there is significant potential for a node to be hidden from another node. The impact of hidden nodes on performance of the IEEE 802.15.4 Low-Rate Wireless Personal Area Network protocol is evaluated. At lower Tx power, as a result of hidden nodes, there are more collisions in the network increasing the cost of packet delivery. The simulation results indicate that there exists an optimum transmission power that minimizes the impact of hidden nodes, and it depends on factors such as network load, desired throughput and beacon order. Results indicate that additional throughput gain and lower cost per packet delivered can be achieved by increasing the beacon order at higher Tx power.
Interactivity in Legal Web Courses through Direct Response Systems
Authors: Michael Sonntag
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

A typical difficulty in lectures held over the web is a lack of interactivity. Although ICT usually provides two-way communication, it is still reduced in modality compared to presence courses. This is problematic in the area of legal teaching, especially in practices where the typical didactic setting is discussing cases. Enhancing the reverse communication direction, from learners to the teacher, is possible through direct response systems, which are known from classroom settings. Transferred to the web these can be modeled as brief surveys. Through formalized feedback they provide teachers with a summary of the learner's understanding, and learners with some self-assessment. Such a didactic tool has been successfully employed in the practice part of a legal course. This paper reports results of the accompanying study, identifies different learner groups and the influence of this approach on their learning, and proposes improvements.
Genetic evolutionary algorithm for static traffic grooming to SONET over WDM optical networks
Authors: Kuntal Roy, Mrinal K. Naskar
Venue: Computer Communications (2007)

In recent years, minimization of SONET-ADMs (Synchronous Optical NETwork-Add-Drop Multiplexers) in WDM (Wavelength Division Multiplexing) optical networks has gained a lot of attention in both the research and commercial arenas. This motivates the research presented in this article. The enhanced searching capability of genetic evolutionary algorithm has been exploited for this purpose. The individuals (chromosomes) have been represented by different sequence of the calls in the traffic matrix. A simple algorithm that minimizes the number of required ADMs based on the shortest path and a possible alternate shortest path has been applied. Some good chromosomes based on some intuitive reasoning have been introduced in the initial population to enhance the convergence of the proposed genetic evolutionary algorithm. The distinguished feature of the proposed algorithm is in introducing the catalyst to direct the convergence of genetic evolutionary algorithm towards its solution. However, the catalyst has been kept small enough to be able to bias the solution. To establish the effectiveness of the proposed algorithm, the simulation results are compared with that of presented in literature with same network configuration and traffic matrix.