ppxscal/embedding_network huggingface dataset:
Interactive resource-intensive applications made easy
Authors: H. Andrés Lagar-Cavilla, Niraj Tolia, Eyal de Lara, M. Satyanarayanan, David O'Hallaron
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Snowbird is a middleware system based on virtual machine (VM) technology that simplifies the development and deployment of bimodal applications. Such applications alternate between phases with heavy computational-resource needs and phases rich in user interaction. Examples include digital animation, as well as scientific, medical, and engineering diagnostic and design tools. Traditionally, these applications have been manually partitioned into distributed components to take advantage of remote computational resources, while still providing low-latency user interaction. Instead, Snowbird lets developers design their applications as monolithic units within a VM, and automatically migrates the application to the optimal execution site to achieve short completion time and crisp interactive performance. Snowbird does not require that applications be written in a specific language, or use specific libraries, and it can be used with existing applications, including closed-source ones, without requiring recompilation or relinking. Snowbird achieves these goals by augmenting VM migration with an interaction-aware migration manager, support for graphics hardware acceleration, and a wide-area peer-to-peer storage system. Experiments conducted with a number of real-world applications, including commercial closed-source tools, show that applications running under Snowbird come within 4% of optimal compute time, and provide crisp interactive performance that is comparable to native local execution.
Applying fuzzy hierarchy multiple attributes to construct an expert decision making process
Authors: Che-Wei Chang, Cheng-Ru Wu, Hung-Lung Lin
Venue: Expert Systems with Applications: An International Journal (2009)

The main objective of this paper is to propose an approach within the AHP framework for tackling the uncertainty and imprecision of service evaluations during pre-negotiation stages, where the expert's comparison judgments are represented as fuzzy triangular numbers. A fuzzy prioritization method, which derives crisp priorities from consistent and inconsistent fuzzy comparison matrices, is described. The fuzzy analytic hierarchy process (FAHP)-based decision-making method can provide decision makers or buyer a valuable reference for evaluating software quality. A case study demonstrates the effectiveness of the proposed scheme. Importantly, the proposed scheme can assist decision makers in assessing the feasibility of digital video recorder system to management public space, making it highly applicable for academic and commercial purposes.
A Flexible Framework for Audio Semantic Content Detection
Authors: Qi Li, Huadong Ma, Kanyan Zheng
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Audio semantic analysis is a crucial issue in multimedia applications. In this paper, a hierarchical framework is proposed for high-level semantic content detection for a continuous audio stream. In the proposed framework, basic audio events are modeled with hidden Markov models. Based on the obtained key audio event sequence, a neural network-based approach is proposed to discover the high-level semantic content of the audio context. With the neural network-based approach, human knowledge and machine learning are effectively combined in the semantic inference. We select some audio streams to evaluate the performance of the proposed framework, and the experiment results demonstrate the framework can achieve satisfying results.
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Authors: Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Recent studies show that network coding can provide significant benefits to network protocols, such as increased throughput, reduced network congestion, higher reliability, and lower power consumption. The core principle of network coding is that intermediate nodes actively mix input packets to produce output packets. This mixing subjects network coding systems to a severe security threat, known as a \emph{pollution attack}, where attacker nodes inject corrupted packets into the network. Corrupted packets propagate in an epidemic manner, depleting network resources and significantly decreasing throughput. Pollution attacks are particularly dangerous in wireless networks, where attackers can easily inject packets or compromise devices due to the increased network vulnerability. In this paper, we address pollution attacks against network coding systems in wireless mesh networks. We demonstrate that previous solutions to the problem are impractical in wireless networks, incurring an unacceptably high degradation of throughput. We propose a lightweight scheme, DART, that uses time-based authentication in combination with random linear transformations to defend against pollution attacks. We further improve system performance and propose EDART, which enhances DART with an optimistic forwarding scheme. A detailed security analysis shows that the probability of a polluted packet passing our verification procedure is very low. Performance results using the well-known MORE protocol and realistic link quality measurements from the Roofnet experimental testbed show that our schemes improve system performance over 20 times compared to previous solutions.
The toolbox for local and global plagiarism detection
Authors: Sergey Butakov, Vladislav Scherbinin
Venue: Computers Education (2009)

