ppxscal/embedding_network huggingface dataset:
On development tools for small systems: the challenge of economically automating a filing cabinet
Authors: David D. Raber
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

One measure of how effective a DP shop is, or how efficient a set of development tools are, is the minimum size project that can effectively be handled. Granted, this is not the only measure of effectiveness, nor is it necessarily the best. On the other hand, a data processing department which can effectively produce small business systems may find a rich potential for service and success within the corporate structure. Realizing this potential depends, to a large degree, on the amount of specialized small system expertise in the areas of development methodology, hardware capability, and development tools.
A novel distributed MCDS approximation algorithm for wireless sensor networks
Authors: Rong Xie, Deyu Qi, Yongjun Li, James Z. Wang
Venue: Wireless Communications Mobile Computing (2009)

Since finding the minimum connected dominating set (MCDS) in an arbitrary graph is a NP-hard problem, many algorithms have been proposed to construct an approximation of the MCDS for efficient routing in wireless sensor networks (WSNs). To address the weaknesses of these existing algorithms, we propose a novel distributed MCDS approximation algorithm, CDS-HG, to construct the connected dominating set (CDS) for WSNs. This algorithm models a WSN as a hierarchical graph and uses a competition-based strategy to select nodes at a certain hierarchical level to route messages for nodes in the next level of the hierarchical graph. Formal analysis and simulation studies show that our CDS-HG algorithm generates smaller CDS sizes while requiring less communication overhead compared with the existing distributed MCDS approximation algorithms. Copyright &copy; 2007 John Wiley & Sons, Ltd.
On the Computational Complexity of Monotone Constraint Satisfaction Problems
Authors: Miki Hermann, Florian Richoux
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

Constraint Satisfaction Problems (csp) constitute a convenient way to capture many combinatorial problems. The general csp is known to be NP-complete, but its complexity depends on a parameter, usually a set of relations, upon which they are constructed. Following the parameter, there exist tractable and intractable instances of csps. In this paper we show a dichotomy theorem for every finite domain of csp including also disjunctions. This dichotomy condition is based on a simple condition, allowing us to classify monotone csps as tractable or NP-complete. We also prove that the meta-problem, verifying the tractability condition for monotone constraint satisfaction problems, is fixed-parameter tractable. Moreover, we present a polynomial-time algorithm to answer this question for monotone csps over ternary domains.
Resarch and design of meter reading system
Authors: Sun De-chao, Zheng Shao-hua
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

