ppxscal/embedding_network huggingface dataset:
Review: Topological network design: A survey
Authors: Mostafa Abd-El-Barr
Venue: Journal of Network and Computer Applications (2009)

We consider the problem of topological optimization of communication networks subject to a number of design constraints, such as maximum network diameter, maximum node degree, k-node (link) survivability, and network fault tolerance. The primary design problem can be described as follows: Given a set of network nodes, it is required to find a topology @J, selected from all possible topologies, so that the cost of @J (measured possibly in terms of the maximum diameter, maximum node degree, etc.) is less than that of any other network topology and such that @J satisfies some given design constraints. Fault tolerance is concerned with the ability of the network nodes to communicate in the presence of a set of faulty links and/or nodes. The network design problem considering reliability constraints is NP-hard. We classify the research efforts presented in the literature for solving the topological optimization design problem as hierarchical, enumerative, or iterative techniques. In this paper, we provide a survey of the topological network design techniques under different design constraints. Experimental results obtained by applying a number of algorithms to a set of randomly generated networks are presented and compared.
Effect of building the Peja III -400/110 kV station on electro energetic system of Kosova
Authors: Rexhep Shaqiri, Vezir Rexhepi
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

A transmission network is a compact and integrative structure in hierarchical electro-energetic power, and plays an important and significant role in functioning and realizing performance of transmission energy to the consumer electric power supply and the quality of supply. Based on this importance there are many analysis in studying of medium and long term plans of electro-energetic power. From this point there are enunciations and simulations of cases when the rebuilding of the network transmission is planned, and where it is mentioned about the building of new substation. This article describes the simulations of the power system of Kosovo in order to emphasize the importance of the new substation 400/110 kV/kV in in Peja i.e. "Peja - 3". Based on the requirements with adequate and Planning analysis, and also supported by software simulations with PSS/E software show that the building construction of such as this substation has become a necessity [1].
Security Amplification for Interactive Cryptographic Primitives
Authors: Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Security amplification is an important problem in Cryptography: starting with a "weakly secure" variant of some cryptographic primitive, the goal is to build a "strongly secure" variant of the same primitive. This question has been successfully studied for a variety of important cryptographic primitives, such as one-way functions, collision-resistant hash functions, encryption schemes and weakly verifiable puzzles. However, all these tasks were non-interactive. In this work we study security amplification of interactive cryptographic primitives, such as message authentication codes (MACs), digital signatures (SIGs) and pseudorandom functions (PRFs). In particular, we prove direct product theorems for MACs/SIGs and an XOR lemma for PRFs, therefore obtaining nearly optimal security amplification for these primitives.Our main technical result is a new Chernoff-type theorem for what we call Dynamic Weakly Verifiable Puzzles, which is a generalization of ordinary Weakly Verifiable Puzzles which we introduce in this paper.
The software configuration management database
Authors: Edgar H. Sibley, P. Gerard Scallan, Eric K. Clemons
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Software Configuration Management (SCM) is becoming well known in certain sectors of the community (e.g., in Large Scale Data Processing for the U.S. Government) but remains virtually unknown elsewhere. The need for aids to the large scale information systems development process is very well known and documented. This paper deals with SCM as one of the tools for better systems development. It shows an integration of some previous tools into a system that could be implemented on a database management system (DBMS) as an extension to the data dictionary directory (DDD). An architecture for such an SCM system is suggested.
A non-null annotation inferencer for Java bytecode
Authors: Laurent Hubert
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completeness with respect to a state of the art type system. This paper proposes extensions to our former analysis in order to deal with the Java bytecode language. We have implemented both analyses and compared their behaviour on several benchmarks. The results show a substantial improvement in the precision and, despite being a whole-program analysis, production applications can be analyzed within minutes.
Storing OWL ontologies in SQL3 object-relational databases
Authors: Irina Astrova, Ahto Kalja
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

