ppxscal/embedding_network huggingface dataset:
More Joel on Software: Further Thoughts on Diverse and Occasionally Related Matters That Will Prove of Interest to Software Developers, Designers, and ... Luck, Work with Them in Some Capacity, 1 edition
Authors: Joel Spolsky
Venue:  (2008)

Since the release of the bestselling title Joel on Software in 2004, requests for a sequel have been relentless. So, we went back to the famed JoelonSoftware.com archives and pulled out a new batch of favorites, many of which have been downloaded over one million times. With Joels newest book, More Joel on Software, youll get an even better (not to mention updated) feast of Joels opinions and impressions on software development, software design, running a software business, and so much more. This is a new selection of essays from the authors web site, http://www.joelonsoftware.com. Joel Spolsky started his web log in March 2000 in order to offer his insights, based on years of experience, on how to improve the world of programming. This web log has become infamous among the programming world, and is linked to more than 600 other web sites and translated into 30+ languages! Spolskys extraordinary writing skills, technical knowledge, and caustic wit have made him a programming guru. With the success of Joel on Software, there has been a strong demand for additional gems and advice, and this book is the answer to those requests. Containing a collection of allnew articles from the original, More Joel on Software has even more of an edge than the original, and the tips for running a business or managing people have far broader application than the software industry. We feel it is safe to say that this is the most useful book you will buy this year. What youll learn The best approaches to managing and hiring extraordinary people Advice for those interested in the software industry as a career and for managers who want to get them Joels unique impressions of how to create products and designgood and bad An in the trenches look at how to start and run an effective software business (or any business for that matter) A true sense of what it takes to create a differentiated, unique, motivated organization Who is this book for? Anyone interested in the software business will truly enjoy this book, but in particular this should be required reading for managers of technical businesses. Related Titles Joel on Software The Best Software Writing I: Selected and Introduced by Joel Spolsky Eric Sink on the Business of Software Software Project Secrets: Why Software Projects Fail
GenERTiCA: A Tool for Code Generation and Aspects Weaving
Authors: Marco A. Wehrmeister, Edison P. Freitas, Carlos E. Pereira, Franz Rammig
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Model-Driven Design (MDD) can be perceived in the recent literature as an option to deal with the increasing complexity of the design of Distributed Embedded Real-Time Systems (DERTS). This paper reports some results of a research project aiming to support a MDD approach, which applies concepts of the Aspect-Oriented (AO) paradigm in order to improve the treatment of Non-Functional Requirements (NFR) in the design of DERTS. A tool named GenERTiCA, which generates source code from UML diagrams and also weaves aspect adaptations, has been developed to support such MDD/AO approach. This paper presents results regarding the use of GenERTiCA to generate code and implement aspects (from a high-level framework of aspect) for the RT-Fem to Java platform, a RTSJ-based and optimized java platform for DERTS.
Interaction as a component of meaning-making
Authors: Kunmi Otitoju, Steve Harrison
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Using a multi-media work of art, SenSpace, we investigate the relationship of meaning making and meaning-understanding to interaction. SenSpace is a multimedia installation that uses visual, audio and tactile cues to convey the Greek myth of Narcissus to the user. As opposed to books, audio-books, oral literature and other traditional means of conveying a story, Sen-Space embeds the myth within a physical space, engaging the user in an exercise in meaning-making that can involve multiple senses at the scale of the human body. The SenSpace installation uses projections, water reflections, sound, and distorted visual imagery to present a scripted experience of fixed duration. Following a visit to SenSpace, visitors were surveyed on their expectations and interpretations to help us answer the following research questions: (1) how and to what extent does interaction with the work of art encourage engagement with ideas and interpretation? (2) how and to what extent does content ambiguity encourage engagement and interpretation? (3) does social interaction encourage interpretation?
On minimum and maximum spanning trees of linearly moving points
Authors: N. Katoh
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors investigate the upper bounds on the numbers of transitions of minimum and maximum spanning trees (MinST and MaxST for short) for linearly moving points. Suppose that one is given a set of n points in general d-dimensional space, S=(p/sub 1/,p/sub 2/, . . ., p/sub n/), and that all points move along different straight lines at different but fixed speeds, i.e., the position of p/sub i/ is a linear function of a real parameter. They investigate the numbers of transitions of MinST and MaxST when t increases from - infinity to + infinity . They assume that the dimension d is a fixed constant. Since there are O(n/sup 2/) distances among n points, there are naively O(n/sup 4/) transitions of MinST and MaxST. They improve these trivial upper bounds for L/sub 1/ and L/sub infinity / distance metrics. Let c/sub p/(n, min) (resp. c/sub p/(n, max)) be the number of maximum possible transitions of MinST (resp. MaxST) in L/sub p/ metric for n linearly moving points. They give the following results; c/sub 1/(n, min)=O(n/sup 5/2/a(n)), c/sub infinity /(n, min)=O(n/sup 5/2/a(n)), c/sub 1/(n, max)=O(n/sup n/) and c/sub infinity /(n, max)=O(n/sup 2/) where O(n) is the inverse Ackermann function. They also investigate two restricted cases.
On the bottom summation
Authors: S. A. Abramov, M. Petkovšek
Venue: Programming and Computing Software (2008)

