ppxscal/embedding_network huggingface dataset:
Delay Analysis in Temperature-Constrained Hard Real-Time Systems with General Task Arrivals
Authors: Shengquan Wang, Riccardo Bettati
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

In this paper, we study temperature-constrained hard realtime systems, where real-time guarantees must be met without exceeding safe temperature levels within the processor. Dynamic speed scaling is one of the major techniques to manage power so as to maintain safe temperature levels. As example, we adopt a simple reactive speed control technique in our work. We design a methodology to perform delay analysis for general task arrivals under reactive speed control with First-In-First-Out (FIFO) scheduling and Static-Priority (SP) scheduling. As a special case, we obtain a close-form delay formula for the leakybucket task arrival model. Our data show how simple reactive speed control can decrease the delay of tasks compared with any constant-speed scheme.
A receiver-centric transport protocol for mobile hosts with heterogeneous wireless interfaces
Authors: Kyu-Han Kim, Yujie Zhu, Raghupathy Sivakumar, Hung-Yun Hsieh
Venue: Wireless Networks (2005)

Numerous transport protocols have been proposed in related work for use by mobile hosts over wireless environments. A common theme among the design of such protocols is that they specifically address the distinct characteristics of the last-hop wireless link, such as random wireless errors, round-trip time variations, blackouts, handoffs, etc. In this paper, we argue that due to the defining role played by the wireless link on a connection's performance, locating the intelligence of a transport protocol at the mobile host that is adjacent to the wireless link can result in distinct performance advantages. To this end, we present a receiver-centric transport protocol called RCP (Reception Control Protocol) that is a TCP clone in its general behavior, but allows for better congestion control, loss recovery, and power management mechanisms compared to sender-centric approaches. More importantly, in the context of recent trends where mobile hosts are increasingly being equipped with multiple interfaces providing access to heterogeneous wireless networks, we show that a receiver-centric protocol such as RCP can enable a powerful and comprehensive transport layer solution for such multi-homed hosts. Specifically, we describe how RCP can be used to provide: (i) a scalable solution to support interface specific congestion control for a single active connection; (ii) seamless server migration capability during handoffs; and (iii) effective bandwidth aggregation when receiving data through multiple interfaces, either from one server, or from multiple replicated servers. We use both packet level simulations, and real Internet experiments to evaluate the proposed protocol.
Fuzzy Sliding Mode Constrained input Control for Robotic Manipulators Based on Systemic State
Authors: Wang Xin, Wei-Dong Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A novel fuzzy sliding mode controller for robotic manipulators is proposed. The use of a boundary layer in sliding-mode control has been a common technique to reduce chattering of the control input. However, different choices of the boundary layer width lead to conflicting effects. We apply fuzzy logic to adjusting the width ofthe boundary layer based on the state. The method can effectively eliminate chattering and ensure almost peflect control accuracy at the same time. However, the intelligent control strategies have high control input requirement, which conjnes the practical application of modern control strategies in large extent So we add consrrained input control strategies in the controller; and present fizzy sliding mode constrained input controller based on systemic state. Simulations are given on a two-link robot in the end of paper; and the results show superior control performance than the conventional sliding mode controller for robot manipulators control.
Semantic and Visual Determinants of Face Recognition in a Prosopagnosic Patient
Authors: Mike J. Dixon, Daniel N. Bub, Martin Arguin
Venue: Journal of Cognitive Neuroscience (1998)

Prosopagnosia is the neuropathological inability to recognize familiar people by their faces. It can occur in isolation or can coincide with recognition deficits for other nonface objects. Often, patients whose prosopagnosia is accompanied by object recognition difficulties have more trouble identifying certain categories of objects relative to others. In previous research, we demonstrated that objects that shared multiple visual features and were semantically close posed severe recognition difficulties for a patient with temporal lobe damage. We now demonstrate that this patient's face recognition is constrained by these same parameters. The prosopagnosic pa tient ELM had difficulties pairing faces to names when the faces shared visual features and the names were semantically related (e.g., Tonya Harding, Nancy Kerrigan, and Jos&eacute;e Chouinard&mdash; three ice skaters). He made tenfold fewer errors when the exact same faces were associated with semantically unrelated people (e.g., singer Celine Dion, actress Betty Grable, and First Lady Hillary Clinton). We conclude that prosopagnosia and co-occurring category-specific recognition problems both stem from difficulties disambiguating the stored representations of objects that share multiple visual features and refer to semantically close identities or concepts.
Paid peering among internet service providers
Authors: Gireesh Shrimali, Sunil Kumar
Venue: Proceeding from the 2006 workshop on Game theory for communications and networks (2006)

