ppxscal/embedding_network huggingface dataset:
On Frequency Synchronization of e-Learning Web System Users
Authors: Romuald Mosdorf, Bozena Ignatowska
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The aim of the paper was the identification of frequency synchronization phenomenon occurring between different groups of e-learning system users. The changes in time of daily logs of: administration workers, teachers and students have been analyzed. The following analyses: correlation, Fourier and wavelet have been used to identify the nature of data. Basing on the wavelet analysis it has been proposed the new criterion of evaluation of frequency synchronization of two chaotic systems. The modified wavelet power spectrum has been used to identify the frequency synchronization between chaotic behaviors of three groups of users of e-learning web system. Obtained results have shown that the proposed method is useful for analyzing the phenomena of frequency synchronization of user groups of e-learning system.
Accounting for cache-related preemption delay in dynamic priority schedulability analysis
Authors: Lei Ju, Samarjit Chakraborty, Abhik Roychoudhury
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Recently there has been considerable interest in incorporating timing effects of microarchitectural features of processors (e.g. caches and pipelines) into the schedulability analysis of tasks running on them. Following this line of work, in this paper we show how to account for the effects of cache-related preemption delay (CRPD) in the standard schedulability tests for dynamic priority schedulers like EDF. Even if the memory space of tasks is disjoint, their memory blocks usually map into a shared cache. As a result, task preemption may introduce additional cache misses which are encountered when the preempted task resumes execution; the delay due to these additional misses is called CRPD. Previous work on accounting for CRPD was restricted to only static priority schedulers and periodic task models. Our work extends these results to dynamic priority schedulers and more general task models (e.g. sporadic, generalized multiframe and recurring real-time). We show that our schedulability tests are useful through extensive experiments using synthetic task sets, as well as through a detailed case study.
Mining multiple comprehensible classification rules using genetic programming
Authors: K. C. Tan, A. Tay, T. H. Lee, C. M. Heng
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Genetic programming (GP) has emerged as a promising approach to deal with the classification task in data mining. This paper extends the tree representation of GP to evolve multiple comprehensible IF-THEN classification rules. We introduce a concept mapping technique for the fitness evaluation of individuals. A covering algorithm that employs an artificial immune system-like memory vector is utilized to produce multiple rules as well as to remove redundant rules. The proposed GP classifier is validated on nine benchmark data sets, and the simulation results confirm the viability and effectiveness of the GP approach for solving data mining problems in a wide spectrum of application domains.
MCI-java: a modified java virtual machine approach to multiple code inheritance
Authors: Maria Cutumisu, Calvin Chan, Paul Lu, Duane Szafron
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

Java has multiple inheritance of interfaces, but only single inheritance of code via classes. This situation results in duplicated code in Java library classes and application code. We describe a generalization to the Java language syntax and the Java Virtual Machine (JVM) to support multiple inheritance of code, called MCI-Java. Our approach places multiply-inherited code in a new language construct called an implementation, which lies between an interface and a class in the inheritance hierarchy. MCI-Java does not support multiply-inherited data, which can cause modeling and performance problems. The MCI-Java extension is implemented by making minimal changes to the Java syntax, small changes to a compiler (IBM Jikes), and modest localized changes to a JVM (SUN JDK 1.2.2). The JVM changes result in no measurable performance overhead in real applications.
A New Concept in Ubiquitous Network Management: Guest Node Monitoring--Applications of the MobileIPv6-MIB--
Authors: Kazuhide Koide, Glenn Mansfield Keeni, Thanh Trung Nguyen, Norio Shiratori
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

