Search results for: crime problem

Authors: Liudmyla Koliechkina, Olena Dvirna

Abstract:

The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps.

Keywords: discrete set, linear combinatorial optimization, multi-objective optimization, Pareto solutions, partial permutation set, structural graph

Procedia PDF Downloads 136

Authors: (Ted) Edward Holmberg, Mahdi Abdelguerfi, Elias Ioup

Abstract:

This research details a coverage measure for evaluating the effectiveness of observer node placements in a spatial bipartite network. This coverage measure can be used to optimize the configuration of stationary or mobile spatially oriented observer nodes, or a hybrid of the two, over time in order to fully utilize their capabilities. To demonstrate the practical application of this approach, we construct a SpatioTemporal Bipartite Network (STBN) using real-time crime center (RTCC) camera nodes and NOPD calls for service (CFS) event nodes from New Orleans, La (NOLA). We use the coverage measure to identify optimal placements for moving mobile RTCC camera vans to improve coverage of vulnerable areas based on temporal patterns.

Keywords: coverage measure, mobile node dynamics, Monte Carlo simulation, observer nodes, observable nodes, spatiotemporal bipartite knowledge graph, temporal spatial analysis

Procedia PDF Downloads 66

Authors: Nur Iman Subono, Meidi Kosandi

Abstract:

This paper examines the role of regional cooperation in the Association of Southeast Asian Nations (ASEAN) in the fight against human trafficking for Indonesia. Many among scholars suggest that regional cooperation is necessary for combating human trafficking for its transnational and organized character as a crime against humanity. ASEAN members have been collectively active in responding transnational security issues with series of talks and collaboration agreement since early 2000s. Lately in 2015, ASEAN agreed on ASEAN Convention against Trafficking in Persons, particularly Women and Children (ACTIP) that requires each member to collaborate in information sharing and providing effective safeguard and protection of victims. Yet, the frequency of human trafficking crime occurrence remains high and tend to increase in Indonesian in 2017-2018. The objective of this paper is to examine the effectiveness and success of ACTIP implementation in the fight against human trafficking in Indonesia. Based on two years of research (2017-2018) in three provinces with the largest number of victims in Indonesia, this paper shows the tendency of persisting crime despite the implementation of regional and national anti-trafficking policies. The research was conducted by archive study, literature study, discourse analysis, and depth interviews with local government officials, police, prosecutors, victims, and traffickers. This paper argues that the relative success of ASEAN in establishing convention at the high-level meetings has not been followed with the success in its implementation in the society. Three main factors have contributed to the ineffectiveness of the agreements, i.e. (1) ASEAN institutional arrangement as a collection of sovereign states instead of supranational organization with binding authority; (2) the lack of commitment of ASEAN sovereign member-states to the agreements; and (3) the complexity and variety of the nature of the crime in each member-state. In effect, these factors have contributed to generating the regionalism paradox in ASEAN where states tend to revert to national policies instead of seeking regional collective solution.

Keywords: human trafficking, transnational security, regionalism, anti trafficking policy

Procedia PDF Downloads 124

Authors: M. G. M. Khan, V. D. Prasad, D. K. Rao

Abstract:

In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique.

Keywords: auxiliary variable, dynamic programming technique, nonlinear programming problem, optimum stratification, uniform distribution

Procedia PDF Downloads 301

Authors: Guilherme Baldo Carlos

Abstract:

The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving.

Keywords: genetic algorithm, evolutionary algorithm, scheduling, flexible job-shop scheduling

Procedia PDF Downloads 117

Authors: Pranav Vaidya

Abstract:

The recent upheaval of a ballot initiative taken place in California & Los Angeles‘s newspapers shows how the concept of giving Death Penalty obliterates the very soul basis of community and society which rests upon the tripod of values, ethics, and morality. This paper goes on with examining how, by giving death penalties we are, on one hand trying to wipe out those heinous offenders committing such unspeakable crimes against the public; while on the other hand it comes with a devastating effect of corroding and eluding the existence of ethics and morality which is in the very nature of “protecting the life of humankind”. As it can be stated that, by giving capital punishment, we are trying to legitimize an irreversible act of violence by the authority of state and target innocent victims because as long as the human justice is fallible, the risk of executing an innocent can never be eliminated. However, scholars in the legalization of Capital Punishment have argued that the courts should impose punishment befitting the crime so that they could reflect public abhorrence of the crime, create deterrent or rehabilitating effects & deliver the truest form of justice.

