ppxscal/embedding_network huggingface dataset:
SolidWorks 2008 for Designers
Authors: Sham Tickoo
Venue:  (2008)

SolidWorks 2008 for Designers is a comprehensive textbook that introduces the users to SolidWorks, a feature based 3D parametric solid modeling software. The textbook covers all major environments of SolidWorks with a thorough explanation of all tools, options, and their applications to create real-world products. About 75 mechanical engineering industry examples are used as tutorials and an additional 40 as exercises to ensure that the users can relate their knowledge and understand the design techniques used in the industry to design a product. After reading the textbook, the user will be able to create parts, assemblies, drawing views with bill of materials, and learn the editing techniques that are essential to make a successful design. Also, in this book, the author emphasizes on the solid modeling techniques that improve the productivity and efficiency of the user.Salient Features of the TextbookConsists of 17 pedagogical sequenced chapters covering the Sketching, Modeling, Assembly, Drafting, SheetMetal environments, and Equations and Configurations in SolidWorks. The first page of every chapter summarizes the topics that will be covered in it.Real-world projects and examples focusing on industry experience.Step-by-step examples that guide the user through the learning process. Additional information is provided throughout the book in the form of tips and notes.Self-Evaluation test and review questions are provided at the end of each chapter so that the users can assess their knowledge.Free Teaching and Learning Resources CADCIM Technologies provides the following Free Teaching and Learning Resources with this textbook: Technical support by contacting techsupport@cadcim.com. Drawing files of the models used in illustrations, examples, and exercises.Customizable PowerPoint presentations for every chapter in this textbook. Instructor s guide that provides solutions to the review questions and exercises provided in the textbook.Student projects to enhance the skills. Course outline listing the topics that will be covered in the basic and advanced classes.
Comparison between computer assisted instruction and traditional method instruction as applied to teaching algebra to urban high school students
Authors: William T. Rebore
Venue:  (2008)

This Ex Post Facto study compared standardized test scores of grade nine students in urban high schools of the same school district being taught algebra in the classroom using Computer Assisted Instruction (CAI) to students being taught in the classroom without the use of computers, Traditional Method Instruction (TMI). Comparison of each group's mean score on the NPSS, a norm-referenced test, was used to determine if there was a statistically significant difference in scoring by each group. Additional testing for interaction of gender with the treatment was done. Four algebra classrooms throughout the district having data on the NPSS were found to use CAI during the period of 1995 to 1999. The students used PLATO software. Out of over 8000 students, a total of 64 students were found who received CAI, but only 45 had NPSS test scores. A group of 45 randomly selected students in the TMI group were paired for gender and school. Using an analysis of variance (ANOVA) (p = .05), results indicated that the TMI group in grade nine scored significantly higher (p = .010488). Additionally, the CAI group compared their grade eight and nine scores. Of the 45 who had NPSS scores in grade nine only 24 had NPSS scores in grade eight. An ANOVA indicated there was no significant difference in scores from grade eight to grade nine (.p = .0.922628). Testing for interaction of gender and treatment with this group resulted in no significant change in NPSS scores.
Direct suffix sorting and its applications
Authors: Donald Adjeroh
Venue:  (2008)

The suffix sorting problem is to construct the suffix array for an input sequence. Given a sequence T[0&hellip; n &ndash; 1] of size n = |T|, with symbols from a fixed alphabet &Sigma;, (|&Sigma;| &le; n), the suffix array provides a compact representation of all the suffixes of T in a lexicographic order. Traditionally, the suffix array is often constructed by first building the suffix tree for T, and then performing an inorder traversal of the suffix tree. The direct suffix sorting problem is to construct the suffix array of T directly without using the suffix tree data structure. We propose a direct suffix sorting algorithm which rearranges the biological sequences of interests and facilitates high throughput pattern query, retrieval and storage in O(n) time. The improved algorithm requires only 7n bytes of storage, including the n bytes for the original string, and the 4n bytes for the suffix array. The basis of our improved algorithm is an extension of Shannon-Fano-Elias codes used in information theory. This is the first time information-theoretic methods have been used as the basis for solving the suffix sorting problem. The direct suffix sorting algorithm is then applied to solve the multiple sequence alignment problem. The sequences to be aligned are concatenated and then passed to the suffix sorting algorithm to locate the repetitive regions. Gaps are determined by those repetitive regions and consequently inserted back to the input sequences to attain the optimal alignment with reference to the biological mutation matrix.We also apply the direct suffix sorting algorithm to the problem of compressibility of protein sequences. The basis is the observation of genome-scale long-range correlation in concatenated protein sequences from the same organism. We propose a method to exploit this unusual redundancy in compressing the protein sequences. The result is a significant reduction in the number of bits required for representing the sequences. The observed long-range correlations could have significant implications beyond compression and complexity analysis of protein sequences.
Multi-Agent Artificial Immune Systems (MAAIS) for Intrusion Detection: Abstraction from Danger Theory
Authors: Chung-Ming Ou, C. R. Ou
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Danger theory-inspired Multi-agent artificial immune system (MAAIS) is applied to intrusion detection systems (IDS). Antigens are profiles of system calls while corresponding behaviors are regarded as signals. The intelligence behind such system is based on the danger theory while dentricit cells agents (DC agent) are emulated for innate immune subsystem and artificial T-cell agents (TC agent) are for adaptive immune subsystem. This IDS is based on the dual detections of DC agent for signals and TC agent for antigen, where each agent coordinates with other to calculate danger value (DV). According to DV, immune response for malicious behaviors is activated by either computer host or Security Operating Center (SOC).
Connecting with Students through Inventive Marketing: Five (or Six) Questions for ... Keith Bourne
Authors: Lisa Neal Gualtieri
Venue: eLearn (2009)

