ppxscal/embedding_network huggingface dataset:
Global IPv6 Strategies: From Business Analysis to Operational Planning (Network Business), 1 edition
Authors: Patrick Grossetete, Ciprian P. Popoviciu, Fred Wettling
Venue:  (2008)

Network Business Series Justify Your Network Investment The definitive guide to IPv6 decision making for non-technical business leaders Every year, organizations rely on Internet applications and services more deeplyand every year, Internet infrastructure grows more powerful and complex. As the limitations of traditional IPv4 addressing become increasingly apparent, many decision makers recognize that a transition to IPv6 is needed far sooner than anticipated. Global IPv6 Strategies gives non-technical decision makers the information to plan and execute an orderly, efficient migration to IPv6and reap the business benefits. This books authors offer practical scenarios, proven best practices, and real-world case studies drawn from their unsurpassed experience helping enterprises and service providers move to IPv6. Writing for non-technical decision makers, they systematically review the costs, benefits, impacts, and opportunities associated with IPv6 migration. Their insights and strategies can help you address both the technical side of IPv6 and the rarely discussed organizational issues that can make or break your transition. Patrick Grossetete, manager of Product Management at Cisco, is responsible for key Cisco IOS software technologies including IPv6 and IP Mobility. A member of the IPv6 Forum Technical Directorate, he has been honored with the IPv6 Forum Internet Pioneer Award. Ciprian P. Popoviciu, PhD, CCIE No. 4499, technical leader at Cisco, focuses on architecting, designing, and testing large IPv6 network deployments for service providers and enterprises worldwide. Grossetete and Popoviciu co-authored Deploying IPv6 Networks (Cisco Press). Fred Wettling manages architecture and strategic planning for Bechtel. Wettling is a member of the IEEE, North American IPv6 Task Force, and IPv6 Forum; directs the IPv6 Business Council; chaired the Network Applications Consortium (NAC); and served on the Presidents National Security Telecommunications Advisory Committee Next Generation Network Task Force. Understand how efficient IP communications are rapidly becoming even more central to business and economic growth. Get past the IPv4 vs. IPv6 myths that prevent effective decision making and planning. Objectively assess the constraints of existing IPv4 infrastructuresand learn how IPv6 can overcome them. Develop and analyze the business case for IPv6with help from real-world, never-before-published case studies. Identify hidden business opportunities IPv6 can unleash. Choose the optimal IPv6 adoption strategy for your enterprise or organization. Learn realistic best practices for planning successful migrations This volume is in the Network Business Series offered by Cisco Press. Books in this series provide IT executives, decision makers, and networking professionals with pertinent information about todays most important technologies and business strategies. Category: Networking Technology Covers: IPv6 $44.99 USA / $48.99 CAN
So James, can you find your way any faster?: exploring navigation aids for taxi drivers
Authors: Teija Vainio, Minna Kulju
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

