ppxscal/embedding_network huggingface dataset:
High-speed detection of unsolicited bulk emails
Authors: Sheng-Ya Lin, Cheng-Chung Tan, Jyh-Charn Liu, Michael Oehler
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

We propose a Progressive Email Classifier (PEC) for high-speed classification of message patterns that are commonly associated with unsolicited bulk email (UNBE). PEC is designed to operate at the network access point, the ingress between the Internet Service Provider (ISP) and the enterprise network; so that a surge of UNBE containing fresh patterns can be detected before they spread into the enterprise network. A real-time scoreboard keeps track of detected feature instances (FI) based on a scoring and aging engine, until they are considered either from valid or UNBE sources. A FI of a valid email is discarded, but an anomalous one is passed to a blacklist to control (e.g., block or defer) subsequent emails containing the FI. The anomaly detector of PEC can be used at different protocol layers. To gain some insights on the performance of PEC, we implemented PEC and integrated it with the sendmail daemon to detect anomalous URL links from email streams. Arbitrarily chosen on-line texts and URL links extracted from a corpus of spamming-phishing emails were used to compose testing emails. Experimental results on a Xeon based server show that PEC can handle 1.2M score/age updates, parse 0.9M URL links (of average size 30 bytes) for hashing and matching, and parsing of 25,000 email bodies of average size 1.5kB per second. The lossy detection system can be easily scaled by progressive selection of detection features and detection thresholds. It can be used alone or as an early screening tool for an existing infrastructure to defeat major UNBE flooding.
IntSim: A CAD tool for optimization of multilevel interconnect networks
Authors: Deepak C. Sekar, Azad Naeemi, Reza Sarvari, Jeffrey A. Davis, James D. Meindl
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Interconnect issues are becoming increasingly important for ULSI systems. IntSim, an interconnect CAD tool, has been developed to obtain pitches of different wiring levels and die size for circuit blocks or logic cores of microchips. It includes a methodology for co-optimization of signal, power and clock interconnects, and a newly derived stochastic wiring distribution that gives reduced error than prior work when compared to measured data. Results of IntSim are found to match well with actual data from an analyzed microprocessor. Several case studies are conducted to show this CAD tool's utility as a system level simulator: (i) Wire resistivity increases due to size effects are projected to increase die size of a 22nm low power logic core by 30% and power by 7%. (ii) When compared to a 22nm low power logic core with copper interconnects, a similar logic core with carbon nanotube interconnects could reduce power by 25% and die area by 27%, or increase frequency by 15% and reduce die area by 11%. (iii) A future 22nm 8 GHz 96M gate logic core's power, die size and optimal multilevel interconnect architecture are predicted. A version of IntSim with a graphical user interface is available for download from www.ece.gatech.edu/research/labs/gsigroup.
iKernel: Isolating Buggy and Malicious Device Drivers Using Hardware Virtualization Support
Authors: Lin Tan, Ellick M. Chan, Reza Farivar, Nevedita Mallick, Jeffrey C. Carlyle, Francis M. David, Roy H. Campbell
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

The users of today's operating systems demand high reliability and security. However, faults introduced outside of the core operating system by buggy and malicious device drivers can significantly impact these dependability attributes. To help improve driver isolation, we propose an approach that utilizes the latest hardware virtualization support to efficiently sandbox each device driver in its own minimal Virtual Machine (VM) so that the kernel is protected from faults in these drivers. We present our implementation of a low-overhead virtual-machine based framework which allows reuse of existing drivers. We have constructed a prototype to demonstrate that it is feasible to utilize existing hardware virtualization techniques to allow device drivers in a VM to communicate with devices directly without frequent hardware traps into the Virtual Machine Monitor (VMM). We have implemented a prototype parallel port driver which interacts through iKernel to communicate with a physical LED device.
Three-dimensional face recognition using combinations of surface feature map subspace components
Authors: Thomas Heseltine, Nick Pears, Jim Austin
Venue: Image and Vision Computing (2008)

