ppxscal/embedding_network huggingface dataset:
A New Measure of the Cluster Hypothesis
Authors: Mark D. Smucker, James Allan
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

We have found that the nearest neighbor (NN) test is an insufficient measure of the cluster hypothesis. The NN test is a local measure of the cluster hypothesis. Designers of new document-to-document similarity measures may incorrectly report effective clustering of relevant documents if they use the NN test alone. Utilizing a measure from network analysis, we present a new, global measure of the cluster hypothesis: normalized mean reciprocal distance. When used together with a local measure, such as the NN test, this new global measure allows researchers to better measure the cluster hypothesis.
Michael Freeman's Perfect Exposure: The Professional's Guide to Capturing Perfect Digital Photographs
Authors: Michael Freeman
Venue:  (2009)

Clear, direct and guaranteed, the perfect exposure method looks at the way professionals work, and lays out the decisions and sequences with absolute clarity, while incorporating the latest, powerful post-processing techniques. Chosing the exposure for a photograph is infinitely complex and one of photography's most absorbing paradoxes because it affects everything in the image and its effect on the viewer. Understanding how and why exposure works is essential, not only because it helps you to decide what is instinctively "right," but this book will give you confidence in that decision--an invaluable skill for every single photographer. Full of beautiful photographs taken by Michael Freeman, this book will arm you with the tools you need for perfect exposure of your photographs. * Written by world-renowned expert photographer and author Michael Freeman* Ground-breaking exposure system for digital age photography* Uses clear examples from real photo assignments within-depth explanations* Foolproof flow charts enable quick and easy comprehension 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
Maximizing the Accrued Utility of an Isochronal Soft Real-Time System Using Genetic Algorithms
Authors: Ali Asghar Pourhaji Kazem, Habib Seifzadeh, Mehdi Kargahi, Ali Movaghar, Shahriar Lotfi
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Many real-time systems are in fact isochronal, where both early and late responses are harmful to the system or lead to lower quality of service. Real-time task scheduling problems proved that are NP-hard problems. Therefore, it is necessary to apply a heuristic search strategy on these problems. In this paper, a multi-objective genetic algorithm is proposed for static task scheduling in non-overloaded isochronal soft real-time systems. Its objective is to maximize the total utility of jobs. Simulation results indicate that genetic algorithm could be a suitable heuristic search strategy for task scheduling in isochronal soft real-time systems.
Using singular extremals to obtain new equations of motion and unknown constants
Authors: E. R. Smol'Yakov
Venue: Cybernetics and Systems Analysis (2009)

The paper uses the concept of a singular extremal in the classical dimensional analysis, which considerably extends the capabilities of this analysis and allows finding the unknown constants and new motion equations.
Research of Enterprise Competitive Intelligence Collection System Based on Cross-Language Information Retrieval
Authors: Li Xiang-jun, Si Hong-na, Yao Li-wen, Yao xiao-kun
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Now with the competition of the enterprise globalization gradually, so enterprise which want to participating competition, not only know their own circumstance about the enterprise themselves, but also know the circumstance about the rival. This need collection of the enterprise intelligence efficiently. The features of the enterprise Competitive Intelligence and the problem of the traditional competitive intelligence collection are analyzed in this paper, and the CLIR was introduced into the enterprise competitive intelligence collection. An enterprise competitive intelligence collection system model is established in this paper, which is based on CLIR, Search engine and Intelligence resource.
Using the Bibliometric Analysis to Evaluate Global Scientific Production of Data Mining Papers
Authors: Shuang Deng, Yangge Tian, Hao Zhang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

A bibliometric analysis was applied in this work to evaluate global scientific production of data mining papers of the Science Citation Index (SCI), which was compiled by Institute for Scientific Information (ISI), Philadelphia, USA. The published output analysis showed that data mining research steadily increased over the past 20 years and the annual paper production in 2007 was about three times that in 1999. The analytical results eventually lead to several key findings. Several author keywords became the focus in the last few years, and might be a new research direction in the future. There are clear distinctions among author keywords used in publications from the five most productive countries (USA, China, Germany, England and Canada) in data mining research. Bibliometric methods could quantitatively characterize the development of global scientific production in a specific research field.
First-order Generalization of the MPMA Belief Update Operator
Authors: Ewa Madalińska-Bugaj, Witold Łukaszewicz
Venue: Fundamenta Informaticae (2009)

