ppxscal/embedding_network huggingface dataset:
Mobile games to foster the learning of history at archaeological sites
Authors: C. Ardito, P. Buono, M. F. Costabile, R. Lanzilotti, T. Pederson
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

This paper presents a system designed to support young students learning history at an archaeological site, by exploiting mobile technology. The approach uses game-play, since it stimulates in young students an understanding of history that would otherwise be difficult to engender, helping players to acquire historical notions and making archaeological visits more effective and exciting. A strength of the system is that, by running on the visitors own cellular phones, it requires minimal investments and small changes to the existing site exhibition.
Cooperation of the partial differential equation methods and the wavelet transform for the segmentation of multivalued images
Authors: Aldo Maalouf, Philippe Carré, Bertrand Augereau, Christine Fernandez-Maloigne
Venue: Image Communication (2008)

In this work, the wavelet transform (WT) and two partial differential equations (PDEs)-based segmentation methods are merged together towards an efficient segmentation paradigm that integrates level-set functions and wavelet-based singularity detection to object extraction from multivalued images. To this end, different interfaces of the image regions are characterized using a wavelet-based multiscale multistructure tensor that is capable of identifying edges in spite of the presence of noise. With this wavelet-based multistructure tensor, the edge structures of a vector-valued image can be studied at different scales. This multiresolution edge-detection approach allows to reconstruct the accumulated orientational information of the multispectral image. Detected edges are then modeled by level-set functions. A functional is defined on these level sets whose minimizers define the optimal classification of objects. In a second step, the cooperation of PDE and WT is used for pioneering active contour segmentation method. For that purpose, foveal wavelets [S. Mallat, Foveal orthonormal wavelets for singularities, Technical Report, Ecole Polytechnique, 2000], known by their high capability to precisely characterize the holder regularity of singularities, are used to detect the image contours. These wavelets are capable of accurately characterizing edges of noisy images. The obtained foveal coefficients are used to guide the curve flow in an active contour segmentation process. Therefore a foveal-wavelet-based snake approach is formulated. The proposed approach is capable of driving the snake curve to the real edges of different regions in a noisy image. Promising experimental results illustrate the potential of the cooperation of the PDE and the WT in the segmentation of multivalued images.
The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement
Authors: S. Y. H. Su
Venue: IEEE Transactions on Computers (1972)

The relationship between multivalued switching algebra and Boolean algebra is presented by introducing different definitions for the complements of multivalued variables. For every definition introduced, the paper points out which Boolean algebra theorems are valid for multivalued cases, which are invalid, and gives proofs to substantiate the claim. It is shown that DeMorgan's theorem holds for all four definitions of complement given in this paper. One definition allows us to map the multivalued variables into binary variables. Under this definition, all axioms and theorems of Boolean algebra are satisfied and can be used for minimization of any multivalued switching function f. Illustrative examples for minimizing f and its complement f are given.
Outlier Treatment for SLFNs in Classification
Authors: Hieu Trung Huynh, Nguyen H. V., Minh-Tuan T. Hoang, Yonggwan Won
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In past decades, the single-hidden layer feedforward neural networks (SLFNs) have been frequently used to solve the classification problem. It can form decision regions with arbitrary shapes if activation functions of hidden nodes are chosen properly. However, in data collection and analysis there often exist outliers which affect the performance of classification. In order to enhance the classification performance of the SLFNs, it is important to detect and eliminate these outliers. In this paper, we propose an approach for outlier reduction based on distribution of every feature, in which scores are assigned to patterns. Patterns detected as outliers based on these scores will be eliminated from data set. One interesting observation is that, our approach can obtain high accuracy with fast learning speed if the training set exist patterns deviating from mainstream of the remaining of the data set.
Multifocus Image Fusion Algorithm Based on Contourlet Decomposition and Region Statistics
Authors: Liu Yang, Baolong Guo, Wei Ni
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

A novel multifocus image fusion algorithm based on contourlet transform and region statistics was proposed. For good properties of multiscale, localization, directionality and anisotropy, the multifocus source images are first decomposed using contourlet transform. Fusion operations based on region statistics are implemented for all subbands in each scale and direction. Regional variance and local energy are utilized as the fusion rule in low frequency and high frequency subbands, respectively. Experimental results show that the proposed method can extract image features more effectively and obtain better fusion performance. Compared with traditional gradient pyramid algorithm and wavelet based fusion algorithm, the mean square error of the proposed algorithm is increased by 34.8%and 42.6%.
Approximability of the k-server disconnection problem
Authors: Sung-Pil Hong, Byung-Cheon Choi
Venue: Networks (2007)