When a large amount of data is stored in OWL files, it is not efficient to maintain and query those data. The OWL syntax is based on XML, which is a meta-markup language. Thus, it is suitable for data description and data exchange, rather than for data storage and data management. Furthermore, enabling multiple users to work with the same ontology in parallel and make modifications mandates the use of databases (e.g. object-relational) for storing ontologies. Therefore, this paper proposes to extract data from OWL files and store those data in object-relational databases. Object-relational databases are good for data storage and data management. But OWL is semantically richer than SQL3. As a result, some of the semantics captured in ontologies can be lost when ontologies are stored in object-relational databases. In addition, some of the structures of ontologies can be lost. E.g. a class in an ontology can be stored as it were an atomic undifferentiated piece of data in a single CLOB column in an object-relational database. When the ontology is stored in such a way, the query and scalability features of the object-relational database cannot be fully exploited to access the data.
Explicit Fairness Enhancement Mechanism and Its Classifier Implementation in Congestion Control
Authors: Yanjun Dong, Rong Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Active Queue Management (AQM), which can maintain smaller queuing delay and higher throughput by purposefully dropping packets at intermediate nodes, has been intensively studied. Most of the existing AQM schemes focus on the stability, but neglect the fairness. The unfairness caused by the multiple congested gateways and heterogeneous Round Trip Time (RTT) is common in all AQM schemes. In previous works, some researchers developed a framework for AQM scheme based on a considerably simple Two Category Classifier (TCC) [1] instead of the probability discrimination used by most of AQM schemes. In order to improve the fairness, we propose an Explicit Fairness Enhancement (EFE) mechanism by extending TCP header, and then design the TCC-EFE algorithm through adding one more fairness dimension into the two-category classifier to build a three-dimensional classifier. The simulations show that TCC-EFE enhances the fairness.
Estimating Risk of Picking a Sentence for Document Summarization
Authors: Chandan Kumar, Prasad Pingali, Vasudeva Varma
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Automatic Document summarization is proving to be an increasingly important task to overcome the information overload. The primary task of document summarization process is to pick subset of sentences as a representative of whole document set. We treat this as a decision making problem and estimate the risk involve in making this decision. We calculate the risk of information loss associated with each sentence and extract sentences based on ascending order of their risk. The experimental result shows that the proposed approach performs better than various state of the art approaches.
A similarity-guaranteed clustering algorithm and its search tree for handling an increased weight
Authors: Kreadtisak Lappanitchayakul, Nualsawat Hiransakolwong
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

A Clustering Tree, which is a kind of data structures, is not only used for clustering data but also a search tree for searching clusters number. Normally, it is constructed from a Minimum Spanning Tree (MST). In the case a connection line is later adjusted its weight: either increased or decreased weight. It is necessary to invoke the Clustering Tree constructing algorithm again. This situation affects the overall running time which can be greater. There was an algorithm for handling the decreased weight. In this paper, a new algorithm is presented. This new algorithm avoids reconstructing the Clustering Tree at each increased weight. Additionally, its running time is O(n) per weight adjustment where n is the number of nodes in the Clustering Tree.
Piezing: a garment harvesting energy from the natural motion of the human body
Authors: Amanda Parkes, Adam Kumpf, Hiroshi Ishii
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Piezing is a garment which harnesses energy from the natural gestures of the human body in motion. Around the joints of the elbows and hips, the garment is embedded with piezoelectric material elements which generate an electric potential in response to applied mechanical stress. The electric potential is then stored as voltage in a centralized small battery and later can be discharged into a device. As a concept, Piezing explores a decentralized and self-reliant energy model for embedded interaction, pushing forward possibilities for mobility.
Plexus: a scalable peer-to-peer protocol enabling efficient subset search
Authors: Reaz Ahmed, Raouf Boutaba
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Efficient discovery of information, based on partial knowledge, is a challenging problem faced by many large scale dis-tributed systems. This paper presents Plexus, a peer-to-peer search protocol that provides an efficient mechanism for advertising a bit-sequence (pattern), and discovering it using any subset of its 1-bits. A pattern (e.g., Bloom filter) summarizes the properties (e.g., key-words, service description) associated with a shared object (e.g., document, service). Plexus has a partially decentralized architecture involving super-peers. It adopts a novel structured routing mechanism derived from the theory of Error Correcting Codes (ECC). Plexus achieves better resilience to peer failure by utilizing replication and redundant routing paths. Routing efficiency in Plexus scales logarithmically with the number of superpeers. The concept presented in this paper is supported with theoretical analysis, and simulation results ob-tained from the application of Plexus to partial keyword search utilizing the extended Golay code.
Emerging Technologies and Information Systems for the Knowledge Society: First World Summit on the Knowledge Society, WSKS 2008, Athens, Greece, September ... / Lecture Notes in Artificial Intelligence), 1 edition
Authors: Miltiadis D. Lytras, John M. Carroll, Ernesto Damiani, Robert D. Tennyson
Venue:  (2008)