When navigating, we as human beings tend to display systematic or near-systematic errors with distance, direction and other navigation issues. For several centuries, designers, urban planners and architects have developed aids for individuals navigating in real physical environments. However, mobile HCI practitioners and researchers have studied how to support navigation with mobile devices and applications for only a few decades. Thus, for HCI professionals there are many possibilities in exploring existing design guidelines originally developed for urban planners to then support users to navigate better. Whilst there have been a lot of studies of navigation design guidelines based on Kevin Lynch's imageability, in this paper we propose an initial study of navigation design guidelines utilising the theory of designing episodes of motion. The implications of the theory of episodes of motions for mobile human computer interaction are explored in this study with the subjects being mobile workers whose daily routines include navigation tasks. To find new navigation aids is important for taxi drivers, not only in carrying out a navigation task well, but also as a question of safety and productivity in daily work, in addition to usability issues. The main contribution of this paper is in demonstrating the concept of designing episodes of motion and evaluating it in the mobile work context. We conclude that by designing overall views, clues, variations and rhythm into mobile applications, we can improve navigation aids for users.
Exact analysis of hot-potato routing
Authors: U. Feige
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors consider a form of packet routing known as hot potato routing or deflection routing. Its striking feature is that there are no buffers at intermediate nodes. Thus packets are always moving (possibly in the 'wrong' direction), giving rise to the term 'hot potato'. They give a simple deterministic algorithm that on a n*n torus will route a random instance in 2n+O(log n) steps with high probability. They add random delays to this algorithm so that it solves the permutation routing problem on the torus in 9n steps with high probability, on every instance. On a hypercube with N=2/sup n/ nodes, they give a simple deterministic algorithm that will route a random instance in O(n) steps with high probability. Various other results are discussed.
Tunneling and slicing: towards scalable BMC
Authors: Malay Ganai, Aarti Gupta
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Bounded Model Checking (BMC) provides complete design coverage with respect to a correctness property up to a bounded depth. However, with successive unrolling of the design, each BMC instance at depth k becomes bigger in size and harder to solve. We propose a novel scalable approach to decompose disjunctively a BMC instance, into simpler and independent subproblems, based on tunnels i.e., a set of control paths. We simplify each subproblem using slicing, data path simplification and tunnel specific control flow constraints, and solve them independently. We implemented such a tunneling and slicing-based reduction (TSR) approach in Satisfiability-Modulo-Theory (SMT)-based BMC framework. Such a TSR-based approach improves the overall performance of BMC when applied to verification of lowlevel embedded industry programs.
Design of Pre-processing Circuit for Wireless ECG Monitoring System
Authors: Jie Zhu, Nini Rao, Dasong Liang, Wei Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Based on the analysis of Electrocardiograph (ECG) signal’s characteristic, a pre-processing circuit contains amplifiers and de-noising filters for ECG monitoring system is designed. In the stage of low-pass filter, we improve the maximally flat (MF) filter and make simulation experiments. It can be proved that, by introducing a pair of -axis zeros in the transfer function of MF filter, a good performance on both the smoothness in the pass-band and attenuation in the stop-band can be obtained, and the cutoff is much sharper than that of Butterworth filter for the same order. The circuit has been tested on ECG acquiring experiments on human. Both qualitative and quantitative results show that the proposed pre-processing circuit provides good results.
Prototyping a P2P SIP User Agent with Support for Multiple Overlays
Authors: Mosiuoa Tsietsi, Alfredo Terzoli, George Wells
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper describes a systematic approach to provide support at the user agent level for peer-to-peer based multimedia communications using SIP (Session Initiation Protocol). In a society that is becoming increasingly mobile, the advantages of engaging in interactive sessionswithout relying on central servers or infrastructure are clear. Yet, currently many user agents and devices have little support for peer-to-peer communications. In this paper, we motivate for the use of structured peer-to-peer protocols called DHTs, as a foundation for a peer-to-peerlayer. We introduce the concept of ''DHT plug-ins'' which assist in abstracting the interface between the higher level application and the proprietary APIs exposed by the underlying DHTs, allowing us to manipulate user agents with peer-to-peer logic. This embeddable-DHT concept allows these user agents to use different DHTs with one common interface and participate in multiple overlays. We show how an opensource SIP user agent was thus modified and how realtime communications were supported.
Pro WPF with VB 2008: Windows Presentation Foundation with .NET 3.5 (Pro)
Authors: Matthew MacDonald
Venue:  (2008)

Microsoft Windows Presentation Foundation provides the foundation for building applications and highquality user experiences in Windows Vista. WPF blends application user interface, documents, and media content to provide richer control, design, and development of the visual aspects of Windows programs. Author Matthew MacDonald shows you how WPF really works. His nononsense, practical advice will get you building highquality WPF applications quickly and easily. MacDonald will take you through a thorough investigation of the more advanced aspects of WPF, and its relation to other elements of the WinFX stack and the .NET Framework 3.5, to complete your understanding of WPF and VB 2008. WPFs functionality extends to support for Tablet PCs and other forms of input device, and provides a more modern imaging and printing pipeline, accessibility and UI automation infrastructure, datadriven UI and visualization, as well as the integration points for weaving the application experience into the Windows shell. What youll learn WPF basics: XAML, layout, control essentials, and data flow WPF applications: Navigation, commands, localization, and deployment Advanced controls: Custom controls, menus, toolbars, and trees WPF documents: Text layout, printing, and document packaging Graphics and multimedia: Drawing shapes, sound and video, animation, geometric transformations, and imaging Who is this book for? Developers encountering WPF and .NET 3.5 for the first time in their professional lives. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career. Related Titles Pro C# 2008 and the .NET 3.5 Platform, Fourth Edition Pro VB 2008 and the .NET 3.5 Platform, Third Edition Pro WPF in C# 2008: Windows Presentation Foundation with .NET 3.5, Second Edition Pro Silverlight 2
Predicting user action from skin conductance
Authors: László Laufer, Bottyán Németh
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