Keywords: ethics, heinous offenders, morality, unspeakable crimes

Procedia PDF Downloads 257

Authors: Laissa Mae Francisco, John Rolex Ingreso, Anna Krizel Menguito, Criselda Robrigado, Rej Maegan Tuazon

Abstract:

This study aims to determine and describe the existing relationship between number sense proficiency and problem-solving performance of grade seven students from Victorino Mapa High School, Manila. A paper pencil exam containing of 50-item number sense test and 5-item problem-solving test which measures their number sense proficiency and problem-solving performance adapted from McIntosh, Reys, and Bana were used as the research instruments. The data obtained from this study were interpreted and analyzed using the Pearson – Product Moment Coefficient of Correlation to determine the relationship between the two variables. It was found out that students who were low in number sense proficiency tend to be the students with poor problem-solving performance and students with medium number sense proficiency are most likely to have an average problem-solving performance. Likewise, students with high number sense proficiency are those who do excellently in problem-solving performance.

Keywords: number sense, performance, problem solving, proficiency

Procedia PDF Downloads 397

Authors: Pei Chin Lim

Abstract:

School of Mathematics and Science of Singapore Polytechnic offers a Basic Mathematics module to students who did not pass GCE O-Level Additional Mathematics. These students are weaker in Mathematics. In particular, they struggle with word problems and tend to leave them blank in tests and examinations. In order to improve students’ problem-solving skills, the school redesigned the Basic Mathematics module to incorporate Polya’s problem-solving methodology. During tutorial lessons, students have to work through learning activities designed to raise their metacognitive awareness by following Polya’s problem-solving process. To assess the effectiveness of the redesign, students’ working for a challenging word problem in the mid-semester test were analyzed. Sixty-five percent of students attempted to understand the problem by making sketches. Twenty-eight percent of students went on to devise a plan and implement it. Only five percent of the students still left the question blank. These preliminary results suggest that with regular exposure to an explicit and systematic problem-solving approach, weak students’ problem-solving skills can potentially be improved.

Keywords: mathematics education, metacognition, problem solving, weak students

Procedia PDF Downloads 134

Authors: Derkaoui Orkia, Lehireche Ahmed

Abstract:

The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time.

Keywords: semidefinite programming, maximum clique problem, primal-dual interior point method, relaxation

Procedia PDF Downloads 192

Authors: Mehmet Hakan Karaata

Abstract:

In this paper, we first coin a new graph theocratic problem with numerous applications. Second, we provide two algorithms for the problem. The first solution is using a brute-force techniques, whereas the second solution is based on an initial identification of the cycles in the given graph. We then provide a correctness proof of the algorithm. The applications of the problem include graph analysis, graph drawing and network structuring.

Keywords: algorithm, cycle, graph algorithm, graph theory, network structuring

Procedia PDF Downloads 357

Authors: Emir Sunguroglu, Merve Sunguroglu, Yesim Aliefendioglu, Harun Tanrivermis

Abstract:

