ppxscal/embedding_network huggingface dataset:
A-sLEACH: An Advanced Solar Aware Leach Protocol for Energy Efficient Routing in Wireless Sensor Networks
Authors: Junayed Islam, Muhidul Islam, Nazrul Islam
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Energy consumption plays a crucial role in Wireless Sensor Networks as these networks are designed to be placed in hostile and non-accessible areas. While battery-driven sensors will run out of battery sooner or later, the use of renewable energy sources such as solar power extends the lifetime of a sensor network. We propose a solar-aware, scheduled clustered routing protocol A-sLEACH which is an extension to sLEACH for routing and MTE for radio model. Simulation results of applying such scheme shows better performance compared to MTE and sLEACH.
Stochastic Object-Based Graph Grammars
Authors: Odorico M. Mendizabal, Fernando L. Dotti, Leila Ribeiro
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Object-Based Graph Grammar (OBGG) is a formal visual language suited to the specification of asynchronous distributed systems based on message passing. Model-checking of OBGG models is currently supported and a series of case studies have been developed. However, in many situations one has to evaluate non-functional aspects like availability and performance of the system under consideration. In such cases, a stochastic analysis of the system is desired. This paper is a first contribution to the stochastic analysis of OBGG models. OBGG models with occurrence rates associated to rules are translated to Stochastic Automata Networks (SAN). SAN is a Markov Chain equivalent formalism having as advantage its modularity in terms of representation and a compact mathematical solution, allowing the analysis of models with larger state space.
A Characterization of Scalable Shared Memories
Authors: Prince Kohli, Gil Neiger, Mustaque Ahamad
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

The traditional consistency requirements of shared memory are expensive to provide both in large scale multiprocessor systems and in distributed systems that implement a shared memory abstraction. As a result, several memory systems have been proposed that enhance performance and scalabil ity by providing weaker consistency. The differing models used to describe such memories make it difficult to relate and compare them. We develop a simple non-operational model and identify parameters that can be varied to de scribe existing memories and to identify new ones. We show how a uniform framework makes it easy to compare and relate various memories.
A Heuristic Approach to Learning Rules from Fuzzy Databases
Authors: Jose Ranilla, Luis J. Rodriguez-Muniz
Venue: IEEE Intelligent Systems (2007)

Decision-tree induction and rule-learning methods have proved efficient for concept-learning and data-mining tasks. Modifications to successful algorithms learned from crisp data enable them to deal with cognitive uncertainties that, in general, use entropy as the measurement to select relevant characteristics for the learning task. A proposed heuristic approach induces rules from fuzzy databases, supported by an extension to the fuzzy case of a classical case metric, called the impurity level. An illustrative example tests the algorithm with some data sets and compares it with similar systems.
A flexible curriculum for computer science undergraduate major
Authors: A. Manacero
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This paper describes an innovative approach to establish a computer science curriculum, aiming flexibility and minimization of the time spent in the classrooms. This approach has been developed at the Paulista State University - Unesp - at Sao Jose do Rio Preto, Brazil, and is producing very interesting results. The load reduction is achieved through a series of fundamental core and breadth courses that precede depth courses in specific areas. The flexibility comes as a side effect of the depth courses, which can be adapted without any changes in the core courses. In this paper, the authors fully describe their motivations, actions and results.
A H.26L intra/inter mode switching decision scheme for wireless channel
Authors: Chen Chuan, Songyu Yu, Lianji Cheng
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper proposes a rate-distortion (RD) based optimal macroblock (MB) intra/inter mode switching decision scheme for a H.26L video stream under wireless error channel. Based on the statistics model of error propagation, this work adopts a reduced computation RD optimal mode switching decision scheme. It can come up with a higher error robustness video stream than the conventional H.26L mode decision algorithm and multiple decoder algorithm. The experimental results under typical 3GPP/3GPP2 channel condition show that it has robust error resilient ability and good stability.
Partition Refinement in Abstract Model Checking
Authors: Fei Pu, Wenhui Zhang
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Model checking has been successfully applied to system verification. However, in model checking, the state explosion problem occurs when one checks systems of industrial size. Abstraction-based methods have been particularly successful in this regard. This paper describes a technique to decompose a model checking problem into sub-problems by partitioning the search space. The partitioning is based on the usage of extra variables remembering the history of non-deterministic choices in the model. Furthermore, the search space can be partitioned stepwise in order to get better reduction. Finally, the partition-refinement paradigm is extended to the setting of abstract systems. We show how the partition-based approach used in abstract model checking can improve the efficiency of verification with respect to the requirement of memory by illustrating an application example.
Corpora for the evaluation of speaker recognition systems
Authors: Qi Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Using standard speech corpora for development and evaluation has proven to be very valuable in promoting progress in speech and speaker recognition research. In this paper, we present an overview of current publicly available corpora intended for speaker recognition research and evaluation. We outline the corpora's salient features with respect to their suitability for conducting speaker recognition experiments and evaluations. We hope to increase the awareness and use of these standard corpora and corresponding evaluation procedures throughout the speaker recognition community.
Management interface for programmable end-to-end 'data connectivity' provisioning
Authors: K. Ravindran
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

