ppxscal/embedding_network huggingface dataset:
PIC receiver implementations for the asynchronous UMTS scenarios
Authors: Lorenzo J. Tardón, Isabel Barbancho, Ana M. Barbancho
Venue: Signal Processing (2008)

In this paper, three different implementations of a multistage partial parallel interference cancellation (PIC) receiver for the asynchronous UMTS signal are presented and compared. The proposed structures take into account the scrambling and channelization codes employed in UMTS and two of them are advanced structures specifically designed to attempt to remove completely the multiuser interference thanks to the addition of specific data buffers for this scenario. The advanced structures proposed outperform the direct implementation of the PIC receiver derived from synchronous CDMA scenarios by taking into account the whole set of interference terms. Also, no windowing is necessary at the receiver and no framing transmission is required.
Parallel comparison algorithms for approximation problems
Authors: N. Alon, Y. Azar
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The authors consider that they have n elements from a totally ordered domain and are allowed to perform p parallel comparisons in each time unit (round). They determine, up to a constant factor, the time complexity of several approximation problems in the common parallel comparison tree model of L.G. Valiant, for all admissible values of n, p, and epsilon , where epsilon is an accuracy parameter determining the quality of the required approximation. The problems considered include the approximate maximum problem, approximate sorting, and approximate merging. The results imply, as special cases, all the known results about the time complexity of parallel sorting, parallel merging, and parallel selection of the maximum (in the comparison model). They highlight one very special but representative result concerning the approximate maximum problem. They wish to find, among the given n elements, one which belongs to the biggest n/2, where in each round they are allowed to ask n binary comparisons. They show that log/sup */n+ Theta (1) rounds are both necessary and sufficient in the best algorithm for this problem.
Analytical Model for the Propagation Delay of Through Silicon Vias
Authors: DiaaEldin Khalil, Yehea Ismail, Muhammad Khellah, Tanay Karnik, Vivek De
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper explores the modeling of the propagation delay of through silicon vias (TSVs) in 3D integrated circuits. The electrical characteristics and models of the TSVs are very crucial in enabling the analysis and CAD in 3D integrated circuits. In this paper, an analytical model for the propagation delay of the TSV as a function of its physical dimensions is proposed. The presented analytical model is in great agreement with simulations using electromagnetic field solver and lossy transmission line circuit model. Compared to earlier interconnect models, the presented analytical model provides higher accuracy and fidelity in addition to its simplicity. Hence, the presented analytical model is very useful in the analysis of 3D integrated circuits.
Designing semantic substrates for visual network exploration
Authors: Aleks Aris, Ben Shneiderman
Venue: Information Visualization (2007)

A semantic substrate is a spatial template tor a network, where nodes are grouped into regions and laid out within each region according to one or more node attributes. This paper shows how users can be given control in designing their own substrates and how this ability leads to a different approach to network data exploration. Users can create a semantic substrate, enter their data, get feedback from domain experts, edit the semantic substrate, and iteratively continue this procedure until the domain experts are satisfied with the insights they have gained. We illustrate this process in two case studies with domain experts working with legal precedents and food webs. Guidelines for designing substrates are provided, including how to locate, size, and align regions in a substrate, which attributes to choose for grouping nodes into regions, how to select placement methods and which attributes to set as parameters of the selected placement method. Throughout the paper, examples are illustrated with NVSS 2.0, the network visualization tool developed to explore the semantic substrate idea.
Relating problem oriented engineering to current development processes: a research agenda
Authors: Dariusz W. Kaminski, Jon G. Hall, Michel Wermelinger
Venue: Proceedings of the 3rd international workshop on Applications and advances of problem frames (2008)

In this position paper, we propose research into expressing software development processes in terms of one generic theory, namely Problem Oriented Engineering (POE). Our aim is to relate the POE process to those available in the Rational Unified Process (RUP), and initially we will propose tentative mappings between RUP and POE entities. By doing it, we would investigate the feasibility of applying similar mapping methodology to other Object-Oriented Analysis and Design (OOAD) processes. This approach should provide insights on whether (and how) RUP separates problems from solutions, and also how to enrich RUP with traceability and POE with concepts that cover state-of-practice. The research agenda we propose in this paper addresses the problem space in the state-of-practice: being the first research attempt to bind the POE process with the OOAD processes, it could be a further contribution to the foundation for normalising object-oriented enterprise systems. While the steps towards normal design in software engineering could be captured as problem frames, patterns and architectures, we extend these ideas further onto the software development processes, which might help close the gap between software engineering and normal design.
Flexible Address Configurations for Tree-Based ZigBee/IEEE 802.15.4 Wireless Networks
Authors: Li-Hsing Yen, Wei-Ting Tsai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