Basic human needs range from physiological needs such as food, water and shelter to safety needs such as security, protection from natural disasters and even urban terrorism which are extant and not fulfilled even in urban areas where people live civilly in large communities. These basic needs when arose in urban life lead to a different kind of crime set defined as urban crimes. Urban crimes mostly result from differences between socioeconomic conditions in society. Income inequality increases tendency towards urban crimes. Especially in slum areas and suburbs, urban crimes not only threaten public security but they also affect deliverance of public services. It is highlighted that, construction of urban security against problems caused by urban crimes is not only achieved by involvement of urban security in security of the community but also comprises juridical development and staying above a level of legal standards concurrently. The idea of urban transformation emerged as interventions to demolishment and rebuilding of built environment to solve the unhealthy urban environment, inadequate infrastructure and socioeconomic problems came up during the industrialization process. Considering the probability of urbanization process driving citizens to commit crimes, The United Nations Commission on Human Security’s focus on this theme is conferred to be a proper approach. In this study, the analysis and change in security before, through and after urban transformation, which is one of the tools related to urbanization process, is strived to be discussed through the case of Sincan County Saraycik District. The study also aims to suggest improvements to current legislation on public safety, urban resilience, and urban transformation. In spite of Saraycik District residing in a developing County in Ankara, Turkey, from urbanization perspective as well as socioeconomic and demographic indicators the District exhibits a negative view throughout the County and the country. When related to the county, rates of intentional harm reports, burglary reports, the offense of libel and threat reports and narcotic crime reports are higher. The District is defined as ‘crime hotspot’. Interviews with residents of Saraycik claim that the greatest issue of the neighborhood is Public Order and Security (82.44 %). The District becomes prominent with negative aspects, especially with the presence of unlicensed constructions, occurrence of important social issues such as crime and insecurity and complicated lives of inhabitants from poverty and low standard conditions of living. Additionally, the social structure and demographic properties and crime and insecurity of the field have been addressed in this study. Consequently, it is claimed that urban crime rates were related to level of education, employment and household income, poverty trap, physical condition of housing and structuration, accessibility of public services, security, migration, safety in terms of disasters and emphasized that urban transformation is one of the most important tools in order to provide urban security.

Keywords: urban security, urban crimes, urban transformation, Saraycik district

Procedia PDF Downloads 274

Authors: Hashini E. Mohottala

Abstract:

We report the combine use of Wikispaces (WikiS) and Group Problem Solving (GPS) sessions conducted in the introductory level physics classes. As a part of this new teaching tool, some essay type problems were posted on the WikiS in weekly basis and students were encouraged to participate in problem solving without providing numerical final answers but the steps. Wikispace is used as a platform for students to meet online and create discussions. Each week students were further evaluated on problem solving skills opening up more opportunity for peer interaction through GPS. Each group was given a different problem to solve and the answers were graded. Students developed a set of skills in decision-making, problem solving, communication, negotiation, critical and independent thinking and teamwork through the combination of WikiS and GPS.

Keywords: group problem solving (GPS), wikispace (WikiS), physics education, learning

Procedia PDF Downloads 388

Authors: Sourabh Joshi, Tarun Sharma, Anurag Sharma

Abstract:

Ant Colony Optimization is heuristic Algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Two variants of Ant Colony Optimization algorithm named Ant System and Max-Min Ant System are implemented in MATLAB to solve travelling Salesman Problem and the results are compared. In, this paper both systems are analyzed by solving the some Travelling Salesman Problem and depict which system solve the problem better in term of cost and time.

Keywords: Ant Colony Optimization, Travelling Salesman Problem, Ant System, Max-Min Ant System

Procedia PDF Downloads 447

Authors: Boris Melnikov, Dmitrii Chaikovskii, Elena Melnikova

Abstract:

The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix.

Keywords: optimization problems, DNA matrix, partially filled matrix, traveling salesman problem, heuristic algorithms

Procedia PDF Downloads 120

Authors: Bertha Korang Gyimah, Obed Asamoah, Kenross, T. Asamoah

Abstract:

In every human community, crimes or offenses cannot be eliminated, but as crimes are expected, there should be bodies that will control and prevent the crimes. There has been an increasing rate of crime, such as armed robbery, kidnapping, murder, and other forms of violence in the country. Community participation in crime control cannot be left out in Ghana. Several works have been conducted to deal with the importance of community participation in policing, but the causes of communities not fully participating in community policing have been left out. The main aim of the research was to assess the impact of community policing and why the communities are reluctant to partake in community policing to help control crime in Bia West. There have been perceptions about Police that, they expose informant after they give the police tip-off which put the whistleblower life in danger. This has made the community not to get involved in security issues in the community they live in. This situation has posed a serious threat to the Ghana Police Service and its ability to position itself strategically in order to carry out a perfect investigation to bring the perpetrators into custody and to protect their lives and property, as well as the maintenance of law and order. Due to less data on community participation in the Ghana Police Service, the research adopted an interpretative framework to assess the meaning connoted to community policing from the perspectives of the stakeholders themselves. The qualitative research method was used. There was an engagement of the police and community where focus group discussions and individual in-depth interviews were organized in the randomly selected communities in the district. Key informant interviews were used to solicit views of the people why they are reluctant to give information to the police to help them take the perpetrators to book. In the data collected, it was observed that most of the people have been under threats of offenders after they come back from the prisons, it was also observed that some of the unprofessional police personnel’s expose the whistleblowers who put their lives in danger. The data obtained were analyzed using simple Analytical tool SPSS and Excel. Based on the analysis, it was observed that a high number of people in the communities contacted had not made their mind to participate in any security issues. Based on the views of the community, there should be a high level of professionalism in the recruitment system of the Ghana police service to come out with professional police officers who can abide by the rules and regulations governing the profession.

Keywords: community, bia west, Ghana, participation, police

Procedia PDF Downloads 108

Authors: Terence Soule, Tami Al Ghamdi

Abstract:

To study how to transfer knowledge from multiple source problems to the target problem, we modeled the Transfer Learning (TL) process using Genetic Algorithms as the model solver. TL is the process that aims to transfer learned data from one problem to another problem. The TL process aims to help Machine Learning (ML) algorithms find a solution to the problems. The Genetic Algorithms (GA) give researchers access to information that we have about how the old problem is solved. In this paper, we have five different source problems, and we transfer the knowledge to the target problem. We studied different scenarios of the target problem. The results showed combined knowledge from multiple source problems improves the GA performance. Also, the process of combining knowledge from several problems results in promoting diversity of the transferred population.

Keywords: transfer learning, genetic algorithm, evolutionary computation, source and target

Procedia PDF Downloads 113

Authors: Gordon James Knowles

Abstract:

Historically the Chinatown district in Sandwich Islands has been plagued with the traditional vice crimes of illegal drugs, gambling, and prostitution since the early 1800s. However, a new form of psychologically addictive arcade style table gambling machines has become the dominant form of illegal revenue made in Honolulu, Hawaii. This study attempts to document the drive, desire, or will to play and wager with arcade style video gaming and understand the role of illegal game rooms in facilitating pathological gambling addiction. Indicators of police corruption by Chinese organized crime syndicates related to protection rackets, bribery, and pay-offs were revealed. Information fusion from a police science and sociological intelligence perspective indicates insurgent warfare is being waged on the streets of Honolulu by the People’s Republic of China. This state-sponsored communist terrorism in the Hawaiian Islands used “contactless” irregular warfare entailing: (1) the deployment of psychologically addictive gambling machines, (2) the distribution of the physically addictive fentanyl drug as a lethal chemical weapon, and (3) psychological warfare by circulating pro-China anti-American propaganda newspapers targeted at the small island populace.

Keywords: Chinese and Polynesian organized crime, china daily newspaper, electronic arcade style table games, gaming technology addiction, illegal compulsive gambling, and police intelligence

Procedia PDF Downloads 33

Authors: Ocotlán Díaz-Parra, Jorge A. Ruiz-Vanoye, Alejandro Fuentes-Penna, Beatriz Bernabe-Loranca, Patricia Ambrocio-Cruz, José J. Hernández-Flores

Abstract:

The Maritime Platform Transport Problem of Solid, Special and Dangerous Waste consist of to minimize the monetary value of carry different types of waste from one location to another location using ships. We offer a novel mathematical, the characterization of the problem and the use CPLEX to find the optimal values to solve the Solid, Special and Hazardous Waste Transportation Problem of offshore platforms instances of Mexican state-owned petroleum company (PEMEX). The set of instances used are WTPLib real instances and the tool CPLEX solver to solve the MPTPSSDW problem.