There are many studies focusing on enhancing physiological data in user interfaces. On one hand biofeedback games are using skin conductance and heart rate data to reflect the emotional state of the user, on the other hand BCI research tries to conclude user intentions from EEG signals. In our research we are collecting usual biofeedback data but process it with complex algorithms similarly to the BCI methodologies. This way we are able to conclude more complex user states than relaxation or anxiety. In our experiments we asked users to play with a simple arcade game, while we were recording physiological data. We were training artificial neural networks to learn the time of user action from the physiological signals. The networks were capable of detecting and also predicting user action 2 seconds before it was carried out.
Klyachko's theorem in semi-finite von Neumann algebras
Authors: Tetsuo Harada
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Let be avon Neumann algebra and be the set of all τ-measurable operators. For positive elements A and B in we prove that ∫K µs(A + B)ds ≤ ∫I µs(A)ds + ∫J µs(B)ds, where µ(ċ) denotes the generalized s-number and I, J, and K are on an analogue of the Klyachko list.
Mobile User Needs: Efficient Transactions
Authors: Tarek El-Kiki, Elaine Lawrence
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Success or failure of any mGovernment mobile service project is decided by the effectiveness of the service itself. This paper is one of a series of four papers investigating mobile user needs in a current research project that endeavours to measure the effectiveness of mGovernment services. In order to achieve as precise a measurement as possible, mobile services are analysed from the perspective of the mGovernment users. Mobile-user-centric mGovernment makes satisfying citizen and business needs the centrepiece in its planning so as to create communities of networked users, not just portals, for individual users. Hence, this paper analyses part of a real-world opinion survey, extracting facts that are used as metrics to measure the effectiveness of existing or proposed mServices.
Modularization of the UML Metamodel Using Model Slicing
Authors: Jung Ho Bae, KwangMin Lee, Heung Seok Chae
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The UML metamodel has been increased in its size and complexity due to many needs for supporting various platforms and domains. The large size of the metammodel can prevent tool developers from understanding the UML metamodel and thus from developing UML-based tools. In this paper, we propose an approach to managing the complexity of the UML metamodel by modularizing the metamodel into a set of small metamodels for each UML diagram type. To that goal, we propose a slicing algorithm for extracting diagram-specific metamodels from the UML metamodel.
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search
Authors: Song Jiang, Lei Guo, Xiaodong Zhang, Haodong Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Flooding is a fundamental file search operation in unstructured peer-to-peer (P2P) file sharing systems, in which a peer starts the file search procedure by broadcasting a query to its neighbors, who continue to propagate it to their neighbors. This procedure repeats until a time-to-live (TTL) counter is decremented to 0. Flooding can seriously limit system scalability because the number of redundant query messages grows exponentially during the message propagation. Our study shows that more than 70% of the generated messages are redundant in a flooding with a TTL of 7 in a moderately connected Gnutella network. Existing efforts to address this issue have been focused on limiting the use of the flooding operation. We propose a new flooding scheme, called LightFlood, with the objective of minimizing the number of redundant messages and retaining a similar message propagating scope as that of the standard flooding. In the scheme, each peer keeps track of the connectivities of every immediate and next indirect neighbor peers, which can be acquired locally. LightFlood identifies the neighbor with the highest connectivity, and uses the link to that neighbor to form a sub-overlay within the existing P2P overlay. In LightFlood, flooding is divided into two stages. The first stage is a standard flooding with a limited number of TTL hops, where a message can spread to a sufficiently large scope with a small number of redundant messages. In the second stage, message propagating is only conducted along the sub-overlay, significantly reducing the number of redundant messages. Our analysis and simulation experiments show that the LightFlood scheme provides a low-overhead broadcast facility that can be effectively used in P2P search. For example, compared with standard flooding with 7 TTL hops, we show that LightFlood with an additional 2 to 3 hops can reduce up to 69% of the flooding messages, and retain the same flooding scope. We believe that LightFlood can be widely used as a core mechanism for efficient message broadcasting in P2P systems due to its near-optimal performance.
A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment
Authors: T. Srinivasan, R. Balakrishnan, S. A. Gangadharan, V. Hayawardh
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