In this paper we generalize the MPMA belief update operator by admitting first-order knowledge bases and restricted first-order update formulae. This allows us to consider scenarios which cannot be properly formalized either in the originalMPMA or in other existing approaches to belief update.
Security of self-certified signatures
Authors: Zuhua Shao
Venue: Information Processing Letters (2009)

A digital signature provides the authenticity of a signed message with respect to a public key, while the authenticity of the public key with respect to a signer lies on a certificate provided by a certificate authority. Whenever a verifier wants to verify a signature, he has first to verify the corresponding certificate. To reduce this burden, Lee and Kim proposed a new digital signature scheme called self-certified signature (SCS). In this scheme, verifiers can validate both the signature on the message and the related certificate information simultaneously. Then they extended the proposed self-certified signature scheme to a multi-certificate signature scheme (MCS), in which multiple certificate information need to be verified. In this paper, we show that their multi-certificate signature scheme does not satisfy certification as Lee and Kim claimed.
Object Tracking Based on Active Contour Model by Neural Fuzzy Network
Authors: Tianding Chen
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The computer image object tracking technologies are often applied to various kinds of research fields. It proposes real-time tracking object recognition by contour-based neural fuzzy network. It employs the active contour models and neural fuzzy network method to trace moving objects of the same kind and to record its paths simultaneously. To extract object’s feature vector, it uses contour-based model. The traditional background subtraction and object segmentation algorithms are modified to reduce operation complexity and achieve real-time performance. Finally, it uses the self-constructing neural fuzzy inference network to train and recognize moving objects. The experiment shows it can recognize four moving objects, including a pedestrian etc., exactly. The experiment result shows the precision of this system is more than 90% under objects tracking, and the frame rate is more than 25 frames per second.
Primary Transmitter Discovery Based on Image Processing in Cognitive Radio
Authors: Liliana Bolea, Jordi Pérez-Romero, Ramón Agustí, Oriol Sallent
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

The subject of secondary spectrum usage has been a hot research topic for some time now. Secondary users should be able to detect available primary frequency bands and use these spectrum opportunities without causing any harmful interference to primary users. The aim of this paper is to propose a new methodology, based on image processing techniques, which combines a number of sensed samples at different random geographical positions collected by secondary sensors, in order to build a map with the positions and coverage areas of the different primary transmitters. The results can be used to discover frequencies that can be used by a secondary market without causing interference to primary receivers and without any type of cooperation between primary and secondary networks.
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Authors: Radu Marinescu, Rina Dechter
Venue: Artificial Intelligence (2009)

This is the first of two papers presenting and evaluating the power of a new framework for combinatorial optimization in graphical models, based on AND/OR search spaces. We introduce a new generation of depth-first Branch-and-Bound algorithms that explore the AND/OR search tree using static and dynamic variable orderings. The virtue of the AND/OR representation of the search space is that its size may be far smaller than that of a traditional OR representation, which can translate into significant time savings for search algorithms. The focus of this paper is on linear space search which explores the AND/OR search tree. In the second paper we explore memory intensive AND/OR search algorithms. In conjunction with the AND/OR search space we investigate the power of the mini-bucket heuristics in both static and dynamic setups. We focus on two most common optimization problems in graphical models: finding the Most Probable Explanation in Bayesian networks and solving Weighted CSPs. In extensive empirical evaluations we demonstrate that the new AND/OR Branch-and-Bound approach improves considerably over the traditional OR search strategy and show how various variable ordering schemes impact the performance of the AND/OR search scheme.
Fast algorithms for computing tree LCS
Authors: Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Venue: Theoretical Computer Science (2009)