Keywords: oil platform, transport problem, waste, solid waste

Procedia PDF Downloads 441

Authors: Kalpana Dahiya

Abstract:

This paper discusses a two-level hierarchical time minimization transportation problem, which is an important class of transportation problems arising in industries. This problem has been studied by various researchers, and a number of polynomial time iterative algorithms are available to find its solution. All the existing algorithms, though efficient, have some shortcomings. The current study proposes an alternate solution algorithm for the problem that is more efficient in terms of computational time than the existing algorithms. The results justifying the underlying theory of the proposed algorithm are given. Further, a detailed comparison of the computational behaviour of all the algorithms for randomly generated instances of this problem of different sizes validates the efficiency of the proposed algorithm.

Keywords: global optimization, hierarchical optimization, transportation problem, concave minimization

Procedia PDF Downloads 121

Authors: Farzaneh Rajabighamchi, Stan van Hoesel, Christof Defryn

Abstract:

The generalized traveling salesman problem (GTSP) is an extension of the traveling salesman problem (TSP) where the set of nodes is partitioned into clusters, and the salesman must visit exactly one node per cluster. In this research, we apply the definition of the GTSP to an order picker routing problem with multiple locations per product. As such, each product represents a cluster and its corresponding nodes are the locations at which the product can be retrieved. To pick a certain product item from the warehouse, the picker needs to visit one of these locations during its pick tour. As all products are scattered throughout the warehouse, the product clusters not separated geographically. We propose an exact LP model as well as heuristic and meta-heuristic solution algorithms for the order picking problem with multiple product locations.

Keywords: warehouse optimization, order picking problem, generalised travelling salesman problem, heuristic algorithm

Procedia PDF Downloads 80

Authors: Ivan Baravy

Abstract:

Interpolation problem, as it was initially posed in terms of polynomials, is well researched. However, further mathematical developments extended it significantly. Trigonometric interpolation is widely used in Fourier analysis, while its generalized representation as exponential interpolation is applicable to such problem of mathematical physics as modelling of Ziegler-Biersack-Littmark repulsive interatomic potentials. Formulated for finite fields, this problem arises in decoding Reed--Solomon codes. This paper shows the relation between different interpretations of the problem through the class of matrices of special structure - Hankel matrices.

Keywords: Berlekamp-Massey algorithm, exponential interpolation, finite fields, Hankel matrices, Hankel polynomials

Procedia PDF Downloads 483

Authors: Kaycee L. Bills

Abstract:

Adolescents and youth who are members of a minority group are more likely to experience higher rates of bullying in comparison to other student demographics. Specifically, adolescents with intellectual disabilities are a minority population that is more susceptible to experience unfair treatment in social settings. This study employs the 2015 Wave of the National Crime Victimization Survey – School Crime Supplement (NCVS/SCS) longitudinal dataset to explore bullying rates experienced among adolescents with intellectual disabilities. This study uses chi-square testing and a logistic regression to analyze if having a disability influences the likelihood of being bullied in comparison to other student demographics. Results of the chi-square testing and the logistic regression indicate that adolescent students who were identified as having a disability were approximately four times more likely to experience higher bullying rates in comparison to all other majority and minority student populations. Thus, it means having a disability resulted in higher bullying rates in comparison to all student groups.

Keywords: disability, bullying, social work, school bullying

Procedia PDF Downloads 108

Authors: Mahmoud Lot

Abstract:

In this article, we will discuss the solution of elliptic optimal control problem. First, by using the nite element method, we obtain the discrete form of the problem. The obtained discrete problem is actually a large scale constrained optimization problem. Solving this optimization problem with traditional methods is difficult and requires a lot of CPU time and memory. But split Bergman method converts the constrained problem to an unconstrained, and hence it saves time and memory requirement. Then we use the split Bregman method for solving this problem, and examples show the speed and accuracy of split Bregman methods for solving these types of problems. We also use the SQP method for solving the examples and compare with the split Bregman method.

Keywords: Split Bregman Method, optimal control with elliptic partial differential equation constraint, finite element method

Procedia PDF Downloads 115

