ppxscal/embedding_network huggingface dataset:
Design and Evaluation of a Combinatorial Double Auction for Resource Allocations in Grids
Authors: Li Li, Yuanan Liu, David Hausheer, Burkhard Stiller
Venue: Proceedings of the 6th International Workshop on Internet Charging and Qos Technologies: Network Economics for Next Generation Networks (2009)

Offering Grid services in an open market determines an optimization case for finding the best suitable resource allocation for a given number of requests and existing resources. Thus, appropriate resource allocation schemes, supporting accounting, are required in addition to a pricing scheme, which supports financial fairness criteria. The newly developed Resource Allocation Model for the Combinatorial Double Auction (RAMCoDA) achieves these requirements, while being incentive compatible.
Matlab: A Practical Introduction to Programming and Problem Solving
Authors: Stormy Attaway
Venue:  (2009)

Assuming no knowledge of programming, this book presents both programming concepts and MATLAB's built-in functions, providing a perfect platform for exploiting MATLAB's extensive capabilities for tackling engineering problems. It starts with programming concepts such as variables, assignments, input/output, and selection statements, moves onto loops and then solves problems using both the 'programming concept' and the 'power of MATLAB' side-by-side. In-depth coverage is given to input/output, a topic that is fundamental to many engineering applications. * Presents programming concepts and MATLAB built-in functions side-by-side, giving students the ability to program efficiently and exploit the power of MATLAB to solve problems.* In depth coverage of file input/output, a topic essential for many engineering applications* Systematic, step-by-step approach, building on concepts throughout the book, facilitating easier learning* Sections on 'common pitfalls' and 'programming guidelines' direct students towards best practice
Grounded design: Design patterns as the link between theory and practice
Authors: Wouter van Diggelen, Maarten Overdijk
Venue: Computers in Human Behavior (2009)

The process of designing a networked learning environment can be characterized by a high degree of uncertainty. This is especially true when the design includes innovative technologies. It is difficult to design a networked learning environment that closely fits the requirements of the educational practice. Often the technology seems leading in the design process because it is the most tangible aspect of the e-learning environment. This brings along the risk that the technology becomes detached from its context of use. Design patterns are a means to overcome this problem of detachment between design and practice. Design patterns make the tight relationship between the two more explicit. In this paper we further elaborate on the relationship between design and practice. We will stress the importance of theory in the development of design patterns. Theory development is an essential aspect of our approach to the development of design patterns. The approach is oriented towards a systematic analysis of problems and the development of conceptual models that guide the definition and evaluation of design patterns. In this paper we present a case study of how the approach was used to develop design patterns for networked learning in the classroom.
System identification using DNA computing approach
Authors: Ching-Huei Huang, Horn-Yong Jan, Chun-Liang Lin
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

A DNA computing algorithm (DNACA) with an electron-ion interaction potential (EIIP) decoding scheme is proposed to identify a class of transfer functions. The DNACA includes enzyme and virus operators which provides a highly modular, flexible, and accurate self-organizing structure environment. Simulation study based on the De Jong's test functions show its superior performance when compared with the improved and standard genetic algorithms (GA).
Second Derivative Approximation for Origin-Based Algorithm
Authors: Feng Li
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Origin-based algorithm(OBA) for traffic assignment problem has been demonstrated preferable to the widely accepted and used Frank-Wolfe algorithm and path-based algorithms. Note that OBA can not avoid path enumeration of concerned network, which will lead to two disadvantages. One is the intensive memory requirements and the other is the difficulties in manipulating and storing paths. In order to solve these problems, we first propose the lower and upper bounds of the Hessian matrix, which can be calculated without path enumeration. Then use the lower bound of Hessian matrix to approximate the direction of the origin-based algorithm. According to our computational results, the modified origin-based algorithm(MOBA) improves the convergence performance greatly. The results indicate that MOBA can deliver better and more reliable convergence than OBA and saves much more CPU time especially when large-scale networks are being considered.
An optimal robust digital image watermarking based on genetic algorithms in multiwavelet domain
Authors: Prayoth Kumsawat, Kitti Attakitmongcol, Arthit Srikaew
Venue: WSEAS Transactions on Signal Processing (2009)