The paper describes a management-oriented model for cost-effective 'data connectivity' provisioning between the peer entities of a networked multimedia application. The 'connectivity' service provider (SP) may maintain multiple protocol mechanisms to support its clientele: ranging between bandwidth-reserved paths to bandwidth-shared paths. Client applications prescribe the required QoS obligations through a service interface, with the SP instantiating one of the protocol modules with appropriate parameters to meet the QoS requirements. The model allows dynamic switching from one protocol module to another, based on a notion of cost associated with bandwidth usage by the network infrastructure for a given level of QoS offering. The management functions of SP monitor the changes and/or outages in network bandwidth in a dynamic setting, and map them into connectivity costs incurred by the selected protocol mechanism. The paper describes the signaling required between the SP and network infrastructure to install appropriate policy functions that can make the connectivity provisioning cost-optimal.
Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces
Authors: Marta Fort, J. Antoni Sellares
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites.
How to Induce the Beholder to Persuade Himself: Learning from Advertising Research for Information Visualization
Authors: Ralph Lengler
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Research on the interplay of cognition and effect in the interpretation of visuals has made significant theoretical advances. This literature review highlights three themes which have emerged in advertising research. First it looks at the determinants constituting and influencing 'likeability'- the best predictor of advertisement effectiveness. Second it presents evidence how emotional advertising frames and shapes perception and how it could influence persuasion. Finally it discusses the role of "coauthoring' in the interpretation of visuals and how it does affect persuasion over the emotional route.
The future for engineering education: faculty rewards and incentives
Authors: E. W. Ernst
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Several groups share responsibility for the quality of engineering education: students, faculty, and the administration. A faculty that is diverse in cultural and professional experiences, that is committed to life-long learning and scholarship, and that places primary emphasis on the education of engineering professionals determine in a crucial way, the quality of engineering education. As such, the rewards and incentives become important for promoting the contributions of all faculty. The reward system should recognize appropriate contributions including those that in the past may have received less recognition and remuneration. The reward system is the driving force which encourages faculty to invest the energy to make the changes necessary to reform engineering education; thus, changing the faculty reward system becomes a critical task. The traditional role for college and university faculty includes a balance of teaching, research, and public service among their activities. However, conventional wisdom has become, increasingly, that the one role for faculty that counts is research-research that brings grants and results and publications. This view has brought greater attention to graduate study and research and lesser attention to undergraduate study in our nation's colleges of engineering.
Assessing Users' Attachment to Their Mobile Devices
Authors: Kai Wehmeyer
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Mobile devices are often described as very personal objects and users are said to develop deep relationships with them. Motivated by such recurring statements, this paper introduces user-device attachment as a concept describing the relationship between users and their mobile devices. By drawing on literature from marketing, HCI, and sociology, the domain and dimensions of userdevice attachment are described. Three dimensions: symbolism, aesthetics, and perceived necessity are conceptualized to represent elements of user-device attachment. An initial instrument for measurement is developed and assessed with exploratory and confirmatory factor analyses. Corresponding with the conceptualized dimensions, a three-factor solution was found and confirmed using data gathered in two surveys (n1=130, n2=323). The resulting instrument provides a basis for future discussions and conceptual and empirical work on the phenomenon of user-device attachment in mobile user behavior. Possible benefits of applying the construct to areas like mobile advertising and mobile service development are identified.
ActiveForms: A Runtime for Mobile Application Forms
Authors: Suresh Chande, Lasse Pajunen
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