Authors: Mohsen Ziaee

Abstract:

Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases.

Keywords: scheduling, general flow shop scheduling problem, makespan, heuristic

Procedia PDF Downloads 178

Authors: Cagri Memis, Muzaffer Kapanoglu

Abstract:

The school bus routing problem (SBRP) is a variant of the Vehicle Routing Problem (VRP) classified as a location-allocation-routing problem. In this study, the SBRP is decomposed into two sub-problems: (1) bus route generation and (2) bus stop selection to solve large instances of the SBRP in reasonable computational times. To solve the first sub-problem, we propose a genetic algorithm to generate bus routes. Once the routes have been fixed, a sub-problem remains of allocating students to stops considering the capacity of the buses and the walkability constraints of the students. While the exact method solves small-scale problems, treating large-scale problems with the exact method becomes complex due to computational problems, a deficiency that the genetic algorithm can overcome. Results obtained from the proposed approach on 150 instances up to 250 stops show that the matheuristic algorithm provides better solutions in reasonable computational times with respect to benchmark algorithms.

Keywords: genetic algorithm, matheuristic, school bus routing problem, vehicle routing problem

Procedia PDF Downloads 40

Authors: Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguin

Abstract:

In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behavior of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. We illustrate this approach with 65 instances of the problem from the OR-Library. Moreover, we solve this problem with 40 new binarization techniques and we select the technical with the best results obtained. Finally, we make a comparison between results obtained in previous studies and the new binarization technique, that is, with roulette wheel as transfer function and V3 as discretization technique.

Keywords: binary cat swarm optimization, binarization methods, metaheuristic, set covering problem

Procedia PDF Downloads 367

Authors: Ashraf Shebl, Bassam Garah, Radah Youssef

Abstract:

Sexual assault is usually a hidden crime where the only witnesses are the victim and the assailant. For a variety of reasons, even the victim may be unable to provide a detailed account of the assault or the identity of the perpetrator. Often the case history deteriorates into one person’s word against another. With such limited initial information, the physical and biological evidence collected from the victim, from the crime scene, and from the suspect will play a pivotal role in the objective and scientific reconstruction of the events in question. The aim of work is to examine whether DNA profiles could be recovered from repeated washed clothes after contaminated by semen stains. Fresh semen about 1ml. ( <1 h old) taken from donor was deposited on four types of clothes (cotton, silk, polyester, and jeans). Then leave to dry in room temperature and washed by washing machine at temperature (30°C-60°C) and by hand washing. Some items of clothing were washed once, some twice and others three times. DNA could be extracted from some of these samples even after multiple washing. This study demonstrates that complete DNA profiles can be obtained from washed semen stains on different types of clothes, even after many repeated washing. These results indicated that clothes of the victims must be examined even if they were washed many times.

Keywords: sexual assault, DNA, persistence, clothes

Procedia PDF Downloads 164

Authors: Hernández Eva Selene, Reyna Mary Carmen, Rivera Héctor, Barragán Irving

Abstract:

We propose an approach that jointly addresses the layout of a facility and the scheduling of a sequence of jobs. In real production, these two problems are interrelated. However, they are treated separately in the literature. Our approach is an extension of the job shop problem with transportation delay, where the location of the machines is selected among possible sites. The model minimizes the makespan, using the short processing times rule with two algorithms; the first one considers all the permutations for the location of machines, and the second only a heuristic to select some specific permutations that reduces computational time. Some instances are proved and compared with literature.

Keywords: layout problem, job shop scheduling problem, concurrent scheduling and layout problem, metaheuristic

Procedia PDF Downloads 580

Authors: S. Nasri, H. Bouziri

Abstract:

Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes.

Keywords: dynamic network flow, load dependent transit time, evacuation strategy, earliest arrival flow problem, tabu search metaheuristic

Procedia PDF Downloads 346

Authors: Divyesh Patel, Tanuja Srivastava

Abstract:

This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.

Keywords: discrete tomography, exactly-1-4-adjacency, simulated annealing, binary matrices

Procedia PDF Downloads 374