Digital plagiarism is a problem for educators all over the world. There are many software tools on the market for uncovering digital plagiarism. Most of them can work only with text submissions. In this paper, we present a new architecture for a plagiarism detection tool that can work with many different kinds of digital submissions, from plain or formatted texts to audio podcasts. The open architecture is based on converting the digital submission into text form for processing by a plagiarism detection algorithm. To process non-text submissions, the system is extended with the appropriate converter. Such an open architecture makes the anti-plagiarism toolbox universal and easily adaptable for processing virtually any kind of digital submissions. This paper describes a software prototype based on the proposed architecture and presents the results of its implementation on a large archive of student papers.
The importance of Ada programming support environments
Authors: Thomas A. Standish
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

In this paper it is argued that even if we assume the most optimistic scenario we can think up for the introduction of the Ada language, the language alone, in the absence of an Ada Programming Support Environment (APSE), is insufficient to achieve the gains in programming productivity and software reliability with which use of Ada tantalizes us. Moreover, it is argued that the level of support envisaged in the Minimal Ada Programming Support Environment (MAPSE), specified in the STONEMAN, which provides a rudimentary level of capability incorporating a text editor, compiler, linker/loader, and symbolic debugger, is also insufficient; and that it is time to seize the opportunity to conceptualize what sort of advanced programming support tools should populate a mature APSE of high utility and effectiveness. In this context, consideration of support tools for software project management, interactive programming, modern programming practices, software reuse, and improved program understanding techniques arises.
Fast communication: Route to chaos in a third-order phase-locked loop network
Authors: L. H. A. Monteiro, A. C. Lisboa, M. Eisencraft
Venue: Signal Processing (2009)

Phase-locked loops (PLLs) are widely used in applications related to control systems and telecommunication networks. Here we show that a single-chain master-slave network of third-order PLLs can exhibit stationary, periodic and chaotic behaviors, when the value of a single parameter is varied. Hopf, period-doubling and saddle-saddle bifurcations are found. Chaos appears in dissipative and non-dissipative conditions. Thus, chaotic behaviors with distinct dynamical features can be generated. A way of encoding binary messages using such a chaos-based communication system is suggested.
Security architecture for a systematic administration of SELinux policies in distributed environments
Authors: Pedro Chavez Lugo, Juan J. Flores, Juan Manuel Garcia Garcia
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

Users and organizations seek to obtain from an operating system integrity, confidentiality, and availability in both hardware and software resources. These characteristics must come coupled with easy handling and administration. An operating system designed under the criteria of the class A1, consists of a collection of security strengthening mechanisms for the kernel. SELinux is an example of this type of operating system that supports several types of security policies applied to access control. In this article we address the problem of inconsistency in SELinux policies, which is present in distributed environments. To solve this problem, we propose an architecture that integrates a policy server for enabling a simple and secure administration. The policy server collects, integrates, and updates all policies that are applied in the distributed environment. We aim to achieve authenticity, integrity and confidentiality in the policy update process through the Kerberos V protocol. We propose a redundant policy server. We do not assure that the proposed architecture is bug free; it is impossible to guarantee a completely secure system. Nonetheless, we consider it a viable solution for centralized management of SELinux policies.
New concept photosensitive fiber
Authors: Feng Tu, Deming Liu, Shuqiang Zhang, Honghai Wang, Jie Luo
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The high Germanium (Ge) doped photosensitive fiber was widely used for Fiber Bragg Grating (FBG) applications. Its birefringence and cladding mode coupling characters greatly influence the FBG's transmission character. A new concept of photosensitive fiber was introduced, with the optimised birefringence and cladding mode depressed design. The FBG write by this new fiber has ~25dB clad mode-depressed ratio and its PMD value were less than 0.045ps.
Distributed Artificial Intelligence, Agent Technology, and Collaborative Applications
Authors: Vijayan Sugumaran
Venue: Advances In Intelligent Information Technologies (2008)

Cutting-edge developments in artificial intelligence are now driving applications that are only hinting at the level of value they will soon contribute to organizations, consumers, and societies across all domains.Distributed Artificial Intelligence, Agent Technology, and Collaborative Applications offers an enriched set of research articles in artificial intelligence (AI), covering significant AI subjects such as information retrieval, conceptual modeling, supply chain demand forecasting, and machine learning algorithms. This comprehensive collection provides libraries with a one-stop resource to equip the academic, industrial, and managerial communities with an in-depth look into the most pertinent AI advances that will lead to the most valuable applications.
Using conditional FCM to mine event-related brain dynamics
Authors: Christos N. Zigkolis, Nikolaos A. Laskaris
Venue: Computers in Biology and Medicine (2009)