We develop models for Internet Service Provider (ISP) peering when ISPs charge each other for carrying traffic. We study linear pricing schemes in a simple ISP peering model using a two stage sequential Nash game in which self interested providers first set linear prices for carrying peers' traffic and then choose to route their traffic according to the prices set and costs incurred by carrying traffic on their links. Under reasonable cost models, we show that rational ISPs will participate in this game. Moreover, we show that the ISP with the lower marginal cost in the absence of peering has no incentive to send traffic in a hot-potato fashion and effectively acts as a monopolist. The other provider strategically routes traffic, splitting between hot-potato and cold-potato routing. We also show that though this outcome is inefficient, both ISPs are strictly better off when compared to not peering at all. Finally, we consider appropriate cost models that make the notion of capacity explicit. Under certain conditions we show not only that the monopolist has an incentive to upgrade the capacity of its links but also that this incentive is higher when the monopolist is in a peering relationship.
Digital invisible ink and its applications in steganography
Authors: Chun-Hsiang Huang, Shang-Chih Chuang, Ja-Ling Wu
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

A novel information-hiding methodology denoted as digital invisible ink is introduced. The proposed approach is inspired by the invisible ink in the real world and can be regarded as an extension of the informed-embedding methodology. Messages hidden in digital contents using digital invisible ink cannot be correctly or clearly revealed unless certain pre-negotiated manipulations have been applied to the marked work. To facilitate such behavior, models and implementations based on both spread-spectrum and quantization-based watermarking approaches are investigated. Finally, benefits and limitations for applying digital invisible ink in common steganography systems and secret communications enabling plausible deniability are discussed.
Supplementary Interworking Architecture for Hybrid Data Networks (UMTS-WiMAX)
Authors: Shahbaz Khan, Shoaib Khan, Sahibzada Ali Mahmud, Hamed Al-Raweshidy
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The future of wireless communications will mainly focus on user centricity and personalization. Multiple networks will be overlaid to provide supplemented connectivity to a user. Competitive options in the current communication technologies need to be carefully studied for designing an interworking solution. Extensive amount of work is done on interworking of UMTS (Universal Mobile Telecommunications System) with WiFi (Wireless Fidelity). However, due to WiFi's limited coverage it could not offer all benefits associated with interworking. With more recent technologies like WiMAX (Worldwide interoperability for Microwave Access) in the market; which offers wireless broadband access with mobility support (IEEE 802.16e), and can be deployed for a wider coverage; we can interwork it with UMTS for enhancing its performance. In this paper we present the Interworking architecture of WiMAX with UMTS. We highlight a scenario where a UMTS operator can control access of a client within two networks (UMTS, WiMAX) and port packet-data to a supportive network in the last mile. We also discuss the commercial viability for this architecture.
Flexible Bus and NoC Performance Analysis with Configurable Synthetic Workloads
Authors: Rikard Thid, Ingo Sander, Axel Jantsch
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

We present a flexible method for bus and network on chip performance analysis, which is based on the adaptation of workload models to resemble various applications. Our analysis method assists in the selection of a communication infrastructure early in the design process. The method uses (1) synthetic workload models which are similar to timed Petri nets and (2) the b-model for self-similar workloads. This allows the exploration of larger portions of the design space than possible with traditional stochastic models. The method is illustrated with tutorial examples where both a NoC and a bus based platform are analyzed.
Representation of Change: Separate Electrophysiological Markers of Attention, Awareness, and Implicit Processing
Authors: Diego Fernandez-Duque
Venue: Journal of Cognitive Neuroscience (2003)

