ppxscal/embedding_network huggingface dataset:
Modified Stream Control Transmission Protocol over Broadband High Latency Networks
Authors: G. S. Tomar, B. K. Chaurasia
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Stream Control Transmission Protocol (SCTP) is newly emerged protocol, which is combination of good qualities of TCP and UDP. It is a reliable message oriented protocol providing multistreaming and multihoming. In this paper, a modified algorithm is proposed for dealing multiple packet losses which improves congestion control mechanism in network. Proposed SCTP is a simple sender side alteration to the SCTP congestion window update algorithm with same traditional SCTP receiver. The results are compared with traditional SCTP and Scalable SCTP traffic using Network Simulator-2 and result is better than the other schemes.
Revisiting Safe Realizability of Message Sequence Charts Specifications
Authors: Abdolmajid Mousavi, Behrouz H. Far
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Safe realizability of Message Sequence Charts (MSCs) specifications is a measure of whether or not there exists a distributed implementation of the specification such that it is deadlock free and shows exactly the behaviours specified in the specification. There are also some works that given a specification, can answer whether it is safely realizable or not. However, while these works are restricted by certain assumptions such as synchronous message passing in the system, they also cannot answer why given two specifications, one is safely realizable and the other is not. In this paper, we present a property of MSC specifications that explains implementation problems for them. Using this result, we show how we can effectively correct a specification to avoid implementation problems such as deadlocks and implied scenarios.
On the use of divergence distance in fuzzy clustering
Authors: M. Oussalah, Samia Nefti
Venue: Fuzzy Optimization and Decision Making (2008)

Clustering algorithms divide up a dataset into a set of classes/clusters, where similar data objects are assigned to the same cluster. When the boundary between clusters is ill defined, which yields situations where the same data object belongs to more than one class, the notion of fuzzy clustering becomes relevant. In this course, each datum belongs to a given class with some membership grade, between 0 and 1. The most prominent fuzzy clustering algorithm is the fuzzy c-means introduced by Bezdek (Pattern recognition with fuzzy objective function algorithms, 1981), a fuzzification of the k-means or ISODATA algorithm. On the other hand, several research issues have been raised regarding both the objective function to be minimized and the optimization constraints, which help to identify proper cluster shape (Jain et al., ACM Computing Survey 31(3):264---323, 1999). This paper addresses the issue of clustering by evaluating the distance of fuzzy sets in a feature space. Especially, the fuzzy clustering optimization problem is reformulated when the distance is rather given in terms of divergence distance, which builds a bridge to the notion of probabilistic distance. This leads to a modified fuzzy clustering, which implicitly involves the variance---covariance of input terms. The solution of the underlying optimization problem in terms of optimal solution is determined while the existence and uniqueness of the solution are demonstrated. The performances of the algorithm are assessed through two numerical applications. The former involves clustering of Gaussian membership functions and the latter tackles the well-known Iris dataset. Comparisons with standard fuzzy c-means (FCM) are evaluated and discussed.
Management Information Systems for the Information Age, 6th edition
Authors: Stephen Haag, Maeve Cummings, Amy Phillips
Venue:  (2007)

Management Information Systems for the Information Age, 3rd edition maintains the unique overall approach of the successful second edition: the right mix of traditional and leading edge topical coverage along with LOTS of hands-on, problem-solving projects. Haag works well for professors (and students) who want a very interactive, engaging experience, and for those who want to see a strong tie to the latest and greatest on the Internet and corresponding textbook website. Haag is equally appropriate for both business and non-business majors. This revision now clearly distinguishes between technical and managerial topics key to MIS by organizing the technology coverage into Modules and the managerial material into Chapters. In response to feedback from both users and non-users, the chapters have been slightly reorganized to incorporate increased coverage of E-Commerce and E-Business (now a full chapter 5). Pedagogical features have been retained but fine-tuned and the vibrant design has been toned down to reflect fewer features on a page.
Dependability evaluation of dedicated server group orphan detection method
Authors: M. Jahanshahi, M. Gholipour, M. Kordafshari, M. Dehghan
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Orphan detection methods demonstrate different performance, memory consumption in different scenarios. Dedicated Server Group (DSG) method is one of the most proper one. In this paper, we overviewed DSG method and analyzed its advantages and disadvantages. Based on the analytical results, we improved the DSG method in both process overhead and communication/traffic overhead. The dependability of improved method is evaluated by Markov chain modeling using SHARPE package and the Availability, Reliability, and Mean-Time to Failure are calculated.
Graphic administration with webmin
Authors: Federico Kereki
Venue: Linux Journal (2008)