Consider a network of k servers and their users. Each server provides a unique service that has a certain utility for each user. Now comes an attacker who wishes to destroy a set of network edges to maximize his net gain, namely the total disconnected utilities of the users minus the total edge-destruction cost. This k-server disconnection problem is NP-hard and, furthermore, cannot be approximated within a polynomially computable factor of the optimum when k is part of the input. Even for any fixed k &ge; 2, there is a constant &epsilon; > 0 such that approximation of the problem within a factor 1/(1 + &epsilon;) of the optimum is NP-hard. However, a ( &frac12; + 1/2k+1-2)-approximation can be created in the time of O(2k) applications of a min-cut algorithm. The main idea is to approximate the optimum with special solutions computable in polynomial time due to supermodularity. Therefore, when the the network has, as is usual in most cases, only a few servers, a 0.5-approximation can be carried out in polynomial time. &copy; 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(4), 273282 2007
Session I Structured Programming: Concepts and Definitions
Authors: J. Naughton
Venue: Computer (1975)

Session I addressed the concepts and definitions of structured programming (SP). 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
Information System Continuous Attribute Discretization Based on Binary Particle Swarm Optimization
Authors: Huizhong Yang, Junxia Wang, Xinguang Shao, Nam Sun Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Information system discretization widens the use of rough set theory. Rough set attribute discretization should maintain the consistency of knowledge base classification with less cut-points. This paper introduces within the context of rough set a novel method of attribute discretization by applying binary particle swarm optimization (PSO). A minimal set of cut-points are determined with PSO, which is especially adept at global search, while the consistency of knowledge base classification is assured from the high quality of clustering results from rough set theory. The effectiveness of this discretization method is verified in a simulated example of evaluating the vibroacoustic diagnosis symptoms.
Classification of Human Poses using a Vision based Technique
Authors: Dan Kelly, Paolo Olivo, Charles Markham, John McDonald, Brian Caulfield, Diarmuid Fitzgerald
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This paper presents work being carried out to estimate human pose using vision based methods. The data acquisition system uses an active marker technique synchronized with a three camera stereo vision system. The locations of the markers are then used to reconstruct a skeleton representation of the human pose. PCA and clustering techniques are used to classify the pose.
Rich Media Service Creation for Interactive Mobile TV
Authors: Emmanuel Marilly, Gerald Delegue, Olivier Martinot
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

In tha context of interfrctrvet izobrle TV~ervtcesn,i zd inore precuely the creatron and deplojrrzent oj mteractlve mohmle 7'r7 senrrces, thrs paper presents the dzj'Jerent rssues exrstrng rn the cholce oj the rrch rned~c~ forntat perinittrng to render rnternct~vrty A solutron allowmng an ens) creatlon of interactive services fir irzohrle 7'V wzll be proposed Ihu solutron w ~ l lta ke rnto account the low rntegratron cost requrred b) the servrce creator to create and deploy szlch servrces on d~ferents ervrce p1atform.s or technolog~ess upported by nehorks and terrnlnnls
Surface Shading in the Cuberille Environment
Authors: Lih-shyang Che, Gabor T.Herman, R. Reynolds, Jayaram Udupa
Venue: IEEE Computer Graphics and Applications (1985)

Computed tomography and the cuberiile model¿an effort to better serve the medical profession and its patients.
The existence and multiplicity of solutions of three-point p-Laplacian boundary value problems with one-sided Nagumo condition
Authors: Jianjun Zhang, Wenbin Liu, Jinbo Ni, Taiyong Chen
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper, the existence and multiplicity of solutions of three-point p-Laplacian boundary value problems at resonance with one-sided Nagumo condition are studied by using degree theory and upper and lower solutions method. Some known results are improved.
Broadening the Audience for Computational Thinking: Graduate Student Consortium
Authors: John F. Pane, Mary Beth Rosson
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

The fifth annual graduate consortium at VL/HCC addresses the question: How can researchers and designers of end-user development environments better address the needs of an increasingly diverse population?
Exploring a Boeing 777: Ray Tracing Large-Scale CAD Data
Authors: Andreas Dietrich, Abe Stephens, Ingo Wald
Venue: IEEE Computer Graphics and Applications (2007)

