ppxscal/embedding_network huggingface dataset:
Speed-Up of ASICs Derived from FPGAs by Transistor Network Synthesis Including Reordering
Authors: Tiago Muller Gil Cardoso, Leomar Soares da Rosa Jr., Felipe de Souza Marques, Renato Perez Ribas, Andre Inacio Reis
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper presents a method for speeding-up ASICs by transistor reordering. The proposed method can be applied to a variety of logic styles and transistor topologies. The rationale of the obtained gains is explained through logical effort concepts. When applied to circuits based on 4-input networks, which is the case of many structured-ASIC or FPGA technologies, significant performance gains are obtained at a small area expense. This observation points out that our method can be of special interest when migrating FPGAs to ASICs. The logical effort effects on networks derived from BDDs illustrated in this paper can be exploited in a much broader range of designs.
SOLONet: sub-optimal location-aided overlay network
Authors: Abhishek Patil, Yunhao Liu, Li Xiao, A.-H. Esfahanian, Lionel M. Ni
Venue: Wireless Networks (2008)

Overlay networks have made it easy to implement multicast functionality in MANETs. Their flexibility to adapt to different environments has helped in their steady growth. Overlay multicast trees that are built using location information account for node mobility and have a low latency. However, the performance gains of such trees are offset by the overhead involved in distributing and maintaining precise location information. As the degree of (location) accuracy increases, the performance improves but the overhead required to store and broadcast this information also increases. In this paper, we present SOLONet, a design to build a sub-optimal location aided overlay multicast tree, where location updates of each member node are event based. Unlike several other approaches, SOLONet doesn't require every packet to carry location information or each node maintain location information of every other node or carrying out expensive location broadcast for each node. Our simulation results indicate that SOLONet is scalable and its sub-optimal tree performs very similar to an overlay tree built by using precise location information. SOLONet strikes a good balance between the advantages of using location information (for building efficient overlay multicast trees) versus the cost of maintaining and distributing location information of every member nodes.
Hacking the Eee PC
Authors: Jes Hall
Venue: Linux Journal (2008)

Several ideas for tweaking your Eee PC.
Addressing user expectations in mobile content delivery
Authors: Florence Agboma, Antonio Liotta
Venue: Mobile Information Systems (2007)

Multimedia services like television programs and live streaming of mobile videos can be delivered to mobile terminals via different access technologies. The question is - how do users perceive such services on mobile terminals? The objective of this study is to find the correlation between video quality thresholds and the user context. Our study reveals the thresholds of user's quality of experience (QoE) in a mobile environment by using different categories of content types, in relation to different access technologies and terminal capability. The mobile terminals used are: - (i) 3G Mobile Phone (ii) Personal Digital Assistant (PDA) and (iii) Laptop. We argue that quality of service (QoS) management should be driven by the user perception of quality rather than resulting from raw engineering parameters such as latency, jitter, bandwidth etc. Our results will be of great interest to network operators, service providers, terminal manufacturers, and researchers working in the area of quality of service management.
An Energy-Aware Distributed Algorithm for Sensor Nodes Clustering
Authors: Susmit Bagchi
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The sensor devices of Wireless Sensor Networks (WSN) are severely resource constrained having limited operational lifetime. The clustering of sensor nodes provides longer operational lifetime of the nodes and facilitates data aggregation. This paper proposes a distributed algorithm for clustering of sensor nodes based on the one-hop-neighbours of the nodes. The cluster heads of the clusters are elected based on the local energy levels of the nodes without involving any distributed messaging. This paper presents the model, design and analysis of the algorithm.
Managing the Lifecycle of Electronically Stored Information
Authors: Linda Volonino, Janice C. Sipior, Burke T. Ward
Venue: Information Systems Management (2007)

In December 2006, amendments to the Federal Rules of Civil Procedure took effect that changed the way companies must handle electronic documents, records, and messages-collectively defined as electronically stored information, or ESI. Any ESI that could become evidence in a federal case, such as interstate lawsuits, compliance regulations (e.g., Sarbanes-Oxley, HIPAA, and OSHA), EEOC and other employment issues, immigration cases, and actions by the Internal Revenue Service, are included. Actually, it is difficult to think of any business document that might not be covered. This article discusses the amended rules, how failure to manage ESI properly can lead to catastrophic results, and how to manage the lifecycle of ESI.
Gate-Oxide Early Life Failure Prediction
Authors: Tze Wee Chen, Kyunglok Kim, Young Moon Kim, Subhasish Mitra
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

