ppxscal/embedding_network huggingface dataset:
Generation of 3D Line Segment Based on Disparity Data
Authors: Dong-Min Woo
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents a new 3D line segment extraction method by using disparity map generated in the process of stereo matching. The core of our technique is that feature matching is carried out by the reference of the disparity evaluated by area-based stereo. Since the reference of the disparity can significantly reduce the number of feature matching combinations, feature matching error can be drastically minimized. One requirement of the disparity to be referenced is that it should be reliable to be used in feature matching. To measure the reliability of the disparity, in this paper, we employ the self-consistency of the disparity. Our suggested technique misapplied to the detection of 3D line segments by 2D line matching using our hybrid stereo matching, which can be efficiently utilized in the generation of the rooftop model from urban images. The suggested method is evaluated on Avenches data set of Ascona aerial images. Experimental results indicate that the extracted 3D line segments have an average error of 0.5m and can be efficiently used to the construction of 3D site models using a simple 3D line grouping.
Cross-agency coordination in the shadow of hierarchy: 'joining up' government geospatial information systems
Authors: K. T. Lance, Y. Georgiadou, A. K. Bregt
Venue: International Journal of Geographical Information Science (2009)

Government agencies striving to make geospatial information systems interoperable and cost-effective often appear to function as a self-regulating network shaped only by internal trust and reciprocity. However, recent public management research suggests that external steering of a network, exercised by authoritative bodies through hierarchical means, may invigorate cross-agency coordination. The two case studies of federal geospatial coordination in Canada and the USA confirm this emerging theory of network-hierarchy dynamics. In these countries, the central budget agency (CBA) is influencing resource flows and accountabilities within a federal geospatial network of government agencies, which in turn affects how these agencies deliver 'joined up' services. The CBA relies upon three types of tools: the shaping of network governing structures, promotion of uptake of new management information systems, and the use of evaluation (scrutiny) to solidify accountabilities of the network. Since these tools cast a shadow of hierarchy upon the network, they may be viewed as counter to the voluntary ethos of networks. However, the case studies suggest that the CBA's actions appear to confer legitimacy to the network—resulting in a seeming contradiction—greater central control, more vigorous, distributed geospatial coordination.
Voltage-dependent parameter refinement for single-phase induction motors using genetic algorithms
Authors: N. Naewngerndee, T. Kulworawanichpong
Venue: WSEAS Transactions on Systems and Control (2009)

This paper presents a genetic-based approach to correct the parameters for single-phase induction motors in various supply voltage levels. From conventional tests, electrical (resistances and inductances) and mechanical (moment of inertia and damping coefficient) parameters of the stator and the rotor can be estimated. The set of obtained parameters is able to apply for steady-state performance analyses. In transient states, motor responses generated by these parameters are not met the condition of acceptable accuracy. By some efficient search method incorporate with experimental data, the obtained parameters can be refined to yield the best curve fitting in both transient and steady-state responses. A 0.37-kW, 220 V, 50 Hz single-phase induction motor was used for test to verify the effectiveness of the proposed algorithm. Furthermore, with six different motor supply voltages, voltage-dependent parameters of single-phase induction motors can be established. As a result, the voltage-dependent parameters of the induction motors can be satisfactorily improved to represent the motor dynamic in various supply voltages.
Resource Allocation Model Based on Non-Cooperative Bidding Game in P2P Network
Authors: Jun Tao
Venue: International Journal of Distributed Sensor Networks (2009)

Game theory is applied to studying the P2P resource allocation technologies further in this paper. The mechanism of P2P resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in P2P resource allocation game. At last, we present a P2P resource allocation algorithm (PRANG) based on the resource allocation game model. The results of the experiment and the simulation show that PRANG algorithm can provide references for the quantity of resource that users demand and regularize the users' bids. Consequently, the allocation of the whole P2P resource tends to be more reasonable.
Designing for Networked Communications: Strategies and Development
Authors: Simon B. Heilesen, Sisse Siggaard Jensen
Venue:  (2007)

"Designing for Networked Communications: Strategies and Development explains how to plan, use, and understand the products and the dynamic social processes and tasks some of the most vital innovations in the knowledge society depend upon social as well as technological. Focusing on various forms of design, implementation and integration of computer mediated communication, this book bridges the academic fields of computer science and communication studies. Designing for Networked Communications: Strategies and Development uses an interdisciplinary approach, and presents results from recent and important research in a variety of forms for networked communications. A constructive and critical view of the interplay between the new electronic and the more conventional modes of communication are utilized, while studies of organizational work practices demonstrate that the use of new technologies and media is best understood and integrated into work practices. In this process of merging, both are remodelled and rearranged while being adapted to the practices and activities for which they were designed."
Onboard electronic library supporting railway operations
Authors: Jon Mikel Rubina Diez, Gerardo Aranguren Aramendia
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