In this paper, we propose digital image watermarking algorithm in the multiwavelet transform domain. The embedding technique is based on the quantization index modulation technique and this technique does not require the original image in the watermark extraction. We have developed an optimization technique using the genetic algorithms to search for optimal quantization steps to improve the quality of watermarked image and robustness of the watermark. In addition, we analyze the performance of the proposed algorithm in terms of peak signal to noise ratio and normalized correlation. The experimental results show that our proposed method can improve the quality of the watermarked image and give more robustness of the watermark as compared to previous works.
Case-based systems in health sciences: a case study in the field of stress
Authors: Shahina Begum, Mobyen Uddin Ahmed, Peter Funk
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Now-a-days medical domain is a popular area for the artificial intelligence (AI) research. Many of the early AI systems were attempted to apply rule-based reasoning in developing computer-based diagnosis system in medical domain. However, for a broad and complex medical domain the effort of applying rule-based system has encountered several problems. Today many systems are serving multi-purpose i.e. tend to support not only in diagnosis but also in number of other complex tasks and combining more than one AI techniques in the health care domain. In this paper, we will investigate the state-of-the art of case-based reasoning (CBR), a recent AI method in the medical domain. A case study in the stress medicine domain is presented here. Today stress has become a major concern in our society. The demand of the decision support system (DSS) in stress domain is increasing rapidly. However, the application of DSS in this domain is limited so far due to the weak domain theory. In our on going research, we have proposed a solution analyzing the relation between stress and finger temperature using case-based reasoning and other AI techniques namely case-based reasoning, textual CBR, rule-based reasoning, and fuzzy logic to support classification and diagnosis in stress management.
Rearrangeable and nonblocking [w, f] -distributors
Authors: Hung Q. Ngo, Yang Wang, Dazhen Pan
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

We formulate a graph model called [w, f]-distributors which is useful in analyzing the structures and comparing the quantitative complexities and qualitative features of optical multicast cross-connects. Using the formulation we show that two strictly nonblocking multicast optical cross-connects under two different request models are equivalent topologically, even though one request model is much less restrictive than the other. We then investigate the tradeoff between the depth and the complexity of an optical multicast cross-connect using the graph model. Upper and lower complexity bounds are proved. In the process, we also give a generic recursive construction that can be used to construct optimal and near-optimal [w, f]-distributors. The recursive construction can also be used to construct cost-effective optical multicast cross-connects. Another important result that follows is the exact asymptotic behavior of the size of optimal [w, f]-connectors, the unicast version of [w, f]-distributors.
Name-ethnicity classification from open sources
Authors: Anurag Ambekar, Charles Ward, Jahangir Mohammed, Swapna Male, Steven Skiena
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

The problem of ethnicity identification from names has a variety of important applications, including biomedical research, demographic studies, and marketing. Here we report on the development of an ethnicity classifier where all training data is extracted from public, non-confidential (and hence somewhat unreliable) sources. Our classifier uses hidden Markov models (HMMs) and decision trees to classify names into 13 cultural/ethnic groups with individual group accuracy comparable accuracy to earlier binary (e.g., Spanish/non-Spanish) classifiers. We have applied this classifier to over 20 million names from a large-scale news corpus, identifying interesting temporal and spatial trends on the representation of particular cultural/ethnic groups.
Performance analysis of burst-mode receivers with clock phase alignment and forward error correction for GPON
Authors: Bhavin J. Shastri, Julien Faucher, Noha Kheder, Ming Zeng, Nicholas Zicha, David V. Plant
Venue: Analog Integrated Circuits and Signal Processing (2009)