A number of IEEE 802.15.4 devices can be connected by a tree topology as proposed by ZigBee specification. Address configuration in tree-based ZigBee networks needs to assign every device a network address that uniquely identifies it from others, and such addressing should also assist routing. The addressing method recommended by the specification forces a static assignment that is coupled with node's location in the tree, resulting in an inflexibility in allocating addresses. This property may significantly decrease the ratio of addressable devices and cause routing detour. To alleviate the problem, this paper considers three alternatives that manage address space with flexibility but require additional storage in ZigBee routers. Performance evaluations indicate that proposed approaches provide different levels of tradeoff between the ratio of addressable devices and storage costs in ZigBee routers.
Study of best algorithm combinations for speech processing tasks in machine learning using median vs. mean clusters in MARF
Authors: Serguei A. Mokhov
Venue: Proceedings of the 2008 C3S2E conference (2008)

This work reports experimental results and their analysis in various speech processing tasks using SpeakerIdentApp, a text-independent speaker identification application, based on Modular Audio Recognition Framework (MARF)'s API and its implementation in terms of best of the available algorithm configurations for each particular task using median clusters as opposed to the default mean clusters. This study focuses on the tasks of identification of speakers' as of who they are, their gender, and accent through machine learning. This work significantly complements two preceding statistical studies undertaken using only mean clusters and shows the difference in selection of the best algorithm combinations using the median cluster approach. To the author's knowledge there was no any previous comprehensive study in this regard.
A methodology to extract dynamic compact thermal models under time-varying boundary conditions: application to a thermopile based IR sensor
Authors: M. Salleras, J. Palac&#x00ed;n, M. Moreno, J. Santander, L. Fonseca, J. Samitier, S. Marco
Venue: Microsystem Technologies (2005)

This paper presents the extraction of a boundary independent dynamic compact thermal model (DCTM). The paper specifically focuses on time-varying Dirichlet boundary conditions influence and the methodology proposed to obtain the DCTM is applied to a thermopile based infrared (IR) sensor. These type of sensors are quite sensitive to environment changes because a variation in the sensor bulk silicon temperature usually generates a different temperature influence in the hot and cold areas that can produce incorrect transient measurements of the incident IR radiation. A DCTM can be used to estimate the influence of the environmental temperature evolution in the sensor output and with the help of a temperature sensor correct the measurement of the IR incident radiation in the real device. The methodology to construct the DCTM is based in the construction of an equivalent thermal RC network, the topology of which, as well as its component values, are obtained from the analysis of the dynamic power-temperature relationship on the points of interest.
Neighborhood-Aware Density Control in Wireless Sensor Networks
Authors: Mu-Huan Chiang, Gregory T. Byrd
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In dense wireless sensor networks, density control is an important technique for prolonging network's lifetime. However, due to the intrinsic many-to-one communication pattern of sensor networks, nodes close to the sink tend to deplete their energy faster than other nodes. This unbalanced energy usage among nodes significantly reduces the network lifetime. In this paper, we propose neighborhood-aware density control (NADC) to alleviate this undesired effect by reducing unnecessary overhearing along routing paths. In NADC, nodes observe their neighborhoods and dynamically adapt their participation in the multihop network topology. Since the neighborhood information can be easily observed through the overheard information, the density in different regions can be adaptively adjusted in a totally distributed manner. Simulation experiments demonstrate that NADC alleviates the extremely unbalanced workload and extends the effective network lifetime without significant increase in data delivery latency.
People, places, and play: player experience in a socio-spatial context
Authors: Yvonne A. W. De Kort, Wijnand A. Ijsselsteijn
Venue: Computers in Entertainment (CIE) (2008)