In this paper, we show the effect of using a variety of facial surface feature maps within the Fishersurface technique, which uses linear discriminant analysis, and suggest a method of identifying and extracting useful qualities offered by each surface feature map. Combining these multi-feature subspace components into a unified surface subspace, we create a three-dimensional face recognition system producing significantly lower error rates than individual surface feature map systems tested on the same data. We evaluate systems by performing up to 1,079,715 verification operations on a large test set of 3D face models. Results are presented in the form of false acceptance and false rejection rates, generated by varying a decision threshold applied to a distance metric in surface space.
Setting up Model of Forecasting Core Reservoir Parameters by Fusion of Soft Computing Methods
Authors: Haixiang Guo, Kejun Zhu, Deyun Wang, Jinjin Zhou, Yue Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The paper utilizes fusion of soft computing methods to distinguish the key attributes of reservoir oil-bearing formation and establishes model with fusion of soft computing methods to forecast these key attributes. The steps as follows: Firstly, use genetic algorithm (GA) and fuzzy c-means nesting algorithm (GA-FCM) to reduce the log attributes of oil-bearing formation and obtain the key attributes that can describe oil-bearing formation of reservoir. Secondly, fuses genetic algorithm and BP neural networks (GA-BP) to construct the fusion model that forecasts the key attributes ,which searches the log attributes and the best number nodes of hidden layer of BP through GA for determining the optimal structure of BP forecasting model. Judge the forecasting model by the error of testing sample. Finally, take oilsk81, oilsk83 and oilsk85 wells of some oil field in China done research and obtain the available results.
IMERA: Experimentation Platform for Computer Augmented Environment for Mobile Actors
Authors: Bertrand T. David, Reno Chalon
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

We present IMERA platform the aim of which is to experiment wearable computer use in a Computer Augmented Environment. This environment, bristling with communicating objects, active or passive, mobile or grounded, makes it a pervasive and intelligent environment. We are particularly concerned with innovating user interfaces and devices of Mixed Reality which can be used in industrial and educational contexts, where mobility and cooperation are required..
Visualising the south yorkshire floods of '07
Authors: Paul D. Clough, Rob Pasley, Stefan Siersdorfer, Jose San Pedro, Mark Sanderson
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

This paper describes initial work on developing an information system to gather, process and visualise various multimedia data sources related to the South Yorkshire (UK) floods of 2007. The work is part of the Memoir project which aims to investigate how technology can help people create and manage long-term personal memories. We are using maps to aggregate multimedia data and to stimulate remembering past events. The paper describes an initial prototype; challenges faced so far and planned future work.
The Bloomba personal content database
Authors: Raymie Stata, Patrick Hunt, M. G. Thiruvalluvan
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We believe continued growth in the volume of personal content, together with a shift to a multi-device personal computing environment, will inevitably lead to the development of Personal Content Databases (PCDBs). These databases will make it easier for users to find, use, and replicate large, heterogeneous repositories of personal content. In this paper, we describe the PCDB used to power Bloomba, a commercial personal information manager in broad use. We highlight areas where the special requirements of personal content and personal platforms have influenced the design and implementation of our PCDB. We also discuss what we have and have not been able to leverage from the database community and suggest a few lines of research that would be useful to builders of PCDBs.
Distributed collaborating system design via electronic institutional calculus
Authors: Guoyong Cai, Ji Gao, Junyan Qian, Lingzhong Zhao
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Developing distributed collaboration system is still a challenge work in an open and heterogeneous environment. The paper proposes to design distributed collaboration system starting from electronic institutional model. Software architecture is designed directly based on electronic institution. The main architectural element is a scene manager. An electronic institution oriented calculus language is presented to specify the complex interaction patterns appearing in architectural design level. Through the formal defined operational semantic rules, some system norms can be verified in the designed architectural specification. A proof of concept implementation has been working out. The experience shows a lot of advantages in this approach when developing such type of interaction complicated systems in open environments.
Finding Clones with Dup: Analysis of an Experiment
Authors: Brenda S. Baker
Venue: IEEE Transactions on Software Engineering (2007)

An experiment was carried out by a group of scientists to compare different tools and techniques for detecting duplicated or near-duplicated source code. The overall comparative results are presented elsewhere. This paper takes a closer lookat the results for one tool, Dup, which finds code sections that are textually the same or the same except for systematic substitution of parameters such as identifiers and constants. Varous factors that influenced the results are identified and their impact on the results is assessed via rerunning Dup with changed options and modifications. These improve the performance of Dup with regard to the experiment, and could be incorporated into a postprocessor to be used with other tools.
Network Architecture Design for Back-End Storage Networks
Authors: R. W. Watson
Venue: Computer (1980)