With the rapid development of wireless technologies, it is possible for Chinese automatic meter reading system (AMRS) to be equipped with wireless sensor networks due to their low-cost, simplicity and mobility. In the current study, we compared the advantages of ZigBee with other two similar wireless networking protocols, Wi-Fi and Bluetooth, and proposed a wireless solution for AMRS based on ZigBee technology. As an explorative application of ZigBee technology in AMRS, The design reduces the system cost and power consumption and improves the system's flexibility and practicality.
Automatic non-interference lemmas for parameterized model checking
Authors: Jesse Bingham
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems with an arbitrary number of processes. One popular approach to this problem uses abstraction and so-called guard strengthening. Here a small number of processes remain intact, while the rest are abstracted away. This initially causes counter-examples, but the user can write non-interference lemmas, which eliminate spurious behavior by the abstracted processes. The technique is sound in that if the user writes a lemma that is not invariant, the proof will never succeed. Though the non-interference lemmas are typically much simpler than writing a full inductive invariant, there is still a non-trivial amount of human insight needed to analysis counter-examples and concoct the lemmas. In our work, we show how the process of inferring appropriate non-interference lemmas can be automated. Our approach is based on a very general theory that simply assumes a Galois connection between the concrete and abstract systems. Effectively, we start with the non-interference conjecture False, and iteratively weaken it until it is provable using the Galois connection. This produces the strongest non-interference lemma provable in the Galois connection. Hence, if the approach fails to prove the property, then no human lemma would help, since it is the strongest possible lemma. We instantiate this theory to a class of symmetric parameterized systems, and show how BDDs can be used to perform all involved computations. We also show how BDD-blow up that can arise when concretizing can be mitigated by using a sound over-approximation. We successfully applied the resulting tool to three parameterized verification benchmarks: the GERMAN protocol with data path, the GERMAN2004 protocol, and the FLASH protocol. To our knowledge, this is the first time automatic parameterized model checking has been done on GERMAN2004.
Ethnography considered harmful
Authors: Andrew Crabtree, Tom Rodden, Peter Tolmie, Graham Button
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We review the current status of ethnography in systems design. We focus particularly on new approaches to and understandings of ethnography that have emerged as the computer has moved out of the workplace. These seek to implement a different order of ethnographic study to that which has largely been employed in design to date. In doing so they reconfigure the relationship ethnography has to systems design, replacing detailed empirical studies of situated action with studies that provide cultural interpretations of action and critiques of the design process itself. We hold these new approaches to and understandings of ethnography in design up to scrutiny, with the purpose of enabling designers to appreciate the differences between new and existing approaches to ethnography in systems design and the practical implications this might have for design.
Is digital technology urban?: Understanding intermetropolitan digital divides in South Africa
Authors: Nancy Odendaal, James Duminy, Paul Saunders
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Many metropolitan areas, particularly in South Africa, contain urban and peri-urban settlement typologies representative of a diverse range of built forms, lifestyles and livelihoods. Access to Information and Communication Technology (ICT) is influenced by geography, market demand and affordability at household and individual levels. This paper explores how this relationship is manifested spatially in the South African context. The result is not altogether surprising; remote peri-urban areas face bigger obstructions to ubiquitous access due to a number of reasons. Affordability and infrastructure distribution are clearly influential. The assumption is that digital divides exist but little systematic research has been done on how these differences manifest at a metropolitan scale. This paper explores the relationship between the digital divide and spatial trends in Durban, South Africa.
Predictive Runtime Code Scheduling for Heterogeneous Architectures
Authors: Víctor J. Jiménez, Lluís Vilanova, Isaac Gelado, Marisa Gil, Grigori Fursin, Nacho Navarro
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Heterogeneous architectures are currently widespread. With the advent of easy-to-program general purpose GPUs, virtually every recent desktop computer is a heterogeneous system. Combining the CPU and the GPU brings great amounts of processing power. However, such architectures are often used in a restricted way for domain-specific applications like scientific applications and games, and they tend to be used by a single application at a time. We envision future heterogeneous computing systems where all their heterogeneous resources are continuously utilized by different applications with versioned critical parts to be able to better adapt their behavior and improve execution time, power consumption, response time and other constraints at runtime. Under such a model, adaptive scheduling becomes a critical component.In this paper, we propose a novel predictive user-level scheduler based on past performance history for heterogeneous systems. We developed several scheduling policies and present the study of their impact on system performance. We demonstrate that such scheduler allows multiple applications to fully utilize all available processing resources in CPU/GPU-like systems and consistently achieve speedups ranging from 30% to 40% compared to just using the GPU in a single application mode.
Use of prior information in the consistent estimation of regression coefficients in measurement error models
Authors: Shalabh, Gaurav Garg, Neeraj Misra
Venue: Journal of Multivariate Analysis (2009)

A multivariate ultrastructural measurement error model is considered and it is assumed that some prior information is available in the form of exact linear restrictions on regression coefficients. Using the prior information along with the additional knowledge of covariance matrix of measurement errors associated with explanatory vector and reliability matrix, we have proposed three methodologies to construct the consistent estimators which also satisfy the given linear restrictions. Asymptotic distribution of these estimators is derived when measurement errors and random error component are not necessarily normally distributed. Dominance conditions for the superiority of one estimator over the other under the criterion of Lowner ordering are obtained for each case of the additional information. Some conditions are also proposed under which the use of a particular type of information will give a more efficient estimator.
Data mining for knowledge management in technology enhanced learning
Authors: Jelena Mamcenko, Inga Beleviciute
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

A huge amount of data, relevant information must be identified, structured, and directed toward work processes to effectively facilitate or enable the achievement of goals and end products. Knowledge management structures, maintains, and provides access to knowledge within information systems. Data mining extracts relevant tacit knowledge from information system assets through data correlation. The paper describes how data mining techniques can be used for knowledge management in technology enhanced learning.
Multiwavelength semiconductor optical amplifier based fiber ring laser
Authors: Chun Ho Tse, Songnian Fu, Ping Shum
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this report, we designed and implemented an experimental setup of multiwavelength SOA-based fiber ring laser system. Multiwavelength lasing was achieved by using SOA as the gain medium and the sampled-Fiber Bragg Grating (S-FBG) as the filter in the laser cavity. The laser's intensity, power equalization, spectrum linewidth and stability were investigated. Seven lasing peaks with extinction ratios of at least ~30dB were obtained. An extinction ratio of ~50 dB was achieved within four of the lasing wavelengths. In addition, by applying tension to the FBG, we could obtain a wavelength tunable multiwavelength fiber laser. A dual-wavelength laser with only 0.2nm (or ~25GHz) wavelength span was also demonstrated with power equalization within 0.01dBm.
Research Article: SPORCalc: A development of a database analysis that provides putative metabolic enzyme reactions for ligand-based drug design
Authors: James Smith, Viktor Stein
Venue: Computational Biology and Chemistry (2009)