ActiveForms is a mobile centric runtime environment which provides users with a rich and unified experience for interacting over different communication channels. It provides mobile forms based user interface for interacting with the underlying mobile applications and services. ActiveForms provides a common runtime environment which helps to compose underlying applications and services along with different communication channels, such as HTTP, MMS, SMS or Bluetooth, into a manageable process oriented application. ActiveForms is a research prototype developed for smart phone environments. It utilizes standards based technologies for user interface such as XHTML and mobile Forms and for business logic it is based on Web Services Business Process Execution Language (WSBPEL). In this paper we will emphasize the layered architecture of ActiveForms, discuss the separation of user interface from integration logic that composes the underlying applications and services into a process oriented system. We will also discuss our experiences and learning.
A Model for Automatic On-Line Process Behavior Extraction, Classification and Prediction in Heterogeneous Distributed Systems
Authors: Evgueni Dodonov, Rodrigo Fernandes de Mello
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The performance of distributed computing is usually lim- ited by the heterogeneous nature of distributed systems, data transfer rate and access latency. Techniques such as adaptive process migration, data caching and prefetching were developed to overcome this limitation. However, such techniques require the knowledge of application behavior in order to be effective. In this sense, we intend to propose a new model for application behavior prediction that, by clas- sifying and analyzing application access patterns, is able to predict future application behavior. The model aims to allow a transparent and automatic process behavior extraction, classification and prediction, using a variable set of techniques, including stochastic models and artificial intelligence-based approaches.
3D shape estimation and texture generation using texture foreshortening cues
Authors: Jeffrey B. Colombe
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

The surfaces of 3D objects may be represented as a connected distribution of surface patches that point in various directions with respect to the observer. Viewpoint-normal patches are those whose tangent plane is perpendicular to the line of sight. Foreshortening of surface patches results from their obliquity, with a directional wavelength compression, and an accompanying 1-dimensional stretching of the spatial frequency distribution. This stretching of spatial frequency distributions was used to generate plausible depth illusions via local foreshortening of surface textures rendered from a stretched spatial frequency envelope. Texture foreshortening cues were exploited by a multi-stage image analysis method that revealed local dominant orientation, degree of orientation dominance, relative power in spatial frequencies at a given orientation, and a measure of local surface obliquity, which provides incomplete but useful information in a multi-cue depth estimation framework.
Measuring and Analyzing Parallel Computing Scalability
Authors: Xiaodong Zhang, Yong Yan, Qian Ma
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

In this paper we compare a group of existing scalability metrics and evaluation models through experiments and analyses. This work is mainly motivated by an experimental metric using network latency to measure and evaluate the scalability of parallel programs and architectures. Experiments of running a large physics simulation program and its scaling variations on the KSR-1 multiprocessor have been intensively conducted in this study. The scalability data are collected and visualized by an integrated software environment, called S-Graph. Our objectives are to address fundamental issues of parallel computing scalability, such as evaluation models, analytical and experimental metrics, and measurement methodology; to examine latency patterns inherent in the architecture and the program and their effects on scalability; and to evaluate relative merits and limits of several existing metrics. Our comparisons indicate that both time-bound and memory-bound models have their limitations for evaluating scalability performance, while efficiency-based model could obtain reasonably precise measurements.
An adaptable ellipsoidal head model for the interaural time difference
Authors: R. O. Duda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Experimentally measured head-related transfer functions reveal that the interaural time delay varies from person to person. Furthermore, it is not constant around a cone of confusion, but can vary by as much as 18% of the maximum interaural delay. The major sources for this variation are shown to be the shape of the head and the displacement of the ears from the center of the head. A simple ellipsoidal head model is presented that can accurately account for this ITD variation and can be adapted to individual listeners.
Performance Estimation of TCP under SYN Flood Attacks
Authors: Takuo Nakashima, Toshinori Sueyoshi
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