To keep pace with the recent growth of mobile and ubiquitous networking environment, new technologies in network management need to be explored. MobileIPv6-MIB has been proposed at the IETF as a core technology for effective management of mobile and ubiquitous networks based on MobileIPv6 technology. In this paper we explain the functionalities of MobileIPv6-MIB, and discuss a new concept in ubiquitous network management viz. "Guest Node Monitoring" that significantly expands the scope and reach of network management. We focus on the problem of monitoring guest nodes attached to a management domain. It is difficult for the local network manager to monitor such nodes directly. We propose a novel model for guest node monitoring based on MobileIPv6-MIB. We have implemented the prototype system of our model, and conducted experiments on how the system works.
Understanding the Intention of Information Contribution to Online Feedback Systems from Social Exchange and Motivation Crowding Perspectives
Authors: Yu Tong, Xinwei Wang, Hock-Hai Teo
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The online feedback system (OFS) has been touted to be an effective artifact for electronic word-of-mouth (EWOM). Accumulating sufficient detailed consumption information in the OFS is essential to the success of OFS. Yet, past research has focused on the effects of OFS on building trust and promoting sales and little knowledge about information provision to OFS has been developed. This study attempts to fill this gap by developing and testing a theoretical model to identify the possible antecedents that lead to the intention of consumers' information contribution to OFS. The model employs social exchange theory to identify benefit and cost factors influencing consumer intention, and motivation crowding theory to explore the moderating effects from environmental interventions that are embodied in OFS. Our preliminary results in general provide empirical support for the model. Practical implications are offered to OFS designers for system customization.
Understanding network delay changes caused by routing events
Authors: Himabindu Pucha, Ying Zhang, Z. Morley Mao, Y. Charlie Hu
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Network delays and delay variations are two of the most important network performance metrics directly impacting real-time applications such as voice over IP and time-critical financial transactions. This importance is illustrated by past work on understanding the delay constancy of Internet paths and recent work on predicting network delays using virtual coordinate systems. Merely understanding currently observed delays is insufficient, as network performance can degrade not only due to traffic variability but also as a result of routing changes. Unfortunately this latter effect so far has been ignored in understanding and predicting delay related performance metrics of Internet paths. Our work is the first to address this short coming by systematically analyzing changes in network delays and jitter of a diverse and comprehensive set of Internet paths. Using empirical measurements, we illustrate that routing changes can result in roundtrip delay increase of converged paths by more than 1 second. Surprisingly, intradomain routing changes can also cause such large delay increase. Given these observations, we develop a framework to analyze in detail the impact of routing changes on network delays between end-hosts. Using topology information and properties associated with routing changes, we explain the causes for observed delay fluctuations and more importantly identify routing changes that lead to predictable effects on delay-related metrics. Using our framework, we study the predictability of delay and jitter changes in response to both passively observed interdomain and actively measured intradomain routing changes.
IT outsourcing for E-government: Lessons from IT outsourcing projects initiated by agricultural organizations of the Korean government
Authors: Junghoon Moon, Gu-Hyun Jung, Miri Chung, Young Chan Choe
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The main goal of this study is to conduct an empirical investigation of IT outsourcing projects for E-government and provide useful implications for IT mangers in the public sector. A framework is proposed and diverse IT outsourcing success factors are examined using data collected from the public sector. Fifty nine IT outsourcing projects initiated by agricultural organizations of the Korean government for the last 7 years were used for analysis in this study. A survey research was also conducted from IT managers in the organizations. The findings and lessons from empirical investigation of this study will be useful to IT managers planning IT outsourcing projects in the public sector. The findings are compared with general beliefs of IT outsourcing in the private sector.
The Tycho user interface system
Authors: Christopher Hylands, Edward A. Lee, H. John Reekie
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Tycho is the next-generation user-interface system we are building for the Ptolemy project. It is a complete [incr Tcl] application structured as an extensible class library. Our goal is to make it easy to extend this basic application with functionality and a user interface for specialized applications such as electronic design and simulation. The Tycho library includes a selection of general-purpose widgets, syntax-sensitive text editors, and graphical editing support. It incorporates architectural features that make it easy for different editors and viewers to share data and screen space. Finally, structured support for incorporating C and Java packages into this framework allows us to use those languages to complement the scripting and user-interface features of Tcl/Tk.
Snapshot density queries on location sensors
Authors: Xuegang Huang, Hua Lu
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

Density queries are of practical importance in many mobility related applications. In this paper, we employ the location sensors, which are placed in a geographical area and can only detect the amount of objects moving in vicinity, to estimate the dense regions of objects. Our approach partitions the region of interest into subregions, and deploys in each subregion both location sensors and a processing node that issues and answers density queries. Three algorithms are proposed to process density queries on those processing nodes. Their accuracy and efficiency are empirically evaluated.
Assurance Cases for Security: The Metrics Challenge
Authors: Robin Bloomfield, Marcelo Masera, Ann Miller, O. Sami Saydjari, Charles B. Weinstock
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