To realize the full potential of computer networking, design of a back-end storage network architecture should follow the general-purpose approach of an evolving network operating system.
Stereo-based 3D Face Modeling using Annealing in Local Energy Minimization
Authors: Shafik Huq, Besma Abidi, Mongi Abidi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In the past few years, 3D face modeling has gained significant attention. Reliable modeling of the face is necessary for good performance of a 3D assisted face recognition system. In this paper, we model 3D human face from binocular stereo images. The stereo matching problem has been formulated as an energy minimization problem that progressively propagates depth from reliable regions to unreliable regions by an annealing scheme. The concept of smooth 2D grid is used to enable regularizing the final depth solution. In the energy equation, area based matching is used for the data term. The smoothness term relies on annealing. The 2D grid facilitates the estimation of the smoothness parameter, from a correlation profile obtained from neighborhood of the grid node. It is evident from 3D modeling results that the proposed algorithm performs well on images of human faces.
An Efficient K-means Clustering Algorithm Based on Influence Factors
Authors: Mingwei Leng, Haitao Tang, Xiaoyun Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Clustering has been one of the most widely studied topics in data mining and pattern recognition,k-means clustering has been one of the popular,simple and faster clustering algorithms. but the right value of k is unkwown and selecting effectively initial points is also difficult.In view of this, a lot of work has been done on various versions of k-means,which refines initial points and detects the number of clusters. In this paper,we present a new algorithm, called an efficient k-means clustering based on influence factors,which is divided into two stages and can automatically achieve the actual value of k and select the right initial points based on the datasets characters. Propose influence factor to measure similarity of two clusters,using it to determine whether the two clusers should be merged into one.In order to obtain a faster algorithm,a theorem is proposed and proofed,using it to accelerate the algorithm. Experimental results from Gaussian datasets were generated as in Pelleg and Moore (2000)[11] show the algorithm has high quality and obtains a satisfying result.
Visual Analysis of Network Traffic for Resource Planning, Interactive Monitoring, and Interpretation of Security Threats
Authors: Florian Mansmann, Daniel A. Keim, Stephen C. North, Brian Rexroad, Daniel Sheleheda
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

The Internet has become a wild place: malicious code is spread on personal computers across the world, deploying botnets ready to attack the network infrastructure. The vast number of security incidents and other anomalies overwhelms attempts at manual analysis, especially when monitoring service provider backbone links. We present an approach to interactive visualization with a case study indicating that interactive visualization can be applied to gain more insight into these large data sets. We superimpose a hierarchy on IP address space, and study the suitability of Treemap variants for each hierarchy level. Because viewing the whole IP hierarchy at once is not practical for most tasks, we evaluate layout stability when eliding large parts of the hierarchy, while maintaining the visibility and ordering of the data of interest.
Test Methods and Tools for ERP Implementations
Authors: Paul Gerrard
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Enterprise Resource Planning (ERP) systems represent a huge market in the commercial arena. Products from suppliers such as SAP, Oracle and more recently, Microsoft, dominate the market. Testing in these projects is a significant effort but is hardly supported by methods and tools other than those provided by the suppliers themselves. Experience shows that testing in these projects is critical, but often neglected. Recent "lessons learned' work by the author indicates that a benefits-, risk- and coverage-based test approach could significantly reduce the risk of failures. Some foundation/visionary work to define ERPspecific test methods and tools has already been performed by the author. However, the approach needs more research, rigor and proving in a commercial environment. Academic and commercial partners are sought to refine, develop and prove these methods and tools.
A Two-Way Hybrid Algorithm for Maximal Frequent Itemsets Mining
Authors: Fu-zan Chen, Min-qiang Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A new two-way-hybrid algorithm for mining maximal frequent itemsets is proposed. A flexible two- way-hybrid search method is given. The two-way- hybrid search begins the mining procedure in both the top-down and bottom-up directions at the same time. Moreover, information gathered in the bottom-up can be used to prune the search space in the other top- down direction. Some efficient decomposition and pruning strategies are implied in this method, which can reduce the original search space rapidly in the iterations. Experimental and analytical results are presented in the end.
Invited Talk: A Process Algebra Master Equation
Authors: Luca Cardelli
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