Lisa Neal Gualtieri interviewed Keith Bourne about marketing online programs. Given the current economic state, what are the primary advantages and disadvantages of a solely online marketing strategy?
Formal Contracts in the Presence of Relational Enforcement Mechanisms: Evidence from Technology Development Projects
Authors: Michael D. Ryall, Rachelle C. Sampson
Venue: Management Science (2009)

Formal contracting addresses the moral hazard problems inherent in interfirm deals via explicit terms designed to achieve incentive alignment. Alternatively, when firms expect to interact repeatedly, relational mechanisms may achieve similar results without the associated costs. However, as we now know from a growing body of theoretical and empirical work, the resulting intuition---that relational mechanisms will be substituted for formal ones whenever possible---does not generally hold. The extent to which firms substitute relational mechanisms for formal ones in the presence of repeated interaction is an empirical question that forms the basis of this paper. We study a sample of 52 joint technology development contracts in the telecommunications and microelectronics industries and devise a coding scheme to allow empirical comparison of contract terms. Counter to the above intuition (but consistent with recent research), we find that a firm's contracts are more detailed and more likely to include penalties when it engages in frequent deals (whether with the same or different partners). Our results suggest complementarity between formal and relational contracts, and have implications for optimal contracting, particularly in high technology sectors.
Efficient control of epidemics over random networks
Authors: Marc Lelarge
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

Motivated by the modeling of the spread of viruses or epidemics with coordination among agents, we introduce a new model generalizing both the basic contact model and the bootstrap percolation. We analyze this percolated threshold model when the underlying network is a random graph with fixed degree distribution. Our main results unify many results in the random graphs literature. In particular, we provide a necessary and sufficient condition under which a single node can trigger a large cascade. Then we quantify the possible impact of an attacker against a degree based vaccination and an acquaintance vaccination. We define a security metric allowing to compare the different vaccinations. The acquaintance vaccination requires no knowledge of the node degrees or any other global information and is shown to be much more efficient than the uniform vaccination in all cases.
QoS driven scheduling for grid: from application perspective, resource perspective and system perspective
Authors: Chunlin Li, Layuan Li
Venue: International Journal of Computer Applications in Technology (2009)

The paper considers QoS driven resource scheduling from application perspective, resource perspective and system perspective. The objectives of the individual applications, the individual resources, and the system are often in conflict. Application QoS parameters are expressed as a function of the application's goals. Resource-level QoS parameters depend on the control parameters. In order to resolve the conflicts of the objectives of application and resource providers, the system needs to be aware of application QoS parameters and resource-level QoS parameters to find an optimal relation between user satisfaction and resource utilization. Experiments are conducted to test the performance of proposed algorithms.
Learning with structured sparsity
Authors: Junzhou Huang, Tong Zhang, Dimitris Metaxas
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

This paper investigates a new learning formulation called structured sparsity, which is a natural extension of the standard sparsity concept in statistical learning and compressive sensing. By allowing arbitrary structures on the feature set, this concept generalizes the group sparsity idea. A general theory is developed for learning with structured sparsity, based on the notion of coding complexity associated with the structure. Moreover, a structured greedy algorithm is proposed to efficiently solve the structured sparsity problem. Experiments demonstrate the advantage of structured sparsity over standard sparsity.
Measuring channel capacity to distinguish undue influence
Authors: James Newsome, Stephen McCamant, Dawn Song
Venue: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security (2009)