This book, in conjunction with the volume CCIS 19, constitutes the refereed proceedings of theFirst World Summit, WSKS 2008, held in Athens, Greece, in September 2008. The 64 revised full papers presented were carefully reviewed and selected from 286 submissions. The papers are organized in topical sections on social & humanistic computing for the knowledge society; knowledge, learning, education, learning technologies and e-learning for the knowledge society; information technologies for the knowledge society; culture & cultural heritage - technology for culture management - management of tourism and entertainment - tourism networks in the knowledge society; government and democracy for the knowledge society.
Industrial enterprises business processes simulation with BPsim.MAS
Authors: Konstantin A. Aksyonov, Eugene A. Bykov, Elena F. Smoliy, Alexey A. Khrenov
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Necessity to mind a huge amount of factors while developing modern enterprises models dictates new requirements for modeling software, which needs to process all data to achieve precise results, make use of all possible means for that, such as distributed calculations and introduce original approaches where possible to avoid extra time waste for multiple simulation experiments. The article focuses on the software apparatus used in distributed multi-agent resource conversion processes based tool BPsim. MAS, pointing out its advantages and describing used technologies. Second part describes BPsim.MAS deployment in Urals Industrial Group, CJSC, which allowed income and market share growth. Various pricing strategies are discussed and active/passive competitors' behavior is considered.
Pothole Detection and Warning System: Infrastructure Support and System Design
Authors: Sudarshan S. Rode, Shonil Vijay, Prakhar Goyal, Purushottam Kulkarni, Kavi Arya
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

a Many on-going projects in the field of vehicular networks are working in the direction of providing driver with relevant information about roads and traffic movements. In this paper, we propose a novelWi-Fi based architecture for Pothole Detection and Warning System which assists the driver in avoiding potholes on the roads by giving prior warnings. The system consists of access points placed on the roadsides for broadcasting data, which can be received byte Wi-Fi enabled vehicles as they enter the area covered by the influence of the access points. The mobile nodes can also broadcast their response as feedback which when received by access point can beutilized for backend server processing.The pothole detection application proposed in this paper enables the driver to receive information of the potholes on the roads in the vicinity of the moving vehicle. The application can be integrated in the vehicle so as to alarm the driver in the form of a visual signal, audio signal or even trigger the braking system. Simulations demonstrate the advantages of using our approach for constructing pothole detection systems. Many such similar applications can be deployed over the framework provided by the system to assist navigation on roads.
Meeting the Challenge of Building Diamondoid Medical Nanorobots
Authors: Robert A. Freitas,  Jr
Venue: International Journal of Robotics Research (2009)

The technologies that are needed for the atomically precise fabrication of diamondoid nanorobots in macroscale quantities at low cost require the development of a new nanoscale manufacturing technology called positional diamondoid molecular manufacturing, enabling diamondoid nanofactories that can build nanorobots. Achieving this new technology will require the significant further development of four closely related technical capabilities: (1) diamond mechanosynthesis1 (2) programmable positional assembly1 (3) massively parallel positional assembly1 and (4) nanomechanical design. The Nanofactory Collaboration is coordinating a combined experimental and theoretical effort involving direct collaboration among dozens of researchers at multiple institutions in four countries to explore the feasibility of positionally controlled mechanosynthesis of diamondoid structures using simple molecular feedstocks, which is the first step along a direct pathway to developing working nanofactories that can fabricate diamondoid medical nanorobots.
Windows Vista Secrets: SP1 Edition, 2nd edition
Authors: Paul Thurrott
Venue:  (2008)

Follows the highly successful first edition with over 25% more content, including extensive coverage of the latest update, Service Pack 1 Addresses a huge market of consumers eager to learn about hidden gems and secrets in Vista and SP1 Covers features that are not disclosed in Microsoft's books or help files A highly connected and qualified author has gathered information from an extensive network of Windows beta testers and thousands of readers, as well as conducted his own experiments on the new OS New chapters cover personalizing and configuring Vista, networking, Zune, Vista and ultra-mobile PCs, Windows Home Server, and many more new topics
Facilitating multiple target tracking using semantic depth of field (SDOF)
Authors: Nivedita R. Kadaba, Xing-Dong Yang, Pourang P. Irani
Venue: Proceedings of the 27th international conference extended abstracts on Human factors in computing systems (2009)

Users of radar control systems and monitoring applications have to constantly extract essential information from dynamic scenes. In these environments a critical and elemental task consists of tracking multiple targets that are moving simultaneously. However, focusing on multiple moving targets is not trivial as it is very easy to lose continuity, particularly when the objects are situated within a very dense or cluttered background. While focus+context displays have been developed to improve users' ability to attend to important visual information, such techniques have not been applied to the visualization of moving objects. In this paper we evaluate the effectiveness of a focus+context technique, referred to as Semantic Depth of Field (SDOF), to the task of facilitating multiple target tracking. Results of our studies show an inclination for better performance with SDOF techniques, especially in low contrast scenarios.
Neural networks for cost estimation of shell and tube heat exchangers
Authors: Orlando Duran, Nibaldo Rodriguez, Luiz Airton Consalter
Venue: Expert Systems with Applications: An International Journal (2009)