A new telematics solution is presented to solve the problems derived from the huge amounts of necessary documentation that locomotive engineers currently have to carry printed on papers during railway operations. This thesis is inspired on a case study analyzed at Euskotren, a basque railway operator. The functional characteristics of the solution are related and some technical aspects of its implementation are introduced. In the experiments carried out with the railway operator, this innovative solution has proved to improve the efficiency of railway operations what implies improvements in the safety of the operations.
Observations concerning the dynamics for k-order nonlinear discrete determinist exchange rate models
Authors: Mirela-Catrinel Voicu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper we present some results for a particular type of k-order exchange rate models. The relation between the cycles of period p (p ≥ 1) is investigated. Given their nonlinear nature, these systems can display a more complex evolution (like chaotic behavior). We present such examples of behavior, using numerical simulations. The algorithms implementation is made using VBA (Visual Basic for Applications) program in Excel, and the images in the figures in this paper are made using Mathematica.
Robust Simultaneous Low Rank Approximation of Tensors
Authors: Kohei Inoue, Kenji Hara, Kiichi Urahama
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

We propose simultaneous low rank approximation of tensors (SLRAT) for the dimensionality reduction of tensors and modify it to the robust one, i.e., the robust SLRAT. For both the SLRAT and the robust SLRAT, we propose iterative algorithms for solving them. It is experimentally shown that the robust SLRAT achieves lower reconstruction error than the SLRAT when a dataset contains noise data. We also propose a method for classifying sets of tensors and call it the subspace matching, where both training data and testing data are represented by their subspaces, and each testing datum is classified on the basis of the similarity between subspaces. It is experimentally verified that the robust SLRAT achieves higher recognition rate than the SLRAT when the testing data contain noise data.
Build a Smarter Government, Build a Smarter Federal IT Operation
Authors: Wushow "Bill" Chou
Venue: IT Professional (2009)

Inspired by President Obama's call for "change we need" to "build a smart federal government," this article offers one man's viewpoint on how to build a better federal IT operation. The core change we need to make is to move from the current culture of long in management and short in IT technical expertise to the paradigm of long in IT technical expertise and short in management.
Measurement, Modeling and Analysis of Peer-to-Peer VoD System
Authors: Yi Zheng, Changjia Chen, Chunxi Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Recent few years, many p2p VoD softwares are widely applied through out the internet, which gives us an opportunity to study user watching behavior of p2p VoD system at large scale. Many previous works on this area directly regard peer's information transmitting log such as buffer message as peer's watching behavior log. However, the effect of prefetch strategy is not considered. In this paper, we establish a simple mathematical model to show the relationship between the distribution of watching index and bitmap index. Through this model, we attempt to enhance our understanding on p2p VoD user watching behavior and its implications for file sharing efficiency. This paper will be the first study on this problem upto-date. Experiment results confirm the conclusion that the differences between watching index and bitmap index cannot be neglected. A more accurate way to study user watching behaviors can be generated from our model.
Multistage high power factor rectifier with passive lossless current sharing
Authors: Jose A. Villarejo, Esther De Jodar, Fulgencio Soto, Jacinto Jimenez
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Passive current sharing in multiphase converters, where resistive losses are not dominant, is a quite complex goal. In this work, input impedance of active clamp boost converters is used like a lossless passive equalization in multistage high power factor rectifier. This technique allows the design of high power converters by and easy parallel association of power stages. Experimental results are presented, taken form a tree stages laboratory prototype rated at 0.35x3 kW, input ac voltage of 230Vrms, output voltage of 400V, and 100 kHz switching operation. Due to the simplicity of the current share technique, the control can be done using analog control based on the Unitrode's UC3854 strategy.
Research on File Content Tamper-proofing System for Distribution Environment
Authors: Tong Liu, Jiya Jiang, Ying Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

It is very important to protect the data security in distributed web applications. In this paper, a file content tamper-proofing system is proposed, which can effectively resist file content tampering, and prevents illegal information spreading. To meet the requirement of authentication speed, a fast authentication algorithm combines file length verification and HMAC is used in the file content tamper-proofing system, which improves the computing speed while keeping the system’s security. Then the implementation plan of the file content tamper-proofing system is proposed.
An Argumentation Framework Based on Strength for Ontology Mapping
Authors: Cássia Trojahn, Paulo Quaresma, Renata Vieira
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