This paper uses 90nm transistor-level experimental data, device modeling, and circuit simulations to establish the following results: 1. A transistor with defective gateoxide,i.e., a gate-oxide early-life failure (ELF) candidate transistor, produces gradually degraded drive currents over time before it completely loses its transistor characteristics; 2. The above phenomenon results ingradual increase in delays of digital circuit paths containing the ELF candidate transistor before the circuit produces functional failures; 3. Gradual delay shifts caused by ELF candidate transistors are large enough to be detected using inexpensive digital techniques. These results can be utilized to overcome scaled-CMOS reliability challenges through ELF identification during production test or on-line during system operation.
CS proofs
Authors: S. Micali
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

This paper puts forward a computationally-based notion of proof and explores its implications to computation at large. In particular, given a random oracle or a suitable cryptographic assumption, we show that every computation possesses a short certificate vouching its correctness, and that, under a cryptographic assumption, any program for a /spl Nscr//spl Pscr/-complete problem is checkable in polynomial time. In addition, our work provides the beginnings of a theory of computational complexity that is based on "individual inputs" rather than languages.
Non-functional requirements in business process modeling
Authors: Christopher J. Pavlovski, Joe Zou
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

Business process modeling entails the capture of a set of tasks that invariably model the functional behavior of a system. Another aspect of business process modeling involves the accurate capture of operational behavior and the associated process constraints. Whether the process is automated or manual, such operational constraints and behavior exist. This may include a variety of properties including performance expectations, policy constraints, and security controls. These characteristics later manifest as the non-functional requirements of an intended system, and often such information is generally identified at some point after the business process modeling exercise. The non-functional characteristics of the business are arguably more difficult to capture in business process modeling, since the focus of such methods is the modeling of functional behavior. We propose how two new artifacts may be applied to model the constraints associated with a business process. This is the operating condition to denote a business process constraint and the control case to define controlling criteria to mitigate risk associated with an operational condition. Modeling constraints in this way provides an opportunity to capture these characteristics of business process early in the systems development life-cycle. This contributes to a model that provides a more complete representation of the overall business process. The methods will assist in mitigating risk and facilitate the early discovery of non-functional requirements during systems development.
Collaborative filtering with interlaced generalized linear models
Authors: Nicolas Delannay, Michel Verleysen
Venue: Neurocomputing (2008)

Collaborative filtering (CF) is a data analysis task appearing in many challenging applications, in particular data mining in Internet and e-commerce. CF can often be formulated as identifying patterns in a large and mostly empty rating matrix. In this paper, we focus on predicting unobserved ratings. This task is often a part of a recommendation procedure. We propose a new CF approach called interlaced generalized linear models (GLM); it is based on a factorization of the rating matrix and uses probabilistic modeling to represent uncertainty in the ratings. The advantage of this approach is that different configurations, encoding different intuitions about the rating process can easily be tested while keeping the same learning procedure. The GLM formulation is the keystone to derive an efficient learning procedure, applicable to large datasets. We illustrate the technique on three public domain datasets.
Hybrid training with binary search protocol for wireless sensor networks
Authors: Ruzana Ishak, Qingwen Xu, Stephan Olariu, Shaharuddin Salleh
Venue: Mobile Information Systems (2007)

Locationing problem in Wireless Sensor Networks(WSNs) can be viewed as a general distributed sensor problem. It is with sensors that can discover other nodes or estimate ranges between nodes, that serve as position references. In this paper, we show that sensors acquire coarse-grain location awareness by the training protocol. The training protocol which hybrids the synchronization and training procedure. In this protocol, synchronization and training are combined into one scheme. The sink node sends two beacons in each slot instead of one. In the training, sensor searching for its location using a binary search scheme. Our simulation results shown less number of cycles needed for training.
Curriculum overlay model for embedding digital resources
Authors: Huda Khan, Keith Maull, Tamara Sumner
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper describes the design and implementation of a curriculum overlay model for the representation of adaptable curriculum using educational digital library resources. We focus on representing curriculum to enable the incorporation of digital resources into curriculum and curriculum sharing and customization by educators. We defined this model as a result of longitudinal studies on educators' development and customization of curriculum and user interface design studies of prototypes representing curriculum. Like overlay journals or the information network overlay model, our curriculum overlay model defines curriculum as a compound object with internal semantic relationships and relationships to digital library metadata describing resources. We validated this model by instantiating the model using science curriculum which uses digital library resources and using this instantiation within an application that, built on FEDORA, supports curriculum customization. Findings from this work can support the design of digital library services for customizing curriculum which embeds digital resources.
Measuring and defining the experience of immersion in games
Authors: Charlene Jennett, Anna L. Cox, Paul Cairns, Samira Dhoparee, Andrew Epps, Tim Tijs, Alison Walton
Venue: International Journal of Human-Computer Studies (2008)