The SYN flood attack is a DoS(Denial of Service) method affecting hosts to retain the half-open state and causing to exhaust it's memory resources. This attack is hardly filtered by the router in such a case that the source IP address is spoofed. In this paper, we present the performance estimation of TCP under SYN flood attacks and propose a detective method at an early stage. We implement a attacking program, and observe response packets from the server on different OS's. Our performance estimation explores the metric to detect a condition caused by SYN flood attacks. Firstly, the observation of response packets leads to find the most sensitive metric and it's threshold. Secondly, the packet loss rate is adopted as the metric to identify whether the server is attacked or not. Finally, we detect the slight variations of response packet if the value exceeds the pre-determined threshold value, then the detective host sends the RST packet to release the half-open state on TCP.
Robust memory-efficient data level information fusion of multi-modal biometric images
Authors: Afzel Noore, Richa Singh, Mayank Vatsa
Venue: Information Fusion (2007)

This paper presents a novel multi-level wavelet based fusion algorithm that combines information from fingerprint, face, iris, and signature images of an individual into a single composite image. The proposed approach reduces the memory size, increases the recognition accuracy using multi-modal biometric features, and withstands common attacks such as smoothing, cropping, JPEG 2000, and filtering due to tampering. The fusion algorithm is validated using the verification algorithms we developed, existing algorithms, and commercial algorithm. In addition to our multi-modal database, experiments are also performed on other well known databases such as FERET face database and CASIA iris database. The effectiveness of the fusion algorithm is experimentally validated by computing the matching scores and the equal error rates before fusion, after reconstruction of biometric images, and when the composite fused image is subjected to both frequency and geometric attacks. The results show that the fusion process reduced the memory required for storing the multi-modal images by 75%. The integrity of biometric features and the recognition performance of the resulting composite fused image is not affected significantly. The complexity of the fusion and the reconstruction algorithms is O(nlogn) and is suitable for many real-time applications. We also propose a multi-modal biometric algorithm that further reduces the equal error rate compared to individual biometric images.
Using Jaza to Animate RoZ Specifications of UML Class Diagrams
Authors: Y. Ledru
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

One of the goals of the integration of formal and graphical methods is to reuse tool support associated with formal methods. This paper reports on a combination of the Jaza Z animator with the RoZ tool. RoZ produces a Z specification from an annotated UML class diagram. It also generates the specification of basic operations associated to the diagram. The paper recalls the principles of the RoZ tool, gives a typical animation session, and discusses how RoZ and class diagrams must be adapted to support animation.
An Integrated Scheduling and Retransmission Proposal for Firm Real-Time Traffic in IEEE 802.11e
Authors: Douglas Dimi Demarch, Leandro Buss Becker
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

This work investigates the problem of scheduling network resources in the context of a cooperative mobile multi-robot system that exchanges messages with firm real-time constraints using a wireless network compliant with the recently created IEEE 802.11e amendment. Given the physical characteristics of wireless communication, message retransmission becomes a crucial issue, especially in a realtime application. Experiments performed in the context of this work show that the regular approach for retransmission proposed in the IEEE 802.11e is not suitable for real-time applications that require a certain level of reliability. To tackle this problem, the current work proposes a new mechanism called Integrated Scheduling and Retransmission Approach (ISRA) that integrates messages scheduling and retransmission in a unified manner at the MAC layer. Our proposal is able to deal with residual transmission errors and thereby increases the reliability level of the real-time messages. Our approach is evaluated through simulations for different scenarios of traffic load and compared with the standard approach of the 802.11e for scheduling and retransmission of real-time messages. Obtained results show that ISRA presents a high adaptability and does not get affected by variations in the network load or topology.