ppxscal/embedding_network huggingface dataset:
FT²EI: A Dynamic Fault-Tolerant Routing Methodology for Fat Trees with Exclusion Intervals
Authors: Crispín Gómez Requena, María Engracia Gómez Requena, Pedro Juan López Rodríguez, José Francisco Duato Marín
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Fault tolerance in the interconnection network of large clusters of PCs is an issue of growing importance, since their increasing size also increases the failure probability. The fat-tree topology is usually used in these machines since it has become very popular among high-speed interconnect manufacturers. This paper proposes a new distributed fault-tolerant routing methodology for fat trees. Unlike other previous proposals, it does not require additional network hardware, and its memory requirements, switch hardware, and routing delay scales up with the network size. Indeed, it nullifies only the strictly necessary paths, allowing adaptive routing through the healthy paths. The methodology is based on enhancing the Interval Routing scheme with exclusion intervals. Exclusion intervals are associated to each switch output port and represent the nodes that are unreachable from this port after a fault. We propose a methodology to identify the links where the exclusion intervals must be updated after a fault, the values to write on them, and a very efficient mechanism to distribute the required information through the network without stopping the system activity. Our methodology can tolerate a high number of network failures with a low degradation in performance. Moreover, it can achieve zero packet losing during the updating period.
Geometrical Geodesy: Using Information and Computer Technology, 1st edition
Authors: Maarten Hooijberg
Venue:  (2007)

The book has evolved through the author's 25 years of advising and writing on geodetic methods in which the aspect of learning by doing is stressed, including analyses of quality. Consequently, it covers practical aspects of geometrical geodesy and particulars of fundamental constants, horizontal and vertical datums, geoids, bi-axial ellipsoids and reference systems, units of frequencies and time, conformal projections, similarity transformations and spatial developments in electronic and acoustic positioning frames. The impact of information, communication and parallel computer technology with an ability to store and retrieve huge amounts of data is discussed up to the point where the compilation of relevant data is completely automated using comprehensive analyses on a worldwide distribution network. All Fortran computer subroutines described in the book can also be found on the enclosed CD-ROM, including compiled ready-to-run Fortran programs. A computer of modest capacity can cope with the algorithms. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A globally convergent descent method for nonsmooth variational inequalities
Authors: Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando
Venue: Computational Optimization and Applications (2009)

We propose a descent method via gap functions for solving nonsmooth variational inequalities with a locally Lipschitz operator. Assuming monotone operator (not necessarily strongly monotone) and bounded domain, we show that the method with an Armijo-type line search is globally convergent. Finally, we report some numerical experiments.
Schneier's Cryptography Classics Library: Applied Cryptography, Secrets and Lies, and Practical Cryptography
Authors: Bruce Schneier
Venue:  (2007)

* Cryptography is the study of message secrecy and is used in fields such as computer science, computer and network security, and even in instances of everyday life, such as ATM cards, computer passwords, and electronic commerce. Thanks to his innovative and ingenious books on the subject of cryptography, Bruce Schneier has become the world's most famous security expert. Now, his trio of revolutionary titles can be found in this unprecedented, value-priced collection. * Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition: This seminal encyclopedic reference provides readers with a comprehensive survey of modern cryptography. It describes dozens of cryptography algorithms, offers practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. * Secrets and Lies: Digital Security in a Networked World: This narrative, straight-talking bestseller explains how to achieve security throughout computer networks. Schneier examines exactly what cryptography can and cannot do for the technical and business community. * Practical Cryptography: As the ideal guide for an engineer, systems engineer or technology professional who wants to learn how to actually incorporate cryptography into a product, this book bridges the gap between textbook cryptography and cryptography in the real world. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Movie story intensity representation through audiovisual tempo analysis
Authors: Chia-Hung Yeh, Chih-Hung Kuo, Rung-Wen Liou
Venue: Multimedia Tools and Applications (2009)