New to Linux administration? Webmin can help you out.
A Next Generation Operator Environment to Turn Context-Aware Services into a Commercial Reality
Authors: Oriana Riva, Veli-Matti Teittinen, Sebastian Siikavirta, Lasse Huovinen
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Network operators can play an essential role in turning widely investigated context-aware services into a commercial reality. The Nokia Siemens Networks NEON project aims to develop a virtual network operator environment that can leverage the opportunities offered by packet-based multi-access networks, increasingly more powerful mobile devices, and service provider business practices to enhance the end user experience with value-added services. This paper primarily focuses on the support provided by the NEON network to fully accomplish context-aware services. We present the design and implementation of the NEON network currently in use in Nokia Siemens Networks premises with a special focus on the context services it provides. We assessed the performance of such services in terms of latency and power consumption on smart phones and we used them to implement the Communication Dispatcher, a prototype application that enables efficient context-aware user-to-user multi-terminal communication.
Modeling human computer interactions with automata
Authors: Pradip Peter Dey, Thomas M. Gatton, Mohammad N. Amin
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Human computer interactions have been changing rapidly. New models of human computer interaction are needed in order to provide more flexible and adaptable user interfaces that can deal with interruptions. Modeling interactions with automata allows checking certain features including consistency at a level of abstraction appropriate for making predictions. This paper examines the consequences of representing a human computer interaction model using automata.
Characterization Framework and Design Patterns for the Disadvantaged User
Authors: Fatma Dandashi, Aaron Griggs, Jeffrey Higginson, James Hughes, Wilson Narvaez, Marwan Sabbouh, Salim Semy, Beth Yost
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Many Service Oriented Architecture (SOA) approaches in use today presume the consistent availability of reliable networks and limitless resources. For some Department of Defense (DoD) and other Government users, operating at the tactical edge, who may be disadvantaged in terms of network and resource availability, the current methods of development may not provide them with reliable capability. In this paper, we propose a method for capturing design patterns for the disadvantaged user using the common vocabulary of a characterization framework. We also provide a set of design patterns that minimize technical constraints, and derive the infrastructure requirements needed to implement a selected design pattern.
RCT: A distributed tree for supporting efficient range and multi-attribute queries in grid computing
Authors: Hailong Sun, Jinpeng Huai, Yunhao Liu, Rajkumar Buyya
Venue: Future Generation Computer Systems (2008)

