{"title":"Monadic Tree Print","authors":"K. Grzanek","doi":"10.1515/jacsm-2015-0005","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0005","url":null,"abstract":"Abstract Directed acyclic graphs and trees in particular belong to the most extensively used data structures. Visualizing them properly is a key to a success when developing complex algorithms that make use of them. Textual visualizations a la UNIX tree command is essential when the urge is to deal with large trees. Our aim was to design a library that would exploit this approach and to make an implementation of it for a purely functional programming language. The library uses monads to print directly into an output stream or to generate immutable Strings. This paper gives a detailed overview of the solution.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"147 - 157"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Application of the Laplace Transform for Modeling of Gas Flow Using Maple¯","authors":"M. Wójcik, M. Szukiewicz, P. Kowalik","doi":"10.2478/jacsm-2014-0003","DOIUrl":"https://doi.org/10.2478/jacsm-2014-0003","url":null,"abstract":"Abstract The Laplace transform is powerful method for solving differential equations. This paper presents the application of Laplace transform to solve the mathematical model of gas flow through the measuring system. The basis of the mathematical model used to describe and simulate the analyzed process is a system of ordinary differential equations. As a result is obtained a single algebraic equation in terms of the complex variable s. In order to study the dynamics of the system these equation should be reverted to the time domain by performing an inverse Laplace transform. Calculations were performed in the environment of Maple¯. Determining of mixing in a u-shape vessel is aim of presented calculations.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"43 - 53"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2478/jacsm-2014-0003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69214701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Persistent Collections with Customizable Equivalence and Identity Semantics","authors":"K. Grzanek","doi":"10.2478/jacsm-2014-0002","DOIUrl":"https://doi.org/10.2478/jacsm-2014-0002","url":null,"abstract":"Abstract Providing a comprehensive set of mechanisms solving the problem of controlling equivalence and identity requires implementing the functionality for non-sequential containers instrumented with the enriched semantics. Functional programming languages, like Clojure, typically miss the functionality by default. The article presents the design considerations, concepts and implementation details of generalized sets and maps aware of the customizable equivalence and identity together with some usage examples.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"45 1","pages":"27 - 42"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69214692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Role of Information Technology for People with Intellectual Disabilities","authors":"A. Marchlewska, P. Goetzen, A. Marchlewska","doi":"10.2478/jacsm-2014-0006","DOIUrl":"https://doi.org/10.2478/jacsm-2014-0006","url":null,"abstract":"Abstract A mentally disabled person has limited access to information and communication. Making a computer available to such a person we give them an opportunity to be independent in life and develop their self-reliability. They can take part in various forms of social life, develop artistically, enrich their personality and widen the scope of interests. The possibility to use a computer can also be a way of spending free time.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"81 - 87"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69214721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effective Approach for Data Aggregation in Wireless Sensor Network: A Structure Free Approach","authors":"U. Prasad, D. Adane","doi":"10.2478/jacsm-2014-0004","DOIUrl":"https://doi.org/10.2478/jacsm-2014-0004","url":null,"abstract":"Abstract Wireless Sensor Network consist of thousands sensor node which have limited Power, Computation, Sensing and Communication capabilities. Among all operation of Sensor Node, Wireless Communication consumes most of the energy. So it is necessary to decrease the number of packets transmitted through the network. Many Sensor Node could detect similar event, which increases the overall bandwidth utilization to transmit redundant data. Here Nodes computation is cheaper than communication in terms of energy. So the technique of Data Aggregation is applied to summarize data which decreases the amount of data transmitted in the network, which in turn increases the lifetime of the network. Many Data aggregation protocols are based on a structured approach which is suitable for data collection application. But maintenance of the structure is an extra overhead and this approach is not suitable for dynamic scenario. So we propose an ad-hoc data aggregation protocol for dynamic scenario mainly event based application.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"54 - 65"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2478/jacsm-2014-0004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69214708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Persistent Sequences with Effective Random Access and Support for Infinity","authors":"K. Grzanek","doi":"10.2478/jacsm-2014-0005","DOIUrl":"https://doi.org/10.2478/jacsm-2014-0005","url":null,"abstract":"Abstract Persistent sequences are the core data structure in functional programming style. Their typical implementations usually allow creating infinite streams of objects. Unfortunately, asking for length of an infinite data structure never ends or ends with a run-time error. Similarly, there is no default way to make an effective, O[1] or logarithmic access to an arbitrarily chosen sequence element, even when the nature of the correlation between index value and the sequence element is known. This paper presents a Clojure library that meets these limitations and offers an enhanced version of sequences with a support for effective random access and the ability to ask for an infinite length.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"66 - 80"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69214714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Minimum Utilization of Electromagnetic (2G, 3G, 4G) Spectrum in Seamless Mobility Based on Various Estimation Methods","authors":"A. Jayanthila Devi, G. M. Kadhar Nawaz","doi":"10.2478/jacsm-2014-0001","DOIUrl":"https://doi.org/10.2478/jacsm-2014-0001","url":null,"abstract":"Wireless Cellular Seamless Mobility is the most important feature of a wireless cellular communication system. Basically cell phones are used for communication purpose and therefore good cell coverage is needed to make and receive calls. Usually, continuous service is achieved by supporting handover from one cell to another. Handover is the process of changing the channel associated with the current connection while a call is in progress. It is often initiated either by crossing a cell boundary or by deterioration in quality of the signal in the current channel. Mobile IP, too, has to support redirection of data to a new foreign agent after the change of network access. In this case the additional delay caused by the redirection. The shorter the interruption of the service is up to the ideal case of no service interruption. Minimizing the Delay based on some prior estimation methods in handover is better for quality of seamless connectivity anytime; anywhere across communication networks. All mobile phone system supports the seamless handover between base stations. To avoid the additional delay and wastage of Electromagnetic Spectrum, Mobile IP may use Optimizations such as rerouting of the whole packet in the flow of efficiently transmission of data with short interrupted service by Time series based Spectrum Estimation Technique. Due to the utilization of seamless handover mechanism it reduces the unwanted usage of Spectrum.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"26 - 5"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2478/jacsm-2014-0001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69214684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reaction-diffusion problems with Random parameters using the generalized stochastic finite difference method","authors":"M. Kaminski","doi":"10.4018/978-1-4666-4991-0.CH010","DOIUrl":"https://doi.org/10.4018/978-1-4666-4991-0.CH010","url":null,"abstract":"The main idea here is to demonstrate the new stochastic discrete computational approach consisting of the generalized stochastic perturbation technique based on the Taylor expansions of the random variables and, at the same time, classical Finite Difference Method on the regular grids. As it is documented by the computational illustrations, it is possible to determine using this approach also higher probabilistic moments and to provide full hybrid analytical-discrete analysis for any random dispersion of input variables unlike in the second order second moment technique worked out before. A numerical algorithm is implemented here using the straightforward partial differentiation of the reaction-diffusion equation with respect to the random input quantity; all symbolic computations of probabilistic moments and characteristics are completed by the computer algebra system MAPLE.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"7 1","pages":"205-216"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89994392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Timothy C Havens, Gregory L Alexander, Carmen C Abbott, James M Keller, Marjorie Skubic, Marilyn Rantz
{"title":"Tracking Exercise Motions of Older Adults Using Contours.","authors":"Timothy C Havens, Gregory L Alexander, Carmen C Abbott, James M Keller, Marjorie Skubic, Marilyn Rantz","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>In this paper we describe the development of a novel markerless motion capture system and explore its use in documenting elder exercise routines in a health club. This system uses image contour tracking and swarm intelligence methods to track the location of the spine and shoulders during three exercises - treadmill, exercise bike, and overhead lateral pull-down. Validation results show that our method has a mean error of approximately 2 degrees when measuring the angle of the spine or shoulders relative to the horizontal. Qualitative study results demonstrate that our system is capable of providing important feedback about the posture and stability of elders while they are performing exercises. Study participants indicated that feedback from our system would add value to their exercise routines.</p>","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"2 1","pages":"21-42"},"PeriodicalIF":0.0,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3141579/pdf/nihms255633.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30029042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constraint satisfaction problem based modelling and value ordering based heuristic for nurse scheduling","authors":"Lakhdar Djeffal, G. Goncalves, Malika Babes","doi":"10.34658/JACS.2006.14.2.7-28","DOIUrl":"https://doi.org/10.34658/JACS.2006.14.2.7-28","url":null,"abstract":"Nurse Scheduling Problem (NSP) consists of assigning shift-types (morning, afternoon and night) to qualified personnel over a certain planning period. It is a difficult and time-consuming task. In this paper we present a formulation of the hospital Nurse Scheduling Problem just like Constraint Satisfaction Problem ′′CSP′′ based constraint programming in order to find a solution, which minimizes the violation of Nurses’ preferences. We would suggest a flexibility tool for helping to decide and for making negotiation easier. Our originality lies in the modelling of the problem, by defining the global constraints and in the algorithm of resolution to solve it, by proposing a new value ordering based heuristic for assignment of the decision variables taking into account the set of Nurses preferences. Our heuristic is based on the structure of the CSP and on the properties of constraints. It allows the reduction of the search space for solution and returns a solution within few second.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"75 1","pages":"7-28"},"PeriodicalIF":0.0,"publicationDate":"2006-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89679783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}