We present a parallelization of the Floyd-Warshall all pairs shortest path algorithm for a distributed environment. A lot of versions of the Floyd-Warshall algorithm have been proposed for a uniprocessor environment, optimizing cache performance and register usage. However, in a distributed environment, communication costs between nodes have to be taken into consideration. We present a novel algorithm, Phased Floyd-Warshall, for a distributed environment, which optimally overlaps computation and communication. Our algorithm is compared with a register optimized version of the blocked all pairs shortest path algorithm [6, 4, 1] which is adapted for a distributed environment. We report speedups of 2.8 in a 16-node cluster and 1.2 in a 32-node cluster for a matrix size of 4096.
Reasoning and Merging in XML Data Integration
Authors: Zijing Tan, Wei Wang, Baile Shi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, we study the problem of making use of target constraints to integrate XML data from different sources under a target schema. We recognize that target constraints are necessary in data integration, as the constraints are essential part of data semantics, and should be satisfied by integrated data. When integrating data from multiple data sources with overlapping data, constraints can express data merging rules at the target as well. We give a general constraint model for XML to express target constraints, which extends the relational equality-generating and tuple-generating dependencies. We provide a chase method to reason about data in the integrated XML document based on target constraints, by inferring data values not given explicitly, and inserting new subtrees as necessary. Singleton and key constraints are used to uniquely specify a certain entity, as a rule for data merging in the integration.
GIS-based modeling of secondary hydrocarbon migration pathways and its application in the northern Songliao Basin, northeast China
Authors: Xuefeng Liu, Guangfa Zhong, Jingyuan Yin, Youbin He, Xianhua Li
Venue: Computers Geosciences (2008)

Hydrocarbon migration pathways are the linkage between hydrocarbon source areas and accumulation sites. Modeling accurately the pathways of hydrocarbon migration is of important significance in determining the location of favorable petroleum exploration targets. In this paper, GIS-based modeling algorithms are presented for searching the pathways of secondary hydrocarbon migration by considering the geologic mechanisms. These algorithms are constructed on a raster digital elevation model (DEM) of the top boundary of a carrier bed, in which secondary migration occurred. On the DEM, a 3x3 pixel sized window is used for searching. The center of the search window is initially assumed at a point on the boundary of a hydrocarbon source area, from which the secondary hydrocarbon migration starts. The altitude values in the eight adjoining pixels enclosing the central pixel of the search window are compared, and the pixel with an altitude value not only larger than the central pixel but also the largest of the eight surrounding pixels is the next target pixel where the search window will move to. Each searched path will terminate at either a convex point, which indicates the existence of a trap for hydrocarbon accumulation, or a point on the boundary of the DEM, which suggests that the pathway of hydrocarbon migration extends outside the DEM. In addition, a concourse point of two paths is also considered as a termination point of either path. The algorithms were successfully applied in the modeling of the secondary migration pathways in the northern Songliao Basin, northeast China. The modeled results matched well with drilling data, suggesting the robustness of the algorithms.
A novel higly accurate current mirror
Authors: Munir A. Al-Absi
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

A novel current mirror that can work in weak and strong inversion is proposed. The mirror is capable of copying current down to nano-ampere range. The proposed scheme eliminates the DC matching error caused by the difference between drain-to-source voltages of both input and output transistors. The proposed configuration was verified using ORCAD simulator in 0.8µm CMOS process technology. Simulation results confirm the functionality and accuracy of the approach.
Nonsymmetric party problems
Authors: András Gyárfáas
Venue: Journal of Graph Theory (1998)

The classical Ramsey problem is considered for antisymmetric digraphs and for tournaments. Three small Ramsey-type numbers are determined with some remarks concerning the general case. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 28: 43&ndash;47, 1998
Enhanced-functionality multipliers
Authors: Mustafa Gök
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

High-speed arithmetic units in modern processors are expected to support multiplication operations with integers, fractions, and floating-point numbers. This paper presents hardware designs that can perform three modes of multiplication: (1) A double-width multiplication that returns a 2n-bit product. (2) A single-width integer multiplication that returns the n least-significant product bits and an overflow signal. (3) A truncated-fractional multiplication that returns the n most-significant product bits. The presented multipliers achieve up to 50% reduced power dissipation in integer and truncated-fractional multiplication modes of operation. For 16-bit or greater operand sizes the enhanced-functionality multiplier (EFM) designs use less than 10% more hardware compared to the conventional multipliers.
A parameterless feature ranking algorithm based on MI
Authors: Jin-Jie Huang, Yun-Ze Cai, Xiao-Ming Xu
Venue: Neurocomputing (2008)

A parameterless feature ranking approach is presented for feature selection in the pattern classification task. Compared with Battiti's mutual information feature selection (MIFS) and Kwak and Choi's MIFS-U methods, the proposed method derives an estimation of the conditional MI between the candidate feature f"i and the output class C given the subset of selected features S, i.e. I(C;f"i|S), without any parameters like @b in MIFS and MIFS-U methods to be preset. Thus, the intractable problem can be avoided completely, which is how to choose an appropriate value for @b to achieve the tradeoff between the relevance to the output classes and the redundancy with the already-selected features. Furthermore, a modified greedy feature selection algorithm called the second order MI feature selection approach (SOMIFS) is proposed. Experimental results demonstrate the superiority of SOMIFS in terms of both synthetic and benchmark data sets.