Resource discovery is of great importance in grid environments. Most of existing approaches treat all resources equally without any categorizing mechanism. We propose, Resource Category Tree (RCT), which organizes resources based on their characteristics represented by primary attributes (PA). RCT adopts a structure of distributed AVL tree, with each node representing a specific range of PA values. Though RCT adopts a hierarchical structure, it does not require nodes in higher levels maintain more information than those in lower levels, which makes RCT highly scalable. RCT is featured by self-organization, load-aware self-adaptation and fault tolerance. Based on RCT, commonly used queries, such as range queries and multi-attribute queries, are well supported. We conduct performance evaluations through comprehensive simulations.
Toxicity Study of Oral Vanadyl Sulfate by NMR-based Metabonomic
Authors: Xiaoxia Dai, Jiyang Dong, Zhong Chen, Qiqing Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Vanadium compounds have been believed to be ideal drugs for diabetes biological therapy in future, but they suffer setback for the potential toxicity now. Toxicity study is necessary for vanadyl drugs development. This paper investigated the toxicity effects of vanadyl sulfate (VOSO4) oral administration in male Wistar rats using 1H NMR-based metabonomic analysis and clinical biochemical analysis. Rat urine were collected and their 1H NMR spectra were acquired, and then subjected to multi-variable statistical analysis. Compared to control groups, urinary excretion of lactate, TMAO, creatinine, taurine and hippurate increased following VOSO4 dosing, with concomitant decrease in the level of acetate and succinate. The dosed groups can be readily discriminated from the control groups by principle component analysis. The results showed that VOSO4 can affect energy metabolism process, interrupted intestinal microfloral metabolism, and induced liver and kidney injury. NMR-based metabonomic can offer additional information to traditional clinical chemistry in the sensitivity and specificity of results obtained.
Spatial indexing in microsoft SQL server 2008
Authors: Yi Fang, Marc Friedman, Giri Nair, Michael Rys, Ana-Elisa Schmid
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Microsoft SQL Server 2008 adds built-in support for 2-dimensional spatial data types for both planar and geodetic geometries to address the increasing demands for managing location-aware data. SQL Server 2008 also adds indexing capabilities that, together with the necessary plan selections done by the query optimizer, provide efficient processing of spatial queries. This paper will present an overview of the spatial indexing implementation in SQL Server 2008 and outline how the indexing is implemented and how the cost-based query optimizer chooses among the different plans.
InFeCT - Network Traffic Classification
Authors: Peter Teufl, Udo Payer, Michael Amling, Martin Godec, Stefan Ruff, Gerhard Scheikl, Gernot Walzl
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Network traffic policy verification is the analysis of network traffic to determine if the observed traffic is in compliance or violation of the applied policy. An intuitive approach is the use of machine learning techniques based on specific network traffic characteristics. These traffic characteristics are also known as features, which have to be extracted and selected carefully to build robust and accurate learning models. Thus, finding the best possible learning model in combination with extracting the best possible feature-set is a necessary requirement to design accurate traffic classification models. While feature selection can be automated to find the best subset of a given set of features, there are no known mechanisms to solve the problem of feature extraction. Thus, extracting the best possible features has to be done empirically. In this work we present a framework to simplify the empirical model selection and feature extraction process.
Content-based image retrieval using image regions as query examples
Authors: D. N. F. Awang Iskandar, James A. Thom, S. M. M. Tahaghoghi
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

A common approach to content-based image retrieval is to use example images as queries; images in the collection that have low-level features similar to the query examples are returned in response to the query. In this paper, we explore the use of image regions as query examples. We compare the retrieval effectiveness of using whole images, single regions, and multiple regions as examples. We also compare two approaches for combining shape features: an equal-weight linear combination, and classification using machine learning algorithms. We show that using image regions as query examples leads to higher effectiveness than using whole images, and that an equal-weight linear combination of shape features is simpler and at least as effective as using a machine learning algorithm.
Website task performance by older adults
Authors: L. Priest, L. Nayak, I. Stuart-Hamilton
Venue: Behaviour & Information Technology (2007)

The present study examined influences of fluid intelligence and website experience on a website task by 99 community-dwelling older adults (41 males, 58 females, age range 58 - 90 years) who were screened for visual acuity and major health problems. They were divided into three groups, dependent on their prior website experience (19 with no prior website experience, 55 with low website experience and 25 with high website experience). Perpendicular to this, the participants were divided into low-and high-fluid intelligence groups and into young - old and old - old age groups. Participants performed a website information retrieval task using three health information websites. Performance was assessed by the time taken to retrieve target information. Overall, the three websites significantly differed in the time taken to locate the target information. The website task performance was not significantly influenced by fluid intelligence score or age, but there was a significant influence by prior website experience.
Efficient routing in intermittently connected mobile networks: the single-copy case
Authors: Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks (VANETs), etc. In this context, conventional routing schemes would fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. With this in mind, we look into a number of "single-copy" routing schemes that use only one copy per message, and hence significantly reduce the resource requirements of flooding-based algorithms. We perform a detailed exploration of the single-copy routing space in order to identify efficient single-copy solutions that (i) can be employed when low resource usage is critical, and (ii) can help improve the design of general routing schemes that use multiple copies. We also propose a theoretical framework that we use to analyze the performance of all single-copy schemes presented, and to derive upper and lower bounds on the delay of any scheme.
Energy-optimal software partitioning in heterogeneous multiprocessor embedded systems
Authors: Michel Goraczko, Jie Liu, Dimitrios Lymberopoulos, Slobodan Matic, Bodhi Priyantha, Feng Zhao
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applications. In this paper, we present a resource model that considers the time and energy costs of run-time mode switching, which considerably improves the accuracy of existing models. Given an application, the software partitioning problem then becomes an optimization over energy cost given deadline constraints, which can be formulate as an integer linear programming (ILP) problem. We apply the resource modeling and software partitioning techniques to a multimodule embedded sensing device, the mPlatform, and present a case study of configuring the platform for a real-time sound source localization application on a stack of MSP430 and ARM7 processor based sensing and processing boards.
Analysis of the initial point separate surface for the minimal-time system design process
Authors: Alexander Zemliak, Pedro Miranda
Venue: Proceedings of the 9th International Conference on Circuits (2005)