Unlike rasterization, which draws and shades triangles individually, ray tracing simulates propagation of light between surfaces in a scene and enables advanced effects such as transparency, shadows, and ambient occlusion--effects not easily accomplished in other massive-model rendering approaches. This article describes the application of ray tracing to several aircraft manufacturing scenarios.
Robust Page Segmentation Based on Smearing and Error Correction Unifying Top-down and Bottom-up Approaches
Authors: Huaigu Cao, Rohit Prasad, Prem Natarajan, Ehry MacRostie
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we present a robust multi-pass page segmentation algorithm. The first pass uses a modified smearing algorithm and the second pass performs a hybrid of bottom-up and top-down segmentation on the output of the first pass. Unlike traditional approaches, the bottom-up and top-down steps are based on primitive results of a smearing based page segmentation algorithm. Therefore, "split" and "merge" processes start with text blocks that are mostly true text blocks but a few of them are either touching or broken. We present experimental results on newspaper and journal documents from different languages to demonstrate the robustness and language independence of our approach.
Know-How Retention and Divulgation with a Fuzzy CBR System
Authors: Viriato M. Marques, J. Torres Farinha, Antonio Brito, Nelson L. Pincho
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper describes how Fuzzy Logic helped the representation and handling of equipment fault de- scriptions and diagnosis in a Case-Based Reasoning (CBR) system, in a way close to common spoken lan- guage, frequently vague, used by maintenance teams in daily maintenance tasks. These descriptions may be of two types as sometimes they contain a judgment based on the technician own know-how and sometimes they don't. For case similarity computation the "meaning" of these observations must be understood and all must be reduced to the same format before any further cal- culus may take place. In this context another important issue is relevance: the weight of each observation for each possible diagnosis is automatically captured by the CBR system according to the experiences it stores along its life-cycle. A prototype has been tested in the health-equipment maintenance field. The system acts as a know-how repository and a divulgation support, part of an intelligent e-learning platform for staff training.
SLA-driven business process management in SOA
Authors: Vinod Muthusamy, Hans-Arno Jacobsen, Phil Coulthard, Allen Chan, Julie Waterhouse, Elena Litani
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

In a Service-Oriented Architecture (SOA), distributed applications are built by orchestrating reusable services using high-level workflows or business processes. The complexity of developing and maintaining these processes is addressed by SOA development cycles that identify the roles of participants at each stage. To assist development, sophisticated tools have been developed, such as the IBM&reg; WebSphere&reg; suite of SOA products. However, the development, administration and maintenance of a business process still requires much manual effort that can be automated. In particular, the non-functional goals of a business process, often expressed as Service Level Agreements (SLA) need to be manually considered at each stage of the development process.
Checking threat modeling data flow diagrams for implementation conformance and security
Authors: Marwan Abi-Antoun, Daniel Wang, Peter Torr
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Threat modeling is a lightweight approach to reason about application security and uses Data Flow Diagrams (DFDs) with security annotations. We extended Reflexion Models to check the conformance of an as-designed DFD with an approximation of the as-built DFD obtained from the implementation. We also designed a set of properties and an analysis to help novice designers think about security threats such as spoofing, tampering and information disclosure.
Tips for Software Authors
Authors: Hakan Erdogmus
Venue: IEEE Software (2007)

If you're thinking of writing for IEEE Software, you'll increase the odds of a favorable outcome by following a few simple tips. The current issue marks the fifth anniversary of the publication of former editor in chief Steve McConnell's essay "How to Write a Good Technical Article" (September/October 2002), and Steve's advice is as valid today as it was then. So, this is an opportune time to review his advice and point out what makes or breaks a candidate article.
A Web Database Security Model Using the Host Identity Protocol
Authors: Xueyong Zhu, J. William Atwood
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Web database security is a very important issue in E-commerce. This paper presents a new Web database security model. It utilizes the Host Identity Protocol (HIP), which is being defined by the IETF, and a proposed User Identity exchange, to achieve authentication of Host Identity and User Identity, and combines it with the database system itself and encryption to guarantee Web database security and confidentiality of the data. For these purposes, we define a new concept of the User Identity namespace for the user, and using it to realize the binding-authentication of the Host Identity and User Identity of the client, and build a relationship between the host and the user. In the new Model, we set up a high strength shell of security for the database.
Multimodal Function Optimization Based on Multigrouped Mutation Particle Swarm Optimization
Authors: Zhixiang Hou, Yucai Zhou, Heqing Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An improved hybrid particle swarm algorithm, named the multigrouped mutation particle swarm optimization(MMPSO), is provided in this paper. It keeps the basic concepts of the PSO, at the same time embeds the mutation operator of genetic algorithm, thus, it shows a more straightforward convergence ratio and the global searching ability compared to conventional PSO. Moreover, the MMPSO has a unique advantage in that on can search many superior peaks of a multimodal function when the number of the groups is N. Two multimodal functions were tested by the MMPSO algorithm, and results show the MMPSO can obtain the best optima and the rest optimum of those multimodal function.
Design Considerations for a Bipolar 256-Bit Random Access Memory
Authors: J. Gray
Venue: Computer (1971)