A comprehensive method for movie abstraction is developed in this research for applications in fast movie content exploring, indexing, browsing, and skimming, Most current approaches rely heavily on specific domain knowledge or models to identify and extract the determining scenes of a given movie; however, the segments extracted are often isolated, presenting a fragmented outline of the original. Our proposed method fuses simple audiovisual features, and measures the "tempos" of a movie directly, especially that of long-term ones. These tempos form a curve that catches the high-level semantics of a movie, indicating the events of interests named as "story intensity." Through tempo, the proposed algorithm provides a natural way that segments a movie into manageable parts. As our experimental results demonstrate, the condensed skimming clips efficiently extract semantic content that contains the most interesting and informative parts of the original movie.
On the Rate of Structural Change in Scale Spaces
Authors: David Gustavsson, Kim S. Pedersen, Francois Lauze, Mads Nielsen
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We analyze the rate in which image details are suppressed as a function of the regularization parameter, using first order Tikhonov regularization, Linear Gaussian Scale Space and Total Variation image decomposition. The squared L 2-norm of the regularized solution and the residual are studied as a function of the regularization parameter. For first order Tikhonov regularization it is shown that the norm of the regularized solution is a convex function, while the norm of the residual is not a concave function. The same result holds for Gaussian Scale Space when the parameter is the variance of the Gaussian, but may fail when the parameter is the standard deviation. Essentially this imply that the norm of regularized solution can not be used for global scale selection because it does not contain enough information. An empirical study based on synthetic images as well as a database of natural images confirms that the squared residual norms contain important scale information.
Variant of Gaussian kernel and parameter setting method for nonlinear SVM
Authors: Shui-Sheng Zhou, Hong-Wei Liu, Feng Ye
Venue: Neurocomputing (2009)

The classification problem by the nonlinear support vector machine (SVM) with kernel function is discussed in this paper. Firstly, the stretching ratio is defined to analyze the performance of the kernel function, and a new type of kernel function is introduced by modifying the Gaussian kernel. The new kernel function has many properties as good as or better than Gaussian kernel: such as its stretching ratio is always lager than 1, and its implicit kernel map magnifies the distance between the vectors in local but without enlarging the radius of the circumscribed hypersphere that includes the whole mapping vectors in feature space, which maybe gets a bigger margin. Secondly, two aspects are considered to choose a good spread parameter for a given kernel function approximately and easily. One is the distance criterion which minimizes the sum-square distance between the labeled training sample and its own center and maximizes the sum-square distance between the training sample and the other labeled-center, which is equivalent to the famous Fisher ratio. The other is the angle criterion which minimizes the angle between the kernel matrix and the target matrix. Then a better criterion is given by combined those aspects. Finally, some experiments show that our methods are efficient.
Towards Systems Integration Technology
Authors: Tetsuo Tomiyama
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

In modern concurrent engineering practices, product development of complex multi-disciplinary products is performed by a team composed of experts from various disciplines such as mechanical design, electronics design, production engineering, industrial design, marketing, finance, sales, services, procurement, etc. Within this formation of team, it is usually the leader who makes decisions and performs systems integration. While in team working, the leader's role is often wrongly mixed with the role of manager. The net result is often the team leader performs the roles of decision maker, manager, and systems integrator. Due to these practices, there is even a belief that the “art” of systems integration can only be learned through experiencing many positions, accumulating experiences and skills. Accordingly, systems integration cannot be discussed and taught in schools. This paper tries to attack this myth and to establish systems integration technology as a discipline that can be studied, discussed, and taught.
Plenary panel: digital government research what we have learned about forging successful DG research projects
Authors: Judith Bayard Cushing, Sharon S. Dawes
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

This panel session will feature a discussion of the challenges inherent in digital government research projects due to their interdisciplinary nature and practice-based settings. We aim to offer a future-oriented perspective that rests on an open discussion of past and current experiences, with a special focus on the key issues that make (or break) digital government research projects.
Vibrotactile score: A score metaphor for designing vibrotactile patterns
Authors: Jaebong Lee, Jonghyun Ryu, Seungmoon Choi
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Despite the plethora of vibrotactile applications that already have begun to impact our everyday life, how to design vibrotactile patterns easily and efficiently remains to be a challenge. In this paper, we introduce a vibrotactile score, an effective means for composing vibrotactile patterns. The vibrotactile score is a metaphor of the musical score to vibrotaction, and its design is adapted from two common musical scores (the piano score and the guitar tablature). Moreover, we developed an authoring tool, Vibrotactile Score Editor (VibScoreEditor), that fully supports the vibrotactile score with intuitive graphical user interface. Another metaphorical feature, vibrotactile clef (analogous to the musical clef), is incorporated in the editor to make the process of composing vibrotactile patterns decoupled from the process of considering the signal-level characteristics of vibration. A few examples of vibrotactile patterns designed using the VibScoreEditor are also presented.
Practical On-Line Signature Verification
Authors: J. M. Pascual-Gaspar, V. Cardeñoso-Payo, C. E. Vivaracho-Pascual
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

