ppxscal/embedding_network huggingface dataset:
Performance of MC-CDMA Based on Feedback Pre-equalization Method in Uplink Channel
Authors: Xiao-Peng Yang, Hao-Shan Shi, Kun Yao
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

This paper proposes a feedback pre-equalization (F-PE) method based on channel estimation in uplink channel. The transmitter signal is pre-equalized in transmitter by channel estimate information, which form downlink pilot channel. In receiver, the orthognality of each spreading code is restored, but the power of noise isn't increased. So, the BER performance is improved. Figs.2 through 6 give the simulation results. The F-PE method shows the best BER performance among EGC, MRC, and ORC methods both in synchronous and asynchronous channel.
Issues in the transmission, analysis, storage and retrieval of surveillance video
Authors: D. Doermann, A. Karunanidhi, N. Parkeh, M. A. Khan, S. Chen
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Increased network capabilities and the prevalence of wireless networks have provided an environment where data and compute intensive surveillance applications can be realized as part of existing infrastructures. Nevertheless, careful consideration must be given to how such systems are designed an implemented. In our efforts to consider pervasive surveillance applications, this paper highlights some of the primarily issues related to the transmission, analysis, storage and retrieval of surveillance video and briefly describes our framework for video surveillance from mobile devices.
Timer-based protocols in ad hoc and sensor networks
Authors: Min-Te Sun
Venue:  (2006)

Wireless ad hoc and sensor networks present the next great challenge for distributed system research. In wireless ad hoc and sensor networks, each node participates the routing process that allows a packet to be forwarded from its source to the destination. Protocols that support communications in such networks have to take into account the mobility of the participants and the status of links between nodes. In general, a distributed system is defined as a collection of autonomous components that are interconnected through a network and distributed middleware. A distributed system coordinates the events of components to share resources and give users the perception that the whole system is a single and integrated computing facility. According to this definition, wireless ad hoc and sensor networks can be considered as a special type of distributed systems where each node in the networks serves an autonomous component. In theory, the concepts involved in the design of distributed system should be easily adapted for wireless ad hoc and sensor networks. In the design of a distributed system, the order of events plays an important role. To manipulate the order, one of the well-known tools is the (defer) timer. Many distributed communication protocols have been designed using this tool. In this dissertation, we investigated the use of the defer timer on the design of various protocols in wireless ad hoc and sensor networks. By properly setting up the defer timers, many difficult issues in ad hoc and sensor networks, such as the broadcast storm problem, the construction of a virtual backbone, and dynamic cluster formation can be easily addressed with only the help of simple localized information at each node. The simulations show the suggested timer-based protocols perform effectively in wireless ad hoc and sensor networks.
Beyond the Hype: Policies for Military Network Operations
Authors: Ritu Chadha
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Policy-based network management promises to deliver a high degree of automation for military network management. In the past few years, an increasing number of military network management systems have begun to require support for policy-based network management, in a quest for increased automation, improved network performance, and reduced manpower needed to establish and maintain the network. This activity has led to a proliferation of studies to determine how to best utilize policies to achieve the above goals. Large teams of researchers and engineers are working at a feverish pace to prescribe the ideal policy architecture for military network management. One of the biggest obstacles facing these teams are the unrealistic - or sometimes even unspecified - expectations for policybased management. Policy is being touted as the way to achieve everything a network needs, from on-demand quality of service to conformance to vaguely defined military doctrine. An increasing number of network management requirements are being appended with the qualification "based on policy". It is becoming more and more unclear what policies are expected to achieve in a network. The purpose of this paper is to look beyond the hype and attempt to clearly identify the functionality that policies can enable in support of military network operations. The paper discusses the types of policies that are required for supporting network operations in military networks, their functionality, and the resolution of policy conflicts for network management.
Digitalization and global ethics
Authors: Zonghao Bao, Kun Xiang
Venue: Ethics and Information Technology (2006)