Digital games frequently give rise to engaging and meaningful social interactions, both over the internet and in the real and tangible world of the gamer. This is the focus of the present paper, which explores digital gaming as a situated experience, shaped by socio-spatial contingencies. In particular we discuss how co-players, audience, and their spatial organization shape play and player experience and review supporting evidence for this. We present a framework describing social processes underlying situated social play experience and how these are shaped by the player the game's socio-spatial and media context. The core of this framework describes various 'sociality characteristics', and discusses these both in terms of co-located and mediated social game settings.
Elicitation and Specification of Safety Requirements
Authors: Elena Troubitsyna
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper we demonstrate how to derive software requirements from system safety analysis in such a way that they could be easily captured in a software specification. We propose an integral approach for incorporating results of Fault Tree Analysis (FTA) and Failure Mode and Effect Analysis (FMEA) into the requirements specification. In our approach statecharts facilitate construction of a control system and serve as a basis for structuring and integrating results of FTA and FMEA. The use of statecharts as a communication media between safety and software engineers assists the process of requirements discovery. The approach is illustrated by excerpts from the development of realistic industrial system – the liquid handling workstation Fillwell TM.
Defending the Corporate Crown Jewels from the Dangers that Lurk Within-Effective Internal Network Security Focuses on Behavior
Authors: Ross Ortega
Venue: Information Systems Security (2007)

The risk of damaging cyber-attacks on corporate networks has never been higher. Enterprise networks contain the most precious assets of a corporation. Essentially, everything a company creates or does manifests itself within the corporate network. Consequently, corporate networks have become fertile ground for abuse and theft.
Hierarchical group access control for secure multicast communications
Authors: Yan Sun, K. J. Ray Liu
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Many group communications require a security infrastructure that ensures multiple levels of access control for group members. While most existing group key management schemes are designed for single level access control, we present a multi-group key management scheme that achieves hierarchical group access control. Particularly, we design an integrated key graph that maintains keying material for all members with different access privileges. It also incorporates new functionalities that are not present in conventional multicast key management, such as user relocation on the key graph. Analysis is performed to evaluate the storage and communication overhead associated key management. Comprehensive simulations are performed for various application scenarios where users statistical behavior is modelled using a discrete Markov chain. Compared with applying existing key management schemes directly to the hierarchical access control problem, the proposed scheme significantly reduces the overhead associated with key management and achieves better scalability.
Information Technology Leadership Challenges-Past, Present, and Future
Authors: Ray Hoving
Venue: Information Systems Management (2007)

Based on my extensive field experience, I present my view of the challenges to be faced by leaders of the IS organization of the future. Prescriptions are provided for leveraging trends in technology, providing business value, managing external and internal resources, and excellent execution.
An Efficient Weighted-Round-Robin Algorithm for Multiprocessor Architectures
Authors: Sören Sonntag, Helmut Reinig
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Complex System-on-Chip (SoC) architectures comprise multiple master and slave modules. Master modules such as processors and hardware accelerators send requests or data to slave modules, e.g. memories and register banks. Efficient communication among master and slave modules requires adequate on-chip interconnect architectures with arbitration that features contention resolution, prioritization, and fairness. In this paper we present a new arbitration method with a parameterizable algorithm, such that the arbitration for each shared resource can be optimized to the traffic patterns, target characteristics, and quality-of-service requirements. We use a weighted-round-robin algorithm that takes these properties into account. As our simulations show we can improve the overall system performance of a multi-processor SoC by up to 41 %.
Fuzzy diagnosis in AHU system using dynamic fuzzy neural network
Authors: Du Juan, Er Meng Joo
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper, an efficient fault diagnosis method for air-handling unit using dynamic fuzzy neural networks (DFNNs) is presented. The proposed fault diagnosis method has the following salient features: (1) structure identification and parameters estimation are performed automatically and simultaneously without partitioning input space and selecting initial parameters a priori; (2) fuzzy rules can be recruited or deleted dynamically; (3) fuzzy rules can be generated quickly without resorting to the backpropagation (BP) iteration learning, a common approach adopted by many existing methods. Simulation results demonstrate that high training and diagnosis speed and high diagnosis rate can be achieved.
Space-indexed dynamic programming: learning to follow trajectories
Authors: J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, Charles DuHadway
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynamic Programming (DDP) and Policy Search by Dynamic Programming (PSDP), can efficiently compute non-stationary policies for these tasks --- such policies in general are well-suited to trajectory following since they can easily generate different control actions at different times in order to follow the trajectory. However, a weakness of these algorithms is that their policies are time-indexed, in that they apply different policies depending on the current time. This is problematic since 1) the current time may not correspond well to where we are along the trajectory and 2) the uncertainty over states can prevent these algorithms from finding any good policies at all. In this paper we propose a method for space-indexed dynamic programming that overcomes both these difficulties. We begin by showing how a dynamical system can be rewritten in terms of a spatial index variable (i.e., how far along the trajectory we are) rather than as a function of time. We then use these space-indexed dynamical systems to derive space-indexed version of the DDP and PSDP algorithms. Finally, we show that these algorithms perform well on a variety of control tasks, both in simulation and on real systems.
Writing on the blog: an assemblage analysis
Authors: Senom T. Yalcin
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