A Master Equation provides a complete probabilis-tic description of the dynamics of stochastic processes. We give a master equation for a small stochastic process algebra (a subset of CCS with interaction rates). We show that it is equivalent to the standard Chemical Master Equation, connecting our process algebra to the stochastic chemistry of unary and bi-nary reactions.
A Novel Clustering Algorithm for Asymmetric Dataset
Authors: Yihong Dong, Li Pan, Xiaoying Tai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Many clustering methods have been proposed in the area of data mining, but only few of them focused on asymmetric dataset. In this paper, a novel clustering algorithm for asymmetric dataset-PFHC, which is based on FHC[5], is presented. Firstly, dataset is divided into several local regions according to the data density of distribution, where the data density in any local regions is symmetrical. In order to achieve the goal, local and are used in each local area. In every region, FHC is used to get local clusters. Finally local clusters need to be merged to get the global clusters. As extent of FHC, PFHC runs effective and efficient as experiment shows. Furthermore, PFHC generates better quality clusters than traditional algorithms, and scales up well for large databases, as FHC does.
A Survey on Aspect-Oriented Testing Approaches
Authors: Reza Meimandi Parizi, Abdul Azim Ghani
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Research on testing approaches for different programming paradigms has been done for several years. However, Aspect-Oriented Programming (AOP), a relatively new programming paradigm, has properties that other programming paradigms do not have. These characteristics bring new challenges and issues not present when testing other types of programs such as Object Oriented Programs (OOPs). So this new paradigm can not provide correctness by itself, and thus it also, like any other programs, requires the use of systematic testing approaches to produce validated and high quality software. This paper surveys the research on testing AOPs, the testing approaches that are being proposed, and issues that arise when testing AOPs. The effectiveness of proposed approaches is compared in terms of their ability to find different kind of faults as described by [6]. By making comparison on AOPs testing approaches, a better understanding of these approaches and issues related in testing AOPs is provided, as well as conclusion about existing state of research in this area and future trends for testing of aspect-oriented is identified.
Bookshelf
Authors: Scott Brookhart, Todd Schultz, Paul Freedman, Art Sedighi
Venue: IEEE Software (2007)

Book reviews of Probability and Random Processes for Electrical and Computer Engineers by John A. Gubner, I Am a Strange Loop by Douglas Hofstadter, Coolhunting: Chasing Down the Next Big Thing by Peter A. Gloor and Scott M. Cooper, and The C++ Standard Library Extensions: A Tutorial and Reference by Pete Becker.
Modeling the Experimental Software Engineering Process
Authors: Miguel Goulao, Fernando Brito e. Abreu
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Reviews on software engineering literature have shown an insufficient experimental validation of claims, when compared to the standard practice in other well-established sciences. Poor validation of software engineering claims increases the risks of introducing changes in the software process of an organization, as the potential benefits assessment is based on hype, rather than on facts. The community lacks highly disseminated experimental best practices. We contribute with a model of the experimental software engineering process that is aligned with recent proposals for best practices in experimental data dissemination. The model can be used in the definition of software engineering experiments and in comparisons among experimental results.
A classification of mental models of undergraduates seeking information for a course essay in history and psychology: Preliminary investigations into aligning their mental models with online thesauri
Authors: Charles Cole, Yang Lin, John Leide, Andrew Large, Jamshid Beheshti
Venue: Journal of the American Society for Information Science and Technology (2007)

The article reports a field study which examined the mental models of 80 undergraduates seeking information for either a history or psychology course essay when they were in an early, exploration stage of researching their essay. This group is presently at a disadvantage when using thesaurus-type schemes in indexes and online search engines because there is a disconnect between how domain novice users of IR systems represent a topic space and how this space is represented in the standard IR system thesaurus. The study attempted to (a) ascertain the coding language used by the 80 undergraduates in the study to mentally represent their topic and then (b) align the mental models with the hierarchical structure found in many thesauri. The intervention focused the undergraduates' thinking about their topic from a topic statement to a thesis statement. The undergraduates were asked to produce three mental model diagrams for their real-life course essay at the beginning, middle, and end of the interview, for a total of 240 mental model diagrams, from which we created a 12-category mental model classification scheme. Findings indicate that at the end of the intervention, (a) the percentage of vertical mental models increased from 24 to 35&percnt; of all mental models; but that (b) 3rd-year students had fewer vertical mental models than did 1st-year undergraduates in the study, which is counterintuitive. The results indicate that there is justification for pursuing our research based on the hypothesis that rotating a domain novice's mental model into a vertical position would make it easier for him or her to cognitively connect with the thesaurus's hierarchical representation of the topic area. &copy; 2007 Wiley Periodicals, Inc.
Just say 'A Class Defines a Data Type'
Authors: Chenglie Hu
Venue: Communications of the ACM (2008)

When teaching computer programming to novices, forget "objects early," "objects later," and "back to basics."
Multifractal and R/S Analysis of Protein Structure
Authors: Zheng Tingting, Cheng Jiaxing, Mao Junjun, Song Jie
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The spacing distance of amino acids is used to study the relationship between the primary structure and structural classification of large proteins. Rescaled-range (R/S) analysis was adopted to examine long-range correlation property of proteins. And multifractal property is then discussed by the spacing distance of amino acids. A classification of proteins by assigning to each sequence a point in two-dimensional space(\Delta\alpha, H) is given to construct a phylogenetic tree. This result is shown to be reasonably satisfactory to \alpha + \beta class.