Awareness of change within a visual scene only occurs in the presence of focused attention. When two versions of a complex scene are presented in alternating sequence separated by a blank mask, unattended changes usually remain undetected, although they may be represented implicitly. To test whether awareness of change and focused attention had the same or separable neurophysiological substrates, and to search for the neural substrates of implicit representation of change, we recorded event-related brain potentials (ERPs) during a change blindness task. Relative to active search, focusing attention in the absence of a change enhanced an ERP component over frontal sites around 100-300 msec after stimulus onset, and in posterior sites at the 150-300 msec window. Focusing attention to the location of a change that subjects were aware of, replicated those attentional effects, but also produced a unique positive deflection in the 350-600 msec window, broadly distributed with its epicenter in mediocentral areas. The unique topography and time course of this latter modulation, together with its dependence on the aware perception of change, distinguishes this "awareness of change" electrophysiological response from the electrophysiological effects of focused attention. Finally, implicit representation of change elicited a distinct electrophysiological event: Unaware changes triggered a positive deflection at the 240-300 msec window, relative to trials with no change. Overall, the present data suggest that attention, awareness of change, and implicit representation of change may be mediated by separate underlying systems.
Empirical Analysis of Company's Performance and Governance Structure of Listed Companies of High-Tech in China
Authors: Ye Liu, Lina Qin
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

This paper examines the relativity between the corporate governance structure and the corporate value in China's listed high-tech companies based on a sample of 40 enterprises listed on the Shanghai stock market and Shenzhen stock market. The result of study indicates that there are distinctively negative correlation between Tobin's Q ratio and company's scale, and positive correlation between ROE and company's scale in enterprises of high-tech. By finding out the characteristics of corporate governance suitable for the corporate development, the paper contributes to bring forward some suggestion on perfecting corporate governance structure in the enterprises of high-tech in our country.
An Empirical Study on Consumer Behavior in the Interaction with Knowledge-based Recommender Applications
Authors: A. Felfernig, B. Gula
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Knowledge-based recommender technologies provide a couple of mechanisms for improving the accessibility of product assortments for customers, e.g., in situations where no solution can be found for a given set of customer requirements, the recommender application calculates a set of repair actions which can guarantee the identification of a solution. Further examples for such mechanisms are explanations or product comparisons. All these mechanisms have a certain effect on the behavior of customers interacting with a recommender application. In this paper we present results from a user study, which focused on the analysis of effects of different recommendation mechanisms on the overall customer acceptance of recommender technologies.
Object-oriented cohesion subjectivity amongst experienced and novice developers: an empirical study
Authors: Steve Counsell, Stephen Swift, Allan Tucker, Emilia Mendes
Venue: ACM SIGSOFT Software Engineering Notes (2006)

The concept of software cohesion in both the procedural and object-oriented paradigm is well known and documented. What is not so well known or documented is the perception of what empirically constitutes a cohesive 'unit' by software engineers. In this paper, we describe an empirical investigation using object-oriented (OO) classes as a basis. Twenty-four subjects (drawn from IT experienced and novice groups) were asked to rate ten classes sampled from two industrial systems in terms of their overall cohesiveness; a class environment was used to carry out the study. Three hypotheses were investigated as part of the study, relating to class size, the role of comment lines and the differences between the two groups in terms of how they rated cohesion. Several key results were observed. Firstly, class size (when expressed in terms of number of methods) only influenced the perception of cohesion by novice subjects. Secondly, well-commented classes were rated more highly amongst IT experienced than novice subjects. Thirdly, results suggest strongly that cohesion comprises a combination of various class factors including low coupling, small numbers of attributes and well-commented methods, rather than any single, individual class feature per se. Finally, if the research supports the view that cohesion is a subjective concept reflecting a cognitive combination of class features then cohesion is also a surrogate for class comprehension.
High Performance Computing as an Educational Experience well Suited to Developing Nations
Authors: Fred L. Kitchens
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