By examining two academic blogs over a period of 3 months, this study aims to understand blog writing by defining writing as constructing dynamic trajectories and a function of its environment. An analysis for identifying the constructed trajectories, which provide information on the location and nature of the connections, as well as the content; yield both information on the parts (the blog) that construct the network, and the network as a whole (the blog+its environment).
Contextual modal type theory
Authors: Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

The intuitionistic modal logic of necessity is based on the judgmental notion of categorical truth. In this article we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its type-theoretic analogue. Contextual modal type theory provides an elegant, uniform foundation for understanding metavariables and explicit substitutions. We sketch some applications in functional programming and logical frameworks.
Adaptive computation offloading for energy conservation on battery-powered systems
Authors: Changjiu Xian, Yung-Hsiang Lu, Zhiyuan Li
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

This paper considers the problem of extending the battery lifetime for a portable computer by offloading its computation to a server. Depending on the inputs, computation time for different instances of a program can vary significantly and they are often difficult to predict. Different from previous studies on computation offloading, our approach does not require estimating the computation time before the execution. We execute the program initially on the portable client with a timeout. If the computation is not completed after the timeout, it is offloaded to the server. We first set the timeout to be the minimum computation time that can benefit from offloading. This method is proved to be 2-competitive. We further consider collecting online statistics of the computation time and and the statistically optimal timeout. Finally, we provide guidelines to construct programs with computation offloading. Experiments show that our methods can save up to 17% more energy than existing approaches.
Calculation of Joint Reaction Forces in the Equine Distal Forelimb during Walking and Trotting
Authors: Jonathan S. Merritt, Helen M. S. Davies, Colin Burvill, Marcus G. Pandy
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Forces exerted at the joints of the equine distal forelimb play a major role in common injuries of the region. In this study, a two-dimensional musculoskeletal model was developed to calculate the reaction forces at the joints of the distal forelimb from measured kinematic and kinetic data during walking and trotting. The reaction forces due to muscletendon wrapping around the sesamoid bones of the limb were shown to be of similar magnitudes to those exerted between the long bones at the joints, highlighting the importance of the sesamoid bones in the mechanical function of the limb.
The synchronization of nonuniform networks of finite automata
Authors: T. Jiang
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The generalized firing squad synchronization problem (GFSSP) is the well-known firing squad synchronization problem extended to arbitrarily connected networks of finite automata. When the transmission delays associated with the links of a network are allowed to be arbitrary nonnegative integers, the problem is called GFSSP-NUD (GFSSP with nonuniform delays). A solution of GFSSP-NUD is given for the first time. The solution is independent of the structure of the network and the actual delays of the links. The firing time of the solution is bounded by O( Delta /sup 3/+ tau /sub max/), where tau /sub max/ is the maximum transmission delay of any single link and Delta is the maximum transmission delay between the general and any other node of a given network. Extensions of GFSSP and GFSSP-NUD to networks with more than one general are presented.
Energy and bandwidth-efficient key distribution in wireless ad hoc networks: a cross-layer approach
Authors: Javier Salido, Loukas Lazos, Radha Poovendran
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

We address the problem of resource-efficient access control for group communications in wireless ad hoc networks. Restricting the access to group data can be reduced to the problem of securely distributing cryptographic keys to group members, known as the key distribution problem (KDP). We examine the KDP under four metrics: (a) member key storage, (b) group controller (GC) transmissions, (c) multicast group (MG) update messages, and (d) average update energy. For each metric, we formulate an optimization problem and show that the KDP has unique solutions for metrics (a) and (b), while is NP-complete for (c) and (d). We propose a cross-layer heuristic algorithm called VP3 that bounds member key storage, and GC transmissions, while significantly reducing the energy and bandwidth consumption of the network. We define the notion of path divergence as a measure of bandwidth efficiency of multicasting, and establish an analytical worst-case bound for it. Finally, we propose On-line VP3, which dynamically updates the key assignment structure according to the dynamics of the communication group in a resource-efficient way.