The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent to the tree LCS problem. Assuming G is smaller than F, our first algorithm runs in time O(r@?height(F)@?height(G)@?lglg|G|), where r is the number of pairs (v@?F,w@?G) such that v and w have the same label. Our second algorithm runs in time O(Lrlgr@?lglg|G|), where L is the size of the LCS of F and G. For this algorithm we present a novel three-dimensional alignment graph. Our third algorithm is intended for the constrained variant of the problem in which only nodes with zero or one children can be deleted. For this case we obtain an O(rhlglg|G|) time algorithm, where h=height(F)+height(G).
Research of P2P Routing Security Based on Positive Detection Mechanism
Authors: Chuiwei Lu
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Routing is a critical factor to ensure the stabilization and normal communication of P2P network. If routing is interrupted, the communication efficiency will deteriorate and even cause the crash of the whole P2P system. The widespread problem of existing P2P routing mechanisms is their poor anti-attack. The paper proposes a safe routing algorithm based on positive detection mechanism, which can detect abnormal peers in the routing path and exclude them. In addition, the algorithm can decrease length of routing path, reduce communication delay, but without loss anti-attack capability. The simulated experiment demonstrates that the new algorithm has obvious effect on raising anti-attack capability of P2P network, and improves safety and efficiency.
The MAPK Signal Pathway Research and New Drug Discovery
Authors: Po-Yuan Chen, Mien-De Jhuo, Wei-Tse Hsu, Tzu-Ching Shih, Tzu-Hurng Cheng
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

MAPK cell signal transduction pathways determine the survival of the cells. If one can control this pathways, and then they will prohibit the proliferation of the cancer cells. Furthermore, they will heal the cancer smoothly. In order to attain this goal, we use lots of drugs to interact with MEK1 in MAPK, by using computer aided drug design to analyze the ligand activity of proteins in MEK1.
Workshop Organizers' Message
Authors: Shazia Sadiq, Ke Deng, Xiaofang Zhou, Xiaochun Yang, Walid G. Aref, Alex Delis, Qing Liu, Kai Xu
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

Poor data quality is known to compromise the credibility and efficiency of commercial as well as public endeavours. Several developments from industry and academia have contributed significantly towards addressing the problem. These typically include analysts and practitioners who have contributed to the design of strategies and methodologies for data governance; solution architects including software vendors who have contributed towards appropriate system architectures that promote data integration and; and data experts who have contributed to data quality problems such as duplicate detection, identification of outliers, consistency checking and many more through the use of computational techniques. The attainment of true data quality lies at the convergence of the three aspects, namely organizational, architectural and computational.
Predictive Model of Artificial Neural Network for Earthquake Influence Analysis
Authors: Chen Yanhua, Liu Tingquan, Liu Weiwei
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Eearthquake affecting coefficient is a main parameter of earthquake response spectra, which is the foundation of seismic microzonation and design of earthquake resistant structures. Because the distribution of the maximum of earthquake affecting coefficient is controlled by both basement rock and site condition, the relationship between the maximum of earthquake affecting coefficient and influencing factors is complicated. In order to design earthquake response spectra subtly, the predictive model is constructed on the basis of artificial neural network (ANN), which makes the distribution of the maximum of earthquake affecting coefficient become a spatial variable. As an example application in Tangshan City, the distribution of the maximum of earthquake affecting coefficient is calculated precisely. The calculating results are analyzed and some advice is proposed.
A note on "Solving linear programming problems under fuzziness and randomness environment using attainment values"
Authors: Shuo-Yan Chou, Jennifer Shu-Jen Lin, Peterson Julian
Venue: Information Sciences: an International Journal (2009)