Understanding both the enzyme reactions that contribute to intermediate metabolism and the biochemical fate of candidate therapeutic and toxic agents are essential for drug design. Traditional metabolic databases indicate whether reactions have been observed but do not provide the likelihoods of reactions occurring, for example those of mixed function oxygenases and oxidases, during phase I metabolism. The desire for more quantitative predictions motivated the development of the recently introduced Substrate Product Occurrence Ratio Calculator (SPORCalc) that identifies metabolically labile atom positions in candidate compounds. This paper describes a further development and provides a clearer explanation of SPORCalc for the computational pharmacology, medicinal chemistry and drug design communities interested in metabolic prediction of xenobiotics using chemical databases of biotransformations. Examples of reaction centre detection in Metabolite(TM) are described followed by a demonstration of almokalant, an anti-arrhythmic agent, undergoing phase I metabolism. In general, occurrence ratio (OR) values are calculated throughout a compound and its transformed metabolites to give propensity (p) values at each atom position. The OR values from substrates and products in the database are essential for addition and elimination reactions. For almokalant, the resulting p values ranged from 10^-^1 to 10^-^5 and their order of magnitude reflected the known and experimentally observed metabolites. SPORCalc depends entirely on the level of detail from isoform- or species-specific reaction classes in Metabolite(TM). Labile atom positions (sites of metabolism) are identified in both the candidate compound and its metabolites. In general, the likelihood of one enzyme isoform-dependent reaction occurring relative to another and the putative metabolic routes from different isoforms can be investigated. SPORCalc can be developed further to include suitable three-dimensional, structure-activity and physiochemical information.
Distributed File Streamer: A Framework for Distributed Application Data Coupling
Authors: K. Chen, Z. Huang, B. Li, E. Huang, H. Rajic, R. Kuhn, W. Chen
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