We consider summation of consecutive values (¿(v), ¿(v + 1), ..., ¿(w) of a meromorphic function ¿(z), where v, w ¿ ¿. We assume that ¿(z) satisfies a linear difference equation L(y) = 0 with polynomial coefficients, and that a summing operator for L exists (such an operator can be found--if it exists--by the Accurate Summation algorithm, or, alternatively, by Gosper's algorithm when ordL = 1). The notion of bottom summation which covers the case where ¿(z) has poles in ¿ is introduced.
Geometric integration methods that unconditionally contract volume
Authors: V. Grimm, G. R. W. Quispel
Venue: Applied Numerical Mathematics (2008)

We consider ordinary differential equations (ODEs) that contract volume in phase space. It is very hard to construct geometric integrators which inherit this property of the exact flow for all volume-contracting ODEs, and so far no integrators have been known with this property. In this work we present some integrators of this type.
Momentary content management via general packets radio service (GPRS) and flash on wireless communication devices
Authors: Then H. H. Patrick, Pui H. H. Ondris, Loh C. S. Brian
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In this paper, we describe the trend of mobile community and its components. The success of the community is heavily dependent on content and adaptation despite the communication speed. The market trend has moved from storage oriented to mobility oriented. Spatial information based on a map that tells the location of places of interest such as restaurants has become more important than ever. Hence, this paper focuses on the content management of spatial information via wireless communication devices in the developing area such as Borneo that has substantially lower bandwidth and less stable GPRS network.
A relaxation of Havel's 3-color problem
Authors: Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
Venue: Information Processing Letters (2008)

We proved that every planar graph in which the cycles of length 3, 4, and 5 are at distance at least 4 from each other is 3-choosable.
Controlling non-normative behaviors by anticipation for autonomous agents
Authors: Arnaud Doniec, René Mandiau, Sylvain Piechowiak, Stéphane Espié
Venue: Web Intelligence and Agent Systems (2008)

One of the crucial issues in multi-agent systems is the coordination of agents' actions. A simple way to coordinate the agents is to define norms in the system. Most of the research related to norms and multi-agent systems focuses on designing normative agents to ensure a social order inside the system. To achieve this goal, these studies make the assumption that non-normative behavior must be controlled using sanction mechanisms. This paper discusses the relevance of this assumption in certain specific contexts, and presents an alternative for controlling non-normative behavior, thus ensuring the social order. To illustrate our proposal, we introduce a concrete application involving traffic simulation at a road junction. Based on the statistical traffic results, we show how our approach helps to improve the realism of the simulation.
Parallel mapping algorithms for a novel mapping & configuration software for the FACETS project
Authors: Matthias Ehrlich, Karsten Wendt, René Schüffny
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This paper presents results and work progress on development of parallel mapping algorithms for the FACETS project. We will give an introduction to the FACETS hardware system and its software framework accordingly. A survey of state-of-the-art and emerging parallelization paradigms as well as software performance measurement methods was added to reasonably apply these methods to now a days cluster architectures and rate the implemented softwares performance. The contribution also proposes a novel clustering principle, the Net Layout Organizer which is therefore described in detail.
Modelling crop productivity and variability for policy and impacts of climate change in eastern Canada
Authors: Craig J. Pearson, Delia Bucknell, Gregory P. Laughlin
Venue: Environmental Modelling Software (2008)

A simple scalar crop growth index, GrowEst, was used to calculate plausible weekly crop growth indices for 101 sites over 40 years in eastern Canada. The experimental design allowed the calculation of regional growth and regional variability over time. The research is reported in three sections: development of GrowEst for eastern Canada, policy applications, and scenarios of the impacts of climate change. From the growth index we propose a single statistic, the median integrated seasonal growth index, MIGI to describe the overall fitness-for-growth of a particular site across years, or of a particular year across a geographical area such as eastern Canada. The growth index generally increased from 1960 to 2000 due mostly to increasing temperatures. When mapped, the highest potential growth was adjacent to the Great Lakes and along the St Lawrence River Valley. Variability through time was lowest at locations where the indices were highest. Comparison of these data with historical regional yields indicated that potential yields may not have been captured by current technologies. Two potential policy applications of GrowEst modelling were demonstrated: the determination of crop insurance payments taking account of potential yields and spatial variability; and in urban land-use planning. Future scenarios were calculated from five climate change models for time periods up to 2099. All scenarios caused increases in growth indices. Most predicted that the length of the growing season would increase by 5-7 weeks but that incidences of moisture deficit would also increase. We conclude that climate change is most likely to cause increases in potential productivity which may be largely negated by increasing moisture deficits. Opportunities are identified for innovation to capture current and future potential yield and to reduce yield variability.
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
Authors: A. Siegel
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A mechanism is provided for constructing log-n-wise-independent hash functions that can be evaluated in O(1) time. A probabilistic argument shows that for fixed epsilon
Simple and effective defense against evil twin access points
Authors: Volker Roth, Wolfgang Polak, Eleanor Rieffel, Thea Turner
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Wireless networking is widespread in public places such as cafes. Unsuspecting users may become victims of attacks based on "evil twin" access points. These rogue access points are operated by criminals in an attempt to launch man-in-the-middle attacks. We present a simple protection mechanism against binding to an evil twin. The mechanism leverages short authentication string protocols for the exchange of cryptographic keys. The short string verification is performed by encoding the short strings as a sequence of colors, rendered sequentially by the user's device and by the designated access point of the cafe. The access point must have a light capable of showing two colors and must be mounted prominently in a position where users can have confidence in its authenticity. We conducted a usability study with patrons in several cafes and participants found our mechanism very usable.
Managing ambiguity in mathematical matrices
Authors: David Tausky, George Labahn, Edward Lank, Mirette Marzouk
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

In this paper we describe strategies for recognizing and using hand drawn matrices in a pen math system. This includes a new technique to recognize common short-forms of writing matrices using ellipsis (...). Ellipsis are commonly used in sketched matrices to illustrate the structure of a matrix without fully specifying the matrix. A second contribution of this paper is a new method to estimate the parameters of the hand drawn matrix, such as the number and position of the rows and columns. This is done using a modified clustering algorithm, allowing one to reduce the number of hard-coded constraints.
The Minimum You Need to Know about Logic to Work in It
Authors: Roland Hughes
Venue:  (2007)

Learn the skills which are completely non-existent in today's college courses. Logic simply isn't taught anymore, Pascal is taught in what was the logic class - if they have any class at all devoted to it. The result of such a curriculum is that new college grads are simply unemployable in today's market. This book is designed to correct that problem. What You'll Learn from the Book The fundamentals of flowcharting The fundamentals of pseudocode The Leaping Lynn search algorithm Insertion Sort concept and usage
Supporting the construction of workflows for biodiversity problem-solving accessing secure, distributed resources
Authors: J. S. Pahwa, A. C. Jones, R. J. White, M. Burgess, W. A. Gray, N. J. Fiddian, R. O. Smith, A. R. Hardisty, T. Sutton, P. Brewer, C. Yesson, N. Caithness, A. Culham, F. A. Bisby, M. Scoble, P. Williams, S. Bhagwat
Venue: Scientific Programming (2006)

In the Biodiversity World (BDW) project we have created a flexible and extensible Web Services-based Grid environment for biodiversity researchers to solve problems in biodiversity and analyse biodiversity patterns. In this environment, heterogeneous and globally distributed biodiversity-related resources such as data sets and analytical tools are made available to be accessed and assembled by users into workflows to perform complex scientific experiments. One such experiment is bioclimatic modelling of the geographical distribution of individual species using climate variables in order to explain past and future climate-related changes in species distribution. Data sources and analytical tools required for such analysis of species distribution are widely dispersed, available on heterogeneous platforms, present data in different formats and lack inherent interoperability. The present BDW system brings all these disparate units together so that the user can combine tools with little thought as to their original availability, data formats and interoperability. The new prototype BDW system architecture not only brings together heterogeneous resources but also enables utilisation of computational resources and provides a secure access to BDW resources via a federated security model. We describe features of the new BDW system and its security model which enable user authentication from a workflow application as part of workflow execution.
Embedding operational taxonomic units in three-dimensional spce for evolutionary distance relationship in phylogenetic analysis
Authors: Seung Hee Lee, Kyung Soon Hwang, Hye Ry Lee, Sung Soo Kim, Keon Myung Lee, Chan Hee Lee, Sung Duck Lee
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Phylogenetic analysis is one of important issues in bioinformatics, which estimates evolutionary relationship of operational taxonomic units. The phylogenetic trees used in phylogenetic analysis are weak in expressing information about the evolutionary distances among those units. This paper proposes a method to embed them into a three-dimensional space for evolutionary distance expression and presents the developed tool to visualize them in a three-dimensional space along with a two-dimensional tree view.
Text categorization via generalized discriminant analysis
Authors: Tao Li, Shenghuo Zhu, Mitsunori Ogihara
Venue: Information Processing and Management: an International Journal (2008)

Text categorization is an important research area and has been receiving much attention due to the growth of the on-line information and of Internet. Automated text categorization is generally cast as a multi-class classification problem. Much of previous work focused on binary document classification problems. Support vector machines (SVMs) excel in binary classification, but the elegant theory behind large-margin hyperplane cannot be easily extended to multi-class text classification. In addition, the training time and scaling are also important concerns. On the other hand, other techniques naturally extensible to handle multi-class classification are generally not as accurate as SVM. This paper presents a simple and efficient solution to multi-class text categorization. Classification problems are first formulated as optimization via discriminant analysis. Text categorization is then cast as the problem of finding coordinate transformations that reflects the inherent similarity from the data. While most of the previous approaches decompose a multi-class classification problem into multiple independent binary classification tasks, the proposed approach enables direct multi-class classification. By using generalized singular value decomposition (GSVD), a coordinate transformation that reflects the inherent class structure indicated by the generalized singular values is identified. Extensive experiments demonstrate the efficiency and effectiveness of the proposed approach.
Deriving linearizable fine-grained concurrent objects
Authors: Martin Vechev, Eran Yahav
Venue: ACM SIGPLAN Notices (2008)

Practical and efficient algorithms for concurrent data structures are difficult to construct and modify. Algorithms in the literature are often optimized for a specific setting, making it hard to separate the algorithmic insights from implementation details. The goal of this work is to systematically construct algorithms for a concurrent data structure starting from its sequential implementation. Towards that goal, we follow a construction process that combines manual steps corresponding to high-level insights with automatic exploration of implementation details. To assist us in this process, we built a new tool called Paraglider. The tool quickly explores large spaces of algorithms and uses bounded model checking to check linearizability of algorithms. Starting from a sequential implementation and assisted by the tool, we present the steps that we used to derive various highly-concurrent algorithms. Among these algorithms is a new fine-grained set data structure that provides a wait-free contains operation, and uses only the compare-and-swap (CAS) primitive for synchronization.
A New Approach for Hiding Policy and Checking Policy Consistency
Authors: Deqing Zou, Zhensong Liao
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Automated trust negotiation (ATN) is a new means to establish trust relationship through the mutual exchange of access control policy and credentials in the open and distributed environments. In ATN, access control policy plays a key role in protecting resources from unauthorized access. In practice, a policy may contain sensitive information, and its disclosure may cause damages. In order to protect the sensitive policy or its content, the policy is usually designed complex. Even worse, the policy may be self contradictory, which would lead the negotiation to fail. To solve such a problem, a new approach for checking policy consistency is proposed in the paper. In the approach, we analyze why the policy inconsistency happens and specify how to avoid it by simplifying a compound policy. Meanwhile, the approach is proved useful to hide policy by presenting some useful theorems to generate minimal policy set and credential set.
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
Authors: Richard H. Schelp, Andrew Thomason
Venue: Journal of Graph Theory (2000)

Erd&otilde;s has conjectured that every subgraph of the n-cube Qn having more than (1-2 + o(1))e(Qn) edges will contain a 4-cycle. In this note we consider layer graphs, namely, subgraphs of the cube spanned by the subsets of sizes k - 1, k and k + 1, where we are thinking of the vertices of Qn as being the power set of {1,&hellip;, n}. Observe that every 4-cycle in Qn lies in some layer graph. We investigate the maximum density of 4-cycle free subgraphs of layer graphs, principally the case k = 2. The questions that arise in this case are equivalent to natural questions in the extremal theory of directed and undirected graphs. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 6682, 2000
Optimizing crimping operations in cable assembly shops
Authors: Ahmet N. Ceranoglu, Ekrem Duman
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

Long setup times are incurred in the crimping operation of automotive cable assembly shops. Different heads are used to crimp different connectors to the end of operators where the heads on a machine can be changed one by one. These heads are quite expensive and the manufacturers avoid having more then one of each type. In such a manufacturing environment where multiple crimping machines are used the primary objective is to minimize the total time spent to setups. Also, it is desirable to have a schedule so that simultaneous use of the same head on more than one machine is avoided. In previous research there are some works on the first objective and two successful heuristics are proposed. In this study we cope for the second objective also and propose two comparable heuristic algorithms.