The extensive use of digital and network technology has pushed mankind from the industrial era into the information and digital era. In the digital era, digits are becoming an extensive global phenomenon and force. The ethical culture of digital globalization has provided not only a new space for cultural exchange and¿integration among nations, but also a new environment for the formation of new global ethical principles and concepts. This article investigates a theme of scholarly concern, the theme of global ethics in the environment of the digital era.
GignoMDA: exploiting cross-layer optimization for complex database applications
Authors: Dirk Habich, Sebastian Richly, Wolfgang Lehner
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Database Systems are often used as persistent layer for applications. This implies that database schemas are generated out of transient programming class descriptions. The basic idea of the MDA approach generalizes this principle by providing a framework to generate applications (and database schemas) for different programming platforms. Within our GignoMDA project [3]--which is subject of this demo proposal--we have extended classic concepts for code generation. That means, our approach provides a single point of truth describing all aspects of database applications (e.g. database schema, project documentation,...) with great potential for cross-layer optimization. These new cross-layer optimization hints are a novel way for the challenging global optimization issue of multi-tier database applications. The demo at VLDB comprises an in-depth explanation of our concepts and the prototypical implementation by directly demonstrating the modeling and the automatic generation of database applications.
An Intelligent Smart Home Control Using Body Gestures
Authors: Daehwan Kim, Daijin Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

This paper proposes the control of smart home environments such as lights and curtains using body gestures. We use a forward spotting scheme that executes gesture segmentation and recognition simultaneously. The start and end points of gestures are determined by zero crossing from negative to positive (or from positive to negative) of a competitive differential observation probability that is defined by the difference of observation probability between the maximal gesture and the non-gesture. We also use the sliding window and accumulative HMMs. We apply the proposed simultaneous gesture segmentation and recognition method to recognize the upperbody gestures for controlling the curtains and lights in a smart home environment. Experimental results show that the proposed method has a good recognition rate of 95.42% for continuously changing gestures.
Nested mappings: schema mapping reloaded
Authors: Ariel Fuxman, Mauricio A. Hernandez, Howard Ho, Renee J. Miller, Paolo Papotti, Lucian Popa
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Many problems in information integration rely on specifications, called schema mappings, that model the relationships between schemas. Schema mappings for both relational and nested data are well-known. In this work, we present a new formalism for schema mapping that extends these existing formalisms in two significant ways. First, our nested mappings allow for nesting and correlation of mappings. This results in a natural programming paradigm that often yields more accurate specifications. In particular, we show that nested mappings can naturally preserve correlations among data that existing mapping formalisms cannot. We also show that using nested mappings for purposes of exchanging data from a source to a target will result in less redundancy in the target data. The second extension to the mapping formalism is the ability to express, in a declarative way, grouping and data merging semantics. This semantics can be easily changed and customized to the integration task at hand. We present a new algorithm for the automatic generation of nested mappings from schema matchings (that is, simple element-to-element correspondences between schemas). We have implemented this algorithm, along with algorithms for the generation of transformation queries (e.g., XQuery) based on the nested mapping specification. We show that the generation algorithms scale well to large, highly nested schemas. We also show that using nested mappings in data exchange can drastically reduce the execution cost of producing a target instance, particularly over large data sources, and can also dramatically improve the quality of the generated data.
Task Pool Teams: a hybrid programming environment for irregular algorithms on SMP clusters: Research Articles
Authors: Judith Hippold, Gudula Rünger
Venue: Concurrency and Computation: Practice Experience (2006)