The set of the different design strategies for analog system design were analyzed on the basis of the new system design methodology. Optimal position for the design algorithm start point was analyzed to minimize the computer design time. The initial point selection has been done on the basis of the before discovered acceleration effect of the system design process. The geometrical dividing surface was defined and analyzed to obtain the optimal position of the algorithm start point. Numerical results of both passive and active nonlinear electronic circuit design prove the possibility of the optimal selection of the design algorithm start point.
A simplified analytical approach for efficiency evaluation of the weaving machines with filling break tolerance
Authors: Doina Cascaval, Petru Cascaval
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

A machine interference problem is treated in this paper. For a group of weaving machines with filling break tolerance, served by one or more weavers, two indicators must be evaluated: the efficiency of the weaving machines and the percentage of working time for the weavers. Two different approaches are available: analytical approach, based on Markov chains, and simulation. A reduced Markov model able to evaluate with accuracy the indicators previously defined is proposed in this paper. A case study in which analytical and simulation results are compared demonstrates the effectiveness of this simplified analytical approach.
Partial snapshot objects
Authors: Hagit Attiya, Rachid Guerraoui, Eric Ruppert
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We introduce a generalization of the atomic snapshot object, which we call the partial snapshot object. This object stores a vector of values. Processes may write components of the vector individually or atomically read any subset of the components. We investigate implementations of the latter partial scan operation that are more efficient than the complete scans of traditional snapshot objects. We present an algorithm that is based on a new implementation of the active set abstraction, which may be of independent interest.
Development tool for DSP architectures
Authors: Alexandru Onea, Vasile Horga, Marcel Ratoi
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

This paper presents Windows-based application, designed in order to assist a control algorithms developer in research and/or development activities. The application solves the main requirements needed in such a work. A new approach in software development was followed in order to obtain flexible and reusable DSP digital control applications. It was used a standard promoted by Texas Instruments that stimulates software modularity strategy. Experimental results show an implementation example of a modular control application using MSK243 DSP Motion Starter Kit. The software product can be used in educational process and in research as well.
Control of incompletely controllable differential-difference systems with delay
Authors: V. E. Khartovskii
Venue: Automation and Remote Control (2008)

A problem of control of linear autonomous differential-difference systems for violation of the condition of complete controllability and uncontrolled initial state is studied. A problem of system trajectory nullification and its delay there within any specified time period is posed. A new condition for solvability of this problem is proved and a constructive solution is proposed.
Securing Java code: heuristics and an evaluation of static analysis tools
Authors: Michael S. Ware, Christopher J. Fox
Venue: Proceedings of the 2008 workshop on Static analysis (2008)

A secure coding standard for Java does not exist. Even if a standard did exist, it is not known how well static analysis tools could enforce it. In this work, we show how well eight static analysis tools can identify violations of a comprehensive collection of coding heuristics for increasing the quality and security of Java SE code. A new taxonomy for correlating coding heuristics with the design principles they help to achieve is also described. The taxonomy aims to make understanding, applying, and remembering both principles and heuristics easier. A significant number of secure coding violations, some of which make attacks possible, were not identified by any tool. Even if all eight tools were combined into a single tool, more than half of the violations included in the study would not be identified.
Organizational culture as determinant of enterprise information systems use in police investigations
Authors: P. Gottschalk
Venue: Enterprise Information Systems (2007)

Police investigation units represent a knowledge-intensive and time-critical environment. The amount of information that detectives come into contact within the course of their work is astounding, and enterprise information systems are applied to support knowledge work. Organizational culture is found to have a significant influence on the extent of systems use. Four dimensions of occupational culture were applied in this research: team culture, planning culture, theoretical culture, and traditional culture. Only the extent of team culture was found to have a significant influence on the extent of systems use.