File transfer is very common in a modern distributed computing environment. Protocols such as HTTP and FTP are designed for downloading or uploading files from/to servers. Some other tools such as `secure copy' are used to transfer files among hosts securely. In this paper, the file transfer is considered in the context of connecting distributed applications, what is an output of a data producer on one node would be an input of a data consumer on another node. Intermediate files are used as a medium to connect workflow computational phases, which is a common paradigm used in grid environments. Distributed File Streamer a.k.a. DFS, as its name implies, uses data streaming to couple distributed applications. Instead of waiting for a producer application for output to transfer completely to the consumer node, DFS streams the data over the network directly to a consumer program, managing the data flow efficiently and providing a framework for partial file consumption. This paper describes the architecture of the DFS framework, gives its performance model analysis, and provides results demonstrating DFS advantages over the traditional way on several examples.
Network model and optimization of reverse logistics by hybrid genetic algorithm
Authors: Jeong-Eun Lee, Mitsuo Gen, Kyong-Gu Rhee
Venue: Computers and Industrial Engineering (2009)

The interest about recovery of used products and materials have been increased. Therefore, reverse logistics network problem (rLNP) will be powerful and get a great potential for winning consumers in a more competitive context in the future. We formulate a mathematical model of remanufacturing system as three-stage logistics network model for minimizing the total of costs to reverse logistics shipping cost and fixed opening cost of the disassembly centers and processing centers. And we consider a multi-stage, multi-product and some attach condition for disassembly centers and processing centers, respectively. For solving this problem, we propose a genetic algorithm (GA) with priority-based encoding method consisting of 1st and 2nd stages combined a new crossover operator called as weight mapping crossover (WMX). A heuristic approach is applied in the 3rd stage to transportation of parts from processing center to manufacturer. Numerical experiments with various scales of rLNP models show the effectiveness and efficiency of our approach by comparing the recent researches.
A fast and reliable decoding scheme with prior-hash bits in distributed video coding
Authors: Xu Song, Zhang Bo, Zhang Lin, Liu Yu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Distributed video coding (DVC) has attracted increasing research efforts due to its low-complexity encoding requirements and its applications in wireless video sensor networks for monitoring. This paper proposes a modified Prior-Hash-Based Side-Information Search for decoding Scheme in DVC. LDPC is introduced to produce the syndromes to realize DVC. And a hash-based side-information search scheme is proposed to get the most possible side information before syndrome decoding, named the Prior-Hash bits scheme. The proposed scheme not only reduces the bits of hash in the encoder, but also greatly decreases the computation complexity and delay in the decoder. Simulation results illustrate the performance of PSNR and the complexity advantages of the proposed scheme compared with the original PRISM [1] scheme.
SDM Techniques Based on TGSOM and its Application in R&D Performance Evaluation
Authors: Zhibin Liu, Hanxiang Hu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Research and development activities (R&D) as the core competitiveness in the high-tech enterprises play an extremely important role and far-reaching significance. In order to measure the R&D performance of the high-tech enterprises scientifically and accurately, this paper introduces the tree-structured growing self-organizing maps (TGSOM) network into the spatial data mining (SDM) to be used in spatial clustering. This method not only can make up the limitation of the more data limit and biggish computation in the common spatial data mining, but also overcome the restriction of traditional maps (SOFM) that must appoint in advance. The performance measurement of 110 high-tech enterprises in Hebei Province shows that the results given by this method are reliable.
Seeing in 3D
Authors: Bob Parslow Geoff Wyvill
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Most people, even among technical draftsmen, designers and computer graphics programmers, find it very difficult to visualize 3D shapes well enough to reason about them. We demonstrate the problem and take participants through a series of exercises whereby they can begin to acquire this important practical skill. "Stand a cube on its corner. What is the shape of a horizontal cross-section taken at half the height of this object?" About four percent of people can reason about 3D space well enough to answer this question easily and with confidence. Most of us enter a state of panic when confronted by 3D problems. Yet it is possible to train yourself to think and visualize in 3D. This course helps attendees start thinking in 3D. Once they have the basic principles, they can develop the skill independently.
Query Reformulation for Content Based Multimedia Retrieval in MARS
Authors: Kriengkrai Porkaew, Sharad Mehrotra, Michael Ortega
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Unlike traditional database management systems, in content-based multimedia retrieval databases, it is difficult for users to express their exact information need directly in a precise query. A typical interface allows users to express their information need by using examples of objects similar to the ones they wish to retrieve. Such a user interface, however, requires mechanisms to learn the query representation from the examples. In this paper, we describe the query refinement framework implemented in the Multimedia Analysis and Retrieval System (MARS) for learning query representations using relevance feedback. The proposed framework uses a query expansion approach towards modifying the query representation in which relevant objects are added to the query. Furthermore, query reweighting techniques are used to adjust similarity functions.
Using ontology to improve precision of terminology extraction from documents
Authors: Wen Zhang, Taketoshi Yoshida, Xijin Tang
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we proposed a new approach using ontology to improve precision of terminology extraction from documents. Firstly, a linguistic method was used to extract the terminological patterns from documents. Then, similarity measures within the framework of ontology were employed to rank the semantic dependency of the noun words in a pattern. Finally, the patterns at a predefined proportion according to their semantic dependencies were retained and regarded as terminologies. Experiments on Retuers-21578 corpus has shown that WordNet ontology, that we adopted for the task of extracting terminologies from English documents, can improve the precision of classical linguistic method on terminology extraction significantly.
MCDST Exam Review
Authors: Neil Tucker
Venue:  (2007)

The Microsoft Certified Desktop Support Technician (MCDST) certification is used by technicians to prove their Windows XP troubleshooting skills. It is used by many new technicians to break into the field and by some to improve their marketability as a Help Desk technician. The two exams used to get this certification (70-271 & 70-272) cover a wide set of objectives that can be difficult for even seasoned technicians to cover on their own. How do they ensure that they are ready for the tests? This book is designed to help testing candidates focus on their weak areas by presenting questions on each area covered by the tests. With this knowledge, candidates can use their time more efficiently in preparing for each exam.
Probability density function of M-ary FSK signal in the presence of Gaussian noise, intersymbol interference and rice fading
Authors: Dragana Krstic, Petar Nikolic, Goran Stamenovic, Mihajlo Stefanovic
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

In this paper the receiver for demodulation of M-FSK signals in the presence of Gaussian noise, intersymbol interference and Rice fading will be considered. Probability density function (PDF) of M-ary FSK signals in the presence of noise, interference and fading will be derived.