In the field of ontology mapping, using argumentation to combine different mapping approaches is an innovative research area. We had extended the Value-based Argumentation Framework (VAF) in order to represent arguments with confidence degrees, according to the similarity degree between the terms being mapped. The mappings are computed by agents using different mapping approaches. Based on their preferences and confidences, the agents compute their preferred mapping sets. The arguments in such preferred sets are viewed as the set of globally acceptable arguments. In previous work we had used discrete classes to represent the confidence degrees (certainty and uncertainty). In this paper, we propose to use continuous values from the interval [0,1]. Here, confidence is treated as strength. Using a threshold for the strength we can reduce the set of mappings and adjust the values of precision. We evaluate the use of strength against the previous confidence as discrete classes. The results are promising, especially what concerns precision.
A Method for Simulation and Analysis of Trackside Data Communication System in CBTC
Authors: Yan Zhang, Li Zhu, Lijie Chen, Tao Tang, Sining Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

When simulation aims at evaluating the scalability of new protocols and applications, it is indispensable to work with large scale network topologies. It has important practical significance and benefits for improving the behaviors of network planning and design, system optimized design and project risk reduction. The technique of modeling our safe communication protocol of Communication Based Train Control (CBTC) and the setup of a research platform using the OPNET Modeler are introduced, so that the dynamic performance issues could be studied to guide the CBTC network planning and design.
Using operational standards to enhance system performance
Authors: David R. Vincent
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

There are only three reasons for a data center to vary from service level objectives, i.e., volume, mix, and efficiency. The first two are aspects of user behavior, while only the third is under the full control of the data center. With the proliferation of online systems, user behavior is affecting the data center in realtime. Management processes, technology and software tools exist to provide the basis for scientific management of the data center. Key to this endeavor is the ability to model the system and present in graphic form the relationship between the system and user behavior characteristics. This paper points out the source of data, existing software tools, and graphic methods and includes data and the results from a study and simulation of a data center.
Investigating the existence and the regularity of Logarithmic Harary Graphs
Authors: Roberto Baldoni, Silvia Bonomi, Leonardo Querzoni, Sara Tucci Piergiovanni
Venue: Theoretical Computer Science (2009)

This paper studies the existence and the regularity of Logarithmic Harary Graphs (LHGs). This study is motivated by the fact that these graphs are employed for modeling the communication topology to support efficient flooding in the presence of link and node failures when considering an initial arbitrary number of nodes n. Therefore, the capability to identify graph constraints that allow the construction of LHGs for the largest number of pairs (n,k) (where k is the desired degree of connectivity to be tolerant to failures) becomes of primary importance. The paper presents several results in that direction. We introduce a graph constraint, namely K-PASTED-TREE, that allows the construction of a LHG for every pair (n,k) such that n>=2k. Secondly we present another graph constraint for LHG, namely K-DIAMOND, which is equivalent to K-PASTED-TREE in terms of capability to construct LHGs for any pair (n,k). The interest of K-DIAMOND lies in the fact that, for a given k, K-DIAMOND allows us to construct more regular graphs than K-PASTED-TREE does. A k-regular graph shows the minimal number of links required by a k-connected graph, leading to minimal flooding cost. The paper formally shows, in particular, that there are an infinite number of pairs (n,k), such that there exists a k-regular LHG for the pair (n,k) that satisfies K-DIAMOND and does not satisfy K-PASTED-TREE.
Effect of Bit Precision on Hardware Complexity for DDFS Architecture
Authors: Aqib Perwaiz, Shoab A. Khan
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper proposes an analysis of bit resolution versus the hardware complexity of a novel CORDIC (Coordinate Rotational Digital Computer) architecture, which acts as DDFS (Direct digital Frequency Synthesizer). The analysis will help us reaching a point which is optimum as far as bit resolution Vs mean square Error is concerned Further more it will conclude that an increase in bit resolution does not really help in reducing the mean square error there fore making hardware more complex is not advise, compactness of hardware is derectly proportional to area and power consumption as well.
Deriving SOA Evaluation Metrics in an Enterprise Architecture Context
Authors: Stephan Aier, Maximilian Ahrens, Matthias Stutz, Udo Bub
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Service oriented architectures (SOA) are becoming reality in a corporate environment. Rather than pure technology improvements SOA intends to increase manageability and sustainability of IT systems and to better align business requirements and technology implementations. Following these intentions current SOA research is focused on the management of SOA. In this paper we present a method to identify metrics for an evaluation of SOA. Therefore we adopted the goal/question/metrics method to SOA specifics. Since SOA is not limited to questions of technology we will show where SOA might be located in an enterprise architecture (EA) context. Based on the assumption that SOA follows different goals on different levels of EA abstraction, the paper shows, how these goals can be developed to metrics which can be consolidated in a measurement program.
Googling Security: How Much Does Google Know About You?, 1 edition
Authors: Greg Conti
Venue:  (2008)