The increasing use of computers and peripherals with higher speed capabilities generated a demand for a low cost, low power, high-speed memory which is directly compatible with TTL levels and drive requirements. Such a memory could be built into small local storage applications or into the main storage of a computer. The requirements of such a memory are summarized below: 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
Software Function, Source Lines of Code, and Development Effort Prediction: A Software Science Validation
Authors: A. J. Albrecht
Venue: IEEE Transactions on Software Engineering (1983)

One of the most important problems faced by software developers and users is the prediction of the size of a programming system and its development effort. As an alternative to "size," one might deal with a measure of the "function" that the software is to perform. Albrecht [1] has developed a methodology to estimate the amount of the "function" the software is to perform, in terms of the data it is to use (absorb) and to generate (produce). The "function" is quantified as "function points," essentially, a weighted sum of the numbers of "inputs," "outputs,"master files," and "inquiries" provided to, or generated by, the software. This paper demonstrates the equivalence between Albrecht's external input/output data flow representative of a program (the "function points" metric) and Halstead's [2] "software science" or "software linguistics" model of a program as well as the "soft content" variation of Halstead's model suggested by Gaffney [7].
A conceptual model for temporal data warehouses and its transformation to the ER and the object-relational models
Authors: E. Malinowski, E. Zimányi
Venue: Data Knowledge Engineering (2008)

The MultiDim model is a conceptual multidimensional model for data warehouse and OLAP applications. These applications require the presence of a time dimension to track changes in measure values. However, the time dimension cannot be used to represent changes in other dimensions. In this paper we introduce a temporal extension of the MultiDim model. This extension is based on research realized in temporal databases. We allow different temporality types: valid time, transaction time, and lifespan, which are obtained from source systems, and loading time, which is generated in the data warehouse. Our model provides temporal support for levels, attributes, hierarchies, and measures. For hierarchies we discuss different cases depending on whether the changes in levels or in the relationships between them must be kept. For measures, we give different scenarios that show the usefulness of the different temporality types. Further, since measures can be aggregated before being inserted into data warehouses, we discuss the issues related to different time granularities between source systems and data warehouses. We finish the paper presenting a transformation of the MultiDim model into the entity-relationship and the object-relational models.
Optimization Design of Substation Grounding Grid Based on Genetic Algorithm
Authors: Zhiqiang He, Xishan Wen, Jianwu Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

With the incessant increase of power system capacity and voltage grade, the safety of grounding grid becomes more and more prominent. How better uniform the surface potential distribution of grounding grid; how to ensure the safety of equipment and personal has become one of the most important topics of grounding researchers who has been working hard to resolve the problem. Based on the electromagnetic field(EMF) and circuit combining theoretical, the paper studies the numerical calculation of grounding grid parameters, and make use of genetic algorithm studies optimization design of the grounding grid, under the condition of that the most touch potential of grounding grid is less than IEEE guide provision value to optimize grounding grid design. Due to genetic algorithm aim to operate coding set of the problem variables, thus maintain a good integrity of variable. Calculation shows that the calculation method is feasible and obtain optimal results which is not subject to hierarchical structure of soil.
Estimation of delay test quality and its application to test generation
Authors: Seiji Kajihara, Shohei Morishima, Masahiro Yamamoto, Xiaoqing Wen, Masayasu Fukunaga, Kazumi Hatayama, Takashi Aikyo
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

As a method to evaluate delay test quality of test patterns, SDQM (Statistical Delay Quality Model) has been proposed for transition faults. In order to derive better test quality by SDQM, the following two things are important: for each transition fault, (1) to find out the accurate length of the longest sensitizable paths along which the fault is activated and propagated, and (2) to generate a test pattern that detects the fault through as long paths as possible. In this paper, we propose a method to calculate the length of the potentially sensitizable longest path for detection of a transition fault. In addition, we develop a procedure to extract path information that helps high quality transition ATPG. Experimental results show that the proposed method not only derives more accurate SDQL (Statistical Delay Quality Level) but also enhances the test quality of generated test patterns.
How the noise floor affects the production yield
Authors: Akinori Maeda
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The noise floor is the noise distributed all of the frequency range and it does not include the spurious. At the test system, GNDs, power supplies and test modules have their own noise floor and the total sum of these noise floors affects the device test. The GND noise floor is hard to deal with because it is common mode noise and it is not easy to remove.