ppxscal/embedding_network huggingface dataset:
AutoCAD with AutoLISP: Learn in 7 days
Authors: Basudeb Bhatta
Venue:  (2009)

This book is designed as a teaching tool and a self-study guide to learn AutoCAD and AutoLISP in just seven days. Contents are presented in a pedagogical format by delivering the fundamental concepts first, then moving toward the more advanced and specialized features of AutoCAD. This book will be a unique choice for the engineers, planners, architects, and others who need to learn AutoCAD and AutoLISP in a few days. 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 Comprehensive Evaluation of Routing Protocols for Ordinary and Large-Scale Wireless MANETs
Authors: Hossein Ashtiani, Mohsen Nikpour, Hamed Moradipour
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

An ad hoc network (MANET) has no fixed networking infrastructure, and consists of mobile nodes that communicate with each other. Since nodes are mobile, Routing in ad hoc network is a challenging task. Efficient routing protocols can make better performance in such networks. In this study, the performance of several protocols such as Ad hoc on-demand Distance Vector (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR), and Geographic routing protocol (GRP) in various network conditions and with different packet size patterns is evaluated. Also, different MAC layers like 802.11b, 802.11g in ordinary and large-scale networks are considered. Different metrics like packet delivery ratio, end-to-end delay, Mac delay and Routing traffic received/sent, are applied. All simulations have been done using OPNET. In the following, all the parameters used for the simulation are described in details.
Preliminary Application of Atrazine Degrading Strain J2 in the Soil Bioremediation
Authors: Ying Zhang, Yao Ma, Rongjuan Wang, Zhao Jiang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

This research studied the bioremediation of atrazine polluted soil by atrazine degrading strain J2 which is isolated from the long polluted black glebe in the libratory condition. Inoculated the J2 which OD600 value is 1 into the sterilized soil and non-sterilized soil as 1% ratio (bacterial liquid volume mL /soil weight g) respectively, the atrazine concentration of the soil is 10mg/Kg. J2 utilized atrazine as the only nitrogen source to grow, it belongs to the rhizobium. The soil sample after culturing 15 days in the 30℃, the atrazine degrading rate of the two soil samples which add the J2 bacterial liquid is 95.6% and 97.4% respectively, and the atrazine degrading rate of the two soil samples which without the J2 bacterial liquid is 16.2% and16.9% respectively. The results shown that J2 bacterial liquid represented a good effecton degradation of atrazine insoil , meanwhile, the indigenous microorganism which in the soil could interact with the J2, it could increase the degrading ability of J2.
TLQAP: a topology and link quality assessment protocol for efficient node allocation on wireless testbeds
Authors: Dimitris Syrivelis, Angelos-Christos Anadiotis, Apostolos Apostolaras, Thanasis Korakis, Leandros Tassiulas
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

In this paper we present Topology and Link Quality Assessment Protocol (TLQAP), which we have implemented as a wireless testbed management framework component, that is used to inspect link quality between wireless testbed nodes and appropriately map them to user experiment requirements. TLQAP is mainly an OSI layer 2 design for fixed location, non RF-isolated wireless testbed deployments, which assesses interconnection topology and link quality by estimating packet delivery ratio (PDR) and transmission delay at each node for all requested channel, rate and transmission power combinations. Moreover, TLQAP builds a measurement history log and creates a channel utilization profile, in the context of each testbed node, for all the nearby testbed-external devices that operate independently in the region and are not under the management framework control. The analysis of this information enables TLQAP to choose the channels that have the highest probability of being free during an experiment. TLQAP OSI layer 2 component has been implemented in the click modular router framework and the controller component has been integrated with OMF management framework for wireless testbeds. To outline TLQAP benefits, we have performed experiments on our ORBIT node testbed and we compare it to an existing application level measuring tool.
VStore: efficiently storing virtualized state across mobile devices
Authors: Balasubramanian Seshasayee, Nitya Narasimhan, Ashish Bijlani, Ankur Pai, Karsten Schwan
Venue: Proceedings of the First Workshop on Virtualization in Mobile Computing (2008)