The objective of this paper is to develop and test a model of cost estimating for the shell and tube heat exchangers in the early design phase via the application of artificial neural networks (ANN). An ANN model can help the designers to make decisions at the early phases of the design process. With an ANN model, it is possible to obtain a fairly accurate prediction, even when enough and adequate information is not available in the early stages of the design process. This model proved that neural networks are capable of reducing uncertainties related to the cost estimation of a shell and tube heat exchangers.
Verifying external interrupts of embedded microprocessor in SoC with on-chip bus
Authors: Fu-Ching Yang, Jing-Kun Zhong, Ing-Jer Huang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The microprocessor verification challenge becomes higher in the on-chip bus (OCB) than in the unit-level. Especially for the external interrupts, since they interface with other IP components, they suffer from the complicated bus protocol and IP conflict problems. This paper proposes a automatic method to verify the microprocessor external interrupt behaviors on the OCB. The verification approach is based on the Processor External Interrupt Verification Tool (PEVT) whose simulation environment is direct-connected memory. In this paper, we implement the PEVT-SoC and successfully verify two SoC platforms, one academic microprocessor and one public domain microprocessor. An interesting bug appears that is impossible to be discovered in the memory bus and not easy to be identified on the OCB. The result shows that the PEVT-SoC effectively shortens the verification time regardless of the system complexity and can be easily migrated to different platforms/microprocessors. With little human effort, even an inexperience designer can generate extensive verification cases in a systematic way.
Intentional query suggestion: making user goals more explicit during search
Authors: Markus Strohmaier, Mark Kröll, Christian Körner
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

The degree to which users' make their search intent explicit can be assumed to represent an upper bound on the level of service that search engines can provide. In a departure from traditional query expansion mechanisms, we introduce Intentional Query Suggestion as a novel idea that is attempting to make users' intent more explicit during search. In this paper, we present a prototypical algorithm for Intentional Query Suggestion and we discuss corresponding data from comparative experiments with traditional query suggestion mechanisms. Our preliminary results indicate that intentional query suggestions 1) diversify search result sets (i.e. it reduces result set overlap) and 2) have the potential to yield higher click-through rates than traditional query suggestions.
Fast communication: Adaptive step-size NCLMS algorithm for double-talk echo canceling
Authors: Abolhasan Rezapour Kourandeh, Mohammad Reza Asharif
Venue: Signal Processing (2009)

In systems, such as hands-free mobile telephony, voice over internet protocol (VoIP), voice control, hearing aids, public address and teleconferencing, we are still faced with echo problem. Adaptive digital filters have been vastly used for the echo canceling by estimating the reverberation room impulse response. When a strength near-end talker (NET) signal exists, the adaptation process of the conventional algorithms misleads. In this paper, based on the correlation functions, we introduce a new algorithm named as adaptive step-size normalized correlation-based least mean square (ASNCLMS) algorithm, which is robust even in the presence of NET signal. This algorithm does not freeze the adaptation process during double-talk (DT) mode. Computer simulations, which prove the robustness of this algorithm, are also presented.
An exploration on computational linguistics in teaching practice
Authors: Hu Zhang, Jia-heng Zheng
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

Computational linguistics is an emerging cross-discipline, which relates to computer science, linguistics, mathematics, psychology and so on. In the short development stage it has become a very important discipline for information age, and has had wide application prospect. In this paper we first introduce the computational linguistics development process and the related concepts, and then focus on some methods and summaries of this curriculum in teaching practice, finally propose some thoughts on this curriculum.
Meshless Local Petrov--Galerkin (MLPG) method for the unsteady magnetohydrodynamic (MHD) flow through pipe with arbitrary wall conductivity
Authors: Mehdi Dehghan, Davoud Mirzaei
Venue: Applied Numerical Mathematics (2009)

In this article a meshless local Petrov-Galerkin (MLPG) method is given to obtain the numerical solution of the coupled equations in velocity and magnetic field for unsteady magnetohydrodynamic (MHD) flow through a pipe of rectangular section having arbitrary conducting walls. Computations have been carried out for different Hartmann numbers and wall conductivity at various time levels. The method is based on the local weak form and the moving least squares (MLS) approximation. For the MLS, nodal points spread over the analyzed domain are utilized to approximate the interior and boundary variables. A time stepping method is employed to deal with the time derivative. Finally numerical results are presented showing the behaviour of velocity and induced magnetic field across the section.