Despite the word's common usage by gamers and reviewers alike, it is still not clear what immersion means. This paper explores immersion further by investigating whether immersion can be defined quantitatively, describing three experiments in total. The first experiment investigated participants' abilities to switch from an immersive to a non-immersive task. The second experiment investigated whether there were changes in participants' eye movements during an immersive task. The third experiment investigated the effect of an externally imposed pace of interaction on immersion and affective measures (state anxiety, positive affect, negative affect). Overall the findings suggest that immersion can be measured subjectively (through questionnaires) as well as objectively (task completion time, eye movements). Furthermore, immersion is not only viewed as a positive experience: negative emotions and uneasiness (i.e. anxiety) also run high.
An Efficient RSA Public Key Encryption Scheme
Authors: Sattar J. Aboud, Mohammad A. AL-Fayoumi, Mustafa Al-Fayoumi, Haidar S. Jabbar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are square matrices with entities in zn indicated via l(h,z,n). Since the original RSA Scheme is a block cipher in which the original message and cipher message are integer in the interval [0, n-1] for some integer modulus n.Therefore, in this paper, we generalize RSA encryption scheme in order to be implemented in the general linear group on the ring of integer mod n. Furthermore, the suggested encryption scheme has no restriction in encryption and decryption order and is claimed to be efficient, scalable and dynamic.
Nano-scale metallization of Au on flexible polyimide substrate by reversal imprint and lift-off process
Authors: Henry J. H. Chen, Li-Chun Chen, Chenhsin Lien, Shou-Ren Chen, Yu-Lun Ho
Venue: Microelectronic Engineering (2008)

The nano-scale metallization of Au on flexible polyimide substrate by reversal imprint and lift-off process was investigated. The nano-scale mold was fabricated; the anti-adhesion property of nanometer-size Si-mold was improved and the surface free energy was calculated with the contact angle measurement. The ~150nm width Au nano-wires were successfully fabricated on Si and on flexible polyimide substrate with the proposed process. The PMMA thickness dependent trend with reversal imprinting and Au nano-wires lift-off results were also investigated by SEM analysis.
Wireless Sensor Nodes Processor Architecture and Design
Authors: Ali El Kateeb, Aiyappa Ramesh, L. Azzawi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, a specialized soft processing core for sensor nodes has been designed and implemented. The paper presents a detailed view of architecture and the instructions set of the processor. The core can be easily integrated with other sensor node parts to construct different types of nodes that can be used to support different sensor network applications. The core is implemented using Xilinx ISE 8.2i design tools. The architecture of the core is simple and can process 10.78 MIPS.
Trajectories Planning in Presence of Obstacles for Manipulator Robots
Authors: Abdelfetah Hentout, Brahim Bouzouia, Zakaria Toukal
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The problem of trajectories planning for manipulator robots in workspaces clustered with static obstacles is described as NP-hard. This pushed many researchers to adopt simplifying assumptions and consequently, to develop resolution methods dedicated to particular cases. In this article, we propose a general methodology, which deals with the problem by taking into account a large range of imposed constraints. The suggested methodology consists,initially, on finding a collision-free path connecting the initial to the final position, from a roadmap built offline, in a random way in the free C-space of the robot. Finally, the found path is injected into a stochastic optimization procedure based on cubic splines.
Interference Detection and Mitigation in IEEE 802.15.4 Networks
Authors: Rahul C. Shah, Lama Nachman
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Proper frequency planning is essential to enablemultiple IEEE 802.15.4 networks to coexist in the samespace, otherwise the network performance can beadversely affected due to interference. While this maybe feasible for static networks, it is not really an optionfor mobile networks such as body area networks due tothe dynamic nature of these interactions. This workdemonstrates one approach to detecting and mitigatinginterference in IEEE 802.15.4 networks from other802.15.4 networks. Interference is detected byobserving packets from other networks while themitigation strategy leverages collaboration betweeninterfering networks to determine which networkshould switch to a different channel. The approach canalso work with legacy networks that do not implementthis protocol. The system is implemented anddemonstrated on Intel Mote2 devices running TinyOS.
An alternative Kalman innovation filter approach for receiver position estimation based on GPS measurement
Authors: Jose I. Canelon, Robert S. Provence, Nisarg Mehta, Leang S. Shieh
Venue: International Journal of Systems Science (2007)