The channel capacity of a program is a quantitative measure of the amount of control that the inputs to a program have over its outputs. Because it corresponds to worst-case assumptions about the probability distribution over those inputs, it is particularly appropriate for security applications where the inputs are under the control of an adversary. We introduce a family of complementary techniques for measuring channel capacity automatically using a decision procedure (SAT or #SAT solver), which give either exact or narrow probabilistic bounds. We then apply these techniques to the problem of analyzing false positives produced by dynamic taint analysis used to detect control-flow hijacking in commodity software. Dynamic taint analysis is based on the principle that an attacker should not be able to control values such as function pointers and return addresses, but it uses a simple binary approximation of control that commonly leads to both false positive and false negative errors. Based on channel capacity, we propose a more refined quantitative measure of influence, which can effectively distinguish between true attacks and false positives. We use a practical implementation of our influence measuring techniques, integrated with a dynamic taint analysis operating on x86 binaries, to classify tainting warnings produced by vulnerable network servers, such as those attacked by the Blaster and SQL Slammer worms. Influence measurement correctly distinguishes real attacks from tainting false positives, a task that would otherwise need to be done manually.
Stream Data Processing: A Quality of Service Perspective Modeling, Scheduling, Load Shedding, and Complex Event Processing, 1st edition
Authors: Sharma Chakravarthy, Qingchun Jiang
Venue:  (2009)

Traditional database management systems, widely used today, are not well-suited for a class of emerging applications, such as computer network management, homeland security, sensor computing, and environmental monitoring. These applicationsneed to continuously process large amounts of data coming in the form of a stream, and meet stringent response time requirements. Support for handling QoS metrics, such as response time, memory usage, and throughput, is central to any system proposed for the above applications. Stream Data Processing: A Quality of Service Perspective (Modeling, Scheduling, Load Shedding, and Complex Event Processing), presents a new paradigm suitable for stream and complex event processing. This book covers a broad range of topics in stream data processing and includes detailed technical discussions of a number of proposed techniques. This volume is intended as a textbook for graduate courses and as a reference book for researchers, advanced-level students in CS, and IT practitioners.
BIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions
Authors: Madalina Croitoru, Cornelius Croitoru, Paul Lewis
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid) representing her bids. The interpretation of the winner determination problem as an aggregation of individual preferences represented as flowbids allows building an aggregate netbid for its representation. Labelling the nodes with appropriate procedural functions considerably improves upon the expressivity of previous bidding languages.
Integrated Intelligent Design for STEP-based Electro-Mechanical Assemblies
Authors: Xuan F. Zha
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

Assemblability analysis and evaluation plays a key role in assembly design, operation analysis and planning. In this paper, we propose an integrated intelligent approach and framework for evaluation of assemblability and assembly sequence for electro-mechanical assemblies (EMAs). The approach integrates the STEP (STandard for the Exchange of Product model data, officially ISO 10303) based assembly model and XML schema with the fuzzy analytic hierarchy process for assembly evaluation. The evaluation structure covers not only the geometric and physical characteristics of the assembly parts but also the assembly operation data necessary to assemble the parts. The realization of the integration system is implemented through a multi-agent framework. Through integration with the STEP-based product modeling agent system, CAD agent system and assembly planning agent system, the developed assembly evaluation agent system can effectively incorporate, exchange, and share concurrent engineering knowledge into the preliminary design process so as to provide users with suggestions for improving a design and also helping obtain better design ideas. The proposed approach has the flexibility to be used in various assembly methods and different environments. The applications show that the proposed approach and system are feasible.
ConcernLines: A timeline view of co-occurring concerns
Authors: Christoph Treude, Margaret-Anne Storey
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Understanding the evolution of a software system requires understanding how information about the release history, non-functional requirements and project milestones relates to functional requirements on the software components. This short paper describes a new tool, called CONCERNLINES, that supports this cognitive process by visualizing co-occurring concerns over time.
Willingness to Pay in an Open Source Software Environment
Authors: T. S. Raghu, Rajiv Sinha, Ajay Vinze, Orneita Burton
Venue: Information Systems Research (2009)