We experimentally demonstrate the performance analysis of burst-mode receivers (BMRx) in a 622 Mb/s 20-km gigabit-capable passive optical network (GPON) uplink. Our receiver features automatic phase acquisition using a clock phase aligner (CPA), and forward-error correction using (255, 239) Reed-Solomon (RS) codes. The BMRx provides instantaneous (0 preamble bit) phase acquisition and a packet-loss ratio (PLR) < 10¿6 for any phase step (±2¿ rads) between consecutive packets, while also supporting more than 600 consecutive identical digits (CIDs). The receiver also accomplishes a 3-dB coding gain at a bit-error rate (BER) of 10¿10. The CPA makes use of a phase picking algorithm and an oversampling clock-and-data recovery circuit operated at 2× the bit rate. The receiver meets the GPON physical media dependent layer specifications defined in the ITU-T recommendation G.984.2 standard. We investigate the PLR performance of the system and quantify it as a function of the phase step between consecutive packets, received signal power, CID immunity, and BER, while also assessing the tradeoffs in preamble length, power penalty, and pattern correlator error resistance. We also study the impact of mode-partition noise in the GPON uplink in terms of the effective PLR and BER coding gain performance of the system. In addition, we demonstrate how the CPA and the RS(255, 239) codes can be used in tandem for dynamic burst-error correction giving reliable BERs in bursty channels.
Community college students and differences between computer skills self-assessment and objective computer-based skills assessment
Authors: Roberto Pena
Venue:  (2008)

Computers have become an integral part of a college education, but assuming that students enter college with adequate computer skills or that they can accurately self-assess their computer skills, it may not be in the best interests of the students. This study examined the accuracy of students' subjective self-assessments when compared to the results of an objective computer-based assessment, and further examined whether the differences were impacted by age and gender. Differences were found between students' self-assessment scores and computer-based assessment scores, resulting in findings that over three-quarters of participating students inaccurately assessed their computer skills. Differences were also found based on age and gender. While self-assessment accuracy varied widely between the seven different subject areas assessed (general concepts, Windows &reg; and file management, word processing, spreadsheets, database, presentation, and Internet), students were overall most accurate in assessing their Internet skills and least accurate in general concepts. Data analyses also showed that younger male students most often overassess their computer skills, while older women students most often underassess their computer skills. One conclusion to be drawn overall from this study is that an assessment number alone is not enough information for advisors and faculty to best serve and place students in computer skills classes. This study also shows that student self-assessment alone is not an adequate method for determining class placement. Furthermore, student age, gender, behaviors and attitudes may give false impressions possibly leading to faculty and advisors making false assumptions about students' computer skills and ability to learn. Age and gender seem to play a part in how students self-assesses their computer skills, and both faculty and advisors could better serve individual students by looking past some common misconceptions of who may or may not have computer skills, and focus on the individual.
Mobile Device Interaction with Force Sensing
Authors: James Scott, Lorna M. Brown, Mike Molloy
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

We propose a new type of input for mobile devices by sensing forces applied by users to device casings. Deformation of the devices is not necessary for such "force gestures" to be detectable. Our prototype implementation augments an ultra-mobile PC (UMPC) to detect twisting and bending forces. We describe examples of interactions using these forces, employing twisting to perform application switching (alt-tab) and interpreting bending as page-down/up. We present a user study exploring users' abilities to reliably apply twisting and bending forces to various degrees, and draw implications from this study for future force-based interfaces.
Visual simulation of shockwaves
Authors: Jason Sewall, Nico Galoppo, Georgi Tsankov, Ming Lin
Venue: Graphical Models (2009)

We present an efficient method for visual simulations of shock phenomena in compressible, inviscid fluids. Our algorithm is derived from one class of the finite volume method especially designed for capturing shock propagation, but offers improved efficiency through physically-based simplification and adaptation for graphical rendering. Our technique is capable of handling complex, bidirectional object-shock interactions stably and robustly. We describe its applications to various visual effects, including explosion, sonic booms and turbulent flows. Furthermore, we explore parallelization schemes and demonstrate the scalability of our method on shared-memory, multi-core architectures.
Magnet: a content centric routing protocol for large scale networks
Authors: Yosra Barouni, Promethee Spathis
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

Content routing is aimed to provide location-independent access to an object without relying on the maintenance of network connections between the source and the destination of the object. This paradigm enables the usage patterns in terms of applications involving data objects retrieval or services access by giving emphasis to the content rather than the location. Messages are routed on the basis of their descriptions rather than host locations. In this paper, we propose a novel content routing protocol designed for retrieving data objects in large-scale networks. Our routing scheme is based on two algorithms: request filtering and content dissemination. The design of these algorithms allows our protocol being more adapted to large scale networks than the classical content routing protocols. Our solution is based on a set of metrics and design principles aimed to achieve a compromise between the matching efficiency and the cost of communication and storage. Through conducted simulations, we show that our protocol is successful in achieving this compromise necessary for large-scale networks.
Like a River
Authors: Grady Booch
Venue: IEEE Software (2009)