For critical systems it is important to know whether the system is trustworthy and to be able to communicate, review and debate the level of trust achieved. In the safety domain, explicit Safety Cases are increasingly required by law, regulations and standards. Yet the need to understand risks is not just a safety issue and the type of argumentation used for safety cases is not specific to safety alone. Prior workshops, beginning with one held at DSN 2004, have identified a number of technical, policy and research challenges. The focus of this workshop is on one of these challenges: metrics for assurance cases for security.
Channel Assignment for Cellular Networks Based on a Local Modified Hopfield Neural Network
Authors: Lydia A. Guirguis, Mona M. Ghoneimy
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we propose a modified discrete Hopfield neural networks algorithm for the channel assignment problem. In opposition to previous work, we tried to apply the optimization locally on a per cell basis in order to reduce the CPU processing time and decrease the designed system complexity while obtaining a near-optimum solution. In addition, the research is extended to study the algorithm performance in a more realistic cellular system where the number of requested channels is continuously changing with time. In this paper, the channel assignment problem is formulated as an energy function which is at its minimum when all the defined compatibility constraints are satisfied and the assigned channel number (ACN) is equal to the requested channel number (RCN) in each cell.
An efficient algorithm for large scale global optimization of continuous functions
Authors: Yong-Jun Wang, Jiang-She Zhang
Venue: Journal of Computational and Applied Mathematics (2007)

A fast descent algorithm, resorting to a ''stretching'' function technique and built on one hybrid method (GRSA) which combines simulated annealing (SA) algorithm and gradient based methods for large scale global optimizations, is proposed. Unlike the previously proposed method in which the original objective functions remain unchanged during the whole course of optimization, the new method firstly constructs an auxiliary function on one local minimizer obtained by gradient based methods and then SA is executed on this constructed auxiliary function instead of on the original objective function in order that we can improve the jumping ability of SA algorithm to escape from the currently discovered local minimum to a better one from which the gradient based methods restart a new local search. The above procedure is repeated until a global minimum is detected. In addition, corresponding to the adopted ''stretching'' technique, a new next trial point generating scheme is designed. It is verified by simulation especially on large scale problems that the convergence speed is greatly accelerated, which is its main difference from many other reported methods that mostly cope with functions with less than 50 variables and does not apply to large scale optimization problems. Furthermore, the new algorithm functions as a global optimization procedure with a high success probability and high solution precision.
Why can't i find my files? new methods for automating attribute assignment
Authors: Craig A. N. Soules, Gregory R. Ganger
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Attribute-based naming enables powerful search and organization tools for ever-increasing user data sets. However, such tools are only useful in combination with accurate attribute assignment. Existing systems rely on user input and content analysis, but they have enjoyed minimal success. This paper discusses new approaches to automatically assigning attributes to files, including several forms of context analysis, which has been highly successful in the Google web search engine. With extensions like application hints (e.g., web links for downloaded files) and inter-file relationships, it should be possible to infer useful attributes for many files, making attribute-based search tools more effective.
Secure pairwise key establishment in large-scale sensor networks: An area partitioning and multigroup key predistribution approach
Authors: Dijiang Huang, Deep Medhi
Venue: ACM Transactions on Sensor Networks (TOSN) (2007)