A new DTW-based on-line signature verification system is presented and evaluated. The system is specially designed to operate under realistic conditions, it needs only a small number of genuine signatures to operate and it can be deployed in almost any signature capable capture device. Optimal features sets have been obtained experimentally, in order to adapt the system to environments with different levels of security. The system has been evaluated using four on-line signature databases (MCYT, SVC2004, BIOMET and MyIDEA) and its performance is among the best systems reported in the state of the art. Average EERs over these databases lay between 0.41% and 2.16% for random and skilled forgeries respectively.
Knowledge Engineering for Affective Bi-Modal Interaction in Mobile Devices
Authors: Efthymios Alepis, Maria Virvou, Katerina Kabassi
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

This paper focuses on knowledge engineering for the development of a system that provides affective interaction in mobile devices. The system bases its inferences about users' emotions on user input evidence from the keyboard and the microphone of the mobile device. For this purpose different experimental studies have been conducted with the participation of mobile users and human experts. The experiments' aim was twofold. They aimed at revealing the criteria that are taken into account in each mode for emotion recognition as well as their weight of importance. The results of the studies are further used for the application of a multi-criteria decision making model.
Improved design of three-level NPC inverters in comparison to two-level inverters
Authors: Hengameh Kojooyan Jafari, Ahmad Radan
Venue: WSEAS Transactions on Circuits and Systems (2009)

As voltage source 3-level NPC inverters are suitable for AC drives in average voltage and FACT applications in distribution systems, this report introduces optimized design of 3-level NPC inverter by decreasing inverter losses and costs. At first optimization parameters and application functions of losses are introduced[1], then by using MATLAM6.5 program and IGBT, diodes, switching frequency and load current typical input parameters [1] are considered then by SPWM switching algorithm in program, optimized RGon, RGoff and gate voltage for 3-level NPC inverters are calculated for minimizing switching and conduction losses of inverter among all amounts of calculated RGon, RGoff and gate voltage in comparison to optimized design of 2-level inverters[1]. Then results of NPC optimization are applied for simulation of improved NPC, using SVM switching algorithm as the best method of switching and results are presented.
Theoretical study of the compounds obtained by grafting of 2-chloroethyl phosphonic acid on inorganic supports using computational methods
Authors: Simona Funar-Timofei, Gheorghe Ilia
Venue: Proceedings of the 2nd conference on European computing conference (2008)

The modification of titania with phosponic acids is an area wich becomes more and more interesting because of numerous applications like ceramic membranes or enzimatic catalysis. Organophosphorus coupling agents can bind strongly to the surface of transition metal oxides. This paper presents a theoretical study of grafting reactions of 2-chloroethyl phosphonic acid with titanium oxide. Starting from experimental X-ray data of the rutile crystal, several possible complexes with 2-chloroethyl phosphonic acid were built. The semiempirical PM6 quantum chemical approach was used in order to find out the way of anchoring the phosphonic moieties. The results thus obtained gave indications on the stability of the complex formation.
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Authors: Rasmus Pagh, Srinivasa Rao Satti
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

Let ∑ be a finite, ordered alphabet, and consider a string x=χ1χ2... χn ∈ ∑n. A secondary index for x answers alphabet range queries of the form: Given a range [αl,αr] ⊆ ∑, return the set I[αl,αr] = {i |χi ∈ >[αl,αr]}. Secondary indexes are heavily used in relational databases and scientific data analysis. It is well-known that the obvious solution, storing a dictionary for the set ∪i{χi} with a position set associated with each character, does not always give optimal query time. In this paper we give the first theoretically optimal data structure for the secondary indexing problem. In the I/O model, the amount of data read when answering a query is within a constant factor of the minimum space needed to represent the set I[αl,αr], assuming that the size of internal memory is (|∑| lg n)δ blocks, for some constant δ > 0. The space usage of the data structure is O(nlg |∑|) bits in the worst case, and we further show how to bound the size of the data structure in terms of the 0th order entropy of x. We show how to support updates achieving various time-space trade-offs. We also consider an approximate version of the basic secondary indexing problem where a query reports a superset of I[αl,αr] containing each element not in I[αl,αr] with probability at most ∈, where ∈ > 0 is the false positive probability. For this problem the amount of data that needs to be read by the query algorithm is reduced to O(|I(αl,αr]| lg(1/∈)) bits.
Characterizing the Space by Presenting Non-visual Information
Authors: Tomohiro Akagawa, Takuji Narumi, Young Ah Seong, Takashi Kiriyama
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