Competition from open source software and free software (OSS/FS) alternatives is causing proprietary software producers to reevaluate product strategies. OSS/FS alternatives complicate an already complex information goods market plagued by piracy concerns. Although producer perspectives on software pricing and piracy controls have been addressed extensively, consumers' perspective and willingness to pay for commercial software is not very well understood. This paper empirically determines willingness to pay for a leading commercial software application (Microsoft Office) in the presence of an OSS/FS alternative. A contingent valuation approach is used to elicit willingness to pay for the application. The research design employs a 2 × 2 × 2 experiment to investigate the impact of preventive control, deterrence control, and OSS/FS alternative. The results indicate that the availability of an OSS/FS alternative has little impact on willingness to pay for Microsoft Office. However, piracy controls significantly increase willingness to pay for Microsoft Office, even in the presence of OSS/FS alternatives.
Interactive stories on the net: a model and an architecture for X3D worlds
Authors: Efrem Carnielli, Fabio Pittarello
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

This work discusses a model and an architecture for interactive stories to be displayed on the net, designed for being independent from the specific story represented and suitable to different literary genres. They are the result of a formal approach, based on the research performed in the domain of narratology. The analysis of narrative theories, and in particular of the approach proposed by Cesare Segre, has led to identification of the story model. Such model, extended towards non-linearity, has been used as the basis for implementing an architecture for managing the evolution of the story and representing the final result as an interactive X3D world for the net. The discussion of a case study, related to the autobiographic novel "The Sergeant in the Snow" by the famous Italian writer Mario Rigoni Stern, completes the work.
Finding optimal model parameters by deterministic and annealed focused grid search
Authors: Álvaro Barbero Jiménez, Jorge López Lázaro, José R. Dorronsoro
Venue: Neurocomputing (2009)

Optimal parameter model finding is usually a crucial task in engineering applications of classification and modelling. The exponential cost of linear search on a parameter grid of a given precision rules it out in all but the simplest problems and random algorithms such as uniform design or the covariance matrix adaptation-evolution strategy (CMA-ES) are usually applied. In this work we shall present two focused grid search (FGS) alternatives in which one repeatedly zooms into more concentrated sets of discrete grid points in the parameter search space. The first one, deterministic FGS (DFGS), is much faster than standard search although still too costly in problems with a large number of parameters. The second one, annealed FGS (AFGS), is a random version of DFGS where a fixed fraction of grid points is randomly selected and examined. As we shall numerically see over several classification problems for multilayer perceptrons and support vector machines, DFGS and AFGS are competitive with respect to CMA-ES, one of the most successful evolutive black-box optimizers. The choice of a concrete technique may thus rest in other facts, and the simplicity and basically parameter-free nature of both DFGS and AFGS may make them worthwile alternatives to the thorough theoretical and experimental background of CMA-ES.
The convergence of subspace trust region methods
Authors: Zhen-Jun Shi, Zhiwei Xu
Venue: Journal of Computational and Applied Mathematics (2009)

The trust region method is an effective approach for solving optimization problems due to its robustness and strong convergence. However, the subproblem in the trust region method is difficult or time-consuming to solve in practical computation, especially in large-scale problems. In this paper we consider a new class of trust region methods, specifically subspace trust region methods. The subproblem in these methods has an adequate initial trust region radius and can be solved in a simple subspace. It is easier to solve than the original subproblem because the dimension of the subproblem in the subspace is reduced substantially. We investigate the global convergence and convergence rate of these methods.
Secure remote access to autonomous safety systems: A good practice approach
Authors: Martin Gilje Jaatun, Maria B. Line, Tor Olav Grotan
Venue: International Journal of Autonomous and Adaptive Communications Systems (2009)

Safety instrumented systems (SIS) as defined in IEC 61508 and IEC 61511 are very important for the safety of offshore oil and natural gas installations. Partly as a consequence of the evolving 'integrated operations' concept, a need is emerging for remote access to such systems from vendors external to the operating company. This access will pass through a number of IP-based networks used for other purposes, including the open internet. This raises a number of security issues, ultimately threatening the safety integrity of SIS. In this article, we present a layered network architecture that represents current good practice for a solution to ensure secure remote access to SIS. Also, a method for assessing whether a given solution for remote access to SIS is acceptable is described.
Constructive Logic and Situation Theory
Authors: Seiki Akama, Yasunori Nagata
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

Infon Logic was introduced by Devlin as a logic for situation theory which constitutes a logical foundation for Barwise and Perry's situation semantics. In this paper, we propose constructive infon logic (CIL) based on Nelson's constructive logic with strong negation. A Kripke semantics is given with a completeness proof.
Data transmission between communication center (Cc) and many primary stations (Ps)
Authors: Abdalla Radwan
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

This paper deals with the appropriate protocol for short-range communication in radio connection between communication center and many primary stations.