The metaphor of software development as building construction is an old one. Here is a fresh perspective, considering the life cycle of a software-intensive system as a river.
Technology-Enabled Pedagogy to Bridge Bar Diagrams to Letter-Symbolic Algebra
Authors: Chee-Kit Looi, Foo-Keong Ng, Tek-Hong Kho
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

In the Singapore primary school mathematics curriculum, students are taught using bar diagrams to visualize the problem structure in a given word problem. This approach, often called the “model method”, allows students to solve fairly complex word problems without the need to use letter-symbolic algebra. When these students progress to secondary school, they learn the algebraic way of solving word problems. Studies (for example, Ng, Lee, Ang & Khng, 2006) have shown that poor bridging of students' from the use of bar diagrams to the use of letter-symbolic algebraic methods can hinder their learning of algebra. Working in tandem with the Singapore Ministry of Education, a software tool “AlgeBAR” was designed and developed to scaffold the learning of the algebraic process, especially the formulation of equations. In this paper, we elaborate on the intervention pedagogy that is technology-enabled, as well as our research methodology.
A filter model for feature subset selection based on genetic algorithm
Authors: M. E. ElAlami
Venue: Knowledge-Based Systems (2009)

This paper describes a novel feature subset selection algorithm, which utilizes a genetic algorithm (GA) to optimize the output nodes of trained artificial neural network (ANN). The new algorithm does not depend on the ANN training algorithms or modify the training results. The two groups of weights between input-hidden and hidden-output layers are extracted after training the ANN on a given database. The general formula for each output node (class) of ANN is then generated. This formula depends only on input features because the two groups of weights are constant. This dependency is represented by a non-linear exponential function. The GA is involved to find the optimal relevant features, which maximize the output function for each class. The dominant features in all classes are the features subset to be selected from the input feature group.
User identification via process profiling: extended abstract
Authors: Steve McKinney, Douglas S. Reeves
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Insiders are authorized persons who possess special privileges of access; these privileges in some cases may be abused. One way in which an insider attack may occur is when user X makes use of user Y's unattended (but logged in) computer, and masquerades as user Y. This paper presents a method of masquerade detection. A light-weight monitor collected information about computer usage by employees of a small organization for a period of three weeks. A profile of each user was developed using a Na&iuml;ve Bayes classifier that analyzed handle counts of processes as the input. Under conditions specified in the paper, users were correctly identified using this technique approximately 97% of the time, with a misidentification rate of .4%.
Teaching design patterns using a family of games
Authors: Marco Antonio Gómez-Martín, Guillermo Jiménez-Díaz, Javier Arroyo
Venue: ACM SIGCSE Bulletin (2009)

Object-oriented software design requires a combination of abilities that can not be easily transferred to the students in lecture sessions. Based on our experience, this paper details how to increase student comprehension of design patterns through a project-based approach that consists in the development of a family of abstract strategy games in an incremental way. In this approach, the application resulting from the previous assignment is refined using refactoring and design patterns to complete the next assignment. Our approach is illustrated by the development of a family of n-in-a-row games in a CS3 course.
Applications of Data Mining Methods in the Evaluation of Client Credibility
Authors: Yang Dong-Peng, Li Jin-Lin, Ran Lun, Zhou Chao
Venue: Proceeding of the 2008 conference on Applications of Data Mining in E-Business and Finance (2008)

Client credibility plays an important role in the financial and banking industry. This paper combines C4.5 and Apriori algorithms in the data mining process and discusses the relationship between these two algorithms. It then tests them using the WEKA software to acquire information from the analysis of the historical data of credit card clients. Finally, it offers decision-making support for the evaluation of client credibility.
Representation in Digital Systems
Authors: Vincent C. Müller
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

Cognition is commonly taken to be computational manipulation of representations. These representations are assumed to be digital, but it is not usually specified what that means and what relevance it has for the theory. I propose a specification for being a digital state in a digital system, especially a digital computational system. The specification shows that identification of digital states requires functional directedness, either for someone or for the system of which the state is a part. In the case of digital representations, the function of the type is to represent, that of the token just to be a token of that representational type.