We are aiming at adding characteristics to the existing space by providing people with non-visual, location-dependent information. By manipulating non-visual information presented to people, we can change implicit partitioning of the space without physically reconstructing it. "Thermotaxis" is a system that gives sensations of cool and warm to users by controlling thermoelectric devices wirelessly. In this system, the space is characterized as being cool or warm. Users experience the difference in temperatures while they walk in the space. Preliminary analysis shows that people stay close in the area of a comfortable temperature.
Robust pedestrian detection and tracking in crowded scenes
Authors: Philip Kelly, Noel E. O'Connor, Alan F. Smeaton
Venue: Image and Vision Computing (2009)

In this paper, a robust computer vision approach to detecting and tracking pedestrians in unconstrained crowded scenes is presented. Pedestrian detection is performed via a 3D clustering process within a region-growing framework. The clustering process avoids using hard thresholds by using bio-metrically inspired constraints and a number of plan-view statistics. Pedestrian tracking is achieved by formulating the track matching process as a weighted bipartite graph and using a Weighted Maximum Cardinality Matching scheme. The approach is evaluated using both indoor and outdoor sequences, captured using a variety of different camera placements and orientations, that feature significant challenges in terms of the number of pedestrians present, their interactions and scene lighting conditions. The evaluation is performed against a manually generated groundtruth for all sequences. Results point to the extremely accurate performance of the proposed approach in all cases.
Image Recognition Technique for Unmanned Aerial Vehicles
Authors: Karol Jedrasiak, Aleksander Nawrat
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

Developing fast and accurate 2D image processing algorithms is an important task for the practical use of cybernetics. This paper presents an algorithm for fast and accurate blob detection and extraction based on the usage of two parameters ¿ and ¿. The algorithm is aimed to work in the color domain to prevent any loss of information but can also be implemented on gray-scale images. Achieved regions of interest can be further processed to achieve high level description. The algorithm is implemented in Java environment in order to adduce results on different video devices and system platforms.
Multiple Postmen Problems- Fundamentals and New Algorithms
Authors: Dino Ahr
Venue:  (2007)

The effective management of transportation resources can reduce the expenses of an organization significantly. For these reasons the study of routing problems has been an important area of operations research for the last fifty years, and its significance is still growing with the increasing numbers of companies and organizations that have to deal with transport activities. This book deals with a major subclass of routing problems, so called postman problems, where services have to be performed along streets, e.g., postal service, waste collection or street cleaning activities. The introductory part of the book gives a comprehensive survey to routing problems. The main part of the book is dedicated to an in-depth treatment of postman problems with multiple postmen. The author presents fundamental and well known methods as well as new algorithms to attack these problems effectively. This book is valuable for mathematicians, computer scientists and economists who have to solve multiple postmen problems in theory and practice. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Mapping from Pi-Calculus into BPEL
Authors: Faisal Abouzaid
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

In the world of Web services composition languages, Business Process Execution Language for Web Services (BPEL or BPEL4WS), proposed by major vendors such as BEA, IBM or Microsoft has become the standard. However, its definition has not been formalized and this is penalizing for verification of correct behaviour of business processes. Several works have been dedicated to this purpose. Petri nets have been widely used to model Web services composition, but the π-calculus language seems to be more adequate for several reasons. For this process algebra, techniques and tools exist which make it possible to model-check any specification. To do this, one can map BPEL programs to π-calculus process and then perform verification. A more promising way is to directly build π-calculus model, to check it and then map it to a BPEL process model. This papers describes a mapping from π-calculus onto BPEL process model.
Shaping e-Learning Applications for a Service-Oriented Grid
Authors: Vytautas Reklaitis, Kazys Baniulis, Toshio Okamoto
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

This paper discusses technical issues related to establishing e-learning services on a Grid. The XML based technology for implementing e-learning applications in web service form is analyzed from the standpoint of making an application Grid-aware. A special e-learning repository service is proposed as a technique for coordinated use of distributed e-learning resources through the access and invocation of web services.