This article presents an alternative Kalman innovation filter approach for receiver position estimation, based on pseudorange measurements of the global positioning system. First, a dynamic pseudorange model is represented as an ARMAX model and a pseudorange state-space innovation model suitable for both parameter identification and state estimation. The Kalman gain in the pseudorange coordinates is directly calculated from the identified parameters without prior knowledge of the noise properties and the receiver parameters. Then, the pseudorange state-space innovation model is transformed into the receiver state-space innovation model for optimal estimation of the receiver position. Hence, the proposed approach overcomes the drawbacks of the classical Kalman filter approach since it does not require prior knowledge of the noise properties, and the receiver's dynamic model to calculate the Kalman gain. In addition, due to its simplicity, it can be easily implemented in any receiver. To demonstrate the effectiveness of the approach, it is utilized to estimate the position of a stationary receiver and its performance is compared against two versions of the classical Kalman filter approach. The results show that the proposed approach yields consistently good estimation of the receiver position and outperforms the other methods.
Data Compression for Emitter Location Finding in Sensor Networks
Authors: Lei Yu, Xiaoyue Liu, Xin Chen
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Wireless location finding has emerged as a popular issue. As one of its branches, sensor networks perform as a fundamental tool to monitor inaccessible environment. However, the limitation on system bandwidth and energy resources motivates the use of data compression at each sensor. The estimation of time-difference-of-arrival (TDOA) is a key step in emitter location finding using sensor network. This paper demonstrates three compression approaches in deriving the TDOA estimation: fisher-information based method, wavelet transform method and a non-conventional monotone increase method. Simulation results are discussed in this paper. It is shown that the wavelet transform method outperforms the other two approaches, while more simulation on the combination of wavelet and fisher-information approach is still under investigation.
Urban radiation balance of two coastal cities in a hot and dry environment
Authors: C. M. Frey, G. Rigo, E. Parlow
Venue: International Journal of Remote Sensing (2007)

Four Advanced Spaceborne Thermal Emission and Reflection radiometer (ASTER) satellite scenes of Dubai and Abu Dhabi with channels from the visible-near infrared (VNIR) to the thermal infrared (TIR) were analysed to show variations in surface temperature, albedo, emissivity and net radiation in different urban and rural classes. For a better understanding of the spatial coherences of surface properties a land use classification was derived. The different classes were then spatially and temporally compared. The investigations show in the daytime a distinct surface cool island for Dubai and surface cool areas at Abu Dhabi city and its surrounding mangrove areas. Net radiation is mainly controlled by the albedo. The albedo in urban areas is lower than in their surrounding desert environments, therefore the net radiation is higher in the urban areas. The surface temperatures behave contrary to the net radiation and are higher in land use classes, where water is available.
Wavelet-Based Medical Image Registration for Retrieval Applications
Authors: Azhar Quddus, Otman Basir
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a novel, fully automatic, multiscale wavelet-based image registration technique is proposed for image retrieval applications. We present a fast 2-D rigid registration scheme for retrieval applications. Here, the use of multiscale wavelet representation with mutual information (MI) is expected to facilitate matching of important anatomical structures at multiple resolutions. We propose to use a dyadic grid in the parameter search space for efficient computation in the multiscale domain. The proposed approach has several novel aspects including the use of MI in multiscale wavelet domain and variable bin sizes for each level of decomposition. The technique is also tested under varying noise levels. The results show high efficacy of the proposed approach.
Privacy-preserving reinforcement learning
Authors: Jun Sakuma, Shigenobu Kobayashi, Rebecca N. Wright
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We consider the problem of distributed reinforcement learning (DRL) from private perceptions. In our setting, agents' perceptions, such as states, rewards, and actions, are not only distributed but also should be kept private. Conventional DRL algorithms can handle multiple agents, but do not necessarily guarantee privacy preservation and may not guarantee optimality. In this work, we design cryptographic solutions that achieve optimal policies without requiring the agents to share their private information.