We introduce a framework for mining event related dynamics based on conditional FCM (CFCM). For a given set of responses, the variation in the data is summarized by means of a small set of meaningful prototypes accompanied with a low-dimensional graph capturing their relative relationships. CFCM enables prototyping in a principled manner. User-defined constraints, which are imposed by the nature of experimental data and/or dictated by the neuroscientist's intuition, direct the process of knowledge extraction and can robustify single-trial analysis. The method is introduced using simulated data and demonstrated using actual encephalographic data.
Faster join-projects and sparse matrix multiplications
Authors: Rasmus Resen Amossen, Rasmus Pagh
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away the intermediate result may be much larger than both the input and the output, and the computation could therefore potentially be performed faster by a direct procedure that does not produce such a large intermediate result. We present a new algorithm that has smaller intermediate results on worst-case inputs, and in particular is more efficient in both the RAM and I/O model. It is easy to see that join-project where the join attributes are projected away is equivalent to boolean matrix multiplication. Our results can therefore also be interpreted as improved sparse, output-sensitive matrix multiplication.
WSDL-D: A Flexible Web Service Invocation Mechanism for Large Datasets
Authors: Mark Wiley, Aihua Wu, Jianwen Su
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

WSDL web services are built around the request-reply framework, requiring service invocation to be bundled together with all relevant data in a single message. Inefficiency becomes evident as web service providers begin to offer more robust services that require massive datasets (e.g., multimedia and scientific data). Under the WSDL standards, these hefty datasets must be ported to an appropriate message format and transferred in their entirety upon each service invocation or response. Significant gains in service flexibility and performance can be made simply by separating invocation messages from their datasets. Such a separation ultimately grants service consumers the ability to pass parameter datasets from third party hosts, to maintain dataset parameters on the service provider host for use with future service invocations, and to provide datasets in a variety of different formats. In this paper, we develop a service invocation mechanism, called WSDL-D, to support this separation of service invocation from parameter datasets.
Ternary Subset Difference Method and Its Quantitative Analysis
Authors: Kazuhide Fukushima, Shinsaku Kiyomoto, Toshiaki Tanaka, Kouichi Sakurai
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

This paper proposes a ternary subset difference method (SD method) that is resistant to coalition attacks. In order to realize a secure ternary SD method, we design a new cover-finding algorithm, label assignment algorithm, and encryption algorithm. These algorithms are required to revoke one or two subtrees simultaneously while maintaining resistance against coalition attacks. We realize this two-way revocation mechanism by creatively using labels and hashed labels. Then, we evaluate the efficiency and security of the ternary SD method. We show that the upper bound of the average message length in the ternary SD method is smaller by about 12.2 percent than that of the conventional SD method, and the number of labels on each client device can be reduced by about 20.4 percent. On the other hand, the computational cost imposed on a client device stays within O(logn). Finally, we prove that the ternary SD method is secure against coalition attacks.
Further Analysis and Improvement of Yoon et al.'s Hash-Based User Authentication Scheme
Authors: Bang-Ju Wang, Li Shu-Hua, Huan-Guo Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In 2002, Lee et al. proposed a scheme improving on Peyravian and Zunic scheme. However, Yoon et al. found that the scheme is vulnerable to a denial of service (DoS) attack and proposed a enhanced scheme on Lee et al.'s scheme. Unfortunately, Ku et al. pointed out that Yoon et al.'s scheme can not achieve backward secrecy and is vulnerable to off-line password guessing and stolen-verifier attacks. In this paper, the other security flaws of the scheme that new insider attack and replay attack are stated, and an improved hash based scheme on Yoon et al.'s scheme is proposed. The improved scheme in this paper can fix all the known security flaws of Yoon et al.'s scheme except for backward secrecy and is more secure and efficient for practical application in source constraint wireless networks.
Tiger e-learning system
Authors: Roudabeh Moraghebi, Jiang Guo, Grady F. Laksmono
Venue: Journal of Computing Sciences in Colleges (2009)

There are many ways to present educational materials in the classroom, including but not limited to: video, pictures, power point, handouts, animation, etc. But because of limited time and resources, it is difficult or almost impossible for an instructor to make all of the information available for all of the students at the same time. With the dramatic increase in the internet and technology, communication, and information are made more available to everyone. This paper is going to describe the development and initial experiences of a web based learning system, Tiger E-Learning System that was developed to facilitate instructors with functionalities to manage courses, educational materials, and keeping track of the student learning progress.
Strengths and synergies of evolved and designed controllers: A study within collective robotics
Authors: Gianluca Baldassarre, Stefano Nolfi
Venue: Artificial Intelligence (2009)