Mobile virtualization is a nascent technology the value of which lies in enforcing data protection, providing process isolation and simplifying application reuse across device platforms. In this paper, we present VStore, a flexible mechanism for storage management and content protection that exploits virtualization to modularize data access and sharing mechanisms into containers separate from those containing guest operating systems and applications. This can provide mobile devices with rich storage options, including local, remote, or peer to peer stores, without affecting guest operating systems, middleware, or applications, and it enables diverse content create-query-share semantics. Further, VStore can provide the means to support centralized content protection and access control to all resident applications, thereby enabling new content distribution or privacy preservation policies to be enforced transparently. We discuss initial VStore implementation results and conclude by outlining new opportunities and challenges for further research.
A new computational intelligence technique based on human group formation
Authors: Arit Thammano, Jittraporn Moolwong
Venue: Expert Systems with Applications: An International Journal (2010)

This paper proposes a novel computational intelligence technique, based on the sociological concept of human group formation, with the aim to acquire a better solution to classification problems. The key concept of the human group formation is about the behavior of in-group members that try to unite with their own group as much as possible, and at the same time maintain social distance from the out-group members. This study compares the performance of the proposed model with that of fuzzy ARTMAP, radial basis function network, and learning vector quantization. Experimental results demonstrate the potential of the proposed approach in offering an efficient and effective solution to the problem.
Holonic Rationale and Bio-inspiration on Design of Complex Emergent and Evolvable Systems
Authors: Paulo Leitao
Venue: Transactions on Large-Scale Data- and Knowledge-Centered Systems I (2009)

Traditional centralized and rigid control structures are becoming inflexible to face the requirements of reconfigurability, responsiveness and robustness, imposed by customer demands in the current global economy. The Holonic Manufacturing Systems (HMS) paradigm, which was pointed out as a suitable solution to face these requirements, translates the concepts inherited from social organizations and biology to the manufacturing world. It offers an alternative way of designing adaptive systems where the traditional centralized control is replaced by decentralization over distributed and autonomous entities organized in hierarchical structures formed by intermediate stable forms. In spite of its enormous potential, methods regarding the self-adaptation and self-organization of complex systems are still missing. This paper discusses how the insights from biology in connection with new fields of computer science can be useful to enhance the holonic design aiming to achieve more self-adaptive and evolvable systems. Special attention is devoted to the discussion of emergent behavior and self-organization concepts, and the way they can be combined with the holonic rationale.
Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence
Authors: Hui Wan, Michael Kifer
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able to combine and correlate evidence obtained from non-independent information sources. BLP has non-monotonic semantics based on the concepts of belief combination functions and is inspired by Dempster-Shafer theory of evidence. Most importantly, unlike the previous efforts to integrate uncertainty and logic programming, BLP can correlate structural information contained in rules and provides more accurate certainty estimates. The results are illustrated via simple, yet realistic examples of rule-based Web service integration.
Using Persuasive Technologies for Energy Consumption Management: A South African Case Study
Authors: Pieter Joubert, Sumarie Roodt
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

In this paper the authors evaluate Chevron's Energyville, as an example of a persuasive technology, which is used to change attitudes and behaviours. The authors want to explore thissimulation in terms of it's potential to be transplanted as a persuasive technology into the South African context, given the fact that South Africa is experiencing an energy crisis currently and will continue to do so in the foreseeable future.
Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Venue: Human Language Technology Conference (2009)

We welcome you to NAACL HLT 2009! The NAACL HLT program continues to include high-quality work in the areas of computational linguistics, information retrieval, and speech technology. This year, 260 full papers were submitted, of which 75 papers were accepted (giving a 29% acceptance rate); and 178 short papers were submitted, of which 71 were accepted (giving a 40% acceptance rate).
A Coverage-Driven Constraint Random-Based Functional Verification Method of Pipeline Unit
Authors: Yingpan Wu, Lixin Yu, Wei Zhuang, Jianyong Wang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