Clusters of symmetric multiprocessors (SMPs) are popular platforms for parallel programming since they provide large computational power for a reasonable price. For irregular application programs with dynamically changing computation and data access behavior, a flexible programming model is needed to achieve efficiency. In this paper we propose Task Pool Teams as a hybrid parallel programming environment to realize irregular algorithms on clusters of SMPs. Task Pool Teams combine task pools on single cluster nodes by an explicit message passing layer. They offer load balance together with multi-threaded, asynchronous communication. Appropriate communication protocols and task pool implementations are provided and accessible by an easy-to-use application programmer interface. As application examples we present a branch and bound algorithm and the hierarchical radiosity algorithm. Copyright &copy; 2006 John Wiley & Sons, Ltd.
A time-varying AR modeling of heart wall vibration
Authors: H. Kanai, N. Chubachi, Y. Koiwa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We present a new method that can be used to estimate the spectrum transition of nonstationary signals in low signal-to-noise ratio (SNR) cases. If the spectrum transition pattern is complex and/or there are large differences in the transition patterns among the individual nonstationary signals, it is difficult to estimate the transition pattern stably by the previously proposed time-varying AR modeling because the results are considerably dependent on the choice of the basic functions to be used. We propose a new modeling approach to estimate the spectrum transition of nonstationary signals by using a linear algorithm without assuming any basic functions. Instead of basic functions we use the spectrum transition constraint. By applying this method to the analysis of vibration signals on the interventricular septum of the heart, noninvasively measured by a method developed in our laboratory using ultrasonic, a spectrum transition pattern is obtained during one beat period. The proposed method will serve a tool for the noninvasive acoustic diagnosis of heart diseases in the near future.
LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement
Authors: Chonggang Wang, Jiangchuan Liu, Bo Li, Kazem Sohraby, Y. Thomas Hou
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, Random Early Detection (RED), and many of its variants employ queue length as a congestion indicator to trigger packet dropping. Despite their simplicity, these approaches often suffer from unstable behaviors in a dynamic network. Adaptive parameter settings, though might solve the problem, remain difficult in such a complex system. Recent proposals based on analytical TCP control and AQM models suggest the use of both queue length and traffic input rate as congestion indicators, which effectively enhances stability. Their response time generally increases however, leading to frequent buffer overflow and emptiness. In this paper, we propose a novel AQM algorithm that achieves fast response time and yet good robustness. The algorithm, called Loss Ratio-based RED (LRED), measures the latest packet loss ratio, and uses it as a complement to queue length for adaptively adjusting the packet drop probability. We develop an analytical model for LRED, which demonstrates that LRED is responsive even if the number of TCP flows and their persisting times vary significantly. It also provides a general guideline for the parameter settings in LRED. The performance of LRED is further examined under various simulated network environments, and compared to existing AQM algorithms. Our simulation results show that, with comparable complexities, LRED achieves shorter response time and higher robustness. More importantly, it trades off the goodput with queue length better than existing algorithms, enabling flexible system configurations.
Low applied bias for p-GaN electroluminescent devices
Authors: F. K. Yam, Z. Hassan, C. K. Tan, C. W. Lim, A. Abdul Aziz
Venue: Microelectronic Engineering (2005)

Nickel ohmic contacts and Schottky contacts using silver or titanium were fabricated on Mg-doped p-GaN films. The light emission has been obtained from these thin film electroluminescent devices (ELDs). These ELDs were operated under direct current (DC) bias. Schottky and ohmic contacts used as cathode and anode were employed in these investigations. Alternatively, two Schottky contacts could be probed as cathode and anode. Both ELDs were able to emit light. However, electrical and optical differences could be observed from the two different probing methods. ELDs started to emit light under forward bias of 3V at room temperature in a dark environment. The change of light colour from yellowish white, green, blue to violet could be observed when the potential between the electrodes was increased gradually. The light intensity emitted increased with the applied bias. Electrical properties of these ELDs were characterized by current-voltage (I-V) system, the barriers heights determined from the I-V measurements were found to be related to the electroluminescence.
Evaluation of a Network Extraction Topology Algorithm for Reducing Search Space of a GA-based Routing Approach
Authors: Makoto Ikeda, Leonard Barolli, Giuseppe De Marco, Arian Durresi, Akio Koyama, Mimoza Durresi
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. The proposed routing algorithm is a combination of source and distributed routing. However, in the previous research, we only considered the time delay for the routing. Also, QoS and congestion control parameters were considered just as indicators of QoS satisfication and congestion. In this work, we extend our previous work by proposing and implementing new algorithms based on fuzzy logic and genetic algorithm which use for admission control and routing many QoS parameters. Also, we evaluate by simulations the performance of the network extraction topology algorithm which reduces the search space of the proposed GA-based routing approach. Thus, the GA can find a feasible route very fast.
A new asymptotic series for the Gamma function
Authors: Xiquan Shi, Fengshan Liu, Minghan Hu
Venue: Journal of Computational and Applied Mathematics (2006)

The famous Stirling's formula says that Γ(s+1) = √2πs(s/e)seγ(s)=√2π(s/e)seθ(s)/12s. In this paper, we obtain a novel convergent asymptotic series of γ(s) and proved that θ(s) is increasing for s > 0.
Intrusion-Tolerant Middleware: The Road to Automatic Security
Authors: Paulo E. Verissimo, Nuno F. Neves, Christian Cachin, Jonathan Poritz, David Powell, Yves Deswarte, Robert Stroud, Ian Welch
Venue: IEEE Security and Privacy (2006)