This paper analyses the strengths and weaknesses of self-organising approaches, such as evolutionary robotics, and direct design approaches, such as behaviour-based controllers, for the production of autonomous robots' controllers, and shows how the two approaches can be usefully combined. In particular, the paper proposes a method for encoding evolved neural-network based behaviours into motor schema-based controllers and then shows how these controllers can be modified and combined to produce robots capable of solving new tasks. The method has been validated in the context of a collective robotics scenario in which a group of physically assembled simulated autonomous robots are requested to produce different forms of coordinated behaviours (e.g., coordinated motion, walled-arena exiting, and light pursuing).
Unicast Network Loss Tomography Using #R-Cast Probes Scheme
Authors: Feng Qian, Guang-min Hu, Xing-miao Yao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Network tomography can not rely on the cooperation internal node, and use only a group of edge nodes to reveal the mathematical and statistical characterization of network behavior that is wished to be known. Therefore, network tomography has become one of the focused new technologies. Existing unicast network loss tomography need send large numbers of probe packet, which is lead to add network load. In the paper, we propose unicast network loss tomography using #R-cast probes scheme with two stage mechanism. Here R denotes leaf set (receiver's nodes) of an arbitrary tree, and # is the number of its set. In my study, to eliminate the redundancy probe packet, we send first #R-cast probes to all receivers so that all paths are covered, simultaneously. Then, we exact different flexicast from the #R-cast received by leaf nodes, for all the internal link loss rates identifiability. Our method hence can send much lesser probe than existing method. Finally, we employ fast least-squares algorithm to obtain the solution of our overdetermined equations of my loss tomography. Ns2 simulation experiments demonstrate the performance of the propose approach.
Research the model of MMIC non-dissipative MESFET
Authors: Bolin Ke, Chunhua Li, Yang Ai-Min
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Analysis on the principle and characteristic of Non-dissipative MESFET mixer circuit has been discussed in detail in this paper. During research of CAD of this type of mixer, the technique of expanding the MESFET model has been offered. On the basis above, the 12.4-18GHz non-dissipative MESFET mixer have been designed. The mixer perform--3dB of conversion gain.
An ANFIS-Based Hybrid Video Quality Prediction Model for Video Streaming over Wireless Networks
Authors: Asiya Khan, Lingfen Sun, Emmanuel Ifeachor
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

There are many parameters that affect video quality but their combined effect is not well identified and understood when video is transmitted over mobile/wireless networks. In this paper our aim is twofold. First, to study and analyze the behaviour of video quality for wide range variations of a set of selected parameters. Second, to develop a learning model based on ANFIS to estimate the visual perceptual quality in terms of the Mean Opinion Score (MOS) and decodable frame rate (Q value). We trained three ANFIS-based ANNs for the three distinct content types using a combination of network level and application level parameters such as frame rate, send bitrate, link bandwidth and packet error rate and tested the ANN models using unseen dataset. We found that the video quality is more sensitive to network level parameters compared to application level parameters. Preliminary results show that a good prediction accuracy was obtained from the ANFIS-based ANN model. The work should help in the development of a reference-free video prediction model and Quality of Service (QoS) control methods for video over wireless/mobile networks.
Asynchronous Best-Reply Dynamics
Authors: Noam Nisan, Michael Schapira, Aviv Zohar
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In many real-world settings (e.g., interdomain routing in the Internet) strategic agents are instructed to follow best-reply dynamics in asynchronous environments. In such settings players learn of each other's actions via update messages that can be delayed or even lost. In particular, several players might update their actions simultaneously, or make choices based on outdated information. In this paper we analyze the convergence of best- (and better-)reply dynamics in asynchronous environments. We provide sufficient conditions, and necessary conditions for convergence in such settings, and also study the convergence-rate of these natural dynamics.
Enhancing Open Source Software in Alignment with CMMI-DEV
Authors: Christiane Gresse von Wangenheim, Jean Carlo Rossa Hauck, Aldo von Wangenheim
Venue: IEEE Software (2009)

To provide comprehensive, low-cost tool support for project monitoring and control for small organizations in particular, the authors compare the most popular free/open source Web-based project management applications against their compliance to CMMI-DEV. Based on this analysis, they implement a set of enhancements to dotProject, including Earned Value Management, and evaluate the resulting application with respect to its CMMI-compliance. Their initial experiences applying the tool in an R D organization indicate that it helps establish a systematic project monitoring and control process by supporting or automating tasks. In this way, it presents an open, flexible, and free tool-integration solution for project management, illustrating that open-source tools might be appealing, especially for small organizations.