Universities are challenged to provide students with a strong practical understanding of technologies, while providing enough hands-on experience to solve real problems. Universities in developing nations have the same challenges as other universities; but are also forced to deal with a lack of technological resources and substandard conditions. One solution is to offer a 'cluster computing' course. Building a cluster requires the integration and application of many technical concepts. Theoretical and technical challenges make it an absorbing and rewarding course. High performance computing was once limited to major institutions with huge funds. Low-cost commodity hardware, free operating systems and faster, lower cost networking and cluster computing concepts have made it possible for institutions at all levels to provide high performance computing to their students and researchers. This paper describes possible methods of teaching cluster computing in a developing nation, given the conditions in most areas and the lack of resources.
Modeling Ad-hoc rushing attack in a negligibility-based security framework
Authors: Jiejun Kong, Xiaoyan Hong, Mario Gerla
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bounded adversary model, the cost of attack and the cost of defense. In a complex and probabilistic system, we speak of the "infeasibility" of breaking the security system rather than the "impossibility" of breaking the same system. Security is defined on the concept of "negligible", which is asymptotically sub-polynomial with respect to a pre-defined system parameter x. Intuitively, the parameter x in cryptography is the key length n. We apply the same bounds in ad hoc network security research, but in regard to scalability from now on. We propose an RP (n-runs) complexity class with a global virtual god oracle (GVG) to model a general class of network protocols. In GVG-RP (n-runs) class, the network scale (i.e., number of network members) N replaces the role of key length n in cryptography. From our formal rigorous treatment, we show that "rushing attack" is a severe attack that can reduce the success probability of common ad hoc routing schemes to negligible.Fortunately, countermeasures can be devised to answer this challenge. (1) Common network protocols are not designed to ensure that probability of security failure is negligible. In such designs, the system's security is not related to scalability. There is no asymptotic security guarantee in the network design; (2) We seek to devise security schemes to ensure that the probability of security failure is negligible in regard to network scale. In Theorem 2, we present an asymptotic invariant for scalable networks: "a polynomial-time network algorithm that ensures negligible probability of security failure at each step would stay in the state of ensuring negligible probability of security failure globally". This invariant demonstrates the existence of asymptotic security guarantee in ad hoc networks. It leads to the design of community-based secure routing to defend against rushing attacks. Nevertheless, it is unknown to us whether the ideal invariant can be practically implemented.
Damage detection of coupled bridge deck-girder system
Authors: S. Roy, S. Chakraborty, S. K. Sarkar
Venue: Finite Elements in Analysis and Design (2006)

An equation error based approach of structural damage quantification at element level is presented in this paper. The proposed equation error approach is found to be efficient for identifying the properties of structure at element level directly without iterations. But its application in literature is limited to truss type structures only. The equation error based identification algorithm is readily developed for structural system coupled with beam and plate element so that it can be applied to assess the damage of bridge deck-girder system. The inverse method proposed here utilize modal frequencies and mode shapes of the damaged structure to identify the structural properties locally. The formulation is elucidated through a typical longitudinal and cross girder system monolithic with deck slab. Various feasible damage scenarios are considered to establish the identifiability of the proposed algorithm using numerically simulated modal data obtained through finite element analysis software. A Monte Carlo based error sensitivity analysis is also performed to study the robustness of the algorithm.
Who's in Control? Proficiency and L1 Influence on L2 Processing
Authors: Kerrie E. Elston-güttler, Silke Paulmann, Sonja A. Kotz
Venue: Journal of Cognitive Neuroscience (2005)

We report three reaction time (RT)/event-related brain potential (ERP) semantic priming lexical decision experiments that explore the following in relation to L1 activation during L2 processing: (1) the role of L2 proficiency, (2) the role of sentence context, and (3) the locus of L1 activations (orthographic vs. semantic). All experiments used German (L1) homonyms translated into English (L2) to form prime&ndash;target pairs (pine&ndash;jaw for Kiefer) to test whether the L1 caused interference in an all-L2 experiment. Both RTs and ERPs were measured on targets. Experiment 1 revealed reversed priming in the N200 component and RTs for low-proficiency learners, but only RT interference for high-proficiency participants. Experiment 2 showed that once the words were processed in sentence context, the low-proficiency participants still showed reversed N200 and RT priming, whereas the high-proficiency group showed no effects. Experiment 3 tested native English speakers with the words in sentence context and showed a null result comparable to the high-proficiency group. Based on these results, we argue that cognitive control relating to translational activation is modulated by (1) L2 proficiency, as the early interference in the N200 was observed only for low-proficiency learners, and (2) sentence context, as it helps high-proficiency learners control L1 activation. As reversed priming was observed in the N200 and not the N400 component, we argue that (3) the locus of the L1 activations was orthographic. Implications in terms of bilingual word recognition and the functional role of the N200 ERP component are discussed.
Mathematical Model for the Optimal Design of Long Pressurized Water Supply Transmission Lines
Authors: ManLin Zhu, YanHe Zhang, Tao Wang, Bing Shen
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Most long-distance water transmission pipelines are designed and constructed on the basis of constant diameter pipe; which is not always the optimum solution for this type of pipeline. Generally, the capital and operational costs of a long-distance water transmission project are very high. Therefore optimal design of a long distance transmission line is extremely valuable for lowering the project's capital costs and operational costs. This study establishes a linear programming model which determines the minimum project cost of a long distance water transmission system, as well as a mathematical model for the optimal design of the system in order to achieve a minimum annual cost for the transmission system. This model can then be used in the optimal design of long distance water transmission line projects.