Existing pairwise key establishment schemes for large-scale sensor networks are vulnerable to various passive or active attacks. We classify attacks as selective node capture attacks, node fabrication attacks, and insider attacks. In order to improve the security robustness of random key predistribution and pairwise key establishment schemes against these attacks, we propose a five-phase pairwise key predistribution and pairwise key establishment approach by using area partitioning and multigroup key predistribution. Our security performance studies show that our proposed approach is resilient to selective node capture and node fabrication attacks, and restricts the consequence of any insider attack to a minimal level.
A 16, 24, 32 kbit/s wideband speech codec based on ATCELP
Authors: P. Combescure
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes a combined adaptive transform codec (ATC) and code-excited linear prediction (CELP) algorithm, called ATCELP, for the compression of wideband (7 kHz) signals. The CELP algorithm applies mainly to speech, whereas the ATC mode is selected for music and noise signals. We propose a switching scheme between CELP and ATC mode and describe a frame erasure concealment technique. Subjective listening tests have shown that the ATCELP codec at bit rates of 16, 24 and 32 kbit/s achieved performances close to those of the CCITT G.722 at 48, 56 and 64 kbit/s, respectively, at most operating conditions.
Facilitating problem-solving on nested selection statements using C/C++
Authors: N. Singhal
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Problem solving is an important part of learning computer science, yet the choice of problems offered in textbooks (which is the traditional source of problems) is limited, static, non-interactive and lacks animation. In order to address these issues, we propose Java applets that automatically generate problems, provide the necessary visualization and animation, solve problems and provide feedback to the user. They are also capable of logging usage. We refer to such applets as "problets". In this paper, we discuss the issues involved in the design and implementation of a problet on nested selection statements in C/C++.
Whose thumb is it anyway?: classifying author personality from weblog text
Authors: Jon Oberlander, Scott Nowson
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We report initial results on the relatively novel task of automatic classification of author personality. Using a corpus of personal weblogs, or 'blogs', we investigate the accuracy that can be achieved when classifying authors on four important personality traits. We explore both binary and multiple classification, using differing sets of n-gram features. Results are promising for all four traits examined.
Experimental Validation of a Performance Model for Simple Layered Task Systems
Authors: Athar B. Tayyab, Jon G. Kuhl
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Performance modeling for the class of parallel computa tions structured as simple layered task systems is consid ered. Specifically studied are the effects of using different forms of inter-layer sequencing mechanisms. The paper refines and generalizes an earlier analytical performance model and presents the results of experimental validation of the model on two different multiprocessor systems. The experimental validation results show that the model is quite accurate, with average prediction errors in the range of only a few percent. Finally, the paper uses the model to investigate performance tradeoff issues for lay ered task systems using barrier versus explicit intertask sequencing mechanisms and implemented on computing systems with differing architectural features. This study shows that the relationship between the type of sequenc ing mechanism, the nature of the computation, and the features of the underlying architecture, interact in com plex ways to impact overall performance. Several inter esting and non-intuitive results are shown.
Architecture for Supporting Real Time Traffic in Large ScaleWireless Networks
Authors: Liang Song, Dimitrios Hatzinakos
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The method of Opportunistic Data Forwarding (ODF), supporting real time traffic in large scale wireless networks, is studied. The random uncertainties in wireless networking are exploited opportunistically to achieve reliable communications. The ODF is established as a peer-to-peer unicast wireless link module, over long distance, within the architecture framework of Embedded Wireless Interconnect (EWI). In order to provide real-time Quality of Service (QoS), the tradeoff between network energy consumption and end-to-end packet delay is investigated, where the complicated end-to-end optimization problem is statistically recast into an equivalent, but solvable, single hop resource allocation problem, under the long distance asymptotic condition.
The virtual classroom: at the cutting edge of higher education
Authors: J. Unger
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

At the University of Illinois at Urbana-Champaign (UIUC), we are using networked computers to implement innovative teaching and learning environments. This new approach to education has been termed "Asynchronous Learning Networks" (ALN). With support from the Alfred P. Sloan Foundation and the UIUC campus administration, we established the Sloan Center for Asynchronous Learning Environments (SCALE) in March 1995. During the 1995-96 academic year, SCALE faculty taught more than seventy five courses that were restructured to use networked computers to provide access to learning materials and to subject-matter experts; in the Spring 1996 semester, more than 4000 students were enrolled in SCALE courses at UIUC. The ALN environment can be used to implement a "virtual" classroom, which has many of the same features of a physical classroom: access to lecture materials and discussions and the ability to ask and answer questions, to turn-in homework, and to take quizzes. In the implementation of ALN at UIUC, the virtual classroom is a supplement to the physical classroom; while it may change the interactions in the actual classroom, it does not replace the physical classroom. 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
Minitrack Introduction: Virtual Work, Teams, And Organizations
Authors: Manju Ahuja, France Belanger, Mary Beth Watson-Manheim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This mini-track focuses on challenges presented by geographical, temporal, and cultural distribution among individuals working in teams, organizations, and communities. The explosion of communication technologies has facilitated the growth of virtual environments, but it has also resulted in confusion over choice of communication technologies that may be appropriate for a particular task, overload of information to be sorted through, and a sense of isolation from coworkers. In addition, teams must be formed and become productive quickly, e.g., competitive advantage for project development teams is frequently based on being able to bring a new product to market more quickly than competitors. This environment is further complicated as individual members may work in multiple virtual teams with multiple, often conflicting priorities. In virtual environments, managing these different relationships, loyalties, and priorities, in addition to developing new relationships, presents a definite challenge.