What Does Google Know about You? And Who Are They Telling? When you use Googles free services, you pay, big timewith personal information about yourself. Google is making a fortune on what it knows about youand you may be shocked by just how much Google does know. Googling Security is the first book to reveal how Googles vast information stockpiles could be used against you or your businessand what you can do to protect yourself. Unlike other books on Google hacking, this book covers information you disclose when using all of Googles top applications, not just what savvy users can retrieve via Googles search results. West Point computer science professor Greg Conti reveals the privacy implications of Gmail, Google Maps, Google Talk, Google Groups, Google Alerts, Googles new mobile applications, and more. Drawing on his own advanced security research, Conti shows how Googles databases can be used by others with bad intent, even if Google succeeds in its pledge of dont be evil. Uncover the trail of informational bread crumbs you leave when you use Google search How Gmail could be used to track your personal network of friends, family, and acquaintances How Googles map and location tools could disclose the locations of your home, employer, family and friends, travel plans, and intentions How the information stockpiles of Google and other online companies may be spilled, lost, taken, shared, or subpoenaed and later used for identity theft or even blackmail How the Google AdSense and DoubleClick advertising services could track you around the Web How to systematically reduce the personal information you expose or give away This book is a wake-up call and a how-to self-defense manual: an indispensable resource for everyone, from private citizens to security professionals, who relies on Google. Preface xiii Acknowledgments xix About the Author xxi Chapter 1: Googling 1 Chapter 2: Information Flows and Leakage 31 Chapter 3: Footprints, Fingerprints, and Connections 59 Chapter 4: Search 97 Chapter 5: Communications 139 Chapter 6: Mapping, Directions, and Imagery 177 Chapter 7: Advertising and Embedded Content 205 Chapter 8: Googlebot 239 Chapter 9: Countermeasures 259 Chapter 10: Conclusions and a Look to the Future 299 Index 317
Insight of the fuzzy grey autoregressive model
Authors: Ruey-Chyn Tsaur
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In our previous research, we proposed a fuzzy grey regression model for solving limited time series data. The present paper follows the previous research and proposes a fuzzy grey autoregressive model for considering that the current value is correlated with previous values. The proposed model combines the advantages of the grey system model, the fuzzy regression model and the autoregressive model. Two illustrated examples are provided in which the amount of internet subscribers in Taiwan and the global demand of LCD TVs are forecasted. The results of these practical applications show that the proposed model can be used to obtain smaller forecasting errors of MAPE and RMSE, and that it makes good forecasts for the next demand period of internet subscribers and LCD TV. Furthermore, this model makes it possible for decision makers to forecast the best and the worst estimates based on fewer observations.
Usefulness of Retina Codes in Biometrics
Authors: Thomas Fuhrmann, Jutta Hämmerle-Uhl, Andreas Uhl
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

We discuss methods for generating retina codes from retinal images for biometric user authentication. Starting from the optical disc, concentric circles are placed over the binary vessel image for data sampling and different variants of retina code are generated after transformation to polar coordinates. The methods inter personal variability and robustness is evaluated on the publicly available DRIVE database. Results indicate a low inter personal variability questioning the usefulness of retina codes in sensible authentication systems.
Multimedia application with animated cartoons for teaching science in elementary education
Authors: K. Dalacosta, M. Kamariotaki-Paparrigopoulou, J. A. Palyvos, N. Spyrellis
Venue: Computers Education (2009)

This study reports research findings on the use of animated cartoons in a multimedia application meant to evaluate their effectiveness in supporting teaching and learning in science. The researchers have developed a cartoon-style multimedia application whereas animated cartoons where designed from scratch using appropriate programs. The study was carried out in various elementary schools of Athens, Greece, and 179 pupils aged 10-11 years participated in it. The research results provide evidence that the use of animated cartoons significantly increases the young students' knowledge and understanding of specific science concepts, which are normally difficult to comprehend and often cause misconceptions to them.