The pervasive interconnection of systems throughout the world has given computer services a significant socioeconomic value that both accidental faults and malicious activity can affect. The classical approach to security has mostly consisted of trying to prevent bad things from happening--by developing systems without vulnerabilities, for example, or by detecting attacks and intrusions and deploying ad hoc countermeasures before any part of the system is damaged. But what if we could address both faults and attacks in a seamless manner, through a common approach to security and dependability?
Representation of a class of nondeterministic semiautomata by canonical words
Authors: Janusz A. Brzozowski
Venue: Theoretical Computer Science (2006)

It has been shown recently that deterministic semiautomata can be represented by canonical words and equivalences; that work was motivated by the trace-assertion method for specifying software modules. Here, we generalize these ideas to a class of nondeterministic semiautomata. A semiautomaton is settable if, for every state q, there exists a word Wq such that q, and no other state, can be reached from some initial state by a path spelling Wq. We extend many results from the deterministic case to settable nondeterministic semiautomata. Now each word has a number of canonical representatives. We show that a prefix-rewriting system exists for transforming any word to any of its representatives. If the set of canonical words is prefix-continuous (meaning that, if w and a prefix u of w are in the set, then all prefixes of w longer than u are also in the set), the rewriting system has no infinite derivations. Examples of specifications of nondeterministic modules are given.
Importance sampling in Markovian settings
Authors: Werner Sandmann
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Rare event simulation for stochastic models of complex systems is still a great challenge even for Markovian models. We review results in importance sampling for Markov chains, provide new viewpoints and insights, and we pose some future research directions.
Card-based Macropayment for Mobile Phones
Authors: Philip Garner, Reuben Edwards, Paul Coulton
Venue: Proceedings of the International Conference on Mobile Business (2006)

Most new entrants into the mobile commerce marketplace are faced with a paradox; how can we attract users without merchants, and how can we attract merchants without customers? Without a huge investment in marketing to build consumer recognition, starting a new m-commerce service is risky. In this paper we analyse how successful companies on the web have managed to create successful payment services by utilising the brand recognition and ubiquity of the popular card networks. Attempts to marry credit cards and mobile phones are not new - encrypted phone wallet systems have been bundled with devices for a number of years. However, use of these wallet systems remains limited as the public failed to embrace shopping via WAP, frustrated by slow speeds and poor user interfaces. With mobile terminals more suited for browsing, and higher speeds from mobile data becoming the norm, we present a system to enable remote macropurchases using existing credit card technology.
Category Deficits and Paradoxical Dissociations in Alzheimer's Disease and Herpes Simplex Encephalitis
Authors: Keith R. Laws, Giuseppe Sartori
Venue: Journal of Cognitive Neuroscience (2005)

Most studies examining category specificity are single-case studies of patients with living or nonliving deficits. Nevertheless, no explicit or agreed criteria exist for establishing category-specific deficits in single cases regarding the type of analyses, whether to compare with healthy controls, the number of tasks, or the type of tasks. We examined two groups of patients with neurological pathology frequently accompanied by impaired semantic memory (19 patients with Alzheimer's disease and 15 with Herpes Simplex Encephalitis). Category knowledge was examined using three tasks (picture naming, naming-to-description, and feature verification). Both patient groups were compared with age- and education-matched healthy controls. The profile in each patient was examined for consistency across tasks and across different analyses; however, both proved to be inconsistent. One striking finding was the presence of paradoxical dissociations (i.e., patients who were impaired for living things on one task and nonliving things on another task). The findings have significant implications for how we determine category effects and, more generally, for the methods used to document double dissociations across individual cases in this literature.
Scheduling Data Delivery in Heterogeneous Wireless Sensor Networks
Authors: Daeseob Lim, Jaewook Shim, Tajana Simunic Rosing, Tara Javidi
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this paper we present a proxy-level scheduler that can significantly improve QoS in heterogeneous wireless sensor networks while at the same time reducing the overall power consumption. Our scheduler is transparent to both applications and MAC in order to take the advantage of the standard off-the-shelf components. The proposed scheduling reduces collisions through a generalized TDMA implementation, and thus improves throughput and QoS, by activating only a subset of stations at a time. Power savings are achieved by scheduling transfer of larger bursts of IP packets followed by longer idle periods during which node's radio can either enter sleep or be turned off. Our simulation and measurement results show significant power savings with an improvement in QoS. On average we get 18% of saturation throughput enhancement for real traffic and 79% of power reduction in a highly loaded network.