This paper presents a coverage-driven constraint random-based functional verification (CCRFV) method of pipeline unit in a microprocessor. The environment of verification, which is created by means of verification methodology manual (VMM) for SystemVerilog, is reusable and can reduce verification time. The model created by combining classification trees, which can ensure to cover complete coverage and to close the gap from the specification of a test plan to SystemVerilog. Using this environment of verification, we can not only know whether there are bugs in the design under test (DUT) or not, but also can easily locate design errors.
General Cost Models for Evaluating Dimensionality Reduction in High-Dimensional Spaces
Authors: Xiang Lian, Lei Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Similarity search usually encounters a serious problem in the high-dimensional space, known as the “curse of dimensionality.” In order to speed up the retrieval efficiency, most previous approaches reduce the dimensionality of the entire data set to a fixed lower value before building indexes (referred to as global dimensionality reduction (GDR)). More recent works focus on locally reducing the dimensionality of data to different values (called the local dimensionality reduction (LDR)). In addition, random projection is proposed as an approximate dimensionality reduction (ADR) technique to answer the approximate similarity search instead of the exact one. However, so far little work has formally evaluated the effectiveness and efficiency of GDR, LDR, and ADR for the range query. Motivated by this, in this paper, we propose general cost models for evaluating the query performance over the reduced data sets by GDR, LDR, and ADR, in light of which we introduce a novel (A)LDR method, Partitioning based on RANdomized Search (PRANS). It can achieve high retrieval efficiency with the guarantee of optimality given by the formal models. Finally, a {\rm B}^{+}-tree index is constructed over the reduced partitions for fast similarity search. Extensive experiments validate the correctness of our cost models on both real and synthetic data sets and demonstrate the efficiency and effectiveness of the proposed PRANS method.
Managing requirement volatility in an ontology-driven clinical LIMS using category theory
Authors: Arash Shaban-Nejad, Olga Ormandjieva, Mohamad Kassab, Volker Haarslev
Venue: International Journal of Telemedicine and Applications (2009)

Requirement volatility is an issue in software engineering in general, and in Web-based clinical applications in particular, which often originates from an incomplete knowledge of the domain of interest. With advances in the health science, many features and functionalities need to be added to, or removed from, existing software applications in the biomedical domain. At the same time, the increasing complexity of biomedical systems makes them more difficult to understand, and consequently it is more difficult to define their requirements, which contributes considerably to their volatility. In this paper, we present a novel agent-based approach for analyzing and managing volatile and dynamic requirements in an ontology-driven laboratory information management system (LIMS) designed for Web-based case reporting in medical mycology. The proposed framework is empowered with ontologies and formalized using category theory to provide a deep and common understanding of the functional and nonfunctional requirement hierarchies and their interrelations, and to trace the effects of a change on the conceptual framework.
Research on Resource Sharing Architecture for Web-Based Education Based on OGSA
Authors: Dan Guo, Cheng Wang, Bo Ren, Xulei Wang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

The paper has presented a resource sharing architecture for Web-Based Education based on Open Grid Services Architecture (OGSA) to integrate educational resources and improve resources utilization. Using technologies of the Grid and Web services, the architecture describes Grid services mechanism and implement scheme framework of Web-Based Education Platform. It used Web Services, AJAX and LMS API to resolve the integration and service problem in the process of application modules construction. Through integrating and managing diverse educational resources, the work in this paper provided highly efficient information service.
Effects of awareness support on moderating multiple parallel E-discussions
Authors: Astrid Wichmann, Adam Giemza, Ulrich Hoppe, Matthias Krauß
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Moderating multiple e-discussions at a time puts high demands on teachers as moderators. Therefore, to be able to provide effective moderation, teachers should be given adequate awareness support. We evaluated our e-moderation system called "Moderator's Interface" comparing moderation with and without awareness support. Following a within subject design, our cases were two teachers who were asked to moderate discussions of their students and to choose and prepare a discussion topic compliant with the curriculum. Results indicate that additional awareness support was deliberately used during moderation when available. An analysis of data from the teachers' answers to 120 questions and tasks indicates that in the awareness condition, both teachers performed better on the tasks as compared to moderating without awareness support. However, it could not be corroborated that teachers gained additional knowledge about the discussion solely from using the awareness support in absence of an external task.
SEO Pricing with Marketability Restriction - A Monte Carlo Method with Stochastic Return and Volatility
Authors: Xu Zhaoyu, An Shi
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In capital market, second equity offering (SEO) is the main method of refinancing for listed companies. Private placement is a representative example of SEO. And in recent years, more and more irrational phenomena have been rising with private placement in Chinese stock market because of lack of efficient pricing method. The research on stock pricing for private placement in China is of great significance.We consider the problem of price estimation in SEO with marketability restriction. In SEO with marketability restriction, especially in private placement, the stock price is determined by price discount and initial price. To estimate the price discount, we employ Longstaff’s framework of opportunity cost and extend Longstaff’s assumption. In our extended assumption, return and volatility of stock price are given by independent stochastic process. To estimate the initial price of stock in private placement, we introduce residual income method into our pricing model. Monte Carlo method is adopted to simulate the price movement in order to numerically estimate price discount in private placement. And result of empirical analysis shows that our model can effectively price the stock in private placement in China.
PDoS-Resilient Push Protocols for Sensor Networks
Authors: Matthias Enzmann, Christoph Krauss, Claudia Eckert
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Push protocols are attractive for WSNs if sensor information is expected to be sent frequently. However, node compromise and changing routes in a WSN pose a security challenge in the design of a push service as the service may be misused for Path-based Denial of Service (PDoS) attacks. In this paper, we propose push protocols resilient against PDoS attacks which also cope with the dynamics of WSNs.
On Methods of Water Rights Original Allocation and Reallocation
Authors: Kong Ke, Xu Zheng-he
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