This paper is an amendment to Hop's paper [N.V. Hop, Solving linear programming problems under fuzziness and randomness environment using attainment values, Information Sciences 177 (2007) 2971-2984], in solving linear programming problems under fuzziness and randomness environments. Hop introduced a new characterization of relationship, attainment values, to enable the conversion of fuzzy (stochastic) linear programming models into corresponding deterministic linear programming models. The purpose of this paper is to provide a correction and an improvement of Hop's analytical work through rationalization and simplification. More importantly, it is shown that Hop's analysis does not support his demonstration or the solution-finding mechanism; the attainment values approach as he had proposed does not result in superior performance as compared to other existing approaches because it neglects some relevant and inevitable theoretical essentials. Two numerical examples from Hop's paper are also employed to show that his approach, in the conversion of fuzzy (stochastic) linear programming problems to corresponding problems, is questionable and can neither find the maximum nor the minimum in the examples. The models of the examples are subsequently amended in order to derive the correct optimal solutions.
Using an ecological framework to design mobile technologies for pediatric asthma management
Authors: Hee Young Jeong, Rosa I. Arriaga
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Mobile technologies, due to their ubiquitous nature, play an important role in supporting health care. However, it is not easy to design useful integrated mobile services without a systematic understanding of users, and this is especially true for children. Therefore, we propose a new theoretical perspective for generating design concepts in the early stage of the design process. Our ecological model is based on Ecological Systems Theory which approaches development in terms of the child's relationships and environmental context. It leverages the fact that mobile technologies are deeply involved with users' circumstances. We argue that the ecological model can provide a heuristic to help researchers understand users' needs in context and generate concepts logically and creatively. Here we explore pediatric asthma management as a case study for this model. Finally, five promising mobile technology concepts are provided as examples for further development of mobile technologies related to pediatric asthma management.
Real-time Multimedia Quality Assessment Based on Media Delay Index and Support Vector Machine
Authors: Wenbi Rao, Yingshu Li
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The more areas the multimedia used in, the more effective measures about quality of service are required. This paper presents a new method for multimedia quality assessment. This method uses Media Delivery Index algorithm to analyze the situation of current network and get a series of index as media attributes. Using an intelligent algorithm -- Support Vector Machine as a classifier which maps the network parameters with end-users’ feeling. This is a No-Reference method to evaluate the media quality. There is no need to access the original signal in the operation phase, and the obtained results correlate well with human perception. And compared with the Neural Network quality assessment, the new method is more stable and expansive. So this method can be widely used in real-time system to calculate the magnitude of quality of service automatically.
A Two-Phase Segmentation of Cell Nuclei Using Fast Level Set-Like Algorithms
Authors: Martin Maška, Ondřej Daněk, Carlos Ortiz-De-Solórzano, Arrate Muñoz-Barrutia, Michal Kozubek, Ignacio Fernández García
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

An accurate localization of a cell nucleus boundary is inevitable for any further quantitative analysis of various subnuclear structures within the cell nucleus. In this paper, we present a novel approach to the cell nucleus segmentation in fluorescence microscope images exploiting the level set framework. The proposed method works in two phases. In the first phase, the image foreground is separated from the background using a fast level set-like algorithm by Nilsson and Heyden [1]. A binary mask of isolated cell nuclei as well as their clusters is obtained as a result of the first phase. A fast topology-preserving level set-like algorithm by Maška and Matula [2] is applied in the second phase to delineate individual cell nuclei within the clusters. The potential of the new method is demonstrated on images of DAPI-stained nuclei of a lung cancer cell line A549 and promyelocytic leukemia cell line HL60.
Developing an approach for why-question answering
Authors: Suzan Verberne
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop (2006)

In the current project, we aim at developing an approach for automatically answering why-questions. We created a data collection for research, development and evaluation of a method for automatically answering why-questions (why-QA) The resulting collection comprises 395 why-questions. For each question, the source document and one or two user-formulated answers are available in the data set. The resulting data set is of importance for our research and it will contribute to and stimulate other research in the field of why-QA. We developed a question analysis method for why-questions, based on syntactic categorization and answer type determination. The quality of the output of this module is promising for future development of our method for why-QA.
Mining frequent conjunctive queries in star schemas
Authors: Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

We address the issue of mining frequent conjunctive queries in a relational database, a problem known to be intractable even for conjunctive queries over a single table. In this paper, we extend our previous work to projection-selection-join queries for which joins are performed along keys and foreign keys. Although functional and inclusion dependencies are not axiomatizable in general, we provide general results in this setting and show that mining frequent projection-selection-join queries from a database defined over a star schema is tractable. More precisely, as in our previous work, we define an equivalence relation over queries using a pre-ordering with respect to which the support is shown to be anti-monotonic. We propose a level-wise algorithm for computing all frequent queries by exploiting the fact that equivalent queries have the same support.
Optimal Design of 6-DOF Parallel Robot Based on Output Frequency Response Function
Authors: Yifeng Zhang, Yu Yao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A novel structural parameter optimization of a class of 6-DOF parallel robot is proposed in this paper. As a flight simulator, the moving platform of 6-DOF parallel robot is expected to generate better dynamic response ability. So, the parallel robot should be designed to provide such performance. Herewith, the forward position analysis with 1-DOF motion is expanded into Volterra series. Its kinematics can be regarded as a nonlinear static system; accordingly, the generalized output frequency response function is analyzed for such SISO system. Because the dynamic response ability can be completely described by amplitude frequency function, the description of frequency optimal design is formulized to find some manipulator geometries that maximize the high-frequency motion of the moving platform relative to the low-frequency movements of links. Finally, the analytical solution of optimization problem is derived and the desired mechanism with better dynamic response ability is found out.