An entire water rights system includes the original allocation mechanism and the reallocation mechanism. In this paper a method used for original allocation based on two-stage dynamic game model is put forward. Using this method the optimal allocation scheme can be obtained by seeking the Selten Equilibrium and an example is provided to illustrate the idea of the method. For water rights reallocation a “timeouts market” method is put forward and its Pareto improvement is analyzed by Nash Bargaining Theorem. The conclusion is that those two methods, which make up an entire water rights system and overcome the disadvantages of both the administrative plan and the completely free market, are feasible to promote the efficiency of water resources utilization.
Data Acquisition and Processing of Embedded Network Controller
Authors: Jing-rui Ma, Xue-ren Dong, Yi-ping Sun, Qiu-xia Lu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Designed a data acquisition and processing of embedded network controller. Used S3C2410A microprocessor as CPU, chose embedded Linux as software development environment, chose oracle Berkeley DB as embedded database, used C language as program language. In the circuit design process, we put CPU, memory, clock, reset and power supply together as core board. And then, we designed interface circuit surround the core board. This system realized the function of data acquisition, processing, store and retrieve. The data store and retrieve is realized by call Berkeley DB API. We also add the function of network communication, network detecting and data retransmission into the system. This implement can receive data from RS232, RS485, CAN bus and network, transmit data via Ethernet. This implement not only used as data acquisition and processing implement but also used as base of developing the embedded network controller. We developed the test code and add this code into program to test system performance. The test result shows achieve the design requirement.
Distributed Source Coding for Sensor Data Model and Estimation of Cluster Head Errors Using Bayesian and K-Near Neighborhood Classifiers in Deployment of Dense Wireless Sensor Networks
Authors: Vasanth Iyer, S. S. Iyengar, N. Balakrishnan, Vir. Phoha, G. Rama Murthy
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

The lifetime calculation of large dense sensor networks with fixed energy resources and the remaining residual energy have shown that for a constant energy resource in a sensor network the fault rate at the cluster head is network size invariant when using the network layer with no MAC losses.Even after increasing the battery capacities in the nodes the total lifetime does not increase after a max limit of 8 times. As this is a serious limitation lots of research has been done at the MAC layer which allows to adapt to the specific connectivity, traffic and channel polling needs for sensor networks. There have been lots of MAC protocols which allow to control the channel polling of new radios which are available to sensor nodes to communicate. This further reduces the communication overhead by idling and sleep scheduling thus extending the lifetime of the monitoring application. We address the two issues which effects the distributed characteristics and performance of connected MAC nodes. (1) To determine the theoretical minimum rate based on joint coding for a correlated data source at the singlehop, (2a) to estimate cluster head errors using Bayesian rule for routing using persistence clustering when node densities are the same and stored using prior probability at the network layer, (2b) to estimate the upper bound of routing errors when using passive clustering were the node densities at the multi-hop MACS are unknown and not stored at the multi-hop nodes a priori. In this paper we evaluate many MAC based sensor network protocols and study the effects on sensor network lifetime. A renewable energy MAC routing protocol is designed when the probabilities of active nodes are not known a priori. From theoretical derivations we show that for a Bayesian rule with known class densities of omega1, omega 2 with expected error P* is bounded by max error rate of P = 2P* for single-hop. We study the effects of energy losses using cross-layer simulation of large sensor network MACS setup, the error rate which effect finding sufficient node densities to have reliable multi-hop communications due to unknown node densities. The simulation results show that even though the lifetime is comparable the expected Bayesian posterior probability error bound is close or higher than P ≥ 2P.